1 /* SPDX-License-Identifier: GPL-2.0 */
2 /* Copyright (c) 2017 - 2018 Covalent IO, Inc. http://covalent.io */
3
4 #ifndef _LINUX_SKMSG_H
5 #define _LINUX_SKMSG_H
6
7 #include <linux/bpf.h>
8 #include <linux/filter.h>
9 #include <linux/scatterlist.h>
10 #include <linux/skbuff.h>
11
12 #include <net/sock.h>
13 #include <net/tcp.h>
14 #include <net/strparser.h>
15
16 #define MAX_MSG_FRAGS MAX_SKB_FRAGS
17 #define NR_MSG_FRAG_IDS (MAX_MSG_FRAGS + 1)
18
19 enum __sk_action {
20 __SK_DROP = 0,
21 __SK_PASS,
22 __SK_REDIRECT,
23 __SK_NONE,
24 };
25
26 struct sk_msg_sg {
27 u32 start;
28 u32 curr;
29 u32 end;
30 u32 size;
31 u32 copybreak;
32 unsigned long copy;
33 /* The extra two elements:
34 * 1) used for chaining the front and sections when the list becomes
35 * partitioned (e.g. end < start). The crypto APIs require the
36 * chaining;
37 * 2) to chain tailer SG entries after the message.
38 */
39 struct scatterlist data[MAX_MSG_FRAGS + 2];
40 };
41 static_assert(BITS_PER_LONG >= NR_MSG_FRAG_IDS);
42
43 /* UAPI in filter.c depends on struct sk_msg_sg being first element. */
44 struct sk_msg {
45 struct sk_msg_sg sg;
46 void *data;
47 void *data_end;
48 u32 apply_bytes;
49 u32 cork_bytes;
50 u32 flags;
51 struct sk_buff *skb;
52 struct sock *sk_redir;
53 struct sock *sk;
54 struct list_head list;
55 };
56
57 struct sk_psock_progs {
58 struct bpf_prog *msg_parser;
59 struct bpf_prog *skb_parser;
60 struct bpf_prog *skb_verdict;
61 };
62
63 enum sk_psock_state_bits {
64 SK_PSOCK_TX_ENABLED,
65 };
66
67 struct sk_psock_link {
68 struct list_head list;
69 struct bpf_map *map;
70 void *link_raw;
71 };
72
73 struct sk_psock_parser {
74 struct strparser strp;
75 bool enabled;
76 void (*saved_data_ready)(struct sock *sk);
77 };
78
79 struct sk_psock_work_state {
80 struct sk_buff *skb;
81 u32 len;
82 u32 off;
83 };
84
85 struct sk_psock {
86 struct sock *sk;
87 struct sock *sk_redir;
88 u32 apply_bytes;
89 u32 cork_bytes;
90 u32 eval;
91 struct sk_msg *cork;
92 struct sk_psock_progs progs;
93 struct sk_psock_parser parser;
94 struct sk_buff_head ingress_skb;
95 struct list_head ingress_msg;
96 unsigned long state;
97 struct list_head link;
98 spinlock_t link_lock;
99 refcount_t refcnt;
100 void (*saved_unhash)(struct sock *sk);
101 void (*saved_close)(struct sock *sk, long timeout);
102 void (*saved_write_space)(struct sock *sk);
103 struct proto *sk_proto;
104 struct sk_psock_work_state work_state;
105 struct work_struct work;
106 union {
107 struct rcu_head rcu;
108 struct work_struct gc;
109 };
110 };
111
112 int sk_msg_alloc(struct sock *sk, struct sk_msg *msg, int len,
113 int elem_first_coalesce);
114 int sk_msg_clone(struct sock *sk, struct sk_msg *dst, struct sk_msg *src,
115 u32 off, u32 len);
116 void sk_msg_trim(struct sock *sk, struct sk_msg *msg, int len);
117 int sk_msg_free(struct sock *sk, struct sk_msg *msg);
118 int sk_msg_free_nocharge(struct sock *sk, struct sk_msg *msg);
119 void sk_msg_free_partial(struct sock *sk, struct sk_msg *msg, u32 bytes);
120 void sk_msg_free_partial_nocharge(struct sock *sk, struct sk_msg *msg,
121 u32 bytes);
122
123 void sk_msg_return(struct sock *sk, struct sk_msg *msg, int bytes);
124 void sk_msg_return_zero(struct sock *sk, struct sk_msg *msg, int bytes);
125
126 int sk_msg_zerocopy_from_iter(struct sock *sk, struct iov_iter *from,
127 struct sk_msg *msg, u32 bytes);
128 int sk_msg_memcopy_from_iter(struct sock *sk, struct iov_iter *from,
129 struct sk_msg *msg, u32 bytes);
130
sk_msg_check_to_free(struct sk_msg * msg,u32 i,u32 bytes)131 static inline void sk_msg_check_to_free(struct sk_msg *msg, u32 i, u32 bytes)
132 {
133 WARN_ON(i == msg->sg.end && bytes);
134 }
135
sk_msg_apply_bytes(struct sk_psock * psock,u32 bytes)136 static inline void sk_msg_apply_bytes(struct sk_psock *psock, u32 bytes)
137 {
138 if (psock->apply_bytes) {
139 if (psock->apply_bytes < bytes)
140 psock->apply_bytes = 0;
141 else
142 psock->apply_bytes -= bytes;
143 }
144 }
145
sk_msg_iter_dist(u32 start,u32 end)146 static inline u32 sk_msg_iter_dist(u32 start, u32 end)
147 {
148 return end >= start ? end - start : end + (NR_MSG_FRAG_IDS - start);
149 }
150
151 #define sk_msg_iter_var_prev(var) \
152 do { \
153 if (var == 0) \
154 var = NR_MSG_FRAG_IDS - 1; \
155 else \
156 var--; \
157 } while (0)
158
159 #define sk_msg_iter_var_next(var) \
160 do { \
161 var++; \
162 if (var == NR_MSG_FRAG_IDS) \
163 var = 0; \
164 } while (0)
165
166 #define sk_msg_iter_prev(msg, which) \
167 sk_msg_iter_var_prev(msg->sg.which)
168
169 #define sk_msg_iter_next(msg, which) \
170 sk_msg_iter_var_next(msg->sg.which)
171
sk_msg_clear_meta(struct sk_msg * msg)172 static inline void sk_msg_clear_meta(struct sk_msg *msg)
173 {
174 memset(&msg->sg, 0, offsetofend(struct sk_msg_sg, copy));
175 }
176
sk_msg_init(struct sk_msg * msg)177 static inline void sk_msg_init(struct sk_msg *msg)
178 {
179 BUILD_BUG_ON(ARRAY_SIZE(msg->sg.data) - 1 != NR_MSG_FRAG_IDS);
180 memset(msg, 0, sizeof(*msg));
181 sg_init_marker(msg->sg.data, NR_MSG_FRAG_IDS);
182 }
183
sk_msg_xfer(struct sk_msg * dst,struct sk_msg * src,int which,u32 size)184 static inline void sk_msg_xfer(struct sk_msg *dst, struct sk_msg *src,
185 int which, u32 size)
186 {
187 dst->sg.data[which] = src->sg.data[which];
188 dst->sg.data[which].length = size;
189 dst->sg.size += size;
190 src->sg.size -= size;
191 src->sg.data[which].length -= size;
192 src->sg.data[which].offset += size;
193 }
194
sk_msg_xfer_full(struct sk_msg * dst,struct sk_msg * src)195 static inline void sk_msg_xfer_full(struct sk_msg *dst, struct sk_msg *src)
196 {
197 memcpy(dst, src, sizeof(*src));
198 sk_msg_init(src);
199 }
200
sk_msg_full(const struct sk_msg * msg)201 static inline bool sk_msg_full(const struct sk_msg *msg)
202 {
203 return sk_msg_iter_dist(msg->sg.start, msg->sg.end) == MAX_MSG_FRAGS;
204 }
205
sk_msg_elem_used(const struct sk_msg * msg)206 static inline u32 sk_msg_elem_used(const struct sk_msg *msg)
207 {
208 return sk_msg_iter_dist(msg->sg.start, msg->sg.end);
209 }
210
sk_msg_elem(struct sk_msg * msg,int which)211 static inline struct scatterlist *sk_msg_elem(struct sk_msg *msg, int which)
212 {
213 return &msg->sg.data[which];
214 }
215
sk_msg_elem_cpy(struct sk_msg * msg,int which)216 static inline struct scatterlist sk_msg_elem_cpy(struct sk_msg *msg, int which)
217 {
218 return msg->sg.data[which];
219 }
220
sk_msg_page(struct sk_msg * msg,int which)221 static inline struct page *sk_msg_page(struct sk_msg *msg, int which)
222 {
223 return sg_page(sk_msg_elem(msg, which));
224 }
225
sk_msg_to_ingress(const struct sk_msg * msg)226 static inline bool sk_msg_to_ingress(const struct sk_msg *msg)
227 {
228 return msg->flags & BPF_F_INGRESS;
229 }
230
sk_msg_compute_data_pointers(struct sk_msg * msg)231 static inline void sk_msg_compute_data_pointers(struct sk_msg *msg)
232 {
233 struct scatterlist *sge = sk_msg_elem(msg, msg->sg.start);
234
235 if (test_bit(msg->sg.start, &msg->sg.copy)) {
236 msg->data = NULL;
237 msg->data_end = NULL;
238 } else {
239 msg->data = sg_virt(sge);
240 msg->data_end = msg->data + sge->length;
241 }
242 }
243
sk_msg_page_add(struct sk_msg * msg,struct page * page,u32 len,u32 offset)244 static inline void sk_msg_page_add(struct sk_msg *msg, struct page *page,
245 u32 len, u32 offset)
246 {
247 struct scatterlist *sge;
248
249 get_page(page);
250 sge = sk_msg_elem(msg, msg->sg.end);
251 sg_set_page(sge, page, len, offset);
252 sg_unmark_end(sge);
253
254 __set_bit(msg->sg.end, &msg->sg.copy);
255 msg->sg.size += len;
256 sk_msg_iter_next(msg, end);
257 }
258
sk_msg_sg_copy(struct sk_msg * msg,u32 i,bool copy_state)259 static inline void sk_msg_sg_copy(struct sk_msg *msg, u32 i, bool copy_state)
260 {
261 do {
262 if (copy_state)
263 __set_bit(i, &msg->sg.copy);
264 else
265 __clear_bit(i, &msg->sg.copy);
266 sk_msg_iter_var_next(i);
267 if (i == msg->sg.end)
268 break;
269 } while (1);
270 }
271
sk_msg_sg_copy_set(struct sk_msg * msg,u32 start)272 static inline void sk_msg_sg_copy_set(struct sk_msg *msg, u32 start)
273 {
274 sk_msg_sg_copy(msg, start, true);
275 }
276
sk_msg_sg_copy_clear(struct sk_msg * msg,u32 start)277 static inline void sk_msg_sg_copy_clear(struct sk_msg *msg, u32 start)
278 {
279 sk_msg_sg_copy(msg, start, false);
280 }
281
sk_psock(const struct sock * sk)282 static inline struct sk_psock *sk_psock(const struct sock *sk)
283 {
284 return __rcu_dereference_sk_user_data_with_flags(sk,
285 SK_USER_DATA_PSOCK);
286 }
287
sk_psock_queue_msg(struct sk_psock * psock,struct sk_msg * msg)288 static inline void sk_psock_queue_msg(struct sk_psock *psock,
289 struct sk_msg *msg)
290 {
291 list_add_tail(&msg->list, &psock->ingress_msg);
292 }
293
sk_psock_queue_empty(const struct sk_psock * psock)294 static inline bool sk_psock_queue_empty(const struct sk_psock *psock)
295 {
296 return psock ? list_empty(&psock->ingress_msg) : true;
297 }
298
sk_psock_report_error(struct sk_psock * psock,int err)299 static inline void sk_psock_report_error(struct sk_psock *psock, int err)
300 {
301 struct sock *sk = psock->sk;
302
303 sk->sk_err = err;
304 sk->sk_error_report(sk);
305 }
306
307 struct sk_psock *sk_psock_init(struct sock *sk, int node);
308
309 int sk_psock_init_strp(struct sock *sk, struct sk_psock *psock);
310 void sk_psock_start_strp(struct sock *sk, struct sk_psock *psock);
311 void sk_psock_stop_strp(struct sock *sk, struct sk_psock *psock);
312 void sk_psock_start_verdict(struct sock *sk, struct sk_psock *psock);
313 void sk_psock_stop_verdict(struct sock *sk, struct sk_psock *psock);
314
315 int sk_psock_msg_verdict(struct sock *sk, struct sk_psock *psock,
316 struct sk_msg *msg);
317
sk_psock_init_link(void)318 static inline struct sk_psock_link *sk_psock_init_link(void)
319 {
320 return kzalloc(sizeof(struct sk_psock_link),
321 GFP_ATOMIC | __GFP_NOWARN);
322 }
323
sk_psock_free_link(struct sk_psock_link * link)324 static inline void sk_psock_free_link(struct sk_psock_link *link)
325 {
326 kfree(link);
327 }
328
329 struct sk_psock_link *sk_psock_link_pop(struct sk_psock *psock);
330
331 void __sk_psock_purge_ingress_msg(struct sk_psock *psock);
332
sk_psock_cork_free(struct sk_psock * psock)333 static inline void sk_psock_cork_free(struct sk_psock *psock)
334 {
335 if (psock->cork) {
336 sk_msg_free(psock->sk, psock->cork);
337 kfree(psock->cork);
338 psock->cork = NULL;
339 }
340 }
341
sk_psock_update_proto(struct sock * sk,struct sk_psock * psock,struct proto * ops)342 static inline void sk_psock_update_proto(struct sock *sk,
343 struct sk_psock *psock,
344 struct proto *ops)
345 {
346 /* Pairs with lockless read in sk_clone_lock() */
347 WRITE_ONCE(sk->sk_prot, ops);
348 }
349
sk_psock_restore_proto(struct sock * sk,struct sk_psock * psock)350 static inline void sk_psock_restore_proto(struct sock *sk,
351 struct sk_psock *psock)
352 {
353 if (inet_csk_has_ulp(sk)) {
354 /* TLS does not have an unhash proto in SW cases, but we need
355 * to ensure we stop using the sock_map unhash routine because
356 * the associated psock is being removed. So use the original
357 * unhash handler.
358 */
359 WRITE_ONCE(sk->sk_prot->unhash, psock->saved_unhash);
360 tcp_update_ulp(sk, psock->sk_proto, psock->saved_write_space);
361 } else {
362 sk->sk_write_space = psock->saved_write_space;
363 /* Pairs with lockless read in sk_clone_lock() */
364 WRITE_ONCE(sk->sk_prot, psock->sk_proto);
365 }
366 }
367
sk_psock_set_state(struct sk_psock * psock,enum sk_psock_state_bits bit)368 static inline void sk_psock_set_state(struct sk_psock *psock,
369 enum sk_psock_state_bits bit)
370 {
371 set_bit(bit, &psock->state);
372 }
373
sk_psock_clear_state(struct sk_psock * psock,enum sk_psock_state_bits bit)374 static inline void sk_psock_clear_state(struct sk_psock *psock,
375 enum sk_psock_state_bits bit)
376 {
377 clear_bit(bit, &psock->state);
378 }
379
sk_psock_test_state(const struct sk_psock * psock,enum sk_psock_state_bits bit)380 static inline bool sk_psock_test_state(const struct sk_psock *psock,
381 enum sk_psock_state_bits bit)
382 {
383 return test_bit(bit, &psock->state);
384 }
385
sk_psock_get(struct sock * sk)386 static inline struct sk_psock *sk_psock_get(struct sock *sk)
387 {
388 struct sk_psock *psock;
389
390 rcu_read_lock();
391 psock = sk_psock(sk);
392 if (psock && !refcount_inc_not_zero(&psock->refcnt))
393 psock = NULL;
394 rcu_read_unlock();
395 return psock;
396 }
397
398 void sk_psock_stop(struct sock *sk, struct sk_psock *psock);
399 void sk_psock_drop(struct sock *sk, struct sk_psock *psock);
400
sk_psock_put(struct sock * sk,struct sk_psock * psock)401 static inline void sk_psock_put(struct sock *sk, struct sk_psock *psock)
402 {
403 if (refcount_dec_and_test(&psock->refcnt))
404 sk_psock_drop(sk, psock);
405 }
406
sk_psock_data_ready(struct sock * sk,struct sk_psock * psock)407 static inline void sk_psock_data_ready(struct sock *sk, struct sk_psock *psock)
408 {
409 if (psock->parser.enabled)
410 psock->parser.saved_data_ready(sk);
411 else
412 sk->sk_data_ready(sk);
413 }
414
psock_set_prog(struct bpf_prog ** pprog,struct bpf_prog * prog)415 static inline void psock_set_prog(struct bpf_prog **pprog,
416 struct bpf_prog *prog)
417 {
418 prog = xchg(pprog, prog);
419 if (prog)
420 bpf_prog_put(prog);
421 }
422
psock_replace_prog(struct bpf_prog ** pprog,struct bpf_prog * prog,struct bpf_prog * old)423 static inline int psock_replace_prog(struct bpf_prog **pprog,
424 struct bpf_prog *prog,
425 struct bpf_prog *old)
426 {
427 if (cmpxchg(pprog, old, prog) != old)
428 return -ENOENT;
429
430 if (old)
431 bpf_prog_put(old);
432
433 return 0;
434 }
435
psock_progs_drop(struct sk_psock_progs * progs)436 static inline void psock_progs_drop(struct sk_psock_progs *progs)
437 {
438 psock_set_prog(&progs->msg_parser, NULL);
439 psock_set_prog(&progs->skb_parser, NULL);
440 psock_set_prog(&progs->skb_verdict, NULL);
441 }
442
443 int sk_psock_tls_strp_read(struct sk_psock *psock, struct sk_buff *skb);
444
sk_psock_strp_enabled(struct sk_psock * psock)445 static inline bool sk_psock_strp_enabled(struct sk_psock *psock)
446 {
447 if (!psock)
448 return false;
449 return psock->parser.enabled;
450 }
451 #endif /* _LINUX_SKMSG_H */
452