[thirdparty/linux.git] / include / linux / skmsg.h

/* SPDX-License-Identifier: GPL-2.0 */
/* Copyright (c) 2017 - 2018 Covalent IO, Inc. http://covalent.io */

#ifndef _LINUX_SKMSG_H
#define _LINUX_SKMSG_H

#include <linux/bpf.h>
#include <linux/filter.h>
#include <linux/scatterlist.h>
#include <linux/skbuff.h>

#include <net/sock.h>
#include <net/tcp.h>
#include <net/strparser.h>

#define MAX_MSG_FRAGS			MAX_SKB_FRAGS
#define NR_MSG_FRAG_IDS			(MAX_MSG_FRAGS + 1)

enum __sk_action {
	__SK_DROP = 0,
	__SK_PASS,
	__SK_REDIRECT,
	__SK_NONE,
};

struct sk_msg_sg {
	u32				start;
	u32				curr;
	u32				end;
	u32				size;
	u32				copybreak;
	unsigned long			copy;
	/* The extra two elements:
	 * 1) used for chaining the front and sections when the list becomes
	 *    partitioned (e.g. end < start). The crypto APIs require the
	 *    chaining;
	 * 2) to chain tailer SG entries after the message.
	 */
	struct scatterlist		data[MAX_MSG_FRAGS + 2];
};
static_assert(BITS_PER_LONG >= NR_MSG_FRAG_IDS);

/* UAPI in filter.c depends on struct sk_msg_sg being first element. */
struct sk_msg {
	struct sk_msg_sg		sg;
	void				*data;
	void				*data_end;
	u32				apply_bytes;
	u32				cork_bytes;
	u32				flags;
	struct sk_buff			*skb;
	struct sock			*sk_redir;
	struct sock			*sk;
	struct list_head		list;
};

struct sk_psock_progs {
	struct bpf_prog			*msg_parser;
	struct bpf_prog			*skb_parser;
	struct bpf_prog			*skb_verdict;
};

enum sk_psock_state_bits {
	SK_PSOCK_TX_ENABLED,
};

struct sk_psock_link {
	struct list_head		list;
	struct bpf_map			*map;
	void				*link_raw;
};

struct sk_psock_parser {
	struct strparser		strp;
	bool				enabled;
	void (*saved_data_ready)(struct sock *sk);
};

struct sk_psock_work_state {
	struct sk_buff			*skb;
	u32				len;
	u32				off;
};

struct sk_psock {
	struct sock			*sk;
	struct sock			*sk_redir;
	u32				apply_bytes;
	u32				cork_bytes;
	u32				eval;
	struct sk_msg			*cork;
	struct sk_psock_progs		progs;
	struct sk_psock_parser		parser;
	struct sk_buff_head		ingress_skb;
	struct list_head		ingress_msg;
	unsigned long			state;
	struct list_head		link;
	spinlock_t			link_lock;
	refcount_t			refcnt;
	void (*saved_unhash)(struct sock *sk);
	void (*saved_close)(struct sock *sk, long timeout);
	void (*saved_write_space)(struct sock *sk);
	struct proto			*sk_proto;
	struct sk_psock_work_state	work_state;
	struct work_struct		work;
	union {
		struct rcu_head		rcu;
		struct work_struct	gc;
	};
};

int sk_msg_alloc(struct sock *sk, struct sk_msg *msg, int len,
		 int elem_first_coalesce);
int sk_msg_clone(struct sock *sk, struct sk_msg *dst, struct sk_msg *src,
		 u32 off, u32 len);
void sk_msg_trim(struct sock *sk, struct sk_msg *msg, int len);
int sk_msg_free(struct sock *sk, struct sk_msg *msg);
int sk_msg_free_nocharge(struct sock *sk, struct sk_msg *msg);
void sk_msg_free_partial(struct sock *sk, struct sk_msg *msg, u32 bytes);
void sk_msg_free_partial_nocharge(struct sock *sk, struct sk_msg *msg,
				  u32 bytes);

void sk_msg_return(struct sock *sk, struct sk_msg *msg, int bytes);
void sk_msg_return_zero(struct sock *sk, struct sk_msg *msg, int bytes);

