131 	struct htab_elem *l;  in lookup_elem_raw()  local
133 	hlist_for_each_entry_rcu(l, head, hash_node)  in lookup_elem_raw()
134 		if (l->hash == hash && !memcmp(&l->key, key, key_size))  in lookup_elem_raw()
135 			return l;  in lookup_elem_raw()
145 	struct htab_elem *l;  in htab_map_lookup_elem()  local
157 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_lookup_elem()
159 	if (l)  in htab_map_lookup_elem()
160 		return l->key + round_up(map->key_size, 8);  in htab_map_lookup_elem()
170 	struct htab_elem *l, *next_l;  in htab_map_get_next_key()  local
186 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_get_next_key()
188 	if (!l)  in htab_map_get_next_key()
192 	next_l = hlist_entry_safe(rcu_dereference_raw(hlist_next_rcu(&l->hash_node)),  in htab_map_get_next_key()
304 	struct htab_elem *l;  in htab_map_delete_elem()  local
319 	l = lookup_elem_raw(head, hash, key, key_size);  in htab_map_delete_elem()
321 	if (l) {  in htab_map_delete_elem()
322 		hlist_del_rcu(&l->hash_node);  in htab_map_delete_elem()
324 		kfree_rcu(l, rcu);  in htab_map_delete_elem()
339 		struct htab_elem *l;  in delete_all_elements()  local
341 		hlist_for_each_entry_safe(l, n, head, hash_node) {  in delete_all_elements()
342 			hlist_del_rcu(&l->hash_node);  in delete_all_elements()
344 			kfree(l);  in delete_all_elements()