* doc/bison.texinfo (How Can I Reset the Parser): More about start

[bison.git] / lib / hash.c

diff --git a/lib/hash.c b/lib/hash.c
index 0dc37d9804a3069ab5b363177dc872b207cb3957..7373a011ceceef9f94faa1c5a55d1409139b7e52 100644 (file)
--- a/lib/hash.c
+++ b/lib/hash.c
@@ -1,5 +1,8 @@
 /* hash - hashing table processing.
 /* hash - hashing table processing.

-   Copyright (C) 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
+
+   Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 Free Software
+   Foundation, Inc.
+

    Written by Jim Meyering, 1992.
 
    This program is free software; you can redistribute it and/or modify
    Written by Jim Meyering, 1992.
 
    This program is free software; you can redistribute it and/or modify


@@ -27,11 +30,9 @@
 #if HAVE_STDLIB_H
 # include <stdlib.h>
 #endif
 #if HAVE_STDLIB_H
 # include <stdlib.h>
 #endif

-#if HAVE_STDBOOL_H
-# include <stdbool.h>
-#else
-typedef enum {false = 0, true = 1} bool;
-#endif
+
+#include <limits.h>
+#include <stdbool.h>

 #include <stdio.h>
 
 #ifndef HAVE_DECL_FREE
 #include <stdio.h>
 
 #ifndef HAVE_DECL_FREE


@@ -262,7 +263,7 @@ hash_lookup (const Hash_table *table, const void *entry)
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 

-  if (table->bucket_limit <= bucket)
+  if (! (bucket < table->bucket_limit))

     abort ();
 
   if (bucket->data == NULL)
     abort ();
 
   if (bucket->data == NULL)


@@ -293,7 +294,7 @@ hash_get_first (const Hash_table *table)
     return NULL;
 
   for (bucket = table->bucket; ; bucket++)
     return NULL;
 
   for (bucket = table->bucket; ; bucket++)

-    if (table->bucket_limit <= bucket)
+    if (! (bucket < table->bucket_limit))

       abort ();
     else if (bucket->data)
       return bucket->data;
       abort ();
     else if (bucket->data)
       return bucket->data;


@@ -310,7 +311,7 @@ hash_get_next (const Hash_table *table, const void *entry)
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 

-  if (table->bucket_limit <= bucket)
+  if (! (bucket < table->bucket_limit))

     abort ();
 
   /* Find next entry in the same bucket.  */
     abort ();
 
   /* Find next entry in the same bucket.  */


@@ -403,9 +404,6 @@ hash_do_for_each (const Hash_table *table, Hash_processor processor,
 unsigned
 hash_string (const char *string, unsigned n_buckets)
 {
 unsigned
 hash_string (const char *string, unsigned n_buckets)
 {

-# ifndef CHAR_BIT
-#  define CHAR_BIT 8
-# endif

 # define ROTATE_LEFT(Value, Shift) \
   ((Value) << (Shift) | (Value) >> ((sizeof (unsigned) * CHAR_BIT) - (Shift)))
 # define HASH_ONE_CHAR(Value, Byte) \
 # define ROTATE_LEFT(Value, Shift) \
   ((Value) << (Shift) | (Value) >> ((sizeof (unsigned) * CHAR_BIT) - (Shift)))
 # define HASH_ONE_CHAR(Value, Byte) \


@@ -754,7 +752,7 @@ hash_find_entry (Hash_table *table, const void *entry,
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 
     = table->bucket + table->hasher (entry, table->n_buckets);
   struct hash_entry *cursor;
 

-  if (table->bucket_limit <= bucket)
+  if (! (bucket < table->bucket_limit))

     abort ();
 
   *bucket_head = bucket;
     abort ();
 
   *bucket_head = bucket;


@@ -850,7 +848,7 @@ hash_rehash (Hash_table *table, unsigned candidate)
            = (new_table->bucket
               + new_table->hasher (data, new_table->n_buckets));
 
            = (new_table->bucket
               + new_table->hasher (data, new_table->n_buckets));
 

-         if (new_table->bucket_limit <= new_bucket)
+         if (! (new_bucket < new_table->bucket_limit))

            abort ();
 
          next = cursor->next;
            abort ();
 
          next = cursor->next;