int sk_msg_zerocopy_from_iter(struct sock *sk, struct iov_iter *from,
			      struct sk_msg *msg, u32 bytes);
int sk_msg_memcopy_from_iter(struct sock *sk, struct iov_iter *from,
			     struct sk_msg *msg, u32 bytes);

static inline void sk_msg_check_to_free(struct sk_msg *msg, u32 i, u32 bytes)
{
	WARN_ON(i == msg->sg.end && bytes);
}

static inline void sk_msg_apply_bytes(struct sk_psock *psock, u32 bytes)
{
	if (psock->apply_bytes) {
		if (psock->apply_bytes < bytes)
			psock->apply_bytes = 0;
		else
			psock->apply_bytes -= bytes;
	}
}

static inline u32 sk_msg_iter_dist(u32 start, u32 end)
{
	return end >= start ? end - start : end + (NR_MSG_FRAG_IDS - start);
}

#define sk_msg_iter_var_prev(var)			\
	do {						\
		if (var == 0)				\
			var = NR_MSG_FRAG_IDS - 1;	\
		else					\
			var--;				\
	} while (0)

#define sk_msg_iter_var_next(var)			\
	do {						\
		var++;					\
		if (var == NR_MSG_FRAG_IDS)		\
			var = 0;			\
	} while (0)

#define sk_msg_iter_prev(msg, which)			\
	sk_msg_iter_var_prev(msg->sg.which)

#define sk_msg_iter_next(msg, which)			\
	sk_msg_iter_var_next(msg->sg.which)

static inline void sk_msg_clear_meta(struct sk_msg *msg)
{
	memset(&msg->sg, 0, offsetofend(struct sk_msg_sg, copy));
}

static inline void sk_msg_init(struct sk_msg *msg)
{
	BUILD_BUG_ON(ARRAY_SIZE(msg->sg.data) - 1 != NR_MSG_FRAG_IDS);
	memset(msg, 0, sizeof(*msg));
	sg_init_marker(msg->sg.data, NR_MSG_FRAG_IDS);
}

static inline void sk_msg_xfer(struct sk_msg *dst, struct sk_msg *src,
			       int which, u32 size)
{
	dst->sg.data[which] = src->sg.data[which];
	dst->sg.data[which].length  = size;
	dst->sg.size		   += size;
	src->sg.size		   -= size;
	src->sg.data[which].length -= size;
	src->sg.data[which].offset += size;
}

static inline void sk_msg_xfer_full(struct sk_msg *dst, struct sk_msg *src)
{
	memcpy(dst, src, sizeof(*src));
	sk_msg_init(src);
}

static inline bool sk_msg_full(const struct sk_msg *msg)
{
	return sk_msg_iter_dist(msg->sg.start, msg->sg.end) == MAX_MSG_FRAGS;
}

static inline u32 sk_msg_elem_used(const struct sk_msg *msg)
{
	return sk_msg_iter_dist(msg->sg.start, msg->sg.end);
}

static inline struct scatterlist *sk_msg_elem(struct sk_msg *msg, int which)
{
	return &msg->sg.data[which];
}

static inline struct scatterlist sk_msg_elem_cpy(struct sk_msg *msg, int which)
{
	return msg->sg.data[which];
}

static inline struct page *sk_msg_page(struct sk_msg *msg, int which)
{
	return sg_page(sk_msg_elem(msg, which));
}

static inline bool sk_msg_to_ingress(const struct sk_msg *msg)
{
	return msg->flags & BPF_F_INGRESS;
}

static inline void sk_msg_compute_data_pointers(struct sk_msg *msg)
{
	struct scatterlist *sge = sk_msg_elem(msg, msg->sg.start);

	if (test_bit(msg->sg.start, &msg->sg.copy)) {
		msg->data = NULL;
		msg->data_end = NULL;
	} else {
		msg->data = sg_virt(sge);
		msg->data_end = msg->data + sge->length;
	}
}

