Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
5ab11c98 PE |
2 | #ifndef __NET_FRAG_H__ |
3 | #define __NET_FRAG_H__ | |
4 | ||
0eb71a9d | 5 | #include <linux/rhashtable-types.h> |
dc93f46b | 6 | #include <linux/completion.h> |
648700f7 | 7 | |
6ce3b4dc ED |
8 | /* Per netns frag queues directory */ |
9 | struct fqdir { | |
b2fd5321 | 10 | /* sysctls */ |
3e67f106 ED |
11 | long high_thresh; |
12 | long low_thresh; | |
b2fd5321 | 13 | int timeout; |
0fbf4cb2 | 14 | int max_dist; |
093ba729 | 15 | struct inet_frags *f; |
a39aca67 | 16 | struct net *net; |
3c8fc878 | 17 | bool dead; |
c2615cf5 ED |
18 | |
19 | struct rhashtable rhashtable ____cacheline_aligned_in_smp; | |
20 | ||
21 | /* Keep atomic mem on separate cachelines in structs that include it */ | |
22 | atomic_long_t mem ____cacheline_aligned_in_smp; | |
d5dd8879 | 23 | struct work_struct destroy_work; |
ac18e750 PE |
24 | }; |
25 | ||
1ab1934e NA |
26 | /** |
27 | * fragment queue flags | |
28 | * | |
29 | * @INET_FRAG_FIRST_IN: first fragment has arrived | |
30 | * @INET_FRAG_LAST_IN: final fragment has arrived | |
31 | * @INET_FRAG_COMPLETE: frag queue has been processed and is due for destruction | |
3c8fc878 | 32 | * @INET_FRAG_HASH_DEAD: inet_frag_kill() has not removed fq from rhashtable |
1ab1934e NA |
33 | */ |
34 | enum { | |
35 | INET_FRAG_FIRST_IN = BIT(0), | |
36 | INET_FRAG_LAST_IN = BIT(1), | |
37 | INET_FRAG_COMPLETE = BIT(2), | |
3c8fc878 | 38 | INET_FRAG_HASH_DEAD = BIT(3), |
1ab1934e NA |
39 | }; |
40 | ||
648700f7 ED |
41 | struct frag_v4_compare_key { |
42 | __be32 saddr; | |
43 | __be32 daddr; | |
44 | u32 user; | |
45 | u32 vif; | |
46 | __be16 id; | |
47 | u16 protocol; | |
48 | }; | |
49 | ||
50 | struct frag_v6_compare_key { | |
51 | struct in6_addr saddr; | |
52 | struct in6_addr daddr; | |
53 | u32 user; | |
54 | __be32 id; | |
55 | u32 iif; | |
56 | }; | |
57 | ||
1ab1934e NA |
58 | /** |
59 | * struct inet_frag_queue - fragment queue | |
60 | * | |
648700f7 ED |
61 | * @node: rhash node |
62 | * @key: keys identifying this frag. | |
1ab1934e | 63 | * @timer: queue expiration timer |
648700f7 | 64 | * @lock: spinlock protecting this frag |
1ab1934e | 65 | * @refcnt: reference count of the queue |
353c9cb3 | 66 | * @rb_fragments: received fragments rb-tree root |
1ab1934e | 67 | * @fragments_tail: received fragments tail |
353c9cb3 | 68 | * @last_run_head: the head of the last "run". see ip_fragment.c |
1ab1934e NA |
69 | * @stamp: timestamp of the last received fragment |
70 | * @len: total length of the original datagram | |
71 | * @meat: length of received fragments so far | |
72 | * @flags: fragment queue flags | |
d6b915e2 | 73 | * @max_size: maximum received fragment size |
6ce3b4dc | 74 | * @fqdir: pointer to struct fqdir |
648700f7 | 75 | * @rcu: rcu head for freeing deferall |
1ab1934e | 76 | */ |
5ab11c98 | 77 | struct inet_frag_queue { |
648700f7 ED |
78 | struct rhash_head node; |
79 | union { | |
80 | struct frag_v4_compare_key v4; | |
81 | struct frag_v6_compare_key v6; | |
82 | } key; | |
1ab1934e | 83 | struct timer_list timer; |
648700f7 | 84 | spinlock_t lock; |
edcb6918 | 85 | refcount_t refcnt; |
d8cf757f | 86 | struct rb_root rb_fragments; |
d6bebca9 | 87 | struct sk_buff *fragments_tail; |
353c9cb3 | 88 | struct sk_buff *last_run_head; |
5ab11c98 | 89 | ktime_t stamp; |
1ab1934e | 90 | int len; |
5ab11c98 | 91 | int meat; |
1ab1934e | 92 | __u8 flags; |
5f2d04f1 | 93 | u16 max_size; |
6ce3b4dc | 94 | struct fqdir *fqdir; |
648700f7 | 95 | struct rcu_head rcu; |
19952cc4 JDB |
96 | }; |
97 | ||
7eb95156 | 98 | struct inet_frags { |
4c0ebd6f | 99 | unsigned int qsize; |
321a3a99 | 100 | |
c6fda282 | 101 | void (*constructor)(struct inet_frag_queue *q, |
36c77782 | 102 | const void *arg); |
1e4b8287 | 103 | void (*destructor)(struct inet_frag_queue *); |
78802011 | 104 | void (*frag_expire)(struct timer_list *t); |
d4ad4d22 NA |
105 | struct kmem_cache *frags_cachep; |
106 | const char *frags_cache_name; | |
648700f7 | 107 | struct rhashtable_params rhash_params; |
dc93f46b ED |
108 | refcount_t refcnt; |
109 | struct completion completion; | |
7eb95156 PE |
110 | }; |
111 | ||
d4ad4d22 | 112 | int inet_frags_init(struct inet_frags *); |
7eb95156 PE |
113 | void inet_frags_fini(struct inet_frags *); |
114 | ||
6b73d197 | 115 | int fqdir_init(struct fqdir **fqdirp, struct inet_frags *f, struct net *net); |
d5dd8879 | 116 | |
08003d0b | 117 | static inline void fqdir_pre_exit(struct fqdir *fqdir) |
d5dd8879 ED |
118 | { |
119 | fqdir->high_thresh = 0; /* prevent creation of new frags */ | |
120 | fqdir->dead = true; | |
121 | } | |
89fb9005 | 122 | void fqdir_exit(struct fqdir *fqdir); |
e5a2bb84 | 123 | |
093ba729 ED |
124 | void inet_frag_kill(struct inet_frag_queue *q); |
125 | void inet_frag_destroy(struct inet_frag_queue *q); | |
6ce3b4dc | 126 | struct inet_frag_queue *inet_frag_find(struct fqdir *fqdir, void *key); |
277e650d | 127 | |
353c9cb3 PO |
128 | /* Free all skbs in the queue; return the sum of their truesizes. */ |
129 | unsigned int inet_frag_rbtree_purge(struct rb_root *root); | |
130 | ||
093ba729 | 131 | static inline void inet_frag_put(struct inet_frag_queue *q) |
762cc408 | 132 | { |
edcb6918 | 133 | if (refcount_dec_and_test(&q->refcnt)) |
093ba729 | 134 | inet_frag_destroy(q); |
762cc408 PE |
135 | } |
136 | ||
d433673e JDB |
137 | /* Memory Tracking Functions. */ |
138 | ||
6ce3b4dc | 139 | static inline long frag_mem_limit(const struct fqdir *fqdir) |
d433673e | 140 | { |
6ce3b4dc | 141 | return atomic_long_read(&fqdir->mem); |
d433673e JDB |
142 | } |
143 | ||
6ce3b4dc | 144 | static inline void sub_frag_mem_limit(struct fqdir *fqdir, long val) |
d433673e | 145 | { |
6ce3b4dc | 146 | atomic_long_sub(val, &fqdir->mem); |
d433673e JDB |
147 | } |
148 | ||
6ce3b4dc | 149 | static inline void add_frag_mem_limit(struct fqdir *fqdir, long val) |
d433673e | 150 | { |
6ce3b4dc | 151 | atomic_long_add(val, &fqdir->mem); |
d433673e JDB |
152 | } |
153 | ||
be991971 HFS |
154 | /* RFC 3168 support : |
155 | * We want to check ECN values of all fragments, do detect invalid combinations. | |
156 | * In ipq->ecn, we store the OR value of each ip4_frag_ecn() fragment value. | |
157 | */ | |
158 | #define IPFRAG_ECN_NOT_ECT 0x01 /* one frag had ECN_NOT_ECT */ | |
159 | #define IPFRAG_ECN_ECT_1 0x02 /* one frag had ECN_ECT_1 */ | |
160 | #define IPFRAG_ECN_ECT_0 0x04 /* one frag had ECN_ECT_0 */ | |
161 | #define IPFRAG_ECN_CE 0x08 /* one frag had ECN_CE */ | |
162 | ||
163 | extern const u8 ip_frag_ecn_table[16]; | |
164 | ||
c23f35d1 PO |
165 | /* Return values of inet_frag_queue_insert() */ |
166 | #define IPFRAG_OK 0 | |
167 | #define IPFRAG_DUP 1 | |
168 | #define IPFRAG_OVERLAP 2 | |
169 | int inet_frag_queue_insert(struct inet_frag_queue *q, struct sk_buff *skb, | |
170 | int offset, int end); | |
171 | void *inet_frag_reasm_prepare(struct inet_frag_queue *q, struct sk_buff *skb, | |
172 | struct sk_buff *parent); | |
173 | void inet_frag_reasm_finish(struct inet_frag_queue *q, struct sk_buff *head, | |
174 | void *reasm_data); | |
175 | struct sk_buff *inet_frag_pull_head(struct inet_frag_queue *q); | |
176 | ||
5ab11c98 | 177 | #endif |