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