static inline void sk_msg_page_add(struct sk_msg *msg, struct page *page,
				   u32 len, u32 offset)
{
	struct scatterlist *sge;

	get_page(page);
	sge = sk_msg_elem(msg, msg->sg.end);
	sg_set_page(sge, page, len, offset);
	sg_unmark_end(sge);

	__set_bit(msg->sg.end, &msg->sg.copy);
	msg->sg.size += len;
	sk_msg_iter_next(msg, end);
}

static inline void sk_msg_sg_copy(struct sk_msg *msg, u32 i, bool copy_state)
{
	do {
		if (copy_state)
			__set_bit(i, &msg->sg.copy);
		else
			__clear_bit(i, &msg->sg.copy);
		sk_msg_iter_var_next(i);
		if (i == msg->sg.end)
			break;
	} while (1);
}

static inline void sk_msg_sg_copy_set(struct sk_msg *msg, u32 start)
{
	sk_msg_sg_copy(msg, start, true);
}

static inline void sk_msg_sg_copy_clear(struct sk_msg *msg, u32 start)
{
	sk_msg_sg_copy(msg, start, false);
}

static inline struct sk_psock *sk_psock(const struct sock *sk)
{
	return rcu_dereference_sk_user_data(sk);
}

static inline void sk_psock_queue_msg(struct sk_psock *psock,
				      struct sk_msg *msg)
{
	list_add_tail(&msg->list, &psock->ingress_msg);
}

static inline bool sk_psock_queue_empty(const struct sk_psock *psock)
{
	return psock ? list_empty(&psock->ingress_msg) : true;
}

static inline void sk_psock_report_error(struct sk_psock *psock, int err)
{
	struct sock *sk = psock->sk;

	sk->sk_err = err;
	sk->sk_error_report(sk);
}

struct sk_psock *sk_psock_init(struct sock *sk, int node);

int sk_psock_init_strp(struct sock *sk, struct sk_psock *psock);
void sk_psock_start_strp(struct sock *sk, struct sk_psock *psock);
void sk_psock_stop_strp(struct sock *sk, struct sk_psock *psock);

int sk_psock_msg_verdict(struct sock *sk, struct sk_psock *psock,
			 struct sk_msg *msg);

static inline struct sk_psock_link *sk_psock_init_link(void)
{
	return kzalloc(sizeof(struct sk_psock_link),
		       GFP_ATOMIC | __GFP_NOWARN);
}

static inline void sk_psock_free_link(struct sk_psock_link *link)
{
	kfree(link);
}

struct sk_psock_link *sk_psock_link_pop(struct sk_psock *psock);

void __sk_psock_purge_ingress_msg(struct sk_psock *psock);

static inline void sk_psock_cork_free(struct sk_psock *psock)
{
	if (psock->cork) {
		sk_msg_free(psock->sk, psock->cork);
		kfree(psock->cork);
		psock->cork = NULL;
	}
}

static inline void sk_psock_update_proto(struct sock *sk,
					 struct sk_psock *psock,
					 struct proto *ops)
{
	/* Initialize saved callbacks and original proto only once, since this
	 * function may be called multiple times for a psock, e.g. when
	 * psock->progs.msg_parser is updated.
	 *
	 * Since we've not installed the new proto, psock is not yet in use and
	 * we can initialize it without synchronization.
	 */
	if (!psock->sk_proto) {
		struct proto *orig = READ_ONCE(sk->sk_prot);

		psock->saved_unhash = orig->unhash;
		psock->saved_close = orig->close;
		psock->saved_write_space = sk->sk_write_space;

		psock->sk_proto = orig;
	}

	/* Pairs with lockless read in sk_clone_lock() */
	WRITE_ONCE(sk->sk_prot, ops);
}

static inline void sk_psock_restore_proto(struct sock *sk,
					  struct sk_psock *psock)
{
	sk->sk_prot->unhash = psock->saved_unhash;
	if (inet_csk_has_ulp(sk)) {
		tcp_update_ulp(sk, psock->sk_proto, psock->saved_write_space);
	} else {
		sk->sk_write_space = psock->saved_write_space;
		/* Pairs with lockless read in sk_clone_lock() */
		WRITE_ONCE(sk->sk_prot, psock->sk_proto);
	}
}

