diff options
Diffstat (limited to 'lib/gl_linkedhash_list.c')
-rw-r--r-- | lib/gl_linkedhash_list.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/lib/gl_linkedhash_list.c b/lib/gl_linkedhash_list.c index fb6fbec..2f4e05f 100644 --- a/lib/gl_linkedhash_list.c +++ b/lib/gl_linkedhash_list.c @@ -1,5 +1,5 @@ /* Sequential list data type implemented by a hash table with a linked list. - Copyright (C) 2006, 2008-2011 Free Software Foundation, Inc. + Copyright (C) 2006, 2008-2013 Free Software Foundation, Inc. Written by Bruno Haible <bruno@clisp.org>, 2006. This program is free software: you can redistribute it and/or modify @@ -43,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; @@ -53,7 +53,7 @@ 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 bucket = node->h.hashcode % list->table_size; @@ -65,7 +65,7 @@ add_to_bucket (gl_list_t list, gl_list_node_t node) #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 bucket = node->h.hashcode % list->table_size; |