Changeset ee06db5c for libcfa

Timestamp:

Jun 9, 2020, 3:45:39 PM (4 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

280ec46, 97392b69

Parents:

b54118a

Message:

change algorithm for computing all0s in the bit-manipulation routines

File:

• libcfa/src/bitmanip.hfa (modified) (2 diffs)

libcfa/src/bitmanip.hfa

@@ -11 +11 @@
 // Created On       : Sat Mar 14 18:12:27 2020
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sun Apr 19 22:29:58 2020
-// Update Count     : 121
+// Last Modified On : Tue Jun  9 15:14:04 2020
+// Update Count     : 123
 // 
 
@@ -48 +48 @@
 
         // Count all 0 bits.
-        unsigned int all0s( unsigned char n ) { return __bitsizeof(n) - __builtin_popcount( n ); }
-        unsigned int all0s( unsigned short int n ) { return __bitsizeof(n) - __builtin_popcount( n ); }
-        unsigned int all0s( unsigned int n ) { return __bitsizeof(n) - __builtin_popcount( n ); }
-        unsigned int all0s( unsigned long int n ) { return __bitsizeof(n) - __builtin_popcountl( n ); }
-        unsigned int all0s( unsigned long long int n ) { return __bitsizeof(n) - __builtin_popcountll( n ); }
+        unsigned int all0s( unsigned char n ) { return __builtin_popcount( (typeof(n))~n ); }
+        unsigned int all0s( unsigned short int n ) { return __builtin_popcount( (typeof(n))~n ); }
+        unsigned int all0s( unsigned int n ) { return __builtin_popcount( ~n ); }
+        unsigned int all0s( unsigned long int n ) { return __builtin_popcountl( ~n ); }
+        unsigned int all0s( unsigned long long int n ) { return __builtin_popcountll( ~n ); }
 
         // Find least significiant zero bit. (ffs)