Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 1 | /* |
| 2 | * IPv6 fragment reassembly for connection tracking |
| 3 | * |
| 4 | * Copyright (C)2004 USAGI/WIDE Project |
| 5 | * |
| 6 | * Author: |
| 7 | * Yasuyuki Kozakai @USAGI <yasuyuki.kozakai@toshiba.co.jp> |
| 8 | * |
| 9 | * Based on: net/ipv6/reassembly.c |
| 10 | * |
| 11 | * This program is free software; you can redistribute it and/or |
| 12 | * modify it under the terms of the GNU General Public License |
| 13 | * as published by the Free Software Foundation; either version |
| 14 | * 2 of the License, or (at your option) any later version. |
| 15 | */ |
| 16 | |
| 17 | #include <linux/config.h> |
| 18 | #include <linux/errno.h> |
| 19 | #include <linux/types.h> |
| 20 | #include <linux/string.h> |
| 21 | #include <linux/socket.h> |
| 22 | #include <linux/sockios.h> |
| 23 | #include <linux/jiffies.h> |
| 24 | #include <linux/net.h> |
| 25 | #include <linux/list.h> |
| 26 | #include <linux/netdevice.h> |
| 27 | #include <linux/in6.h> |
| 28 | #include <linux/ipv6.h> |
| 29 | #include <linux/icmpv6.h> |
| 30 | #include <linux/random.h> |
| 31 | #include <linux/jhash.h> |
| 32 | |
| 33 | #include <net/sock.h> |
| 34 | #include <net/snmp.h> |
| 35 | |
| 36 | #include <net/ipv6.h> |
| 37 | #include <net/protocol.h> |
| 38 | #include <net/transp_v6.h> |
| 39 | #include <net/rawv6.h> |
| 40 | #include <net/ndisc.h> |
| 41 | #include <net/addrconf.h> |
| 42 | #include <linux/sysctl.h> |
| 43 | #include <linux/netfilter.h> |
| 44 | #include <linux/netfilter_ipv6.h> |
| 45 | #include <linux/kernel.h> |
| 46 | #include <linux/module.h> |
| 47 | |
| 48 | #if 0 |
| 49 | #define DEBUGP printk |
| 50 | #else |
| 51 | #define DEBUGP(format, args...) |
| 52 | #endif |
| 53 | |
| 54 | #define NF_CT_FRAG6_HIGH_THRESH 262144 /* == 256*1024 */ |
| 55 | #define NF_CT_FRAG6_LOW_THRESH 196608 /* == 192*1024 */ |
| 56 | #define NF_CT_FRAG6_TIMEOUT IPV6_FRAG_TIMEOUT |
| 57 | |
Yasuyuki Kozakai | 7686a02 | 2005-11-14 15:27:43 -0800 | [diff] [blame] | 58 | unsigned int nf_ct_frag6_high_thresh = 256*1024; |
| 59 | unsigned int nf_ct_frag6_low_thresh = 192*1024; |
| 60 | unsigned long nf_ct_frag6_timeout = IPV6_FRAG_TIMEOUT; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 61 | |
| 62 | struct nf_ct_frag6_skb_cb |
| 63 | { |
| 64 | struct inet6_skb_parm h; |
| 65 | int offset; |
| 66 | struct sk_buff *orig; |
| 67 | }; |
| 68 | |
| 69 | #define NFCT_FRAG6_CB(skb) ((struct nf_ct_frag6_skb_cb*)((skb)->cb)) |
| 70 | |
| 71 | struct nf_ct_frag6_queue |
| 72 | { |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 73 | struct hlist_node list; |
| 74 | struct list_head lru_list; /* lru list member */ |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 75 | |
| 76 | __u32 id; /* fragment id */ |
| 77 | struct in6_addr saddr; |
| 78 | struct in6_addr daddr; |
| 79 | |
| 80 | spinlock_t lock; |
| 81 | atomic_t refcnt; |
| 82 | struct timer_list timer; /* expire timer */ |
| 83 | struct sk_buff *fragments; |
| 84 | int len; |
| 85 | int meat; |
| 86 | struct timeval stamp; |
| 87 | unsigned int csum; |
| 88 | __u8 last_in; /* has first/last segment arrived? */ |
| 89 | #define COMPLETE 4 |
| 90 | #define FIRST_IN 2 |
| 91 | #define LAST_IN 1 |
| 92 | __u16 nhoffset; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 93 | }; |
| 94 | |
| 95 | /* Hash table. */ |
| 96 | |
| 97 | #define FRAG6Q_HASHSZ 64 |
| 98 | |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 99 | static struct hlist_head nf_ct_frag6_hash[FRAG6Q_HASHSZ]; |
YOSHIFUJI Hideaki | 181a46a | 2006-01-04 13:56:54 -0800 | [diff] [blame] | 100 | static DEFINE_RWLOCK(nf_ct_frag6_lock); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 101 | static u32 nf_ct_frag6_hash_rnd; |
| 102 | static LIST_HEAD(nf_ct_frag6_lru_list); |
| 103 | int nf_ct_frag6_nqueues = 0; |
| 104 | |
| 105 | static __inline__ void __fq_unlink(struct nf_ct_frag6_queue *fq) |
| 106 | { |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 107 | hlist_del(&fq->list); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 108 | list_del(&fq->lru_list); |
| 109 | nf_ct_frag6_nqueues--; |
| 110 | } |
| 111 | |
| 112 | static __inline__ void fq_unlink(struct nf_ct_frag6_queue *fq) |
| 113 | { |
| 114 | write_lock(&nf_ct_frag6_lock); |
| 115 | __fq_unlink(fq); |
| 116 | write_unlock(&nf_ct_frag6_lock); |
| 117 | } |
| 118 | |
| 119 | static unsigned int ip6qhashfn(u32 id, struct in6_addr *saddr, |
| 120 | struct in6_addr *daddr) |
| 121 | { |
| 122 | u32 a, b, c; |
| 123 | |
| 124 | a = saddr->s6_addr32[0]; |
| 125 | b = saddr->s6_addr32[1]; |
| 126 | c = saddr->s6_addr32[2]; |
| 127 | |
| 128 | a += JHASH_GOLDEN_RATIO; |
| 129 | b += JHASH_GOLDEN_RATIO; |
| 130 | c += nf_ct_frag6_hash_rnd; |
| 131 | __jhash_mix(a, b, c); |
| 132 | |
| 133 | a += saddr->s6_addr32[3]; |
| 134 | b += daddr->s6_addr32[0]; |
| 135 | c += daddr->s6_addr32[1]; |
| 136 | __jhash_mix(a, b, c); |
| 137 | |
| 138 | a += daddr->s6_addr32[2]; |
| 139 | b += daddr->s6_addr32[3]; |
| 140 | c += id; |
| 141 | __jhash_mix(a, b, c); |
| 142 | |
| 143 | return c & (FRAG6Q_HASHSZ - 1); |
| 144 | } |
| 145 | |
| 146 | static struct timer_list nf_ct_frag6_secret_timer; |
| 147 | int nf_ct_frag6_secret_interval = 10 * 60 * HZ; |
| 148 | |
| 149 | static void nf_ct_frag6_secret_rebuild(unsigned long dummy) |
| 150 | { |
| 151 | unsigned long now = jiffies; |
| 152 | int i; |
| 153 | |
| 154 | write_lock(&nf_ct_frag6_lock); |
| 155 | get_random_bytes(&nf_ct_frag6_hash_rnd, sizeof(u32)); |
| 156 | for (i = 0; i < FRAG6Q_HASHSZ; i++) { |
| 157 | struct nf_ct_frag6_queue *q; |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 158 | struct hlist_node *p, *n; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 159 | |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 160 | hlist_for_each_entry_safe(q, p, n, &nf_ct_frag6_hash[i], list) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 161 | unsigned int hval = ip6qhashfn(q->id, |
| 162 | &q->saddr, |
| 163 | &q->daddr); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 164 | if (hval != i) { |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 165 | hlist_del(&q->list); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 166 | /* Relink to new hash chain. */ |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 167 | hlist_add_head(&q->list, |
| 168 | &nf_ct_frag6_hash[hval]); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 169 | } |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 170 | } |
| 171 | } |
| 172 | write_unlock(&nf_ct_frag6_lock); |
| 173 | |
| 174 | mod_timer(&nf_ct_frag6_secret_timer, now + nf_ct_frag6_secret_interval); |
| 175 | } |
| 176 | |
| 177 | atomic_t nf_ct_frag6_mem = ATOMIC_INIT(0); |
| 178 | |
| 179 | /* Memory Tracking Functions. */ |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 180 | static inline void frag_kfree_skb(struct sk_buff *skb, unsigned int *work) |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 181 | { |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 182 | if (work) |
| 183 | *work -= skb->truesize; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 184 | atomic_sub(skb->truesize, &nf_ct_frag6_mem); |
| 185 | if (NFCT_FRAG6_CB(skb)->orig) |
| 186 | kfree_skb(NFCT_FRAG6_CB(skb)->orig); |
| 187 | |
| 188 | kfree_skb(skb); |
| 189 | } |
| 190 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 191 | static inline void frag_free_queue(struct nf_ct_frag6_queue *fq, |
| 192 | unsigned int *work) |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 193 | { |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 194 | if (work) |
| 195 | *work -= sizeof(struct nf_ct_frag6_queue); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 196 | atomic_sub(sizeof(struct nf_ct_frag6_queue), &nf_ct_frag6_mem); |
| 197 | kfree(fq); |
| 198 | } |
| 199 | |
| 200 | static inline struct nf_ct_frag6_queue *frag_alloc_queue(void) |
| 201 | { |
| 202 | struct nf_ct_frag6_queue *fq = kmalloc(sizeof(struct nf_ct_frag6_queue), GFP_ATOMIC); |
| 203 | |
| 204 | if (!fq) |
| 205 | return NULL; |
| 206 | atomic_add(sizeof(struct nf_ct_frag6_queue), &nf_ct_frag6_mem); |
| 207 | return fq; |
| 208 | } |
| 209 | |
| 210 | /* Destruction primitives. */ |
| 211 | |
| 212 | /* Complete destruction of fq. */ |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 213 | static void nf_ct_frag6_destroy(struct nf_ct_frag6_queue *fq, |
| 214 | unsigned int *work) |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 215 | { |
| 216 | struct sk_buff *fp; |
| 217 | |
| 218 | BUG_TRAP(fq->last_in&COMPLETE); |
| 219 | BUG_TRAP(del_timer(&fq->timer) == 0); |
| 220 | |
| 221 | /* Release all fragment data. */ |
| 222 | fp = fq->fragments; |
| 223 | while (fp) { |
| 224 | struct sk_buff *xp = fp->next; |
| 225 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 226 | frag_kfree_skb(fp, work); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 227 | fp = xp; |
| 228 | } |
| 229 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 230 | frag_free_queue(fq, work); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 231 | } |
| 232 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 233 | static __inline__ void fq_put(struct nf_ct_frag6_queue *fq, unsigned int *work) |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 234 | { |
| 235 | if (atomic_dec_and_test(&fq->refcnt)) |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 236 | nf_ct_frag6_destroy(fq, work); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 237 | } |
| 238 | |
| 239 | /* Kill fq entry. It is not destroyed immediately, |
| 240 | * because caller (and someone more) holds reference count. |
| 241 | */ |
| 242 | static __inline__ void fq_kill(struct nf_ct_frag6_queue *fq) |
| 243 | { |
| 244 | if (del_timer(&fq->timer)) |
| 245 | atomic_dec(&fq->refcnt); |
| 246 | |
| 247 | if (!(fq->last_in & COMPLETE)) { |
| 248 | fq_unlink(fq); |
| 249 | atomic_dec(&fq->refcnt); |
| 250 | fq->last_in |= COMPLETE; |
| 251 | } |
| 252 | } |
| 253 | |
| 254 | static void nf_ct_frag6_evictor(void) |
| 255 | { |
| 256 | struct nf_ct_frag6_queue *fq; |
| 257 | struct list_head *tmp; |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 258 | unsigned int work; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 259 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 260 | work = atomic_read(&nf_ct_frag6_mem); |
| 261 | if (work <= nf_ct_frag6_low_thresh) |
| 262 | return; |
| 263 | |
| 264 | work -= nf_ct_frag6_low_thresh; |
| 265 | while (work > 0) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 266 | read_lock(&nf_ct_frag6_lock); |
| 267 | if (list_empty(&nf_ct_frag6_lru_list)) { |
| 268 | read_unlock(&nf_ct_frag6_lock); |
| 269 | return; |
| 270 | } |
| 271 | tmp = nf_ct_frag6_lru_list.next; |
Yasuyuki Kozakai | 302fe17 | 2005-11-14 15:28:45 -0800 | [diff] [blame] | 272 | BUG_ON(tmp == NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 273 | fq = list_entry(tmp, struct nf_ct_frag6_queue, lru_list); |
| 274 | atomic_inc(&fq->refcnt); |
| 275 | read_unlock(&nf_ct_frag6_lock); |
| 276 | |
| 277 | spin_lock(&fq->lock); |
| 278 | if (!(fq->last_in&COMPLETE)) |
| 279 | fq_kill(fq); |
| 280 | spin_unlock(&fq->lock); |
| 281 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 282 | fq_put(fq, &work); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 283 | } |
| 284 | } |
| 285 | |
| 286 | static void nf_ct_frag6_expire(unsigned long data) |
| 287 | { |
| 288 | struct nf_ct_frag6_queue *fq = (struct nf_ct_frag6_queue *) data; |
| 289 | |
| 290 | spin_lock(&fq->lock); |
| 291 | |
| 292 | if (fq->last_in & COMPLETE) |
| 293 | goto out; |
| 294 | |
| 295 | fq_kill(fq); |
| 296 | |
| 297 | out: |
| 298 | spin_unlock(&fq->lock); |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 299 | fq_put(fq, NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 300 | } |
| 301 | |
| 302 | /* Creation primitives. */ |
| 303 | |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 304 | static struct nf_ct_frag6_queue *nf_ct_frag6_intern(unsigned int hash, |
| 305 | struct nf_ct_frag6_queue *fq_in) |
| 306 | { |
| 307 | struct nf_ct_frag6_queue *fq; |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 308 | #ifdef CONFIG_SMP |
| 309 | struct hlist_node *n; |
| 310 | #endif |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 311 | |
| 312 | write_lock(&nf_ct_frag6_lock); |
| 313 | #ifdef CONFIG_SMP |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 314 | hlist_for_each_entry(fq, n, &nf_ct_frag6_hash[hash], list) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 315 | if (fq->id == fq_in->id && |
Yasuyuki Kozakai | 6ea46c9 | 2006-03-20 17:58:44 -0800 | [diff] [blame] | 316 | ipv6_addr_equal(&fq_in->saddr, &fq->saddr) && |
| 317 | ipv6_addr_equal(&fq_in->daddr, &fq->daddr)) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 318 | atomic_inc(&fq->refcnt); |
| 319 | write_unlock(&nf_ct_frag6_lock); |
| 320 | fq_in->last_in |= COMPLETE; |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 321 | fq_put(fq_in, NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 322 | return fq; |
| 323 | } |
| 324 | } |
| 325 | #endif |
| 326 | fq = fq_in; |
| 327 | |
| 328 | if (!mod_timer(&fq->timer, jiffies + nf_ct_frag6_timeout)) |
| 329 | atomic_inc(&fq->refcnt); |
| 330 | |
| 331 | atomic_inc(&fq->refcnt); |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 332 | hlist_add_head(&fq->list, &nf_ct_frag6_hash[hash]); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 333 | INIT_LIST_HEAD(&fq->lru_list); |
| 334 | list_add_tail(&fq->lru_list, &nf_ct_frag6_lru_list); |
| 335 | nf_ct_frag6_nqueues++; |
| 336 | write_unlock(&nf_ct_frag6_lock); |
| 337 | return fq; |
| 338 | } |
| 339 | |
| 340 | |
| 341 | static struct nf_ct_frag6_queue * |
| 342 | nf_ct_frag6_create(unsigned int hash, u32 id, struct in6_addr *src, struct in6_addr *dst) |
| 343 | { |
| 344 | struct nf_ct_frag6_queue *fq; |
| 345 | |
| 346 | if ((fq = frag_alloc_queue()) == NULL) { |
| 347 | DEBUGP("Can't alloc new queue\n"); |
| 348 | goto oom; |
| 349 | } |
| 350 | |
| 351 | memset(fq, 0, sizeof(struct nf_ct_frag6_queue)); |
| 352 | |
| 353 | fq->id = id; |
| 354 | ipv6_addr_copy(&fq->saddr, src); |
| 355 | ipv6_addr_copy(&fq->daddr, dst); |
| 356 | |
| 357 | init_timer(&fq->timer); |
| 358 | fq->timer.function = nf_ct_frag6_expire; |
| 359 | fq->timer.data = (long) fq; |
YOSHIFUJI Hideaki | 181a46a | 2006-01-04 13:56:54 -0800 | [diff] [blame] | 360 | spin_lock_init(&fq->lock); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 361 | atomic_set(&fq->refcnt, 1); |
| 362 | |
| 363 | return nf_ct_frag6_intern(hash, fq); |
| 364 | |
| 365 | oom: |
| 366 | return NULL; |
| 367 | } |
| 368 | |
| 369 | static __inline__ struct nf_ct_frag6_queue * |
| 370 | fq_find(u32 id, struct in6_addr *src, struct in6_addr *dst) |
| 371 | { |
| 372 | struct nf_ct_frag6_queue *fq; |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 373 | struct hlist_node *n; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 374 | unsigned int hash = ip6qhashfn(id, src, dst); |
| 375 | |
| 376 | read_lock(&nf_ct_frag6_lock); |
Harald Welte | 2e4e6a1 | 2006-01-12 13:30:04 -0800 | [diff] [blame] | 377 | hlist_for_each_entry(fq, n, &nf_ct_frag6_hash[hash], list) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 378 | if (fq->id == id && |
Yasuyuki Kozakai | 6ea46c9 | 2006-03-20 17:58:44 -0800 | [diff] [blame] | 379 | ipv6_addr_equal(src, &fq->saddr) && |
| 380 | ipv6_addr_equal(dst, &fq->daddr)) { |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 381 | atomic_inc(&fq->refcnt); |
| 382 | read_unlock(&nf_ct_frag6_lock); |
| 383 | return fq; |
| 384 | } |
| 385 | } |
| 386 | read_unlock(&nf_ct_frag6_lock); |
| 387 | |
| 388 | return nf_ct_frag6_create(hash, id, src, dst); |
| 389 | } |
| 390 | |
| 391 | |
| 392 | static int nf_ct_frag6_queue(struct nf_ct_frag6_queue *fq, struct sk_buff *skb, |
| 393 | struct frag_hdr *fhdr, int nhoff) |
| 394 | { |
| 395 | struct sk_buff *prev, *next; |
| 396 | int offset, end; |
| 397 | |
| 398 | if (fq->last_in & COMPLETE) { |
| 399 | DEBUGP("Allready completed\n"); |
| 400 | goto err; |
| 401 | } |
| 402 | |
| 403 | offset = ntohs(fhdr->frag_off) & ~0x7; |
| 404 | end = offset + (ntohs(skb->nh.ipv6h->payload_len) - |
| 405 | ((u8 *) (fhdr + 1) - (u8 *) (skb->nh.ipv6h + 1))); |
| 406 | |
| 407 | if ((unsigned int)end > IPV6_MAXPLEN) { |
| 408 | DEBUGP("offset is too large.\n"); |
| 409 | return -1; |
| 410 | } |
| 411 | |
| 412 | if (skb->ip_summed == CHECKSUM_HW) |
| 413 | skb->csum = csum_sub(skb->csum, |
| 414 | csum_partial(skb->nh.raw, |
| 415 | (u8*)(fhdr + 1) - skb->nh.raw, |
| 416 | 0)); |
| 417 | |
| 418 | /* Is this the final fragment? */ |
| 419 | if (!(fhdr->frag_off & htons(IP6_MF))) { |
| 420 | /* If we already have some bits beyond end |
| 421 | * or have different end, the segment is corrupted. |
| 422 | */ |
| 423 | if (end < fq->len || |
| 424 | ((fq->last_in & LAST_IN) && end != fq->len)) { |
| 425 | DEBUGP("already received last fragment\n"); |
| 426 | goto err; |
| 427 | } |
| 428 | fq->last_in |= LAST_IN; |
| 429 | fq->len = end; |
| 430 | } else { |
| 431 | /* Check if the fragment is rounded to 8 bytes. |
| 432 | * Required by the RFC. |
| 433 | */ |
| 434 | if (end & 0x7) { |
| 435 | /* RFC2460 says always send parameter problem in |
| 436 | * this case. -DaveM |
| 437 | */ |
| 438 | DEBUGP("the end of this fragment is not rounded to 8 bytes.\n"); |
| 439 | return -1; |
| 440 | } |
| 441 | if (end > fq->len) { |
| 442 | /* Some bits beyond end -> corruption. */ |
| 443 | if (fq->last_in & LAST_IN) { |
| 444 | DEBUGP("last packet already reached.\n"); |
| 445 | goto err; |
| 446 | } |
| 447 | fq->len = end; |
| 448 | } |
| 449 | } |
| 450 | |
| 451 | if (end == offset) |
| 452 | goto err; |
| 453 | |
| 454 | /* Point into the IP datagram 'data' part. */ |
| 455 | if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data)) { |
| 456 | DEBUGP("queue: message is too short.\n"); |
| 457 | goto err; |
| 458 | } |
Herbert Xu | b38dfee | 2006-06-09 16:13:01 -0700 | [diff] [blame] | 459 | if (pskb_trim_rcsum(skb, end - offset)) { |
| 460 | DEBUGP("Can't trim\n"); |
| 461 | goto err; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 462 | } |
| 463 | |
| 464 | /* Find out which fragments are in front and at the back of us |
| 465 | * in the chain of fragments so far. We must know where to put |
| 466 | * this fragment, right? |
| 467 | */ |
| 468 | prev = NULL; |
| 469 | for (next = fq->fragments; next != NULL; next = next->next) { |
| 470 | if (NFCT_FRAG6_CB(next)->offset >= offset) |
| 471 | break; /* bingo! */ |
| 472 | prev = next; |
| 473 | } |
| 474 | |
| 475 | /* We found where to put this one. Check for overlap with |
| 476 | * preceding fragment, and, if needed, align things so that |
| 477 | * any overlaps are eliminated. |
| 478 | */ |
| 479 | if (prev) { |
| 480 | int i = (NFCT_FRAG6_CB(prev)->offset + prev->len) - offset; |
| 481 | |
| 482 | if (i > 0) { |
| 483 | offset += i; |
| 484 | if (end <= offset) { |
| 485 | DEBUGP("overlap\n"); |
| 486 | goto err; |
| 487 | } |
| 488 | if (!pskb_pull(skb, i)) { |
| 489 | DEBUGP("Can't pull\n"); |
| 490 | goto err; |
| 491 | } |
| 492 | if (skb->ip_summed != CHECKSUM_UNNECESSARY) |
| 493 | skb->ip_summed = CHECKSUM_NONE; |
| 494 | } |
| 495 | } |
| 496 | |
| 497 | /* Look for overlap with succeeding segments. |
| 498 | * If we can merge fragments, do it. |
| 499 | */ |
| 500 | while (next && NFCT_FRAG6_CB(next)->offset < end) { |
| 501 | /* overlap is 'i' bytes */ |
| 502 | int i = end - NFCT_FRAG6_CB(next)->offset; |
| 503 | |
| 504 | if (i < next->len) { |
| 505 | /* Eat head of the next overlapped fragment |
| 506 | * and leave the loop. The next ones cannot overlap. |
| 507 | */ |
| 508 | DEBUGP("Eat head of the overlapped parts.: %d", i); |
| 509 | if (!pskb_pull(next, i)) |
| 510 | goto err; |
| 511 | |
| 512 | /* next fragment */ |
| 513 | NFCT_FRAG6_CB(next)->offset += i; |
| 514 | fq->meat -= i; |
| 515 | if (next->ip_summed != CHECKSUM_UNNECESSARY) |
| 516 | next->ip_summed = CHECKSUM_NONE; |
| 517 | break; |
| 518 | } else { |
| 519 | struct sk_buff *free_it = next; |
| 520 | |
| 521 | /* Old fragmnet is completely overridden with |
| 522 | * new one drop it. |
| 523 | */ |
| 524 | next = next->next; |
| 525 | |
| 526 | if (prev) |
| 527 | prev->next = next; |
| 528 | else |
| 529 | fq->fragments = next; |
| 530 | |
| 531 | fq->meat -= free_it->len; |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 532 | frag_kfree_skb(free_it, NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 533 | } |
| 534 | } |
| 535 | |
| 536 | NFCT_FRAG6_CB(skb)->offset = offset; |
| 537 | |
| 538 | /* Insert this fragment in the chain of fragments. */ |
| 539 | skb->next = next; |
| 540 | if (prev) |
| 541 | prev->next = skb; |
| 542 | else |
| 543 | fq->fragments = skb; |
| 544 | |
| 545 | skb->dev = NULL; |
| 546 | skb_get_timestamp(skb, &fq->stamp); |
| 547 | fq->meat += skb->len; |
| 548 | atomic_add(skb->truesize, &nf_ct_frag6_mem); |
| 549 | |
| 550 | /* The first fragment. |
| 551 | * nhoffset is obtained from the first fragment, of course. |
| 552 | */ |
| 553 | if (offset == 0) { |
| 554 | fq->nhoffset = nhoff; |
| 555 | fq->last_in |= FIRST_IN; |
| 556 | } |
| 557 | write_lock(&nf_ct_frag6_lock); |
| 558 | list_move_tail(&fq->lru_list, &nf_ct_frag6_lru_list); |
| 559 | write_unlock(&nf_ct_frag6_lock); |
| 560 | return 0; |
| 561 | |
| 562 | err: |
| 563 | return -1; |
| 564 | } |
| 565 | |
| 566 | /* |
| 567 | * Check if this packet is complete. |
| 568 | * Returns NULL on failure by any reason, and pointer |
| 569 | * to current nexthdr field in reassembled frame. |
| 570 | * |
| 571 | * It is called with locked fq, and caller must check that |
| 572 | * queue is eligible for reassembly i.e. it is not COMPLETE, |
| 573 | * the last and the first frames arrived and all the bits are here. |
| 574 | */ |
| 575 | static struct sk_buff * |
| 576 | nf_ct_frag6_reasm(struct nf_ct_frag6_queue *fq, struct net_device *dev) |
| 577 | { |
| 578 | struct sk_buff *fp, *op, *head = fq->fragments; |
| 579 | int payload_len; |
| 580 | |
| 581 | fq_kill(fq); |
| 582 | |
| 583 | BUG_TRAP(head != NULL); |
| 584 | BUG_TRAP(NFCT_FRAG6_CB(head)->offset == 0); |
| 585 | |
| 586 | /* Unfragmented part is taken from the first segment. */ |
| 587 | payload_len = (head->data - head->nh.raw) - sizeof(struct ipv6hdr) + fq->len - sizeof(struct frag_hdr); |
| 588 | if (payload_len > IPV6_MAXPLEN) { |
| 589 | DEBUGP("payload len is too large.\n"); |
| 590 | goto out_oversize; |
| 591 | } |
| 592 | |
| 593 | /* Head of list must not be cloned. */ |
| 594 | if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC)) { |
| 595 | DEBUGP("skb is cloned but can't expand head"); |
| 596 | goto out_oom; |
| 597 | } |
| 598 | |
| 599 | /* If the first fragment is fragmented itself, we split |
| 600 | * it to two chunks: the first with data and paged part |
| 601 | * and the second, holding only fragments. */ |
| 602 | if (skb_shinfo(head)->frag_list) { |
| 603 | struct sk_buff *clone; |
| 604 | int i, plen = 0; |
| 605 | |
| 606 | if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL) { |
| 607 | DEBUGP("Can't alloc skb\n"); |
| 608 | goto out_oom; |
| 609 | } |
| 610 | clone->next = head->next; |
| 611 | head->next = clone; |
| 612 | skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list; |
| 613 | skb_shinfo(head)->frag_list = NULL; |
| 614 | for (i=0; i<skb_shinfo(head)->nr_frags; i++) |
| 615 | plen += skb_shinfo(head)->frags[i].size; |
| 616 | clone->len = clone->data_len = head->data_len - plen; |
| 617 | head->data_len -= clone->len; |
| 618 | head->len -= clone->len; |
| 619 | clone->csum = 0; |
| 620 | clone->ip_summed = head->ip_summed; |
| 621 | |
| 622 | NFCT_FRAG6_CB(clone)->orig = NULL; |
| 623 | atomic_add(clone->truesize, &nf_ct_frag6_mem); |
| 624 | } |
| 625 | |
| 626 | /* We have to remove fragment header from datagram and to relocate |
| 627 | * header in order to calculate ICV correctly. */ |
| 628 | head->nh.raw[fq->nhoffset] = head->h.raw[0]; |
| 629 | memmove(head->head + sizeof(struct frag_hdr), head->head, |
| 630 | (head->data - head->head) - sizeof(struct frag_hdr)); |
| 631 | head->mac.raw += sizeof(struct frag_hdr); |
| 632 | head->nh.raw += sizeof(struct frag_hdr); |
| 633 | |
| 634 | skb_shinfo(head)->frag_list = head->next; |
| 635 | head->h.raw = head->data; |
| 636 | skb_push(head, head->data - head->nh.raw); |
| 637 | atomic_sub(head->truesize, &nf_ct_frag6_mem); |
| 638 | |
| 639 | for (fp=head->next; fp; fp = fp->next) { |
| 640 | head->data_len += fp->len; |
| 641 | head->len += fp->len; |
| 642 | if (head->ip_summed != fp->ip_summed) |
| 643 | head->ip_summed = CHECKSUM_NONE; |
| 644 | else if (head->ip_summed == CHECKSUM_HW) |
| 645 | head->csum = csum_add(head->csum, fp->csum); |
| 646 | head->truesize += fp->truesize; |
| 647 | atomic_sub(fp->truesize, &nf_ct_frag6_mem); |
| 648 | } |
| 649 | |
| 650 | head->next = NULL; |
| 651 | head->dev = dev; |
| 652 | skb_set_timestamp(head, &fq->stamp); |
| 653 | head->nh.ipv6h->payload_len = htons(payload_len); |
| 654 | |
| 655 | /* Yes, and fold redundant checksum back. 8) */ |
| 656 | if (head->ip_summed == CHECKSUM_HW) |
| 657 | head->csum = csum_partial(head->nh.raw, head->h.raw-head->nh.raw, head->csum); |
| 658 | |
| 659 | fq->fragments = NULL; |
| 660 | |
| 661 | /* all original skbs are linked into the NFCT_FRAG6_CB(head).orig */ |
| 662 | fp = skb_shinfo(head)->frag_list; |
| 663 | if (NFCT_FRAG6_CB(fp)->orig == NULL) |
| 664 | /* at above code, head skb is divided into two skbs. */ |
| 665 | fp = fp->next; |
| 666 | |
| 667 | op = NFCT_FRAG6_CB(head)->orig; |
| 668 | for (; fp; fp = fp->next) { |
| 669 | struct sk_buff *orig = NFCT_FRAG6_CB(fp)->orig; |
| 670 | |
| 671 | op->next = orig; |
| 672 | op = orig; |
| 673 | NFCT_FRAG6_CB(fp)->orig = NULL; |
| 674 | } |
| 675 | |
| 676 | return head; |
| 677 | |
| 678 | out_oversize: |
| 679 | if (net_ratelimit()) |
| 680 | printk(KERN_DEBUG "nf_ct_frag6_reasm: payload len = %d\n", payload_len); |
| 681 | goto out_fail; |
| 682 | out_oom: |
| 683 | if (net_ratelimit()) |
| 684 | printk(KERN_DEBUG "nf_ct_frag6_reasm: no memory for reassembly\n"); |
| 685 | out_fail: |
| 686 | return NULL; |
| 687 | } |
| 688 | |
| 689 | /* |
| 690 | * find the header just before Fragment Header. |
| 691 | * |
| 692 | * if success return 0 and set ... |
| 693 | * (*prevhdrp): the value of "Next Header Field" in the header |
| 694 | * just before Fragment Header. |
| 695 | * (*prevhoff): the offset of "Next Header Field" in the header |
| 696 | * just before Fragment Header. |
| 697 | * (*fhoff) : the offset of Fragment Header. |
| 698 | * |
| 699 | * Based on ipv6_skip_hdr() in net/ipv6/exthdr.c |
| 700 | * |
| 701 | */ |
| 702 | static int |
| 703 | find_prev_fhdr(struct sk_buff *skb, u8 *prevhdrp, int *prevhoff, int *fhoff) |
| 704 | { |
| 705 | u8 nexthdr = skb->nh.ipv6h->nexthdr; |
| 706 | u8 prev_nhoff = (u8 *)&skb->nh.ipv6h->nexthdr - skb->data; |
| 707 | int start = (u8 *)(skb->nh.ipv6h+1) - skb->data; |
| 708 | int len = skb->len - start; |
| 709 | u8 prevhdr = NEXTHDR_IPV6; |
| 710 | |
| 711 | while (nexthdr != NEXTHDR_FRAGMENT) { |
| 712 | struct ipv6_opt_hdr hdr; |
| 713 | int hdrlen; |
| 714 | |
| 715 | if (!ipv6_ext_hdr(nexthdr)) { |
| 716 | return -1; |
| 717 | } |
| 718 | if (len < (int)sizeof(struct ipv6_opt_hdr)) { |
| 719 | DEBUGP("too short\n"); |
| 720 | return -1; |
| 721 | } |
| 722 | if (nexthdr == NEXTHDR_NONE) { |
| 723 | DEBUGP("next header is none\n"); |
| 724 | return -1; |
| 725 | } |
| 726 | if (skb_copy_bits(skb, start, &hdr, sizeof(hdr))) |
| 727 | BUG(); |
| 728 | if (nexthdr == NEXTHDR_AUTH) |
| 729 | hdrlen = (hdr.hdrlen+2)<<2; |
| 730 | else |
| 731 | hdrlen = ipv6_optlen(&hdr); |
| 732 | |
| 733 | prevhdr = nexthdr; |
| 734 | prev_nhoff = start; |
| 735 | |
| 736 | nexthdr = hdr.nexthdr; |
| 737 | len -= hdrlen; |
| 738 | start += hdrlen; |
| 739 | } |
| 740 | |
| 741 | if (len < 0) |
| 742 | return -1; |
| 743 | |
| 744 | *prevhdrp = prevhdr; |
| 745 | *prevhoff = prev_nhoff; |
| 746 | *fhoff = start; |
| 747 | |
| 748 | return 0; |
| 749 | } |
| 750 | |
| 751 | struct sk_buff *nf_ct_frag6_gather(struct sk_buff *skb) |
| 752 | { |
| 753 | struct sk_buff *clone; |
| 754 | struct net_device *dev = skb->dev; |
| 755 | struct frag_hdr *fhdr; |
| 756 | struct nf_ct_frag6_queue *fq; |
| 757 | struct ipv6hdr *hdr; |
| 758 | int fhoff, nhoff; |
| 759 | u8 prevhdr; |
| 760 | struct sk_buff *ret_skb = NULL; |
| 761 | |
| 762 | /* Jumbo payload inhibits frag. header */ |
| 763 | if (skb->nh.ipv6h->payload_len == 0) { |
| 764 | DEBUGP("payload len = 0\n"); |
| 765 | return skb; |
| 766 | } |
| 767 | |
| 768 | if (find_prev_fhdr(skb, &prevhdr, &nhoff, &fhoff) < 0) |
| 769 | return skb; |
| 770 | |
| 771 | clone = skb_clone(skb, GFP_ATOMIC); |
| 772 | if (clone == NULL) { |
| 773 | DEBUGP("Can't clone skb\n"); |
| 774 | return skb; |
| 775 | } |
| 776 | |
| 777 | NFCT_FRAG6_CB(clone)->orig = skb; |
| 778 | |
| 779 | if (!pskb_may_pull(clone, fhoff + sizeof(*fhdr))) { |
| 780 | DEBUGP("message is too short.\n"); |
| 781 | goto ret_orig; |
| 782 | } |
| 783 | |
| 784 | clone->h.raw = clone->data + fhoff; |
| 785 | hdr = clone->nh.ipv6h; |
| 786 | fhdr = (struct frag_hdr *)clone->h.raw; |
| 787 | |
| 788 | if (!(fhdr->frag_off & htons(0xFFF9))) { |
| 789 | DEBUGP("Invalid fragment offset\n"); |
| 790 | /* It is not a fragmented frame */ |
| 791 | goto ret_orig; |
| 792 | } |
| 793 | |
| 794 | if (atomic_read(&nf_ct_frag6_mem) > nf_ct_frag6_high_thresh) |
| 795 | nf_ct_frag6_evictor(); |
| 796 | |
| 797 | fq = fq_find(fhdr->identification, &hdr->saddr, &hdr->daddr); |
| 798 | if (fq == NULL) { |
| 799 | DEBUGP("Can't find and can't create new queue\n"); |
| 800 | goto ret_orig; |
| 801 | } |
| 802 | |
| 803 | spin_lock(&fq->lock); |
| 804 | |
| 805 | if (nf_ct_frag6_queue(fq, clone, fhdr, nhoff) < 0) { |
| 806 | spin_unlock(&fq->lock); |
| 807 | DEBUGP("Can't insert skb to queue\n"); |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 808 | fq_put(fq, NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 809 | goto ret_orig; |
| 810 | } |
| 811 | |
| 812 | if (fq->last_in == (FIRST_IN|LAST_IN) && fq->meat == fq->len) { |
| 813 | ret_skb = nf_ct_frag6_reasm(fq, dev); |
| 814 | if (ret_skb == NULL) |
| 815 | DEBUGP("Can't reassemble fragmented packets\n"); |
| 816 | } |
| 817 | spin_unlock(&fq->lock); |
| 818 | |
Yasuyuki Kozakai | 1ba430b | 2005-11-14 15:28:18 -0800 | [diff] [blame] | 819 | fq_put(fq, NULL); |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 820 | return ret_skb; |
| 821 | |
| 822 | ret_orig: |
| 823 | kfree_skb(clone); |
| 824 | return skb; |
| 825 | } |
| 826 | |
| 827 | void nf_ct_frag6_output(unsigned int hooknum, struct sk_buff *skb, |
| 828 | struct net_device *in, struct net_device *out, |
| 829 | int (*okfn)(struct sk_buff *)) |
| 830 | { |
| 831 | struct sk_buff *s, *s2; |
| 832 | |
| 833 | for (s = NFCT_FRAG6_CB(skb)->orig; s;) { |
| 834 | nf_conntrack_put_reasm(s->nfct_reasm); |
| 835 | nf_conntrack_get_reasm(skb); |
| 836 | s->nfct_reasm = skb; |
| 837 | |
| 838 | s2 = s->next; |
| 839 | NF_HOOK_THRESH(PF_INET6, hooknum, s, in, out, okfn, |
| 840 | NF_IP6_PRI_CONNTRACK_DEFRAG + 1); |
| 841 | s = s2; |
| 842 | } |
| 843 | nf_conntrack_put_reasm(skb); |
| 844 | } |
| 845 | |
| 846 | int nf_ct_frag6_kfree_frags(struct sk_buff *skb) |
| 847 | { |
| 848 | struct sk_buff *s, *s2; |
| 849 | |
| 850 | for (s = NFCT_FRAG6_CB(skb)->orig; s; s = s2) { |
| 851 | |
| 852 | s2 = s->next; |
| 853 | kfree_skb(s); |
| 854 | } |
| 855 | |
| 856 | kfree_skb(skb); |
| 857 | |
| 858 | return 0; |
| 859 | } |
| 860 | |
| 861 | int nf_ct_frag6_init(void) |
| 862 | { |
| 863 | nf_ct_frag6_hash_rnd = (u32) ((num_physpages ^ (num_physpages>>7)) ^ |
| 864 | (jiffies ^ (jiffies >> 6))); |
| 865 | |
| 866 | init_timer(&nf_ct_frag6_secret_timer); |
| 867 | nf_ct_frag6_secret_timer.function = nf_ct_frag6_secret_rebuild; |
| 868 | nf_ct_frag6_secret_timer.expires = jiffies |
| 869 | + nf_ct_frag6_secret_interval; |
| 870 | add_timer(&nf_ct_frag6_secret_timer); |
| 871 | |
| 872 | return 0; |
| 873 | } |
| 874 | |
| 875 | void nf_ct_frag6_cleanup(void) |
| 876 | { |
| 877 | del_timer(&nf_ct_frag6_secret_timer); |
Yasuyuki Kozakai | 302fe17 | 2005-11-14 15:28:45 -0800 | [diff] [blame] | 878 | nf_ct_frag6_low_thresh = 0; |
Yasuyuki Kozakai | 9fb9cbb | 2005-11-09 16:38:16 -0800 | [diff] [blame] | 879 | nf_ct_frag6_evictor(); |
| 880 | } |