@@ -34,8 +34,8 @@ typedef struct hash_entry_t hash_entry_t;
3434
3535int create_hashtable (hash_table_t * table , size_t initial_size ,
3636 hash_func_t hashfunc , hash_cmp_t keycmp ) {
37- hash_entry_t * newtable ;
38- int entries_per_page ;
37+ hash_entry_t * newtable = NULL ;
38+ int entries_per_page = 0 ;
3939
4040 entries_per_page = gotcha_getpagesize () / sizeof (hash_entry_t );
4141 if (initial_size % entries_per_page )
@@ -86,9 +86,9 @@ static hash_entry_t *insert(hash_table_t *table, hash_key_t key,
8686}
8787
8888int grow_hashtable (hash_table_t * table , size_t new_size ) {
89- hash_table_t newtable ;
90- hash_entry_t * result ;
91- size_t i ;
89+ hash_table_t newtable = EMPTY_HASH_TABLE ;
90+ hash_entry_t * result = NULL ;
91+ size_t i = 0 ;
9292
9393 newtable .table_size = new_size ;
9494 newtable .entry_count = 0 ;
@@ -126,8 +126,8 @@ int destroy_hashtable(hash_table_t *table) {
126126}
127127
128128static int lookup (hash_table_t * table , hash_key_t key , hash_entry_t * * entry ) {
129- size_t index , startindex ;
130- hash_hashvalue_t hashval ;
129+ size_t index = 0 , startindex = 0 ;
130+ hash_hashvalue_t hashval = 0 ;
131131
132132 hashval = table -> hashfunc (key );
133133 index = hashval % table -> table_size ;
@@ -149,8 +149,8 @@ static int lookup(hash_table_t *table, hash_key_t key, hash_entry_t **entry) {
149149}
150150
151151int lookup_hashtable (hash_table_t * table , hash_key_t key , hash_data_t * data ) {
152- hash_entry_t * entry ;
153- int result ;
152+ hash_entry_t * entry = NULL ;
153+ int result = 0 ;
154154
155155 result = lookup (table , key , & entry );
156156 if (result == -1 ) return -1 ;
@@ -159,10 +159,10 @@ int lookup_hashtable(hash_table_t *table, hash_key_t key, hash_data_t *data) {
159159}
160160
161161int addto_hashtable (hash_table_t * table , hash_key_t key , hash_data_t data ) {
162- size_t newsize ;
163- int result ;
164- hash_hashvalue_t val ;
165- hash_entry_t * entry ;
162+ size_t newsize = 0 ;
163+ int result = 0 ;
164+ hash_hashvalue_t val = 0 ;
165+ hash_entry_t * entry = NULL ;
166166
167167 newsize = table -> table_size ;
168168 while (table -> entry_count > newsize / 2 ) newsize *= 2 ;
@@ -179,8 +179,8 @@ int addto_hashtable(hash_table_t *table, hash_key_t key, hash_data_t data) {
179179}
180180
181181int removefrom_hashtable (hash_table_t * table , hash_key_t key ) {
182- hash_entry_t * entry ;
183- int result ;
182+ hash_entry_t * entry = NULL ;
183+ int result = 0 ;
184184
185185 result = lookup (table , key , & entry );
186186 if (result == -1 ) return -1 ;
@@ -202,8 +202,8 @@ int removefrom_hashtable(hash_table_t *table, hash_key_t key) {
202202int foreach_hash_entry (hash_table_t * table , void * opaque ,
203203 int (* cb )(hash_key_t key , hash_data_t data ,
204204 void * opaque )) {
205- int result ;
206- struct hash_entry_t * i ;
205+ int result = 0 ;
206+ struct hash_entry_t * i = NULL ;
207207 for (i = table -> head ; i != NULL ; i = i -> next ) {
208208 result = cb (i -> key , i -> data , opaque );
209209 if (result != 0 ) return result ; // GCOVR_EXCL_LINE
@@ -213,7 +213,7 @@ int foreach_hash_entry(hash_table_t *table, void *opaque,
213213
214214hash_hashvalue_t strhash (const char * str ) {
215215 unsigned long hash = 5381 ;
216- int c ;
216+ int c = 0 ;
217217
218218 while ((c = * str ++ )) hash = hash * 33 + c ;
219219
0 commit comments