Remove use of the deprecated register storage class and unhide the warning.

There is still some usage in mathlib in the HL2SDKs.
This commit is contained in:
Asher Baker 2015-11-04 16:58:58 +00:00 committed by Nicholas Hastings
parent 04306270b2
commit 8f98c73c32
3 changed files with 21 additions and 21 deletions

View File

@ -227,9 +227,9 @@ class SMConfig(object):
if have_clang: if have_clang:
cxx.cxxflags += ['-Wno-implicit-exception-spec-mismatch'] cxx.cxxflags += ['-Wno-implicit-exception-spec-mismatch']
if cxx.version >= 'apple-clang-5.1' or cxx.version >= 'clang-3.4': if cxx.version >= 'apple-clang-5.1' or cxx.version >= 'clang-3.4':
cxx.cxxflags += ['-Wno-deprecated-register'] cxx.cxxflags += ['-Wno-error=deprecated-register']
else: else:
cxx.cxxflags += ['-Wno-deprecated'] cxx.cxxflags += ['-Wno-error=deprecated']
if have_gcc: if have_gcc:
cxx.cflags += ['-mfpmath=sse'] cxx.cflags += ['-mfpmath=sse']

View File

@ -121,7 +121,7 @@ void *MemoryUtils::FindPattern(const void *libPtr, const char *pattern, size_t l
while (ptr < end) while (ptr < end)
{ {
found = true; found = true;
for (register size_t i = 0; i < len; i++) for (size_t i = 0; i < len; i++)
{ {
if (pattern[i] != '\x2A' && pattern[i] != ptr[i]) if (pattern[i] != '\x2A' && pattern[i] != ptr[i])
{ {

View File

@ -180,7 +180,7 @@ inline MTRand::uint32 MTRand::randInt()
if( left == 0 ) reload(); if( left == 0 ) reload();
--left; --left;
register uint32 s1; uint32 s1;
s1 = *pNext++; s1 = *pNext++;
s1 ^= (s1 >> 11); s1 ^= (s1 >> 11);
s1 ^= (s1 << 7) & 0x9d2c5680UL; s1 ^= (s1 << 7) & 0x9d2c5680UL;
@ -225,9 +225,9 @@ inline void MTRand::seed( uint32 *const bigSeed, const uint32 seedLength )
// in each element are discarded. // in each element are discarded.
// Just call seed() if you want to get array from /dev/urandom // Just call seed() if you want to get array from /dev/urandom
initialize(19650218UL); initialize(19650218UL);
register int i = 1; int i = 1;
register uint32 j = 0; uint32 j = 0;
register int k = ( N > seedLength ? N : seedLength ); int k = ( N > seedLength ? N : seedLength );
for( ; k; --k ) for( ; k; --k )
{ {
state[i] = state[i] =
@ -262,9 +262,9 @@ inline void MTRand::seed()
if( urandom ) if( urandom )
{ {
uint32 bigSeed[N]; uint32 bigSeed[N];
register uint32 *s = bigSeed; uint32 *s = bigSeed;
register int i = N; int i = N;
register bool success = true; bool success = true;
while( success && i-- ) while( success && i-- )
success = fread( s++, sizeof(uint32), 1, urandom ); success = fread( s++, sizeof(uint32), 1, urandom );
fclose(urandom); fclose(urandom);
@ -282,9 +282,9 @@ inline void MTRand::initialize( const uint32 seed )
// See Knuth TAOCP Vol 2, 3rd Ed, p.106 for multiplier. // See Knuth TAOCP Vol 2, 3rd Ed, p.106 for multiplier.
// In previous versions, most significant bits (MSBs) of the seed affect // In previous versions, most significant bits (MSBs) of the seed affect
// only MSBs of the state array. Modified 9 Jan 2002 by Makoto Matsumoto. // only MSBs of the state array. Modified 9 Jan 2002 by Makoto Matsumoto.
register uint32 *s = state; uint32 *s = state;
register uint32 *r = state; uint32 *r = state;
register int i = 1; int i = 1;
*s++ = seed & 0xffffffffUL; *s++ = seed & 0xffffffffUL;
for( ; i < N; ++i ) for( ; i < N; ++i )
{ {
@ -298,8 +298,8 @@ inline void MTRand::reload()
{ {
// Generate N new values in state // Generate N new values in state
// Made clearer and faster by Matthew Bellew (matthew.bellew@home.com) // Made clearer and faster by Matthew Bellew (matthew.bellew@home.com)
register uint32 *p = state; uint32 *p = state;
register int i; int i;
for( i = N - M; i--; ++p ) for( i = N - M; i--; ++p )
*p = twist( p[M], p[0], p[1] ); *p = twist( p[M], p[0], p[1] );
for( i = M; --i; ++p ) for( i = M; --i; ++p )
@ -338,9 +338,9 @@ inline MTRand::uint32 MTRand::hash( time_t t, clock_t c )
inline void MTRand::save( uint32* saveArray ) const inline void MTRand::save( uint32* saveArray ) const
{ {
register uint32 *sa = saveArray; uint32 *sa = saveArray;
register const uint32 *s = state; const uint32 *s = state;
register int i = N; int i = N;
for( ; i--; *sa++ = *s++ ) {} for( ; i--; *sa++ = *s++ ) {}
*sa = left; *sa = left;
} }
@ -348,9 +348,9 @@ inline void MTRand::save( uint32* saveArray ) const
inline void MTRand::load( uint32 *const loadArray ) inline void MTRand::load( uint32 *const loadArray )
{ {
register uint32 *s = state; uint32 *s = state;
register uint32 *la = loadArray; uint32 *la = loadArray;
register int i = N; int i = N;
for( ; i--; *s++ = *la++ ) {} for( ; i--; *s++ = *la++ ) {}
left = *la; left = *la;
pNext = &state[N-left]; pNext = &state[N-left];