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