diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2020-01-30 20:17:32 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2020-01-30 23:58:41 +0900 |
| commit | ce9614515fa863c4a66870f5288e417eceaf9106 (patch) | |
| tree | 46822e581173d96db101d0c8521fa1730cd09602 /src/tools/qgarray.cpp | |
| parent | cd2dc5026e152d6cf57895fe4f41cabdf2bb3eca (diff) | |
| download | tqt-ce9614515fa863c4a66870f5288e417eceaf9106.tar.gz tqt-ce9614515fa863c4a66870f5288e417eceaf9106.zip | |
Removed explicit usage of the 'register' keyword.
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
(cherry picked from commit 99e56ba8db70324cc5c7ab416a3b48171613bd59)
Diffstat (limited to 'src/tools/qgarray.cpp')
| -rw-r--r-- | src/tools/qgarray.cpp | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/src/tools/qgarray.cpp b/src/tools/qgarray.cpp index f2b41e506..5be025841 100644 --- a/src/tools/qgarray.cpp +++ b/src/tools/qgarray.cpp @@ -324,17 +324,17 @@ bool TQGArray::fill( const char *d, int len, uint sz ) if ( sz == 1 ) // 8 bit elements memset( data(), *d, len ); else if ( sz == 4 ) { // 32 bit elements - register TQ_INT32 *x = (TQ_INT32*)data(); + TQ_INT32 *x = (TQ_INT32*)data(); TQ_INT32 v = *((TQ_INT32*)d); while ( len-- ) *x++ = v; } else if ( sz == 2 ) { // 16 bit elements - register TQ_INT16 *x = (TQ_INT16*)data(); + TQ_INT16 *x = (TQ_INT16*)data(); TQ_INT16 v = *((TQ_INT16*)d); while ( len-- ) *x++ = v; } else { // any other size elements - register char *x = data(); + char *x = data(); while ( len-- ) { // more complicated memcpy( x, d, sz ); x += sz; @@ -400,7 +400,7 @@ TQGArray &TQGArray::duplicate( const TQGArray &a ) if ( a.shd == shd ) { // a.duplicate(a) ! if ( shd->count > 1 ) { shd->count--; - register array_data *n = newData(); + array_data *n = newData(); TQ_CHECK_PTR( n ); if ( (n->len=shd->len) ) { n->data = NEW(char,n->len); @@ -605,11 +605,11 @@ int TQGArray::find( const char *d, uint index, uint sz ) const #endif return -1; } - register uint i; + uint i; uint ii; switch ( sz ) { case 1: { // 8 bit elements - register char *x = data() + index; + char *x = data() + index; char v = *d; for ( i=index; i<shd->len; i++ ) { if ( *x++ == v ) @@ -619,7 +619,7 @@ int TQGArray::find( const char *d, uint index, uint sz ) const } break; case 2: { // 16 bit elements - register TQ_INT16 *x = (TQ_INT16*)(data() + index); + TQ_INT16 *x = (TQ_INT16*)(data() + index); TQ_INT16 v = *((TQ_INT16*)d); for ( i=index; i<shd->len; i+=2 ) { if ( *x++ == v ) @@ -629,7 +629,7 @@ int TQGArray::find( const char *d, uint index, uint sz ) const } break; case 4: { // 32 bit elements - register TQ_INT32 *x = (TQ_INT32*)(data() + index); + TQ_INT32 *x = (TQ_INT32*)(data() + index); TQ_INT32 v = *((TQ_INT32*)d); for ( i=index; i<shd->len; i+=4 ) { if ( *x++ == v ) @@ -659,11 +659,11 @@ int TQGArray::find( const char *d, uint index, uint sz ) const int TQGArray::contains( const char *d, uint sz ) const { - register uint i = shd->len; + uint i = shd->len; int count = 0; switch ( sz ) { case 1: { // 8 bit elements - register char *x = data(); + char *x = data(); char v = *d; while ( i-- ) { if ( *x++ == v ) @@ -672,7 +672,7 @@ int TQGArray::contains( const char *d, uint sz ) const } break; case 2: { // 16 bit elements - register TQ_INT16 *x = (TQ_INT16*)data(); + TQ_INT16 *x = (TQ_INT16*)data(); TQ_INT16 v = *((TQ_INT16*)d); i /= 2; while ( i-- ) { @@ -682,7 +682,7 @@ int TQGArray::contains( const char *d, uint sz ) const } break; case 4: { // 32 bit elements - register TQ_INT32 *x = (TQ_INT32*)data(); + TQ_INT32 *x = (TQ_INT32*)data(); TQ_INT32 v = *((TQ_INT32*)d); i /= 4; while ( i-- ) { |