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.
17 /* "White box" tests for classifier.
19 * With very few exceptions, these tests obtain complete coverage of every
20 * basic block and every branch in the classifier implementation, e.g. a clean
21 * report from "gcov -b". (Covering the exceptions would require finding
22 * collisions in the hash function used for flow data, etc.)
24 * This test should receive a clean report from "valgrind --leak-check=full":
25 * it frees every heap block that it allocates.
29 #include "classifier.h"
32 #include "byte-order.h"
33 #include "command-line.h"
37 #include "unaligned.h"
42 /* Fields in a rule. */
44 /* struct flow all-caps */ \
45 /* FWW_* bit(s) member name name */ \
46 /* -------------------------- ----------- -------- */ \
47 CLS_FIELD(FWW_TUN_ID, tun_id, TUN_ID) \
48 CLS_FIELD(0, nw_src, NW_SRC) \
49 CLS_FIELD(0, nw_dst, NW_DST) \
50 CLS_FIELD(FWW_IN_PORT, in_port, IN_PORT) \
51 CLS_FIELD(0, vlan_tci, VLAN_TCI) \
52 CLS_FIELD(FWW_DL_TYPE, dl_type, DL_TYPE) \
53 CLS_FIELD(FWW_TP_SRC, tp_src, TP_SRC) \
54 CLS_FIELD(FWW_TP_DST, tp_dst, TP_DST) \
55 CLS_FIELD(FWW_DL_SRC, dl_src, DL_SRC) \
56 CLS_FIELD(FWW_DL_DST | FWW_ETH_MCAST, dl_dst, DL_DST) \
57 CLS_FIELD(FWW_NW_PROTO, nw_proto, NW_PROTO) \
58 CLS_FIELD(FWW_NW_TOS, nw_tos, NW_TOS)
62 * (These are also indexed into struct classifier's 'tables' array.) */
64 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) CLS_F_IDX_##NAME,
70 /* Field information. */
72 int ofs; /* Offset in struct flow. */
73 int len; /* Length in bytes. */
74 flow_wildcards_t wildcards; /* FWW_* bit or bits for this field. */
75 const char *name; /* Name (for debugging). */
78 static const struct cls_field cls_fields[CLS_N_FIELDS] = {
79 #define CLS_FIELD(WILDCARDS, MEMBER, NAME) \
80 { offsetof(struct flow, MEMBER), \
81 sizeof ((struct flow *)0)->MEMBER, \
89 int aux; /* Auxiliary data. */
90 struct cls_rule cls_rule; /* Classifier rule data. */
93 static struct test_rule *
94 test_rule_from_cls_rule(const struct cls_rule *rule)
96 return rule ? CONTAINER_OF(rule, struct test_rule, cls_rule) : NULL;
99 /* Trivial (linear) classifier. */
102 size_t allocated_rules;
103 struct test_rule **rules;
107 tcls_init(struct tcls *tcls)
110 tcls->allocated_rules = 0;
115 tcls_destroy(struct tcls *tcls)
120 for (i = 0; i < tcls->n_rules; i++) {
121 free(tcls->rules[i]);
128 tcls_is_empty(const struct tcls *tcls)
130 return tcls->n_rules == 0;
133 static struct test_rule *
134 tcls_insert(struct tcls *tcls, const struct test_rule *rule)
138 assert(!flow_wildcards_is_exact(&rule->cls_rule.wc)
139 || rule->cls_rule.priority == UINT_MAX);
140 for (i = 0; i < tcls->n_rules; i++) {
141 const struct cls_rule *pos = &tcls->rules[i]->cls_rule;
142 if (cls_rule_equal(pos, &rule->cls_rule)) {
144 free(tcls->rules[i]);
145 tcls->rules[i] = xmemdup(rule, sizeof *rule);
146 return tcls->rules[i];
147 } else if (pos->priority < rule->cls_rule.priority) {
152 if (tcls->n_rules >= tcls->allocated_rules) {
153 tcls->rules = x2nrealloc(tcls->rules, &tcls->allocated_rules,
154 sizeof *tcls->rules);
156 if (i != tcls->n_rules) {
157 memmove(&tcls->rules[i + 1], &tcls->rules[i],
158 sizeof *tcls->rules * (tcls->n_rules - i));
160 tcls->rules[i] = xmemdup(rule, sizeof *rule);
162 return tcls->rules[i];
166 tcls_remove(struct tcls *cls, const struct test_rule *rule)
170 for (i = 0; i < cls->n_rules; i++) {
171 struct test_rule *pos = cls->rules[i];
174 memmove(&cls->rules[i], &cls->rules[i + 1],
175 sizeof *cls->rules * (cls->n_rules - i - 1));
184 match(const struct cls_rule *wild, const struct flow *fixed)
188 for (f_idx = 0; f_idx < CLS_N_FIELDS; f_idx++) {
189 const struct cls_field *f = &cls_fields[f_idx];
193 void *wild_field = (char *) &wild->flow + f->ofs;
194 void *fixed_field = (char *) fixed + f->ofs;
195 eq = ((wild->wc.wildcards & f->wildcards) == f->wildcards
196 || !memcmp(wild_field, fixed_field, f->len));
197 } else if (f_idx == CLS_F_IDX_NW_SRC) {
198 eq = !((fixed->nw_src ^ wild->flow.nw_src) & wild->wc.nw_src_mask);
199 } else if (f_idx == CLS_F_IDX_NW_DST) {
200 eq = !((fixed->nw_dst ^ wild->flow.nw_dst) & wild->wc.nw_dst_mask);
201 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
202 eq = !((fixed->vlan_tci ^ wild->flow.vlan_tci)
203 & wild->wc.vlan_tci_mask);
215 static struct cls_rule *
216 tcls_lookup(const struct tcls *cls, const struct flow *flow)
220 for (i = 0; i < cls->n_rules; i++) {
221 struct test_rule *pos = cls->rules[i];
222 if (match(&pos->cls_rule, flow)) {
223 return &pos->cls_rule;
230 tcls_delete_matches(struct tcls *cls, const struct cls_rule *target)
234 for (i = 0; i < cls->n_rules; ) {
235 struct test_rule *pos = cls->rules[i];
236 if (!flow_wildcards_has_extra(&pos->cls_rule.wc, &target->wc)
237 && match(target, &pos->cls_rule.flow)) {
238 tcls_remove(cls, pos);
245 static ovs_be32 nw_src_values[] = { CONSTANT_HTONL(0xc0a80001),
246 CONSTANT_HTONL(0xc0a04455) };
247 static ovs_be32 nw_dst_values[] = { CONSTANT_HTONL(0xc0a80002),
248 CONSTANT_HTONL(0xc0a04455) };
249 static ovs_be32 tun_id_values[] = { 0, 0xffff0000 };
250 static uint16_t in_port_values[] = { 1, ODPP_LOCAL };
251 static ovs_be16 vlan_tci_values[] = { CONSTANT_HTONS(101), CONSTANT_HTONS(0) };
252 static ovs_be16 dl_type_values[]
253 = { CONSTANT_HTONS(ETH_TYPE_IP), CONSTANT_HTONS(ETH_TYPE_ARP) };
254 static ovs_be16 tp_src_values[] = { CONSTANT_HTONS(49362),
255 CONSTANT_HTONS(80) };
256 static ovs_be16 tp_dst_values[] = { CONSTANT_HTONS(6667), CONSTANT_HTONS(22) };
257 static uint8_t dl_src_values[][6] = { { 0x00, 0x02, 0xe3, 0x0f, 0x80, 0xa4 },
258 { 0x5e, 0x33, 0x7f, 0x5f, 0x1e, 0x99 } };
259 static uint8_t dl_dst_values[][6] = { { 0x4a, 0x27, 0x71, 0xae, 0x64, 0xc1 },
260 { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff } };
261 static uint8_t nw_proto_values[] = { IP_TYPE_TCP, IP_TYPE_ICMP };
262 static uint8_t nw_tos_values[] = { 49, 0 };
264 static void *values[CLS_N_FIELDS][2];
269 values[CLS_F_IDX_TUN_ID][0] = &tun_id_values[0];
270 values[CLS_F_IDX_TUN_ID][1] = &tun_id_values[1];
272 values[CLS_F_IDX_IN_PORT][0] = &in_port_values[0];
273 values[CLS_F_IDX_IN_PORT][1] = &in_port_values[1];
275 values[CLS_F_IDX_VLAN_TCI][0] = &vlan_tci_values[0];
276 values[CLS_F_IDX_VLAN_TCI][1] = &vlan_tci_values[1];
278 values[CLS_F_IDX_DL_SRC][0] = dl_src_values[0];
279 values[CLS_F_IDX_DL_SRC][1] = dl_src_values[1];
281 values[CLS_F_IDX_DL_DST][0] = dl_dst_values[0];
282 values[CLS_F_IDX_DL_DST][1] = dl_dst_values[1];
284 values[CLS_F_IDX_DL_TYPE][0] = &dl_type_values[0];
285 values[CLS_F_IDX_DL_TYPE][1] = &dl_type_values[1];
287 values[CLS_F_IDX_NW_SRC][0] = &nw_src_values[0];
288 values[CLS_F_IDX_NW_SRC][1] = &nw_src_values[1];
290 values[CLS_F_IDX_NW_DST][0] = &nw_dst_values[0];
291 values[CLS_F_IDX_NW_DST][1] = &nw_dst_values[1];
293 values[CLS_F_IDX_NW_PROTO][0] = &nw_proto_values[0];
294 values[CLS_F_IDX_NW_PROTO][1] = &nw_proto_values[1];
296 values[CLS_F_IDX_NW_TOS][0] = &nw_tos_values[0];
297 values[CLS_F_IDX_NW_TOS][1] = &nw_tos_values[1];
299 values[CLS_F_IDX_TP_SRC][0] = &tp_src_values[0];
300 values[CLS_F_IDX_TP_SRC][1] = &tp_src_values[1];
302 values[CLS_F_IDX_TP_DST][0] = &tp_dst_values[0];
303 values[CLS_F_IDX_TP_DST][1] = &tp_dst_values[1];
306 #define N_NW_SRC_VALUES ARRAY_SIZE(nw_src_values)
307 #define N_NW_DST_VALUES ARRAY_SIZE(nw_dst_values)
308 #define N_TUN_ID_VALUES ARRAY_SIZE(tun_id_values)
309 #define N_IN_PORT_VALUES ARRAY_SIZE(in_port_values)
310 #define N_VLAN_TCI_VALUES ARRAY_SIZE(vlan_tci_values)
311 #define N_DL_TYPE_VALUES ARRAY_SIZE(dl_type_values)
312 #define N_TP_SRC_VALUES ARRAY_SIZE(tp_src_values)
313 #define N_TP_DST_VALUES ARRAY_SIZE(tp_dst_values)
314 #define N_DL_SRC_VALUES ARRAY_SIZE(dl_src_values)
315 #define N_DL_DST_VALUES ARRAY_SIZE(dl_dst_values)
316 #define N_NW_PROTO_VALUES ARRAY_SIZE(nw_proto_values)
317 #define N_NW_TOS_VALUES ARRAY_SIZE(nw_tos_values)
319 #define N_FLOW_VALUES (N_NW_SRC_VALUES * \
323 N_VLAN_TCI_VALUES * \
329 N_NW_PROTO_VALUES * \
333 get_value(unsigned int *x, unsigned n_values)
335 unsigned int rem = *x % n_values;
341 compare_classifiers(struct classifier *cls, struct tcls *tcls)
343 static const int confidence = 500;
346 assert(classifier_count(cls) == tcls->n_rules);
347 for (i = 0; i < confidence; i++) {
348 struct cls_rule *cr0, *cr1;
352 x = rand () % N_FLOW_VALUES;
353 flow.nw_src = nw_src_values[get_value(&x, N_NW_SRC_VALUES)];
354 flow.nw_dst = nw_dst_values[get_value(&x, N_NW_DST_VALUES)];
355 flow.tun_id = tun_id_values[get_value(&x, N_TUN_ID_VALUES)];
356 flow.in_port = in_port_values[get_value(&x, N_IN_PORT_VALUES)];
357 flow.vlan_tci = vlan_tci_values[get_value(&x, N_VLAN_TCI_VALUES)];
358 flow.dl_type = dl_type_values[get_value(&x, N_DL_TYPE_VALUES)];
359 flow.tp_src = tp_src_values[get_value(&x, N_TP_SRC_VALUES)];
360 flow.tp_dst = tp_dst_values[get_value(&x, N_TP_DST_VALUES)];
361 memcpy(flow.dl_src, dl_src_values[get_value(&x, N_DL_SRC_VALUES)],
363 memcpy(flow.dl_dst, dl_dst_values[get_value(&x, N_DL_DST_VALUES)],
365 flow.nw_proto = nw_proto_values[get_value(&x, N_NW_PROTO_VALUES)];
366 flow.nw_tos = nw_tos_values[get_value(&x, N_NW_TOS_VALUES)];
368 cr0 = classifier_lookup(cls, &flow);
369 cr1 = tcls_lookup(tcls, &flow);
370 assert((cr0 == NULL) == (cr1 == NULL));
372 const struct test_rule *tr0 = test_rule_from_cls_rule(cr0);
373 const struct test_rule *tr1 = test_rule_from_cls_rule(cr1);
375 assert(cls_rule_equal(cr0, cr1));
376 assert(tr0->aux == tr1->aux);
382 destroy_classifier(struct classifier *cls)
384 struct test_rule *rule, *next_rule;
385 struct cls_cursor cursor;
387 cls_cursor_init(&cursor, cls, NULL);
388 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
389 classifier_remove(cls, &rule->cls_rule);
392 classifier_destroy(cls);
396 check_tables(const struct classifier *cls,
397 int n_tables, int n_rules, int n_dups)
399 const struct cls_table *table;
400 struct flow_wildcards exact_wc;
401 struct test_rule *test_rule;
402 struct cls_cursor cursor;
403 int found_tables = 0;
406 int found_rules2 = 0;
408 flow_wildcards_init_exact(&exact_wc);
409 HMAP_FOR_EACH (table, hmap_node, &cls->tables) {
410 const struct cls_rule *head;
412 assert(!hmap_is_empty(&table->rules));
415 HMAP_FOR_EACH (head, hmap_node, &table->rules) {
416 unsigned int prev_priority = UINT_MAX;
417 const struct cls_rule *rule;
420 LIST_FOR_EACH (rule, list, &head->list) {
421 assert(rule->priority < prev_priority);
422 prev_priority = rule->priority;
425 assert(classifier_find_rule_exactly(cls, rule) == rule);
430 assert(found_tables == hmap_count(&cls->tables));
431 assert(n_tables == -1 || n_tables == hmap_count(&cls->tables));
432 assert(n_rules == -1 || found_rules == n_rules);
433 assert(n_dups == -1 || found_dups == n_dups);
435 cls_cursor_init(&cursor, cls, NULL);
436 CLS_CURSOR_FOR_EACH (test_rule, cls_rule, &cursor) {
439 assert(found_rules == found_rules2);
442 static struct test_rule *
443 make_rule(int wc_fields, unsigned int priority, int value_pat)
445 const struct cls_field *f;
446 struct test_rule *rule;
448 rule = xzalloc(sizeof *rule);
449 cls_rule_init_catchall(&rule->cls_rule, wc_fields ? priority : UINT_MAX);
450 for (f = &cls_fields[0]; f < &cls_fields[CLS_N_FIELDS]; f++) {
451 int f_idx = f - cls_fields;
452 int value_idx = (value_pat & (1u << f_idx)) != 0;
453 memcpy((char *) &rule->cls_rule.flow + f->ofs,
454 values[f_idx][value_idx], f->len);
457 rule->cls_rule.wc.wildcards &= ~f->wildcards;
458 } else if (f_idx == CLS_F_IDX_NW_SRC) {
459 rule->cls_rule.wc.nw_src_mask = htonl(UINT32_MAX);
460 } else if (f_idx == CLS_F_IDX_NW_DST) {
461 rule->cls_rule.wc.nw_dst_mask = htonl(UINT32_MAX);
462 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
463 rule->cls_rule.wc.vlan_tci_mask = htons(UINT16_MAX);
472 shuffle(unsigned int *p, size_t n)
474 for (; n > 1; n--, p++) {
475 unsigned int *q = &p[rand() % n];
476 unsigned int tmp = *p;
482 /* Tests an empty classifier. */
484 test_empty(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
486 struct classifier cls;
489 classifier_init(&cls);
491 assert(classifier_is_empty(&cls));
492 assert(tcls_is_empty(&tcls));
493 compare_classifiers(&cls, &tcls);
494 classifier_destroy(&cls);
498 /* Destroys a null classifier. */
500 test_destroy_null(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
502 classifier_destroy(NULL);
505 /* Tests classification with one rule at a time. */
507 test_single_rule(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
509 unsigned int wc_fields; /* Hilarious. */
511 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
512 struct classifier cls;
513 struct test_rule *rule, *tcls_rule;
516 rule = make_rule(wc_fields,
517 hash_bytes(&wc_fields, sizeof wc_fields, 0), 0);
519 classifier_init(&cls);
522 tcls_rule = tcls_insert(&tcls, rule);
523 assert(!classifier_insert(&cls, &rule->cls_rule));
524 check_tables(&cls, 1, 1, 0);
525 compare_classifiers(&cls, &tcls);
527 classifier_remove(&cls, &rule->cls_rule);
528 tcls_remove(&tcls, tcls_rule);
529 assert(classifier_is_empty(&cls));
530 assert(tcls_is_empty(&tcls));
531 compare_classifiers(&cls, &tcls);
534 classifier_destroy(&cls);
539 /* Tests replacing one rule by another. */
541 test_rule_replacement(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
543 unsigned int wc_fields;
545 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
546 struct classifier cls;
547 struct test_rule *rule1;
548 struct test_rule *rule2;
551 rule1 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
552 rule2 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
556 classifier_init(&cls);
558 tcls_insert(&tcls, rule1);
559 assert(!classifier_insert(&cls, &rule1->cls_rule));
560 check_tables(&cls, 1, 1, 0);
561 compare_classifiers(&cls, &tcls);
565 tcls_insert(&tcls, rule2);
566 assert(test_rule_from_cls_rule(
567 classifier_insert(&cls, &rule2->cls_rule)) == rule1);
569 check_tables(&cls, 1, 1, 0);
570 compare_classifiers(&cls, &tcls);
572 destroy_classifier(&cls);
577 factorial(int n_items)
582 for (i = 2; i <= n_items; i++) {
597 reverse(int *a, int n)
601 for (i = 0; i < n / 2; i++) {
608 next_permutation(int *a, int n)
612 for (k = n - 2; k >= 0; k--) {
613 if (a[k] < a[k + 1]) {
616 for (l = n - 1; ; l--) {
619 reverse(a + (k + 1), n - (k + 1));
628 /* Tests classification with rules that have the same matching criteria. */
630 test_many_rules_in_one_list (int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
632 enum { N_RULES = 3 };
635 for (n_pris = N_RULES; n_pris >= 1; n_pris--) {
636 int ops[N_RULES * 2];
642 for (i = 1; i < N_RULES; i++) {
643 pris[i] = pris[i - 1] + (n_pris > i);
646 for (i = 0; i < N_RULES * 2; i++) {
652 struct test_rule *rules[N_RULES];
653 struct test_rule *tcls_rules[N_RULES];
654 int pri_rules[N_RULES];
655 struct classifier cls;
660 for (i = 0; i < N_RULES; i++) {
661 rules[i] = make_rule(456, pris[i], 0);
662 tcls_rules[i] = NULL;
666 classifier_init(&cls);
669 for (i = 0; i < ARRAY_SIZE(ops); i++) {
673 if (!tcls_rules[j]) {
674 struct test_rule *displaced_rule;
676 tcls_rules[j] = tcls_insert(&tcls, rules[j]);
677 displaced_rule = test_rule_from_cls_rule(
678 classifier_insert(&cls, &rules[j]->cls_rule));
679 if (pri_rules[pris[j]] >= 0) {
680 int k = pri_rules[pris[j]];
681 assert(displaced_rule != NULL);
682 assert(displaced_rule != rules[j]);
683 assert(pris[j] == displaced_rule->cls_rule.priority);
684 tcls_rules[k] = NULL;
686 assert(displaced_rule == NULL);
688 pri_rules[pris[j]] = j;
690 classifier_remove(&cls, &rules[j]->cls_rule);
691 tcls_remove(&tcls, tcls_rules[j]);
692 tcls_rules[j] = NULL;
693 pri_rules[pris[j]] = -1;
697 for (m = 0; m < N_RULES; m++) {
698 n += tcls_rules[m] != NULL;
700 check_tables(&cls, n > 0, n, n - 1);
702 compare_classifiers(&cls, &tcls);
705 classifier_destroy(&cls);
708 for (i = 0; i < N_RULES; i++) {
711 } while (next_permutation(ops, ARRAY_SIZE(ops)));
712 assert(n_permutations == (factorial(N_RULES * 2) >> N_RULES));
717 count_ones(unsigned long int x)
730 array_contains(int *array, int n, int value)
734 for (i = 0; i < n; i++) {
735 if (array[i] == value) {
743 /* Tests classification with two rules at a time that fall into the same
744 * table but different lists. */
746 test_many_rules_in_one_table(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
750 for (iteration = 0; iteration < 50; iteration++) {
751 enum { N_RULES = 20 };
752 struct test_rule *rules[N_RULES];
753 struct test_rule *tcls_rules[N_RULES];
754 struct classifier cls;
756 int value_pats[N_RULES];
762 wcf = rand() & ((1u << CLS_N_FIELDS) - 1);
763 value_mask = ~wcf & ((1u << CLS_N_FIELDS) - 1);
764 } while ((1 << count_ones(value_mask)) < N_RULES);
766 classifier_init(&cls);
769 for (i = 0; i < N_RULES; i++) {
770 unsigned int priority = rand();
773 value_pats[i] = rand() & value_mask;
774 } while (array_contains(value_pats, i, value_pats[i]));
776 rules[i] = make_rule(wcf, priority, value_pats[i]);
777 tcls_rules[i] = tcls_insert(&tcls, rules[i]);
778 assert(!classifier_insert(&cls, &rules[i]->cls_rule));
780 check_tables(&cls, 1, i + 1, 0);
781 compare_classifiers(&cls, &tcls);
784 for (i = 0; i < N_RULES; i++) {
785 tcls_remove(&tcls, tcls_rules[i]);
786 classifier_remove(&cls, &rules[i]->cls_rule);
789 check_tables(&cls, i < N_RULES - 1, N_RULES - (i + 1), 0);
790 compare_classifiers(&cls, &tcls);
793 classifier_destroy(&cls);
798 /* Tests classification with many rules at a time that fall into random lists
801 test_many_rules_in_n_tables(int n_tables)
803 enum { MAX_RULES = 50 };
808 assert(n_tables < 10);
809 for (i = 0; i < n_tables; i++) {
811 wcfs[i] = rand() & ((1u << CLS_N_FIELDS) - 1);
812 } while (array_contains(wcfs, i, wcfs[i]));
815 for (iteration = 0; iteration < 30; iteration++) {
816 unsigned int priorities[MAX_RULES];
817 struct classifier cls;
821 for (i = 0; i < MAX_RULES; i++) {
822 priorities[i] = i * 129;
824 shuffle(priorities, ARRAY_SIZE(priorities));
826 classifier_init(&cls);
829 for (i = 0; i < MAX_RULES; i++) {
830 struct test_rule *rule;
831 unsigned int priority = priorities[i];
832 int wcf = wcfs[rand() % n_tables];
833 int value_pat = rand() & ((1u << CLS_N_FIELDS) - 1);
834 rule = make_rule(wcf, priority, value_pat);
835 tcls_insert(&tcls, rule);
836 assert(!classifier_insert(&cls, &rule->cls_rule));
837 check_tables(&cls, -1, i + 1, -1);
838 compare_classifiers(&cls, &tcls);
841 while (!classifier_is_empty(&cls)) {
842 struct test_rule *rule, *next_rule;
843 struct test_rule *target;
844 struct cls_cursor cursor;
846 target = xmemdup(tcls.rules[rand() % tcls.n_rules],
847 sizeof(struct test_rule));
849 cls_cursor_init(&cursor, &cls, &target->cls_rule);
850 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
851 classifier_remove(&cls, &rule->cls_rule);
854 tcls_delete_matches(&tcls, &target->cls_rule);
855 compare_classifiers(&cls, &tcls);
856 check_tables(&cls, -1, -1, -1);
860 destroy_classifier(&cls);
866 test_many_rules_in_two_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
868 test_many_rules_in_n_tables(2);
872 test_many_rules_in_five_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
874 test_many_rules_in_n_tables(5);
877 static const struct command commands[] = {
878 {"empty", 0, 0, test_empty},
879 {"destroy-null", 0, 0, test_destroy_null},
880 {"single-rule", 0, 0, test_single_rule},
881 {"rule-replacement", 0, 0, test_rule_replacement},
882 {"many-rules-in-one-list", 0, 0, test_many_rules_in_one_list},
883 {"many-rules-in-one-table", 0, 0, test_many_rules_in_one_table},
884 {"many-rules-in-two-tables", 0, 0, test_many_rules_in_two_tables},
885 {"many-rules-in-five-tables", 0, 0, test_many_rules_in_five_tables},
890 main(int argc, char *argv[])
892 set_program_name(argv[0]);
894 run_command(argc - 1, argv + 1, commands);