static inline void sk_psock_set_state(struct sk_psock *psock,
				      enum sk_psock_state_bits bit)
{
	set_bit(bit, &psock->state);
}

static inline void sk_psock_clear_state(struct sk_psock *psock,
					enum sk_psock_state_bits bit)
{
	clear_bit(bit, &psock->state);
}

static inline bool sk_psock_test_state(const struct sk_psock *psock,
				       enum sk_psock_state_bits bit)
{
	return test_bit(bit, &psock->state);
}

static inline struct sk_psock *sk_psock_get(struct sock *sk)
{
	struct sk_psock *psock;

	rcu_read_lock();
	psock = sk_psock(sk);
	if (psock && !refcount_inc_not_zero(&psock->refcnt))
		psock = NULL;
	rcu_read_unlock();
	return psock;
}

void sk_psock_stop(struct sock *sk, struct sk_psock *psock);
void sk_psock_destroy(struct rcu_head *rcu);
void sk_psock_drop(struct sock *sk, struct sk_psock *psock);

static inline void sk_psock_put(struct sock *sk, struct sk_psock *psock)
{
	if (refcount_dec_and_test(&psock->refcnt))
		sk_psock_drop(sk, psock);
}

static inline void sk_psock_data_ready(struct sock *sk, struct sk_psock *psock)
{
	if (psock->parser.enabled)
		psock->parser.saved_data_ready(sk);
	else
		sk->sk_data_ready(sk);
}

static inline void psock_set_prog(struct bpf_prog **pprog,
				  struct bpf_prog *prog)
{
	prog = xchg(pprog, prog);
	if (prog)
		bpf_prog_put(prog);
}

static inline void psock_progs_drop(struct sk_psock_progs *progs)
{
	psock_set_prog(&progs->msg_parser, NULL);
	psock_set_prog(&progs->skb_parser, NULL);
	psock_set_prog(&progs->skb_verdict, NULL);
}

#endif /* _LINUX_SKMSG_H */
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	#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
031097d9	17	#define NR_MSG_FRAG_IDS (MAX_MSG_FRAGS + 1)
604326b4 DB	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;
163ab96b	32	unsigned long copy;
031097d9 JK	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.
d3b18ad3	38	*/
031097d9	39	struct scatterlist data[MAX_MSG_FRAGS + 2];
604326b4	40	};
031097d9	41	static_assert(BITS_PER_LONG >= NR_MSG_FRAG_IDS);
604326b4	42
7a69c0f2	43	/* UAPI in filter.c depends on struct sk_msg_sg being first element. */
604326b4 DB	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);
d829e9c4 DB	114	int sk_msg_clone(struct sock sk, struct sk_msg dst, struct sk_msg *src,
d829e9c4 DB	115	u32 off, u32 len);
604326b4 DB	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);
d3b18ad3	124	void sk_msg_return_zero(struct sock sk, struct sk_msg msg, int bytes);
604326b4 DB	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
	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
	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
683916f6 JK	146	static inline u32 sk_msg_iter_dist(u32 start, u32 end)
683916f6 JK	147	{
031097d9	148	return end >= start ? end - start : end + (NR_MSG_FRAG_IDS - start);
683916f6 JK	149	}
683916f6 JK	150
604326b4 DB	151	#define sk_msg_iter_var_prev(var) \
	152	do { \
	153	if (var == 0) \
031097d9	154	var = NR_MSG_FRAG_IDS - 1; \
604326b4 DB	155	else \
	156	var--; \
	157	} while (0)
	158
	159	#define sk_msg_iter_var_next(var) \
	160	do { \
	161	var++; \
031097d9	162	if (var == NR_MSG_FRAG_IDS) \
604326b4 DB	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
	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
	177	static inline void sk_msg_init(struct sk_msg *msg)
	178	{
031097d9	179	BUILD_BUG_ON(ARRAY_SIZE(msg->sg.data) - 1 != NR_MSG_FRAG_IDS);
604326b4	180	memset(msg, 0, sizeof(*msg));
031097d9	181	sg_init_marker(msg->sg.data, NR_MSG_FRAG_IDS);
604326b4 DB	182	}
	183
	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;
3f4c3127	189	dst->sg.size += size;
81aabbb9	190	src->sg.size -= size;
604326b4 DB	191	src->sg.data[which].length -= size;
	192	src->sg.data[which].offset += size;
	193	}
	194
