Lines Matching defs:elem
501 * there is no need for an extra elem during map_update.
743 /* if next elem in this hash list is non-zero, just return it */
948 /* elem already exists */
952 /* elem doesn't exist, cannot update it */
1036 * concurrent search will find it before old elem
1093 * concurrent search will find it before old elem
1191 * spinlock because LRU's elem alloc may need
1192 * to remove older elem from htab and this removal
1668 struct htab_elem *elem;
1675 /* try to find next elem in the same bucket */
1681 elem = hlist_nulls_entry_safe(n, struct htab_elem, hash_node);
1682 if (elem)
1683 return elem;
1697 hlist_nulls_for_each_entry_rcu(elem, n, head, hash_node) {
1701 return elem;
1718 struct htab_elem *elem;
1720 elem = bpf_hash_map_seq_find_next(info, NULL);
1721 if (!elem)
1726 return elem;
1738 static int __bpf_hash_map_seq_show(struct seq_file *seq, struct htab_elem *elem)
1750 prog = bpf_iter_get_info(&meta, elem == NULL);
1754 if (elem) {
1756 ctx.key = elem->key;
1758 ctx.value = elem->key + roundup_key_size;
1761 pptr = htab_elem_get_ptr(elem, map->key_size);