2 * net/sched/cls_rsvp.h Template file for RSVPv[46] classifiers.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
13 Comparing to general packet classification problem,
14 RSVP needs only sevaral relatively simple rules:
16 * (dst, protocol) are always specified,
17 so that we are able to hash them.
18 * src may be exact, or may be wildcard, so that
19 we can keep a hash table plus one wildcard entry.
20 * source port (or flow label) is important only if src is given.
24 We use a two level hash table: The top level is keyed by
25 destination address and protocol ID, every bucket contains a list
26 of "rsvp sessions", identified by destination address, protocol and
27 DPI(="Destination Port ID"): triple (key, mask, offset).
29 Every bucket has a smaller hash table keyed by source address
30 (cf. RSVP flowspec) and one wildcard entry for wildcard reservations.
31 Every bucket is again a list of "RSVP flows", selected by
32 source address and SPI(="Source Port ID" here rather than
33 "security parameter index"): triple (key, mask, offset).
36 NOTE 1. All the packets with IPv6 extension headers (but AH and ESP)
37 and all fragmented packets go to the best-effort traffic class.
40 NOTE 2. Two "port id"'s seems to be redundant, rfc2207 requires
41 only one "Generalized Port Identifier". So that for classic
42 ah, esp (and udp,tcp) both *pi should coincide or one of them
45 At first sight, this redundancy is just a waste of CPU
46 resources. But DPI and SPI add the possibility to assign different
47 priorities to GPIs. Look also at note 4 about tunnels below.
50 NOTE 3. One complication is the case of tunneled packets.
51 We implement it as following: if the first lookup
52 matches a special session with "tunnelhdr" value not zero,
53 flowid doesn't contain the true flow ID, but the tunnel ID (1...255).
54 In this case, we pull tunnelhdr bytes and restart lookup
55 with tunnel ID added to the list of keys. Simple and stupid 8)8)
56 It's enough for PIMREG and IPIP.
59 NOTE 4. Two GPIs make it possible to parse even GRE packets.
60 F.e. DPI can select ETH_P_IP (and necessary flags to make
61 tunnelhdr correct) in GRE protocol field and SPI matches
62 GRE key. Is it not nice? 8)8)
65 Well, as result, despite its simplicity, we get a pretty
66 powerful classification engine. */
74 struct rsvp_session *ht[256];
79 struct rsvp_session *next;
80 u32 dst[RSVP_DST_LEN];
81 struct tc_rsvp_gpi dpi;
84 /* 16 (src,sport) hash slots, and one wildcard source slot */
85 struct rsvp_filter *ht[16+1];
91 struct rsvp_filter *next;
92 u32 src[RSVP_DST_LEN];
93 struct tc_rsvp_gpi spi;
96 struct tcf_result res;
100 struct rsvp_session *sess;
103 static __inline__ unsigned hash_dst(u32 *dst, u8 protocol, u8 tunnelid)
105 unsigned h = dst[RSVP_DST_LEN-1];
108 return (h ^ protocol ^ tunnelid) & 0xFF;
111 static __inline__ unsigned hash_src(u32 *src)
113 unsigned h = src[RSVP_DST_LEN-1];
120 static struct tcf_ext_map rsvp_ext_map = {
121 .police = TCA_RSVP_POLICE,
122 .action = TCA_RSVP_ACT
125 #define RSVP_APPLY_RESULT() \
127 int r = tcf_exts_exec(skb, &f->exts, res); \
134 static int rsvp_classify(struct sk_buff *skb, struct tcf_proto *tp,
135 struct tcf_result *res)
137 struct rsvp_session **sht = ((struct rsvp_head*)tp->root)->ht;
138 struct rsvp_session *s;
139 struct rsvp_filter *f;
145 #if RSVP_DST_LEN == 4
146 struct ipv6hdr *nhptr = skb->nh.ipv6h;
148 struct iphdr *nhptr = skb->nh.iph;
153 #if RSVP_DST_LEN == 4
154 src = &nhptr->saddr.s6_addr32[0];
155 dst = &nhptr->daddr.s6_addr32[0];
156 protocol = nhptr->nexthdr;
157 xprt = ((u8*)nhptr) + sizeof(struct ipv6hdr);
161 protocol = nhptr->protocol;
162 xprt = ((u8*)nhptr) + (nhptr->ihl<<2);
163 if (nhptr->frag_off&__constant_htons(IP_MF|IP_OFFSET))
167 h1 = hash_dst(dst, protocol, tunnelid);
170 for (s = sht[h1]; s; s = s->next) {
171 if (dst[RSVP_DST_LEN-1] == s->dst[RSVP_DST_LEN-1] &&
172 protocol == s->protocol &&
173 !(s->dpi.mask & (*(u32*)(xprt+s->dpi.offset)^s->dpi.key))
174 #if RSVP_DST_LEN == 4
175 && dst[0] == s->dst[0]
176 && dst[1] == s->dst[1]
177 && dst[2] == s->dst[2]
179 && tunnelid == s->tunnelid) {
181 for (f = s->ht[h2]; f; f = f->next) {
182 if (src[RSVP_DST_LEN-1] == f->src[RSVP_DST_LEN-1] &&
183 !(f->spi.mask & (*(u32*)(xprt+f->spi.offset)^f->spi.key))
184 #if RSVP_DST_LEN == 4
185 && src[0] == f->src[0]
186 && src[1] == f->src[1]
187 && src[2] == f->src[2]
194 if (f->tunnelhdr == 0)
197 tunnelid = f->res.classid;
198 nhptr = (void*)(xprt + f->tunnelhdr - sizeof(*nhptr));
203 /* And wildcard bucket... */
204 for (f = s->ht[16]; f; f = f->next) {
215 static unsigned long rsvp_get(struct tcf_proto *tp, u32 handle)
217 struct rsvp_session **sht = ((struct rsvp_head*)tp->root)->ht;
218 struct rsvp_session *s;
219 struct rsvp_filter *f;
220 unsigned h1 = handle&0xFF;
221 unsigned h2 = (handle>>8)&0xFF;
226 for (s = sht[h1]; s; s = s->next) {
227 for (f = s->ht[h2]; f; f = f->next) {
228 if (f->handle == handle)
229 return (unsigned long)f;
235 static void rsvp_put(struct tcf_proto *tp, unsigned long f)
239 static int rsvp_init(struct tcf_proto *tp)
241 struct rsvp_head *data;
243 data = kmalloc(sizeof(struct rsvp_head), GFP_KERNEL);
245 memset(data, 0, sizeof(struct rsvp_head));
253 rsvp_delete_filter(struct tcf_proto *tp, struct rsvp_filter *f)
255 tcf_unbind_filter(tp, &f->res);
256 tcf_exts_destroy(tp, &f->exts);
260 static void rsvp_destroy(struct tcf_proto *tp)
262 struct rsvp_head *data = xchg(&tp->root, NULL);
263 struct rsvp_session **sht;
271 for (h1=0; h1<256; h1++) {
272 struct rsvp_session *s;
274 while ((s = sht[h1]) != NULL) {
277 for (h2=0; h2<=16; h2++) {
278 struct rsvp_filter *f;
280 while ((f = s->ht[h2]) != NULL) {
282 rsvp_delete_filter(tp, f);
291 static int rsvp_delete(struct tcf_proto *tp, unsigned long arg)
293 struct rsvp_filter **fp, *f = (struct rsvp_filter*)arg;
294 unsigned h = f->handle;
295 struct rsvp_session **sp;
296 struct rsvp_session *s = f->sess;
299 for (fp = &s->ht[(h>>8)&0xFF]; *fp; fp = &(*fp)->next) {
304 rsvp_delete_filter(tp, f);
308 for (i=0; i<=16; i++)
312 /* OK, session has no flows */
313 for (sp = &((struct rsvp_head*)tp->root)->ht[h&0xFF];
314 *sp; sp = &(*sp)->next) {
331 static unsigned gen_handle(struct tcf_proto *tp, unsigned salt)
333 struct rsvp_head *data = tp->root;
338 if ((data->hgenerator += 0x10000) == 0)
339 data->hgenerator = 0x10000;
340 h = data->hgenerator|salt;
341 if (rsvp_get(tp, h) == 0)
347 static int tunnel_bts(struct rsvp_head *data)
349 int n = data->tgenerator>>5;
350 u32 b = 1<<(data->tgenerator&0x1F);
358 static void tunnel_recycle(struct rsvp_head *data)
360 struct rsvp_session **sht = data->ht;
364 memset(tmap, 0, sizeof(tmap));
366 for (h1=0; h1<256; h1++) {
367 struct rsvp_session *s;
368 for (s = sht[h1]; s; s = s->next) {
369 for (h2=0; h2<=16; h2++) {
370 struct rsvp_filter *f;
372 for (f = s->ht[h2]; f; f = f->next) {
373 if (f->tunnelhdr == 0)
375 data->tgenerator = f->res.classid;
382 memcpy(data->tmap, tmap, sizeof(tmap));
385 static u32 gen_tunnel(struct rsvp_head *data)
389 for (k=0; k<2; k++) {
390 for (i=255; i>0; i--) {
391 if (++data->tgenerator == 0)
392 data->tgenerator = 1;
393 if (tunnel_bts(data))
394 return data->tgenerator;
396 tunnel_recycle(data);
401 static int rsvp_change(struct tcf_proto *tp, unsigned long base,
406 struct rsvp_head *data = tp->root;
407 struct rsvp_filter *f, **fp;
408 struct rsvp_session *s, **sp;
409 struct tc_rsvp_pinfo *pinfo = NULL;
410 struct rtattr *opt = tca[TCA_OPTIONS-1];
411 struct rtattr *tb[TCA_RSVP_MAX];
418 return handle ? -EINVAL : 0;
420 if (rtattr_parse_nested(tb, TCA_RSVP_MAX, opt) < 0)
423 err = tcf_exts_validate(tp, tb, tca[TCA_RATE-1], &e, &rsvp_ext_map);
427 if ((f = (struct rsvp_filter*)*arg) != NULL) {
428 /* Node exists: adjust only classid */
430 if (f->handle != handle && handle)
432 if (tb[TCA_RSVP_CLASSID-1]) {
433 f->res.classid = *(u32*)RTA_DATA(tb[TCA_RSVP_CLASSID-1]);
434 tcf_bind_filter(tp, &f->res, base);
437 tcf_exts_change(tp, &f->exts, &e);
441 /* Now more serious part... */
445 if (tb[TCA_RSVP_DST-1] == NULL)
449 f = kmalloc(sizeof(struct rsvp_filter), GFP_KERNEL);
453 memset(f, 0, sizeof(*f));
455 if (tb[TCA_RSVP_SRC-1]) {
457 if (RTA_PAYLOAD(tb[TCA_RSVP_SRC-1]) != sizeof(f->src))
459 memcpy(f->src, RTA_DATA(tb[TCA_RSVP_SRC-1]), sizeof(f->src));
460 h2 = hash_src(f->src);
462 if (tb[TCA_RSVP_PINFO-1]) {
464 if (RTA_PAYLOAD(tb[TCA_RSVP_PINFO-1]) < sizeof(struct tc_rsvp_pinfo))
466 pinfo = RTA_DATA(tb[TCA_RSVP_PINFO-1]);
468 f->tunnelhdr = pinfo->tunnelhdr;
470 if (tb[TCA_RSVP_CLASSID-1]) {
472 if (RTA_PAYLOAD(tb[TCA_RSVP_CLASSID-1]) != 4)
474 f->res.classid = *(u32*)RTA_DATA(tb[TCA_RSVP_CLASSID-1]);
478 if (RTA_PAYLOAD(tb[TCA_RSVP_DST-1]) != sizeof(f->src))
480 dst = RTA_DATA(tb[TCA_RSVP_DST-1]);
481 h1 = hash_dst(dst, pinfo ? pinfo->protocol : 0, pinfo ? pinfo->tunnelid : 0);
484 if ((f->handle = gen_handle(tp, h1 | (h2<<8))) == 0)
489 if (f->res.classid > 255)
493 if (f->res.classid == 0 &&
494 (f->res.classid = gen_tunnel(data)) == 0)
498 for (sp = &data->ht[h1]; (s=*sp) != NULL; sp = &s->next) {
499 if (dst[RSVP_DST_LEN-1] == s->dst[RSVP_DST_LEN-1] &&
500 pinfo && pinfo->protocol == s->protocol &&
501 memcmp(&pinfo->dpi, &s->dpi, sizeof(s->dpi)) == 0
502 #if RSVP_DST_LEN == 4
503 && dst[0] == s->dst[0]
504 && dst[1] == s->dst[1]
505 && dst[2] == s->dst[2]
507 && pinfo->tunnelid == s->tunnelid) {
510 /* OK, we found appropriate session */
515 if (f->tunnelhdr == 0)
516 tcf_bind_filter(tp, &f->res, base);
518 tcf_exts_change(tp, &f->exts, &e);
520 for (fp = &s->ht[h2]; *fp; fp = &(*fp)->next)
521 if (((*fp)->spi.mask&f->spi.mask) != f->spi.mask)
527 *arg = (unsigned long)f;
532 /* No session found. Create new one. */
535 s = kmalloc(sizeof(struct rsvp_session), GFP_KERNEL);
538 memset(s, 0, sizeof(*s));
539 memcpy(s->dst, dst, sizeof(s->dst));
543 s->protocol = pinfo->protocol;
544 s->tunnelid = pinfo->tunnelid;
546 for (sp = &data->ht[h1]; *sp; sp = &(*sp)->next) {
547 if (((*sp)->dpi.mask&s->dpi.mask) != s->dpi.mask)
559 tcf_exts_destroy(tp, &e);
563 static void rsvp_walk(struct tcf_proto *tp, struct tcf_walker *arg)
565 struct rsvp_head *head = tp->root;
571 for (h = 0; h < 256; h++) {
572 struct rsvp_session *s;
574 for (s = head->ht[h]; s; s = s->next) {
575 for (h1 = 0; h1 <= 16; h1++) {
576 struct rsvp_filter *f;
578 for (f = s->ht[h1]; f; f = f->next) {
579 if (arg->count < arg->skip) {
583 if (arg->fn(tp, (unsigned long)f, arg) < 0) {
594 static int rsvp_dump(struct tcf_proto *tp, unsigned long fh,
595 struct sk_buff *skb, struct tcmsg *t)
597 struct rsvp_filter *f = (struct rsvp_filter*)fh;
598 struct rsvp_session *s;
599 unsigned char *b = skb->tail;
601 struct tc_rsvp_pinfo pinfo;
607 t->tcm_handle = f->handle;
610 rta = (struct rtattr*)b;
611 RTA_PUT(skb, TCA_OPTIONS, 0, NULL);
613 RTA_PUT(skb, TCA_RSVP_DST, sizeof(s->dst), &s->dst);
616 pinfo.protocol = s->protocol;
617 pinfo.tunnelid = s->tunnelid;
618 pinfo.tunnelhdr = f->tunnelhdr;
620 RTA_PUT(skb, TCA_RSVP_PINFO, sizeof(pinfo), &pinfo);
622 RTA_PUT(skb, TCA_RSVP_CLASSID, 4, &f->res.classid);
623 if (((f->handle>>8)&0xFF) != 16)
624 RTA_PUT(skb, TCA_RSVP_SRC, sizeof(f->src), f->src);
626 if (tcf_exts_dump(skb, &f->exts, &rsvp_ext_map) < 0)
629 rta->rta_len = skb->tail - b;
631 if (tcf_exts_dump_stats(skb, &f->exts, &rsvp_ext_map) < 0)
636 skb_trim(skb, b - skb->data);
640 static struct tcf_proto_ops RSVP_OPS = {
643 .classify = rsvp_classify,
645 .destroy = rsvp_destroy,
648 .change = rsvp_change,
649 .delete = rsvp_delete,
652 .owner = THIS_MODULE,
655 static int __init init_rsvp(void)
657 return register_tcf_proto_ops(&RSVP_OPS);
660 static void __exit exit_rsvp(void)
662 unregister_tcf_proto_ops(&RSVP_OPS);
665 module_init(init_rsvp)
666 module_exit(exit_rsvp)