d3b18ad3 JF	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
8734a162 JF	201	static inline bool sk_msg_full(const struct sk_msg *msg)
8734a162 JF	202	{
031097d9	203	return sk_msg_iter_dist(msg->sg.start, msg->sg.end) == MAX_MSG_FRAGS;
8734a162 JF	204	}
8734a162 JF	205
604326b4 DB	206	static inline u32 sk_msg_elem_used(const struct sk_msg *msg)
604326b4 DB	207	{
683916f6	208	return sk_msg_iter_dist(msg->sg.start, msg->sg.end);
604326b4 DB	209	}
604326b4 DB	210
604326b4 DB	211	static inline struct scatterlist sk_msg_elem(struct sk_msg msg, int which)
	212	{
	213	return &msg->sg.data[which];
	214	}
	215
6fff607e JF	216	static inline struct scatterlist sk_msg_elem_cpy(struct sk_msg *msg, int which)
	217	{
	218	return msg->sg.data[which];
	219	}
	220
604326b4 DB	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
	226	static inline bool sk_msg_to_ingress(const struct sk_msg *msg)
	227	{
	228	return msg->flags & BPF_F_INGRESS;
	229	}
	230
	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
163ab96b	235	if (test_bit(msg->sg.start, &msg->sg.copy)) {
604326b4 DB	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
	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
163ab96b	254	__set_bit(msg->sg.end, &msg->sg.copy);
604326b4 DB	255	msg->sg.size += len;
	256	sk_msg_iter_next(msg, end);
	257	}
	258
d3b18ad3 JF	259	static inline void sk_msg_sg_copy(struct sk_msg *msg, u32 i, bool copy_state)
	260	{
	261	do {
163ab96b JK	262	if (copy_state)
	263	__set_bit(i, &msg->sg.copy);
	264	else
	265	__clear_bit(i, &msg->sg.copy);
d3b18ad3 JF	266	sk_msg_iter_var_next(i);
	267	if (i == msg->sg.end)
	268	break;
	269	} while (1);
	270	}
	271
	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
	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
604326b4 DB	282	static inline struct sk_psock sk_psock(const struct sock sk)
	283	{
	284	return rcu_dereference_sk_user_data(sk);
	285	}
	286
604326b4 DB	287	static 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
d3b18ad3 JF	293	static inline bool sk_psock_queue_empty(const struct sk_psock *psock)
	294	{
	295	return psock ? list_empty(&psock->ingress_msg) : true;
	296	}
	297
604326b4 DB	298	static 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
	306	struct sk_psock sk_psock_init(struct sock sk, int node);
	307
	308	int sk_psock_init_strp(struct sock sk, struct sk_psock psock);
	309	void sk_psock_start_strp(struct sock sk, struct sk_psock psock);
	310	void sk_psock_stop_strp(struct sock sk, struct sk_psock psock);
	311
	312	int sk_psock_msg_verdict(struct sock sk, struct sk_psock psock,
	313	struct sk_msg *msg);
	314
	315	static inline struct sk_psock_link *sk_psock_init_link(void)
	316	{
	317	return kzalloc(sizeof(struct sk_psock_link),
	318	GFP_ATOMIC \| __GFP_NOWARN);
	319	}
	320
	321	static inline void sk_psock_free_link(struct sk_psock_link *link)
	322	{
	323	kfree(link);
	324	}
	325
	326	struct sk_psock_link sk_psock_link_pop(struct sk_psock psock);
