kernel/bpf/hashtab.c

233 		struct htab_elem *elem;
235 		elem = get_htab_elem(htab, i);
238 					   elem->key + round_up(htab->map.key_size, 8));
241 					       elem->key + round_up(htab->map.key_size, 8));
256 		struct htab_elem *elem;
258 		elem = get_htab_elem(htab, i);
260 			void __percpu *pptr = htab_elem_get_ptr(elem, htab->map.key_size);
268 			bpf_obj_free_fields(htab->map.record, elem->key + round_up(htab->map.key_size, 8));
582 			 * there is no need for an extra elem during map_update.
785 				  struct htab_elem *elem)
788 		void __percpu *pptr = htab_elem_get_ptr(elem, htab->map.key_size);
794 		void *map_value = elem->key + round_up(htab->map.key_size, 8);
865 		/* if next elem in this hash list is non-zero, just return it */
987 			else /* Since elem is preallocated, we cannot touch special fields */
1086 		/* elem already exists */
1090 		/* elem doesn't exist, cannot update it */
1177 	 * concurrent search will find it before old elem
1193 static void htab_lru_push_free(struct bpf_htab *htab, struct htab_elem *elem)
1195 	check_and_free_fields(htab, elem);
1197 	bpf_lru_push_free(&htab->lru, &elem->lru_node);
1247 	 * concurrent search will find it before old elem
1350 	 * spinlock because LRU's elem alloc may need
1351 	 * to remove older elem from htab and this removal
2002 	struct htab_elem *elem;
2009 	/* try to find next elem in the same bucket */
2015 		elem = hlist_nulls_entry_safe(n, struct htab_elem, hash_node);
2016 		if (elem)
2017 			return elem;
2031 		hlist_nulls_for_each_entry_rcu(elem, n, head, hash_node) {
2035 				return elem;
2052 	struct htab_elem *elem;
2054 	elem = bpf_hash_map_seq_find_next(info, NULL);
2055 	if (!elem)
2060 	return elem;
2072 static int __bpf_hash_map_seq_show(struct seq_file *seq, struct htab_elem *elem)
2084 	prog = bpf_iter_get_info(&meta, elem == NULL);
2088 		if (elem) {
2090 			ctx.key = elem->key;
2092 				ctx.value = elem->key + roundup_key_size;
2095 				pptr = htab_elem_get_ptr(elem, map->key_size);
2176 	struct htab_elem *elem;
2200 		hlist_nulls_for_each_entry_rcu(elem, n, head, hash_node) {
2201 			key = elem->key;
2204 				pptr = htab_elem_get_ptr(elem, map->key_size);
2207 				val = elem->key + roundup_key_size;