X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_linkedhash_list.c;h=2f4e05f3a7b9638485555fad8753b3ba7187186e;hb=41d1b6c42641a5b9e21486ca2074198ee7909bd7;hp=73c2f448aeb91e394719faa47c7427fa46300536;hpb=fca2f939ea0d8831cd89f89df4b52a9a47c210f2;p=gnulib.git diff --git a/lib/gl_linkedhash_list.c b/lib/gl_linkedhash_list.c index 73c2f448a..2f4e05f3a 100644 --- a/lib/gl_linkedhash_list.c +++ b/lib/gl_linkedhash_list.c @@ -1,11 +1,11 @@ /* Sequential list data type implemented by a hash table with a linked list. - Copyright (C) 2006 Free Software Foundation, Inc. + Copyright (C) 2006, 2008-2013 Free Software Foundation, Inc. Written by Bruno Haible , 2006. - This program is free software; you can redistribute it and/or modify + This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. + the Free Software Foundation; either version 3 of the License, or + (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of @@ -13,8 +13,7 @@ GNU General Public License for more details. You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software Foundation, - Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ + along with this program. If not, see . */ #include @@ -24,7 +23,6 @@ #include /* for SIZE_MAX */ #include -#include "xalloc.h" #include "xsize.h" #ifndef uintptr_t @@ -45,7 +43,7 @@ #include "gl_anyhash_list2.h" /* Resize the hash table if needed, after list->count was incremented. */ -static inline void +static void hash_resize_after_add (gl_list_t list) { size_t count = list->count; @@ -55,33 +53,35 @@ hash_resize_after_add (gl_list_t list) } /* Add a node to the hash table structure. */ -static inline void +static void add_to_bucket (gl_list_t list, gl_list_node_t node) { - size_t index = node->h.hashcode % list->table_size; + size_t bucket = node->h.hashcode % list->table_size; - node->h.hash_next = list->table[index]; - list->table[index] = &node->h; + node->h.hash_next = list->table[bucket]; + list->table[bucket] = &node->h; } +/* Tell all compilers that the return value is 0. */ +#define add_to_bucket(list,node) ((add_to_bucket) (list, node), 0) /* Remove a node from the hash table structure. */ -static inline void +static void remove_from_bucket (gl_list_t list, gl_list_node_t node) { - size_t index = node->h.hashcode % list->table_size; + size_t bucket = node->h.hashcode % list->table_size; gl_hash_entry_t *p; - for (p = &list->table[index]; ; p = &(*p)->hash_next) + for (p = &list->table[bucket]; ; p = &(*p)->hash_next) { if (*p == &node->h) - { - *p = node->h.hash_next; - break; - } + { + *p = node->h.hash_next; + break; + } if (*p == NULL) - /* node is not in the right bucket. Did the hash codes - change inadvertently? */ - abort (); + /* node is not in the right bucket. Did the hash codes + change inadvertently? */ + abort (); } } @@ -91,21 +91,22 @@ remove_from_bucket (gl_list_t list, gl_list_node_t node) const struct gl_list_implementation gl_linkedhash_list_implementation = { - gl_linked_create_empty, - gl_linked_create, + gl_linked_nx_create_empty, + gl_linked_nx_create, gl_linked_size, gl_linked_node_value, + gl_linked_node_nx_set_value, gl_linked_next_node, gl_linked_previous_node, gl_linked_get_at, - gl_linked_set_at, + gl_linked_nx_set_at, gl_linked_search_from_to, gl_linked_indexof_from_to, - gl_linked_add_first, - gl_linked_add_last, - gl_linked_add_before, - gl_linked_add_after, - gl_linked_add_at, + gl_linked_nx_add_first, + gl_linked_nx_add_last, + gl_linked_nx_add_before, + gl_linked_nx_add_after, + gl_linked_nx_add_at, gl_linked_remove_node, gl_linked_remove_at, gl_linked_remove, @@ -118,6 +119,6 @@ const struct gl_list_implementation gl_linkedhash_list_implementation = gl_linked_sortedlist_search_from_to, gl_linked_sortedlist_indexof, gl_linked_sortedlist_indexof_from_to, - gl_linked_sortedlist_add, + gl_linked_sortedlist_nx_add, gl_linked_sortedlist_remove };