2 * Copyright (c) 2009, 2010 Nicira Networks.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
18 #include "classifier.h"
21 #include <netinet/in.h>
22 #include "dynamic-string.h"
26 const struct cls_field cls_fields[CLS_N_FIELDS + 1] = {
27 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
28 { offsetof(flow_t, MEMBER), \
29 sizeof ((flow_t *)0)->MEMBER, \
34 { sizeof(flow_t), 0, 0, "exact" },
37 static uint32_t hash_fields(const flow_t *, int table_idx);
38 static bool equal_fields(const flow_t *, const flow_t *, int table_idx);
40 static int table_idx_from_wildcards(uint32_t wildcards);
41 static struct cls_rule *table_insert(struct hmap *, struct cls_rule *);
42 static struct cls_rule *insert_exact_rule(struct classifier *,
44 static struct cls_bucket *find_bucket(struct hmap *, size_t hash,
45 const struct cls_rule *);
46 static struct cls_rule *search_table(const struct hmap *table, int field_idx,
47 const struct cls_rule *);
48 static struct cls_rule *search_exact_table(const struct classifier *,
49 size_t hash, const flow_t *);
50 static bool rules_match_1wild(const struct cls_rule *fixed,
51 const struct cls_rule *wild, int field_idx);
52 static bool rules_match_2wild(const struct cls_rule *wild1,
53 const struct cls_rule *wild2, int field_idx);
55 /* Converts the flow in 'flow' into a cls_rule in 'rule', with the given
56 * 'wildcards' and 'priority'.*/
58 cls_rule_from_flow(const flow_t *flow, uint32_t wildcards,
59 unsigned int priority, struct cls_rule *rule)
61 assert(!flow->reserved[0] && !flow->reserved[1] && !flow->reserved[2]);
63 flow_wildcards_init(&rule->wc, wildcards);
64 rule->priority = priority;
65 rule->table_idx = table_idx_from_wildcards(rule->wc.wildcards);
68 /* Converts the ofp_match in 'match' into a cls_rule in 'rule', with the given
69 * 'priority'. If 'tun_id_from_cookie' is set then the upper 32 bits of
70 * 'cookie' are stored in the rule as the tunnel ID. */
72 cls_rule_from_match(const struct ofp_match *match, unsigned int priority,
73 bool tun_id_from_cookie, uint64_t cookie,
74 struct cls_rule *rule)
77 flow_from_match(match, tun_id_from_cookie, cookie, &rule->flow, &wildcards);
78 flow_wildcards_init(&rule->wc, wildcards);
79 rule->priority = rule->wc.wildcards ? priority : UINT16_MAX;
80 rule->table_idx = table_idx_from_wildcards(rule->wc.wildcards);
83 /* Converts 'rule' to a string and returns the string. The caller must free
84 * the string (with free()). */
86 cls_rule_to_string(const struct cls_rule *rule)
88 struct ds s = DS_EMPTY_INITIALIZER;
89 ds_put_format(&s, "wildcards=%x priority=%u ",
90 rule->wc.wildcards, rule->priority);
91 flow_format(&s, &rule->flow);
95 /* Prints cls_rule 'rule', for debugging.
97 * (The output could be improved and expanded, but this was good enough to
98 * debug the classifier.) */
100 cls_rule_print(const struct cls_rule *rule)
102 printf("wildcards=%x priority=%u ", rule->wc.wildcards, rule->priority);
103 flow_print(stdout, &rule->flow);
107 /* Adjusts pointers around 'old', which must be in classifier 'cls', to
108 * compensate for it having been moved in memory to 'new' (e.g. due to
111 * This function cannot be realized in all possible flow classifier
112 * implementations, so we will probably have to change the interface if we
113 * change the implementation. Shouldn't be a big deal though. */
115 cls_rule_moved(struct classifier *cls, struct cls_rule *old,
116 struct cls_rule *new)
119 if (new->wc.wildcards) {
120 list_moved(&new->node.list);
122 hmap_node_moved(&cls->exact_table,
123 &old->node.hmap, &new->node.hmap);
128 /* Replaces 'old', which must be in classifier 'cls', by 'new' (e.g. due to
129 * realloc()); that is, after calling this function 'new' will be in 'cls' in
132 * 'new' and 'old' must be exactly the same: wildcard the same fields, have the
133 * same fixed values for non-wildcarded fields, and have the same priority.
135 * The caller takes ownership of 'old' and is thus responsible for freeing it,
136 * etc., as necessary.
138 * This function cannot be realized in all possible flow classifier
139 * implementations, so we will probably have to change the interface if we
140 * change the implementation. Shouldn't be a big deal though. */
142 cls_rule_replace(struct classifier *cls, const struct cls_rule *old,
143 struct cls_rule *new)
146 assert(old->wc.wildcards == new->wc.wildcards);
147 assert(old->priority == new->priority);
149 if (new->wc.wildcards) {
150 list_replace(&new->node.list, &old->node.list);
152 hmap_replace(&cls->exact_table, &old->node.hmap, &new->node.hmap);
156 /* Initializes 'cls' as a classifier that initially contains no classification
159 classifier_init(struct classifier *cls)
164 for (i = 0; i < ARRAY_SIZE(cls->tables); i++) {
165 hmap_init(&cls->tables[i]);
167 hmap_init(&cls->exact_table);
170 /* Destroys 'cls'. Rules within 'cls', if any, are not freed; this is the
171 * caller's responsibility. */
173 classifier_destroy(struct classifier *cls)
176 struct cls_bucket *bucket, *next_bucket;
179 for (tbl = &cls->tables[0]; tbl < &cls->tables[CLS_N_FIELDS]; tbl++) {
180 HMAP_FOR_EACH_SAFE (bucket, next_bucket, hmap_node, tbl) {
185 hmap_destroy(&cls->exact_table);
189 /* Returns true if 'cls' does not contain any classification rules, false
192 classifier_is_empty(const struct classifier *cls)
194 return cls->n_rules == 0;
197 /* Returns the number of rules in 'classifier'. */
199 classifier_count(const struct classifier *cls)
204 /* Returns the number of rules in 'classifier' that have no wildcards. */
206 classifier_count_exact(const struct classifier *cls)
208 return hmap_count(&cls->exact_table);
211 /* Inserts 'rule' into 'cls'. Transfers ownership of 'rule' to 'cls'.
213 * If 'cls' already contains an identical rule (including wildcards, values of
214 * fixed fields, and priority), replaces the old rule by 'rule' and returns the
215 * rule that was replaced. The caller takes ownership of the returned rule and
216 * is thus responsible for freeing it, etc., as necessary.
218 * Returns NULL if 'cls' does not contain a rule with an identical key, after
219 * inserting the new rule. In this case, no rules are displaced by the new
220 * rule, even rules that cannot have any effect because the new rule matches a
221 * superset of their flows and has higher priority. */
223 classifier_insert(struct classifier *cls, struct cls_rule *rule)
225 struct cls_rule *old;
226 assert((rule->wc.wildcards == 0) == (rule->table_idx == CLS_F_IDX_EXACT));
227 old = (rule->wc.wildcards
228 ? table_insert(&cls->tables[rule->table_idx], rule)
229 : insert_exact_rule(cls, rule));
236 /* Inserts 'rule' into 'cls'. Transfers ownership of 'rule' to 'cls'.
238 * 'rule' must be an exact-match rule (rule->wc.wildcards must be 0) and 'cls'
239 * must not contain any rule with an identical key. */
241 classifier_insert_exact(struct classifier *cls, struct cls_rule *rule)
243 hmap_insert(&cls->exact_table, &rule->node.hmap,
244 flow_hash(&rule->flow, 0));
248 /* Removes 'rule' from 'cls'. It is caller's responsibility to free 'rule', if
249 * this is desirable. */
251 classifier_remove(struct classifier *cls, struct cls_rule *rule)
253 if (rule->wc.wildcards) {
254 /* Remove 'rule' from bucket. If that empties the bucket, remove the
255 * bucket from its table. */
256 struct hmap *table = &cls->tables[rule->table_idx];
257 struct list *rules = list_remove(&rule->node.list);
258 if (list_is_empty(rules)) {
259 /* This code is a little tricky. list_remove() returns the list
260 * element just after the one removed. Since the list is now
261 * empty, this will be the address of the 'rules' member of the
262 * bucket that was just emptied, so pointer arithmetic (via
263 * CONTAINER_OF) can find that bucket. */
264 struct cls_bucket *bucket;
265 bucket = CONTAINER_OF(rules, struct cls_bucket, rules);
266 hmap_remove(table, &bucket->hmap_node);
270 /* Remove 'rule' from cls->exact_table. */
271 hmap_remove(&cls->exact_table, &rule->node.hmap);
276 /* Finds and returns the highest-priority rule in 'cls' that matches 'flow'.
277 * Returns a null pointer if no rules in 'cls' match 'flow'. If multiple rules
278 * of equal priority match 'flow', returns one arbitrarily.
280 * (When multiple rules of equal priority happen to fall into the same bucket,
281 * rules added more recently take priority over rules added less recently, but
282 * this is subject to change and should not be depended upon.) */
284 classifier_lookup(const struct classifier *cls, const flow_t *flow)
286 struct cls_rule *rule = classifier_lookup_exact(cls, flow);
288 rule = classifier_lookup_wild(cls, flow);
294 classifier_lookup_exact(const struct classifier *cls, const flow_t *flow)
296 return (!hmap_is_empty(&cls->exact_table)
297 ? search_exact_table(cls, flow_hash(flow, 0), flow)
302 classifier_lookup_wild(const struct classifier *cls, const flow_t *flow)
304 struct cls_rule *best = NULL;
305 if (cls->n_rules > hmap_count(&cls->exact_table)) {
306 struct cls_rule target;
309 cls_rule_from_flow(flow, 0, 0, &target);
310 for (i = 0; i < CLS_N_FIELDS; i++) {
311 struct cls_rule *rule = search_table(&cls->tables[i], i, &target);
312 if (rule && (!best || rule->priority > best->priority)) {
321 classifier_find_rule_exactly(const struct classifier *cls,
322 const flow_t *target, uint32_t wildcards,
323 unsigned int priority)
325 struct cls_bucket *bucket;
330 /* Ignores 'priority'. */
331 return search_exact_table(cls, flow_hash(target, 0), target);
334 assert(wildcards == (wildcards & OVSFW_ALL));
335 table_idx = table_idx_from_wildcards(wildcards);
336 hash = hash_fields(target, table_idx);
337 HMAP_FOR_EACH_WITH_HASH (bucket, hmap_node, hash,
338 &cls->tables[table_idx]) {
339 if (equal_fields(&bucket->fixed, target, table_idx)) {
340 struct cls_rule *pos;
341 LIST_FOR_EACH (pos, node.list, &bucket->rules) {
342 if (pos->priority < priority) {
344 } else if (pos->priority == priority &&
345 pos->wc.wildcards == wildcards &&
346 flow_equal(target, &pos->flow)) {
355 /* Checks if the flow defined by 'target' with 'wildcards' at 'priority'
356 * overlaps with any other rule at the same priority in the classifier.
357 * Two rules are considered overlapping if a packet could match both. */
359 classifier_rule_overlaps(const struct classifier *cls,
360 const flow_t *target, uint32_t wildcards,
361 unsigned int priority)
363 struct cls_rule target_rule;
364 const struct hmap *tbl;
367 return search_exact_table(cls, flow_hash(target, 0), target) ?
371 cls_rule_from_flow(target, wildcards, priority, &target_rule);
373 for (tbl = &cls->tables[0]; tbl < &cls->tables[CLS_N_FIELDS]; tbl++) {
374 struct cls_bucket *bucket;
376 HMAP_FOR_EACH (bucket, hmap_node, tbl) {
377 struct cls_rule *rule;
379 LIST_FOR_EACH (rule, node.list, &bucket->rules) {
380 if (rule->priority == priority
381 && rules_match_2wild(rule, &target_rule, 0)) {
391 /* Ignores target->priority.
393 * 'callback' is allowed to delete the rule that is passed as its argument, but
394 * it must not delete (or move) any other rules in 'cls' that are in the same
395 * table as the argument rule. Two rules are in the same table if their
396 * cls_rule structs have the same table_idx; as a special case, a rule with
397 * wildcards and an exact-match rule will never be in the same table. */
399 classifier_for_each_match(const struct classifier *cls,
400 const struct cls_rule *target,
401 int include, cls_cb_func *callback, void *aux)
403 if (include & CLS_INC_WILD) {
404 const struct hmap *table;
406 for (table = &cls->tables[0]; table < &cls->tables[CLS_N_FIELDS];
408 struct cls_bucket *bucket, *next_bucket;
410 HMAP_FOR_EACH_SAFE (bucket, next_bucket, hmap_node, table) {
411 /* XXX there is a bit of room for optimization here based on
412 * rejecting entire buckets on their fixed fields, but it will
413 * only be worthwhile for big buckets (which we hope we won't
414 * get anyway, but...) */
415 struct cls_rule *prev_rule, *rule;
417 /* We can't just use LIST_FOR_EACH_SAFE here because, if the
418 * callback deletes the last rule in the bucket, then the
419 * bucket itself will be destroyed. The bucket contains the
420 * list head so that's a use-after-free error. */
422 LIST_FOR_EACH (rule, node.list, &bucket->rules) {
423 if (rules_match_1wild(rule, target, 0)) {
425 callback(prev_rule, aux);
431 callback(prev_rule, aux);
437 if (include & CLS_INC_EXACT) {
438 if (target->wc.wildcards) {
439 struct cls_rule *rule, *next_rule;
441 HMAP_FOR_EACH_SAFE (rule, next_rule, node.hmap,
443 if (rules_match_1wild(rule, target, 0)) {
448 /* Optimization: there can be at most one match in the exact
450 size_t hash = flow_hash(&target->flow, 0);
451 struct cls_rule *rule = search_exact_table(cls, hash,
460 /* 'callback' is allowed to delete the rule that is passed as its argument, but
461 * it must not delete (or move) any other rules in 'cls' that are in the same
462 * table as the argument rule. Two rules are in the same table if their
463 * cls_rule structs have the same table_idx; as a special case, a rule with
464 * wildcards and an exact-match rule will never be in the same table. */
466 classifier_for_each(const struct classifier *cls, int include,
467 void (*callback)(struct cls_rule *, void *aux),
470 if (include & CLS_INC_WILD) {
471 const struct hmap *tbl;
473 for (tbl = &cls->tables[0]; tbl < &cls->tables[CLS_N_FIELDS]; tbl++) {
474 struct cls_bucket *bucket, *next_bucket;
476 HMAP_FOR_EACH_SAFE (bucket, next_bucket, hmap_node, tbl) {
477 struct cls_rule *prev_rule, *rule;
479 /* We can't just use LIST_FOR_EACH_SAFE here because, if the
480 * callback deletes the last rule in the bucket, then the
481 * bucket itself will be destroyed. The bucket contains the
482 * list head so that's a use-after-free error. */
484 LIST_FOR_EACH (rule, node.list, &bucket->rules) {
486 callback(prev_rule, aux);
491 callback(prev_rule, aux);
497 if (include & CLS_INC_EXACT) {
498 struct cls_rule *rule, *next_rule;
500 HMAP_FOR_EACH_SAFE (rule, next_rule, node.hmap, &cls->exact_table) {
506 static struct cls_bucket *create_bucket(struct hmap *, size_t hash,
507 const flow_t *fixed);
508 static struct cls_rule *bucket_insert(struct cls_bucket *, struct cls_rule *);
510 static inline bool equal_bytes(const void *, const void *, size_t n);
512 /* Returns a hash computed across the fields in 'flow' whose field indexes
513 * (CLS_F_IDX_*) are less than 'table_idx'. (If 'table_idx' is
514 * CLS_F_IDX_EXACT, hashes all the fields in 'flow'). */
516 hash_fields(const flow_t *flow, int table_idx)
518 /* I just know I'm going to hell for writing code this way.
520 * GCC generates pretty good code here, with only a single taken
521 * conditional jump per execution. Now the question is, would we be better
522 * off marking this function ALWAYS_INLINE and writing a wrapper that
523 * switches on the value of 'table_idx' to get rid of all the conditional
524 * jumps entirely (except for one in the wrapper)? Honestly I really,
525 * really hope that it doesn't matter in practice.
527 * We could do better by calculating hashes incrementally, instead of
528 * starting over from the top each time. But that would be even uglier. */
533 a = b = c = 0xdeadbeef + table_idx;
536 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
537 if (table_idx == CLS_F_IDX_##NAME) { \
539 memset((uint8_t *) tmp + n, 0, sizeof tmp - n); \
542 const size_t size = sizeof flow->MEMBER; \
543 const uint8_t *p1 = (const uint8_t *) &flow->MEMBER; \
544 const size_t p1_size = MIN(sizeof tmp - n, size); \
545 const uint8_t *p2 = p1 + p1_size; \
546 const size_t p2_size = size - p1_size; \
548 /* Append to 'tmp' as much data as will fit. */ \
549 memcpy((uint8_t *) tmp + n, p1, p1_size); \
552 /* If 'tmp' is full, mix. */ \
553 if (n == sizeof tmp) { \
561 /* Append to 'tmp' any data that didn't fit. */ \
562 memcpy(tmp, p2, p2_size); \
576 /* Compares the fields in 'a' and 'b' whose field indexes (CLS_F_IDX_*) are
577 * less than 'table_idx'. (If 'table_idx' is CLS_F_IDX_EXACT, compares all the
578 * fields in 'a' and 'b').
580 * Returns true if all the compared fields are equal, false otherwise. */
582 equal_fields(const flow_t *a, const flow_t *b, int table_idx)
584 /* XXX The generated code could be better here. */
585 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
586 if (table_idx == CLS_F_IDX_##NAME) { \
588 } else if (!equal_bytes(&a->MEMBER, &b->MEMBER, sizeof a->MEMBER)) { \
598 table_idx_from_wildcards(uint32_t wildcards)
601 return CLS_F_IDX_EXACT;
603 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
604 if (wildcards & WILDCARDS) { \
605 return CLS_F_IDX_##NAME; \
612 /* Inserts 'rule' into 'table'. Returns the rule, if any, that was displaced
613 * in favor of 'rule'. */
614 static struct cls_rule *
615 table_insert(struct hmap *table, struct cls_rule *rule)
617 struct cls_bucket *bucket;
620 hash = hash_fields(&rule->flow, rule->table_idx);
621 bucket = find_bucket(table, hash, rule);
623 bucket = create_bucket(table, hash, &rule->flow);
626 return bucket_insert(bucket, rule);
629 /* Inserts 'rule' into 'bucket', given that 'field' is the first wildcarded
632 * Returns the rule, if any, that was displaced in favor of 'rule'. */
633 static struct cls_rule *
634 bucket_insert(struct cls_bucket *bucket, struct cls_rule *rule)
636 struct cls_rule *pos;
637 LIST_FOR_EACH (pos, node.list, &bucket->rules) {
638 if (pos->priority == rule->priority) {
639 if (pos->wc.wildcards == rule->wc.wildcards
640 && rules_match_1wild(pos, rule, rule->table_idx))
642 list_replace(&rule->node.list, &pos->node.list);
645 } else if (pos->priority < rule->priority) {
649 list_insert(&pos->node.list, &rule->node.list);
653 static struct cls_rule *
654 insert_exact_rule(struct classifier *cls, struct cls_rule *rule)
656 struct cls_rule *old_rule;
659 hash = flow_hash(&rule->flow, 0);
660 old_rule = search_exact_table(cls, hash, &rule->flow);
662 hmap_remove(&cls->exact_table, &old_rule->node.hmap);
664 hmap_insert(&cls->exact_table, &rule->node.hmap, hash);
668 /* Returns the bucket in 'table' that has the given 'hash' and the same fields
669 * as 'rule->flow' (up to 'rule->table_idx'), or a null pointer if no bucket
671 static struct cls_bucket *
672 find_bucket(struct hmap *table, size_t hash, const struct cls_rule *rule)
674 struct cls_bucket *bucket;
675 HMAP_FOR_EACH_WITH_HASH (bucket, hmap_node, hash, table) {
676 if (equal_fields(&bucket->fixed, &rule->flow, rule->table_idx)) {
683 /* Creates a bucket and inserts it in 'table' with the given 'hash' and 'fixed'
684 * values. Returns the new bucket. */
685 static struct cls_bucket *
686 create_bucket(struct hmap *table, size_t hash, const flow_t *fixed)
688 struct cls_bucket *bucket = xmalloc(sizeof *bucket);
689 list_init(&bucket->rules);
690 bucket->fixed = *fixed;
691 hmap_insert(table, &bucket->hmap_node, hash);
695 /* Returns true if the 'n' bytes in 'a' and 'b' are equal, false otherwise. */
696 static inline bool ALWAYS_INLINE
697 equal_bytes(const void *a, const void *b, size_t n)
700 /* For some reason GCC generates stupid code for memcmp() of small
701 * constant integer lengths. Help it out.
703 * This function is always inlined, and it is always called with 'n' as a
704 * compile-time constant, so the switch statement gets optimized out and
705 * this whole function just expands to an instruction or two. */
708 return *(uint8_t *) a == *(uint8_t *) b;
711 return *(uint16_t *) a == *(uint16_t *) b;
714 return *(uint32_t *) a == *(uint32_t *) b;
717 return (*(uint32_t *) a == *(uint32_t *) b
718 && ((uint16_t *) a)[2] == ((uint16_t *) b)[2]);
724 /* I hope GCC is smarter on your platform. */
725 return !memcmp(a, b, n);
729 /* Returns the 32-bit unsigned integer at 'p'. */
730 static inline uint32_t
731 read_uint32(const void *p)
733 /* GCC optimizes this into a single machine instruction on x86. */
735 memcpy(&x, p, sizeof x);
739 /* Compares the specified field in 'a' and 'b'. Returns true if the fields are
740 * equal, or if the ofp_match wildcard bits in 'wildcards' are set such that
741 * non-equal values may be ignored. 'nw_src_mask' and 'nw_dst_mask' must be
742 * those that would be set for 'wildcards' by cls_rule_set_masks().
744 * The compared field is the one with wildcard bit or bits 'field_wc', offset
745 * 'rule_ofs' within cls_rule's "fields" member, and length 'len', in bytes. */
746 static inline bool ALWAYS_INLINE
747 field_matches(const flow_t *a_, const flow_t *b_,
748 uint32_t wildcards, uint32_t nw_src_mask, uint32_t nw_dst_mask,
749 uint32_t field_wc, int ofs, int len)
751 /* This function is always inlined, and it is always called with 'field_wc'
752 * as a compile-time constant, so the "if" conditionals here generate no
754 const void *a = (const uint8_t *) a_ + ofs;
755 const void *b = (const uint8_t *) b_ + ofs;
756 if (!(field_wc & (field_wc - 1))) {
757 /* Handle all the single-bit wildcard cases. */
758 return wildcards & field_wc || equal_bytes(a, b, len);
759 } else if (field_wc == OFPFW_NW_SRC_MASK ||
760 field_wc == OFPFW_NW_DST_MASK) {
761 uint32_t a_ip = read_uint32(a);
762 uint32_t b_ip = read_uint32(b);
763 uint32_t mask = (field_wc == OFPFW_NW_SRC_MASK
764 ? nw_src_mask : nw_dst_mask);
765 return ((a_ip ^ b_ip) & mask) == 0;
771 /* Returns true if 'a' and 'b' match, ignoring fields for which the wildcards
772 * in 'wildcards' are set. 'nw_src_mask' and 'nw_dst_mask' must be those that
773 * would be set for 'wildcards' by cls_rule_set_masks(). 'field_idx' is the
774 * index of the first field to be compared; fields before 'field_idx' are
775 * assumed to match. (Always returns true if 'field_idx' is CLS_N_FIELDS.) */
777 rules_match(const struct cls_rule *a, const struct cls_rule *b,
778 uint32_t wildcards, uint32_t nw_src_mask, uint32_t nw_dst_mask,
781 /* This is related to Duff's device (see
782 * http://en.wikipedia.org/wiki/Duff's_device). */
784 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
785 case CLS_F_IDX_##NAME: \
786 if (!field_matches(&a->flow, &b->flow, \
787 wildcards, nw_src_mask, nw_dst_mask, \
788 WILDCARDS, offsetof(flow_t, MEMBER), \
789 sizeof a->flow.MEMBER)) { \
799 /* Returns true if 'fixed' and 'wild' match. All fields in 'fixed' must have
800 * fixed values; 'wild' may contain wildcards.
802 * 'field_idx' is the index of the first field to be compared; fields before
803 * 'field_idx' are assumed to match. Always returns true if 'field_idx' is
806 rules_match_1wild(const struct cls_rule *fixed, const struct cls_rule *wild,
809 return rules_match(fixed, wild, wild->wc.wildcards, wild->wc.nw_src_mask,
810 wild->wc.nw_dst_mask, field_idx);
813 /* Returns true if 'wild1' and 'wild2' match, that is, if their fields
814 * are equal modulo wildcards in 'wild1' or 'wild2'.
816 * 'field_idx' is the index of the first field to be compared; fields before
817 * 'field_idx' are assumed to match. Always returns true if 'field_idx' is
820 rules_match_2wild(const struct cls_rule *wild1, const struct cls_rule *wild2,
823 return rules_match(wild1, wild2,
824 wild1->wc.wildcards | wild2->wc.wildcards,
825 wild1->wc.nw_src_mask & wild2->wc.nw_src_mask,
826 wild1->wc.nw_dst_mask & wild2->wc.nw_dst_mask,
830 /* Searches 'bucket' for a rule that matches 'target'. Returns the
831 * highest-priority match, if one is found, or a null pointer if there is no
834 * 'field_idx' must be the index of the first wildcarded field in 'bucket'. */
835 static struct cls_rule *
836 search_bucket(struct cls_bucket *bucket, int field_idx,
837 const struct cls_rule *target)
839 struct cls_rule *pos;
841 if (!equal_fields(&bucket->fixed, &target->flow, field_idx)) {
845 LIST_FOR_EACH (pos, node.list, &bucket->rules) {
846 if (rules_match_1wild(target, pos, field_idx)) {
853 /* Searches 'table' for a rule that matches 'target'. Returns the
854 * highest-priority match, if one is found, or a null pointer if there is no
857 * 'field_idx' must be the index of the first wildcarded field in 'table'. */
858 static struct cls_rule *
859 search_table(const struct hmap *table, int field_idx,
860 const struct cls_rule *target)
862 struct cls_bucket *bucket;
864 switch (hmap_count(table)) {
865 /* In these special cases there's no need to hash. */
869 bucket = CONTAINER_OF(hmap_first(table), struct cls_bucket, hmap_node);
870 return search_bucket(bucket, field_idx, target);
873 HMAP_FOR_EACH_WITH_HASH (bucket, hmap_node,
874 hash_fields(&target->flow, field_idx), table) {
875 struct cls_rule *rule = search_bucket(bucket, field_idx, target);
883 static struct cls_rule *
884 search_exact_table(const struct classifier *cls, size_t hash,
885 const flow_t *target)
887 struct cls_rule *rule;
889 HMAP_FOR_EACH_WITH_HASH (rule, node.hmap, hash, &cls->exact_table) {
890 if (flow_equal(&rule->flow, target)) {