1 // SPDX-License-Identifier: GPL-2.0-only
2 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 * Copyright (c) 2016 Facebook
7 #include <linux/jhash.h>
8 #include <linux/filter.h>
9 #include <linux/rculist_nulls.h>
10 #include <linux/random.h>
11 #include <uapi/linux/btf.h>
12 #include <linux/rcupdate_trace.h>
13 #include <linux/btf_ids.h>
14 #include "percpu_freelist.h"
15 #include "bpf_lru_list.h"
16 #include "map_in_map.h"
17 #include <linux/bpf_mem_alloc.h>
19 #define HTAB_CREATE_FLAG_MASK \
20 (BPF_F_NO_PREALLOC | BPF_F_NO_COMMON_LRU | BPF_F_NUMA_NODE | \
21 BPF_F_ACCESS_MASK | BPF_F_ZERO_SEED)
23 #define BATCH_OPS(_name) \
25 _name##_map_lookup_batch, \
26 .map_lookup_and_delete_batch = \
27 _name##_map_lookup_and_delete_batch, \
29 generic_map_update_batch, \
31 generic_map_delete_batch
34 * The bucket lock has two protection scopes:
36 * 1) Serializing concurrent operations from BPF programs on different
39 * 2) Serializing concurrent operations from BPF programs and sys_bpf()
41 * BPF programs can execute in any context including perf, kprobes and
42 * tracing. As there are almost no limits where perf, kprobes and tracing
43 * can be invoked from the lock operations need to be protected against
44 * deadlocks. Deadlocks can be caused by recursion and by an invocation in
45 * the lock held section when functions which acquire this lock are invoked
46 * from sys_bpf(). BPF recursion is prevented by incrementing the per CPU
47 * variable bpf_prog_active, which prevents BPF programs attached to perf
48 * events, kprobes and tracing to be invoked before the prior invocation
49 * from one of these contexts completed. sys_bpf() uses the same mechanism
50 * by pinning the task to the current CPU and incrementing the recursion
51 * protection across the map operation.
53 * This has subtle implications on PREEMPT_RT. PREEMPT_RT forbids certain
54 * operations like memory allocations (even with GFP_ATOMIC) from atomic
55 * contexts. This is required because even with GFP_ATOMIC the memory
56 * allocator calls into code paths which acquire locks with long held lock
57 * sections. To ensure the deterministic behaviour these locks are regular
58 * spinlocks, which are converted to 'sleepable' spinlocks on RT. The only
59 * true atomic contexts on an RT kernel are the low level hardware
60 * handling, scheduling, low level interrupt handling, NMIs etc. None of
61 * these contexts should ever do memory allocations.
63 * As regular device interrupt handlers and soft interrupts are forced into
64 * thread context, the existing code which does
65 * spin_lock*(); alloc(GFP_ATOMIC); spin_unlock*();
68 * In theory the BPF locks could be converted to regular spinlocks as well,
69 * but the bucket locks and percpu_freelist locks can be taken from
70 * arbitrary contexts (perf, kprobes, tracepoints) which are required to be
71 * atomic contexts even on RT. These mechanisms require preallocated maps,
72 * so there is no need to invoke memory allocations within the lock held
75 * BPF maps which need dynamic allocation are only used from (forced)
76 * thread context on RT and can therefore use regular spinlocks which in
77 * turn allows to invoke memory allocations from the lock held section.
79 * On a non RT kernel this distinction is neither possible nor required.
80 * spinlock maps to raw_spinlock and the extra code is optimized out by the
84 struct hlist_nulls_head head;
86 raw_spinlock_t raw_lock;
91 #define HASHTAB_MAP_LOCK_COUNT 8
92 #define HASHTAB_MAP_LOCK_MASK (HASHTAB_MAP_LOCK_COUNT - 1)
96 struct bpf_mem_alloc ma;
97 struct bucket *buckets;
100 struct pcpu_freelist freelist;
103 struct htab_elem *__percpu *extra_elems;
104 /* number of elements in non-preallocated hashtable are kept
105 * in either pcount or count
107 struct percpu_counter pcount;
109 bool use_percpu_counter;
110 u32 n_buckets; /* number of hash buckets */
111 u32 elem_size; /* size of each element in bytes */
113 struct lock_class_key lockdep_key;
114 int __percpu *map_locked[HASHTAB_MAP_LOCK_COUNT];
117 /* each htab element is struct htab_elem + key + value */
120 struct hlist_nulls_node hash_node;
124 struct bpf_htab *htab;
125 struct pcpu_freelist_node fnode;
126 struct htab_elem *batch_flink;
132 struct bpf_lru_node lru_node;
135 char key[] __aligned(8);
138 static inline bool htab_is_prealloc(const struct bpf_htab *htab)
140 return !(htab->map.map_flags & BPF_F_NO_PREALLOC);
143 static inline bool htab_use_raw_lock(const struct bpf_htab *htab)
145 return (!IS_ENABLED(CONFIG_PREEMPT_RT) || htab_is_prealloc(htab));
148 static void htab_init_buckets(struct bpf_htab *htab)
152 for (i = 0; i < htab->n_buckets; i++) {
153 INIT_HLIST_NULLS_HEAD(&htab->buckets[i].head, i);
154 if (htab_use_raw_lock(htab)) {
155 raw_spin_lock_init(&htab->buckets[i].raw_lock);
156 lockdep_set_class(&htab->buckets[i].raw_lock,
159 spin_lock_init(&htab->buckets[i].lock);
160 lockdep_set_class(&htab->buckets[i].lock,
167 static inline int htab_lock_bucket(const struct bpf_htab *htab,
168 struct bucket *b, u32 hash,
169 unsigned long *pflags)
174 hash = hash & HASHTAB_MAP_LOCK_MASK;
176 use_raw_lock = htab_use_raw_lock(htab);
181 if (unlikely(__this_cpu_inc_return(*(htab->map_locked[hash])) != 1)) {
182 __this_cpu_dec(*(htab->map_locked[hash]));
191 raw_spin_lock_irqsave(&b->raw_lock, flags);
193 spin_lock_irqsave(&b->lock, flags);
199 static inline void htab_unlock_bucket(const struct bpf_htab *htab,
200 struct bucket *b, u32 hash,
203 bool use_raw_lock = htab_use_raw_lock(htab);
205 hash = hash & HASHTAB_MAP_LOCK_MASK;
207 raw_spin_unlock_irqrestore(&b->raw_lock, flags);
209 spin_unlock_irqrestore(&b->lock, flags);
210 __this_cpu_dec(*(htab->map_locked[hash]));
217 static bool htab_lru_map_delete_node(void *arg, struct bpf_lru_node *node);
219 static bool htab_is_lru(const struct bpf_htab *htab)
221 return htab->map.map_type == BPF_MAP_TYPE_LRU_HASH ||
222 htab->map.map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH;
225 static bool htab_is_percpu(const struct bpf_htab *htab)
227 return htab->map.map_type == BPF_MAP_TYPE_PERCPU_HASH ||
228 htab->map.map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH;
231 static inline void htab_elem_set_ptr(struct htab_elem *l, u32 key_size,
234 *(void __percpu **)(l->key + key_size) = pptr;
237 static inline void __percpu *htab_elem_get_ptr(struct htab_elem *l, u32 key_size)
239 return *(void __percpu **)(l->key + key_size);
242 static void *fd_htab_map_get_ptr(const struct bpf_map *map, struct htab_elem *l)
244 return *(void **)(l->key + roundup(map->key_size, 8));
247 static struct htab_elem *get_htab_elem(struct bpf_htab *htab, int i)
249 return (struct htab_elem *) (htab->elems + i * (u64)htab->elem_size);
252 static bool htab_has_extra_elems(struct bpf_htab *htab)
254 return !htab_is_percpu(htab) && !htab_is_lru(htab);
257 static void htab_free_prealloced_timers(struct bpf_htab *htab)
259 u32 num_entries = htab->map.max_entries;
262 if (!map_value_has_timer(&htab->map))
264 if (htab_has_extra_elems(htab))
265 num_entries += num_possible_cpus();
267 for (i = 0; i < num_entries; i++) {
268 struct htab_elem *elem;
270 elem = get_htab_elem(htab, i);
271 bpf_timer_cancel_and_free(elem->key +
272 round_up(htab->map.key_size, 8) +
273 htab->map.timer_off);
278 static void htab_free_prealloced_kptrs(struct bpf_htab *htab)
280 u32 num_entries = htab->map.max_entries;
283 if (!map_value_has_kptrs(&htab->map))
285 if (htab_has_extra_elems(htab))
286 num_entries += num_possible_cpus();
288 for (i = 0; i < num_entries; i++) {
289 struct htab_elem *elem;
291 elem = get_htab_elem(htab, i);
292 bpf_map_free_kptrs(&htab->map, elem->key + round_up(htab->map.key_size, 8));
297 static void htab_free_elems(struct bpf_htab *htab)
301 if (!htab_is_percpu(htab))
304 for (i = 0; i < htab->map.max_entries; i++) {
307 pptr = htab_elem_get_ptr(get_htab_elem(htab, i),
313 bpf_map_area_free(htab->elems);
316 /* The LRU list has a lock (lru_lock). Each htab bucket has a lock
317 * (bucket_lock). If both locks need to be acquired together, the lock
318 * order is always lru_lock -> bucket_lock and this only happens in
319 * bpf_lru_list.c logic. For example, certain code path of
320 * bpf_lru_pop_free(), which is called by function prealloc_lru_pop(),
321 * will acquire lru_lock first followed by acquiring bucket_lock.
323 * In hashtab.c, to avoid deadlock, lock acquisition of
324 * bucket_lock followed by lru_lock is not allowed. In such cases,
325 * bucket_lock needs to be released first before acquiring lru_lock.
327 static struct htab_elem *prealloc_lru_pop(struct bpf_htab *htab, void *key,
330 struct bpf_lru_node *node = bpf_lru_pop_free(&htab->lru, hash);
334 l = container_of(node, struct htab_elem, lru_node);
335 memcpy(l->key, key, htab->map.key_size);
342 static int prealloc_init(struct bpf_htab *htab)
344 u32 num_entries = htab->map.max_entries;
345 int err = -ENOMEM, i;
347 if (htab_has_extra_elems(htab))
348 num_entries += num_possible_cpus();
350 htab->elems = bpf_map_area_alloc((u64)htab->elem_size * num_entries,
351 htab->map.numa_node);
355 if (!htab_is_percpu(htab))
356 goto skip_percpu_elems;
358 for (i = 0; i < num_entries; i++) {
359 u32 size = round_up(htab->map.value_size, 8);
362 pptr = bpf_map_alloc_percpu(&htab->map, size, 8,
363 GFP_USER | __GFP_NOWARN);
366 htab_elem_set_ptr(get_htab_elem(htab, i), htab->map.key_size,
372 if (htab_is_lru(htab))
373 err = bpf_lru_init(&htab->lru,
374 htab->map.map_flags & BPF_F_NO_COMMON_LRU,
375 offsetof(struct htab_elem, hash) -
376 offsetof(struct htab_elem, lru_node),
377 htab_lru_map_delete_node,
380 err = pcpu_freelist_init(&htab->freelist);
385 if (htab_is_lru(htab))
386 bpf_lru_populate(&htab->lru, htab->elems,
387 offsetof(struct htab_elem, lru_node),
388 htab->elem_size, num_entries);
390 pcpu_freelist_populate(&htab->freelist,
391 htab->elems + offsetof(struct htab_elem, fnode),
392 htab->elem_size, num_entries);
397 htab_free_elems(htab);
401 static void prealloc_destroy(struct bpf_htab *htab)
403 htab_free_elems(htab);
405 if (htab_is_lru(htab))
406 bpf_lru_destroy(&htab->lru);
408 pcpu_freelist_destroy(&htab->freelist);
411 static int alloc_extra_elems(struct bpf_htab *htab)
413 struct htab_elem *__percpu *pptr, *l_new;
414 struct pcpu_freelist_node *l;
417 pptr = bpf_map_alloc_percpu(&htab->map, sizeof(struct htab_elem *), 8,
418 GFP_USER | __GFP_NOWARN);
422 for_each_possible_cpu(cpu) {
423 l = pcpu_freelist_pop(&htab->freelist);
424 /* pop will succeed, since prealloc_init()
425 * preallocated extra num_possible_cpus elements
427 l_new = container_of(l, struct htab_elem, fnode);
428 *per_cpu_ptr(pptr, cpu) = l_new;
430 htab->extra_elems = pptr;
434 /* Called from syscall */
435 static int htab_map_alloc_check(union bpf_attr *attr)
437 bool percpu = (attr->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
438 attr->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH);
439 bool lru = (attr->map_type == BPF_MAP_TYPE_LRU_HASH ||
440 attr->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH);
441 /* percpu_lru means each cpu has its own LRU list.
442 * it is different from BPF_MAP_TYPE_PERCPU_HASH where
443 * the map's value itself is percpu. percpu_lru has
444 * nothing to do with the map's value.
446 bool percpu_lru = (attr->map_flags & BPF_F_NO_COMMON_LRU);
447 bool prealloc = !(attr->map_flags & BPF_F_NO_PREALLOC);
448 bool zero_seed = (attr->map_flags & BPF_F_ZERO_SEED);
449 int numa_node = bpf_map_attr_numa_node(attr);
451 BUILD_BUG_ON(offsetof(struct htab_elem, htab) !=
452 offsetof(struct htab_elem, hash_node.pprev));
453 BUILD_BUG_ON(offsetof(struct htab_elem, fnode.next) !=
454 offsetof(struct htab_elem, hash_node.pprev));
456 if (lru && !bpf_capable())
457 /* LRU implementation is much complicated than other
458 * maps. Hence, limit to CAP_BPF.
462 if (zero_seed && !capable(CAP_SYS_ADMIN))
463 /* Guard against local DoS, and discourage production use. */
466 if (attr->map_flags & ~HTAB_CREATE_FLAG_MASK ||
467 !bpf_map_flags_access_ok(attr->map_flags))
470 if (!lru && percpu_lru)
473 if (lru && !prealloc)
476 if (numa_node != NUMA_NO_NODE && (percpu || percpu_lru))
479 /* check sanity of attributes.
480 * value_size == 0 may be allowed in the future to use map as a set
482 if (attr->max_entries == 0 || attr->key_size == 0 ||
483 attr->value_size == 0)
486 if ((u64)attr->key_size + attr->value_size >= KMALLOC_MAX_SIZE -
487 sizeof(struct htab_elem))
488 /* if key_size + value_size is bigger, the user space won't be
489 * able to access the elements via bpf syscall. This check
490 * also makes sure that the elem_size doesn't overflow and it's
491 * kmalloc-able later in htab_map_update_elem()
498 static struct bpf_map *htab_map_alloc(union bpf_attr *attr)
500 bool percpu = (attr->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
501 attr->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH);
502 bool lru = (attr->map_type == BPF_MAP_TYPE_LRU_HASH ||
503 attr->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH);
504 /* percpu_lru means each cpu has its own LRU list.
505 * it is different from BPF_MAP_TYPE_PERCPU_HASH where
506 * the map's value itself is percpu. percpu_lru has
507 * nothing to do with the map's value.
509 bool percpu_lru = (attr->map_flags & BPF_F_NO_COMMON_LRU);
510 bool prealloc = !(attr->map_flags & BPF_F_NO_PREALLOC);
511 struct bpf_htab *htab;
514 htab = bpf_map_area_alloc(sizeof(*htab), NUMA_NO_NODE);
516 return ERR_PTR(-ENOMEM);
518 lockdep_register_key(&htab->lockdep_key);
520 bpf_map_init_from_attr(&htab->map, attr);
523 /* ensure each CPU's lru list has >=1 elements.
524 * since we are at it, make each lru list has the same
525 * number of elements.
527 htab->map.max_entries = roundup(attr->max_entries,
528 num_possible_cpus());
529 if (htab->map.max_entries < attr->max_entries)
530 htab->map.max_entries = rounddown(attr->max_entries,
531 num_possible_cpus());
534 /* hash table size must be power of 2 */
535 htab->n_buckets = roundup_pow_of_two(htab->map.max_entries);
537 htab->elem_size = sizeof(struct htab_elem) +
538 round_up(htab->map.key_size, 8);
540 htab->elem_size += sizeof(void *);
542 htab->elem_size += round_up(htab->map.value_size, 8);
545 /* prevent zero size kmalloc and check for u32 overflow */
546 if (htab->n_buckets == 0 ||
547 htab->n_buckets > U32_MAX / sizeof(struct bucket))
551 htab->buckets = bpf_map_area_alloc(htab->n_buckets *
552 sizeof(struct bucket),
553 htab->map.numa_node);
557 for (i = 0; i < HASHTAB_MAP_LOCK_COUNT; i++) {
558 htab->map_locked[i] = bpf_map_alloc_percpu(&htab->map,
562 if (!htab->map_locked[i])
563 goto free_map_locked;
566 if (htab->map.map_flags & BPF_F_ZERO_SEED)
569 htab->hashrnd = get_random_int();
571 htab_init_buckets(htab);
573 /* compute_batch_value() computes batch value as num_online_cpus() * 2
574 * and __percpu_counter_compare() needs
575 * htab->max_entries - cur_number_of_elems to be more than batch * num_online_cpus()
576 * for percpu_counter to be faster than atomic_t. In practice the average bpf
577 * hash map size is 10k, which means that a system with 64 cpus will fill
578 * hashmap to 20% of 10k before percpu_counter becomes ineffective. Therefore
579 * define our own batch count as 32 then 10k hash map can be filled up to 80%:
580 * 10k - 8k > 32 _batch_ * 64 _cpus_
581 * and __percpu_counter_compare() will still be fast. At that point hash map
582 * collisions will dominate its performance anyway. Assume that hash map filled
583 * to 50+% isn't going to be O(1) and use the following formula to choose
584 * between percpu_counter and atomic_t.
586 #define PERCPU_COUNTER_BATCH 32
587 if (attr->max_entries / 2 > num_online_cpus() * PERCPU_COUNTER_BATCH)
588 htab->use_percpu_counter = true;
590 if (htab->use_percpu_counter) {
591 err = percpu_counter_init(&htab->pcount, 0, GFP_KERNEL);
593 goto free_map_locked;
597 err = prealloc_init(htab);
599 goto free_map_locked;
601 if (!percpu && !lru) {
602 /* lru itself can remove the least used element, so
603 * there is no need for an extra elem during map_update.
605 err = alloc_extra_elems(htab);
610 err = bpf_mem_alloc_init(&htab->ma, htab->elem_size);
612 goto free_map_locked;
618 prealloc_destroy(htab);
620 for (i = 0; i < HASHTAB_MAP_LOCK_COUNT; i++)
621 free_percpu(htab->map_locked[i]);
622 bpf_map_area_free(htab->buckets);
623 bpf_mem_alloc_destroy(&htab->ma);
625 lockdep_unregister_key(&htab->lockdep_key);
626 bpf_map_area_free(htab);
630 static inline u32 htab_map_hash(const void *key, u32 key_len, u32 hashrnd)
632 return jhash(key, key_len, hashrnd);
635 static inline struct bucket *__select_bucket(struct bpf_htab *htab, u32 hash)
637 return &htab->buckets[hash & (htab->n_buckets - 1)];
640 static inline struct hlist_nulls_head *select_bucket(struct bpf_htab *htab, u32 hash)
642 return &__select_bucket(htab, hash)->head;
645 /* this lookup function can only be called with bucket lock taken */
646 static struct htab_elem *lookup_elem_raw(struct hlist_nulls_head *head, u32 hash,
647 void *key, u32 key_size)
649 struct hlist_nulls_node *n;
652 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node)
653 if (l->hash == hash && !memcmp(&l->key, key, key_size))
659 /* can be called without bucket lock. it will repeat the loop in
660 * the unlikely event when elements moved from one bucket into another
661 * while link list is being walked
663 static struct htab_elem *lookup_nulls_elem_raw(struct hlist_nulls_head *head,
665 u32 key_size, u32 n_buckets)
667 struct hlist_nulls_node *n;
671 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node)
672 if (l->hash == hash && !memcmp(&l->key, key, key_size))
675 if (unlikely(get_nulls_value(n) != (hash & (n_buckets - 1))))
681 /* Called from syscall or from eBPF program directly, so
682 * arguments have to match bpf_map_lookup_elem() exactly.
683 * The return value is adjusted by BPF instructions
684 * in htab_map_gen_lookup().
686 static void *__htab_map_lookup_elem(struct bpf_map *map, void *key)
688 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
689 struct hlist_nulls_head *head;
693 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
694 !rcu_read_lock_bh_held());
696 key_size = map->key_size;
698 hash = htab_map_hash(key, key_size, htab->hashrnd);
700 head = select_bucket(htab, hash);
702 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
707 static void *htab_map_lookup_elem(struct bpf_map *map, void *key)
709 struct htab_elem *l = __htab_map_lookup_elem(map, key);
712 return l->key + round_up(map->key_size, 8);
717 /* inline bpf_map_lookup_elem() call.
720 * bpf_map_lookup_elem
721 * map->ops->map_lookup_elem
722 * htab_map_lookup_elem
723 * __htab_map_lookup_elem
726 * __htab_map_lookup_elem
728 static int htab_map_gen_lookup(struct bpf_map *map, struct bpf_insn *insn_buf)
730 struct bpf_insn *insn = insn_buf;
731 const int ret = BPF_REG_0;
733 BUILD_BUG_ON(!__same_type(&__htab_map_lookup_elem,
734 (void *(*)(struct bpf_map *map, void *key))NULL));
735 *insn++ = BPF_EMIT_CALL(__htab_map_lookup_elem);
736 *insn++ = BPF_JMP_IMM(BPF_JEQ, ret, 0, 1);
737 *insn++ = BPF_ALU64_IMM(BPF_ADD, ret,
738 offsetof(struct htab_elem, key) +
739 round_up(map->key_size, 8));
740 return insn - insn_buf;
743 static __always_inline void *__htab_lru_map_lookup_elem(struct bpf_map *map,
744 void *key, const bool mark)
746 struct htab_elem *l = __htab_map_lookup_elem(map, key);
750 bpf_lru_node_set_ref(&l->lru_node);
751 return l->key + round_up(map->key_size, 8);
757 static void *htab_lru_map_lookup_elem(struct bpf_map *map, void *key)
759 return __htab_lru_map_lookup_elem(map, key, true);
762 static void *htab_lru_map_lookup_elem_sys(struct bpf_map *map, void *key)
764 return __htab_lru_map_lookup_elem(map, key, false);
767 static int htab_lru_map_gen_lookup(struct bpf_map *map,
768 struct bpf_insn *insn_buf)
770 struct bpf_insn *insn = insn_buf;
771 const int ret = BPF_REG_0;
772 const int ref_reg = BPF_REG_1;
774 BUILD_BUG_ON(!__same_type(&__htab_map_lookup_elem,
775 (void *(*)(struct bpf_map *map, void *key))NULL));
776 *insn++ = BPF_EMIT_CALL(__htab_map_lookup_elem);
777 *insn++ = BPF_JMP_IMM(BPF_JEQ, ret, 0, 4);
778 *insn++ = BPF_LDX_MEM(BPF_B, ref_reg, ret,
779 offsetof(struct htab_elem, lru_node) +
780 offsetof(struct bpf_lru_node, ref));
781 *insn++ = BPF_JMP_IMM(BPF_JNE, ref_reg, 0, 1);
782 *insn++ = BPF_ST_MEM(BPF_B, ret,
783 offsetof(struct htab_elem, lru_node) +
784 offsetof(struct bpf_lru_node, ref),
786 *insn++ = BPF_ALU64_IMM(BPF_ADD, ret,
787 offsetof(struct htab_elem, key) +
788 round_up(map->key_size, 8));
789 return insn - insn_buf;
792 static void check_and_free_fields(struct bpf_htab *htab,
793 struct htab_elem *elem)
795 void *map_value = elem->key + round_up(htab->map.key_size, 8);
797 if (map_value_has_timer(&htab->map))
798 bpf_timer_cancel_and_free(map_value + htab->map.timer_off);
799 if (map_value_has_kptrs(&htab->map))
800 bpf_map_free_kptrs(&htab->map, map_value);
803 /* It is called from the bpf_lru_list when the LRU needs to delete
804 * older elements from the htab.
806 static bool htab_lru_map_delete_node(void *arg, struct bpf_lru_node *node)
808 struct bpf_htab *htab = arg;
809 struct htab_elem *l = NULL, *tgt_l;
810 struct hlist_nulls_head *head;
811 struct hlist_nulls_node *n;
816 tgt_l = container_of(node, struct htab_elem, lru_node);
817 b = __select_bucket(htab, tgt_l->hash);
820 ret = htab_lock_bucket(htab, b, tgt_l->hash, &flags);
824 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node)
826 hlist_nulls_del_rcu(&l->hash_node);
827 check_and_free_fields(htab, l);
831 htab_unlock_bucket(htab, b, tgt_l->hash, flags);
836 /* Called from syscall */
837 static int htab_map_get_next_key(struct bpf_map *map, void *key, void *next_key)
839 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
840 struct hlist_nulls_head *head;
841 struct htab_elem *l, *next_l;
845 WARN_ON_ONCE(!rcu_read_lock_held());
847 key_size = map->key_size;
850 goto find_first_elem;
852 hash = htab_map_hash(key, key_size, htab->hashrnd);
854 head = select_bucket(htab, hash);
857 l = lookup_nulls_elem_raw(head, hash, key, key_size, htab->n_buckets);
860 goto find_first_elem;
862 /* key was found, get next key in the same bucket */
863 next_l = hlist_nulls_entry_safe(rcu_dereference_raw(hlist_nulls_next_rcu(&l->hash_node)),
864 struct htab_elem, hash_node);
867 /* if next elem in this hash list is non-zero, just return it */
868 memcpy(next_key, next_l->key, key_size);
872 /* no more elements in this hash list, go to the next bucket */
873 i = hash & (htab->n_buckets - 1);
877 /* iterate over buckets */
878 for (; i < htab->n_buckets; i++) {
879 head = select_bucket(htab, i);
881 /* pick first element in the bucket */
882 next_l = hlist_nulls_entry_safe(rcu_dereference_raw(hlist_nulls_first_rcu(head)),
883 struct htab_elem, hash_node);
885 /* if it's not empty, just return it */
886 memcpy(next_key, next_l->key, key_size);
891 /* iterated over all buckets and all elements */
895 static void htab_elem_free(struct bpf_htab *htab, struct htab_elem *l)
897 if (htab->map.map_type == BPF_MAP_TYPE_PERCPU_HASH)
898 free_percpu(htab_elem_get_ptr(l, htab->map.key_size));
899 check_and_free_fields(htab, l);
900 bpf_mem_cache_free(&htab->ma, l);
903 static void htab_elem_free_rcu(struct rcu_head *head)
905 struct htab_elem *l = container_of(head, struct htab_elem, rcu);
906 struct bpf_htab *htab = l->htab;
908 htab_elem_free(htab, l);
911 static void htab_put_fd_value(struct bpf_htab *htab, struct htab_elem *l)
913 struct bpf_map *map = &htab->map;
916 if (map->ops->map_fd_put_ptr) {
917 ptr = fd_htab_map_get_ptr(map, l);
918 map->ops->map_fd_put_ptr(ptr);
922 static bool is_map_full(struct bpf_htab *htab)
924 if (htab->use_percpu_counter)
925 return __percpu_counter_compare(&htab->pcount, htab->map.max_entries,
926 PERCPU_COUNTER_BATCH) >= 0;
927 return atomic_read(&htab->count) >= htab->map.max_entries;
930 static void inc_elem_count(struct bpf_htab *htab)
932 if (htab->use_percpu_counter)
933 percpu_counter_add_batch(&htab->pcount, 1, PERCPU_COUNTER_BATCH);
935 atomic_inc(&htab->count);
938 static void dec_elem_count(struct bpf_htab *htab)
940 if (htab->use_percpu_counter)
941 percpu_counter_add_batch(&htab->pcount, -1, PERCPU_COUNTER_BATCH);
943 atomic_dec(&htab->count);
947 static void free_htab_elem(struct bpf_htab *htab, struct htab_elem *l)
949 htab_put_fd_value(htab, l);
951 if (htab_is_prealloc(htab)) {
952 check_and_free_fields(htab, l);
953 __pcpu_freelist_push(&htab->freelist, &l->fnode);
955 dec_elem_count(htab);
957 call_rcu(&l->rcu, htab_elem_free_rcu);
961 static void pcpu_copy_value(struct bpf_htab *htab, void __percpu *pptr,
962 void *value, bool onallcpus)
965 /* copy true value_size bytes */
966 memcpy(this_cpu_ptr(pptr), value, htab->map.value_size);
968 u32 size = round_up(htab->map.value_size, 8);
971 for_each_possible_cpu(cpu) {
972 bpf_long_memcpy(per_cpu_ptr(pptr, cpu),
979 static void pcpu_init_value(struct bpf_htab *htab, void __percpu *pptr,
980 void *value, bool onallcpus)
982 /* When using prealloc and not setting the initial value on all cpus,
983 * zero-fill element values for other cpus (just as what happens when
984 * not using prealloc). Otherwise, bpf program has no way to ensure
985 * known initial values for cpus other than current one
986 * (onallcpus=false always when coming from bpf prog).
988 if (htab_is_prealloc(htab) && !onallcpus) {
989 u32 size = round_up(htab->map.value_size, 8);
990 int current_cpu = raw_smp_processor_id();
993 for_each_possible_cpu(cpu) {
994 if (cpu == current_cpu)
995 bpf_long_memcpy(per_cpu_ptr(pptr, cpu), value,
998 memset(per_cpu_ptr(pptr, cpu), 0, size);
1001 pcpu_copy_value(htab, pptr, value, onallcpus);
1005 static bool fd_htab_map_needs_adjust(const struct bpf_htab *htab)
1007 return htab->map.map_type == BPF_MAP_TYPE_HASH_OF_MAPS &&
1008 BITS_PER_LONG == 64;
1011 static struct htab_elem *alloc_htab_elem(struct bpf_htab *htab, void *key,
1012 void *value, u32 key_size, u32 hash,
1013 bool percpu, bool onallcpus,
1014 struct htab_elem *old_elem)
1016 u32 size = htab->map.value_size;
1017 bool prealloc = htab_is_prealloc(htab);
1018 struct htab_elem *l_new, **pl_new;
1019 void __percpu *pptr;
1023 /* if we're updating the existing element,
1024 * use per-cpu extra elems to avoid freelist_pop/push
1026 pl_new = this_cpu_ptr(htab->extra_elems);
1028 htab_put_fd_value(htab, old_elem);
1031 struct pcpu_freelist_node *l;
1033 l = __pcpu_freelist_pop(&htab->freelist);
1035 return ERR_PTR(-E2BIG);
1036 l_new = container_of(l, struct htab_elem, fnode);
1039 if (is_map_full(htab))
1041 /* when map is full and update() is replacing
1042 * old element, it's ok to allocate, since
1043 * old element will be freed immediately.
1044 * Otherwise return an error
1046 return ERR_PTR(-E2BIG);
1047 inc_elem_count(htab);
1048 l_new = bpf_mem_cache_alloc(&htab->ma);
1050 l_new = ERR_PTR(-ENOMEM);
1053 check_and_init_map_value(&htab->map,
1054 l_new->key + round_up(key_size, 8));
1057 memcpy(l_new->key, key, key_size);
1059 size = round_up(size, 8);
1061 pptr = htab_elem_get_ptr(l_new, key_size);
1063 /* alloc_percpu zero-fills */
1064 pptr = bpf_map_alloc_percpu(&htab->map, size, 8,
1065 GFP_NOWAIT | __GFP_NOWARN);
1067 bpf_mem_cache_free(&htab->ma, l_new);
1068 l_new = ERR_PTR(-ENOMEM);
1073 pcpu_init_value(htab, pptr, value, onallcpus);
1076 htab_elem_set_ptr(l_new, key_size, pptr);
1077 } else if (fd_htab_map_needs_adjust(htab)) {
1078 size = round_up(size, 8);
1079 memcpy(l_new->key + round_up(key_size, 8), value, size);
1081 copy_map_value(&htab->map,
1082 l_new->key + round_up(key_size, 8),
1089 dec_elem_count(htab);
1093 static int check_flags(struct bpf_htab *htab, struct htab_elem *l_old,
1096 if (l_old && (map_flags & ~BPF_F_LOCK) == BPF_NOEXIST)
1097 /* elem already exists */
1100 if (!l_old && (map_flags & ~BPF_F_LOCK) == BPF_EXIST)
1101 /* elem doesn't exist, cannot update it */
1107 /* Called from syscall or from eBPF program */
1108 static int htab_map_update_elem(struct bpf_map *map, void *key, void *value,
1111 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1112 struct htab_elem *l_new = NULL, *l_old;
1113 struct hlist_nulls_head *head;
1114 unsigned long flags;
1119 if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST))
1123 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1124 !rcu_read_lock_bh_held());
1126 key_size = map->key_size;
1128 hash = htab_map_hash(key, key_size, htab->hashrnd);
1130 b = __select_bucket(htab, hash);
1133 if (unlikely(map_flags & BPF_F_LOCK)) {
1134 if (unlikely(!map_value_has_spin_lock(map)))
1136 /* find an element without taking the bucket lock */
1137 l_old = lookup_nulls_elem_raw(head, hash, key, key_size,
1139 ret = check_flags(htab, l_old, map_flags);
1143 /* grab the element lock and update value in place */
1144 copy_map_value_locked(map,
1145 l_old->key + round_up(key_size, 8),
1149 /* fall through, grab the bucket lock and lookup again.
1150 * 99.9% chance that the element won't be found,
1151 * but second lookup under lock has to be done.
1155 ret = htab_lock_bucket(htab, b, hash, &flags);
1159 l_old = lookup_elem_raw(head, hash, key, key_size);
1161 ret = check_flags(htab, l_old, map_flags);
1165 if (unlikely(l_old && (map_flags & BPF_F_LOCK))) {
1166 /* first lookup without the bucket lock didn't find the element,
1167 * but second lookup with the bucket lock found it.
1168 * This case is highly unlikely, but has to be dealt with:
1169 * grab the element lock in addition to the bucket lock
1170 * and update element in place
1172 copy_map_value_locked(map,
1173 l_old->key + round_up(key_size, 8),
1179 l_new = alloc_htab_elem(htab, key, value, key_size, hash, false, false,
1181 if (IS_ERR(l_new)) {
1182 /* all pre-allocated elements are in use or memory exhausted */
1183 ret = PTR_ERR(l_new);
1187 /* add new element to the head of the list, so that
1188 * concurrent search will find it before old elem
1190 hlist_nulls_add_head_rcu(&l_new->hash_node, head);
1192 hlist_nulls_del_rcu(&l_old->hash_node);
1193 if (!htab_is_prealloc(htab))
1194 free_htab_elem(htab, l_old);
1196 check_and_free_fields(htab, l_old);
1200 htab_unlock_bucket(htab, b, hash, flags);
1204 static void htab_lru_push_free(struct bpf_htab *htab, struct htab_elem *elem)
1206 check_and_free_fields(htab, elem);
1207 bpf_lru_push_free(&htab->lru, &elem->lru_node);
1210 static int htab_lru_map_update_elem(struct bpf_map *map, void *key, void *value,
1213 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1214 struct htab_elem *l_new, *l_old = NULL;
1215 struct hlist_nulls_head *head;
1216 unsigned long flags;
1221 if (unlikely(map_flags > BPF_EXIST))
1225 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1226 !rcu_read_lock_bh_held());
1228 key_size = map->key_size;
1230 hash = htab_map_hash(key, key_size, htab->hashrnd);
1232 b = __select_bucket(htab, hash);
1235 /* For LRU, we need to alloc before taking bucket's
1236 * spinlock because getting free nodes from LRU may need
1237 * to remove older elements from htab and this removal
1238 * operation will need a bucket lock.
1240 l_new = prealloc_lru_pop(htab, key, hash);
1243 copy_map_value(&htab->map,
1244 l_new->key + round_up(map->key_size, 8), value);
1246 ret = htab_lock_bucket(htab, b, hash, &flags);
1250 l_old = lookup_elem_raw(head, hash, key, key_size);
1252 ret = check_flags(htab, l_old, map_flags);
1256 /* add new element to the head of the list, so that
1257 * concurrent search will find it before old elem
1259 hlist_nulls_add_head_rcu(&l_new->hash_node, head);
1261 bpf_lru_node_set_ref(&l_new->lru_node);
1262 hlist_nulls_del_rcu(&l_old->hash_node);
1267 htab_unlock_bucket(htab, b, hash, flags);
1270 htab_lru_push_free(htab, l_new);
1272 htab_lru_push_free(htab, l_old);
1277 static int __htab_percpu_map_update_elem(struct bpf_map *map, void *key,
1278 void *value, u64 map_flags,
1281 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1282 struct htab_elem *l_new = NULL, *l_old;
1283 struct hlist_nulls_head *head;
1284 unsigned long flags;
1289 if (unlikely(map_flags > BPF_EXIST))
1293 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1294 !rcu_read_lock_bh_held());
1296 key_size = map->key_size;
1298 hash = htab_map_hash(key, key_size, htab->hashrnd);
1300 b = __select_bucket(htab, hash);
1303 ret = htab_lock_bucket(htab, b, hash, &flags);
1307 l_old = lookup_elem_raw(head, hash, key, key_size);
1309 ret = check_flags(htab, l_old, map_flags);
1314 /* per-cpu hash map can update value in-place */
1315 pcpu_copy_value(htab, htab_elem_get_ptr(l_old, key_size),
1318 l_new = alloc_htab_elem(htab, key, value, key_size,
1319 hash, true, onallcpus, NULL);
1320 if (IS_ERR(l_new)) {
1321 ret = PTR_ERR(l_new);
1324 hlist_nulls_add_head_rcu(&l_new->hash_node, head);
1328 htab_unlock_bucket(htab, b, hash, flags);
1332 static int __htab_lru_percpu_map_update_elem(struct bpf_map *map, void *key,
1333 void *value, u64 map_flags,
1336 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1337 struct htab_elem *l_new = NULL, *l_old;
1338 struct hlist_nulls_head *head;
1339 unsigned long flags;
1344 if (unlikely(map_flags > BPF_EXIST))
1348 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1349 !rcu_read_lock_bh_held());
1351 key_size = map->key_size;
1353 hash = htab_map_hash(key, key_size, htab->hashrnd);
1355 b = __select_bucket(htab, hash);
1358 /* For LRU, we need to alloc before taking bucket's
1359 * spinlock because LRU's elem alloc may need
1360 * to remove older elem from htab and this removal
1361 * operation will need a bucket lock.
1363 if (map_flags != BPF_EXIST) {
1364 l_new = prealloc_lru_pop(htab, key, hash);
1369 ret = htab_lock_bucket(htab, b, hash, &flags);
1373 l_old = lookup_elem_raw(head, hash, key, key_size);
1375 ret = check_flags(htab, l_old, map_flags);
1380 bpf_lru_node_set_ref(&l_old->lru_node);
1382 /* per-cpu hash map can update value in-place */
1383 pcpu_copy_value(htab, htab_elem_get_ptr(l_old, key_size),
1386 pcpu_init_value(htab, htab_elem_get_ptr(l_new, key_size),
1388 hlist_nulls_add_head_rcu(&l_new->hash_node, head);
1393 htab_unlock_bucket(htab, b, hash, flags);
1395 bpf_lru_push_free(&htab->lru, &l_new->lru_node);
1399 static int htab_percpu_map_update_elem(struct bpf_map *map, void *key,
1400 void *value, u64 map_flags)
1402 return __htab_percpu_map_update_elem(map, key, value, map_flags, false);
1405 static int htab_lru_percpu_map_update_elem(struct bpf_map *map, void *key,
1406 void *value, u64 map_flags)
1408 return __htab_lru_percpu_map_update_elem(map, key, value, map_flags,
1412 /* Called from syscall or from eBPF program */
1413 static int htab_map_delete_elem(struct bpf_map *map, void *key)
1415 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1416 struct hlist_nulls_head *head;
1418 struct htab_elem *l;
1419 unsigned long flags;
1423 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1424 !rcu_read_lock_bh_held());
1426 key_size = map->key_size;
1428 hash = htab_map_hash(key, key_size, htab->hashrnd);
1429 b = __select_bucket(htab, hash);
1432 ret = htab_lock_bucket(htab, b, hash, &flags);
1436 l = lookup_elem_raw(head, hash, key, key_size);
1439 hlist_nulls_del_rcu(&l->hash_node);
1440 free_htab_elem(htab, l);
1445 htab_unlock_bucket(htab, b, hash, flags);
1449 static int htab_lru_map_delete_elem(struct bpf_map *map, void *key)
1451 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1452 struct hlist_nulls_head *head;
1454 struct htab_elem *l;
1455 unsigned long flags;
1459 WARN_ON_ONCE(!rcu_read_lock_held() && !rcu_read_lock_trace_held() &&
1460 !rcu_read_lock_bh_held());
1462 key_size = map->key_size;
1464 hash = htab_map_hash(key, key_size, htab->hashrnd);
1465 b = __select_bucket(htab, hash);
1468 ret = htab_lock_bucket(htab, b, hash, &flags);
1472 l = lookup_elem_raw(head, hash, key, key_size);
1475 hlist_nulls_del_rcu(&l->hash_node);
1479 htab_unlock_bucket(htab, b, hash, flags);
1481 htab_lru_push_free(htab, l);
1485 static void delete_all_elements(struct bpf_htab *htab)
1489 /* It's called from a worker thread, so disable migration here,
1490 * since bpf_mem_cache_free() relies on that.
1493 for (i = 0; i < htab->n_buckets; i++) {
1494 struct hlist_nulls_head *head = select_bucket(htab, i);
1495 struct hlist_nulls_node *n;
1496 struct htab_elem *l;
1498 hlist_nulls_for_each_entry_safe(l, n, head, hash_node) {
1499 hlist_nulls_del_rcu(&l->hash_node);
1500 htab_elem_free(htab, l);
1506 static void htab_free_malloced_timers(struct bpf_htab *htab)
1511 for (i = 0; i < htab->n_buckets; i++) {
1512 struct hlist_nulls_head *head = select_bucket(htab, i);
1513 struct hlist_nulls_node *n;
1514 struct htab_elem *l;
1516 hlist_nulls_for_each_entry(l, n, head, hash_node) {
1517 /* We don't reset or free kptr on uref dropping to zero,
1518 * hence just free timer.
1520 bpf_timer_cancel_and_free(l->key +
1521 round_up(htab->map.key_size, 8) +
1522 htab->map.timer_off);
1529 static void htab_map_free_timers(struct bpf_map *map)
1531 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1533 /* We don't reset or free kptr on uref dropping to zero. */
1534 if (!map_value_has_timer(&htab->map))
1536 if (!htab_is_prealloc(htab))
1537 htab_free_malloced_timers(htab);
1539 htab_free_prealloced_timers(htab);
1542 /* Called when map->refcnt goes to zero, either from workqueue or from syscall */
1543 static void htab_map_free(struct bpf_map *map)
1545 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1548 /* bpf_free_used_maps() or close(map_fd) will trigger this map_free callback.
1549 * bpf_free_used_maps() is called after bpf prog is no longer executing.
1550 * There is no need to synchronize_rcu() here to protect map elements.
1553 /* some of free_htab_elem() callbacks for elements of this map may
1554 * not have executed. Wait for them.
1557 if (!htab_is_prealloc(htab)) {
1558 delete_all_elements(htab);
1560 htab_free_prealloced_kptrs(htab);
1561 prealloc_destroy(htab);
1564 bpf_map_free_kptr_off_tab(map);
1565 free_percpu(htab->extra_elems);
1566 bpf_map_area_free(htab->buckets);
1567 bpf_mem_alloc_destroy(&htab->ma);
1568 if (htab->use_percpu_counter)
1569 percpu_counter_destroy(&htab->pcount);
1570 for (i = 0; i < HASHTAB_MAP_LOCK_COUNT; i++)
1571 free_percpu(htab->map_locked[i]);
1572 lockdep_unregister_key(&htab->lockdep_key);
1573 bpf_map_area_free(htab);
1576 static void htab_map_seq_show_elem(struct bpf_map *map, void *key,
1583 value = htab_map_lookup_elem(map, key);
1589 btf_type_seq_show(map->btf, map->btf_key_type_id, key, m);
1591 btf_type_seq_show(map->btf, map->btf_value_type_id, value, m);
1597 static int __htab_map_lookup_and_delete_elem(struct bpf_map *map, void *key,
1598 void *value, bool is_lru_map,
1599 bool is_percpu, u64 flags)
1601 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1602 struct hlist_nulls_head *head;
1603 unsigned long bflags;
1604 struct htab_elem *l;
1609 key_size = map->key_size;
1611 hash = htab_map_hash(key, key_size, htab->hashrnd);
1612 b = __select_bucket(htab, hash);
1615 ret = htab_lock_bucket(htab, b, hash, &bflags);
1619 l = lookup_elem_raw(head, hash, key, key_size);
1624 u32 roundup_value_size = round_up(map->value_size, 8);
1625 void __percpu *pptr;
1628 pptr = htab_elem_get_ptr(l, key_size);
1629 for_each_possible_cpu(cpu) {
1630 bpf_long_memcpy(value + off,
1631 per_cpu_ptr(pptr, cpu),
1632 roundup_value_size);
1633 off += roundup_value_size;
1636 u32 roundup_key_size = round_up(map->key_size, 8);
1638 if (flags & BPF_F_LOCK)
1639 copy_map_value_locked(map, value, l->key +
1643 copy_map_value(map, value, l->key +
1645 check_and_init_map_value(map, value);
1648 hlist_nulls_del_rcu(&l->hash_node);
1650 free_htab_elem(htab, l);
1653 htab_unlock_bucket(htab, b, hash, bflags);
1655 if (is_lru_map && l)
1656 htab_lru_push_free(htab, l);
1661 static int htab_map_lookup_and_delete_elem(struct bpf_map *map, void *key,
1662 void *value, u64 flags)
1664 return __htab_map_lookup_and_delete_elem(map, key, value, false, false,
1668 static int htab_percpu_map_lookup_and_delete_elem(struct bpf_map *map,
1669 void *key, void *value,
1672 return __htab_map_lookup_and_delete_elem(map, key, value, false, true,
1676 static int htab_lru_map_lookup_and_delete_elem(struct bpf_map *map, void *key,
1677 void *value, u64 flags)
1679 return __htab_map_lookup_and_delete_elem(map, key, value, true, false,
1683 static int htab_lru_percpu_map_lookup_and_delete_elem(struct bpf_map *map,
1684 void *key, void *value,
1687 return __htab_map_lookup_and_delete_elem(map, key, value, true, true,
1692 __htab_map_lookup_and_delete_batch(struct bpf_map *map,
1693 const union bpf_attr *attr,
1694 union bpf_attr __user *uattr,
1695 bool do_delete, bool is_lru_map,
1698 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
1699 u32 bucket_cnt, total, key_size, value_size, roundup_key_size;
1700 void *keys = NULL, *values = NULL, *value, *dst_key, *dst_val;
1701 void __user *uvalues = u64_to_user_ptr(attr->batch.values);
1702 void __user *ukeys = u64_to_user_ptr(attr->batch.keys);
1703 void __user *ubatch = u64_to_user_ptr(attr->batch.in_batch);
1704 u32 batch, max_count, size, bucket_size, map_id;
1705 struct htab_elem *node_to_free = NULL;
1706 u64 elem_map_flags, map_flags;
1707 struct hlist_nulls_head *head;
1708 struct hlist_nulls_node *n;
1709 unsigned long flags = 0;
1710 bool locked = false;
1711 struct htab_elem *l;
1715 elem_map_flags = attr->batch.elem_flags;
1716 if ((elem_map_flags & ~BPF_F_LOCK) ||
1717 ((elem_map_flags & BPF_F_LOCK) && !map_value_has_spin_lock(map)))
1720 map_flags = attr->batch.flags;
1724 max_count = attr->batch.count;
1728 if (put_user(0, &uattr->batch.count))
1732 if (ubatch && copy_from_user(&batch, ubatch, sizeof(batch)))
1735 if (batch >= htab->n_buckets)
1738 key_size = htab->map.key_size;
1739 roundup_key_size = round_up(htab->map.key_size, 8);
1740 value_size = htab->map.value_size;
1741 size = round_up(value_size, 8);
1743 value_size = size * num_possible_cpus();
1745 /* while experimenting with hash tables with sizes ranging from 10 to
1746 * 1000, it was observed that a bucket can have up to 5 entries.
1751 /* We cannot do copy_from_user or copy_to_user inside
1752 * the rcu_read_lock. Allocate enough space here.
1754 keys = kvmalloc_array(key_size, bucket_size, GFP_USER | __GFP_NOWARN);
1755 values = kvmalloc_array(value_size, bucket_size, GFP_USER | __GFP_NOWARN);
1756 if (!keys || !values) {
1762 bpf_disable_instrumentation();
1767 b = &htab->buckets[batch];
1769 /* do not grab the lock unless need it (bucket_cnt > 0). */
1771 ret = htab_lock_bucket(htab, b, batch, &flags);
1774 bpf_enable_instrumentation();
1780 hlist_nulls_for_each_entry_rcu(l, n, head, hash_node)
1783 if (bucket_cnt && !locked) {
1788 if (bucket_cnt > (max_count - total)) {
1791 /* Note that since bucket_cnt > 0 here, it is implicit
1792 * that the locked was grabbed, so release it.
1794 htab_unlock_bucket(htab, b, batch, flags);
1796 bpf_enable_instrumentation();
1800 if (bucket_cnt > bucket_size) {
1801 bucket_size = bucket_cnt;
1802 /* Note that since bucket_cnt > 0 here, it is implicit
1803 * that the locked was grabbed, so release it.
1805 htab_unlock_bucket(htab, b, batch, flags);
1807 bpf_enable_instrumentation();
1813 /* Next block is only safe to run if you have grabbed the lock */
1817 hlist_nulls_for_each_entry_safe(l, n, head, hash_node) {
1818 memcpy(dst_key, l->key, key_size);
1822 void __percpu *pptr;
1824 pptr = htab_elem_get_ptr(l, map->key_size);
1825 for_each_possible_cpu(cpu) {
1826 bpf_long_memcpy(dst_val + off,
1827 per_cpu_ptr(pptr, cpu), size);
1831 value = l->key + roundup_key_size;
1832 if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
1833 struct bpf_map **inner_map = value;
1835 /* Actual value is the id of the inner map */
1836 map_id = map->ops->map_fd_sys_lookup_elem(*inner_map);
1840 if (elem_map_flags & BPF_F_LOCK)
1841 copy_map_value_locked(map, dst_val, value,
1844 copy_map_value(map, dst_val, value);
1845 check_and_init_map_value(map, dst_val);
1848 hlist_nulls_del_rcu(&l->hash_node);
1850 /* bpf_lru_push_free() will acquire lru_lock, which
1851 * may cause deadlock. See comments in function
1852 * prealloc_lru_pop(). Let us do bpf_lru_push_free()
1853 * after releasing the bucket lock.
1856 l->batch_flink = node_to_free;
1859 free_htab_elem(htab, l);
1862 dst_key += key_size;
1863 dst_val += value_size;
1866 htab_unlock_bucket(htab, b, batch, flags);
1869 while (node_to_free) {
1871 node_to_free = node_to_free->batch_flink;
1872 htab_lru_push_free(htab, l);
1876 /* If we are not copying data, we can go to next bucket and avoid
1877 * unlocking the rcu.
1879 if (!bucket_cnt && (batch + 1 < htab->n_buckets)) {
1885 bpf_enable_instrumentation();
1886 if (bucket_cnt && (copy_to_user(ukeys + total * key_size, keys,
1887 key_size * bucket_cnt) ||
1888 copy_to_user(uvalues + total * value_size, values,
1889 value_size * bucket_cnt))) {
1894 total += bucket_cnt;
1896 if (batch >= htab->n_buckets) {
1906 /* copy # of entries and next batch */
1907 ubatch = u64_to_user_ptr(attr->batch.out_batch);
1908 if (copy_to_user(ubatch, &batch, sizeof(batch)) ||
1909 put_user(total, &uattr->batch.count))
1919 htab_percpu_map_lookup_batch(struct bpf_map *map, const union bpf_attr *attr,
1920 union bpf_attr __user *uattr)
1922 return __htab_map_lookup_and_delete_batch(map, attr, uattr, false,
1927 htab_percpu_map_lookup_and_delete_batch(struct bpf_map *map,
1928 const union bpf_attr *attr,
1929 union bpf_attr __user *uattr)
1931 return __htab_map_lookup_and_delete_batch(map, attr, uattr, true,
1936 htab_map_lookup_batch(struct bpf_map *map, const union bpf_attr *attr,
1937 union bpf_attr __user *uattr)
1939 return __htab_map_lookup_and_delete_batch(map, attr, uattr, false,
1944 htab_map_lookup_and_delete_batch(struct bpf_map *map,
1945 const union bpf_attr *attr,
1946 union bpf_attr __user *uattr)
1948 return __htab_map_lookup_and_delete_batch(map, attr, uattr, true,
1953 htab_lru_percpu_map_lookup_batch(struct bpf_map *map,
1954 const union bpf_attr *attr,
1955 union bpf_attr __user *uattr)
1957 return __htab_map_lookup_and_delete_batch(map, attr, uattr, false,
1962 htab_lru_percpu_map_lookup_and_delete_batch(struct bpf_map *map,
1963 const union bpf_attr *attr,
1964 union bpf_attr __user *uattr)
1966 return __htab_map_lookup_and_delete_batch(map, attr, uattr, true,
1971 htab_lru_map_lookup_batch(struct bpf_map *map, const union bpf_attr *attr,
1972 union bpf_attr __user *uattr)
1974 return __htab_map_lookup_and_delete_batch(map, attr, uattr, false,
1979 htab_lru_map_lookup_and_delete_batch(struct bpf_map *map,
1980 const union bpf_attr *attr,
1981 union bpf_attr __user *uattr)
1983 return __htab_map_lookup_and_delete_batch(map, attr, uattr, true,
1987 struct bpf_iter_seq_hash_map_info {
1988 struct bpf_map *map;
1989 struct bpf_htab *htab;
1990 void *percpu_value_buf; // non-zero means percpu hash
1995 static struct htab_elem *
1996 bpf_hash_map_seq_find_next(struct bpf_iter_seq_hash_map_info *info,
1997 struct htab_elem *prev_elem)
1999 const struct bpf_htab *htab = info->htab;
2000 u32 skip_elems = info->skip_elems;
2001 u32 bucket_id = info->bucket_id;
2002 struct hlist_nulls_head *head;
2003 struct hlist_nulls_node *n;
2004 struct htab_elem *elem;
2008 if (bucket_id >= htab->n_buckets)
2011 /* try to find next elem in the same bucket */
2013 /* no update/deletion on this bucket, prev_elem should be still valid
2014 * and we won't skip elements.
2016 n = rcu_dereference_raw(hlist_nulls_next_rcu(&prev_elem->hash_node));
2017 elem = hlist_nulls_entry_safe(n, struct htab_elem, hash_node);
2021 /* not found, unlock and go to the next bucket */
2022 b = &htab->buckets[bucket_id++];
2027 for (i = bucket_id; i < htab->n_buckets; i++) {
2028 b = &htab->buckets[i];
2033 hlist_nulls_for_each_entry_rcu(elem, n, head, hash_node) {
2034 if (count >= skip_elems) {
2035 info->bucket_id = i;
2036 info->skip_elems = count;
2046 info->bucket_id = i;
2047 info->skip_elems = 0;
2051 static void *bpf_hash_map_seq_start(struct seq_file *seq, loff_t *pos)
2053 struct bpf_iter_seq_hash_map_info *info = seq->private;
2054 struct htab_elem *elem;
2056 elem = bpf_hash_map_seq_find_next(info, NULL);
2065 static void *bpf_hash_map_seq_next(struct seq_file *seq, void *v, loff_t *pos)
2067 struct bpf_iter_seq_hash_map_info *info = seq->private;
2071 return bpf_hash_map_seq_find_next(info, v);
2074 static int __bpf_hash_map_seq_show(struct seq_file *seq, struct htab_elem *elem)
2076 struct bpf_iter_seq_hash_map_info *info = seq->private;
2077 u32 roundup_key_size, roundup_value_size;
2078 struct bpf_iter__bpf_map_elem ctx = {};
2079 struct bpf_map *map = info->map;
2080 struct bpf_iter_meta meta;
2081 int ret = 0, off = 0, cpu;
2082 struct bpf_prog *prog;
2083 void __percpu *pptr;
2086 prog = bpf_iter_get_info(&meta, elem == NULL);
2089 ctx.map = info->map;
2091 roundup_key_size = round_up(map->key_size, 8);
2092 ctx.key = elem->key;
2093 if (!info->percpu_value_buf) {
2094 ctx.value = elem->key + roundup_key_size;
2096 roundup_value_size = round_up(map->value_size, 8);
2097 pptr = htab_elem_get_ptr(elem, map->key_size);
2098 for_each_possible_cpu(cpu) {
2099 bpf_long_memcpy(info->percpu_value_buf + off,
2100 per_cpu_ptr(pptr, cpu),
2101 roundup_value_size);
2102 off += roundup_value_size;
2104 ctx.value = info->percpu_value_buf;
2107 ret = bpf_iter_run_prog(prog, &ctx);
2113 static int bpf_hash_map_seq_show(struct seq_file *seq, void *v)
2115 return __bpf_hash_map_seq_show(seq, v);
2118 static void bpf_hash_map_seq_stop(struct seq_file *seq, void *v)
2121 (void)__bpf_hash_map_seq_show(seq, NULL);
2126 static int bpf_iter_init_hash_map(void *priv_data,
2127 struct bpf_iter_aux_info *aux)
2129 struct bpf_iter_seq_hash_map_info *seq_info = priv_data;
2130 struct bpf_map *map = aux->map;
2134 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
2135 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
2136 buf_size = round_up(map->value_size, 8) * num_possible_cpus();
2137 value_buf = kmalloc(buf_size, GFP_USER | __GFP_NOWARN);
2141 seq_info->percpu_value_buf = value_buf;
2144 bpf_map_inc_with_uref(map);
2145 seq_info->map = map;
2146 seq_info->htab = container_of(map, struct bpf_htab, map);
2150 static void bpf_iter_fini_hash_map(void *priv_data)
2152 struct bpf_iter_seq_hash_map_info *seq_info = priv_data;
2154 bpf_map_put_with_uref(seq_info->map);
2155 kfree(seq_info->percpu_value_buf);
2158 static const struct seq_operations bpf_hash_map_seq_ops = {
2159 .start = bpf_hash_map_seq_start,
2160 .next = bpf_hash_map_seq_next,
2161 .stop = bpf_hash_map_seq_stop,
2162 .show = bpf_hash_map_seq_show,
2165 static const struct bpf_iter_seq_info iter_seq_info = {
2166 .seq_ops = &bpf_hash_map_seq_ops,
2167 .init_seq_private = bpf_iter_init_hash_map,
2168 .fini_seq_private = bpf_iter_fini_hash_map,
2169 .seq_priv_size = sizeof(struct bpf_iter_seq_hash_map_info),
2172 static int bpf_for_each_hash_elem(struct bpf_map *map, bpf_callback_t callback_fn,
2173 void *callback_ctx, u64 flags)
2175 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
2176 struct hlist_nulls_head *head;
2177 struct hlist_nulls_node *n;
2178 struct htab_elem *elem;
2179 u32 roundup_key_size;
2180 int i, num_elems = 0;
2181 void __percpu *pptr;
2190 is_percpu = htab_is_percpu(htab);
2192 roundup_key_size = round_up(map->key_size, 8);
2193 /* disable migration so percpu value prepared here will be the
2194 * same as the one seen by the bpf program with bpf_map_lookup_elem().
2198 for (i = 0; i < htab->n_buckets; i++) {
2199 b = &htab->buckets[i];
2202 hlist_nulls_for_each_entry_rcu(elem, n, head, hash_node) {
2205 /* current cpu value for percpu map */
2206 pptr = htab_elem_get_ptr(elem, map->key_size);
2207 val = this_cpu_ptr(pptr);
2209 val = elem->key + roundup_key_size;
2212 ret = callback_fn((u64)(long)map, (u64)(long)key,
2213 (u64)(long)val, (u64)(long)callback_ctx, 0);
2214 /* return value: 0 - continue, 1 - stop and return */
2228 BTF_ID_LIST_SINGLE(htab_map_btf_ids, struct, bpf_htab)
2229 const struct bpf_map_ops htab_map_ops = {
2230 .map_meta_equal = bpf_map_meta_equal,
2231 .map_alloc_check = htab_map_alloc_check,
2232 .map_alloc = htab_map_alloc,
2233 .map_free = htab_map_free,
2234 .map_get_next_key = htab_map_get_next_key,
2235 .map_release_uref = htab_map_free_timers,
2236 .map_lookup_elem = htab_map_lookup_elem,
2237 .map_lookup_and_delete_elem = htab_map_lookup_and_delete_elem,
2238 .map_update_elem = htab_map_update_elem,
2239 .map_delete_elem = htab_map_delete_elem,
2240 .map_gen_lookup = htab_map_gen_lookup,
2241 .map_seq_show_elem = htab_map_seq_show_elem,
2242 .map_set_for_each_callback_args = map_set_for_each_callback_args,
2243 .map_for_each_callback = bpf_for_each_hash_elem,
2245 .map_btf_id = &htab_map_btf_ids[0],
2246 .iter_seq_info = &iter_seq_info,
2249 const struct bpf_map_ops htab_lru_map_ops = {
2250 .map_meta_equal = bpf_map_meta_equal,
2251 .map_alloc_check = htab_map_alloc_check,
2252 .map_alloc = htab_map_alloc,
2253 .map_free = htab_map_free,
2254 .map_get_next_key = htab_map_get_next_key,
2255 .map_release_uref = htab_map_free_timers,
2256 .map_lookup_elem = htab_lru_map_lookup_elem,
2257 .map_lookup_and_delete_elem = htab_lru_map_lookup_and_delete_elem,
2258 .map_lookup_elem_sys_only = htab_lru_map_lookup_elem_sys,
2259 .map_update_elem = htab_lru_map_update_elem,
2260 .map_delete_elem = htab_lru_map_delete_elem,
2261 .map_gen_lookup = htab_lru_map_gen_lookup,
2262 .map_seq_show_elem = htab_map_seq_show_elem,
2263 .map_set_for_each_callback_args = map_set_for_each_callback_args,
2264 .map_for_each_callback = bpf_for_each_hash_elem,
2265 BATCH_OPS(htab_lru),
2266 .map_btf_id = &htab_map_btf_ids[0],
2267 .iter_seq_info = &iter_seq_info,
2270 /* Called from eBPF program */
2271 static void *htab_percpu_map_lookup_elem(struct bpf_map *map, void *key)
2273 struct htab_elem *l = __htab_map_lookup_elem(map, key);
2276 return this_cpu_ptr(htab_elem_get_ptr(l, map->key_size));
2281 static void *htab_percpu_map_lookup_percpu_elem(struct bpf_map *map, void *key, u32 cpu)
2283 struct htab_elem *l;
2285 if (cpu >= nr_cpu_ids)
2288 l = __htab_map_lookup_elem(map, key);
2290 return per_cpu_ptr(htab_elem_get_ptr(l, map->key_size), cpu);
2295 static void *htab_lru_percpu_map_lookup_elem(struct bpf_map *map, void *key)
2297 struct htab_elem *l = __htab_map_lookup_elem(map, key);
2300 bpf_lru_node_set_ref(&l->lru_node);
2301 return this_cpu_ptr(htab_elem_get_ptr(l, map->key_size));
2307 static void *htab_lru_percpu_map_lookup_percpu_elem(struct bpf_map *map, void *key, u32 cpu)
2309 struct htab_elem *l;
2311 if (cpu >= nr_cpu_ids)
2314 l = __htab_map_lookup_elem(map, key);
2316 bpf_lru_node_set_ref(&l->lru_node);
2317 return per_cpu_ptr(htab_elem_get_ptr(l, map->key_size), cpu);
2323 int bpf_percpu_hash_copy(struct bpf_map *map, void *key, void *value)
2325 struct htab_elem *l;
2326 void __percpu *pptr;
2331 /* per_cpu areas are zero-filled and bpf programs can only
2332 * access 'value_size' of them, so copying rounded areas
2333 * will not leak any kernel data
2335 size = round_up(map->value_size, 8);
2337 l = __htab_map_lookup_elem(map, key);
2340 /* We do not mark LRU map element here in order to not mess up
2341 * eviction heuristics when user space does a map walk.
2343 pptr = htab_elem_get_ptr(l, map->key_size);
2344 for_each_possible_cpu(cpu) {
2345 bpf_long_memcpy(value + off,
2346 per_cpu_ptr(pptr, cpu), size);
2355 int bpf_percpu_hash_update(struct bpf_map *map, void *key, void *value,
2358 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
2362 if (htab_is_lru(htab))
2363 ret = __htab_lru_percpu_map_update_elem(map, key, value,
2366 ret = __htab_percpu_map_update_elem(map, key, value, map_flags,
2373 static void htab_percpu_map_seq_show_elem(struct bpf_map *map, void *key,
2376 struct htab_elem *l;
2377 void __percpu *pptr;
2382 l = __htab_map_lookup_elem(map, key);
2388 btf_type_seq_show(map->btf, map->btf_key_type_id, key, m);
2389 seq_puts(m, ": {\n");
2390 pptr = htab_elem_get_ptr(l, map->key_size);
2391 for_each_possible_cpu(cpu) {
2392 seq_printf(m, "\tcpu%d: ", cpu);
2393 btf_type_seq_show(map->btf, map->btf_value_type_id,
2394 per_cpu_ptr(pptr, cpu), m);
2402 const struct bpf_map_ops htab_percpu_map_ops = {
2403 .map_meta_equal = bpf_map_meta_equal,
2404 .map_alloc_check = htab_map_alloc_check,
2405 .map_alloc = htab_map_alloc,
2406 .map_free = htab_map_free,
2407 .map_get_next_key = htab_map_get_next_key,
2408 .map_lookup_elem = htab_percpu_map_lookup_elem,
2409 .map_lookup_and_delete_elem = htab_percpu_map_lookup_and_delete_elem,
2410 .map_update_elem = htab_percpu_map_update_elem,
2411 .map_delete_elem = htab_map_delete_elem,
2412 .map_lookup_percpu_elem = htab_percpu_map_lookup_percpu_elem,
2413 .map_seq_show_elem = htab_percpu_map_seq_show_elem,
2414 .map_set_for_each_callback_args = map_set_for_each_callback_args,
2415 .map_for_each_callback = bpf_for_each_hash_elem,
2416 BATCH_OPS(htab_percpu),
2417 .map_btf_id = &htab_map_btf_ids[0],
2418 .iter_seq_info = &iter_seq_info,
2421 const struct bpf_map_ops htab_lru_percpu_map_ops = {
2422 .map_meta_equal = bpf_map_meta_equal,
2423 .map_alloc_check = htab_map_alloc_check,
2424 .map_alloc = htab_map_alloc,
2425 .map_free = htab_map_free,
2426 .map_get_next_key = htab_map_get_next_key,
2427 .map_lookup_elem = htab_lru_percpu_map_lookup_elem,
2428 .map_lookup_and_delete_elem = htab_lru_percpu_map_lookup_and_delete_elem,
2429 .map_update_elem = htab_lru_percpu_map_update_elem,
2430 .map_delete_elem = htab_lru_map_delete_elem,
2431 .map_lookup_percpu_elem = htab_lru_percpu_map_lookup_percpu_elem,
2432 .map_seq_show_elem = htab_percpu_map_seq_show_elem,
2433 .map_set_for_each_callback_args = map_set_for_each_callback_args,
2434 .map_for_each_callback = bpf_for_each_hash_elem,
2435 BATCH_OPS(htab_lru_percpu),
2436 .map_btf_id = &htab_map_btf_ids[0],
2437 .iter_seq_info = &iter_seq_info,
2440 static int fd_htab_map_alloc_check(union bpf_attr *attr)
2442 if (attr->value_size != sizeof(u32))
2444 return htab_map_alloc_check(attr);
2447 static void fd_htab_map_free(struct bpf_map *map)
2449 struct bpf_htab *htab = container_of(map, struct bpf_htab, map);
2450 struct hlist_nulls_node *n;
2451 struct hlist_nulls_head *head;
2452 struct htab_elem *l;
2455 for (i = 0; i < htab->n_buckets; i++) {
2456 head = select_bucket(htab, i);
2458 hlist_nulls_for_each_entry_safe(l, n, head, hash_node) {
2459 void *ptr = fd_htab_map_get_ptr(map, l);
2461 map->ops->map_fd_put_ptr(ptr);
2468 /* only called from syscall */
2469 int bpf_fd_htab_map_lookup_elem(struct bpf_map *map, void *key, u32 *value)
2474 if (!map->ops->map_fd_sys_lookup_elem)
2478 ptr = htab_map_lookup_elem(map, key);
2480 *value = map->ops->map_fd_sys_lookup_elem(READ_ONCE(*ptr));
2488 /* only called from syscall */
2489 int bpf_fd_htab_map_update_elem(struct bpf_map *map, struct file *map_file,
2490 void *key, void *value, u64 map_flags)
2494 u32 ufd = *(u32 *)value;
2496 ptr = map->ops->map_fd_get_ptr(map, map_file, ufd);
2498 return PTR_ERR(ptr);
2500 ret = htab_map_update_elem(map, key, &ptr, map_flags);
2502 map->ops->map_fd_put_ptr(ptr);
2507 static struct bpf_map *htab_of_map_alloc(union bpf_attr *attr)
2509 struct bpf_map *map, *inner_map_meta;
2511 inner_map_meta = bpf_map_meta_alloc(attr->inner_map_fd);
2512 if (IS_ERR(inner_map_meta))
2513 return inner_map_meta;
2515 map = htab_map_alloc(attr);
2517 bpf_map_meta_free(inner_map_meta);
2521 map->inner_map_meta = inner_map_meta;
2526 static void *htab_of_map_lookup_elem(struct bpf_map *map, void *key)
2528 struct bpf_map **inner_map = htab_map_lookup_elem(map, key);
2533 return READ_ONCE(*inner_map);
2536 static int htab_of_map_gen_lookup(struct bpf_map *map,
2537 struct bpf_insn *insn_buf)
2539 struct bpf_insn *insn = insn_buf;
2540 const int ret = BPF_REG_0;
2542 BUILD_BUG_ON(!__same_type(&__htab_map_lookup_elem,
2543 (void *(*)(struct bpf_map *map, void *key))NULL));
2544 *insn++ = BPF_EMIT_CALL(__htab_map_lookup_elem);
2545 *insn++ = BPF_JMP_IMM(BPF_JEQ, ret, 0, 2);
2546 *insn++ = BPF_ALU64_IMM(BPF_ADD, ret,
2547 offsetof(struct htab_elem, key) +
2548 round_up(map->key_size, 8));
2549 *insn++ = BPF_LDX_MEM(BPF_DW, ret, ret, 0);
2551 return insn - insn_buf;
2554 static void htab_of_map_free(struct bpf_map *map)
2556 bpf_map_meta_free(map->inner_map_meta);
2557 fd_htab_map_free(map);
2560 const struct bpf_map_ops htab_of_maps_map_ops = {
2561 .map_alloc_check = fd_htab_map_alloc_check,
2562 .map_alloc = htab_of_map_alloc,
2563 .map_free = htab_of_map_free,
2564 .map_get_next_key = htab_map_get_next_key,
2565 .map_lookup_elem = htab_of_map_lookup_elem,
2566 .map_delete_elem = htab_map_delete_elem,
2567 .map_fd_get_ptr = bpf_map_fd_get_ptr,
2568 .map_fd_put_ptr = bpf_map_fd_put_ptr,
2569 .map_fd_sys_lookup_elem = bpf_map_fd_sys_lookup_elem,
2570 .map_gen_lookup = htab_of_map_gen_lookup,
2571 .map_check_btf = map_check_no_btf,
2573 .map_btf_id = &htab_map_btf_ids[0],