Ticket #145: hash.h.patch

gnugo/engine/hash.h

@@ -87 +87 @@
 #define INIT_ZOBRIST_ARRAY(a) \
   hash_init_zobrist_array(a, (int) (sizeof(a) / sizeof(a[0])))
 
-void hashdata_clear(Hash_data *hd);
+inline void hashdata_clear(Hash_data *hd);
 void hashdata_recalc(Hash_data *hd, Intersection *board, int ko_pos);
-void hashdata_invert_ko(Hash_data *hd, int pos);
-void hashdata_invert_stone(Hash_data *hd, int pos, int color);
-void hashdata_invert_komaster(Hash_data *hd, int komaster);
-void hashdata_invert_kom_pos(Hash_data *hd, int kom_pos);
+inline void hashdata_invert_ko(Hash_data *hd, int pos);
+inline void hashdata_invert_stone(Hash_data *hd, int pos, int color);
+inline void hashdata_invert_komaster(Hash_data *hd, int komaster);
+inline void hashdata_invert_kom_pos(Hash_data *hd, int kom_pos);
 
 char *hashdata_to_string(Hash_data *hashdata);
 
@@ -100 +100 @@
 
 /* ---------------------------------------------------------------- */
 
-/* There is no need to involve all bits in the remainder computation
- * as long as we only use it to compute a key into a hash table. 32
- * random bits are sufficient to get an even distribution within any
- * hashtable of reasonable size. By never using more than 32 bits we
- * also reduce the platform dependency of the GNU Go engine.
-*/
+/* Calculates a place in the transposition table where to look up for
+   a hash value. If sizeof(long) > sizeof(int) we truncate long to int
+   because size of the transposition table wouldn't be greater than
+   int. */
 #define hashdata_remainder(hd, num) \
-  (((hd).hashval[0] & 0xffffffffU) % (num))
+  (*((unsigned int*)((hd).hashval)) % (num))
+
 
 #if NUM_HASHVALUES == 1
 
@@ -139 +138 @@
 #define hashdata_xor(hd1, hd2) \
    do { \
     int i; \
-    for (i = 0; i < NUM_HASHVALUES; i++) \
+    for (i = 0; i < NUM_HASHVALUES; ++i) \
       (hd1).hashval[i] ^= (hd2).hashval[i]; \
    } while (0)