67 	struct bpf_dtab *dtab;  member
104 static inline struct hlist_head *dev_map_index_hash(struct bpf_dtab *dtab,  in dev_map_index_hash()  argument
107 	return &dtab->dev_index_head[idx & (dtab->n_buckets - 1)];  in dev_map_index_hash()
110 static int dev_map_init_map(struct bpf_dtab *dtab, union bpf_attr *attr)  in dev_map_init_map()  argument
130 	bpf_map_init_from_attr(&dtab->map, attr);  in dev_map_init_map()
133 		dtab->n_buckets = roundup_pow_of_two(dtab->map.max_entries);  in dev_map_init_map()
135 		if (!dtab->n_buckets) /* Overflow check */  in dev_map_init_map()
140 		dtab->dev_index_head = dev_map_create_hash(dtab->n_buckets,  in dev_map_init_map()
141 							   dtab->map.numa_node);  in dev_map_init_map()
142 		if (!dtab->dev_index_head)  in dev_map_init_map()
145 		spin_lock_init(&dtab->index_lock);  in dev_map_init_map()
147 		dtab->netdev_map = bpf_map_area_alloc((u64) dtab->map.max_entries *  in dev_map_init_map()
149 						      dtab->map.numa_node);  in dev_map_init_map()
150 		if (!dtab->netdev_map)  in dev_map_init_map()
159 	struct bpf_dtab *dtab;  in dev_map_alloc()  local
165 	dtab = kzalloc(sizeof(*dtab), GFP_USER | __GFP_ACCOUNT);  in dev_map_alloc()
166 	if (!dtab)  in dev_map_alloc()
169 	err = dev_map_init_map(dtab, attr);  in dev_map_alloc()
171 		kfree(dtab);  in dev_map_alloc()
176 	list_add_tail_rcu(&dtab->list, &dev_map_list);  in dev_map_alloc()
179 	return &dtab->map;  in dev_map_alloc()
184 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_free()  local
198 	list_del_rcu(&dtab->list);  in dev_map_free()
207 	if (dtab->map.map_type == BPF_MAP_TYPE_DEVMAP_HASH) {  in dev_map_free()
208 		for (i = 0; i < dtab->n_buckets; i++) {  in dev_map_free()
213 			head = dev_map_index_hash(dtab, i);  in dev_map_free()
224 		bpf_map_area_free(dtab->dev_index_head);  in dev_map_free()
226 		for (i = 0; i < dtab->map.max_entries; i++) {  in dev_map_free()
229 			dev = rcu_dereference_raw(dtab->netdev_map[i]);  in dev_map_free()
239 		bpf_map_area_free(dtab->netdev_map);  in dev_map_free()
242 	kfree(dtab);  in dev_map_free()
247 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_get_next_key()  local
251 	if (index >= dtab->map.max_entries) {  in dev_map_get_next_key()
256 	if (index == dtab->map.max_entries - 1)  in dev_map_get_next_key()
268 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in __dev_map_hash_lookup_elem()  local
269 	struct hlist_head *head = dev_map_index_hash(dtab, key);  in __dev_map_hash_lookup_elem()
273 				 lockdep_is_held(&dtab->index_lock))  in __dev_map_hash_lookup_elem()
283 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_hash_get_next_key()  local
306 	i = idx & (dtab->n_buckets - 1);  in dev_map_hash_get_next_key()
310 	for (; i < dtab->n_buckets; i++) {  in dev_map_hash_get_next_key()
311 		head = dev_map_index_hash(dtab, i);  in dev_map_hash_get_next_key()
430 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in __dev_map_lookup_elem()  local
436 	obj = rcu_dereference_check(dtab->netdev_map[key],  in __dev_map_lookup_elem()
592 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_enqueue_multi()  local
612 			dst = rcu_dereference_check(dtab->netdev_map[i],  in dev_map_enqueue_multi()
633 		for (i = 0; i < dtab->n_buckets; i++) {  in dev_map_enqueue_multi()
634 			head = dev_map_index_hash(dtab, i);  in dev_map_enqueue_multi()
636 						 lockdep_is_held(&dtab->index_lock)) {  in dev_map_enqueue_multi()
714 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_redirect_multi()  local
730 			dst = rcu_dereference_check(dtab->netdev_map[i],  in dev_map_redirect_multi()
752 		for (i = 0; i < dtab->n_buckets; i++) {  in dev_map_redirect_multi()
753 			head = dev_map_index_hash(dtab, i);  in dev_map_redirect_multi()
813 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_delete_elem()  local
820 	old_dev = unrcu_pointer(xchg(&dtab->netdev_map[k], NULL));  in dev_map_delete_elem()
828 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in dev_map_hash_delete_elem()  local
834 	spin_lock_irqsave(&dtab->index_lock, flags);  in dev_map_hash_delete_elem()
838 		dtab->items--;  in dev_map_hash_delete_elem()
843 	spin_unlock_irqrestore(&dtab->index_lock, flags);  in dev_map_hash_delete_elem()
849 						    struct bpf_dtab *dtab,  in __dev_map_alloc_node()  argument
856 	dev = bpf_map_kmalloc_node(&dtab->map, sizeof(*dev),  in __dev_map_alloc_node()
858 				   dtab->map.numa_node);  in __dev_map_alloc_node()
876 	dev->dtab = dtab;  in __dev_map_alloc_node()
899 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in __dev_map_update_elem()  local
906 	if (unlikely(i >= dtab->map.max_entries))  in __dev_map_update_elem()
920 		dev = __dev_map_alloc_node(net, dtab, &val, i);  in __dev_map_update_elem()
929 	old_dev = unrcu_pointer(xchg(&dtab->netdev_map[i], RCU_INITIALIZER(dev)));  in __dev_map_update_elem()
946 	struct bpf_dtab *dtab = container_of(map, struct bpf_dtab, map);  in __dev_map_hash_update_elem()  local
959 	spin_lock_irqsave(&dtab->index_lock, flags);  in __dev_map_hash_update_elem()
965 	dev = __dev_map_alloc_node(net, dtab, &val, idx);  in __dev_map_hash_update_elem()
974 		if (dtab->items >= dtab->map.max_entries) {  in __dev_map_hash_update_elem()
975 			spin_unlock_irqrestore(&dtab->index_lock, flags);  in __dev_map_hash_update_elem()
979 		dtab->items++;  in __dev_map_hash_update_elem()
983 			   dev_map_index_hash(dtab, idx));  in __dev_map_hash_update_elem()
984 	spin_unlock_irqrestore(&dtab->index_lock, flags);  in __dev_map_hash_update_elem()
992 	spin_unlock_irqrestore(&dtab->index_lock, flags);  in __dev_map_hash_update_elem()
1047 static void dev_map_hash_remove_netdev(struct bpf_dtab *dtab,  in dev_map_hash_remove_netdev()  argument
1053 	spin_lock_irqsave(&dtab->index_lock, flags);  in dev_map_hash_remove_netdev()
1054 	for (i = 0; i < dtab->n_buckets; i++) {  in dev_map_hash_remove_netdev()
1059 		head = dev_map_index_hash(dtab, i);  in dev_map_hash_remove_netdev()
1065 			dtab->items--;  in dev_map_hash_remove_netdev()
1070 	spin_unlock_irqrestore(&dtab->index_lock, flags);  in dev_map_hash_remove_netdev()
1077 	struct bpf_dtab *dtab;  in dev_map_notification()  local
1100 		list_for_each_entry_rcu(dtab, &dev_map_list, list) {  in dev_map_notification()
1101 			if (dtab->map.map_type == BPF_MAP_TYPE_DEVMAP_HASH) {  in dev_map_notification()
1102 				dev_map_hash_remove_netdev(dtab, netdev);  in dev_map_notification()
1106 			for (i = 0; i < dtab->map.max_entries; i++) {  in dev_map_notification()
1109 				dev = rcu_dereference(dtab->netdev_map[i]);  in dev_map_notification()
1112 				odev = unrcu_pointer(cmpxchg(&dtab->netdev_map[i], RCU_INITIALIZER(dev), NULL));  in dev_map_notification()