1 // SPDX-License-Identifier: GPL-2.0
2 /* XSKMAP used for AF_XDP sockets
3 * Copyright(c) 2018 Intel Corporation.
7 #include <linux/capability.h>
8 #include <net/xdp_sock.h>
9 #include <linux/slab.h>
10 #include <linux/sched.h>
14 static struct xsk_map_node
*xsk_map_node_alloc(struct xsk_map
*map
,
15 struct xdp_sock
**map_entry
)
17 struct xsk_map_node
*node
;
19 node
= bpf_map_kzalloc(&map
->map
, sizeof(*node
),
20 GFP_ATOMIC
| __GFP_NOWARN
);
22 return ERR_PTR(-ENOMEM
);
24 bpf_map_inc(&map
->map
);
27 node
->map_entry
= map_entry
;
31 static void xsk_map_node_free(struct xsk_map_node
*node
)
33 bpf_map_put(&node
->map
->map
);
37 static void xsk_map_sock_add(struct xdp_sock
*xs
, struct xsk_map_node
*node
)
39 spin_lock_bh(&xs
->map_list_lock
);
40 list_add_tail(&node
->node
, &xs
->map_list
);
41 spin_unlock_bh(&xs
->map_list_lock
);
44 static void xsk_map_sock_delete(struct xdp_sock
*xs
,
45 struct xdp_sock
**map_entry
)
47 struct xsk_map_node
*n
, *tmp
;
49 spin_lock_bh(&xs
->map_list_lock
);
50 list_for_each_entry_safe(n
, tmp
, &xs
->map_list
, node
) {
51 if (map_entry
== n
->map_entry
) {
56 spin_unlock_bh(&xs
->map_list_lock
);
59 static struct bpf_map
*xsk_map_alloc(union bpf_attr
*attr
)
65 if (!capable(CAP_NET_ADMIN
))
66 return ERR_PTR(-EPERM
);
68 if (attr
->max_entries
== 0 || attr
->key_size
!= 4 ||
69 attr
->value_size
!= 4 ||
70 attr
->map_flags
& ~(BPF_F_NUMA_NODE
| BPF_F_RDONLY
| BPF_F_WRONLY
))
71 return ERR_PTR(-EINVAL
);
73 numa_node
= bpf_map_attr_numa_node(attr
);
74 size
= struct_size(m
, xsk_map
, attr
->max_entries
);
76 m
= bpf_map_area_alloc(size
, numa_node
);
78 return ERR_PTR(-ENOMEM
);
80 bpf_map_init_from_attr(&m
->map
, attr
);
81 spin_lock_init(&m
->lock
);
86 static void xsk_map_free(struct bpf_map
*map
)
88 struct xsk_map
*m
= container_of(map
, struct xsk_map
, map
);
90 bpf_clear_redirect_map(map
);
95 static int xsk_map_get_next_key(struct bpf_map
*map
, void *key
, void *next_key
)
97 struct xsk_map
*m
= container_of(map
, struct xsk_map
, map
);
98 u32 index
= key
? *(u32
*)key
: U32_MAX
;
101 if (index
>= m
->map
.max_entries
) {
106 if (index
== m
->map
.max_entries
- 1)
112 static int xsk_map_gen_lookup(struct bpf_map
*map
, struct bpf_insn
*insn_buf
)
114 const int ret
= BPF_REG_0
, mp
= BPF_REG_1
, index
= BPF_REG_2
;
115 struct bpf_insn
*insn
= insn_buf
;
117 *insn
++ = BPF_LDX_MEM(BPF_W
, ret
, index
, 0);
118 *insn
++ = BPF_JMP_IMM(BPF_JGE
, ret
, map
->max_entries
, 5);
119 *insn
++ = BPF_ALU64_IMM(BPF_LSH
, ret
, ilog2(sizeof(struct xsk_sock
*)));
120 *insn
++ = BPF_ALU64_IMM(BPF_ADD
, mp
, offsetof(struct xsk_map
, xsk_map
));
121 *insn
++ = BPF_ALU64_REG(BPF_ADD
, ret
, mp
);
122 *insn
++ = BPF_LDX_MEM(BPF_SIZEOF(struct xsk_sock
*), ret
, ret
, 0);
123 *insn
++ = BPF_JMP_IMM(BPF_JA
, 0, 0, 1);
124 *insn
++ = BPF_MOV64_IMM(ret
, 0);
125 return insn
- insn_buf
;
128 static void *xsk_map_lookup_elem(struct bpf_map
*map
, void *key
)
130 WARN_ON_ONCE(!rcu_read_lock_held());
131 return __xsk_map_lookup_elem(map
, *(u32
*)key
);
134 static void *xsk_map_lookup_elem_sys_only(struct bpf_map
*map
, void *key
)
136 return ERR_PTR(-EOPNOTSUPP
);
139 static int xsk_map_update_elem(struct bpf_map
*map
, void *key
, void *value
,
142 struct xsk_map
*m
= container_of(map
, struct xsk_map
, map
);
143 struct xdp_sock
*xs
, *old_xs
, **map_entry
;
144 u32 i
= *(u32
*)key
, fd
= *(u32
*)value
;
145 struct xsk_map_node
*node
;
149 if (unlikely(map_flags
> BPF_EXIST
))
151 if (unlikely(i
>= m
->map
.max_entries
))
154 sock
= sockfd_lookup(fd
, &err
);
158 if (sock
->sk
->sk_family
!= PF_XDP
) {
163 xs
= (struct xdp_sock
*)sock
->sk
;
165 map_entry
= &m
->xsk_map
[i
];
166 node
= xsk_map_node_alloc(m
, map_entry
);
169 return PTR_ERR(node
);
172 spin_lock_bh(&m
->lock
);
173 old_xs
= READ_ONCE(*map_entry
);
177 } else if (old_xs
&& map_flags
== BPF_NOEXIST
) {
180 } else if (!old_xs
&& map_flags
== BPF_EXIST
) {
184 xsk_map_sock_add(xs
, node
);
185 WRITE_ONCE(*map_entry
, xs
);
187 xsk_map_sock_delete(old_xs
, map_entry
);
188 spin_unlock_bh(&m
->lock
);
193 spin_unlock_bh(&m
->lock
);
195 xsk_map_node_free(node
);
199 static int xsk_map_delete_elem(struct bpf_map
*map
, void *key
)
201 struct xsk_map
*m
= container_of(map
, struct xsk_map
, map
);
202 struct xdp_sock
*old_xs
, **map_entry
;
205 if (k
>= map
->max_entries
)
208 spin_lock_bh(&m
->lock
);
209 map_entry
= &m
->xsk_map
[k
];
210 old_xs
= xchg(map_entry
, NULL
);
212 xsk_map_sock_delete(old_xs
, map_entry
);
213 spin_unlock_bh(&m
->lock
);
218 void xsk_map_try_sock_delete(struct xsk_map
*map
, struct xdp_sock
*xs
,
219 struct xdp_sock
**map_entry
)
221 spin_lock_bh(&map
->lock
);
222 if (READ_ONCE(*map_entry
) == xs
) {
223 WRITE_ONCE(*map_entry
, NULL
);
224 xsk_map_sock_delete(xs
, map_entry
);
226 spin_unlock_bh(&map
->lock
);
229 static bool xsk_map_meta_equal(const struct bpf_map
*meta0
,
230 const struct bpf_map
*meta1
)
232 return meta0
->max_entries
== meta1
->max_entries
&&
233 bpf_map_meta_equal(meta0
, meta1
);
236 static int xsk_map_btf_id
;
237 const struct bpf_map_ops xsk_map_ops
= {
238 .map_meta_equal
= xsk_map_meta_equal
,
239 .map_alloc
= xsk_map_alloc
,
240 .map_free
= xsk_map_free
,
241 .map_get_next_key
= xsk_map_get_next_key
,
242 .map_lookup_elem
= xsk_map_lookup_elem
,
243 .map_gen_lookup
= xsk_map_gen_lookup
,
244 .map_lookup_elem_sys_only
= xsk_map_lookup_elem_sys_only
,
245 .map_update_elem
= xsk_map_update_elem
,
246 .map_delete_elem
= xsk_map_delete_elem
,
247 .map_check_btf
= map_check_no_btf
,
248 .map_btf_name
= "xsk_map",
249 .map_btf_id
= &xsk_map_btf_id
,