at v5.10-rc2 11 kB view raw
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 19enum __sk_action { 20 __SK_DROP = 0, 21 __SK_PASS, 22 __SK_REDIRECT, 23 __SK_NONE, 24}; 25 26struct 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}; 41static_assert(BITS_PER_LONG >= NR_MSG_FRAG_IDS); 42 43/* UAPI in filter.c depends on struct sk_msg_sg being first element. */ 44struct 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 57struct sk_psock_progs { 58 struct bpf_prog *msg_parser; 59 struct bpf_prog *skb_parser; 60 struct bpf_prog *skb_verdict; 61}; 62 63enum sk_psock_state_bits { 64 SK_PSOCK_TX_ENABLED, 65}; 66 67struct sk_psock_link { 68 struct list_head list; 69 struct bpf_map *map; 70 void *link_raw; 71}; 72 73struct sk_psock_parser { 74 struct strparser strp; 75 bool enabled; 76 void (*saved_data_ready)(struct sock *sk); 77}; 78 79struct sk_psock_work_state { 80 struct sk_buff *skb; 81 u32 len; 82 u32 off; 83}; 84 85struct 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 112int sk_msg_alloc(struct sock *sk, struct sk_msg *msg, int len, 113 int elem_first_coalesce); 114int sk_msg_clone(struct sock *sk, struct sk_msg *dst, struct sk_msg *src, 115 u32 off, u32 len); 116void sk_msg_trim(struct sock *sk, struct sk_msg *msg, int len); 117int sk_msg_free(struct sock *sk, struct sk_msg *msg); 118int sk_msg_free_nocharge(struct sock *sk, struct sk_msg *msg); 119void sk_msg_free_partial(struct sock *sk, struct sk_msg *msg, u32 bytes); 120void sk_msg_free_partial_nocharge(struct sock *sk, struct sk_msg *msg, 121 u32 bytes); 122 123void sk_msg_return(struct sock *sk, struct sk_msg *msg, int bytes); 124void sk_msg_return_zero(struct sock *sk, struct sk_msg *msg, int bytes); 125 126int sk_msg_zerocopy_from_iter(struct sock *sk, struct iov_iter *from, 127 struct sk_msg *msg, u32 bytes); 128int sk_msg_memcopy_from_iter(struct sock *sk, struct iov_iter *from, 129 struct sk_msg *msg, u32 bytes); 130 131static 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 136static 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 146static 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 172static inline void sk_msg_clear_meta(struct sk_msg *msg) 173{ 174 memset(&msg->sg, 0, offsetofend(struct sk_msg_sg, copy)); 175} 176 177static 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 184static 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 195static 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 201static 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 206static 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 211static inline struct scatterlist *sk_msg_elem(struct sk_msg *msg, int which) 212{ 213 return &msg->sg.data[which]; 214} 215 216static inline struct scatterlist sk_msg_elem_cpy(struct sk_msg *msg, int which) 217{ 218 return msg->sg.data[which]; 219} 220 221static inline struct page *sk_msg_page(struct sk_msg *msg, int which) 222{ 223 return sg_page(sk_msg_elem(msg, which)); 224} 225 226static inline bool sk_msg_to_ingress(const struct sk_msg *msg) 227{ 228 return msg->flags & BPF_F_INGRESS; 229} 230 231static 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 244static 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 259static 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 272static inline void sk_msg_sg_copy_set(struct sk_msg *msg, u32 start) 273{ 274 sk_msg_sg_copy(msg, start, true); 275} 276 277static inline void sk_msg_sg_copy_clear(struct sk_msg *msg, u32 start) 278{ 279 sk_msg_sg_copy(msg, start, false); 280} 281 282static inline struct sk_psock *sk_psock(const struct sock *sk) 283{ 284 return rcu_dereference_sk_user_data(sk); 285} 286 287static inline void sk_psock_queue_msg(struct sk_psock *psock, 288 struct sk_msg *msg) 289{ 290 list_add_tail(&msg->list, &psock->ingress_msg); 291} 292 293static inline bool sk_psock_queue_empty(const struct sk_psock *psock) 294{ 295 return psock ? list_empty(&psock->ingress_msg) : true; 296} 297 298static inline void sk_psock_report_error(struct sk_psock *psock, int err) 299{ 300 struct sock *sk = psock->sk; 301 302 sk->sk_err = err; 303 sk->sk_error_report(sk); 304} 305 306struct sk_psock *sk_psock_init(struct sock *sk, int node); 307 308int sk_psock_init_strp(struct sock *sk, struct sk_psock *psock); 309void sk_psock_start_strp(struct sock *sk, struct sk_psock *psock); 310void sk_psock_stop_strp(struct sock *sk, struct sk_psock *psock); 311void sk_psock_start_verdict(struct sock *sk, struct sk_psock *psock); 312void sk_psock_stop_verdict(struct sock *sk, struct sk_psock *psock); 313 314int sk_psock_msg_verdict(struct sock *sk, struct sk_psock *psock, 315 struct sk_msg *msg); 316 317static inline struct sk_psock_link *sk_psock_init_link(void) 318{ 319 return kzalloc(sizeof(struct sk_psock_link), 320 GFP_ATOMIC | __GFP_NOWARN); 321} 322 323static inline void sk_psock_free_link(struct sk_psock_link *link) 324{ 325 kfree(link); 326} 327 328struct sk_psock_link *sk_psock_link_pop(struct sk_psock *psock); 329 330void __sk_psock_purge_ingress_msg(struct sk_psock *psock); 331 332static inline void sk_psock_cork_free(struct sk_psock *psock) 333{ 334 if (psock->cork) { 335 sk_msg_free(psock->sk, psock->cork); 336 kfree(psock->cork); 337 psock->cork = NULL; 338 } 339} 340 341static inline void sk_psock_update_proto(struct sock *sk, 342 struct sk_psock *psock, 343 struct proto *ops) 344{ 345 /* Pairs with lockless read in sk_clone_lock() */ 346 WRITE_ONCE(sk->sk_prot, ops); 347} 348 349static inline void sk_psock_restore_proto(struct sock *sk, 350 struct sk_psock *psock) 351{ 352 sk->sk_prot->unhash = psock->saved_unhash; 353 if (inet_csk_has_ulp(sk)) { 354 tcp_update_ulp(sk, psock->sk_proto, psock->saved_write_space); 355 } else { 356 sk->sk_write_space = psock->saved_write_space; 357 /* Pairs with lockless read in sk_clone_lock() */ 358 WRITE_ONCE(sk->sk_prot, psock->sk_proto); 359 } 360} 361 362static inline void sk_psock_set_state(struct sk_psock *psock, 363 enum sk_psock_state_bits bit) 364{ 365 set_bit(bit, &psock->state); 366} 367 368static inline void sk_psock_clear_state(struct sk_psock *psock, 369 enum sk_psock_state_bits bit) 370{ 371 clear_bit(bit, &psock->state); 372} 373 374static inline bool sk_psock_test_state(const struct sk_psock *psock, 375 enum sk_psock_state_bits bit) 376{ 377 return test_bit(bit, &psock->state); 378} 379 380static inline struct sk_psock *sk_psock_get(struct sock *sk) 381{ 382 struct sk_psock *psock; 383 384 rcu_read_lock(); 385 psock = sk_psock(sk); 386 if (psock && !refcount_inc_not_zero(&psock->refcnt)) 387 psock = NULL; 388 rcu_read_unlock(); 389 return psock; 390} 391 392void sk_psock_stop(struct sock *sk, struct sk_psock *psock); 393void sk_psock_destroy(struct rcu_head *rcu); 394void sk_psock_drop(struct sock *sk, struct sk_psock *psock); 395 396static inline void sk_psock_put(struct sock *sk, struct sk_psock *psock) 397{ 398 if (refcount_dec_and_test(&psock->refcnt)) 399 sk_psock_drop(sk, psock); 400} 401 402static inline void sk_psock_data_ready(struct sock *sk, struct sk_psock *psock) 403{ 404 if (psock->parser.enabled) 405 psock->parser.saved_data_ready(sk); 406 else 407 sk->sk_data_ready(sk); 408} 409 410static inline void psock_set_prog(struct bpf_prog **pprog, 411 struct bpf_prog *prog) 412{ 413 prog = xchg(pprog, prog); 414 if (prog) 415 bpf_prog_put(prog); 416} 417 418static inline int psock_replace_prog(struct bpf_prog **pprog, 419 struct bpf_prog *prog, 420 struct bpf_prog *old) 421{ 422 if (cmpxchg(pprog, old, prog) != old) 423 return -ENOENT; 424 425 if (old) 426 bpf_prog_put(old); 427 428 return 0; 429} 430 431static inline void psock_progs_drop(struct sk_psock_progs *progs) 432{ 433 psock_set_prog(&progs->msg_parser, NULL); 434 psock_set_prog(&progs->skb_parser, NULL); 435 psock_set_prog(&progs->skb_verdict, NULL); 436} 437 438int sk_psock_tls_strp_read(struct sk_psock *psock, struct sk_buff *skb); 439 440static inline bool sk_psock_strp_enabled(struct sk_psock *psock) 441{ 442 if (!psock) 443 return false; 444 return psock->parser.enabled; 445} 446#endif /* _LINUX_SKMSG_H */