(hash_get_next): Fix a thinko: when ENTRY is the

last one in a bucket, advance to the next bucket.
From Alexandre Duret-Lutz.

diff --git a/lib/hash.c b/lib/hash.c
index 02b327fc2b08fadf122527af0f2f29fae7c72e36..8438143a87823a4ff0dd6186cdda98d75263a24c 100644 (file)
--- a/lib/hash.c
+++ b/lib/hash.c
@@ -267,7 +267,7 @@ hash_get_first (const Hash_table *table)
 
 /* Return the user data for the entry following ENTRY, where ENTRY has been
    returned by a previous call to either `hash_get_first' or `hash_get_next'.
-   Return NULL if there is no more entries.  */
+   Return NULL if there are no more entries.  */
 
 void *
 hash_get_next (const Hash_table *table, const void *entry)
@@ -284,7 +284,7 @@ hash_get_next (const Hash_table *table, const void *entry)
       return cursor->next->data;
 
   /* Find first entry in any subsequent bucket.  */
-  for (; bucket < table->bucket_limit; bucket++)
+  while (++bucket < table->bucket_limit)
     if (bucket->data)
       return bucket->data;