#include <evl.h>
Data Fields | |
| int * | tree |
| int | numClasses |
| var_set_t ** | ruleSets |
| util_int_array_t ** | ruleArrays |
| int * | ruleArrayMin |
| int * | ruleArrayMax |
A lookup table struct - walk the tree using dest port, src port, dest ip, src ip bits, 8 at a time from MSB, and the terminal will be an index that can be used to get into an array of var_set_t * that is the set of corresponding rules - not L4 rules, the actual rules, or an array of util_int_array_t * that is the same set.
The logic for this is that in some cases we may want the set representation, in others the array representation. specifically, if we are traversing an automaton to see what strings are present, then the set representation is superior. Conversely, for rules with no strings, where we have to traverse the entire set of rules associated with a class derived from the lookup-table, we might as well do it with an array representation.
Definition at line 66 of file evl.h.