blob: 12aac0fd6ee7cd9d5963d69a606ebbc5b9981b26 [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 {
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +00007 /* The percpu_counter "mem" need to be cacheline aligned.
8 * mem.count must not share cacheline with other writers
Jesper Dangaard Brouercd39a782013-01-28 23:44:14 +00009 */
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +000010 struct percpu_counter mem ____cacheline_aligned_in_smp;
11
Pavel Emelyanovb2fd5322008-01-22 06:09:37 -080012 /* sysctls */
13 int timeout;
Pavel Emelyanove31e0bdc72008-01-22 06:10:13 -080014 int high_thresh;
15 int low_thresh;
Pavel Emelyanovac18e752008-01-22 06:02:14 -080016};
17
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020018/**
19 * fragment queue flags
20 *
21 * @INET_FRAG_FIRST_IN: first fragment has arrived
22 * @INET_FRAG_LAST_IN: final fragment has arrived
23 * @INET_FRAG_COMPLETE: frag queue has been processed and is due for destruction
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020024 */
25enum {
26 INET_FRAG_FIRST_IN = BIT(0),
27 INET_FRAG_LAST_IN = BIT(1),
28 INET_FRAG_COMPLETE = BIT(2),
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020029};
30
31/**
32 * struct inet_frag_queue - fragment queue
33 *
34 * @lock: spinlock protecting the queue
35 * @timer: queue expiration timer
36 * @list: hash bucket list
37 * @refcnt: reference count of the queue
38 * @fragments: received fragments head
39 * @fragments_tail: received fragments tail
40 * @stamp: timestamp of the last received fragment
41 * @len: total length of the original datagram
42 * @meat: length of received fragments so far
43 * @flags: fragment queue flags
Florian Westphald6b915e2015-05-22 16:32:51 +020044 * @max_size: maximum received fragment size
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020045 * @net: namespace that this frag belongs to
Florian Westphald1fe1942015-07-23 12:05:37 +020046 * @list_evictor: list of queues to forcefully evict (e.g. due to low memory)
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020047 */
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070048struct inet_frag_queue {
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070049 spinlock_t lock;
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020050 struct timer_list timer;
Jesper Dangaard Brouer6e34a8b2013-01-28 23:44:49 +000051 struct hlist_node list;
52 atomic_t refcnt;
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020053 struct sk_buff *fragments;
Changli Gaod6bebca2010-06-29 04:39:37 +000054 struct sk_buff *fragments_tail;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070055 ktime_t stamp;
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020056 int len;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070057 int meat;
Nikolay Aleksandrov1ab19342014-08-01 12:29:45 +020058 __u8 flags;
Patrick McHardy5f2d04f2012-08-26 19:13:55 +020059 u16 max_size;
Jesper Dangaard Brouer6e34a8b2013-01-28 23:44:49 +000060 struct netns_frags *net;
Florian Westphald1fe1942015-07-23 12:05:37 +020061 struct hlist_node list_evictor;
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -070062};
63
Jesper Dangaard Brouera4c40092013-04-25 09:52:25 +000064#define INETFRAGS_HASHSZ 1024
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070065
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +000066/* averaged:
67 * max_depth = default ipfrag_high_thresh / INETFRAGS_HASHSZ /
68 * rounded up (SKB_TRUELEN(0) + sizeof(struct ipq or
69 * struct frag_queue))
70 */
Florian Westphalb13d3cb2014-07-24 16:50:32 +020071#define INETFRAGS_MAXDEPTH 128
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +000072
Jesper Dangaard Brouer19952cc42013-04-03 23:38:16 +000073struct inet_frag_bucket {
74 struct hlist_head chain;
75 spinlock_t chain_lock;
76};
77
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070078struct inet_frags {
Jesper Dangaard Brouer19952cc42013-04-03 23:38:16 +000079 struct inet_frag_bucket hash[INETFRAGS_HASHSZ];
Hannes Frederic Sowa7088ad72013-10-23 11:06:57 +020080
Florian Westphalb13d3cb2014-07-24 16:50:32 +020081 struct work_struct frags_work;
82 unsigned int next_bucket;
Florian Westphale3a57d12014-07-24 16:50:35 +020083 unsigned long last_rebuild_jiffies;
84 bool rebuild;
Florian Westphalb13d3cb2014-07-24 16:50:32 +020085
Hannes Frederic Sowa7088ad72013-10-23 11:06:57 +020086 /* The first call to hashfn is responsible to initialize
87 * rnd. This is best done with net_get_random_once.
Florian Westphalab1c7242014-07-24 16:50:36 +020088 *
89 * rnd_seqlock is used to let hash insertion detect
90 * when it needs to re-lookup the hash chain to use.
Hannes Frederic Sowa7088ad72013-10-23 11:06:57 +020091 */
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000092 u32 rnd;
Florian Westphalab1c7242014-07-24 16:50:36 +020093 seqlock_t rnd_seqlock;
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000094 int qsize;
Pavel Emelyanov321a3a92007-10-15 02:38:08 -070095
Florian Westphal36c77782014-07-24 16:50:29 +020096 unsigned int (*hashfn)(const struct inet_frag_queue *);
97 bool (*match)(const struct inet_frag_queue *q,
98 const void *arg);
Pavel Emelyanovc6fda282007-10-17 19:46:47 -070099 void (*constructor)(struct inet_frag_queue *q,
Florian Westphal36c77782014-07-24 16:50:29 +0200100 const void *arg);
Pavel Emelyanov1e4b8282007-10-15 02:39:14 -0700101 void (*destructor)(struct inet_frag_queue *);
Pavel Emelyanove521db92007-10-17 19:45:23 -0700102 void (*frag_expire)(unsigned long data);
Nikolay Aleksandrovd4ad4d22014-08-01 12:29:48 +0200103 struct kmem_cache *frags_cachep;
104 const char *frags_cache_name;
Pavel Emelyanov7eb95152007-10-15 02:31:52 -0700105};
106
Nikolay Aleksandrovd4ad4d22014-08-01 12:29:48 +0200107int inet_frags_init(struct inet_frags *);
Pavel Emelyanov7eb95152007-10-15 02:31:52 -0700108void inet_frags_fini(struct inet_frags *);
109
Eric Dumazet1d6119b2015-11-02 09:03:11 -0800110static inline int inet_frags_init_net(struct netns_frags *nf)
111{
112 return percpu_counter_init(&nf->mem, 0, GFP_KERNEL);
113}
114static inline void inet_frags_uninit_net(struct netns_frags *nf)
115{
116 percpu_counter_destroy(&nf->mem);
117}
118
Pavel Emelyanov81566e82008-01-22 06:12:39 -0800119void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f);
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -0800120
Pavel Emelyanov277e6502007-10-15 02:37:18 -0700121void inet_frag_kill(struct inet_frag_queue *q, struct inet_frags *f);
Florian Westphal3fd588e2014-07-24 16:50:34 +0200122void inet_frag_destroy(struct inet_frag_queue *q, struct inet_frags *f);
Pavel Emelyanovac18e752008-01-22 06:02:14 -0800123struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
Florian Westphalab1c7242014-07-24 16:50:36 +0200124 struct inet_frags *f, void *key, unsigned int hash);
125
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +0000126void inet_frag_maybe_warn_overflow(struct inet_frag_queue *q,
127 const char *prefix);
Pavel Emelyanov277e6502007-10-15 02:37:18 -0700128
Pavel Emelyanov762cc402007-10-15 02:41:56 -0700129static inline void inet_frag_put(struct inet_frag_queue *q, struct inet_frags *f)
130{
131 if (atomic_dec_and_test(&q->refcnt))
Florian Westphal3fd588e2014-07-24 16:50:34 +0200132 inet_frag_destroy(q, f);
Pavel Emelyanov762cc402007-10-15 02:41:56 -0700133}
134
Nikolay Aleksandrovcaaecdd2015-07-23 12:05:40 +0200135static inline bool inet_frag_evicting(struct inet_frag_queue *q)
136{
137 return !hlist_unhashed(&q->list_evictor);
138}
139
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000140/* Memory Tracking Functions. */
141
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000142/* The default percpu_counter batch size is not big enough to scale to
143 * fragmentation mem acct sizes.
144 * The mem size of a 64K fragment is approx:
145 * (44 fragments * 2944 truesize) + frag_queue struct(200) = 129736 bytes
146 */
147static unsigned int frag_percpu_counter_batch = 130000;
148
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000149static inline int frag_mem_limit(struct netns_frags *nf)
150{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000151 return percpu_counter_read(&nf->mem);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000152}
153
Florian Westphal0e60d242015-07-23 12:05:38 +0200154static inline void sub_frag_mem_limit(struct netns_frags *nf, int i)
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000155{
Florian Westphal0e60d242015-07-23 12:05:38 +0200156 __percpu_counter_add(&nf->mem, -i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000157}
158
Florian Westphal0e60d242015-07-23 12:05:38 +0200159static inline void add_frag_mem_limit(struct netns_frags *nf, int i)
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000160{
Florian Westphal0e60d242015-07-23 12:05:38 +0200161 __percpu_counter_add(&nf->mem, i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000162}
163
Florian Westphal36c77782014-07-24 16:50:29 +0200164static inline unsigned int sum_frag_mem_limit(struct netns_frags *nf)
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000165{
Florian Westphal36c77782014-07-24 16:50:29 +0200166 unsigned int res;
Eric Dumazet4cfb0482013-02-22 07:43:35 +0000167
168 local_bh_disable();
169 res = percpu_counter_sum_positive(&nf->mem);
170 local_bh_enable();
171
172 return res;
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000173}
174
Hannes Frederic Sowabe991972013-03-22 08:24:37 +0000175/* RFC 3168 support :
176 * We want to check ECN values of all fragments, do detect invalid combinations.
177 * In ipq->ecn, we store the OR value of each ip4_frag_ecn() fragment value.
178 */
179#define IPFRAG_ECN_NOT_ECT 0x01 /* one frag had ECN_NOT_ECT */
180#define IPFRAG_ECN_ECT_1 0x02 /* one frag had ECN_ECT_1 */
181#define IPFRAG_ECN_ECT_0 0x04 /* one frag had ECN_ECT_0 */
182#define IPFRAG_ECN_CE 0x08 /* one frag had ECN_CE */
183
184extern const u8 ip_frag_ecn_table[16];
185
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -0700186#endif