* --------<-POP---------
*
* where B is a virtual ematch referencing to sequence starting with B1.
- *
+ *
* ==========================================================================
*
* How to write an ematch in 60 seconds
* ------------------------------------
- *
+ *
* 1) Provide a matcher function:
* static int my_match(struct sk_buff *skb, struct tcf_ematch *m,
* struct tcf_pkt_info *info)
#include <linux/module.h>
#include <linux/types.h>
#include <linux/kernel.h>
-#include <linux/sched.h>
#include <linux/mm.h>
#include <linux/errno.h>
#include <linux/interrupt.h>
/**
* tcf_em_register - register an extended match
- *
+ *
* @ops: ematch operations lookup table
*
* This function must be called by ematches to announce their presence.
if (ref <= idx)
goto errout;
-
+
em->data = ref;
} else {
/* Note: This lookup will increase the module refcnt
/* We do not use rtattr_parse_nested here because the maximum
* number of attributes is unknown. This saves us the allocation
* for a tb buffer which would serve no purpose at all.
- *
+ *
* The array of rt attributes is parsed in the order as they are
* provided, their type must be incremental from 1 to n. Even
* if it does not serve any real purpose, a failure of sticking
module_put(em->ops->owner);
}
}
-
+
tree->hdr.nmatches = 0;
kfree(tree->matches);
}