]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - include/net/inet_frag.h
UBUNTU: [Config] CONFIG_RESET_TI_SYSCON=m
[mirror_ubuntu-artful-kernel.git] / include / net / inet_frag.h
CommitLineData
5ab11c98
PE
1#ifndef __NET_FRAG_H__
2#define __NET_FRAG_H__
3
ac18e750 4struct netns_frags {
62091efb
JDB
5 /* Keep atomic mem on separate cachelines in structs that include it */
6 atomic_t mem ____cacheline_aligned_in_smp;
b2fd5321
PE
7 /* sysctls */
8 int timeout;
e31e0bdc
PE
9 int high_thresh;
10 int low_thresh;
0fbf4cb2 11 int max_dist;
ac18e750
PE
12};
13
1ab1934e
NA
14/**
15 * fragment queue flags
16 *
17 * @INET_FRAG_FIRST_IN: first fragment has arrived
18 * @INET_FRAG_LAST_IN: final fragment has arrived
19 * @INET_FRAG_COMPLETE: frag queue has been processed and is due for destruction
1ab1934e
NA
20 */
21enum {
22 INET_FRAG_FIRST_IN = BIT(0),
23 INET_FRAG_LAST_IN = BIT(1),
24 INET_FRAG_COMPLETE = BIT(2),
1ab1934e
NA
25};
26
27/**
28 * struct inet_frag_queue - fragment queue
29 *
30 * @lock: spinlock protecting the queue
31 * @timer: queue expiration timer
32 * @list: hash bucket list
33 * @refcnt: reference count of the queue
34 * @fragments: received fragments head
35 * @fragments_tail: received fragments tail
36 * @stamp: timestamp of the last received fragment
37 * @len: total length of the original datagram
38 * @meat: length of received fragments so far
39 * @flags: fragment queue flags
d6b915e2 40 * @max_size: maximum received fragment size
1ab1934e 41 * @net: namespace that this frag belongs to
d1fe1944 42 * @list_evictor: list of queues to forcefully evict (e.g. due to low memory)
1ab1934e 43 */
5ab11c98 44struct inet_frag_queue {
5ab11c98 45 spinlock_t lock;
1ab1934e 46 struct timer_list timer;
6e34a8b3 47 struct hlist_node list;
edcb6918 48 refcount_t refcnt;
1ab1934e 49 struct sk_buff *fragments;
d6bebca9 50 struct sk_buff *fragments_tail;
5ab11c98 51 ktime_t stamp;
1ab1934e 52 int len;
5ab11c98 53 int meat;
1ab1934e 54 __u8 flags;
5f2d04f1 55 u16 max_size;
6e34a8b3 56 struct netns_frags *net;
d1fe1944 57 struct hlist_node list_evictor;
5ab11c98
PE
58};
59
a4c4009f 60#define INETFRAGS_HASHSZ 1024
7eb95156 61
5a3da1fe
HFS
62/* averaged:
63 * max_depth = default ipfrag_high_thresh / INETFRAGS_HASHSZ /
64 * rounded up (SKB_TRUELEN(0) + sizeof(struct ipq or
65 * struct frag_queue))
66 */
b13d3cbf 67#define INETFRAGS_MAXDEPTH 128
5a3da1fe 68
19952cc4
JDB
69struct inet_frag_bucket {
70 struct hlist_head chain;
71 spinlock_t chain_lock;
72};
73
7eb95156 74struct inet_frags {
19952cc4 75 struct inet_frag_bucket hash[INETFRAGS_HASHSZ];
7088ad74 76
b13d3cbf
FW
77 struct work_struct frags_work;
78 unsigned int next_bucket;
e3a57d18
FW
79 unsigned long last_rebuild_jiffies;
80 bool rebuild;
b13d3cbf 81
7088ad74
HFS
82 /* The first call to hashfn is responsible to initialize
83 * rnd. This is best done with net_get_random_once.
ab1c724f
FW
84 *
85 * rnd_seqlock is used to let hash insertion detect
86 * when it needs to re-lookup the hash chain to use.
7088ad74 87 */
5f8e1e8b 88 u32 rnd;
ab1c724f 89 seqlock_t rnd_seqlock;
4c0ebd6f 90 unsigned int qsize;
321a3a99 91
36c77782
FW
92 unsigned int (*hashfn)(const struct inet_frag_queue *);
93 bool (*match)(const struct inet_frag_queue *q,
94 const void *arg);
c6fda282 95 void (*constructor)(struct inet_frag_queue *q,
36c77782 96 const void *arg);
1e4b8287 97 void (*destructor)(struct inet_frag_queue *);
e521db9d 98 void (*frag_expire)(unsigned long data);
d4ad4d22
NA
99 struct kmem_cache *frags_cachep;
100 const char *frags_cache_name;
7eb95156
PE
101};
102
d4ad4d22 103int inet_frags_init(struct inet_frags *);
7eb95156
PE
104void inet_frags_fini(struct inet_frags *);
105
c8b34d99 106static inline void inet_frags_init_net(struct netns_frags *nf)
1d6119ba 107{
62091efb 108 atomic_set(&nf->mem, 0);
1d6119ba 109}
81566e83 110void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f);
e5a2bb84 111
277e650d 112void inet_frag_kill(struct inet_frag_queue *q, struct inet_frags *f);
3fd588eb 113void inet_frag_destroy(struct inet_frag_queue *q, struct inet_frags *f);
ac18e750 114struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
ab1c724f
FW
115 struct inet_frags *f, void *key, unsigned int hash);
116
5a3da1fe
HFS
117void inet_frag_maybe_warn_overflow(struct inet_frag_queue *q,
118 const char *prefix);
277e650d 119
762cc408
PE
120static inline void inet_frag_put(struct inet_frag_queue *q, struct inet_frags *f)
121{
edcb6918 122 if (refcount_dec_and_test(&q->refcnt))
3fd588eb 123 inet_frag_destroy(q, f);
762cc408
PE
124}
125
caaecdd3
NA
126static inline bool inet_frag_evicting(struct inet_frag_queue *q)
127{
128 return !hlist_unhashed(&q->list_evictor);
129}
130
d433673e
JDB
131/* Memory Tracking Functions. */
132
133static inline int frag_mem_limit(struct netns_frags *nf)
134{
62091efb 135 return atomic_read(&nf->mem);
d433673e
JDB
136}
137
0e60d245 138static inline void sub_frag_mem_limit(struct netns_frags *nf, int i)
d433673e 139{
62091efb 140 atomic_sub(i, &nf->mem);
d433673e
JDB
141}
142
0e60d245 143static inline void add_frag_mem_limit(struct netns_frags *nf, int i)
d433673e 144{
62091efb 145 atomic_add(i, &nf->mem);
d433673e
JDB
146}
147
62091efb 148static inline int sum_frag_mem_limit(struct netns_frags *nf)
d433673e 149{
62091efb 150 return atomic_read(&nf->mem);
d433673e
JDB
151}
152
be991971
HFS
153/* RFC 3168 support :
154 * We want to check ECN values of all fragments, do detect invalid combinations.
155 * In ipq->ecn, we store the OR value of each ip4_frag_ecn() fragment value.
156 */
157#define IPFRAG_ECN_NOT_ECT 0x01 /* one frag had ECN_NOT_ECT */
158#define IPFRAG_ECN_ECT_1 0x02 /* one frag had ECN_ECT_1 */
159#define IPFRAG_ECN_ECT_0 0x04 /* one frag had ECN_ECT_0 */
160#define IPFRAG_ECN_CE 0x08 /* one frag had ECN_CE */
161
162extern const u8 ip_frag_ecn_table[16];
163
5ab11c98 164#endif