Commit | Line | Data |
---|---|---|
604326b4 DB |
1 | // SPDX-License-Identifier: GPL-2.0 |
2 | /* Copyright (c) 2017 - 2018 Covalent IO, Inc. http://covalent.io */ | |
3 | ||
4 | #include <linux/skmsg.h> | |
5 | #include <linux/skbuff.h> | |
6 | #include <linux/scatterlist.h> | |
7 | ||
8 | #include <net/sock.h> | |
9 | #include <net/tcp.h> | |
e91de6af | 10 | #include <net/tls.h> |
604326b4 DB |
11 | |
12 | static bool sk_msg_try_coalesce_ok(struct sk_msg *msg, int elem_first_coalesce) | |
13 | { | |
14 | if (msg->sg.end > msg->sg.start && | |
15 | elem_first_coalesce < msg->sg.end) | |
16 | return true; | |
17 | ||
18 | if (msg->sg.end < msg->sg.start && | |
19 | (elem_first_coalesce > msg->sg.start || | |
20 | elem_first_coalesce < msg->sg.end)) | |
21 | return true; | |
22 | ||
23 | return false; | |
24 | } | |
25 | ||
26 | int sk_msg_alloc(struct sock *sk, struct sk_msg *msg, int len, | |
27 | int elem_first_coalesce) | |
28 | { | |
29 | struct page_frag *pfrag = sk_page_frag(sk); | |
30 | int ret = 0; | |
31 | ||
32 | len -= msg->sg.size; | |
33 | while (len > 0) { | |
34 | struct scatterlist *sge; | |
35 | u32 orig_offset; | |
36 | int use, i; | |
37 | ||
38 | if (!sk_page_frag_refill(sk, pfrag)) | |
39 | return -ENOMEM; | |
40 | ||
41 | orig_offset = pfrag->offset; | |
42 | use = min_t(int, len, pfrag->size - orig_offset); | |
43 | if (!sk_wmem_schedule(sk, use)) | |
44 | return -ENOMEM; | |
45 | ||
46 | i = msg->sg.end; | |
47 | sk_msg_iter_var_prev(i); | |
48 | sge = &msg->sg.data[i]; | |
49 | ||
50 | if (sk_msg_try_coalesce_ok(msg, elem_first_coalesce) && | |
51 | sg_page(sge) == pfrag->page && | |
52 | sge->offset + sge->length == orig_offset) { | |
53 | sge->length += use; | |
54 | } else { | |
55 | if (sk_msg_full(msg)) { | |
56 | ret = -ENOSPC; | |
57 | break; | |
58 | } | |
59 | ||
60 | sge = &msg->sg.data[msg->sg.end]; | |
61 | sg_unmark_end(sge); | |
62 | sg_set_page(sge, pfrag->page, use, orig_offset); | |
63 | get_page(pfrag->page); | |
64 | sk_msg_iter_next(msg, end); | |
65 | } | |
66 | ||
67 | sk_mem_charge(sk, use); | |
68 | msg->sg.size += use; | |
69 | pfrag->offset += use; | |
70 | len -= use; | |
71 | } | |
72 | ||
73 | return ret; | |
74 | } | |
75 | EXPORT_SYMBOL_GPL(sk_msg_alloc); | |
76 | ||
d829e9c4 DB |
77 | int sk_msg_clone(struct sock *sk, struct sk_msg *dst, struct sk_msg *src, |
78 | u32 off, u32 len) | |
79 | { | |
80 | int i = src->sg.start; | |
81 | struct scatterlist *sge = sk_msg_elem(src, i); | |
fda497e5 | 82 | struct scatterlist *sgd = NULL; |
d829e9c4 DB |
83 | u32 sge_len, sge_off; |
84 | ||
d829e9c4 DB |
85 | while (off) { |
86 | if (sge->length > off) | |
87 | break; | |
88 | off -= sge->length; | |
89 | sk_msg_iter_var_next(i); | |
90 | if (i == src->sg.end && off) | |
91 | return -ENOSPC; | |
92 | sge = sk_msg_elem(src, i); | |
93 | } | |
94 | ||
95 | while (len) { | |
96 | sge_len = sge->length - off; | |
d829e9c4 DB |
97 | if (sge_len > len) |
98 | sge_len = len; | |
fda497e5 VG |
99 | |
100 | if (dst->sg.end) | |
101 | sgd = sk_msg_elem(dst, dst->sg.end - 1); | |
102 | ||
103 | if (sgd && | |
104 | (sg_page(sge) == sg_page(sgd)) && | |
105 | (sg_virt(sge) + off == sg_virt(sgd) + sgd->length)) { | |
106 | sgd->length += sge_len; | |
107 | dst->sg.size += sge_len; | |
108 | } else if (!sk_msg_full(dst)) { | |
109 | sge_off = sge->offset + off; | |
110 | sk_msg_page_add(dst, sg_page(sge), sge_len, sge_off); | |
111 | } else { | |
112 | return -ENOSPC; | |
113 | } | |
114 | ||
d829e9c4 DB |
115 | off = 0; |
116 | len -= sge_len; | |
d829e9c4 DB |
117 | sk_mem_charge(sk, sge_len); |
118 | sk_msg_iter_var_next(i); | |
119 | if (i == src->sg.end && len) | |
120 | return -ENOSPC; | |
121 | sge = sk_msg_elem(src, i); | |
122 | } | |
123 | ||
124 | return 0; | |
125 | } | |
126 | EXPORT_SYMBOL_GPL(sk_msg_clone); | |
127 | ||
604326b4 DB |
128 | void sk_msg_return_zero(struct sock *sk, struct sk_msg *msg, int bytes) |
129 | { | |
130 | int i = msg->sg.start; | |
131 | ||
132 | do { | |
133 | struct scatterlist *sge = sk_msg_elem(msg, i); | |
134 | ||
135 | if (bytes < sge->length) { | |
136 | sge->length -= bytes; | |
137 | sge->offset += bytes; | |
138 | sk_mem_uncharge(sk, bytes); | |
139 | break; | |
140 | } | |
141 | ||
142 | sk_mem_uncharge(sk, sge->length); | |
143 | bytes -= sge->length; | |
144 | sge->length = 0; | |
145 | sge->offset = 0; | |
146 | sk_msg_iter_var_next(i); | |
147 | } while (bytes && i != msg->sg.end); | |
148 | msg->sg.start = i; | |
149 | } | |
150 | EXPORT_SYMBOL_GPL(sk_msg_return_zero); | |
151 | ||
152 | void sk_msg_return(struct sock *sk, struct sk_msg *msg, int bytes) | |
153 | { | |
154 | int i = msg->sg.start; | |
155 | ||
156 | do { | |
157 | struct scatterlist *sge = &msg->sg.data[i]; | |
158 | int uncharge = (bytes < sge->length) ? bytes : sge->length; | |
159 | ||
160 | sk_mem_uncharge(sk, uncharge); | |
161 | bytes -= uncharge; | |
162 | sk_msg_iter_var_next(i); | |
163 | } while (i != msg->sg.end); | |
164 | } | |
165 | EXPORT_SYMBOL_GPL(sk_msg_return); | |
166 | ||
167 | static int sk_msg_free_elem(struct sock *sk, struct sk_msg *msg, u32 i, | |
168 | bool charge) | |
169 | { | |
170 | struct scatterlist *sge = sk_msg_elem(msg, i); | |
171 | u32 len = sge->length; | |
172 | ||
36cd0e69 JF |
173 | /* When the skb owns the memory we free it from consume_skb path. */ |
174 | if (!msg->skb) { | |
175 | if (charge) | |
176 | sk_mem_uncharge(sk, len); | |
604326b4 | 177 | put_page(sg_page(sge)); |
36cd0e69 | 178 | } |
604326b4 DB |
179 | memset(sge, 0, sizeof(*sge)); |
180 | return len; | |
181 | } | |
182 | ||
183 | static int __sk_msg_free(struct sock *sk, struct sk_msg *msg, u32 i, | |
184 | bool charge) | |
185 | { | |
186 | struct scatterlist *sge = sk_msg_elem(msg, i); | |
187 | int freed = 0; | |
188 | ||
189 | while (msg->sg.size) { | |
190 | msg->sg.size -= sge->length; | |
191 | freed += sk_msg_free_elem(sk, msg, i, charge); | |
192 | sk_msg_iter_var_next(i); | |
193 | sk_msg_check_to_free(msg, i, msg->sg.size); | |
194 | sge = sk_msg_elem(msg, i); | |
195 | } | |
dd016aca | 196 | consume_skb(msg->skb); |
604326b4 DB |
197 | sk_msg_init(msg); |
198 | return freed; | |
199 | } | |
200 | ||
201 | int sk_msg_free_nocharge(struct sock *sk, struct sk_msg *msg) | |
202 | { | |
203 | return __sk_msg_free(sk, msg, msg->sg.start, false); | |
204 | } | |
205 | EXPORT_SYMBOL_GPL(sk_msg_free_nocharge); | |
206 | ||
207 | int sk_msg_free(struct sock *sk, struct sk_msg *msg) | |
208 | { | |
209 | return __sk_msg_free(sk, msg, msg->sg.start, true); | |
210 | } | |
211 | EXPORT_SYMBOL_GPL(sk_msg_free); | |
212 | ||
213 | static void __sk_msg_free_partial(struct sock *sk, struct sk_msg *msg, | |
214 | u32 bytes, bool charge) | |
215 | { | |
216 | struct scatterlist *sge; | |
217 | u32 i = msg->sg.start; | |
218 | ||
219 | while (bytes) { | |
220 | sge = sk_msg_elem(msg, i); | |
221 | if (!sge->length) | |
222 | break; | |
223 | if (bytes < sge->length) { | |
224 | if (charge) | |
225 | sk_mem_uncharge(sk, bytes); | |
226 | sge->length -= bytes; | |
227 | sge->offset += bytes; | |
228 | msg->sg.size -= bytes; | |
229 | break; | |
230 | } | |
231 | ||
232 | msg->sg.size -= sge->length; | |
233 | bytes -= sge->length; | |
234 | sk_msg_free_elem(sk, msg, i, charge); | |
235 | sk_msg_iter_var_next(i); | |
236 | sk_msg_check_to_free(msg, i, bytes); | |
237 | } | |
238 | msg->sg.start = i; | |
239 | } | |
240 | ||
241 | void sk_msg_free_partial(struct sock *sk, struct sk_msg *msg, u32 bytes) | |
242 | { | |
243 | __sk_msg_free_partial(sk, msg, bytes, true); | |
244 | } | |
245 | EXPORT_SYMBOL_GPL(sk_msg_free_partial); | |
246 | ||
247 | void sk_msg_free_partial_nocharge(struct sock *sk, struct sk_msg *msg, | |
248 | u32 bytes) | |
249 | { | |
250 | __sk_msg_free_partial(sk, msg, bytes, false); | |
251 | } | |
252 | ||
253 | void sk_msg_trim(struct sock *sk, struct sk_msg *msg, int len) | |
254 | { | |
255 | int trim = msg->sg.size - len; | |
256 | u32 i = msg->sg.end; | |
257 | ||
258 | if (trim <= 0) { | |
259 | WARN_ON(trim < 0); | |
260 | return; | |
261 | } | |
262 | ||
263 | sk_msg_iter_var_prev(i); | |
264 | msg->sg.size = len; | |
265 | while (msg->sg.data[i].length && | |
266 | trim >= msg->sg.data[i].length) { | |
267 | trim -= msg->sg.data[i].length; | |
268 | sk_msg_free_elem(sk, msg, i, true); | |
269 | sk_msg_iter_var_prev(i); | |
270 | if (!trim) | |
271 | goto out; | |
272 | } | |
273 | ||
274 | msg->sg.data[i].length -= trim; | |
275 | sk_mem_uncharge(sk, trim); | |
683916f6 JK |
276 | /* Adjust copybreak if it falls into the trimmed part of last buf */ |
277 | if (msg->sg.curr == i && msg->sg.copybreak > msg->sg.data[i].length) | |
278 | msg->sg.copybreak = msg->sg.data[i].length; | |
604326b4 | 279 | out: |
683916f6 JK |
280 | sk_msg_iter_var_next(i); |
281 | msg->sg.end = i; | |
282 | ||
283 | /* If we trim data a full sg elem before curr pointer update | |
284 | * copybreak and current so that any future copy operations | |
285 | * start at new copy location. | |
604326b4 DB |
286 | * However trimed data that has not yet been used in a copy op |
287 | * does not require an update. | |
288 | */ | |
683916f6 JK |
289 | if (!msg->sg.size) { |
290 | msg->sg.curr = msg->sg.start; | |
291 | msg->sg.copybreak = 0; | |
292 | } else if (sk_msg_iter_dist(msg->sg.start, msg->sg.curr) >= | |
293 | sk_msg_iter_dist(msg->sg.start, msg->sg.end)) { | |
294 | sk_msg_iter_var_prev(i); | |
604326b4 DB |
295 | msg->sg.curr = i; |
296 | msg->sg.copybreak = msg->sg.data[i].length; | |
297 | } | |
604326b4 DB |
298 | } |
299 | EXPORT_SYMBOL_GPL(sk_msg_trim); | |
300 | ||
301 | int sk_msg_zerocopy_from_iter(struct sock *sk, struct iov_iter *from, | |
302 | struct sk_msg *msg, u32 bytes) | |
303 | { | |
304 | int i, maxpages, ret = 0, num_elems = sk_msg_elem_used(msg); | |
305 | const int to_max_pages = MAX_MSG_FRAGS; | |
306 | struct page *pages[MAX_MSG_FRAGS]; | |
307 | ssize_t orig, copied, use, offset; | |
308 | ||
309 | orig = msg->sg.size; | |
310 | while (bytes > 0) { | |
311 | i = 0; | |
312 | maxpages = to_max_pages - num_elems; | |
313 | if (maxpages == 0) { | |
314 | ret = -EFAULT; | |
315 | goto out; | |
316 | } | |
317 | ||
318 | copied = iov_iter_get_pages(from, pages, bytes, maxpages, | |
319 | &offset); | |
320 | if (copied <= 0) { | |
321 | ret = -EFAULT; | |
322 | goto out; | |
323 | } | |
324 | ||
325 | iov_iter_advance(from, copied); | |
326 | bytes -= copied; | |
327 | msg->sg.size += copied; | |
328 | ||
329 | while (copied) { | |
330 | use = min_t(int, copied, PAGE_SIZE - offset); | |
331 | sg_set_page(&msg->sg.data[msg->sg.end], | |
332 | pages[i], use, offset); | |
333 | sg_unmark_end(&msg->sg.data[msg->sg.end]); | |
334 | sk_mem_charge(sk, use); | |
335 | ||
336 | offset = 0; | |
337 | copied -= use; | |
338 | sk_msg_iter_next(msg, end); | |
339 | num_elems++; | |
340 | i++; | |
341 | } | |
342 | /* When zerocopy is mixed with sk_msg_*copy* operations we | |
343 | * may have a copybreak set in this case clear and prefer | |
344 | * zerocopy remainder when possible. | |
345 | */ | |
346 | msg->sg.copybreak = 0; | |
347 | msg->sg.curr = msg->sg.end; | |
348 | } | |
349 | out: | |
350 | /* Revert iov_iter updates, msg will need to use 'trim' later if it | |
351 | * also needs to be cleared. | |
352 | */ | |
353 | if (ret) | |
354 | iov_iter_revert(from, msg->sg.size - orig); | |
355 | return ret; | |
356 | } | |
357 | EXPORT_SYMBOL_GPL(sk_msg_zerocopy_from_iter); | |
358 | ||
359 | int sk_msg_memcopy_from_iter(struct sock *sk, struct iov_iter *from, | |
360 | struct sk_msg *msg, u32 bytes) | |
361 | { | |
362 | int ret = -ENOSPC, i = msg->sg.curr; | |
363 | struct scatterlist *sge; | |
364 | u32 copy, buf_size; | |
365 | void *to; | |
366 | ||
367 | do { | |
368 | sge = sk_msg_elem(msg, i); | |
369 | /* This is possible if a trim operation shrunk the buffer */ | |
370 | if (msg->sg.copybreak >= sge->length) { | |
371 | msg->sg.copybreak = 0; | |
372 | sk_msg_iter_var_next(i); | |
373 | if (i == msg->sg.end) | |
374 | break; | |
375 | sge = sk_msg_elem(msg, i); | |
376 | } | |
377 | ||
378 | buf_size = sge->length - msg->sg.copybreak; | |
379 | copy = (buf_size > bytes) ? bytes : buf_size; | |
380 | to = sg_virt(sge) + msg->sg.copybreak; | |
381 | msg->sg.copybreak += copy; | |
382 | if (sk->sk_route_caps & NETIF_F_NOCACHE_COPY) | |
383 | ret = copy_from_iter_nocache(to, copy, from); | |
384 | else | |
385 | ret = copy_from_iter(to, copy, from); | |
386 | if (ret != copy) { | |
387 | ret = -EFAULT; | |
388 | goto out; | |
389 | } | |
390 | bytes -= copy; | |
391 | if (!bytes) | |
392 | break; | |
393 | msg->sg.copybreak = 0; | |
394 | sk_msg_iter_var_next(i); | |
395 | } while (i != msg->sg.end); | |
396 | out: | |
397 | msg->sg.curr = i; | |
398 | return ret; | |
399 | } | |
400 | EXPORT_SYMBOL_GPL(sk_msg_memcopy_from_iter); | |
401 | ||
2bc793e3 CW |
402 | /* Receive sk_msg from psock->ingress_msg to @msg. */ |
403 | int sk_msg_recvmsg(struct sock *sk, struct sk_psock *psock, struct msghdr *msg, | |
404 | int len, int flags) | |
405 | { | |
406 | struct iov_iter *iter = &msg->msg_iter; | |
407 | int peek = flags & MSG_PEEK; | |
408 | struct sk_msg *msg_rx; | |
409 | int i, copied = 0; | |
410 | ||
411 | msg_rx = sk_psock_peek_msg(psock); | |
412 | while (copied != len) { | |
413 | struct scatterlist *sge; | |
414 | ||
415 | if (unlikely(!msg_rx)) | |
416 | break; | |
417 | ||
418 | i = msg_rx->sg.start; | |
419 | do { | |
420 | struct page *page; | |
421 | int copy; | |
422 | ||
423 | sge = sk_msg_elem(msg_rx, i); | |
424 | copy = sge->length; | |
425 | page = sg_page(sge); | |
426 | if (copied + copy > len) | |
427 | copy = len - copied; | |
428 | copy = copy_page_to_iter(page, sge->offset, copy, iter); | |
429 | if (!copy) | |
430 | return copied ? copied : -EFAULT; | |
431 | ||
432 | copied += copy; | |
433 | if (likely(!peek)) { | |
434 | sge->offset += copy; | |
435 | sge->length -= copy; | |
436 | if (!msg_rx->skb) | |
437 | sk_mem_uncharge(sk, copy); | |
438 | msg_rx->sg.size -= copy; | |
439 | ||
440 | if (!sge->length) { | |
441 | sk_msg_iter_var_next(i); | |
442 | if (!msg_rx->skb) | |
443 | put_page(page); | |
444 | } | |
445 | } else { | |
446 | /* Lets not optimize peek case if copy_page_to_iter | |
447 | * didn't copy the entire length lets just break. | |
448 | */ | |
449 | if (copy != sge->length) | |
450 | return copied; | |
451 | sk_msg_iter_var_next(i); | |
452 | } | |
453 | ||
454 | if (copied == len) | |
455 | break; | |
456 | } while (i != msg_rx->sg.end); | |
457 | ||
458 | if (unlikely(peek)) { | |
459 | msg_rx = sk_psock_next_msg(psock, msg_rx); | |
460 | if (!msg_rx) | |
461 | break; | |
462 | continue; | |
463 | } | |
464 | ||
465 | msg_rx->sg.start = i; | |
466 | if (!sge->length && msg_rx->sg.start == msg_rx->sg.end) { | |
467 | msg_rx = sk_psock_dequeue_msg(psock); | |
468 | kfree_sk_msg(msg_rx); | |
469 | } | |
470 | msg_rx = sk_psock_peek_msg(psock); | |
471 | } | |
472 | ||
473 | return copied; | |
474 | } | |
475 | EXPORT_SYMBOL_GPL(sk_msg_recvmsg); | |
476 | ||
6fa9201a JF |
477 | static struct sk_msg *sk_psock_create_ingress_msg(struct sock *sk, |
478 | struct sk_buff *skb) | |
604326b4 | 479 | { |
604326b4 DB |
480 | struct sk_msg *msg; |
481 | ||
36cd0e69 | 482 | if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf) |
6fa9201a JF |
483 | return NULL; |
484 | ||
485 | if (!sk_rmem_schedule(sk, skb, skb->truesize)) | |
486 | return NULL; | |
36cd0e69 | 487 | |
190179f6 | 488 | msg = kzalloc(sizeof(*msg), __GFP_NOWARN | GFP_KERNEL); |
604326b4 | 489 | if (unlikely(!msg)) |
6fa9201a | 490 | return NULL; |
604326b4 DB |
491 | |
492 | sk_msg_init(msg); | |
6fa9201a JF |
493 | return msg; |
494 | } | |
495 | ||
496 | static int sk_psock_skb_ingress_enqueue(struct sk_buff *skb, | |
497 | struct sk_psock *psock, | |
498 | struct sock *sk, | |
499 | struct sk_msg *msg) | |
500 | { | |
4363023d | 501 | int num_sge, copied; |
6fa9201a | 502 | |
4363023d JF |
503 | /* skb linearize may fail with ENOMEM, but lets simply try again |
504 | * later if this happens. Under memory pressure we don't want to | |
505 | * drop the skb. We need to linearize the skb so that the mapping | |
506 | * in skb_to_sgvec can not error. | |
507 | */ | |
508 | if (skb_linearize(skb)) | |
509 | return -EAGAIN; | |
510 | num_sge = skb_to_sgvec(skb, msg->sg.data, 0, skb->len); | |
604326b4 DB |
511 | if (unlikely(num_sge < 0)) { |
512 | kfree(msg); | |
513 | return num_sge; | |
514 | } | |
515 | ||
604326b4 DB |
516 | copied = skb->len; |
517 | msg->sg.start = 0; | |
cabede8b | 518 | msg->sg.size = copied; |
031097d9 | 519 | msg->sg.end = num_sge; |
604326b4 DB |
520 | msg->skb = skb; |
521 | ||
522 | sk_psock_queue_msg(psock, msg); | |
552de910 | 523 | sk_psock_data_ready(sk, psock); |
604326b4 DB |
524 | return copied; |
525 | } | |
526 | ||
2443ca66 JF |
527 | static int sk_psock_skb_ingress_self(struct sk_psock *psock, struct sk_buff *skb); |
528 | ||
6fa9201a JF |
529 | static int sk_psock_skb_ingress(struct sk_psock *psock, struct sk_buff *skb) |
530 | { | |
531 | struct sock *sk = psock->sk; | |
532 | struct sk_msg *msg; | |
533 | ||
2443ca66 JF |
534 | /* If we are receiving on the same sock skb->sk is already assigned, |
535 | * skip memory accounting and owner transition seeing it already set | |
536 | * correctly. | |
537 | */ | |
538 | if (unlikely(skb->sk == sk)) | |
539 | return sk_psock_skb_ingress_self(psock, skb); | |
6fa9201a JF |
540 | msg = sk_psock_create_ingress_msg(sk, skb); |
541 | if (!msg) | |
542 | return -EAGAIN; | |
543 | ||
544 | /* This will transition ownership of the data from the socket where | |
545 | * the BPF program was run initiating the redirect to the socket | |
546 | * we will eventually receive this data on. The data will be released | |
547 | * from skb_consume found in __tcp_bpf_recvmsg() after its been copied | |
548 | * into user buffers. | |
549 | */ | |
550 | skb_set_owner_r(skb, sk); | |
551 | return sk_psock_skb_ingress_enqueue(skb, psock, sk, msg); | |
552 | } | |
553 | ||
554 | /* Puts an skb on the ingress queue of the socket already assigned to the | |
555 | * skb. In this case we do not need to check memory limits or skb_set_owner_r | |
556 | * because the skb is already accounted for here. | |
557 | */ | |
558 | static int sk_psock_skb_ingress_self(struct sk_psock *psock, struct sk_buff *skb) | |
559 | { | |
560 | struct sk_msg *msg = kzalloc(sizeof(*msg), __GFP_NOWARN | GFP_ATOMIC); | |
561 | struct sock *sk = psock->sk; | |
562 | ||
563 | if (unlikely(!msg)) | |
564 | return -EAGAIN; | |
565 | sk_msg_init(msg); | |
144748eb | 566 | skb_set_owner_r(skb, sk); |
6fa9201a JF |
567 | return sk_psock_skb_ingress_enqueue(skb, psock, sk, msg); |
568 | } | |
569 | ||
604326b4 DB |
570 | static int sk_psock_handle_skb(struct sk_psock *psock, struct sk_buff *skb, |
571 | u32 off, u32 len, bool ingress) | |
572 | { | |
9047f19e JF |
573 | if (!ingress) { |
574 | if (!sock_writeable(psock->sk)) | |
575 | return -EAGAIN; | |
799aa7f9 | 576 | return skb_send_sock(psock->sk, skb, off, len); |
9047f19e JF |
577 | } |
578 | return sk_psock_skb_ingress(psock, skb); | |
604326b4 DB |
579 | } |
580 | ||
581 | static void sk_psock_backlog(struct work_struct *work) | |
582 | { | |
583 | struct sk_psock *psock = container_of(work, struct sk_psock, work); | |
584 | struct sk_psock_work_state *state = &psock->work_state; | |
585 | struct sk_buff *skb; | |
586 | bool ingress; | |
587 | u32 len, off; | |
588 | int ret; | |
589 | ||
799aa7f9 | 590 | mutex_lock(&psock->work_mutex); |
604326b4 DB |
591 | if (state->skb) { |
592 | skb = state->skb; | |
593 | len = state->len; | |
594 | off = state->off; | |
595 | state->skb = NULL; | |
596 | goto start; | |
597 | } | |
598 | ||
599 | while ((skb = skb_dequeue(&psock->ingress_skb))) { | |
600 | len = skb->len; | |
601 | off = 0; | |
602 | start: | |
e3526bb9 CW |
603 | ingress = skb_bpf_ingress(skb); |
604 | skb_bpf_redirect_clear(skb); | |
604326b4 DB |
605 | do { |
606 | ret = -EIO; | |
799aa7f9 | 607 | if (!sock_flag(psock->sk, SOCK_DEAD)) |
604326b4 DB |
608 | ret = sk_psock_handle_skb(psock, skb, off, |
609 | len, ingress); | |
610 | if (ret <= 0) { | |
611 | if (ret == -EAGAIN) { | |
612 | state->skb = skb; | |
613 | state->len = len; | |
614 | state->off = off; | |
615 | goto end; | |
616 | } | |
617 | /* Hard errors break pipe and stop xmit. */ | |
618 | sk_psock_report_error(psock, ret ? -ret : EPIPE); | |
619 | sk_psock_clear_state(psock, SK_PSOCK_TX_ENABLED); | |
620 | kfree_skb(skb); | |
621 | goto end; | |
622 | } | |
623 | off += ret; | |
624 | len -= ret; | |
625 | } while (len); | |
626 | ||
627 | if (!ingress) | |
628 | kfree_skb(skb); | |
629 | } | |
630 | end: | |
799aa7f9 | 631 | mutex_unlock(&psock->work_mutex); |
604326b4 DB |
632 | } |
633 | ||
634 | struct sk_psock *sk_psock_init(struct sock *sk, int node) | |
635 | { | |
7b219da4 LB |
636 | struct sk_psock *psock; |
637 | struct proto *prot; | |
604326b4 | 638 | |
7b219da4 LB |
639 | write_lock_bh(&sk->sk_callback_lock); |
640 | ||
7b219da4 LB |
641 | if (sk->sk_user_data) { |
642 | psock = ERR_PTR(-EBUSY); | |
643 | goto out; | |
644 | } | |
645 | ||
646 | psock = kzalloc_node(sizeof(*psock), GFP_ATOMIC | __GFP_NOWARN, node); | |
647 | if (!psock) { | |
648 | psock = ERR_PTR(-ENOMEM); | |
649 | goto out; | |
650 | } | |
651 | ||
652 | prot = READ_ONCE(sk->sk_prot); | |
604326b4 | 653 | psock->sk = sk; |
7b219da4 LB |
654 | psock->eval = __SK_NONE; |
655 | psock->sk_proto = prot; | |
656 | psock->saved_unhash = prot->unhash; | |
657 | psock->saved_close = prot->close; | |
658 | psock->saved_write_space = sk->sk_write_space; | |
604326b4 DB |
659 | |
660 | INIT_LIST_HEAD(&psock->link); | |
661 | spin_lock_init(&psock->link_lock); | |
662 | ||
663 | INIT_WORK(&psock->work, sk_psock_backlog); | |
799aa7f9 | 664 | mutex_init(&psock->work_mutex); |
604326b4 | 665 | INIT_LIST_HEAD(&psock->ingress_msg); |
b01fd6e8 | 666 | spin_lock_init(&psock->ingress_lock); |
604326b4 DB |
667 | skb_queue_head_init(&psock->ingress_skb); |
668 | ||
669 | sk_psock_set_state(psock, SK_PSOCK_TX_ENABLED); | |
670 | refcount_set(&psock->refcnt, 1); | |
671 | ||
f1ff5ce2 | 672 | rcu_assign_sk_user_data_nocopy(sk, psock); |
604326b4 DB |
673 | sock_hold(sk); |
674 | ||
7b219da4 LB |
675 | out: |
676 | write_unlock_bh(&sk->sk_callback_lock); | |
604326b4 DB |
677 | return psock; |
678 | } | |
679 | EXPORT_SYMBOL_GPL(sk_psock_init); | |
680 | ||
681 | struct sk_psock_link *sk_psock_link_pop(struct sk_psock *psock) | |
682 | { | |
683 | struct sk_psock_link *link; | |
684 | ||
685 | spin_lock_bh(&psock->link_lock); | |
686 | link = list_first_entry_or_null(&psock->link, struct sk_psock_link, | |
687 | list); | |
688 | if (link) | |
689 | list_del(&link->list); | |
690 | spin_unlock_bh(&psock->link_lock); | |
691 | return link; | |
692 | } | |
693 | ||
cd81cefb | 694 | static void __sk_psock_purge_ingress_msg(struct sk_psock *psock) |
604326b4 DB |
695 | { |
696 | struct sk_msg *msg, *tmp; | |
697 | ||
698 | list_for_each_entry_safe(msg, tmp, &psock->ingress_msg, list) { | |
699 | list_del(&msg->list); | |
700 | sk_msg_free(psock->sk, msg); | |
701 | kfree(msg); | |
702 | } | |
703 | } | |
704 | ||
799aa7f9 | 705 | static void __sk_psock_zap_ingress(struct sk_psock *psock) |
604326b4 | 706 | { |
e3526bb9 CW |
707 | struct sk_buff *skb; |
708 | ||
37f0e514 | 709 | while ((skb = skb_dequeue(&psock->ingress_skb)) != NULL) { |
e3526bb9 CW |
710 | skb_bpf_redirect_clear(skb); |
711 | kfree_skb(skb); | |
712 | } | |
604326b4 DB |
713 | __sk_psock_purge_ingress_msg(psock); |
714 | } | |
715 | ||
716 | static void sk_psock_link_destroy(struct sk_psock *psock) | |
717 | { | |
718 | struct sk_psock_link *link, *tmp; | |
719 | ||
720 | list_for_each_entry_safe(link, tmp, &psock->link, list) { | |
721 | list_del(&link->list); | |
722 | sk_psock_free_link(link); | |
723 | } | |
724 | } | |
725 | ||
799aa7f9 CW |
726 | void sk_psock_stop(struct sk_psock *psock, bool wait) |
727 | { | |
728 | spin_lock_bh(&psock->ingress_lock); | |
729 | sk_psock_clear_state(psock, SK_PSOCK_TX_ENABLED); | |
730 | sk_psock_cork_free(psock); | |
731 | __sk_psock_zap_ingress(psock); | |
732 | spin_unlock_bh(&psock->ingress_lock); | |
733 | ||
734 | if (wait) | |
735 | cancel_work_sync(&psock->work); | |
736 | } | |
737 | ||
88759609 CW |
738 | static void sk_psock_done_strp(struct sk_psock *psock); |
739 | ||
7786dfc4 | 740 | static void sk_psock_destroy(struct work_struct *work) |
604326b4 | 741 | { |
7786dfc4 CW |
742 | struct sk_psock *psock = container_of(to_rcu_work(work), |
743 | struct sk_psock, rwork); | |
604326b4 | 744 | /* No sk_callback_lock since already detached. */ |
01489436 | 745 | |
88759609 | 746 | sk_psock_done_strp(psock); |
604326b4 DB |
747 | |
748 | cancel_work_sync(&psock->work); | |
799aa7f9 | 749 | mutex_destroy(&psock->work_mutex); |
604326b4 DB |
750 | |
751 | psock_progs_drop(&psock->progs); | |
752 | ||
753 | sk_psock_link_destroy(psock); | |
754 | sk_psock_cork_free(psock); | |
604326b4 DB |
755 | |
756 | if (psock->sk_redir) | |
757 | sock_put(psock->sk_redir); | |
758 | sock_put(psock->sk); | |
759 | kfree(psock); | |
760 | } | |
761 | ||
604326b4 DB |
762 | void sk_psock_drop(struct sock *sk, struct sk_psock *psock) |
763 | { | |
799aa7f9 | 764 | sk_psock_stop(psock, false); |
604326b4 DB |
765 | |
766 | write_lock_bh(&sk->sk_callback_lock); | |
95fa1454 JF |
767 | sk_psock_restore_proto(sk, psock); |
768 | rcu_assign_sk_user_data(sk, NULL); | |
ae8b8332 | 769 | if (psock->progs.stream_parser) |
604326b4 | 770 | sk_psock_stop_strp(sk, psock); |
a7ba4558 | 771 | else if (psock->progs.stream_verdict || psock->progs.skb_verdict) |
ef565928 | 772 | sk_psock_stop_verdict(sk, psock); |
604326b4 | 773 | write_unlock_bh(&sk->sk_callback_lock); |
604326b4 | 774 | |
7786dfc4 CW |
775 | INIT_RCU_WORK(&psock->rwork, sk_psock_destroy); |
776 | queue_rcu_work(system_wq, &psock->rwork); | |
604326b4 DB |
777 | } |
778 | EXPORT_SYMBOL_GPL(sk_psock_drop); | |
779 | ||
780 | static int sk_psock_map_verd(int verdict, bool redir) | |
781 | { | |
782 | switch (verdict) { | |
783 | case SK_PASS: | |
784 | return redir ? __SK_REDIRECT : __SK_PASS; | |
785 | case SK_DROP: | |
786 | default: | |
787 | break; | |
788 | } | |
789 | ||
790 | return __SK_DROP; | |
791 | } | |
792 | ||
793 | int sk_psock_msg_verdict(struct sock *sk, struct sk_psock *psock, | |
794 | struct sk_msg *msg) | |
795 | { | |
796 | struct bpf_prog *prog; | |
797 | int ret; | |
798 | ||
604326b4 DB |
799 | rcu_read_lock(); |
800 | prog = READ_ONCE(psock->progs.msg_parser); | |
801 | if (unlikely(!prog)) { | |
802 | ret = __SK_PASS; | |
803 | goto out; | |
804 | } | |
805 | ||
806 | sk_msg_compute_data_pointers(msg); | |
807 | msg->sk = sk; | |
3d9f773c | 808 | ret = bpf_prog_run_pin_on_cpu(prog, msg); |
604326b4 DB |
809 | ret = sk_psock_map_verd(ret, msg->sk_redir); |
810 | psock->apply_bytes = msg->apply_bytes; | |
811 | if (ret == __SK_REDIRECT) { | |
812 | if (psock->sk_redir) | |
813 | sock_put(psock->sk_redir); | |
814 | psock->sk_redir = msg->sk_redir; | |
815 | if (!psock->sk_redir) { | |
816 | ret = __SK_DROP; | |
817 | goto out; | |
818 | } | |
819 | sock_hold(psock->sk_redir); | |
820 | } | |
821 | out: | |
822 | rcu_read_unlock(); | |
604326b4 DB |
823 | return ret; |
824 | } | |
825 | EXPORT_SYMBOL_GPL(sk_psock_msg_verdict); | |
826 | ||
93dd5f18 | 827 | static void sk_psock_skb_redirect(struct sk_buff *skb) |
604326b4 DB |
828 | { |
829 | struct sk_psock *psock_other; | |
830 | struct sock *sk_other; | |
604326b4 | 831 | |
e3526bb9 | 832 | sk_other = skb_bpf_redirect_fetch(skb); |
9047f19e JF |
833 | /* This error is a buggy BPF program, it returned a redirect |
834 | * return code, but then didn't set a redirect interface. | |
835 | */ | |
ca2f5f21 JF |
836 | if (unlikely(!sk_other)) { |
837 | kfree_skb(skb); | |
838 | return; | |
839 | } | |
840 | psock_other = sk_psock(sk_other); | |
9047f19e JF |
841 | /* This error indicates the socket is being torn down or had another |
842 | * error that caused the pipe to break. We can't send a packet on | |
843 | * a socket that is in this state so we drop the skb. | |
844 | */ | |
799aa7f9 | 845 | if (!psock_other || sock_flag(sk_other, SOCK_DEAD)) { |
30b9c54a | 846 | skb_bpf_redirect_clear(skb); |
799aa7f9 CW |
847 | kfree_skb(skb); |
848 | return; | |
849 | } | |
850 | spin_lock_bh(&psock_other->ingress_lock); | |
851 | if (!sk_psock_test_state(psock_other, SK_PSOCK_TX_ENABLED)) { | |
852 | spin_unlock_bh(&psock_other->ingress_lock); | |
30b9c54a | 853 | skb_bpf_redirect_clear(skb); |
ca2f5f21 JF |
854 | kfree_skb(skb); |
855 | return; | |
856 | } | |
857 | ||
9047f19e JF |
858 | skb_queue_tail(&psock_other->ingress_skb, skb); |
859 | schedule_work(&psock_other->work); | |
799aa7f9 | 860 | spin_unlock_bh(&psock_other->ingress_lock); |
ca2f5f21 JF |
861 | } |
862 | ||
0b17ad25 | 863 | static void sk_psock_tls_verdict_apply(struct sk_buff *skb, struct sock *sk, int verdict) |
e91de6af JF |
864 | { |
865 | switch (verdict) { | |
866 | case __SK_REDIRECT: | |
93dd5f18 | 867 | sk_psock_skb_redirect(skb); |
e91de6af JF |
868 | break; |
869 | case __SK_PASS: | |
870 | case __SK_DROP: | |
871 | default: | |
872 | break; | |
873 | } | |
874 | } | |
875 | ||
876 | int sk_psock_tls_strp_read(struct sk_psock *psock, struct sk_buff *skb) | |
877 | { | |
878 | struct bpf_prog *prog; | |
879 | int ret = __SK_PASS; | |
880 | ||
881 | rcu_read_lock(); | |
ae8b8332 | 882 | prog = READ_ONCE(psock->progs.stream_verdict); |
e91de6af | 883 | if (likely(prog)) { |
0b17ad25 | 884 | skb->sk = psock->sk; |
e3526bb9 CW |
885 | skb_dst_drop(skb); |
886 | skb_bpf_redirect_clear(skb); | |
53334232 | 887 | ret = bpf_prog_run_pin_on_cpu(prog, skb); |
e3526bb9 | 888 | ret = sk_psock_map_verd(ret, skb_bpf_redirect_fetch(skb)); |
0b17ad25 | 889 | skb->sk = NULL; |
e91de6af | 890 | } |
0b17ad25 | 891 | sk_psock_tls_verdict_apply(skb, psock->sk, ret); |
e91de6af | 892 | rcu_read_unlock(); |
e91de6af JF |
893 | return ret; |
894 | } | |
895 | EXPORT_SYMBOL_GPL(sk_psock_tls_strp_read); | |
896 | ||
ca2f5f21 JF |
897 | static void sk_psock_verdict_apply(struct sk_psock *psock, |
898 | struct sk_buff *skb, int verdict) | |
899 | { | |
900 | struct sock *sk_other; | |
9ecbfb06 | 901 | int err = -EIO; |
ca2f5f21 | 902 | |
604326b4 | 903 | switch (verdict) { |
51199405 JF |
904 | case __SK_PASS: |
905 | sk_other = psock->sk; | |
906 | if (sock_flag(sk_other, SOCK_DEAD) || | |
907 | !sk_psock_test_state(psock, SK_PSOCK_TX_ENABLED)) { | |
908 | goto out_free; | |
909 | } | |
51199405 | 910 | |
e3526bb9 | 911 | skb_bpf_set_ingress(skb); |
9ecbfb06 JF |
912 | |
913 | /* If the queue is empty then we can submit directly | |
914 | * into the msg queue. If its not empty we have to | |
915 | * queue work otherwise we may get OOO data. Otherwise, | |
916 | * if sk_psock_skb_ingress errors will be handled by | |
917 | * retrying later from workqueue. | |
918 | */ | |
919 | if (skb_queue_empty(&psock->ingress_skb)) { | |
6fa9201a | 920 | err = sk_psock_skb_ingress_self(psock, skb); |
9ecbfb06 JF |
921 | } |
922 | if (err < 0) { | |
799aa7f9 CW |
923 | spin_lock_bh(&psock->ingress_lock); |
924 | if (sk_psock_test_state(psock, SK_PSOCK_TX_ENABLED)) { | |
925 | skb_queue_tail(&psock->ingress_skb, skb); | |
926 | schedule_work(&psock->work); | |
0cf6672b | 927 | err = 0; |
799aa7f9 CW |
928 | } |
929 | spin_unlock_bh(&psock->ingress_lock); | |
0cf6672b CW |
930 | if (err < 0) { |
931 | skb_bpf_redirect_clear(skb); | |
932 | goto out_free; | |
933 | } | |
9ecbfb06 | 934 | } |
cfea28f8 | 935 | break; |
604326b4 | 936 | case __SK_REDIRECT: |
93dd5f18 | 937 | sk_psock_skb_redirect(skb); |
ca2f5f21 | 938 | break; |
604326b4 | 939 | case __SK_DROP: |
604326b4 DB |
940 | default: |
941 | out_free: | |
942 | kfree_skb(skb); | |
943 | } | |
944 | } | |
945 | ||
88759609 CW |
946 | static void sk_psock_write_space(struct sock *sk) |
947 | { | |
948 | struct sk_psock *psock; | |
949 | void (*write_space)(struct sock *sk) = NULL; | |
950 | ||
951 | rcu_read_lock(); | |
952 | psock = sk_psock(sk); | |
953 | if (likely(psock)) { | |
954 | if (sk_psock_test_state(psock, SK_PSOCK_TX_ENABLED)) | |
955 | schedule_work(&psock->work); | |
956 | write_space = psock->saved_write_space; | |
957 | } | |
958 | rcu_read_unlock(); | |
959 | if (write_space) | |
960 | write_space(sk); | |
961 | } | |
962 | ||
963 | #if IS_ENABLED(CONFIG_BPF_STREAM_PARSER) | |
604326b4 DB |
964 | static void sk_psock_strp_read(struct strparser *strp, struct sk_buff *skb) |
965 | { | |
8025751d | 966 | struct sk_psock *psock; |
604326b4 DB |
967 | struct bpf_prog *prog; |
968 | int ret = __SK_DROP; | |
8025751d | 969 | struct sock *sk; |
604326b4 DB |
970 | |
971 | rcu_read_lock(); | |
8025751d JF |
972 | sk = strp->sk; |
973 | psock = sk_psock(sk); | |
974 | if (unlikely(!psock)) { | |
975 | kfree_skb(skb); | |
976 | goto out; | |
977 | } | |
ae8b8332 | 978 | prog = READ_ONCE(psock->progs.stream_verdict); |
604326b4 | 979 | if (likely(prog)) { |
144748eb | 980 | skb->sk = sk; |
e3526bb9 CW |
981 | skb_dst_drop(skb); |
982 | skb_bpf_redirect_clear(skb); | |
53334232 | 983 | ret = bpf_prog_run_pin_on_cpu(prog, skb); |
e3526bb9 | 984 | ret = sk_psock_map_verd(ret, skb_bpf_redirect_fetch(skb)); |
144748eb | 985 | skb->sk = NULL; |
604326b4 | 986 | } |
604326b4 | 987 | sk_psock_verdict_apply(psock, skb, ret); |
8025751d | 988 | out: |
93dd5f18 | 989 | rcu_read_unlock(); |
604326b4 DB |
990 | } |
991 | ||
992 | static int sk_psock_strp_read_done(struct strparser *strp, int err) | |
993 | { | |
994 | return err; | |
995 | } | |
996 | ||
997 | static int sk_psock_strp_parse(struct strparser *strp, struct sk_buff *skb) | |
998 | { | |
5a685cd9 | 999 | struct sk_psock *psock = container_of(strp, struct sk_psock, strp); |
604326b4 DB |
1000 | struct bpf_prog *prog; |
1001 | int ret = skb->len; | |
1002 | ||
1003 | rcu_read_lock(); | |
ae8b8332 | 1004 | prog = READ_ONCE(psock->progs.stream_parser); |
0b17ad25 JF |
1005 | if (likely(prog)) { |
1006 | skb->sk = psock->sk; | |
53334232 | 1007 | ret = bpf_prog_run_pin_on_cpu(prog, skb); |
0b17ad25 JF |
1008 | skb->sk = NULL; |
1009 | } | |
604326b4 DB |
1010 | rcu_read_unlock(); |
1011 | return ret; | |
1012 | } | |
1013 | ||
1014 | /* Called with socket lock held. */ | |
552de910 | 1015 | static void sk_psock_strp_data_ready(struct sock *sk) |
604326b4 DB |
1016 | { |
1017 | struct sk_psock *psock; | |
1018 | ||
1019 | rcu_read_lock(); | |
1020 | psock = sk_psock(sk); | |
1021 | if (likely(psock)) { | |
e91de6af | 1022 | if (tls_sw_has_ctx_rx(sk)) { |
5a685cd9 | 1023 | psock->saved_data_ready(sk); |
e91de6af JF |
1024 | } else { |
1025 | write_lock_bh(&sk->sk_callback_lock); | |
5a685cd9 | 1026 | strp_data_ready(&psock->strp); |
e91de6af JF |
1027 | write_unlock_bh(&sk->sk_callback_lock); |
1028 | } | |
604326b4 DB |
1029 | } |
1030 | rcu_read_unlock(); | |
1031 | } | |
1032 | ||
88759609 CW |
1033 | int sk_psock_init_strp(struct sock *sk, struct sk_psock *psock) |
1034 | { | |
1035 | static const struct strp_callbacks cb = { | |
1036 | .rcv_msg = sk_psock_strp_read, | |
1037 | .read_sock_done = sk_psock_strp_read_done, | |
1038 | .parse_msg = sk_psock_strp_parse, | |
1039 | }; | |
1040 | ||
5a685cd9 | 1041 | return strp_init(&psock->strp, sk, &cb); |
88759609 CW |
1042 | } |
1043 | ||
1044 | void sk_psock_start_strp(struct sock *sk, struct sk_psock *psock) | |
1045 | { | |
5a685cd9 | 1046 | if (psock->saved_data_ready) |
88759609 CW |
1047 | return; |
1048 | ||
5a685cd9 | 1049 | psock->saved_data_ready = sk->sk_data_ready; |
88759609 CW |
1050 | sk->sk_data_ready = sk_psock_strp_data_ready; |
1051 | sk->sk_write_space = sk_psock_write_space; | |
88759609 CW |
1052 | } |
1053 | ||
1054 | void sk_psock_stop_strp(struct sock *sk, struct sk_psock *psock) | |
1055 | { | |
5a685cd9 | 1056 | if (!psock->saved_data_ready) |
88759609 CW |
1057 | return; |
1058 | ||
5a685cd9 CW |
1059 | sk->sk_data_ready = psock->saved_data_ready; |
1060 | psock->saved_data_ready = NULL; | |
1061 | strp_stop(&psock->strp); | |
88759609 CW |
1062 | } |
1063 | ||
1064 | static void sk_psock_done_strp(struct sk_psock *psock) | |
1065 | { | |
1066 | /* Parser has been stopped */ | |
ae8b8332 | 1067 | if (psock->progs.stream_parser) |
5a685cd9 | 1068 | strp_done(&psock->strp); |
88759609 CW |
1069 | } |
1070 | #else | |
1071 | static void sk_psock_done_strp(struct sk_psock *psock) | |
1072 | { | |
1073 | } | |
1074 | #endif /* CONFIG_BPF_STREAM_PARSER */ | |
1075 | ||
ef565928 JF |
1076 | static int sk_psock_verdict_recv(read_descriptor_t *desc, struct sk_buff *skb, |
1077 | unsigned int offset, size_t orig_len) | |
1078 | { | |
1079 | struct sock *sk = (struct sock *)desc->arg.data; | |
1080 | struct sk_psock *psock; | |
1081 | struct bpf_prog *prog; | |
1082 | int ret = __SK_DROP; | |
1083 | int len = skb->len; | |
1084 | ||
1085 | /* clone here so sk_eat_skb() in tcp_read_sock does not drop our data */ | |
1086 | skb = skb_clone(skb, GFP_ATOMIC); | |
1087 | if (!skb) { | |
1088 | desc->error = -ENOMEM; | |
1089 | return 0; | |
1090 | } | |
1091 | ||
1092 | rcu_read_lock(); | |
1093 | psock = sk_psock(sk); | |
1094 | if (unlikely(!psock)) { | |
1095 | len = 0; | |
1096 | kfree_skb(skb); | |
1097 | goto out; | |
1098 | } | |
ae8b8332 | 1099 | prog = READ_ONCE(psock->progs.stream_verdict); |
a7ba4558 CW |
1100 | if (!prog) |
1101 | prog = READ_ONCE(psock->progs.skb_verdict); | |
ef565928 | 1102 | if (likely(prog)) { |
144748eb | 1103 | skb->sk = sk; |
e3526bb9 CW |
1104 | skb_dst_drop(skb); |
1105 | skb_bpf_redirect_clear(skb); | |
53334232 | 1106 | ret = bpf_prog_run_pin_on_cpu(prog, skb); |
e3526bb9 | 1107 | ret = sk_psock_map_verd(ret, skb_bpf_redirect_fetch(skb)); |
144748eb | 1108 | skb->sk = NULL; |
ef565928 JF |
1109 | } |
1110 | sk_psock_verdict_apply(psock, skb, ret); | |
1111 | out: | |
1112 | rcu_read_unlock(); | |
1113 | return len; | |
1114 | } | |
1115 | ||
1116 | static void sk_psock_verdict_data_ready(struct sock *sk) | |
1117 | { | |
1118 | struct socket *sock = sk->sk_socket; | |
1119 | read_descriptor_t desc; | |
1120 | ||
1121 | if (unlikely(!sock || !sock->ops || !sock->ops->read_sock)) | |
1122 | return; | |
1123 | ||
1124 | desc.arg.data = sk; | |
1125 | desc.error = 0; | |
1126 | desc.count = 1; | |
1127 | ||
1128 | sock->ops->read_sock(sk, &desc, sk_psock_verdict_recv); | |
1129 | } | |
1130 | ||
ef565928 JF |
1131 | void sk_psock_start_verdict(struct sock *sk, struct sk_psock *psock) |
1132 | { | |
5a685cd9 | 1133 | if (psock->saved_data_ready) |
ef565928 JF |
1134 | return; |
1135 | ||
5a685cd9 | 1136 | psock->saved_data_ready = sk->sk_data_ready; |
ef565928 JF |
1137 | sk->sk_data_ready = sk_psock_verdict_data_ready; |
1138 | sk->sk_write_space = sk_psock_write_space; | |
ef565928 JF |
1139 | } |
1140 | ||
ef565928 JF |
1141 | void sk_psock_stop_verdict(struct sock *sk, struct sk_psock *psock) |
1142 | { | |
5a685cd9 | 1143 | if (!psock->saved_data_ready) |
ef565928 JF |
1144 | return; |
1145 | ||
5a685cd9 CW |
1146 | sk->sk_data_ready = psock->saved_data_ready; |
1147 | psock->saved_data_ready = NULL; | |
ef565928 | 1148 | } |