604326b4 DB	327
	328	void __sk_psock_purge_ingress_msg(struct sk_psock *psock);
	329
	330	static inline void sk_psock_cork_free(struct sk_psock *psock)
	331	{
	332	if (psock->cork) {
	333	sk_msg_free(psock->sk, psock->cork);
	334	kfree(psock->cork);
	335	psock->cork = NULL;
	336	}
	337	}
	338
	339	static inline void sk_psock_update_proto(struct sock *sk,
	340	struct sk_psock *psock,
	341	struct proto *ops)
	342	{
1a2e2013 LB	343	/* Initialize saved callbacks and original proto only once, since this
	344	* function may be called multiple times for a psock, e.g. when
	345	* psock->progs.msg_parser is updated.
	346	*
	347	* Since we've not installed the new proto, psock is not yet in use and
	348	* we can initialize it without synchronization.
	349	*/
	350	if (!psock->sk_proto) {
	351	struct proto *orig = READ_ONCE(sk->sk_prot);
	352
	353	psock->saved_unhash = orig->unhash;
	354	psock->saved_close = orig->close;
	355	psock->saved_write_space = sk->sk_write_space;
	356
	357	psock->sk_proto = orig;
	358	}
604326b4	359
b8e202d1 JS	360	/* Pairs with lockless read in sk_clone_lock() */
b8e202d1 JS	361	WRITE_ONCE(sk->sk_prot, ops);
604326b4 DB	362	}
	363
	364	static inline void sk_psock_restore_proto(struct sock *sk,
	365	struct sk_psock *psock)
	366	{
4da6a196	367	sk->sk_prot->unhash = psock->saved_unhash;
7b70973d LB	368	if (inet_csk_has_ulp(sk)) {
	369	tcp_update_ulp(sk, psock->sk_proto, psock->saved_write_space);
	370	} else {
	371	sk->sk_write_space = psock->saved_write_space;
	372	/* Pairs with lockless read in sk_clone_lock() */
	373	WRITE_ONCE(sk->sk_prot, psock->sk_proto);
	374	}
604326b4 DB	375	}
	376
	377	static inline void sk_psock_set_state(struct sk_psock *psock,
	378	enum sk_psock_state_bits bit)
	379	{
	380	set_bit(bit, &psock->state);
	381	}
	382
	383	static inline void sk_psock_clear_state(struct sk_psock *psock,
	384	enum sk_psock_state_bits bit)
	385	{
	386	clear_bit(bit, &psock->state);
	387	}
	388
	389	static inline bool sk_psock_test_state(const struct sk_psock *psock,
	390	enum sk_psock_state_bits bit)
	391	{
	392	return test_bit(bit, &psock->state);
	393	}
	394
	395	static inline struct sk_psock sk_psock_get(struct sock sk)
	396	{
	397	struct sk_psock *psock;
	398
	399	rcu_read_lock();
	400	psock = sk_psock(sk);
	401	if (psock && !refcount_inc_not_zero(&psock->refcnt))
	402	psock = NULL;
	403	rcu_read_unlock();
	404	return psock;
	405	}
	406
	407	void sk_psock_stop(struct sock sk, struct sk_psock psock);
	408	void sk_psock_destroy(struct rcu_head *rcu);
	409	void sk_psock_drop(struct sock sk, struct sk_psock psock);
	410
	411	static inline void sk_psock_put(struct sock sk, struct sk_psock psock)
	412	{
	413	if (refcount_dec_and_test(&psock->refcnt))
	414	sk_psock_drop(sk, psock);
	415	}
	416
552de910 JF	417	static inline void sk_psock_data_ready(struct sock sk, struct sk_psock psock)
	418	{
	419	if (psock->parser.enabled)
	420	psock->parser.saved_data_ready(sk);
	421	else
	422	sk->sk_data_ready(sk);
	423	}
	424
604326b4 DB	425	static inline void psock_set_prog(struct bpf_prog **pprog,
	426	struct bpf_prog *prog)
	427	{
	428	prog = xchg(pprog, prog);
	429	if (prog)
	430	bpf_prog_put(prog);
	431	}
	432
	433	static inline void psock_progs_drop(struct sk_psock_progs *progs)
	434	{
	435	psock_set_prog(&progs->msg_parser, NULL);
	436	psock_set_prog(&progs->skb_parser, NULL);
	437	psock_set_prog(&progs->skb_verdict, NULL);
	438	}
	439
	440	#endif /* _LINUX_SKMSG_H */