blob: bfcbc0017950372ddd39dd540ff3f6da99f2bee6 [file] [log] [blame]
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -07001#ifndef __NET_FRAG_H__
2#define __NET_FRAG_H__
3
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +00004#include <linux/percpu_counter.h>
5
Pavel Emelyanovac18e752008-01-22 06:02:14 -08006struct netns_frags {
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -08007 int nqueues;
Pavel Emelyanov3140c252008-01-22 06:11:48 -08008 struct list_head lru_list;
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +00009 spinlock_t lru_lock;
Pavel Emelyanovb2fd5322008-01-22 06:09:37 -080010
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +000011 /* The percpu_counter "mem" need to be cacheline aligned.
12 * mem.count must not share cacheline with other writers
Jesper Dangaard Brouercd39a782013-01-28 23:44:14 +000013 */
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +000014 struct percpu_counter mem ____cacheline_aligned_in_smp;
15
Pavel Emelyanovb2fd5322008-01-22 06:09:37 -080016 /* sysctls */
17 int timeout;
Pavel Emelyanove31e0bdc72008-01-22 06:10:13 -080018 int high_thresh;
19 int low_thresh;
Pavel Emelyanovac18e752008-01-22 06:02:14 -080020};
21
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070022struct inet_frag_queue {
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070023 spinlock_t lock;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070024 struct timer_list timer; /* when will this queue expire? */
Jesper Dangaard Brouer6e34a8b2013-01-28 23:44:49 +000025 struct list_head lru_list; /* lru list member */
26 struct hlist_node list;
27 atomic_t refcnt;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070028 struct sk_buff *fragments; /* list of received fragments */
Changli Gaod6bebca2010-06-29 04:39:37 +000029 struct sk_buff *fragments_tail;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070030 ktime_t stamp;
31 int len; /* total length of orig datagram */
32 int meat;
33 __u8 last_in; /* first/last segment arrived? */
34
Joe Perchesbc578a52008-03-28 16:35:27 -070035#define INET_FRAG_COMPLETE 4
36#define INET_FRAG_FIRST_IN 2
37#define INET_FRAG_LAST_IN 1
Patrick McHardy5f2d04f2012-08-26 19:13:55 +020038
39 u16 max_size;
Jesper Dangaard Brouer6e34a8b2013-01-28 23:44:49 +000040
41 struct netns_frags *net;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070042};
43
Jesper Dangaard Brouera4c40092013-04-25 09:52:25 +000044#define INETFRAGS_HASHSZ 1024
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070045
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +000046/* averaged:
47 * max_depth = default ipfrag_high_thresh / INETFRAGS_HASHSZ /
48 * rounded up (SKB_TRUELEN(0) + sizeof(struct ipq or
49 * struct frag_queue))
50 */
51#define INETFRAGS_MAXDEPTH 128
52
Jesper Dangaard Brouer19952cc2013-04-03 23:38:16 +000053struct inet_frag_bucket {
54 struct hlist_head chain;
55 spinlock_t chain_lock;
56};
57
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070058struct inet_frags {
Jesper Dangaard Brouer19952cc2013-04-03 23:38:16 +000059 struct inet_frag_bucket hash[INETFRAGS_HASHSZ];
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000060 /* This rwlock is a global lock (seperate per IPv4, IPv6 and
61 * netfilter). Important to keep this on a seperate cacheline.
Jesper Dangaard Brouer19952cc2013-04-03 23:38:16 +000062 * Its primarily a rebuild protection rwlock.
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000063 */
64 rwlock_t lock ____cacheline_aligned_in_smp;
Pavel Emelyanov3b4bc4a2008-01-22 06:11:04 -080065 int secret_interval;
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070066 struct timer_list secret_timer;
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000067 u32 rnd;
68 int qsize;
Pavel Emelyanov321a3a92007-10-15 02:38:08 -070069
70 unsigned int (*hashfn)(struct inet_frag_queue *);
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000071 bool (*match)(struct inet_frag_queue *q, void *arg);
Pavel Emelyanovc6fda282007-10-17 19:46:47 -070072 void (*constructor)(struct inet_frag_queue *q,
73 void *arg);
Pavel Emelyanov1e4b8282007-10-15 02:39:14 -070074 void (*destructor)(struct inet_frag_queue *);
75 void (*skb_free)(struct sk_buff *);
Pavel Emelyanove521db92007-10-17 19:45:23 -070076 void (*frag_expire)(unsigned long data);
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070077};
78
79void inet_frags_init(struct inet_frags *);
80void inet_frags_fini(struct inet_frags *);
81
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -080082void inet_frags_init_net(struct netns_frags *nf);
Pavel Emelyanov81566e82008-01-22 06:12:39 -080083void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f);
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -080084
Pavel Emelyanov277e6502007-10-15 02:37:18 -070085void inet_frag_kill(struct inet_frag_queue *q, struct inet_frags *f);
Pavel Emelyanov1e4b8282007-10-15 02:39:14 -070086void inet_frag_destroy(struct inet_frag_queue *q,
87 struct inet_frags *f, int *work);
Amerigo Wang6b102862012-09-18 16:50:11 +000088int inet_frag_evictor(struct netns_frags *nf, struct inet_frags *f, bool force);
Pavel Emelyanovac18e752008-01-22 06:02:14 -080089struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
Hannes Eder56bca312009-02-25 10:32:52 +000090 struct inet_frags *f, void *key, unsigned int hash)
91 __releases(&f->lock);
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +000092void inet_frag_maybe_warn_overflow(struct inet_frag_queue *q,
93 const char *prefix);
Pavel Emelyanov277e6502007-10-15 02:37:18 -070094
Pavel Emelyanov762cc402007-10-15 02:41:56 -070095static inline void inet_frag_put(struct inet_frag_queue *q, struct inet_frags *f)
96{
97 if (atomic_dec_and_test(&q->refcnt))
98 inet_frag_destroy(q, f, NULL);
99}
100
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000101/* Memory Tracking Functions. */
102
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000103/* The default percpu_counter batch size is not big enough to scale to
104 * fragmentation mem acct sizes.
105 * The mem size of a 64K fragment is approx:
106 * (44 fragments * 2944 truesize) + frag_queue struct(200) = 129736 bytes
107 */
108static unsigned int frag_percpu_counter_batch = 130000;
109
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000110static inline int frag_mem_limit(struct netns_frags *nf)
111{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000112 return percpu_counter_read(&nf->mem);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000113}
114
115static inline void sub_frag_mem_limit(struct inet_frag_queue *q, int i)
116{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000117 __percpu_counter_add(&q->net->mem, -i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000118}
119
120static inline void add_frag_mem_limit(struct inet_frag_queue *q, int i)
121{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000122 __percpu_counter_add(&q->net->mem, i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000123}
124
125static inline void init_frag_mem_limit(struct netns_frags *nf)
126{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000127 percpu_counter_init(&nf->mem, 0);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000128}
129
130static inline int sum_frag_mem_limit(struct netns_frags *nf)
131{
Eric Dumazet4cfb0482013-02-22 07:43:35 +0000132 int res;
133
134 local_bh_disable();
135 res = percpu_counter_sum_positive(&nf->mem);
136 local_bh_enable();
137
138 return res;
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000139}
140
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +0000141static inline void inet_frag_lru_move(struct inet_frag_queue *q)
142{
143 spin_lock(&q->net->lru_lock);
Konstantin Khlebnikovb56141a2013-05-05 04:56:22 +0000144 if (!list_empty(&q->lru_list))
145 list_move_tail(&q->lru_list, &q->net->lru_list);
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +0000146 spin_unlock(&q->net->lru_lock);
147}
148
149static inline void inet_frag_lru_del(struct inet_frag_queue *q)
150{
151 spin_lock(&q->net->lru_lock);
Konstantin Khlebnikovb56141a2013-05-05 04:56:22 +0000152 list_del_init(&q->lru_list);
Jesper Dangaard Brouer1b5ab0d2013-03-27 05:55:56 +0000153 q->net->nqueues--;
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +0000154 spin_unlock(&q->net->lru_lock);
155}
156
157static inline void inet_frag_lru_add(struct netns_frags *nf,
158 struct inet_frag_queue *q)
159{
160 spin_lock(&nf->lru_lock);
161 list_add_tail(&q->lru_list, &nf->lru_list);
Jesper Dangaard Brouer1b5ab0d2013-03-27 05:55:56 +0000162 q->net->nqueues++;
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +0000163 spin_unlock(&nf->lru_lock);
164}
Hannes Frederic Sowabe991972013-03-22 08:24:37 +0000165
166/* RFC 3168 support :
167 * We want to check ECN values of all fragments, do detect invalid combinations.
168 * In ipq->ecn, we store the OR value of each ip4_frag_ecn() fragment value.
169 */
170#define IPFRAG_ECN_NOT_ECT 0x01 /* one frag had ECN_NOT_ECT */
171#define IPFRAG_ECN_ECT_1 0x02 /* one frag had ECN_ECT_1 */
172#define IPFRAG_ECN_ECT_0 0x04 /* one frag had ECN_ECT_0 */
173#define IPFRAG_ECN_CE 0x08 /* one frag had ECN_CE */
174
175extern const u8 ip_frag_ecn_table[16];
176
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -0700177#endif