blob: 0a1dcc2fa2f58c5be1f177f579fa4fa57c138dfd [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
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070044#define INETFRAGS_HASHSZ 64
45
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
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070053struct inet_frags {
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070054 struct hlist_head hash[INETFRAGS_HASHSZ];
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000055 /* This rwlock is a global lock (seperate per IPv4, IPv6 and
56 * netfilter). Important to keep this on a seperate cacheline.
57 */
58 rwlock_t lock ____cacheline_aligned_in_smp;
Pavel Emelyanov3b4bc4a2008-01-22 06:11:04 -080059 int secret_interval;
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070060 struct timer_list secret_timer;
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000061 u32 rnd;
62 int qsize;
Pavel Emelyanov321a3a92007-10-15 02:38:08 -070063
64 unsigned int (*hashfn)(struct inet_frag_queue *);
Jesper Dangaard Brouer5f8e1e82013-01-28 23:44:37 +000065 bool (*match)(struct inet_frag_queue *q, void *arg);
Pavel Emelyanovc6fda282007-10-17 19:46:47 -070066 void (*constructor)(struct inet_frag_queue *q,
67 void *arg);
Pavel Emelyanov1e4b8282007-10-15 02:39:14 -070068 void (*destructor)(struct inet_frag_queue *);
69 void (*skb_free)(struct sk_buff *);
Pavel Emelyanove521db92007-10-17 19:45:23 -070070 void (*frag_expire)(unsigned long data);
Pavel Emelyanov7eb95152007-10-15 02:31:52 -070071};
72
73void inet_frags_init(struct inet_frags *);
74void inet_frags_fini(struct inet_frags *);
75
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -080076void inet_frags_init_net(struct netns_frags *nf);
Pavel Emelyanov81566e82008-01-22 06:12:39 -080077void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f);
Pavel Emelyanove5a2bb82008-01-22 06:06:23 -080078
Pavel Emelyanov277e6502007-10-15 02:37:18 -070079void inet_frag_kill(struct inet_frag_queue *q, struct inet_frags *f);
Pavel Emelyanov1e4b8282007-10-15 02:39:14 -070080void inet_frag_destroy(struct inet_frag_queue *q,
81 struct inet_frags *f, int *work);
Amerigo Wang6b102862012-09-18 16:50:11 +000082int inet_frag_evictor(struct netns_frags *nf, struct inet_frags *f, bool force);
Pavel Emelyanovac18e752008-01-22 06:02:14 -080083struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
Hannes Eder56bca312009-02-25 10:32:52 +000084 struct inet_frags *f, void *key, unsigned int hash)
85 __releases(&f->lock);
Hannes Frederic Sowa5a3da1f2013-03-15 11:32:30 +000086void inet_frag_maybe_warn_overflow(struct inet_frag_queue *q,
87 const char *prefix);
Pavel Emelyanov277e6502007-10-15 02:37:18 -070088
Pavel Emelyanov762cc402007-10-15 02:41:56 -070089static inline void inet_frag_put(struct inet_frag_queue *q, struct inet_frags *f)
90{
91 if (atomic_dec_and_test(&q->refcnt))
92 inet_frag_destroy(q, f, NULL);
93}
94
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +000095/* Memory Tracking Functions. */
96
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +000097/* The default percpu_counter batch size is not big enough to scale to
98 * fragmentation mem acct sizes.
99 * The mem size of a 64K fragment is approx:
100 * (44 fragments * 2944 truesize) + frag_queue struct(200) = 129736 bytes
101 */
102static unsigned int frag_percpu_counter_batch = 130000;
103
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000104static inline int frag_mem_limit(struct netns_frags *nf)
105{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000106 return percpu_counter_read(&nf->mem);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000107}
108
109static inline void sub_frag_mem_limit(struct inet_frag_queue *q, int i)
110{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000111 __percpu_counter_add(&q->net->mem, -i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000112}
113
114static inline void add_frag_mem_limit(struct inet_frag_queue *q, int i)
115{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000116 __percpu_counter_add(&q->net->mem, i, frag_percpu_counter_batch);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000117}
118
119static inline void init_frag_mem_limit(struct netns_frags *nf)
120{
Jesper Dangaard Brouer6d7b8572013-01-28 23:45:33 +0000121 percpu_counter_init(&nf->mem, 0);
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000122}
123
124static inline int sum_frag_mem_limit(struct netns_frags *nf)
125{
Eric Dumazet4cfb0482013-02-22 07:43:35 +0000126 int res;
127
128 local_bh_disable();
129 res = percpu_counter_sum_positive(&nf->mem);
130 local_bh_enable();
131
132 return res;
Jesper Dangaard Brouerd4336732013-01-28 23:45:12 +0000133}
134
Jesper Dangaard Brouer3ef0eb02013-01-28 23:45:51 +0000135static inline void inet_frag_lru_move(struct inet_frag_queue *q)
136{
137 spin_lock(&q->net->lru_lock);
138 list_move_tail(&q->lru_list, &q->net->lru_list);
139 spin_unlock(&q->net->lru_lock);
140}
141
142static inline void inet_frag_lru_del(struct inet_frag_queue *q)
143{
144 spin_lock(&q->net->lru_lock);
145 list_del(&q->lru_list);
146 spin_unlock(&q->net->lru_lock);
147}
148
149static inline void inet_frag_lru_add(struct netns_frags *nf,
150 struct inet_frag_queue *q)
151{
152 spin_lock(&nf->lru_lock);
153 list_add_tail(&q->lru_list, &nf->lru_list);
154 spin_unlock(&nf->lru_lock);
155}
Pavel Emelyanov5ab11c92007-10-15 02:24:19 -0700156#endif