36   struct dummy_lhash_node *cur, *next;  in dummy_lh_free()  local
38   for (cur = lh->head; cur != NULL; cur = next) {  in dummy_lh_free()
39     next = cur->next;  in dummy_lh_free()
40     free(cur->s);  in dummy_lh_free()
41     free(cur);  in dummy_lh_free()
47   struct dummy_lhash_node *cur;  in dummy_lh_num_items()  local
49   for (cur = lh->head; cur != NULL; cur = cur->next) {  in dummy_lh_num_items()
57   struct dummy_lhash_node *cur;  in dummy_lh_retrieve()  local
59   for (cur = lh->head; cur != NULL; cur = cur->next) {  in dummy_lh_retrieve()
60     if (strcmp(cur->s, s) == 0) {  in dummy_lh_retrieve()
61       return cur->s;  in dummy_lh_retrieve()
69   struct dummy_lhash_node *node, *cur;  in dummy_lh_insert()  local
71   for (cur = lh->head; cur != NULL; cur = cur->next) {  in dummy_lh_insert()
72     if (strcmp(cur->s, s) == 0) {  in dummy_lh_insert()
73       *old_data = cur->s;  in dummy_lh_insert()
74       cur->s = s;  in dummy_lh_insert()
88   struct dummy_lhash_node *cur, **next_ptr;  in dummy_lh_delete()  local
92   for (cur = lh->head; cur != NULL; cur = cur->next) {  in dummy_lh_delete()
93     if (strcmp(cur->s, s) == 0) {  in dummy_lh_delete()
94       ret = cur->s;  in dummy_lh_delete()
95       *next_ptr = cur->next;  in dummy_lh_delete()
96       free(cur);  in dummy_lh_delete()
99     next_ptr = &cur->next;  in dummy_lh_delete()