Loading...
1// SPDX-License-Identifier: GPL-2.0
2/* Copyright (c) 2017 - 2018 Covalent IO, Inc. http://covalent.io */
3
4#include <linux/bpf.h>
5#include <linux/btf_ids.h>
6#include <linux/filter.h>
7#include <linux/errno.h>
8#include <linux/file.h>
9#include <linux/net.h>
10#include <linux/workqueue.h>
11#include <linux/skmsg.h>
12#include <linux/list.h>
13#include <linux/jhash.h>
14#include <linux/sock_diag.h>
15#include <net/udp.h>
16
17struct bpf_stab {
18 struct bpf_map map;
19 struct sock **sks;
20 struct sk_psock_progs progs;
21 spinlock_t lock;
22};
23
24#define SOCK_CREATE_FLAG_MASK \
25 (BPF_F_NUMA_NODE | BPF_F_RDONLY | BPF_F_WRONLY)
26
27static int sock_map_prog_update(struct bpf_map *map, struct bpf_prog *prog,
28 struct bpf_prog *old, u32 which);
29static struct sk_psock_progs *sock_map_progs(struct bpf_map *map);
30
31static struct bpf_map *sock_map_alloc(union bpf_attr *attr)
32{
33 struct bpf_stab *stab;
34
35 if (attr->max_entries == 0 ||
36 attr->key_size != 4 ||
37 (attr->value_size != sizeof(u32) &&
38 attr->value_size != sizeof(u64)) ||
39 attr->map_flags & ~SOCK_CREATE_FLAG_MASK)
40 return ERR_PTR(-EINVAL);
41
42 stab = bpf_map_area_alloc(sizeof(*stab), NUMA_NO_NODE);
43 if (!stab)
44 return ERR_PTR(-ENOMEM);
45
46 bpf_map_init_from_attr(&stab->map, attr);
47 spin_lock_init(&stab->lock);
48
49 stab->sks = bpf_map_area_alloc((u64) stab->map.max_entries *
50 sizeof(struct sock *),
51 stab->map.numa_node);
52 if (!stab->sks) {
53 bpf_map_area_free(stab);
54 return ERR_PTR(-ENOMEM);
55 }
56
57 return &stab->map;
58}
59
60int sock_map_get_from_fd(const union bpf_attr *attr, struct bpf_prog *prog)
61{
62 u32 ufd = attr->target_fd;
63 struct bpf_map *map;
64 struct fd f;
65 int ret;
66
67 if (attr->attach_flags || attr->replace_bpf_fd)
68 return -EINVAL;
69
70 f = fdget(ufd);
71 map = __bpf_map_get(f);
72 if (IS_ERR(map))
73 return PTR_ERR(map);
74 ret = sock_map_prog_update(map, prog, NULL, attr->attach_type);
75 fdput(f);
76 return ret;
77}
78
79int sock_map_prog_detach(const union bpf_attr *attr, enum bpf_prog_type ptype)
80{
81 u32 ufd = attr->target_fd;
82 struct bpf_prog *prog;
83 struct bpf_map *map;
84 struct fd f;
85 int ret;
86
87 if (attr->attach_flags || attr->replace_bpf_fd)
88 return -EINVAL;
89
90 f = fdget(ufd);
91 map = __bpf_map_get(f);
92 if (IS_ERR(map))
93 return PTR_ERR(map);
94
95 prog = bpf_prog_get(attr->attach_bpf_fd);
96 if (IS_ERR(prog)) {
97 ret = PTR_ERR(prog);
98 goto put_map;
99 }
100
101 if (prog->type != ptype) {
102 ret = -EINVAL;
103 goto put_prog;
104 }
105
106 ret = sock_map_prog_update(map, NULL, prog, attr->attach_type);
107put_prog:
108 bpf_prog_put(prog);
109put_map:
110 fdput(f);
111 return ret;
112}
113
114static void sock_map_sk_acquire(struct sock *sk)
115 __acquires(&sk->sk_lock.slock)
116{
117 lock_sock(sk);
118 rcu_read_lock();
119}
120
121static void sock_map_sk_release(struct sock *sk)
122 __releases(&sk->sk_lock.slock)
123{
124 rcu_read_unlock();
125 release_sock(sk);
126}
127
128static void sock_map_add_link(struct sk_psock *psock,
129 struct sk_psock_link *link,
130 struct bpf_map *map, void *link_raw)
131{
132 link->link_raw = link_raw;
133 link->map = map;
134 spin_lock_bh(&psock->link_lock);
135 list_add_tail(&link->list, &psock->link);
136 spin_unlock_bh(&psock->link_lock);
137}
138
139static void sock_map_del_link(struct sock *sk,
140 struct sk_psock *psock, void *link_raw)
141{
142 bool strp_stop = false, verdict_stop = false;
143 struct sk_psock_link *link, *tmp;
144
145 spin_lock_bh(&psock->link_lock);
146 list_for_each_entry_safe(link, tmp, &psock->link, list) {
147 if (link->link_raw == link_raw) {
148 struct bpf_map *map = link->map;
149 struct sk_psock_progs *progs = sock_map_progs(map);
150
151 if (psock->saved_data_ready && progs->stream_parser)
152 strp_stop = true;
153 if (psock->saved_data_ready && progs->stream_verdict)
154 verdict_stop = true;
155 if (psock->saved_data_ready && progs->skb_verdict)
156 verdict_stop = true;
157 list_del(&link->list);
158 sk_psock_free_link(link);
159 }
160 }
161 spin_unlock_bh(&psock->link_lock);
162 if (strp_stop || verdict_stop) {
163 write_lock_bh(&sk->sk_callback_lock);
164 if (strp_stop)
165 sk_psock_stop_strp(sk, psock);
166 if (verdict_stop)
167 sk_psock_stop_verdict(sk, psock);
168
169 if (psock->psock_update_sk_prot)
170 psock->psock_update_sk_prot(sk, psock, false);
171 write_unlock_bh(&sk->sk_callback_lock);
172 }
173}
174
175static void sock_map_unref(struct sock *sk, void *link_raw)
176{
177 struct sk_psock *psock = sk_psock(sk);
178
179 if (likely(psock)) {
180 sock_map_del_link(sk, psock, link_raw);
181 sk_psock_put(sk, psock);
182 }
183}
184
185static int sock_map_init_proto(struct sock *sk, struct sk_psock *psock)
186{
187 if (!sk->sk_prot->psock_update_sk_prot)
188 return -EINVAL;
189 psock->psock_update_sk_prot = sk->sk_prot->psock_update_sk_prot;
190 return sk->sk_prot->psock_update_sk_prot(sk, psock, false);
191}
192
193static struct sk_psock *sock_map_psock_get_checked(struct sock *sk)
194{
195 struct sk_psock *psock;
196
197 rcu_read_lock();
198 psock = sk_psock(sk);
199 if (psock) {
200 if (sk->sk_prot->close != sock_map_close) {
201 psock = ERR_PTR(-EBUSY);
202 goto out;
203 }
204
205 if (!refcount_inc_not_zero(&psock->refcnt))
206 psock = ERR_PTR(-EBUSY);
207 }
208out:
209 rcu_read_unlock();
210 return psock;
211}
212
213static int sock_map_link(struct bpf_map *map, struct sock *sk)
214{
215 struct sk_psock_progs *progs = sock_map_progs(map);
216 struct bpf_prog *stream_verdict = NULL;
217 struct bpf_prog *stream_parser = NULL;
218 struct bpf_prog *skb_verdict = NULL;
219 struct bpf_prog *msg_parser = NULL;
220 struct sk_psock *psock;
221 int ret;
222
223 stream_verdict = READ_ONCE(progs->stream_verdict);
224 if (stream_verdict) {
225 stream_verdict = bpf_prog_inc_not_zero(stream_verdict);
226 if (IS_ERR(stream_verdict))
227 return PTR_ERR(stream_verdict);
228 }
229
230 stream_parser = READ_ONCE(progs->stream_parser);
231 if (stream_parser) {
232 stream_parser = bpf_prog_inc_not_zero(stream_parser);
233 if (IS_ERR(stream_parser)) {
234 ret = PTR_ERR(stream_parser);
235 goto out_put_stream_verdict;
236 }
237 }
238
239 msg_parser = READ_ONCE(progs->msg_parser);
240 if (msg_parser) {
241 msg_parser = bpf_prog_inc_not_zero(msg_parser);
242 if (IS_ERR(msg_parser)) {
243 ret = PTR_ERR(msg_parser);
244 goto out_put_stream_parser;
245 }
246 }
247
248 skb_verdict = READ_ONCE(progs->skb_verdict);
249 if (skb_verdict) {
250 skb_verdict = bpf_prog_inc_not_zero(skb_verdict);
251 if (IS_ERR(skb_verdict)) {
252 ret = PTR_ERR(skb_verdict);
253 goto out_put_msg_parser;
254 }
255 }
256
257 psock = sock_map_psock_get_checked(sk);
258 if (IS_ERR(psock)) {
259 ret = PTR_ERR(psock);
260 goto out_progs;
261 }
262
263 if (psock) {
264 if ((msg_parser && READ_ONCE(psock->progs.msg_parser)) ||
265 (stream_parser && READ_ONCE(psock->progs.stream_parser)) ||
266 (skb_verdict && READ_ONCE(psock->progs.skb_verdict)) ||
267 (skb_verdict && READ_ONCE(psock->progs.stream_verdict)) ||
268 (stream_verdict && READ_ONCE(psock->progs.skb_verdict)) ||
269 (stream_verdict && READ_ONCE(psock->progs.stream_verdict))) {
270 sk_psock_put(sk, psock);
271 ret = -EBUSY;
272 goto out_progs;
273 }
274 } else {
275 psock = sk_psock_init(sk, map->numa_node);
276 if (IS_ERR(psock)) {
277 ret = PTR_ERR(psock);
278 goto out_progs;
279 }
280 }
281
282 if (msg_parser)
283 psock_set_prog(&psock->progs.msg_parser, msg_parser);
284 if (stream_parser)
285 psock_set_prog(&psock->progs.stream_parser, stream_parser);
286 if (stream_verdict)
287 psock_set_prog(&psock->progs.stream_verdict, stream_verdict);
288 if (skb_verdict)
289 psock_set_prog(&psock->progs.skb_verdict, skb_verdict);
290
291 /* msg_* and stream_* programs references tracked in psock after this
292 * point. Reference dec and cleanup will occur through psock destructor
293 */
294 ret = sock_map_init_proto(sk, psock);
295 if (ret < 0) {
296 sk_psock_put(sk, psock);
297 goto out;
298 }
299
300 write_lock_bh(&sk->sk_callback_lock);
301 if (stream_parser && stream_verdict && !psock->saved_data_ready) {
302 ret = sk_psock_init_strp(sk, psock);
303 if (ret) {
304 write_unlock_bh(&sk->sk_callback_lock);
305 sk_psock_put(sk, psock);
306 goto out;
307 }
308 sk_psock_start_strp(sk, psock);
309 } else if (!stream_parser && stream_verdict && !psock->saved_data_ready) {
310 sk_psock_start_verdict(sk,psock);
311 } else if (!stream_verdict && skb_verdict && !psock->saved_data_ready) {
312 sk_psock_start_verdict(sk, psock);
313 }
314 write_unlock_bh(&sk->sk_callback_lock);
315 return 0;
316out_progs:
317 if (skb_verdict)
318 bpf_prog_put(skb_verdict);
319out_put_msg_parser:
320 if (msg_parser)
321 bpf_prog_put(msg_parser);
322out_put_stream_parser:
323 if (stream_parser)
324 bpf_prog_put(stream_parser);
325out_put_stream_verdict:
326 if (stream_verdict)
327 bpf_prog_put(stream_verdict);
328out:
329 return ret;
330}
331
332static void sock_map_free(struct bpf_map *map)
333{
334 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
335 int i;
336
337 /* After the sync no updates or deletes will be in-flight so it
338 * is safe to walk map and remove entries without risking a race
339 * in EEXIST update case.
340 */
341 synchronize_rcu();
342 for (i = 0; i < stab->map.max_entries; i++) {
343 struct sock **psk = &stab->sks[i];
344 struct sock *sk;
345
346 sk = xchg(psk, NULL);
347 if (sk) {
348 sock_hold(sk);
349 lock_sock(sk);
350 rcu_read_lock();
351 sock_map_unref(sk, psk);
352 rcu_read_unlock();
353 release_sock(sk);
354 sock_put(sk);
355 }
356 }
357
358 /* wait for psock readers accessing its map link */
359 synchronize_rcu();
360
361 bpf_map_area_free(stab->sks);
362 bpf_map_area_free(stab);
363}
364
365static void sock_map_release_progs(struct bpf_map *map)
366{
367 psock_progs_drop(&container_of(map, struct bpf_stab, map)->progs);
368}
369
370static struct sock *__sock_map_lookup_elem(struct bpf_map *map, u32 key)
371{
372 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
373
374 WARN_ON_ONCE(!rcu_read_lock_held());
375
376 if (unlikely(key >= map->max_entries))
377 return NULL;
378 return READ_ONCE(stab->sks[key]);
379}
380
381static void *sock_map_lookup(struct bpf_map *map, void *key)
382{
383 struct sock *sk;
384
385 sk = __sock_map_lookup_elem(map, *(u32 *)key);
386 if (!sk)
387 return NULL;
388 if (sk_is_refcounted(sk) && !refcount_inc_not_zero(&sk->sk_refcnt))
389 return NULL;
390 return sk;
391}
392
393static void *sock_map_lookup_sys(struct bpf_map *map, void *key)
394{
395 struct sock *sk;
396
397 if (map->value_size != sizeof(u64))
398 return ERR_PTR(-ENOSPC);
399
400 sk = __sock_map_lookup_elem(map, *(u32 *)key);
401 if (!sk)
402 return ERR_PTR(-ENOENT);
403
404 __sock_gen_cookie(sk);
405 return &sk->sk_cookie;
406}
407
408static int __sock_map_delete(struct bpf_stab *stab, struct sock *sk_test,
409 struct sock **psk)
410{
411 struct sock *sk;
412 int err = 0;
413
414 spin_lock_bh(&stab->lock);
415 sk = *psk;
416 if (!sk_test || sk_test == sk)
417 sk = xchg(psk, NULL);
418
419 if (likely(sk))
420 sock_map_unref(sk, psk);
421 else
422 err = -EINVAL;
423
424 spin_unlock_bh(&stab->lock);
425 return err;
426}
427
428static void sock_map_delete_from_link(struct bpf_map *map, struct sock *sk,
429 void *link_raw)
430{
431 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
432
433 __sock_map_delete(stab, sk, link_raw);
434}
435
436static long sock_map_delete_elem(struct bpf_map *map, void *key)
437{
438 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
439 u32 i = *(u32 *)key;
440 struct sock **psk;
441
442 if (unlikely(i >= map->max_entries))
443 return -EINVAL;
444
445 psk = &stab->sks[i];
446 return __sock_map_delete(stab, NULL, psk);
447}
448
449static int sock_map_get_next_key(struct bpf_map *map, void *key, void *next)
450{
451 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
452 u32 i = key ? *(u32 *)key : U32_MAX;
453 u32 *key_next = next;
454
455 if (i == stab->map.max_entries - 1)
456 return -ENOENT;
457 if (i >= stab->map.max_entries)
458 *key_next = 0;
459 else
460 *key_next = i + 1;
461 return 0;
462}
463
464static int sock_map_update_common(struct bpf_map *map, u32 idx,
465 struct sock *sk, u64 flags)
466{
467 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
468 struct sk_psock_link *link;
469 struct sk_psock *psock;
470 struct sock *osk;
471 int ret;
472
473 WARN_ON_ONCE(!rcu_read_lock_held());
474 if (unlikely(flags > BPF_EXIST))
475 return -EINVAL;
476 if (unlikely(idx >= map->max_entries))
477 return -E2BIG;
478
479 link = sk_psock_init_link();
480 if (!link)
481 return -ENOMEM;
482
483 ret = sock_map_link(map, sk);
484 if (ret < 0)
485 goto out_free;
486
487 psock = sk_psock(sk);
488 WARN_ON_ONCE(!psock);
489
490 spin_lock_bh(&stab->lock);
491 osk = stab->sks[idx];
492 if (osk && flags == BPF_NOEXIST) {
493 ret = -EEXIST;
494 goto out_unlock;
495 } else if (!osk && flags == BPF_EXIST) {
496 ret = -ENOENT;
497 goto out_unlock;
498 }
499
500 sock_map_add_link(psock, link, map, &stab->sks[idx]);
501 stab->sks[idx] = sk;
502 if (osk)
503 sock_map_unref(osk, &stab->sks[idx]);
504 spin_unlock_bh(&stab->lock);
505 return 0;
506out_unlock:
507 spin_unlock_bh(&stab->lock);
508 if (psock)
509 sk_psock_put(sk, psock);
510out_free:
511 sk_psock_free_link(link);
512 return ret;
513}
514
515static bool sock_map_op_okay(const struct bpf_sock_ops_kern *ops)
516{
517 return ops->op == BPF_SOCK_OPS_PASSIVE_ESTABLISHED_CB ||
518 ops->op == BPF_SOCK_OPS_ACTIVE_ESTABLISHED_CB ||
519 ops->op == BPF_SOCK_OPS_TCP_LISTEN_CB;
520}
521
522static bool sock_map_redirect_allowed(const struct sock *sk)
523{
524 if (sk_is_tcp(sk))
525 return sk->sk_state != TCP_LISTEN;
526 else
527 return sk->sk_state == TCP_ESTABLISHED;
528}
529
530static bool sock_map_sk_is_suitable(const struct sock *sk)
531{
532 return !!sk->sk_prot->psock_update_sk_prot;
533}
534
535static bool sock_map_sk_state_allowed(const struct sock *sk)
536{
537 if (sk_is_tcp(sk))
538 return (1 << sk->sk_state) & (TCPF_ESTABLISHED | TCPF_LISTEN);
539 if (sk_is_stream_unix(sk))
540 return (1 << sk->sk_state) & TCPF_ESTABLISHED;
541 return true;
542}
543
544static int sock_hash_update_common(struct bpf_map *map, void *key,
545 struct sock *sk, u64 flags);
546
547int sock_map_update_elem_sys(struct bpf_map *map, void *key, void *value,
548 u64 flags)
549{
550 struct socket *sock;
551 struct sock *sk;
552 int ret;
553 u64 ufd;
554
555 if (map->value_size == sizeof(u64))
556 ufd = *(u64 *)value;
557 else
558 ufd = *(u32 *)value;
559 if (ufd > S32_MAX)
560 return -EINVAL;
561
562 sock = sockfd_lookup(ufd, &ret);
563 if (!sock)
564 return ret;
565 sk = sock->sk;
566 if (!sk) {
567 ret = -EINVAL;
568 goto out;
569 }
570 if (!sock_map_sk_is_suitable(sk)) {
571 ret = -EOPNOTSUPP;
572 goto out;
573 }
574
575 sock_map_sk_acquire(sk);
576 if (!sock_map_sk_state_allowed(sk))
577 ret = -EOPNOTSUPP;
578 else if (map->map_type == BPF_MAP_TYPE_SOCKMAP)
579 ret = sock_map_update_common(map, *(u32 *)key, sk, flags);
580 else
581 ret = sock_hash_update_common(map, key, sk, flags);
582 sock_map_sk_release(sk);
583out:
584 sockfd_put(sock);
585 return ret;
586}
587
588static long sock_map_update_elem(struct bpf_map *map, void *key,
589 void *value, u64 flags)
590{
591 struct sock *sk = (struct sock *)value;
592 int ret;
593
594 if (unlikely(!sk || !sk_fullsock(sk)))
595 return -EINVAL;
596
597 if (!sock_map_sk_is_suitable(sk))
598 return -EOPNOTSUPP;
599
600 local_bh_disable();
601 bh_lock_sock(sk);
602 if (!sock_map_sk_state_allowed(sk))
603 ret = -EOPNOTSUPP;
604 else if (map->map_type == BPF_MAP_TYPE_SOCKMAP)
605 ret = sock_map_update_common(map, *(u32 *)key, sk, flags);
606 else
607 ret = sock_hash_update_common(map, key, sk, flags);
608 bh_unlock_sock(sk);
609 local_bh_enable();
610 return ret;
611}
612
613BPF_CALL_4(bpf_sock_map_update, struct bpf_sock_ops_kern *, sops,
614 struct bpf_map *, map, void *, key, u64, flags)
615{
616 WARN_ON_ONCE(!rcu_read_lock_held());
617
618 if (likely(sock_map_sk_is_suitable(sops->sk) &&
619 sock_map_op_okay(sops)))
620 return sock_map_update_common(map, *(u32 *)key, sops->sk,
621 flags);
622 return -EOPNOTSUPP;
623}
624
625const struct bpf_func_proto bpf_sock_map_update_proto = {
626 .func = bpf_sock_map_update,
627 .gpl_only = false,
628 .pkt_access = true,
629 .ret_type = RET_INTEGER,
630 .arg1_type = ARG_PTR_TO_CTX,
631 .arg2_type = ARG_CONST_MAP_PTR,
632 .arg3_type = ARG_PTR_TO_MAP_KEY,
633 .arg4_type = ARG_ANYTHING,
634};
635
636BPF_CALL_4(bpf_sk_redirect_map, struct sk_buff *, skb,
637 struct bpf_map *, map, u32, key, u64, flags)
638{
639 struct sock *sk;
640
641 if (unlikely(flags & ~(BPF_F_INGRESS)))
642 return SK_DROP;
643
644 sk = __sock_map_lookup_elem(map, key);
645 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
646 return SK_DROP;
647
648 skb_bpf_set_redir(skb, sk, flags & BPF_F_INGRESS);
649 return SK_PASS;
650}
651
652const struct bpf_func_proto bpf_sk_redirect_map_proto = {
653 .func = bpf_sk_redirect_map,
654 .gpl_only = false,
655 .ret_type = RET_INTEGER,
656 .arg1_type = ARG_PTR_TO_CTX,
657 .arg2_type = ARG_CONST_MAP_PTR,
658 .arg3_type = ARG_ANYTHING,
659 .arg4_type = ARG_ANYTHING,
660};
661
662BPF_CALL_4(bpf_msg_redirect_map, struct sk_msg *, msg,
663 struct bpf_map *, map, u32, key, u64, flags)
664{
665 struct sock *sk;
666
667 if (unlikely(flags & ~(BPF_F_INGRESS)))
668 return SK_DROP;
669
670 sk = __sock_map_lookup_elem(map, key);
671 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
672 return SK_DROP;
673 if (!(flags & BPF_F_INGRESS) && !sk_is_tcp(sk))
674 return SK_DROP;
675
676 msg->flags = flags;
677 msg->sk_redir = sk;
678 return SK_PASS;
679}
680
681const struct bpf_func_proto bpf_msg_redirect_map_proto = {
682 .func = bpf_msg_redirect_map,
683 .gpl_only = false,
684 .ret_type = RET_INTEGER,
685 .arg1_type = ARG_PTR_TO_CTX,
686 .arg2_type = ARG_CONST_MAP_PTR,
687 .arg3_type = ARG_ANYTHING,
688 .arg4_type = ARG_ANYTHING,
689};
690
691struct sock_map_seq_info {
692 struct bpf_map *map;
693 struct sock *sk;
694 u32 index;
695};
696
697struct bpf_iter__sockmap {
698 __bpf_md_ptr(struct bpf_iter_meta *, meta);
699 __bpf_md_ptr(struct bpf_map *, map);
700 __bpf_md_ptr(void *, key);
701 __bpf_md_ptr(struct sock *, sk);
702};
703
704DEFINE_BPF_ITER_FUNC(sockmap, struct bpf_iter_meta *meta,
705 struct bpf_map *map, void *key,
706 struct sock *sk)
707
708static void *sock_map_seq_lookup_elem(struct sock_map_seq_info *info)
709{
710 if (unlikely(info->index >= info->map->max_entries))
711 return NULL;
712
713 info->sk = __sock_map_lookup_elem(info->map, info->index);
714
715 /* can't return sk directly, since that might be NULL */
716 return info;
717}
718
719static void *sock_map_seq_start(struct seq_file *seq, loff_t *pos)
720 __acquires(rcu)
721{
722 struct sock_map_seq_info *info = seq->private;
723
724 if (*pos == 0)
725 ++*pos;
726
727 /* pairs with sock_map_seq_stop */
728 rcu_read_lock();
729 return sock_map_seq_lookup_elem(info);
730}
731
732static void *sock_map_seq_next(struct seq_file *seq, void *v, loff_t *pos)
733 __must_hold(rcu)
734{
735 struct sock_map_seq_info *info = seq->private;
736
737 ++*pos;
738 ++info->index;
739
740 return sock_map_seq_lookup_elem(info);
741}
742
743static int sock_map_seq_show(struct seq_file *seq, void *v)
744 __must_hold(rcu)
745{
746 struct sock_map_seq_info *info = seq->private;
747 struct bpf_iter__sockmap ctx = {};
748 struct bpf_iter_meta meta;
749 struct bpf_prog *prog;
750
751 meta.seq = seq;
752 prog = bpf_iter_get_info(&meta, !v);
753 if (!prog)
754 return 0;
755
756 ctx.meta = &meta;
757 ctx.map = info->map;
758 if (v) {
759 ctx.key = &info->index;
760 ctx.sk = info->sk;
761 }
762
763 return bpf_iter_run_prog(prog, &ctx);
764}
765
766static void sock_map_seq_stop(struct seq_file *seq, void *v)
767 __releases(rcu)
768{
769 if (!v)
770 (void)sock_map_seq_show(seq, NULL);
771
772 /* pairs with sock_map_seq_start */
773 rcu_read_unlock();
774}
775
776static const struct seq_operations sock_map_seq_ops = {
777 .start = sock_map_seq_start,
778 .next = sock_map_seq_next,
779 .stop = sock_map_seq_stop,
780 .show = sock_map_seq_show,
781};
782
783static int sock_map_init_seq_private(void *priv_data,
784 struct bpf_iter_aux_info *aux)
785{
786 struct sock_map_seq_info *info = priv_data;
787
788 bpf_map_inc_with_uref(aux->map);
789 info->map = aux->map;
790 return 0;
791}
792
793static void sock_map_fini_seq_private(void *priv_data)
794{
795 struct sock_map_seq_info *info = priv_data;
796
797 bpf_map_put_with_uref(info->map);
798}
799
800static u64 sock_map_mem_usage(const struct bpf_map *map)
801{
802 u64 usage = sizeof(struct bpf_stab);
803
804 usage += (u64)map->max_entries * sizeof(struct sock *);
805 return usage;
806}
807
808static const struct bpf_iter_seq_info sock_map_iter_seq_info = {
809 .seq_ops = &sock_map_seq_ops,
810 .init_seq_private = sock_map_init_seq_private,
811 .fini_seq_private = sock_map_fini_seq_private,
812 .seq_priv_size = sizeof(struct sock_map_seq_info),
813};
814
815BTF_ID_LIST_SINGLE(sock_map_btf_ids, struct, bpf_stab)
816const struct bpf_map_ops sock_map_ops = {
817 .map_meta_equal = bpf_map_meta_equal,
818 .map_alloc = sock_map_alloc,
819 .map_free = sock_map_free,
820 .map_get_next_key = sock_map_get_next_key,
821 .map_lookup_elem_sys_only = sock_map_lookup_sys,
822 .map_update_elem = sock_map_update_elem,
823 .map_delete_elem = sock_map_delete_elem,
824 .map_lookup_elem = sock_map_lookup,
825 .map_release_uref = sock_map_release_progs,
826 .map_check_btf = map_check_no_btf,
827 .map_mem_usage = sock_map_mem_usage,
828 .map_btf_id = &sock_map_btf_ids[0],
829 .iter_seq_info = &sock_map_iter_seq_info,
830};
831
832struct bpf_shtab_elem {
833 struct rcu_head rcu;
834 u32 hash;
835 struct sock *sk;
836 struct hlist_node node;
837 u8 key[];
838};
839
840struct bpf_shtab_bucket {
841 struct hlist_head head;
842 spinlock_t lock;
843};
844
845struct bpf_shtab {
846 struct bpf_map map;
847 struct bpf_shtab_bucket *buckets;
848 u32 buckets_num;
849 u32 elem_size;
850 struct sk_psock_progs progs;
851 atomic_t count;
852};
853
854static inline u32 sock_hash_bucket_hash(const void *key, u32 len)
855{
856 return jhash(key, len, 0);
857}
858
859static struct bpf_shtab_bucket *sock_hash_select_bucket(struct bpf_shtab *htab,
860 u32 hash)
861{
862 return &htab->buckets[hash & (htab->buckets_num - 1)];
863}
864
865static struct bpf_shtab_elem *
866sock_hash_lookup_elem_raw(struct hlist_head *head, u32 hash, void *key,
867 u32 key_size)
868{
869 struct bpf_shtab_elem *elem;
870
871 hlist_for_each_entry_rcu(elem, head, node) {
872 if (elem->hash == hash &&
873 !memcmp(&elem->key, key, key_size))
874 return elem;
875 }
876
877 return NULL;
878}
879
880static struct sock *__sock_hash_lookup_elem(struct bpf_map *map, void *key)
881{
882 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
883 u32 key_size = map->key_size, hash;
884 struct bpf_shtab_bucket *bucket;
885 struct bpf_shtab_elem *elem;
886
887 WARN_ON_ONCE(!rcu_read_lock_held());
888
889 hash = sock_hash_bucket_hash(key, key_size);
890 bucket = sock_hash_select_bucket(htab, hash);
891 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
892
893 return elem ? elem->sk : NULL;
894}
895
896static void sock_hash_free_elem(struct bpf_shtab *htab,
897 struct bpf_shtab_elem *elem)
898{
899 atomic_dec(&htab->count);
900 kfree_rcu(elem, rcu);
901}
902
903static void sock_hash_delete_from_link(struct bpf_map *map, struct sock *sk,
904 void *link_raw)
905{
906 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
907 struct bpf_shtab_elem *elem_probe, *elem = link_raw;
908 struct bpf_shtab_bucket *bucket;
909
910 WARN_ON_ONCE(!rcu_read_lock_held());
911 bucket = sock_hash_select_bucket(htab, elem->hash);
912
913 /* elem may be deleted in parallel from the map, but access here
914 * is okay since it's going away only after RCU grace period.
915 * However, we need to check whether it's still present.
916 */
917 spin_lock_bh(&bucket->lock);
918 elem_probe = sock_hash_lookup_elem_raw(&bucket->head, elem->hash,
919 elem->key, map->key_size);
920 if (elem_probe && elem_probe == elem) {
921 hlist_del_rcu(&elem->node);
922 sock_map_unref(elem->sk, elem);
923 sock_hash_free_elem(htab, elem);
924 }
925 spin_unlock_bh(&bucket->lock);
926}
927
928static long sock_hash_delete_elem(struct bpf_map *map, void *key)
929{
930 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
931 u32 hash, key_size = map->key_size;
932 struct bpf_shtab_bucket *bucket;
933 struct bpf_shtab_elem *elem;
934 int ret = -ENOENT;
935
936 hash = sock_hash_bucket_hash(key, key_size);
937 bucket = sock_hash_select_bucket(htab, hash);
938
939 spin_lock_bh(&bucket->lock);
940 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
941 if (elem) {
942 hlist_del_rcu(&elem->node);
943 sock_map_unref(elem->sk, elem);
944 sock_hash_free_elem(htab, elem);
945 ret = 0;
946 }
947 spin_unlock_bh(&bucket->lock);
948 return ret;
949}
950
951static struct bpf_shtab_elem *sock_hash_alloc_elem(struct bpf_shtab *htab,
952 void *key, u32 key_size,
953 u32 hash, struct sock *sk,
954 struct bpf_shtab_elem *old)
955{
956 struct bpf_shtab_elem *new;
957
958 if (atomic_inc_return(&htab->count) > htab->map.max_entries) {
959 if (!old) {
960 atomic_dec(&htab->count);
961 return ERR_PTR(-E2BIG);
962 }
963 }
964
965 new = bpf_map_kmalloc_node(&htab->map, htab->elem_size,
966 GFP_ATOMIC | __GFP_NOWARN,
967 htab->map.numa_node);
968 if (!new) {
969 atomic_dec(&htab->count);
970 return ERR_PTR(-ENOMEM);
971 }
972 memcpy(new->key, key, key_size);
973 new->sk = sk;
974 new->hash = hash;
975 return new;
976}
977
978static int sock_hash_update_common(struct bpf_map *map, void *key,
979 struct sock *sk, u64 flags)
980{
981 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
982 u32 key_size = map->key_size, hash;
983 struct bpf_shtab_elem *elem, *elem_new;
984 struct bpf_shtab_bucket *bucket;
985 struct sk_psock_link *link;
986 struct sk_psock *psock;
987 int ret;
988
989 WARN_ON_ONCE(!rcu_read_lock_held());
990 if (unlikely(flags > BPF_EXIST))
991 return -EINVAL;
992
993 link = sk_psock_init_link();
994 if (!link)
995 return -ENOMEM;
996
997 ret = sock_map_link(map, sk);
998 if (ret < 0)
999 goto out_free;
1000
1001 psock = sk_psock(sk);
1002 WARN_ON_ONCE(!psock);
1003
1004 hash = sock_hash_bucket_hash(key, key_size);
1005 bucket = sock_hash_select_bucket(htab, hash);
1006
1007 spin_lock_bh(&bucket->lock);
1008 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
1009 if (elem && flags == BPF_NOEXIST) {
1010 ret = -EEXIST;
1011 goto out_unlock;
1012 } else if (!elem && flags == BPF_EXIST) {
1013 ret = -ENOENT;
1014 goto out_unlock;
1015 }
1016
1017 elem_new = sock_hash_alloc_elem(htab, key, key_size, hash, sk, elem);
1018 if (IS_ERR(elem_new)) {
1019 ret = PTR_ERR(elem_new);
1020 goto out_unlock;
1021 }
1022
1023 sock_map_add_link(psock, link, map, elem_new);
1024 /* Add new element to the head of the list, so that
1025 * concurrent search will find it before old elem.
1026 */
1027 hlist_add_head_rcu(&elem_new->node, &bucket->head);
1028 if (elem) {
1029 hlist_del_rcu(&elem->node);
1030 sock_map_unref(elem->sk, elem);
1031 sock_hash_free_elem(htab, elem);
1032 }
1033 spin_unlock_bh(&bucket->lock);
1034 return 0;
1035out_unlock:
1036 spin_unlock_bh(&bucket->lock);
1037 sk_psock_put(sk, psock);
1038out_free:
1039 sk_psock_free_link(link);
1040 return ret;
1041}
1042
1043static int sock_hash_get_next_key(struct bpf_map *map, void *key,
1044 void *key_next)
1045{
1046 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1047 struct bpf_shtab_elem *elem, *elem_next;
1048 u32 hash, key_size = map->key_size;
1049 struct hlist_head *head;
1050 int i = 0;
1051
1052 if (!key)
1053 goto find_first_elem;
1054 hash = sock_hash_bucket_hash(key, key_size);
1055 head = &sock_hash_select_bucket(htab, hash)->head;
1056 elem = sock_hash_lookup_elem_raw(head, hash, key, key_size);
1057 if (!elem)
1058 goto find_first_elem;
1059
1060 elem_next = hlist_entry_safe(rcu_dereference(hlist_next_rcu(&elem->node)),
1061 struct bpf_shtab_elem, node);
1062 if (elem_next) {
1063 memcpy(key_next, elem_next->key, key_size);
1064 return 0;
1065 }
1066
1067 i = hash & (htab->buckets_num - 1);
1068 i++;
1069find_first_elem:
1070 for (; i < htab->buckets_num; i++) {
1071 head = &sock_hash_select_bucket(htab, i)->head;
1072 elem_next = hlist_entry_safe(rcu_dereference(hlist_first_rcu(head)),
1073 struct bpf_shtab_elem, node);
1074 if (elem_next) {
1075 memcpy(key_next, elem_next->key, key_size);
1076 return 0;
1077 }
1078 }
1079
1080 return -ENOENT;
1081}
1082
1083static struct bpf_map *sock_hash_alloc(union bpf_attr *attr)
1084{
1085 struct bpf_shtab *htab;
1086 int i, err;
1087
1088 if (attr->max_entries == 0 ||
1089 attr->key_size == 0 ||
1090 (attr->value_size != sizeof(u32) &&
1091 attr->value_size != sizeof(u64)) ||
1092 attr->map_flags & ~SOCK_CREATE_FLAG_MASK)
1093 return ERR_PTR(-EINVAL);
1094 if (attr->key_size > MAX_BPF_STACK)
1095 return ERR_PTR(-E2BIG);
1096
1097 htab = bpf_map_area_alloc(sizeof(*htab), NUMA_NO_NODE);
1098 if (!htab)
1099 return ERR_PTR(-ENOMEM);
1100
1101 bpf_map_init_from_attr(&htab->map, attr);
1102
1103 htab->buckets_num = roundup_pow_of_two(htab->map.max_entries);
1104 htab->elem_size = sizeof(struct bpf_shtab_elem) +
1105 round_up(htab->map.key_size, 8);
1106 if (htab->buckets_num == 0 ||
1107 htab->buckets_num > U32_MAX / sizeof(struct bpf_shtab_bucket)) {
1108 err = -EINVAL;
1109 goto free_htab;
1110 }
1111
1112 htab->buckets = bpf_map_area_alloc(htab->buckets_num *
1113 sizeof(struct bpf_shtab_bucket),
1114 htab->map.numa_node);
1115 if (!htab->buckets) {
1116 err = -ENOMEM;
1117 goto free_htab;
1118 }
1119
1120 for (i = 0; i < htab->buckets_num; i++) {
1121 INIT_HLIST_HEAD(&htab->buckets[i].head);
1122 spin_lock_init(&htab->buckets[i].lock);
1123 }
1124
1125 return &htab->map;
1126free_htab:
1127 bpf_map_area_free(htab);
1128 return ERR_PTR(err);
1129}
1130
1131static void sock_hash_free(struct bpf_map *map)
1132{
1133 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1134 struct bpf_shtab_bucket *bucket;
1135 struct hlist_head unlink_list;
1136 struct bpf_shtab_elem *elem;
1137 struct hlist_node *node;
1138 int i;
1139
1140 /* After the sync no updates or deletes will be in-flight so it
1141 * is safe to walk map and remove entries without risking a race
1142 * in EEXIST update case.
1143 */
1144 synchronize_rcu();
1145 for (i = 0; i < htab->buckets_num; i++) {
1146 bucket = sock_hash_select_bucket(htab, i);
1147
1148 /* We are racing with sock_hash_delete_from_link to
1149 * enter the spin-lock critical section. Every socket on
1150 * the list is still linked to sockhash. Since link
1151 * exists, psock exists and holds a ref to socket. That
1152 * lets us to grab a socket ref too.
1153 */
1154 spin_lock_bh(&bucket->lock);
1155 hlist_for_each_entry(elem, &bucket->head, node)
1156 sock_hold(elem->sk);
1157 hlist_move_list(&bucket->head, &unlink_list);
1158 spin_unlock_bh(&bucket->lock);
1159
1160 /* Process removed entries out of atomic context to
1161 * block for socket lock before deleting the psock's
1162 * link to sockhash.
1163 */
1164 hlist_for_each_entry_safe(elem, node, &unlink_list, node) {
1165 hlist_del(&elem->node);
1166 lock_sock(elem->sk);
1167 rcu_read_lock();
1168 sock_map_unref(elem->sk, elem);
1169 rcu_read_unlock();
1170 release_sock(elem->sk);
1171 sock_put(elem->sk);
1172 sock_hash_free_elem(htab, elem);
1173 }
1174 }
1175
1176 /* wait for psock readers accessing its map link */
1177 synchronize_rcu();
1178
1179 bpf_map_area_free(htab->buckets);
1180 bpf_map_area_free(htab);
1181}
1182
1183static void *sock_hash_lookup_sys(struct bpf_map *map, void *key)
1184{
1185 struct sock *sk;
1186
1187 if (map->value_size != sizeof(u64))
1188 return ERR_PTR(-ENOSPC);
1189
1190 sk = __sock_hash_lookup_elem(map, key);
1191 if (!sk)
1192 return ERR_PTR(-ENOENT);
1193
1194 __sock_gen_cookie(sk);
1195 return &sk->sk_cookie;
1196}
1197
1198static void *sock_hash_lookup(struct bpf_map *map, void *key)
1199{
1200 struct sock *sk;
1201
1202 sk = __sock_hash_lookup_elem(map, key);
1203 if (!sk)
1204 return NULL;
1205 if (sk_is_refcounted(sk) && !refcount_inc_not_zero(&sk->sk_refcnt))
1206 return NULL;
1207 return sk;
1208}
1209
1210static void sock_hash_release_progs(struct bpf_map *map)
1211{
1212 psock_progs_drop(&container_of(map, struct bpf_shtab, map)->progs);
1213}
1214
1215BPF_CALL_4(bpf_sock_hash_update, struct bpf_sock_ops_kern *, sops,
1216 struct bpf_map *, map, void *, key, u64, flags)
1217{
1218 WARN_ON_ONCE(!rcu_read_lock_held());
1219
1220 if (likely(sock_map_sk_is_suitable(sops->sk) &&
1221 sock_map_op_okay(sops)))
1222 return sock_hash_update_common(map, key, sops->sk, flags);
1223 return -EOPNOTSUPP;
1224}
1225
1226const struct bpf_func_proto bpf_sock_hash_update_proto = {
1227 .func = bpf_sock_hash_update,
1228 .gpl_only = false,
1229 .pkt_access = true,
1230 .ret_type = RET_INTEGER,
1231 .arg1_type = ARG_PTR_TO_CTX,
1232 .arg2_type = ARG_CONST_MAP_PTR,
1233 .arg3_type = ARG_PTR_TO_MAP_KEY,
1234 .arg4_type = ARG_ANYTHING,
1235};
1236
1237BPF_CALL_4(bpf_sk_redirect_hash, struct sk_buff *, skb,
1238 struct bpf_map *, map, void *, key, u64, flags)
1239{
1240 struct sock *sk;
1241
1242 if (unlikely(flags & ~(BPF_F_INGRESS)))
1243 return SK_DROP;
1244
1245 sk = __sock_hash_lookup_elem(map, key);
1246 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
1247 return SK_DROP;
1248
1249 skb_bpf_set_redir(skb, sk, flags & BPF_F_INGRESS);
1250 return SK_PASS;
1251}
1252
1253const struct bpf_func_proto bpf_sk_redirect_hash_proto = {
1254 .func = bpf_sk_redirect_hash,
1255 .gpl_only = false,
1256 .ret_type = RET_INTEGER,
1257 .arg1_type = ARG_PTR_TO_CTX,
1258 .arg2_type = ARG_CONST_MAP_PTR,
1259 .arg3_type = ARG_PTR_TO_MAP_KEY,
1260 .arg4_type = ARG_ANYTHING,
1261};
1262
1263BPF_CALL_4(bpf_msg_redirect_hash, struct sk_msg *, msg,
1264 struct bpf_map *, map, void *, key, u64, flags)
1265{
1266 struct sock *sk;
1267
1268 if (unlikely(flags & ~(BPF_F_INGRESS)))
1269 return SK_DROP;
1270
1271 sk = __sock_hash_lookup_elem(map, key);
1272 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
1273 return SK_DROP;
1274 if (!(flags & BPF_F_INGRESS) && !sk_is_tcp(sk))
1275 return SK_DROP;
1276
1277 msg->flags = flags;
1278 msg->sk_redir = sk;
1279 return SK_PASS;
1280}
1281
1282const struct bpf_func_proto bpf_msg_redirect_hash_proto = {
1283 .func = bpf_msg_redirect_hash,
1284 .gpl_only = false,
1285 .ret_type = RET_INTEGER,
1286 .arg1_type = ARG_PTR_TO_CTX,
1287 .arg2_type = ARG_CONST_MAP_PTR,
1288 .arg3_type = ARG_PTR_TO_MAP_KEY,
1289 .arg4_type = ARG_ANYTHING,
1290};
1291
1292struct sock_hash_seq_info {
1293 struct bpf_map *map;
1294 struct bpf_shtab *htab;
1295 u32 bucket_id;
1296};
1297
1298static void *sock_hash_seq_find_next(struct sock_hash_seq_info *info,
1299 struct bpf_shtab_elem *prev_elem)
1300{
1301 const struct bpf_shtab *htab = info->htab;
1302 struct bpf_shtab_bucket *bucket;
1303 struct bpf_shtab_elem *elem;
1304 struct hlist_node *node;
1305
1306 /* try to find next elem in the same bucket */
1307 if (prev_elem) {
1308 node = rcu_dereference(hlist_next_rcu(&prev_elem->node));
1309 elem = hlist_entry_safe(node, struct bpf_shtab_elem, node);
1310 if (elem)
1311 return elem;
1312
1313 /* no more elements, continue in the next bucket */
1314 info->bucket_id++;
1315 }
1316
1317 for (; info->bucket_id < htab->buckets_num; info->bucket_id++) {
1318 bucket = &htab->buckets[info->bucket_id];
1319 node = rcu_dereference(hlist_first_rcu(&bucket->head));
1320 elem = hlist_entry_safe(node, struct bpf_shtab_elem, node);
1321 if (elem)
1322 return elem;
1323 }
1324
1325 return NULL;
1326}
1327
1328static void *sock_hash_seq_start(struct seq_file *seq, loff_t *pos)
1329 __acquires(rcu)
1330{
1331 struct sock_hash_seq_info *info = seq->private;
1332
1333 if (*pos == 0)
1334 ++*pos;
1335
1336 /* pairs with sock_hash_seq_stop */
1337 rcu_read_lock();
1338 return sock_hash_seq_find_next(info, NULL);
1339}
1340
1341static void *sock_hash_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1342 __must_hold(rcu)
1343{
1344 struct sock_hash_seq_info *info = seq->private;
1345
1346 ++*pos;
1347 return sock_hash_seq_find_next(info, v);
1348}
1349
1350static int sock_hash_seq_show(struct seq_file *seq, void *v)
1351 __must_hold(rcu)
1352{
1353 struct sock_hash_seq_info *info = seq->private;
1354 struct bpf_iter__sockmap ctx = {};
1355 struct bpf_shtab_elem *elem = v;
1356 struct bpf_iter_meta meta;
1357 struct bpf_prog *prog;
1358
1359 meta.seq = seq;
1360 prog = bpf_iter_get_info(&meta, !elem);
1361 if (!prog)
1362 return 0;
1363
1364 ctx.meta = &meta;
1365 ctx.map = info->map;
1366 if (elem) {
1367 ctx.key = elem->key;
1368 ctx.sk = elem->sk;
1369 }
1370
1371 return bpf_iter_run_prog(prog, &ctx);
1372}
1373
1374static void sock_hash_seq_stop(struct seq_file *seq, void *v)
1375 __releases(rcu)
1376{
1377 if (!v)
1378 (void)sock_hash_seq_show(seq, NULL);
1379
1380 /* pairs with sock_hash_seq_start */
1381 rcu_read_unlock();
1382}
1383
1384static const struct seq_operations sock_hash_seq_ops = {
1385 .start = sock_hash_seq_start,
1386 .next = sock_hash_seq_next,
1387 .stop = sock_hash_seq_stop,
1388 .show = sock_hash_seq_show,
1389};
1390
1391static int sock_hash_init_seq_private(void *priv_data,
1392 struct bpf_iter_aux_info *aux)
1393{
1394 struct sock_hash_seq_info *info = priv_data;
1395
1396 bpf_map_inc_with_uref(aux->map);
1397 info->map = aux->map;
1398 info->htab = container_of(aux->map, struct bpf_shtab, map);
1399 return 0;
1400}
1401
1402static void sock_hash_fini_seq_private(void *priv_data)
1403{
1404 struct sock_hash_seq_info *info = priv_data;
1405
1406 bpf_map_put_with_uref(info->map);
1407}
1408
1409static u64 sock_hash_mem_usage(const struct bpf_map *map)
1410{
1411 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1412 u64 usage = sizeof(*htab);
1413
1414 usage += htab->buckets_num * sizeof(struct bpf_shtab_bucket);
1415 usage += atomic_read(&htab->count) * (u64)htab->elem_size;
1416 return usage;
1417}
1418
1419static const struct bpf_iter_seq_info sock_hash_iter_seq_info = {
1420 .seq_ops = &sock_hash_seq_ops,
1421 .init_seq_private = sock_hash_init_seq_private,
1422 .fini_seq_private = sock_hash_fini_seq_private,
1423 .seq_priv_size = sizeof(struct sock_hash_seq_info),
1424};
1425
1426BTF_ID_LIST_SINGLE(sock_hash_map_btf_ids, struct, bpf_shtab)
1427const struct bpf_map_ops sock_hash_ops = {
1428 .map_meta_equal = bpf_map_meta_equal,
1429 .map_alloc = sock_hash_alloc,
1430 .map_free = sock_hash_free,
1431 .map_get_next_key = sock_hash_get_next_key,
1432 .map_update_elem = sock_map_update_elem,
1433 .map_delete_elem = sock_hash_delete_elem,
1434 .map_lookup_elem = sock_hash_lookup,
1435 .map_lookup_elem_sys_only = sock_hash_lookup_sys,
1436 .map_release_uref = sock_hash_release_progs,
1437 .map_check_btf = map_check_no_btf,
1438 .map_mem_usage = sock_hash_mem_usage,
1439 .map_btf_id = &sock_hash_map_btf_ids[0],
1440 .iter_seq_info = &sock_hash_iter_seq_info,
1441};
1442
1443static struct sk_psock_progs *sock_map_progs(struct bpf_map *map)
1444{
1445 switch (map->map_type) {
1446 case BPF_MAP_TYPE_SOCKMAP:
1447 return &container_of(map, struct bpf_stab, map)->progs;
1448 case BPF_MAP_TYPE_SOCKHASH:
1449 return &container_of(map, struct bpf_shtab, map)->progs;
1450 default:
1451 break;
1452 }
1453
1454 return NULL;
1455}
1456
1457static int sock_map_prog_lookup(struct bpf_map *map, struct bpf_prog ***pprog,
1458 u32 which)
1459{
1460 struct sk_psock_progs *progs = sock_map_progs(map);
1461
1462 if (!progs)
1463 return -EOPNOTSUPP;
1464
1465 switch (which) {
1466 case BPF_SK_MSG_VERDICT:
1467 *pprog = &progs->msg_parser;
1468 break;
1469#if IS_ENABLED(CONFIG_BPF_STREAM_PARSER)
1470 case BPF_SK_SKB_STREAM_PARSER:
1471 *pprog = &progs->stream_parser;
1472 break;
1473#endif
1474 case BPF_SK_SKB_STREAM_VERDICT:
1475 if (progs->skb_verdict)
1476 return -EBUSY;
1477 *pprog = &progs->stream_verdict;
1478 break;
1479 case BPF_SK_SKB_VERDICT:
1480 if (progs->stream_verdict)
1481 return -EBUSY;
1482 *pprog = &progs->skb_verdict;
1483 break;
1484 default:
1485 return -EOPNOTSUPP;
1486 }
1487
1488 return 0;
1489}
1490
1491static int sock_map_prog_update(struct bpf_map *map, struct bpf_prog *prog,
1492 struct bpf_prog *old, u32 which)
1493{
1494 struct bpf_prog **pprog;
1495 int ret;
1496
1497 ret = sock_map_prog_lookup(map, &pprog, which);
1498 if (ret)
1499 return ret;
1500
1501 if (old)
1502 return psock_replace_prog(pprog, prog, old);
1503
1504 psock_set_prog(pprog, prog);
1505 return 0;
1506}
1507
1508int sock_map_bpf_prog_query(const union bpf_attr *attr,
1509 union bpf_attr __user *uattr)
1510{
1511 __u32 __user *prog_ids = u64_to_user_ptr(attr->query.prog_ids);
1512 u32 prog_cnt = 0, flags = 0, ufd = attr->target_fd;
1513 struct bpf_prog **pprog;
1514 struct bpf_prog *prog;
1515 struct bpf_map *map;
1516 struct fd f;
1517 u32 id = 0;
1518 int ret;
1519
1520 if (attr->query.query_flags)
1521 return -EINVAL;
1522
1523 f = fdget(ufd);
1524 map = __bpf_map_get(f);
1525 if (IS_ERR(map))
1526 return PTR_ERR(map);
1527
1528 rcu_read_lock();
1529
1530 ret = sock_map_prog_lookup(map, &pprog, attr->query.attach_type);
1531 if (ret)
1532 goto end;
1533
1534 prog = *pprog;
1535 prog_cnt = !prog ? 0 : 1;
1536
1537 if (!attr->query.prog_cnt || !prog_ids || !prog_cnt)
1538 goto end;
1539
1540 /* we do not hold the refcnt, the bpf prog may be released
1541 * asynchronously and the id would be set to 0.
1542 */
1543 id = data_race(prog->aux->id);
1544 if (id == 0)
1545 prog_cnt = 0;
1546
1547end:
1548 rcu_read_unlock();
1549
1550 if (copy_to_user(&uattr->query.attach_flags, &flags, sizeof(flags)) ||
1551 (id != 0 && copy_to_user(prog_ids, &id, sizeof(u32))) ||
1552 copy_to_user(&uattr->query.prog_cnt, &prog_cnt, sizeof(prog_cnt)))
1553 ret = -EFAULT;
1554
1555 fdput(f);
1556 return ret;
1557}
1558
1559static void sock_map_unlink(struct sock *sk, struct sk_psock_link *link)
1560{
1561 switch (link->map->map_type) {
1562 case BPF_MAP_TYPE_SOCKMAP:
1563 return sock_map_delete_from_link(link->map, sk,
1564 link->link_raw);
1565 case BPF_MAP_TYPE_SOCKHASH:
1566 return sock_hash_delete_from_link(link->map, sk,
1567 link->link_raw);
1568 default:
1569 break;
1570 }
1571}
1572
1573static void sock_map_remove_links(struct sock *sk, struct sk_psock *psock)
1574{
1575 struct sk_psock_link *link;
1576
1577 while ((link = sk_psock_link_pop(psock))) {
1578 sock_map_unlink(sk, link);
1579 sk_psock_free_link(link);
1580 }
1581}
1582
1583void sock_map_unhash(struct sock *sk)
1584{
1585 void (*saved_unhash)(struct sock *sk);
1586 struct sk_psock *psock;
1587
1588 rcu_read_lock();
1589 psock = sk_psock(sk);
1590 if (unlikely(!psock)) {
1591 rcu_read_unlock();
1592 saved_unhash = READ_ONCE(sk->sk_prot)->unhash;
1593 } else {
1594 saved_unhash = psock->saved_unhash;
1595 sock_map_remove_links(sk, psock);
1596 rcu_read_unlock();
1597 }
1598 if (WARN_ON_ONCE(saved_unhash == sock_map_unhash))
1599 return;
1600 if (saved_unhash)
1601 saved_unhash(sk);
1602}
1603EXPORT_SYMBOL_GPL(sock_map_unhash);
1604
1605void sock_map_destroy(struct sock *sk)
1606{
1607 void (*saved_destroy)(struct sock *sk);
1608 struct sk_psock *psock;
1609
1610 rcu_read_lock();
1611 psock = sk_psock_get(sk);
1612 if (unlikely(!psock)) {
1613 rcu_read_unlock();
1614 saved_destroy = READ_ONCE(sk->sk_prot)->destroy;
1615 } else {
1616 saved_destroy = psock->saved_destroy;
1617 sock_map_remove_links(sk, psock);
1618 rcu_read_unlock();
1619 sk_psock_stop(psock);
1620 sk_psock_put(sk, psock);
1621 }
1622 if (WARN_ON_ONCE(saved_destroy == sock_map_destroy))
1623 return;
1624 if (saved_destroy)
1625 saved_destroy(sk);
1626}
1627EXPORT_SYMBOL_GPL(sock_map_destroy);
1628
1629void sock_map_close(struct sock *sk, long timeout)
1630{
1631 void (*saved_close)(struct sock *sk, long timeout);
1632 struct sk_psock *psock;
1633
1634 lock_sock(sk);
1635 rcu_read_lock();
1636 psock = sk_psock_get(sk);
1637 if (unlikely(!psock)) {
1638 rcu_read_unlock();
1639 release_sock(sk);
1640 saved_close = READ_ONCE(sk->sk_prot)->close;
1641 } else {
1642 saved_close = psock->saved_close;
1643 sock_map_remove_links(sk, psock);
1644 rcu_read_unlock();
1645 sk_psock_stop(psock);
1646 release_sock(sk);
1647 cancel_delayed_work_sync(&psock->work);
1648 sk_psock_put(sk, psock);
1649 }
1650
1651 /* Make sure we do not recurse. This is a bug.
1652 * Leak the socket instead of crashing on a stack overflow.
1653 */
1654 if (WARN_ON_ONCE(saved_close == sock_map_close))
1655 return;
1656 saved_close(sk, timeout);
1657}
1658EXPORT_SYMBOL_GPL(sock_map_close);
1659
1660static int sock_map_iter_attach_target(struct bpf_prog *prog,
1661 union bpf_iter_link_info *linfo,
1662 struct bpf_iter_aux_info *aux)
1663{
1664 struct bpf_map *map;
1665 int err = -EINVAL;
1666
1667 if (!linfo->map.map_fd)
1668 return -EBADF;
1669
1670 map = bpf_map_get_with_uref(linfo->map.map_fd);
1671 if (IS_ERR(map))
1672 return PTR_ERR(map);
1673
1674 if (map->map_type != BPF_MAP_TYPE_SOCKMAP &&
1675 map->map_type != BPF_MAP_TYPE_SOCKHASH)
1676 goto put_map;
1677
1678 if (prog->aux->max_rdonly_access > map->key_size) {
1679 err = -EACCES;
1680 goto put_map;
1681 }
1682
1683 aux->map = map;
1684 return 0;
1685
1686put_map:
1687 bpf_map_put_with_uref(map);
1688 return err;
1689}
1690
1691static void sock_map_iter_detach_target(struct bpf_iter_aux_info *aux)
1692{
1693 bpf_map_put_with_uref(aux->map);
1694}
1695
1696static struct bpf_iter_reg sock_map_iter_reg = {
1697 .target = "sockmap",
1698 .attach_target = sock_map_iter_attach_target,
1699 .detach_target = sock_map_iter_detach_target,
1700 .show_fdinfo = bpf_iter_map_show_fdinfo,
1701 .fill_link_info = bpf_iter_map_fill_link_info,
1702 .ctx_arg_info_size = 2,
1703 .ctx_arg_info = {
1704 { offsetof(struct bpf_iter__sockmap, key),
1705 PTR_TO_BUF | PTR_MAYBE_NULL | MEM_RDONLY },
1706 { offsetof(struct bpf_iter__sockmap, sk),
1707 PTR_TO_BTF_ID_OR_NULL },
1708 },
1709};
1710
1711static int __init bpf_sockmap_iter_init(void)
1712{
1713 sock_map_iter_reg.ctx_arg_info[1].btf_id =
1714 btf_sock_ids[BTF_SOCK_TYPE_SOCK];
1715 return bpf_iter_reg_target(&sock_map_iter_reg);
1716}
1717late_initcall(bpf_sockmap_iter_init);
1// SPDX-License-Identifier: GPL-2.0
2/* Copyright (c) 2017 - 2018 Covalent IO, Inc. http://covalent.io */
3
4#include <linux/bpf.h>
5#include <linux/btf_ids.h>
6#include <linux/filter.h>
7#include <linux/errno.h>
8#include <linux/file.h>
9#include <linux/net.h>
10#include <linux/workqueue.h>
11#include <linux/skmsg.h>
12#include <linux/list.h>
13#include <linux/jhash.h>
14#include <linux/sock_diag.h>
15#include <net/udp.h>
16
17struct bpf_stab {
18 struct bpf_map map;
19 struct sock **sks;
20 struct sk_psock_progs progs;
21 spinlock_t lock;
22};
23
24#define SOCK_CREATE_FLAG_MASK \
25 (BPF_F_NUMA_NODE | BPF_F_RDONLY | BPF_F_WRONLY)
26
27/* This mutex is used to
28 * - protect race between prog/link attach/detach and link prog update, and
29 * - protect race between releasing and accessing map in bpf_link.
30 * A single global mutex lock is used since it is expected contention is low.
31 */
32static DEFINE_MUTEX(sockmap_mutex);
33
34static int sock_map_prog_update(struct bpf_map *map, struct bpf_prog *prog,
35 struct bpf_prog *old, struct bpf_link *link,
36 u32 which);
37static struct sk_psock_progs *sock_map_progs(struct bpf_map *map);
38
39static struct bpf_map *sock_map_alloc(union bpf_attr *attr)
40{
41 struct bpf_stab *stab;
42
43 if (attr->max_entries == 0 ||
44 attr->key_size != 4 ||
45 (attr->value_size != sizeof(u32) &&
46 attr->value_size != sizeof(u64)) ||
47 attr->map_flags & ~SOCK_CREATE_FLAG_MASK)
48 return ERR_PTR(-EINVAL);
49
50 stab = bpf_map_area_alloc(sizeof(*stab), NUMA_NO_NODE);
51 if (!stab)
52 return ERR_PTR(-ENOMEM);
53
54 bpf_map_init_from_attr(&stab->map, attr);
55 spin_lock_init(&stab->lock);
56
57 stab->sks = bpf_map_area_alloc((u64) stab->map.max_entries *
58 sizeof(struct sock *),
59 stab->map.numa_node);
60 if (!stab->sks) {
61 bpf_map_area_free(stab);
62 return ERR_PTR(-ENOMEM);
63 }
64
65 return &stab->map;
66}
67
68int sock_map_get_from_fd(const union bpf_attr *attr, struct bpf_prog *prog)
69{
70 struct bpf_map *map;
71 int ret;
72
73 if (attr->attach_flags || attr->replace_bpf_fd)
74 return -EINVAL;
75
76 CLASS(fd, f)(attr->target_fd);
77 map = __bpf_map_get(f);
78 if (IS_ERR(map))
79 return PTR_ERR(map);
80 mutex_lock(&sockmap_mutex);
81 ret = sock_map_prog_update(map, prog, NULL, NULL, attr->attach_type);
82 mutex_unlock(&sockmap_mutex);
83 return ret;
84}
85
86int sock_map_prog_detach(const union bpf_attr *attr, enum bpf_prog_type ptype)
87{
88 struct bpf_prog *prog;
89 struct bpf_map *map;
90 int ret;
91
92 if (attr->attach_flags || attr->replace_bpf_fd)
93 return -EINVAL;
94
95 CLASS(fd, f)(attr->target_fd);
96 map = __bpf_map_get(f);
97 if (IS_ERR(map))
98 return PTR_ERR(map);
99
100 prog = bpf_prog_get(attr->attach_bpf_fd);
101 if (IS_ERR(prog))
102 return PTR_ERR(prog);
103
104 if (prog->type != ptype) {
105 ret = -EINVAL;
106 goto put_prog;
107 }
108
109 mutex_lock(&sockmap_mutex);
110 ret = sock_map_prog_update(map, NULL, prog, NULL, attr->attach_type);
111 mutex_unlock(&sockmap_mutex);
112put_prog:
113 bpf_prog_put(prog);
114 return ret;
115}
116
117static void sock_map_sk_acquire(struct sock *sk)
118 __acquires(&sk->sk_lock.slock)
119{
120 lock_sock(sk);
121 rcu_read_lock();
122}
123
124static void sock_map_sk_release(struct sock *sk)
125 __releases(&sk->sk_lock.slock)
126{
127 rcu_read_unlock();
128 release_sock(sk);
129}
130
131static void sock_map_add_link(struct sk_psock *psock,
132 struct sk_psock_link *link,
133 struct bpf_map *map, void *link_raw)
134{
135 link->link_raw = link_raw;
136 link->map = map;
137 spin_lock_bh(&psock->link_lock);
138 list_add_tail(&link->list, &psock->link);
139 spin_unlock_bh(&psock->link_lock);
140}
141
142static void sock_map_del_link(struct sock *sk,
143 struct sk_psock *psock, void *link_raw)
144{
145 bool strp_stop = false, verdict_stop = false;
146 struct sk_psock_link *link, *tmp;
147
148 spin_lock_bh(&psock->link_lock);
149 list_for_each_entry_safe(link, tmp, &psock->link, list) {
150 if (link->link_raw == link_raw) {
151 struct bpf_map *map = link->map;
152 struct sk_psock_progs *progs = sock_map_progs(map);
153
154 if (psock->saved_data_ready && progs->stream_parser)
155 strp_stop = true;
156 if (psock->saved_data_ready && progs->stream_verdict)
157 verdict_stop = true;
158 if (psock->saved_data_ready && progs->skb_verdict)
159 verdict_stop = true;
160 list_del(&link->list);
161 sk_psock_free_link(link);
162 break;
163 }
164 }
165 spin_unlock_bh(&psock->link_lock);
166 if (strp_stop || verdict_stop) {
167 write_lock_bh(&sk->sk_callback_lock);
168 if (strp_stop)
169 sk_psock_stop_strp(sk, psock);
170 if (verdict_stop)
171 sk_psock_stop_verdict(sk, psock);
172
173 if (psock->psock_update_sk_prot)
174 psock->psock_update_sk_prot(sk, psock, false);
175 write_unlock_bh(&sk->sk_callback_lock);
176 }
177}
178
179static void sock_map_unref(struct sock *sk, void *link_raw)
180{
181 struct sk_psock *psock = sk_psock(sk);
182
183 if (likely(psock)) {
184 sock_map_del_link(sk, psock, link_raw);
185 sk_psock_put(sk, psock);
186 }
187}
188
189static int sock_map_init_proto(struct sock *sk, struct sk_psock *psock)
190{
191 if (!sk->sk_prot->psock_update_sk_prot)
192 return -EINVAL;
193 psock->psock_update_sk_prot = sk->sk_prot->psock_update_sk_prot;
194 return sk->sk_prot->psock_update_sk_prot(sk, psock, false);
195}
196
197static struct sk_psock *sock_map_psock_get_checked(struct sock *sk)
198{
199 struct sk_psock *psock;
200
201 rcu_read_lock();
202 psock = sk_psock(sk);
203 if (psock) {
204 if (sk->sk_prot->close != sock_map_close) {
205 psock = ERR_PTR(-EBUSY);
206 goto out;
207 }
208
209 if (!refcount_inc_not_zero(&psock->refcnt))
210 psock = ERR_PTR(-EBUSY);
211 }
212out:
213 rcu_read_unlock();
214 return psock;
215}
216
217static int sock_map_link(struct bpf_map *map, struct sock *sk)
218{
219 struct sk_psock_progs *progs = sock_map_progs(map);
220 struct bpf_prog *stream_verdict = NULL;
221 struct bpf_prog *stream_parser = NULL;
222 struct bpf_prog *skb_verdict = NULL;
223 struct bpf_prog *msg_parser = NULL;
224 struct sk_psock *psock;
225 int ret;
226
227 stream_verdict = READ_ONCE(progs->stream_verdict);
228 if (stream_verdict) {
229 stream_verdict = bpf_prog_inc_not_zero(stream_verdict);
230 if (IS_ERR(stream_verdict))
231 return PTR_ERR(stream_verdict);
232 }
233
234 stream_parser = READ_ONCE(progs->stream_parser);
235 if (stream_parser) {
236 stream_parser = bpf_prog_inc_not_zero(stream_parser);
237 if (IS_ERR(stream_parser)) {
238 ret = PTR_ERR(stream_parser);
239 goto out_put_stream_verdict;
240 }
241 }
242
243 msg_parser = READ_ONCE(progs->msg_parser);
244 if (msg_parser) {
245 msg_parser = bpf_prog_inc_not_zero(msg_parser);
246 if (IS_ERR(msg_parser)) {
247 ret = PTR_ERR(msg_parser);
248 goto out_put_stream_parser;
249 }
250 }
251
252 skb_verdict = READ_ONCE(progs->skb_verdict);
253 if (skb_verdict) {
254 skb_verdict = bpf_prog_inc_not_zero(skb_verdict);
255 if (IS_ERR(skb_verdict)) {
256 ret = PTR_ERR(skb_verdict);
257 goto out_put_msg_parser;
258 }
259 }
260
261 psock = sock_map_psock_get_checked(sk);
262 if (IS_ERR(psock)) {
263 ret = PTR_ERR(psock);
264 goto out_progs;
265 }
266
267 if (psock) {
268 if ((msg_parser && READ_ONCE(psock->progs.msg_parser)) ||
269 (stream_parser && READ_ONCE(psock->progs.stream_parser)) ||
270 (skb_verdict && READ_ONCE(psock->progs.skb_verdict)) ||
271 (skb_verdict && READ_ONCE(psock->progs.stream_verdict)) ||
272 (stream_verdict && READ_ONCE(psock->progs.skb_verdict)) ||
273 (stream_verdict && READ_ONCE(psock->progs.stream_verdict))) {
274 sk_psock_put(sk, psock);
275 ret = -EBUSY;
276 goto out_progs;
277 }
278 } else {
279 psock = sk_psock_init(sk, map->numa_node);
280 if (IS_ERR(psock)) {
281 ret = PTR_ERR(psock);
282 goto out_progs;
283 }
284 }
285
286 if (msg_parser)
287 psock_set_prog(&psock->progs.msg_parser, msg_parser);
288 if (stream_parser)
289 psock_set_prog(&psock->progs.stream_parser, stream_parser);
290 if (stream_verdict)
291 psock_set_prog(&psock->progs.stream_verdict, stream_verdict);
292 if (skb_verdict)
293 psock_set_prog(&psock->progs.skb_verdict, skb_verdict);
294
295 /* msg_* and stream_* programs references tracked in psock after this
296 * point. Reference dec and cleanup will occur through psock destructor
297 */
298 ret = sock_map_init_proto(sk, psock);
299 if (ret < 0) {
300 sk_psock_put(sk, psock);
301 goto out;
302 }
303
304 write_lock_bh(&sk->sk_callback_lock);
305 if (stream_parser && stream_verdict && !psock->saved_data_ready) {
306 if (sk_is_tcp(sk))
307 ret = sk_psock_init_strp(sk, psock);
308 else
309 ret = -EOPNOTSUPP;
310 if (ret) {
311 write_unlock_bh(&sk->sk_callback_lock);
312 sk_psock_put(sk, psock);
313 goto out;
314 }
315 sk_psock_start_strp(sk, psock);
316 } else if (!stream_parser && stream_verdict && !psock->saved_data_ready) {
317 sk_psock_start_verdict(sk,psock);
318 } else if (!stream_verdict && skb_verdict && !psock->saved_data_ready) {
319 sk_psock_start_verdict(sk, psock);
320 }
321 write_unlock_bh(&sk->sk_callback_lock);
322 return 0;
323out_progs:
324 if (skb_verdict)
325 bpf_prog_put(skb_verdict);
326out_put_msg_parser:
327 if (msg_parser)
328 bpf_prog_put(msg_parser);
329out_put_stream_parser:
330 if (stream_parser)
331 bpf_prog_put(stream_parser);
332out_put_stream_verdict:
333 if (stream_verdict)
334 bpf_prog_put(stream_verdict);
335out:
336 return ret;
337}
338
339static void sock_map_free(struct bpf_map *map)
340{
341 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
342 int i;
343
344 /* After the sync no updates or deletes will be in-flight so it
345 * is safe to walk map and remove entries without risking a race
346 * in EEXIST update case.
347 */
348 synchronize_rcu();
349 for (i = 0; i < stab->map.max_entries; i++) {
350 struct sock **psk = &stab->sks[i];
351 struct sock *sk;
352
353 sk = xchg(psk, NULL);
354 if (sk) {
355 sock_hold(sk);
356 lock_sock(sk);
357 rcu_read_lock();
358 sock_map_unref(sk, psk);
359 rcu_read_unlock();
360 release_sock(sk);
361 sock_put(sk);
362 }
363 }
364
365 /* wait for psock readers accessing its map link */
366 synchronize_rcu();
367
368 bpf_map_area_free(stab->sks);
369 bpf_map_area_free(stab);
370}
371
372static void sock_map_release_progs(struct bpf_map *map)
373{
374 psock_progs_drop(&container_of(map, struct bpf_stab, map)->progs);
375}
376
377static struct sock *__sock_map_lookup_elem(struct bpf_map *map, u32 key)
378{
379 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
380
381 WARN_ON_ONCE(!rcu_read_lock_held());
382
383 if (unlikely(key >= map->max_entries))
384 return NULL;
385 return READ_ONCE(stab->sks[key]);
386}
387
388static void *sock_map_lookup(struct bpf_map *map, void *key)
389{
390 struct sock *sk;
391
392 sk = __sock_map_lookup_elem(map, *(u32 *)key);
393 if (!sk)
394 return NULL;
395 if (sk_is_refcounted(sk) && !refcount_inc_not_zero(&sk->sk_refcnt))
396 return NULL;
397 return sk;
398}
399
400static void *sock_map_lookup_sys(struct bpf_map *map, void *key)
401{
402 struct sock *sk;
403
404 if (map->value_size != sizeof(u64))
405 return ERR_PTR(-ENOSPC);
406
407 sk = __sock_map_lookup_elem(map, *(u32 *)key);
408 if (!sk)
409 return ERR_PTR(-ENOENT);
410
411 __sock_gen_cookie(sk);
412 return &sk->sk_cookie;
413}
414
415static int __sock_map_delete(struct bpf_stab *stab, struct sock *sk_test,
416 struct sock **psk)
417{
418 struct sock *sk = NULL;
419 int err = 0;
420
421 spin_lock_bh(&stab->lock);
422 if (!sk_test || sk_test == *psk)
423 sk = xchg(psk, NULL);
424
425 if (likely(sk))
426 sock_map_unref(sk, psk);
427 else
428 err = -EINVAL;
429
430 spin_unlock_bh(&stab->lock);
431 return err;
432}
433
434static void sock_map_delete_from_link(struct bpf_map *map, struct sock *sk,
435 void *link_raw)
436{
437 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
438
439 __sock_map_delete(stab, sk, link_raw);
440}
441
442static long sock_map_delete_elem(struct bpf_map *map, void *key)
443{
444 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
445 u32 i = *(u32 *)key;
446 struct sock **psk;
447
448 if (unlikely(i >= map->max_entries))
449 return -EINVAL;
450
451 psk = &stab->sks[i];
452 return __sock_map_delete(stab, NULL, psk);
453}
454
455static int sock_map_get_next_key(struct bpf_map *map, void *key, void *next)
456{
457 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
458 u32 i = key ? *(u32 *)key : U32_MAX;
459 u32 *key_next = next;
460
461 if (i == stab->map.max_entries - 1)
462 return -ENOENT;
463 if (i >= stab->map.max_entries)
464 *key_next = 0;
465 else
466 *key_next = i + 1;
467 return 0;
468}
469
470static int sock_map_update_common(struct bpf_map *map, u32 idx,
471 struct sock *sk, u64 flags)
472{
473 struct bpf_stab *stab = container_of(map, struct bpf_stab, map);
474 struct sk_psock_link *link;
475 struct sk_psock *psock;
476 struct sock *osk;
477 int ret;
478
479 WARN_ON_ONCE(!rcu_read_lock_held());
480 if (unlikely(flags > BPF_EXIST))
481 return -EINVAL;
482 if (unlikely(idx >= map->max_entries))
483 return -E2BIG;
484
485 link = sk_psock_init_link();
486 if (!link)
487 return -ENOMEM;
488
489 ret = sock_map_link(map, sk);
490 if (ret < 0)
491 goto out_free;
492
493 psock = sk_psock(sk);
494 WARN_ON_ONCE(!psock);
495
496 spin_lock_bh(&stab->lock);
497 osk = stab->sks[idx];
498 if (osk && flags == BPF_NOEXIST) {
499 ret = -EEXIST;
500 goto out_unlock;
501 } else if (!osk && flags == BPF_EXIST) {
502 ret = -ENOENT;
503 goto out_unlock;
504 }
505
506 sock_map_add_link(psock, link, map, &stab->sks[idx]);
507 stab->sks[idx] = sk;
508 if (osk)
509 sock_map_unref(osk, &stab->sks[idx]);
510 spin_unlock_bh(&stab->lock);
511 return 0;
512out_unlock:
513 spin_unlock_bh(&stab->lock);
514 if (psock)
515 sk_psock_put(sk, psock);
516out_free:
517 sk_psock_free_link(link);
518 return ret;
519}
520
521static bool sock_map_op_okay(const struct bpf_sock_ops_kern *ops)
522{
523 return ops->op == BPF_SOCK_OPS_PASSIVE_ESTABLISHED_CB ||
524 ops->op == BPF_SOCK_OPS_ACTIVE_ESTABLISHED_CB ||
525 ops->op == BPF_SOCK_OPS_TCP_LISTEN_CB;
526}
527
528static bool sock_map_redirect_allowed(const struct sock *sk)
529{
530 if (sk_is_tcp(sk))
531 return sk->sk_state != TCP_LISTEN;
532 else
533 return sk->sk_state == TCP_ESTABLISHED;
534}
535
536static bool sock_map_sk_is_suitable(const struct sock *sk)
537{
538 return !!sk->sk_prot->psock_update_sk_prot;
539}
540
541static bool sock_map_sk_state_allowed(const struct sock *sk)
542{
543 if (sk_is_tcp(sk))
544 return (1 << sk->sk_state) & (TCPF_ESTABLISHED | TCPF_LISTEN);
545 if (sk_is_stream_unix(sk))
546 return (1 << sk->sk_state) & TCPF_ESTABLISHED;
547 if (sk_is_vsock(sk) &&
548 (sk->sk_type == SOCK_STREAM || sk->sk_type == SOCK_SEQPACKET))
549 return (1 << sk->sk_state) & TCPF_ESTABLISHED;
550 return true;
551}
552
553static int sock_hash_update_common(struct bpf_map *map, void *key,
554 struct sock *sk, u64 flags);
555
556int sock_map_update_elem_sys(struct bpf_map *map, void *key, void *value,
557 u64 flags)
558{
559 struct socket *sock;
560 struct sock *sk;
561 int ret;
562 u64 ufd;
563
564 if (map->value_size == sizeof(u64))
565 ufd = *(u64 *)value;
566 else
567 ufd = *(u32 *)value;
568 if (ufd > S32_MAX)
569 return -EINVAL;
570
571 sock = sockfd_lookup(ufd, &ret);
572 if (!sock)
573 return ret;
574 sk = sock->sk;
575 if (!sk) {
576 ret = -EINVAL;
577 goto out;
578 }
579 if (!sock_map_sk_is_suitable(sk)) {
580 ret = -EOPNOTSUPP;
581 goto out;
582 }
583
584 sock_map_sk_acquire(sk);
585 if (!sock_map_sk_state_allowed(sk))
586 ret = -EOPNOTSUPP;
587 else if (map->map_type == BPF_MAP_TYPE_SOCKMAP)
588 ret = sock_map_update_common(map, *(u32 *)key, sk, flags);
589 else
590 ret = sock_hash_update_common(map, key, sk, flags);
591 sock_map_sk_release(sk);
592out:
593 sockfd_put(sock);
594 return ret;
595}
596
597static long sock_map_update_elem(struct bpf_map *map, void *key,
598 void *value, u64 flags)
599{
600 struct sock *sk = (struct sock *)value;
601 int ret;
602
603 if (unlikely(!sk || !sk_fullsock(sk)))
604 return -EINVAL;
605
606 if (!sock_map_sk_is_suitable(sk))
607 return -EOPNOTSUPP;
608
609 local_bh_disable();
610 bh_lock_sock(sk);
611 if (!sock_map_sk_state_allowed(sk))
612 ret = -EOPNOTSUPP;
613 else if (map->map_type == BPF_MAP_TYPE_SOCKMAP)
614 ret = sock_map_update_common(map, *(u32 *)key, sk, flags);
615 else
616 ret = sock_hash_update_common(map, key, sk, flags);
617 bh_unlock_sock(sk);
618 local_bh_enable();
619 return ret;
620}
621
622BPF_CALL_4(bpf_sock_map_update, struct bpf_sock_ops_kern *, sops,
623 struct bpf_map *, map, void *, key, u64, flags)
624{
625 WARN_ON_ONCE(!rcu_read_lock_held());
626
627 if (likely(sock_map_sk_is_suitable(sops->sk) &&
628 sock_map_op_okay(sops)))
629 return sock_map_update_common(map, *(u32 *)key, sops->sk,
630 flags);
631 return -EOPNOTSUPP;
632}
633
634const struct bpf_func_proto bpf_sock_map_update_proto = {
635 .func = bpf_sock_map_update,
636 .gpl_only = false,
637 .pkt_access = true,
638 .ret_type = RET_INTEGER,
639 .arg1_type = ARG_PTR_TO_CTX,
640 .arg2_type = ARG_CONST_MAP_PTR,
641 .arg3_type = ARG_PTR_TO_MAP_KEY,
642 .arg4_type = ARG_ANYTHING,
643};
644
645BPF_CALL_4(bpf_sk_redirect_map, struct sk_buff *, skb,
646 struct bpf_map *, map, u32, key, u64, flags)
647{
648 struct sock *sk;
649
650 if (unlikely(flags & ~(BPF_F_INGRESS)))
651 return SK_DROP;
652
653 sk = __sock_map_lookup_elem(map, key);
654 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
655 return SK_DROP;
656 if ((flags & BPF_F_INGRESS) && sk_is_vsock(sk))
657 return SK_DROP;
658
659 skb_bpf_set_redir(skb, sk, flags & BPF_F_INGRESS);
660 return SK_PASS;
661}
662
663const struct bpf_func_proto bpf_sk_redirect_map_proto = {
664 .func = bpf_sk_redirect_map,
665 .gpl_only = false,
666 .ret_type = RET_INTEGER,
667 .arg1_type = ARG_PTR_TO_CTX,
668 .arg2_type = ARG_CONST_MAP_PTR,
669 .arg3_type = ARG_ANYTHING,
670 .arg4_type = ARG_ANYTHING,
671};
672
673BPF_CALL_4(bpf_msg_redirect_map, struct sk_msg *, msg,
674 struct bpf_map *, map, u32, key, u64, flags)
675{
676 struct sock *sk;
677
678 if (unlikely(flags & ~(BPF_F_INGRESS)))
679 return SK_DROP;
680
681 sk = __sock_map_lookup_elem(map, key);
682 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
683 return SK_DROP;
684 if (!(flags & BPF_F_INGRESS) && !sk_is_tcp(sk))
685 return SK_DROP;
686 if (sk_is_vsock(sk))
687 return SK_DROP;
688
689 msg->flags = flags;
690 msg->sk_redir = sk;
691 return SK_PASS;
692}
693
694const struct bpf_func_proto bpf_msg_redirect_map_proto = {
695 .func = bpf_msg_redirect_map,
696 .gpl_only = false,
697 .ret_type = RET_INTEGER,
698 .arg1_type = ARG_PTR_TO_CTX,
699 .arg2_type = ARG_CONST_MAP_PTR,
700 .arg3_type = ARG_ANYTHING,
701 .arg4_type = ARG_ANYTHING,
702};
703
704struct sock_map_seq_info {
705 struct bpf_map *map;
706 struct sock *sk;
707 u32 index;
708};
709
710struct bpf_iter__sockmap {
711 __bpf_md_ptr(struct bpf_iter_meta *, meta);
712 __bpf_md_ptr(struct bpf_map *, map);
713 __bpf_md_ptr(void *, key);
714 __bpf_md_ptr(struct sock *, sk);
715};
716
717DEFINE_BPF_ITER_FUNC(sockmap, struct bpf_iter_meta *meta,
718 struct bpf_map *map, void *key,
719 struct sock *sk)
720
721static void *sock_map_seq_lookup_elem(struct sock_map_seq_info *info)
722{
723 if (unlikely(info->index >= info->map->max_entries))
724 return NULL;
725
726 info->sk = __sock_map_lookup_elem(info->map, info->index);
727
728 /* can't return sk directly, since that might be NULL */
729 return info;
730}
731
732static void *sock_map_seq_start(struct seq_file *seq, loff_t *pos)
733 __acquires(rcu)
734{
735 struct sock_map_seq_info *info = seq->private;
736
737 if (*pos == 0)
738 ++*pos;
739
740 /* pairs with sock_map_seq_stop */
741 rcu_read_lock();
742 return sock_map_seq_lookup_elem(info);
743}
744
745static void *sock_map_seq_next(struct seq_file *seq, void *v, loff_t *pos)
746 __must_hold(rcu)
747{
748 struct sock_map_seq_info *info = seq->private;
749
750 ++*pos;
751 ++info->index;
752
753 return sock_map_seq_lookup_elem(info);
754}
755
756static int sock_map_seq_show(struct seq_file *seq, void *v)
757 __must_hold(rcu)
758{
759 struct sock_map_seq_info *info = seq->private;
760 struct bpf_iter__sockmap ctx = {};
761 struct bpf_iter_meta meta;
762 struct bpf_prog *prog;
763
764 meta.seq = seq;
765 prog = bpf_iter_get_info(&meta, !v);
766 if (!prog)
767 return 0;
768
769 ctx.meta = &meta;
770 ctx.map = info->map;
771 if (v) {
772 ctx.key = &info->index;
773 ctx.sk = info->sk;
774 }
775
776 return bpf_iter_run_prog(prog, &ctx);
777}
778
779static void sock_map_seq_stop(struct seq_file *seq, void *v)
780 __releases(rcu)
781{
782 if (!v)
783 (void)sock_map_seq_show(seq, NULL);
784
785 /* pairs with sock_map_seq_start */
786 rcu_read_unlock();
787}
788
789static const struct seq_operations sock_map_seq_ops = {
790 .start = sock_map_seq_start,
791 .next = sock_map_seq_next,
792 .stop = sock_map_seq_stop,
793 .show = sock_map_seq_show,
794};
795
796static int sock_map_init_seq_private(void *priv_data,
797 struct bpf_iter_aux_info *aux)
798{
799 struct sock_map_seq_info *info = priv_data;
800
801 bpf_map_inc_with_uref(aux->map);
802 info->map = aux->map;
803 return 0;
804}
805
806static void sock_map_fini_seq_private(void *priv_data)
807{
808 struct sock_map_seq_info *info = priv_data;
809
810 bpf_map_put_with_uref(info->map);
811}
812
813static u64 sock_map_mem_usage(const struct bpf_map *map)
814{
815 u64 usage = sizeof(struct bpf_stab);
816
817 usage += (u64)map->max_entries * sizeof(struct sock *);
818 return usage;
819}
820
821static const struct bpf_iter_seq_info sock_map_iter_seq_info = {
822 .seq_ops = &sock_map_seq_ops,
823 .init_seq_private = sock_map_init_seq_private,
824 .fini_seq_private = sock_map_fini_seq_private,
825 .seq_priv_size = sizeof(struct sock_map_seq_info),
826};
827
828BTF_ID_LIST_SINGLE(sock_map_btf_ids, struct, bpf_stab)
829const struct bpf_map_ops sock_map_ops = {
830 .map_meta_equal = bpf_map_meta_equal,
831 .map_alloc = sock_map_alloc,
832 .map_free = sock_map_free,
833 .map_get_next_key = sock_map_get_next_key,
834 .map_lookup_elem_sys_only = sock_map_lookup_sys,
835 .map_update_elem = sock_map_update_elem,
836 .map_delete_elem = sock_map_delete_elem,
837 .map_lookup_elem = sock_map_lookup,
838 .map_release_uref = sock_map_release_progs,
839 .map_check_btf = map_check_no_btf,
840 .map_mem_usage = sock_map_mem_usage,
841 .map_btf_id = &sock_map_btf_ids[0],
842 .iter_seq_info = &sock_map_iter_seq_info,
843};
844
845struct bpf_shtab_elem {
846 struct rcu_head rcu;
847 u32 hash;
848 struct sock *sk;
849 struct hlist_node node;
850 u8 key[];
851};
852
853struct bpf_shtab_bucket {
854 struct hlist_head head;
855 spinlock_t lock;
856};
857
858struct bpf_shtab {
859 struct bpf_map map;
860 struct bpf_shtab_bucket *buckets;
861 u32 buckets_num;
862 u32 elem_size;
863 struct sk_psock_progs progs;
864 atomic_t count;
865};
866
867static inline u32 sock_hash_bucket_hash(const void *key, u32 len)
868{
869 return jhash(key, len, 0);
870}
871
872static struct bpf_shtab_bucket *sock_hash_select_bucket(struct bpf_shtab *htab,
873 u32 hash)
874{
875 return &htab->buckets[hash & (htab->buckets_num - 1)];
876}
877
878static struct bpf_shtab_elem *
879sock_hash_lookup_elem_raw(struct hlist_head *head, u32 hash, void *key,
880 u32 key_size)
881{
882 struct bpf_shtab_elem *elem;
883
884 hlist_for_each_entry_rcu(elem, head, node) {
885 if (elem->hash == hash &&
886 !memcmp(&elem->key, key, key_size))
887 return elem;
888 }
889
890 return NULL;
891}
892
893static struct sock *__sock_hash_lookup_elem(struct bpf_map *map, void *key)
894{
895 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
896 u32 key_size = map->key_size, hash;
897 struct bpf_shtab_bucket *bucket;
898 struct bpf_shtab_elem *elem;
899
900 WARN_ON_ONCE(!rcu_read_lock_held());
901
902 hash = sock_hash_bucket_hash(key, key_size);
903 bucket = sock_hash_select_bucket(htab, hash);
904 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
905
906 return elem ? elem->sk : NULL;
907}
908
909static void sock_hash_free_elem(struct bpf_shtab *htab,
910 struct bpf_shtab_elem *elem)
911{
912 atomic_dec(&htab->count);
913 kfree_rcu(elem, rcu);
914}
915
916static void sock_hash_delete_from_link(struct bpf_map *map, struct sock *sk,
917 void *link_raw)
918{
919 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
920 struct bpf_shtab_elem *elem_probe, *elem = link_raw;
921 struct bpf_shtab_bucket *bucket;
922
923 WARN_ON_ONCE(!rcu_read_lock_held());
924 bucket = sock_hash_select_bucket(htab, elem->hash);
925
926 /* elem may be deleted in parallel from the map, but access here
927 * is okay since it's going away only after RCU grace period.
928 * However, we need to check whether it's still present.
929 */
930 spin_lock_bh(&bucket->lock);
931 elem_probe = sock_hash_lookup_elem_raw(&bucket->head, elem->hash,
932 elem->key, map->key_size);
933 if (elem_probe && elem_probe == elem) {
934 hlist_del_rcu(&elem->node);
935 sock_map_unref(elem->sk, elem);
936 sock_hash_free_elem(htab, elem);
937 }
938 spin_unlock_bh(&bucket->lock);
939}
940
941static long sock_hash_delete_elem(struct bpf_map *map, void *key)
942{
943 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
944 u32 hash, key_size = map->key_size;
945 struct bpf_shtab_bucket *bucket;
946 struct bpf_shtab_elem *elem;
947 int ret = -ENOENT;
948
949 hash = sock_hash_bucket_hash(key, key_size);
950 bucket = sock_hash_select_bucket(htab, hash);
951
952 spin_lock_bh(&bucket->lock);
953 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
954 if (elem) {
955 hlist_del_rcu(&elem->node);
956 sock_map_unref(elem->sk, elem);
957 sock_hash_free_elem(htab, elem);
958 ret = 0;
959 }
960 spin_unlock_bh(&bucket->lock);
961 return ret;
962}
963
964static struct bpf_shtab_elem *sock_hash_alloc_elem(struct bpf_shtab *htab,
965 void *key, u32 key_size,
966 u32 hash, struct sock *sk,
967 struct bpf_shtab_elem *old)
968{
969 struct bpf_shtab_elem *new;
970
971 if (atomic_inc_return(&htab->count) > htab->map.max_entries) {
972 if (!old) {
973 atomic_dec(&htab->count);
974 return ERR_PTR(-E2BIG);
975 }
976 }
977
978 new = bpf_map_kmalloc_node(&htab->map, htab->elem_size,
979 GFP_ATOMIC | __GFP_NOWARN,
980 htab->map.numa_node);
981 if (!new) {
982 atomic_dec(&htab->count);
983 return ERR_PTR(-ENOMEM);
984 }
985 memcpy(new->key, key, key_size);
986 new->sk = sk;
987 new->hash = hash;
988 return new;
989}
990
991static int sock_hash_update_common(struct bpf_map *map, void *key,
992 struct sock *sk, u64 flags)
993{
994 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
995 u32 key_size = map->key_size, hash;
996 struct bpf_shtab_elem *elem, *elem_new;
997 struct bpf_shtab_bucket *bucket;
998 struct sk_psock_link *link;
999 struct sk_psock *psock;
1000 int ret;
1001
1002 WARN_ON_ONCE(!rcu_read_lock_held());
1003 if (unlikely(flags > BPF_EXIST))
1004 return -EINVAL;
1005
1006 link = sk_psock_init_link();
1007 if (!link)
1008 return -ENOMEM;
1009
1010 ret = sock_map_link(map, sk);
1011 if (ret < 0)
1012 goto out_free;
1013
1014 psock = sk_psock(sk);
1015 WARN_ON_ONCE(!psock);
1016
1017 hash = sock_hash_bucket_hash(key, key_size);
1018 bucket = sock_hash_select_bucket(htab, hash);
1019
1020 spin_lock_bh(&bucket->lock);
1021 elem = sock_hash_lookup_elem_raw(&bucket->head, hash, key, key_size);
1022 if (elem && flags == BPF_NOEXIST) {
1023 ret = -EEXIST;
1024 goto out_unlock;
1025 } else if (!elem && flags == BPF_EXIST) {
1026 ret = -ENOENT;
1027 goto out_unlock;
1028 }
1029
1030 elem_new = sock_hash_alloc_elem(htab, key, key_size, hash, sk, elem);
1031 if (IS_ERR(elem_new)) {
1032 ret = PTR_ERR(elem_new);
1033 goto out_unlock;
1034 }
1035
1036 sock_map_add_link(psock, link, map, elem_new);
1037 /* Add new element to the head of the list, so that
1038 * concurrent search will find it before old elem.
1039 */
1040 hlist_add_head_rcu(&elem_new->node, &bucket->head);
1041 if (elem) {
1042 hlist_del_rcu(&elem->node);
1043 sock_map_unref(elem->sk, elem);
1044 sock_hash_free_elem(htab, elem);
1045 }
1046 spin_unlock_bh(&bucket->lock);
1047 return 0;
1048out_unlock:
1049 spin_unlock_bh(&bucket->lock);
1050 sk_psock_put(sk, psock);
1051out_free:
1052 sk_psock_free_link(link);
1053 return ret;
1054}
1055
1056static int sock_hash_get_next_key(struct bpf_map *map, void *key,
1057 void *key_next)
1058{
1059 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1060 struct bpf_shtab_elem *elem, *elem_next;
1061 u32 hash, key_size = map->key_size;
1062 struct hlist_head *head;
1063 int i = 0;
1064
1065 if (!key)
1066 goto find_first_elem;
1067 hash = sock_hash_bucket_hash(key, key_size);
1068 head = &sock_hash_select_bucket(htab, hash)->head;
1069 elem = sock_hash_lookup_elem_raw(head, hash, key, key_size);
1070 if (!elem)
1071 goto find_first_elem;
1072
1073 elem_next = hlist_entry_safe(rcu_dereference(hlist_next_rcu(&elem->node)),
1074 struct bpf_shtab_elem, node);
1075 if (elem_next) {
1076 memcpy(key_next, elem_next->key, key_size);
1077 return 0;
1078 }
1079
1080 i = hash & (htab->buckets_num - 1);
1081 i++;
1082find_first_elem:
1083 for (; i < htab->buckets_num; i++) {
1084 head = &sock_hash_select_bucket(htab, i)->head;
1085 elem_next = hlist_entry_safe(rcu_dereference(hlist_first_rcu(head)),
1086 struct bpf_shtab_elem, node);
1087 if (elem_next) {
1088 memcpy(key_next, elem_next->key, key_size);
1089 return 0;
1090 }
1091 }
1092
1093 return -ENOENT;
1094}
1095
1096static struct bpf_map *sock_hash_alloc(union bpf_attr *attr)
1097{
1098 struct bpf_shtab *htab;
1099 int i, err;
1100
1101 if (attr->max_entries == 0 ||
1102 attr->key_size == 0 ||
1103 (attr->value_size != sizeof(u32) &&
1104 attr->value_size != sizeof(u64)) ||
1105 attr->map_flags & ~SOCK_CREATE_FLAG_MASK)
1106 return ERR_PTR(-EINVAL);
1107 if (attr->key_size > MAX_BPF_STACK)
1108 return ERR_PTR(-E2BIG);
1109
1110 htab = bpf_map_area_alloc(sizeof(*htab), NUMA_NO_NODE);
1111 if (!htab)
1112 return ERR_PTR(-ENOMEM);
1113
1114 bpf_map_init_from_attr(&htab->map, attr);
1115
1116 htab->buckets_num = roundup_pow_of_two(htab->map.max_entries);
1117 htab->elem_size = sizeof(struct bpf_shtab_elem) +
1118 round_up(htab->map.key_size, 8);
1119 if (htab->buckets_num == 0 ||
1120 htab->buckets_num > U32_MAX / sizeof(struct bpf_shtab_bucket)) {
1121 err = -EINVAL;
1122 goto free_htab;
1123 }
1124
1125 htab->buckets = bpf_map_area_alloc(htab->buckets_num *
1126 sizeof(struct bpf_shtab_bucket),
1127 htab->map.numa_node);
1128 if (!htab->buckets) {
1129 err = -ENOMEM;
1130 goto free_htab;
1131 }
1132
1133 for (i = 0; i < htab->buckets_num; i++) {
1134 INIT_HLIST_HEAD(&htab->buckets[i].head);
1135 spin_lock_init(&htab->buckets[i].lock);
1136 }
1137
1138 return &htab->map;
1139free_htab:
1140 bpf_map_area_free(htab);
1141 return ERR_PTR(err);
1142}
1143
1144static void sock_hash_free(struct bpf_map *map)
1145{
1146 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1147 struct bpf_shtab_bucket *bucket;
1148 struct hlist_head unlink_list;
1149 struct bpf_shtab_elem *elem;
1150 struct hlist_node *node;
1151 int i;
1152
1153 /* After the sync no updates or deletes will be in-flight so it
1154 * is safe to walk map and remove entries without risking a race
1155 * in EEXIST update case.
1156 */
1157 synchronize_rcu();
1158 for (i = 0; i < htab->buckets_num; i++) {
1159 bucket = sock_hash_select_bucket(htab, i);
1160
1161 /* We are racing with sock_hash_delete_from_link to
1162 * enter the spin-lock critical section. Every socket on
1163 * the list is still linked to sockhash. Since link
1164 * exists, psock exists and holds a ref to socket. That
1165 * lets us to grab a socket ref too.
1166 */
1167 spin_lock_bh(&bucket->lock);
1168 hlist_for_each_entry(elem, &bucket->head, node)
1169 sock_hold(elem->sk);
1170 hlist_move_list(&bucket->head, &unlink_list);
1171 spin_unlock_bh(&bucket->lock);
1172
1173 /* Process removed entries out of atomic context to
1174 * block for socket lock before deleting the psock's
1175 * link to sockhash.
1176 */
1177 hlist_for_each_entry_safe(elem, node, &unlink_list, node) {
1178 hlist_del(&elem->node);
1179 lock_sock(elem->sk);
1180 rcu_read_lock();
1181 sock_map_unref(elem->sk, elem);
1182 rcu_read_unlock();
1183 release_sock(elem->sk);
1184 sock_put(elem->sk);
1185 sock_hash_free_elem(htab, elem);
1186 }
1187 cond_resched();
1188 }
1189
1190 /* wait for psock readers accessing its map link */
1191 synchronize_rcu();
1192
1193 bpf_map_area_free(htab->buckets);
1194 bpf_map_area_free(htab);
1195}
1196
1197static void *sock_hash_lookup_sys(struct bpf_map *map, void *key)
1198{
1199 struct sock *sk;
1200
1201 if (map->value_size != sizeof(u64))
1202 return ERR_PTR(-ENOSPC);
1203
1204 sk = __sock_hash_lookup_elem(map, key);
1205 if (!sk)
1206 return ERR_PTR(-ENOENT);
1207
1208 __sock_gen_cookie(sk);
1209 return &sk->sk_cookie;
1210}
1211
1212static void *sock_hash_lookup(struct bpf_map *map, void *key)
1213{
1214 struct sock *sk;
1215
1216 sk = __sock_hash_lookup_elem(map, key);
1217 if (!sk)
1218 return NULL;
1219 if (sk_is_refcounted(sk) && !refcount_inc_not_zero(&sk->sk_refcnt))
1220 return NULL;
1221 return sk;
1222}
1223
1224static void sock_hash_release_progs(struct bpf_map *map)
1225{
1226 psock_progs_drop(&container_of(map, struct bpf_shtab, map)->progs);
1227}
1228
1229BPF_CALL_4(bpf_sock_hash_update, struct bpf_sock_ops_kern *, sops,
1230 struct bpf_map *, map, void *, key, u64, flags)
1231{
1232 WARN_ON_ONCE(!rcu_read_lock_held());
1233
1234 if (likely(sock_map_sk_is_suitable(sops->sk) &&
1235 sock_map_op_okay(sops)))
1236 return sock_hash_update_common(map, key, sops->sk, flags);
1237 return -EOPNOTSUPP;
1238}
1239
1240const struct bpf_func_proto bpf_sock_hash_update_proto = {
1241 .func = bpf_sock_hash_update,
1242 .gpl_only = false,
1243 .pkt_access = true,
1244 .ret_type = RET_INTEGER,
1245 .arg1_type = ARG_PTR_TO_CTX,
1246 .arg2_type = ARG_CONST_MAP_PTR,
1247 .arg3_type = ARG_PTR_TO_MAP_KEY,
1248 .arg4_type = ARG_ANYTHING,
1249};
1250
1251BPF_CALL_4(bpf_sk_redirect_hash, struct sk_buff *, skb,
1252 struct bpf_map *, map, void *, key, u64, flags)
1253{
1254 struct sock *sk;
1255
1256 if (unlikely(flags & ~(BPF_F_INGRESS)))
1257 return SK_DROP;
1258
1259 sk = __sock_hash_lookup_elem(map, key);
1260 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
1261 return SK_DROP;
1262 if ((flags & BPF_F_INGRESS) && sk_is_vsock(sk))
1263 return SK_DROP;
1264
1265 skb_bpf_set_redir(skb, sk, flags & BPF_F_INGRESS);
1266 return SK_PASS;
1267}
1268
1269const struct bpf_func_proto bpf_sk_redirect_hash_proto = {
1270 .func = bpf_sk_redirect_hash,
1271 .gpl_only = false,
1272 .ret_type = RET_INTEGER,
1273 .arg1_type = ARG_PTR_TO_CTX,
1274 .arg2_type = ARG_CONST_MAP_PTR,
1275 .arg3_type = ARG_PTR_TO_MAP_KEY,
1276 .arg4_type = ARG_ANYTHING,
1277};
1278
1279BPF_CALL_4(bpf_msg_redirect_hash, struct sk_msg *, msg,
1280 struct bpf_map *, map, void *, key, u64, flags)
1281{
1282 struct sock *sk;
1283
1284 if (unlikely(flags & ~(BPF_F_INGRESS)))
1285 return SK_DROP;
1286
1287 sk = __sock_hash_lookup_elem(map, key);
1288 if (unlikely(!sk || !sock_map_redirect_allowed(sk)))
1289 return SK_DROP;
1290 if (!(flags & BPF_F_INGRESS) && !sk_is_tcp(sk))
1291 return SK_DROP;
1292 if (sk_is_vsock(sk))
1293 return SK_DROP;
1294
1295 msg->flags = flags;
1296 msg->sk_redir = sk;
1297 return SK_PASS;
1298}
1299
1300const struct bpf_func_proto bpf_msg_redirect_hash_proto = {
1301 .func = bpf_msg_redirect_hash,
1302 .gpl_only = false,
1303 .ret_type = RET_INTEGER,
1304 .arg1_type = ARG_PTR_TO_CTX,
1305 .arg2_type = ARG_CONST_MAP_PTR,
1306 .arg3_type = ARG_PTR_TO_MAP_KEY,
1307 .arg4_type = ARG_ANYTHING,
1308};
1309
1310struct sock_hash_seq_info {
1311 struct bpf_map *map;
1312 struct bpf_shtab *htab;
1313 u32 bucket_id;
1314};
1315
1316static void *sock_hash_seq_find_next(struct sock_hash_seq_info *info,
1317 struct bpf_shtab_elem *prev_elem)
1318{
1319 const struct bpf_shtab *htab = info->htab;
1320 struct bpf_shtab_bucket *bucket;
1321 struct bpf_shtab_elem *elem;
1322 struct hlist_node *node;
1323
1324 /* try to find next elem in the same bucket */
1325 if (prev_elem) {
1326 node = rcu_dereference(hlist_next_rcu(&prev_elem->node));
1327 elem = hlist_entry_safe(node, struct bpf_shtab_elem, node);
1328 if (elem)
1329 return elem;
1330
1331 /* no more elements, continue in the next bucket */
1332 info->bucket_id++;
1333 }
1334
1335 for (; info->bucket_id < htab->buckets_num; info->bucket_id++) {
1336 bucket = &htab->buckets[info->bucket_id];
1337 node = rcu_dereference(hlist_first_rcu(&bucket->head));
1338 elem = hlist_entry_safe(node, struct bpf_shtab_elem, node);
1339 if (elem)
1340 return elem;
1341 }
1342
1343 return NULL;
1344}
1345
1346static void *sock_hash_seq_start(struct seq_file *seq, loff_t *pos)
1347 __acquires(rcu)
1348{
1349 struct sock_hash_seq_info *info = seq->private;
1350
1351 if (*pos == 0)
1352 ++*pos;
1353
1354 /* pairs with sock_hash_seq_stop */
1355 rcu_read_lock();
1356 return sock_hash_seq_find_next(info, NULL);
1357}
1358
1359static void *sock_hash_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1360 __must_hold(rcu)
1361{
1362 struct sock_hash_seq_info *info = seq->private;
1363
1364 ++*pos;
1365 return sock_hash_seq_find_next(info, v);
1366}
1367
1368static int sock_hash_seq_show(struct seq_file *seq, void *v)
1369 __must_hold(rcu)
1370{
1371 struct sock_hash_seq_info *info = seq->private;
1372 struct bpf_iter__sockmap ctx = {};
1373 struct bpf_shtab_elem *elem = v;
1374 struct bpf_iter_meta meta;
1375 struct bpf_prog *prog;
1376
1377 meta.seq = seq;
1378 prog = bpf_iter_get_info(&meta, !elem);
1379 if (!prog)
1380 return 0;
1381
1382 ctx.meta = &meta;
1383 ctx.map = info->map;
1384 if (elem) {
1385 ctx.key = elem->key;
1386 ctx.sk = elem->sk;
1387 }
1388
1389 return bpf_iter_run_prog(prog, &ctx);
1390}
1391
1392static void sock_hash_seq_stop(struct seq_file *seq, void *v)
1393 __releases(rcu)
1394{
1395 if (!v)
1396 (void)sock_hash_seq_show(seq, NULL);
1397
1398 /* pairs with sock_hash_seq_start */
1399 rcu_read_unlock();
1400}
1401
1402static const struct seq_operations sock_hash_seq_ops = {
1403 .start = sock_hash_seq_start,
1404 .next = sock_hash_seq_next,
1405 .stop = sock_hash_seq_stop,
1406 .show = sock_hash_seq_show,
1407};
1408
1409static int sock_hash_init_seq_private(void *priv_data,
1410 struct bpf_iter_aux_info *aux)
1411{
1412 struct sock_hash_seq_info *info = priv_data;
1413
1414 bpf_map_inc_with_uref(aux->map);
1415 info->map = aux->map;
1416 info->htab = container_of(aux->map, struct bpf_shtab, map);
1417 return 0;
1418}
1419
1420static void sock_hash_fini_seq_private(void *priv_data)
1421{
1422 struct sock_hash_seq_info *info = priv_data;
1423
1424 bpf_map_put_with_uref(info->map);
1425}
1426
1427static u64 sock_hash_mem_usage(const struct bpf_map *map)
1428{
1429 struct bpf_shtab *htab = container_of(map, struct bpf_shtab, map);
1430 u64 usage = sizeof(*htab);
1431
1432 usage += htab->buckets_num * sizeof(struct bpf_shtab_bucket);
1433 usage += atomic_read(&htab->count) * (u64)htab->elem_size;
1434 return usage;
1435}
1436
1437static const struct bpf_iter_seq_info sock_hash_iter_seq_info = {
1438 .seq_ops = &sock_hash_seq_ops,
1439 .init_seq_private = sock_hash_init_seq_private,
1440 .fini_seq_private = sock_hash_fini_seq_private,
1441 .seq_priv_size = sizeof(struct sock_hash_seq_info),
1442};
1443
1444BTF_ID_LIST_SINGLE(sock_hash_map_btf_ids, struct, bpf_shtab)
1445const struct bpf_map_ops sock_hash_ops = {
1446 .map_meta_equal = bpf_map_meta_equal,
1447 .map_alloc = sock_hash_alloc,
1448 .map_free = sock_hash_free,
1449 .map_get_next_key = sock_hash_get_next_key,
1450 .map_update_elem = sock_map_update_elem,
1451 .map_delete_elem = sock_hash_delete_elem,
1452 .map_lookup_elem = sock_hash_lookup,
1453 .map_lookup_elem_sys_only = sock_hash_lookup_sys,
1454 .map_release_uref = sock_hash_release_progs,
1455 .map_check_btf = map_check_no_btf,
1456 .map_mem_usage = sock_hash_mem_usage,
1457 .map_btf_id = &sock_hash_map_btf_ids[0],
1458 .iter_seq_info = &sock_hash_iter_seq_info,
1459};
1460
1461static struct sk_psock_progs *sock_map_progs(struct bpf_map *map)
1462{
1463 switch (map->map_type) {
1464 case BPF_MAP_TYPE_SOCKMAP:
1465 return &container_of(map, struct bpf_stab, map)->progs;
1466 case BPF_MAP_TYPE_SOCKHASH:
1467 return &container_of(map, struct bpf_shtab, map)->progs;
1468 default:
1469 break;
1470 }
1471
1472 return NULL;
1473}
1474
1475static int sock_map_prog_link_lookup(struct bpf_map *map, struct bpf_prog ***pprog,
1476 struct bpf_link ***plink, u32 which)
1477{
1478 struct sk_psock_progs *progs = sock_map_progs(map);
1479 struct bpf_prog **cur_pprog;
1480 struct bpf_link **cur_plink;
1481
1482 if (!progs)
1483 return -EOPNOTSUPP;
1484
1485 switch (which) {
1486 case BPF_SK_MSG_VERDICT:
1487 cur_pprog = &progs->msg_parser;
1488 cur_plink = &progs->msg_parser_link;
1489 break;
1490#if IS_ENABLED(CONFIG_BPF_STREAM_PARSER)
1491 case BPF_SK_SKB_STREAM_PARSER:
1492 cur_pprog = &progs->stream_parser;
1493 cur_plink = &progs->stream_parser_link;
1494 break;
1495#endif
1496 case BPF_SK_SKB_STREAM_VERDICT:
1497 if (progs->skb_verdict)
1498 return -EBUSY;
1499 cur_pprog = &progs->stream_verdict;
1500 cur_plink = &progs->stream_verdict_link;
1501 break;
1502 case BPF_SK_SKB_VERDICT:
1503 if (progs->stream_verdict)
1504 return -EBUSY;
1505 cur_pprog = &progs->skb_verdict;
1506 cur_plink = &progs->skb_verdict_link;
1507 break;
1508 default:
1509 return -EOPNOTSUPP;
1510 }
1511
1512 *pprog = cur_pprog;
1513 if (plink)
1514 *plink = cur_plink;
1515 return 0;
1516}
1517
1518/* Handle the following four cases:
1519 * prog_attach: prog != NULL, old == NULL, link == NULL
1520 * prog_detach: prog == NULL, old != NULL, link == NULL
1521 * link_attach: prog != NULL, old == NULL, link != NULL
1522 * link_detach: prog == NULL, old != NULL, link != NULL
1523 */
1524static int sock_map_prog_update(struct bpf_map *map, struct bpf_prog *prog,
1525 struct bpf_prog *old, struct bpf_link *link,
1526 u32 which)
1527{
1528 struct bpf_prog **pprog;
1529 struct bpf_link **plink;
1530 int ret;
1531
1532 ret = sock_map_prog_link_lookup(map, &pprog, &plink, which);
1533 if (ret)
1534 return ret;
1535
1536 /* for prog_attach/prog_detach/link_attach, return error if a bpf_link
1537 * exists for that prog.
1538 */
1539 if ((!link || prog) && *plink)
1540 return -EBUSY;
1541
1542 if (old) {
1543 ret = psock_replace_prog(pprog, prog, old);
1544 if (!ret)
1545 *plink = NULL;
1546 } else {
1547 psock_set_prog(pprog, prog);
1548 if (link)
1549 *plink = link;
1550 }
1551
1552 return ret;
1553}
1554
1555int sock_map_bpf_prog_query(const union bpf_attr *attr,
1556 union bpf_attr __user *uattr)
1557{
1558 __u32 __user *prog_ids = u64_to_user_ptr(attr->query.prog_ids);
1559 u32 prog_cnt = 0, flags = 0;
1560 struct bpf_prog **pprog;
1561 struct bpf_prog *prog;
1562 struct bpf_map *map;
1563 u32 id = 0;
1564 int ret;
1565
1566 if (attr->query.query_flags)
1567 return -EINVAL;
1568
1569 CLASS(fd, f)(attr->target_fd);
1570 map = __bpf_map_get(f);
1571 if (IS_ERR(map))
1572 return PTR_ERR(map);
1573
1574 rcu_read_lock();
1575
1576 ret = sock_map_prog_link_lookup(map, &pprog, NULL, attr->query.attach_type);
1577 if (ret)
1578 goto end;
1579
1580 prog = *pprog;
1581 prog_cnt = !prog ? 0 : 1;
1582
1583 if (!attr->query.prog_cnt || !prog_ids || !prog_cnt)
1584 goto end;
1585
1586 /* we do not hold the refcnt, the bpf prog may be released
1587 * asynchronously and the id would be set to 0.
1588 */
1589 id = data_race(prog->aux->id);
1590 if (id == 0)
1591 prog_cnt = 0;
1592
1593end:
1594 rcu_read_unlock();
1595
1596 if (copy_to_user(&uattr->query.attach_flags, &flags, sizeof(flags)) ||
1597 (id != 0 && copy_to_user(prog_ids, &id, sizeof(u32))) ||
1598 copy_to_user(&uattr->query.prog_cnt, &prog_cnt, sizeof(prog_cnt)))
1599 ret = -EFAULT;
1600
1601 return ret;
1602}
1603
1604static void sock_map_unlink(struct sock *sk, struct sk_psock_link *link)
1605{
1606 switch (link->map->map_type) {
1607 case BPF_MAP_TYPE_SOCKMAP:
1608 return sock_map_delete_from_link(link->map, sk,
1609 link->link_raw);
1610 case BPF_MAP_TYPE_SOCKHASH:
1611 return sock_hash_delete_from_link(link->map, sk,
1612 link->link_raw);
1613 default:
1614 break;
1615 }
1616}
1617
1618static void sock_map_remove_links(struct sock *sk, struct sk_psock *psock)
1619{
1620 struct sk_psock_link *link;
1621
1622 while ((link = sk_psock_link_pop(psock))) {
1623 sock_map_unlink(sk, link);
1624 sk_psock_free_link(link);
1625 }
1626}
1627
1628void sock_map_unhash(struct sock *sk)
1629{
1630 void (*saved_unhash)(struct sock *sk);
1631 struct sk_psock *psock;
1632
1633 rcu_read_lock();
1634 psock = sk_psock(sk);
1635 if (unlikely(!psock)) {
1636 rcu_read_unlock();
1637 saved_unhash = READ_ONCE(sk->sk_prot)->unhash;
1638 } else {
1639 saved_unhash = psock->saved_unhash;
1640 sock_map_remove_links(sk, psock);
1641 rcu_read_unlock();
1642 }
1643 if (WARN_ON_ONCE(saved_unhash == sock_map_unhash))
1644 return;
1645 if (saved_unhash)
1646 saved_unhash(sk);
1647}
1648EXPORT_SYMBOL_GPL(sock_map_unhash);
1649
1650void sock_map_destroy(struct sock *sk)
1651{
1652 void (*saved_destroy)(struct sock *sk);
1653 struct sk_psock *psock;
1654
1655 rcu_read_lock();
1656 psock = sk_psock_get(sk);
1657 if (unlikely(!psock)) {
1658 rcu_read_unlock();
1659 saved_destroy = READ_ONCE(sk->sk_prot)->destroy;
1660 } else {
1661 saved_destroy = psock->saved_destroy;
1662 sock_map_remove_links(sk, psock);
1663 rcu_read_unlock();
1664 sk_psock_stop(psock);
1665 sk_psock_put(sk, psock);
1666 }
1667 if (WARN_ON_ONCE(saved_destroy == sock_map_destroy))
1668 return;
1669 if (saved_destroy)
1670 saved_destroy(sk);
1671}
1672EXPORT_SYMBOL_GPL(sock_map_destroy);
1673
1674void sock_map_close(struct sock *sk, long timeout)
1675{
1676 void (*saved_close)(struct sock *sk, long timeout);
1677 struct sk_psock *psock;
1678
1679 lock_sock(sk);
1680 rcu_read_lock();
1681 psock = sk_psock(sk);
1682 if (likely(psock)) {
1683 saved_close = psock->saved_close;
1684 sock_map_remove_links(sk, psock);
1685 psock = sk_psock_get(sk);
1686 if (unlikely(!psock))
1687 goto no_psock;
1688 rcu_read_unlock();
1689 sk_psock_stop(psock);
1690 release_sock(sk);
1691 cancel_delayed_work_sync(&psock->work);
1692 sk_psock_put(sk, psock);
1693 } else {
1694 saved_close = READ_ONCE(sk->sk_prot)->close;
1695no_psock:
1696 rcu_read_unlock();
1697 release_sock(sk);
1698 }
1699
1700 /* Make sure we do not recurse. This is a bug.
1701 * Leak the socket instead of crashing on a stack overflow.
1702 */
1703 if (WARN_ON_ONCE(saved_close == sock_map_close))
1704 return;
1705 saved_close(sk, timeout);
1706}
1707EXPORT_SYMBOL_GPL(sock_map_close);
1708
1709struct sockmap_link {
1710 struct bpf_link link;
1711 struct bpf_map *map;
1712 enum bpf_attach_type attach_type;
1713};
1714
1715static void sock_map_link_release(struct bpf_link *link)
1716{
1717 struct sockmap_link *sockmap_link = container_of(link, struct sockmap_link, link);
1718
1719 mutex_lock(&sockmap_mutex);
1720 if (!sockmap_link->map)
1721 goto out;
1722
1723 WARN_ON_ONCE(sock_map_prog_update(sockmap_link->map, NULL, link->prog, link,
1724 sockmap_link->attach_type));
1725
1726 bpf_map_put_with_uref(sockmap_link->map);
1727 sockmap_link->map = NULL;
1728out:
1729 mutex_unlock(&sockmap_mutex);
1730}
1731
1732static int sock_map_link_detach(struct bpf_link *link)
1733{
1734 sock_map_link_release(link);
1735 return 0;
1736}
1737
1738static void sock_map_link_dealloc(struct bpf_link *link)
1739{
1740 kfree(link);
1741}
1742
1743/* Handle the following two cases:
1744 * case 1: link != NULL, prog != NULL, old != NULL
1745 * case 2: link != NULL, prog != NULL, old == NULL
1746 */
1747static int sock_map_link_update_prog(struct bpf_link *link,
1748 struct bpf_prog *prog,
1749 struct bpf_prog *old)
1750{
1751 const struct sockmap_link *sockmap_link = container_of(link, struct sockmap_link, link);
1752 struct bpf_prog **pprog, *old_link_prog;
1753 struct bpf_link **plink;
1754 int ret = 0;
1755
1756 mutex_lock(&sockmap_mutex);
1757
1758 /* If old prog is not NULL, ensure old prog is the same as link->prog. */
1759 if (old && link->prog != old) {
1760 ret = -EPERM;
1761 goto out;
1762 }
1763 /* Ensure link->prog has the same type/attach_type as the new prog. */
1764 if (link->prog->type != prog->type ||
1765 link->prog->expected_attach_type != prog->expected_attach_type) {
1766 ret = -EINVAL;
1767 goto out;
1768 }
1769 if (!sockmap_link->map) {
1770 ret = -ENOLINK;
1771 goto out;
1772 }
1773
1774 ret = sock_map_prog_link_lookup(sockmap_link->map, &pprog, &plink,
1775 sockmap_link->attach_type);
1776 if (ret)
1777 goto out;
1778
1779 /* return error if the stored bpf_link does not match the incoming bpf_link. */
1780 if (link != *plink) {
1781 ret = -EBUSY;
1782 goto out;
1783 }
1784
1785 if (old) {
1786 ret = psock_replace_prog(pprog, prog, old);
1787 if (ret)
1788 goto out;
1789 } else {
1790 psock_set_prog(pprog, prog);
1791 }
1792
1793 bpf_prog_inc(prog);
1794 old_link_prog = xchg(&link->prog, prog);
1795 bpf_prog_put(old_link_prog);
1796
1797out:
1798 mutex_unlock(&sockmap_mutex);
1799 return ret;
1800}
1801
1802static u32 sock_map_link_get_map_id(const struct sockmap_link *sockmap_link)
1803{
1804 u32 map_id = 0;
1805
1806 mutex_lock(&sockmap_mutex);
1807 if (sockmap_link->map)
1808 map_id = sockmap_link->map->id;
1809 mutex_unlock(&sockmap_mutex);
1810 return map_id;
1811}
1812
1813static int sock_map_link_fill_info(const struct bpf_link *link,
1814 struct bpf_link_info *info)
1815{
1816 const struct sockmap_link *sockmap_link = container_of(link, struct sockmap_link, link);
1817 u32 map_id = sock_map_link_get_map_id(sockmap_link);
1818
1819 info->sockmap.map_id = map_id;
1820 info->sockmap.attach_type = sockmap_link->attach_type;
1821 return 0;
1822}
1823
1824static void sock_map_link_show_fdinfo(const struct bpf_link *link,
1825 struct seq_file *seq)
1826{
1827 const struct sockmap_link *sockmap_link = container_of(link, struct sockmap_link, link);
1828 u32 map_id = sock_map_link_get_map_id(sockmap_link);
1829
1830 seq_printf(seq, "map_id:\t%u\n", map_id);
1831 seq_printf(seq, "attach_type:\t%u\n", sockmap_link->attach_type);
1832}
1833
1834static const struct bpf_link_ops sock_map_link_ops = {
1835 .release = sock_map_link_release,
1836 .dealloc = sock_map_link_dealloc,
1837 .detach = sock_map_link_detach,
1838 .update_prog = sock_map_link_update_prog,
1839 .fill_link_info = sock_map_link_fill_info,
1840 .show_fdinfo = sock_map_link_show_fdinfo,
1841};
1842
1843int sock_map_link_create(const union bpf_attr *attr, struct bpf_prog *prog)
1844{
1845 struct bpf_link_primer link_primer;
1846 struct sockmap_link *sockmap_link;
1847 enum bpf_attach_type attach_type;
1848 struct bpf_map *map;
1849 int ret;
1850
1851 if (attr->link_create.flags)
1852 return -EINVAL;
1853
1854 map = bpf_map_get_with_uref(attr->link_create.target_fd);
1855 if (IS_ERR(map))
1856 return PTR_ERR(map);
1857 if (map->map_type != BPF_MAP_TYPE_SOCKMAP && map->map_type != BPF_MAP_TYPE_SOCKHASH) {
1858 ret = -EINVAL;
1859 goto out;
1860 }
1861
1862 sockmap_link = kzalloc(sizeof(*sockmap_link), GFP_USER);
1863 if (!sockmap_link) {
1864 ret = -ENOMEM;
1865 goto out;
1866 }
1867
1868 attach_type = attr->link_create.attach_type;
1869 bpf_link_init(&sockmap_link->link, BPF_LINK_TYPE_SOCKMAP, &sock_map_link_ops, prog);
1870 sockmap_link->map = map;
1871 sockmap_link->attach_type = attach_type;
1872
1873 ret = bpf_link_prime(&sockmap_link->link, &link_primer);
1874 if (ret) {
1875 kfree(sockmap_link);
1876 goto out;
1877 }
1878
1879 mutex_lock(&sockmap_mutex);
1880 ret = sock_map_prog_update(map, prog, NULL, &sockmap_link->link, attach_type);
1881 mutex_unlock(&sockmap_mutex);
1882 if (ret) {
1883 bpf_link_cleanup(&link_primer);
1884 goto out;
1885 }
1886
1887 /* Increase refcnt for the prog since when old prog is replaced with
1888 * psock_replace_prog() and psock_set_prog() its refcnt will be decreased.
1889 *
1890 * Actually, we do not need to increase refcnt for the prog since bpf_link
1891 * will hold a reference. But in order to have less complexity w.r.t.
1892 * replacing/setting prog, let us increase the refcnt to make things simpler.
1893 */
1894 bpf_prog_inc(prog);
1895
1896 return bpf_link_settle(&link_primer);
1897
1898out:
1899 bpf_map_put_with_uref(map);
1900 return ret;
1901}
1902
1903static int sock_map_iter_attach_target(struct bpf_prog *prog,
1904 union bpf_iter_link_info *linfo,
1905 struct bpf_iter_aux_info *aux)
1906{
1907 struct bpf_map *map;
1908 int err = -EINVAL;
1909
1910 if (!linfo->map.map_fd)
1911 return -EBADF;
1912
1913 map = bpf_map_get_with_uref(linfo->map.map_fd);
1914 if (IS_ERR(map))
1915 return PTR_ERR(map);
1916
1917 if (map->map_type != BPF_MAP_TYPE_SOCKMAP &&
1918 map->map_type != BPF_MAP_TYPE_SOCKHASH)
1919 goto put_map;
1920
1921 if (prog->aux->max_rdonly_access > map->key_size) {
1922 err = -EACCES;
1923 goto put_map;
1924 }
1925
1926 aux->map = map;
1927 return 0;
1928
1929put_map:
1930 bpf_map_put_with_uref(map);
1931 return err;
1932}
1933
1934static void sock_map_iter_detach_target(struct bpf_iter_aux_info *aux)
1935{
1936 bpf_map_put_with_uref(aux->map);
1937}
1938
1939static struct bpf_iter_reg sock_map_iter_reg = {
1940 .target = "sockmap",
1941 .attach_target = sock_map_iter_attach_target,
1942 .detach_target = sock_map_iter_detach_target,
1943 .show_fdinfo = bpf_iter_map_show_fdinfo,
1944 .fill_link_info = bpf_iter_map_fill_link_info,
1945 .ctx_arg_info_size = 2,
1946 .ctx_arg_info = {
1947 { offsetof(struct bpf_iter__sockmap, key),
1948 PTR_TO_BUF | PTR_MAYBE_NULL | MEM_RDONLY },
1949 { offsetof(struct bpf_iter__sockmap, sk),
1950 PTR_TO_BTF_ID_OR_NULL },
1951 },
1952};
1953
1954static int __init bpf_sockmap_iter_init(void)
1955{
1956 sock_map_iter_reg.ctx_arg_info[1].btf_id =
1957 btf_sock_ids[BTF_SOCK_TYPE_SOCK];
1958 return bpf_iter_reg_target(&sock_map_iter_reg);
1959}
1960late_initcall(bpf_sockmap_iter_init);