2 * Copyright (c) 2009, 2010, 2011, 2012 Nicira, Inc.
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 /* member name name */ \
46 /* ----------- -------- */ \
47 CLS_FIELD(tun_id, TUN_ID) \
48 CLS_FIELD(metadata, METADATA) \
49 CLS_FIELD(nw_src, NW_SRC) \
50 CLS_FIELD(nw_dst, NW_DST) \
51 CLS_FIELD(in_port, IN_PORT) \
52 CLS_FIELD(vlan_tci, VLAN_TCI) \
53 CLS_FIELD(dl_type, DL_TYPE) \
54 CLS_FIELD(tp_src, TP_SRC) \
55 CLS_FIELD(tp_dst, TP_DST) \
56 CLS_FIELD(dl_src, DL_SRC) \
57 CLS_FIELD(dl_dst, DL_DST) \
58 CLS_FIELD(nw_proto, NW_PROTO) \
59 CLS_FIELD(nw_tos, NW_DSCP)
63 * (These are also indexed into struct classifier's 'tables' array.) */
65 #define CLS_FIELD(MEMBER, NAME) CLS_F_IDX_##NAME,
71 /* Field information. */
73 int ofs; /* Offset in struct flow. */
74 int len; /* Length in bytes. */
75 const char *name; /* Name (for debugging). */
78 static const struct cls_field cls_fields[CLS_N_FIELDS] = {
79 #define CLS_FIELD(MEMBER, NAME) \
80 { offsetof(struct flow, MEMBER), \
81 sizeof ((struct flow *)0)->MEMBER, \
88 int aux; /* Auxiliary data. */
89 struct cls_rule cls_rule; /* Classifier rule data. */
92 static struct test_rule *
93 test_rule_from_cls_rule(const struct cls_rule *rule)
95 return rule ? CONTAINER_OF(rule, struct test_rule, cls_rule) : NULL;
98 /* Trivial (linear) classifier. */
101 size_t allocated_rules;
102 struct test_rule **rules;
106 tcls_init(struct tcls *tcls)
109 tcls->allocated_rules = 0;
114 tcls_destroy(struct tcls *tcls)
119 for (i = 0; i < tcls->n_rules; i++) {
120 free(tcls->rules[i]);
127 tcls_is_empty(const struct tcls *tcls)
129 return tcls->n_rules == 0;
132 static struct test_rule *
133 tcls_insert(struct tcls *tcls, const struct test_rule *rule)
137 for (i = 0; i < tcls->n_rules; i++) {
138 const struct cls_rule *pos = &tcls->rules[i]->cls_rule;
139 if (cls_rule_equal(pos, &rule->cls_rule)) {
141 free(tcls->rules[i]);
142 tcls->rules[i] = xmemdup(rule, sizeof *rule);
143 return tcls->rules[i];
144 } else if (pos->priority < rule->cls_rule.priority) {
149 if (tcls->n_rules >= tcls->allocated_rules) {
150 tcls->rules = x2nrealloc(tcls->rules, &tcls->allocated_rules,
151 sizeof *tcls->rules);
153 if (i != tcls->n_rules) {
154 memmove(&tcls->rules[i + 1], &tcls->rules[i],
155 sizeof *tcls->rules * (tcls->n_rules - i));
157 tcls->rules[i] = xmemdup(rule, sizeof *rule);
159 return tcls->rules[i];
163 tcls_remove(struct tcls *cls, const struct test_rule *rule)
167 for (i = 0; i < cls->n_rules; i++) {
168 struct test_rule *pos = cls->rules[i];
171 memmove(&cls->rules[i], &cls->rules[i + 1],
172 sizeof *cls->rules * (cls->n_rules - i - 1));
181 match(const struct cls_rule *wild, const struct flow *fixed)
185 for (f_idx = 0; f_idx < CLS_N_FIELDS; f_idx++) {
188 if (f_idx == CLS_F_IDX_NW_SRC) {
189 eq = !((fixed->nw_src ^ wild->match.flow.nw_src)
190 & wild->match.wc.masks.nw_src);
191 } else if (f_idx == CLS_F_IDX_NW_DST) {
192 eq = !((fixed->nw_dst ^ wild->match.flow.nw_dst)
193 & wild->match.wc.masks.nw_dst);
194 } else if (f_idx == CLS_F_IDX_TP_SRC) {
195 eq = !((fixed->tp_src ^ wild->match.flow.tp_src)
196 & wild->match.wc.masks.tp_src);
197 } else if (f_idx == CLS_F_IDX_TP_DST) {
198 eq = !((fixed->tp_dst ^ wild->match.flow.tp_dst)
199 & wild->match.wc.masks.tp_dst);
200 } else if (f_idx == CLS_F_IDX_DL_SRC) {
201 eq = eth_addr_equal_except(fixed->dl_src, wild->match.flow.dl_src,
202 wild->match.wc.masks.dl_src);
203 } else if (f_idx == CLS_F_IDX_DL_DST) {
204 eq = eth_addr_equal_except(fixed->dl_dst, wild->match.flow.dl_dst,
205 wild->match.wc.masks.dl_dst);
206 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
207 eq = !((fixed->vlan_tci ^ wild->match.flow.vlan_tci)
208 & wild->match.wc.masks.vlan_tci);
209 } else if (f_idx == CLS_F_IDX_TUN_ID) {
210 eq = !((fixed->tun_id ^ wild->match.flow.tun_id)
211 & wild->match.wc.masks.tun_id);
212 } else if (f_idx == CLS_F_IDX_METADATA) {
213 eq = !((fixed->metadata ^ wild->match.flow.metadata)
214 & wild->match.wc.masks.metadata);
215 } else if (f_idx == CLS_F_IDX_NW_DSCP) {
216 eq = !((fixed->nw_tos ^ wild->match.flow.nw_tos) &
217 (wild->match.wc.masks.nw_tos & IP_DSCP_MASK));
218 } else if (f_idx == CLS_F_IDX_NW_PROTO) {
219 eq = !((fixed->nw_proto ^ wild->match.flow.nw_proto)
220 & wild->match.wc.masks.nw_proto);
221 } else if (f_idx == CLS_F_IDX_DL_TYPE) {
222 eq = !((fixed->dl_type ^ wild->match.flow.dl_type)
223 & wild->match.wc.masks.dl_type);
224 } else if (f_idx == CLS_F_IDX_IN_PORT) {
225 eq = !((fixed->in_port ^ wild->match.flow.in_port)
226 & wild->match.wc.masks.in_port);
238 static struct cls_rule *
239 tcls_lookup(const struct tcls *cls, const struct flow *flow)
243 for (i = 0; i < cls->n_rules; i++) {
244 struct test_rule *pos = cls->rules[i];
245 if (match(&pos->cls_rule, flow)) {
246 return &pos->cls_rule;
253 tcls_delete_matches(struct tcls *cls, const struct cls_rule *target)
257 for (i = 0; i < cls->n_rules; ) {
258 struct test_rule *pos = cls->rules[i];
259 if (!flow_wildcards_has_extra(&pos->cls_rule.match.wc,
261 && match(target, &pos->cls_rule.match.flow)) {
262 tcls_remove(cls, pos);
269 static ovs_be32 nw_src_values[] = { CONSTANT_HTONL(0xc0a80001),
270 CONSTANT_HTONL(0xc0a04455) };
271 static ovs_be32 nw_dst_values[] = { CONSTANT_HTONL(0xc0a80002),
272 CONSTANT_HTONL(0xc0a04455) };
273 static ovs_be64 tun_id_values[] = {
275 CONSTANT_HTONLL(UINT64_C(0xfedcba9876543210)) };
276 static ovs_be64 metadata_values[] = {
278 CONSTANT_HTONLL(UINT64_C(0xfedcba9876543210)) };
279 static uint16_t in_port_values[] = { 1, OFPP_LOCAL };
280 static ovs_be16 vlan_tci_values[] = { CONSTANT_HTONS(101), CONSTANT_HTONS(0) };
281 static ovs_be16 dl_type_values[]
282 = { CONSTANT_HTONS(ETH_TYPE_IP), CONSTANT_HTONS(ETH_TYPE_ARP) };
283 static ovs_be16 tp_src_values[] = { CONSTANT_HTONS(49362),
284 CONSTANT_HTONS(80) };
285 static ovs_be16 tp_dst_values[] = { CONSTANT_HTONS(6667), CONSTANT_HTONS(22) };
286 static uint8_t dl_src_values[][6] = { { 0x00, 0x02, 0xe3, 0x0f, 0x80, 0xa4 },
287 { 0x5e, 0x33, 0x7f, 0x5f, 0x1e, 0x99 } };
288 static uint8_t dl_dst_values[][6] = { { 0x4a, 0x27, 0x71, 0xae, 0x64, 0xc1 },
289 { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff } };
290 static uint8_t nw_proto_values[] = { IPPROTO_TCP, IPPROTO_ICMP };
291 static uint8_t nw_dscp_values[] = { 48, 0 };
293 static void *values[CLS_N_FIELDS][2];
298 values[CLS_F_IDX_TUN_ID][0] = &tun_id_values[0];
299 values[CLS_F_IDX_TUN_ID][1] = &tun_id_values[1];
301 values[CLS_F_IDX_METADATA][0] = &metadata_values[0];
302 values[CLS_F_IDX_METADATA][1] = &metadata_values[1];
304 values[CLS_F_IDX_IN_PORT][0] = &in_port_values[0];
305 values[CLS_F_IDX_IN_PORT][1] = &in_port_values[1];
307 values[CLS_F_IDX_VLAN_TCI][0] = &vlan_tci_values[0];
308 values[CLS_F_IDX_VLAN_TCI][1] = &vlan_tci_values[1];
310 values[CLS_F_IDX_DL_SRC][0] = dl_src_values[0];
311 values[CLS_F_IDX_DL_SRC][1] = dl_src_values[1];
313 values[CLS_F_IDX_DL_DST][0] = dl_dst_values[0];
314 values[CLS_F_IDX_DL_DST][1] = dl_dst_values[1];
316 values[CLS_F_IDX_DL_TYPE][0] = &dl_type_values[0];
317 values[CLS_F_IDX_DL_TYPE][1] = &dl_type_values[1];
319 values[CLS_F_IDX_NW_SRC][0] = &nw_src_values[0];
320 values[CLS_F_IDX_NW_SRC][1] = &nw_src_values[1];
322 values[CLS_F_IDX_NW_DST][0] = &nw_dst_values[0];
323 values[CLS_F_IDX_NW_DST][1] = &nw_dst_values[1];
325 values[CLS_F_IDX_NW_PROTO][0] = &nw_proto_values[0];
326 values[CLS_F_IDX_NW_PROTO][1] = &nw_proto_values[1];
328 values[CLS_F_IDX_NW_DSCP][0] = &nw_dscp_values[0];
329 values[CLS_F_IDX_NW_DSCP][1] = &nw_dscp_values[1];
331 values[CLS_F_IDX_TP_SRC][0] = &tp_src_values[0];
332 values[CLS_F_IDX_TP_SRC][1] = &tp_src_values[1];
334 values[CLS_F_IDX_TP_DST][0] = &tp_dst_values[0];
335 values[CLS_F_IDX_TP_DST][1] = &tp_dst_values[1];
338 #define N_NW_SRC_VALUES ARRAY_SIZE(nw_src_values)
339 #define N_NW_DST_VALUES ARRAY_SIZE(nw_dst_values)
340 #define N_TUN_ID_VALUES ARRAY_SIZE(tun_id_values)
341 #define N_METADATA_VALUES ARRAY_SIZE(metadata_values)
342 #define N_IN_PORT_VALUES ARRAY_SIZE(in_port_values)
343 #define N_VLAN_TCI_VALUES ARRAY_SIZE(vlan_tci_values)
344 #define N_DL_TYPE_VALUES ARRAY_SIZE(dl_type_values)
345 #define N_TP_SRC_VALUES ARRAY_SIZE(tp_src_values)
346 #define N_TP_DST_VALUES ARRAY_SIZE(tp_dst_values)
347 #define N_DL_SRC_VALUES ARRAY_SIZE(dl_src_values)
348 #define N_DL_DST_VALUES ARRAY_SIZE(dl_dst_values)
349 #define N_NW_PROTO_VALUES ARRAY_SIZE(nw_proto_values)
350 #define N_NW_DSCP_VALUES ARRAY_SIZE(nw_dscp_values)
352 #define N_FLOW_VALUES (N_NW_SRC_VALUES * \
356 N_VLAN_TCI_VALUES * \
362 N_NW_PROTO_VALUES * \
366 get_value(unsigned int *x, unsigned n_values)
368 unsigned int rem = *x % n_values;
374 compare_classifiers(struct classifier *cls, struct tcls *tcls)
376 static const int confidence = 500;
379 assert(classifier_count(cls) == tcls->n_rules);
380 for (i = 0; i < confidence; i++) {
381 struct cls_rule *cr0, *cr1;
385 x = rand () % N_FLOW_VALUES;
386 memset(&flow, 0, sizeof flow);
387 flow.nw_src = nw_src_values[get_value(&x, N_NW_SRC_VALUES)];
388 flow.nw_dst = nw_dst_values[get_value(&x, N_NW_DST_VALUES)];
389 flow.tun_id = tun_id_values[get_value(&x, N_TUN_ID_VALUES)];
390 flow.metadata = metadata_values[get_value(&x, N_METADATA_VALUES)];
391 flow.in_port = in_port_values[get_value(&x, N_IN_PORT_VALUES)];
392 flow.vlan_tci = vlan_tci_values[get_value(&x, N_VLAN_TCI_VALUES)];
393 flow.dl_type = dl_type_values[get_value(&x, N_DL_TYPE_VALUES)];
394 flow.tp_src = tp_src_values[get_value(&x, N_TP_SRC_VALUES)];
395 flow.tp_dst = tp_dst_values[get_value(&x, N_TP_DST_VALUES)];
396 memcpy(flow.dl_src, dl_src_values[get_value(&x, N_DL_SRC_VALUES)],
398 memcpy(flow.dl_dst, dl_dst_values[get_value(&x, N_DL_DST_VALUES)],
400 flow.nw_proto = nw_proto_values[get_value(&x, N_NW_PROTO_VALUES)];
401 flow.nw_tos = nw_dscp_values[get_value(&x, N_NW_DSCP_VALUES)];
403 cr0 = classifier_lookup(cls, &flow);
404 cr1 = tcls_lookup(tcls, &flow);
405 assert((cr0 == NULL) == (cr1 == NULL));
407 const struct test_rule *tr0 = test_rule_from_cls_rule(cr0);
408 const struct test_rule *tr1 = test_rule_from_cls_rule(cr1);
410 assert(cls_rule_equal(cr0, cr1));
411 assert(tr0->aux == tr1->aux);
417 destroy_classifier(struct classifier *cls)
419 struct test_rule *rule, *next_rule;
420 struct cls_cursor cursor;
422 cls_cursor_init(&cursor, cls, NULL);
423 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
424 classifier_remove(cls, &rule->cls_rule);
427 classifier_destroy(cls);
431 check_tables(const struct classifier *cls,
432 int n_tables, int n_rules, int n_dups)
434 const struct cls_table *table;
435 struct test_rule *test_rule;
436 struct cls_cursor cursor;
437 int found_tables = 0;
440 int found_rules2 = 0;
442 HMAP_FOR_EACH (table, hmap_node, &cls->tables) {
443 const struct cls_rule *head;
445 assert(!hmap_is_empty(&table->rules));
448 HMAP_FOR_EACH (head, hmap_node, &table->rules) {
449 unsigned int prev_priority = UINT_MAX;
450 const struct cls_rule *rule;
453 LIST_FOR_EACH (rule, list, &head->list) {
454 assert(rule->priority < prev_priority);
455 prev_priority = rule->priority;
458 assert(classifier_find_rule_exactly(cls, rule) == rule);
463 assert(found_tables == hmap_count(&cls->tables));
464 assert(n_tables == -1 || n_tables == hmap_count(&cls->tables));
465 assert(n_rules == -1 || found_rules == n_rules);
466 assert(n_dups == -1 || found_dups == n_dups);
468 cls_cursor_init(&cursor, cls, NULL);
469 CLS_CURSOR_FOR_EACH (test_rule, cls_rule, &cursor) {
472 assert(found_rules == found_rules2);
475 static struct test_rule *
476 make_rule(int wc_fields, unsigned int priority, int value_pat)
478 const struct cls_field *f;
479 struct test_rule *rule;
482 match_init_catchall(&match);
483 for (f = &cls_fields[0]; f < &cls_fields[CLS_N_FIELDS]; f++) {
484 int f_idx = f - cls_fields;
485 int value_idx = (value_pat & (1u << f_idx)) != 0;
486 memcpy((char *) &match.flow + f->ofs,
487 values[f_idx][value_idx], f->len);
489 if (f_idx == CLS_F_IDX_NW_SRC) {
490 match.wc.masks.nw_src = htonl(UINT32_MAX);
491 } else if (f_idx == CLS_F_IDX_NW_DST) {
492 match.wc.masks.nw_dst = htonl(UINT32_MAX);
493 } else if (f_idx == CLS_F_IDX_TP_SRC) {
494 match.wc.masks.tp_src = htons(UINT16_MAX);
495 } else if (f_idx == CLS_F_IDX_TP_DST) {
496 match.wc.masks.tp_dst = htons(UINT16_MAX);
497 } else if (f_idx == CLS_F_IDX_DL_SRC) {
498 memset(match.wc.masks.dl_src, 0xff, ETH_ADDR_LEN);
499 } else if (f_idx == CLS_F_IDX_DL_DST) {
500 memset(match.wc.masks.dl_dst, 0xff, ETH_ADDR_LEN);
501 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
502 match.wc.masks.vlan_tci = htons(UINT16_MAX);
503 } else if (f_idx == CLS_F_IDX_TUN_ID) {
504 match.wc.masks.tun_id = htonll(UINT64_MAX);
505 } else if (f_idx == CLS_F_IDX_METADATA) {
506 match.wc.masks.metadata = htonll(UINT64_MAX);
507 } else if (f_idx == CLS_F_IDX_NW_DSCP) {
508 match.wc.masks.nw_tos |= IP_DSCP_MASK;
509 } else if (f_idx == CLS_F_IDX_NW_PROTO) {
510 match.wc.masks.nw_proto = UINT8_MAX;
511 } else if (f_idx == CLS_F_IDX_DL_TYPE) {
512 match.wc.masks.dl_type = htons(UINT16_MAX);
513 } else if (f_idx == CLS_F_IDX_IN_PORT) {
514 match.wc.masks.in_port = UINT16_MAX;
520 rule = xzalloc(sizeof *rule);
521 cls_rule_init(&rule->cls_rule, &match, wc_fields ? priority : UINT_MAX);
526 shuffle(unsigned int *p, size_t n)
528 for (; n > 1; n--, p++) {
529 unsigned int *q = &p[rand() % n];
530 unsigned int tmp = *p;
536 /* Tests an empty classifier. */
538 test_empty(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
540 struct classifier cls;
543 classifier_init(&cls);
545 assert(classifier_is_empty(&cls));
546 assert(tcls_is_empty(&tcls));
547 compare_classifiers(&cls, &tcls);
548 classifier_destroy(&cls);
552 /* Destroys a null classifier. */
554 test_destroy_null(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
556 classifier_destroy(NULL);
559 /* Tests classification with one rule at a time. */
561 test_single_rule(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
563 unsigned int wc_fields; /* Hilarious. */
565 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
566 struct classifier cls;
567 struct test_rule *rule, *tcls_rule;
570 rule = make_rule(wc_fields,
571 hash_bytes(&wc_fields, sizeof wc_fields, 0), 0);
573 classifier_init(&cls);
576 tcls_rule = tcls_insert(&tcls, rule);
577 classifier_insert(&cls, &rule->cls_rule);
578 check_tables(&cls, 1, 1, 0);
579 compare_classifiers(&cls, &tcls);
581 classifier_remove(&cls, &rule->cls_rule);
582 tcls_remove(&tcls, tcls_rule);
583 assert(classifier_is_empty(&cls));
584 assert(tcls_is_empty(&tcls));
585 compare_classifiers(&cls, &tcls);
588 classifier_destroy(&cls);
593 /* Tests replacing one rule by another. */
595 test_rule_replacement(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
597 unsigned int wc_fields;
599 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
600 struct classifier cls;
601 struct test_rule *rule1;
602 struct test_rule *rule2;
605 rule1 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
606 rule2 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
610 classifier_init(&cls);
612 tcls_insert(&tcls, rule1);
613 classifier_insert(&cls, &rule1->cls_rule);
614 check_tables(&cls, 1, 1, 0);
615 compare_classifiers(&cls, &tcls);
619 tcls_insert(&tcls, rule2);
620 assert(test_rule_from_cls_rule(
621 classifier_replace(&cls, &rule2->cls_rule)) == rule1);
623 check_tables(&cls, 1, 1, 0);
624 compare_classifiers(&cls, &tcls);
626 destroy_classifier(&cls);
631 factorial(int n_items)
636 for (i = 2; i <= n_items; i++) {
651 reverse(int *a, int n)
655 for (i = 0; i < n / 2; i++) {
662 next_permutation(int *a, int n)
666 for (k = n - 2; k >= 0; k--) {
667 if (a[k] < a[k + 1]) {
670 for (l = n - 1; ; l--) {
673 reverse(a + (k + 1), n - (k + 1));
682 /* Tests classification with rules that have the same matching criteria. */
684 test_many_rules_in_one_list (int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
686 enum { N_RULES = 3 };
689 for (n_pris = N_RULES; n_pris >= 1; n_pris--) {
690 int ops[N_RULES * 2];
696 for (i = 1; i < N_RULES; i++) {
697 pris[i] = pris[i - 1] + (n_pris > i);
700 for (i = 0; i < N_RULES * 2; i++) {
706 struct test_rule *rules[N_RULES];
707 struct test_rule *tcls_rules[N_RULES];
708 int pri_rules[N_RULES];
709 struct classifier cls;
714 for (i = 0; i < N_RULES; i++) {
715 rules[i] = make_rule(456, pris[i], 0);
716 tcls_rules[i] = NULL;
720 classifier_init(&cls);
723 for (i = 0; i < ARRAY_SIZE(ops); i++) {
727 if (!tcls_rules[j]) {
728 struct test_rule *displaced_rule;
730 tcls_rules[j] = tcls_insert(&tcls, rules[j]);
731 displaced_rule = test_rule_from_cls_rule(
732 classifier_replace(&cls, &rules[j]->cls_rule));
733 if (pri_rules[pris[j]] >= 0) {
734 int k = pri_rules[pris[j]];
735 assert(displaced_rule != NULL);
736 assert(displaced_rule != rules[j]);
737 assert(pris[j] == displaced_rule->cls_rule.priority);
738 tcls_rules[k] = NULL;
740 assert(displaced_rule == NULL);
742 pri_rules[pris[j]] = j;
744 classifier_remove(&cls, &rules[j]->cls_rule);
745 tcls_remove(&tcls, tcls_rules[j]);
746 tcls_rules[j] = NULL;
747 pri_rules[pris[j]] = -1;
751 for (m = 0; m < N_RULES; m++) {
752 n += tcls_rules[m] != NULL;
754 check_tables(&cls, n > 0, n, n - 1);
756 compare_classifiers(&cls, &tcls);
759 classifier_destroy(&cls);
762 for (i = 0; i < N_RULES; i++) {
765 } while (next_permutation(ops, ARRAY_SIZE(ops)));
766 assert(n_permutations == (factorial(N_RULES * 2) >> N_RULES));
771 count_ones(unsigned long int x)
776 x = zero_rightmost_1bit(x);
784 array_contains(int *array, int n, int value)
788 for (i = 0; i < n; i++) {
789 if (array[i] == value) {
797 /* Tests classification with two rules at a time that fall into the same
798 * table but different lists. */
800 test_many_rules_in_one_table(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
804 for (iteration = 0; iteration < 50; iteration++) {
805 enum { N_RULES = 20 };
806 struct test_rule *rules[N_RULES];
807 struct test_rule *tcls_rules[N_RULES];
808 struct classifier cls;
810 int value_pats[N_RULES];
816 wcf = rand() & ((1u << CLS_N_FIELDS) - 1);
817 value_mask = ~wcf & ((1u << CLS_N_FIELDS) - 1);
818 } while ((1 << count_ones(value_mask)) < N_RULES);
820 classifier_init(&cls);
823 for (i = 0; i < N_RULES; i++) {
824 unsigned int priority = rand();
827 value_pats[i] = rand() & value_mask;
828 } while (array_contains(value_pats, i, value_pats[i]));
830 rules[i] = make_rule(wcf, priority, value_pats[i]);
831 tcls_rules[i] = tcls_insert(&tcls, rules[i]);
832 classifier_insert(&cls, &rules[i]->cls_rule);
834 check_tables(&cls, 1, i + 1, 0);
835 compare_classifiers(&cls, &tcls);
838 for (i = 0; i < N_RULES; i++) {
839 tcls_remove(&tcls, tcls_rules[i]);
840 classifier_remove(&cls, &rules[i]->cls_rule);
843 check_tables(&cls, i < N_RULES - 1, N_RULES - (i + 1), 0);
844 compare_classifiers(&cls, &tcls);
847 classifier_destroy(&cls);
852 /* Tests classification with many rules at a time that fall into random lists
855 test_many_rules_in_n_tables(int n_tables)
857 enum { MAX_RULES = 50 };
862 assert(n_tables < 10);
863 for (i = 0; i < n_tables; i++) {
865 wcfs[i] = rand() & ((1u << CLS_N_FIELDS) - 1);
866 } while (array_contains(wcfs, i, wcfs[i]));
869 for (iteration = 0; iteration < 30; iteration++) {
870 unsigned int priorities[MAX_RULES];
871 struct classifier cls;
875 for (i = 0; i < MAX_RULES; i++) {
876 priorities[i] = i * 129;
878 shuffle(priorities, ARRAY_SIZE(priorities));
880 classifier_init(&cls);
883 for (i = 0; i < MAX_RULES; i++) {
884 struct test_rule *rule;
885 unsigned int priority = priorities[i];
886 int wcf = wcfs[rand() % n_tables];
887 int value_pat = rand() & ((1u << CLS_N_FIELDS) - 1);
888 rule = make_rule(wcf, priority, value_pat);
889 tcls_insert(&tcls, rule);
890 classifier_insert(&cls, &rule->cls_rule);
891 check_tables(&cls, -1, i + 1, -1);
892 compare_classifiers(&cls, &tcls);
895 while (!classifier_is_empty(&cls)) {
896 struct test_rule *rule, *next_rule;
897 struct test_rule *target;
898 struct cls_cursor cursor;
900 target = xmemdup(tcls.rules[rand() % tcls.n_rules],
901 sizeof(struct test_rule));
903 cls_cursor_init(&cursor, &cls, &target->cls_rule);
904 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
905 classifier_remove(&cls, &rule->cls_rule);
908 tcls_delete_matches(&tcls, &target->cls_rule);
909 compare_classifiers(&cls, &tcls);
910 check_tables(&cls, -1, -1, -1);
914 destroy_classifier(&cls);
920 test_many_rules_in_two_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
922 test_many_rules_in_n_tables(2);
926 test_many_rules_in_five_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
928 test_many_rules_in_n_tables(5);
931 static const struct command commands[] = {
932 {"empty", 0, 0, test_empty},
933 {"destroy-null", 0, 0, test_destroy_null},
934 {"single-rule", 0, 0, test_single_rule},
935 {"rule-replacement", 0, 0, test_rule_replacement},
936 {"many-rules-in-one-list", 0, 0, test_many_rules_in_one_list},
937 {"many-rules-in-one-table", 0, 0, test_many_rules_in_one_table},
938 {"many-rules-in-two-tables", 0, 0, test_many_rules_in_two_tables},
939 {"many-rules-in-five-tables", 0, 0, test_many_rules_in_five_tables},
944 main(int argc, char *argv[])
946 set_program_name(argv[0]);
948 run_command(argc - 1, argv + 1, commands);