111 	struct htab_elem *l;  in lookup_elem_raw()  local
113 	hlist_for_each_entry_rcu(l, head, hash_node)  in lookup_elem_raw()
114 		if (l->hash == hash && !memcmp(&l->key, key, key_size))  in lookup_elem_raw()
115 			return l;  in lookup_elem_raw()
125 	struct htab_elem *l;  in htab_map_lookup_elem()  local
137 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_lookup_elem()
139 	if (l)  in htab_map_lookup_elem()
140 		return l->key + round_up(map->key_size, 8);  in htab_map_lookup_elem()
150 	struct htab_elem *l, *next_l;  in htab_map_get_next_key()  local
163 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_get_next_key()
165 	if (!l) {  in htab_map_get_next_key()
171 	next_l = hlist_entry_safe(rcu_dereference_raw(hlist_next_rcu(&l->hash_node)),  in htab_map_get_next_key()
283 	struct htab_elem *l;  in htab_map_delete_elem()  local
298 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_delete_elem()
300 	if (l) {  in htab_map_delete_elem()
301 		hlist_del_rcu(&l->hash_node);  in htab_map_delete_elem()
303 		kfree_rcu(l, rcu);  in htab_map_delete_elem()
318 		struct htab_elem *l;  in delete_all_elements()  local
320 		hlist_for_each_entry_safe(l, n, head, hash_node) {  in delete_all_elements()
321 			hlist_del_rcu(&l->hash_node);  in delete_all_elements()
323 			kfree(l);  in delete_all_elements()