Home
last modified time | relevance | path

Searched refs:hash_node (Results 1 – 2 of 2) sorted by relevance

/kernel/bpf/
Dhashtab.c113 struct hlist_nulls_node hash_node; member
418 offsetof(struct htab_elem, hash_node.pprev)); in htab_map_alloc_check()
625 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node) in lookup_elem_raw()
644 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node) in lookup_nulls_elem_raw()
797 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node) in htab_lru_map_delete_node()
799 hlist_nulls_del_rcu(&l->hash_node); in htab_lru_map_delete_node()
836 next_l = hlist_nulls_entry_safe(rcu_dereference_raw(hlist_nulls_next_rcu(&l->hash_node)), in htab_map_get_next_key()
837 struct htab_elem, hash_node); in htab_map_get_next_key()
856 struct htab_elem, hash_node); in htab_map_get_next_key()
1151 hlist_nulls_add_head_rcu(&l_new->hash_node, head); in htab_map_update_elem()
[all …]
/kernel/
Dworkqueue.c189 struct hlist_node hash_node; /* PL: unbound_pool_hash node */ member
3481 INIT_HLIST_NODE(&pool->hash_node); in init_worker_pool()
3594 hash_del(&pool->hash_node); in put_unbound_pool()
3652 hash_for_each_possible(unbound_pool_hash, pool, hash_node, hash) { in get_unbound_pool()
3693 hash_add(unbound_pool_hash, &pool->hash_node, hash); in get_unbound_pool()
6129 hash_for_each(unbound_pool_hash, bkt, pool, hash_node) in workqueue_init()