127   struct curl_llist_element *le;  in Curl_hash_add()  local
130   for(le = l->head; le; le = le->next) {  in Curl_hash_add()
131     he = (struct curl_hash_element *) le->ptr;  in Curl_hash_add()
133       Curl_llist_remove(l, le, (void *)h);  in Curl_hash_add()
161   struct curl_llist_element *le;  in Curl_hash_delete()  local
165   for(le = l->head; le; le = le->next) {  in Curl_hash_delete()
166     he = le->ptr;  in Curl_hash_delete()
168       Curl_llist_remove(l, le, (void *) h);  in Curl_hash_delete()
179   struct curl_llist_element *le;  in Curl_hash_pick()  local
185     for(le = l->head; le; le = le->next) {  in Curl_hash_pick()
186       he = le->ptr;  in Curl_hash_pick()
201   struct curl_llist_element  *le;  in Curl_hash_apply()  local
205     for(le = (h->table[i])->head;  in Curl_hash_apply()
206         le;  in Curl_hash_apply()
207         le = le->next) {  in Curl_hash_apply()
208       curl_hash_element *el = le->ptr;  in Curl_hash_apply()
248   struct curl_llist_element *le;  in Curl_hash_clean_with_criterium()  local
258     le = list->head; /* get first list entry */  in Curl_hash_clean_with_criterium()
259     while(le) {  in Curl_hash_clean_with_criterium()
260       struct curl_hash_element *he = le->ptr;  in Curl_hash_clean_with_criterium()
261       lnext = le->next;  in Curl_hash_clean_with_criterium()
264         Curl_llist_remove(list, le, (void *) h);  in Curl_hash_clean_with_criterium()
267       le = lnext;  in Curl_hash_clean_with_criterium()