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 assert(!flow_wildcards_is_exact(&rule->cls_rule.wc)
138 || rule->cls_rule.priority == UINT_MAX);
139 for (i = 0; i < tcls->n_rules; i++) {
140 const struct cls_rule *pos = &tcls->rules[i]->cls_rule;
141 if (cls_rule_equal(pos, &rule->cls_rule)) {
143 free(tcls->rules[i]);
144 tcls->rules[i] = xmemdup(rule, sizeof *rule);
145 return tcls->rules[i];
146 } else if (pos->priority < rule->cls_rule.priority) {
151 if (tcls->n_rules >= tcls->allocated_rules) {
152 tcls->rules = x2nrealloc(tcls->rules, &tcls->allocated_rules,
153 sizeof *tcls->rules);
155 if (i != tcls->n_rules) {
156 memmove(&tcls->rules[i + 1], &tcls->rules[i],
157 sizeof *tcls->rules * (tcls->n_rules - i));
159 tcls->rules[i] = xmemdup(rule, sizeof *rule);
161 return tcls->rules[i];
165 tcls_remove(struct tcls *cls, const struct test_rule *rule)
169 for (i = 0; i < cls->n_rules; i++) {
170 struct test_rule *pos = cls->rules[i];
173 memmove(&cls->rules[i], &cls->rules[i + 1],
174 sizeof *cls->rules * (cls->n_rules - i - 1));
183 match(const struct cls_rule *wild, const struct flow *fixed)
187 for (f_idx = 0; f_idx < CLS_N_FIELDS; f_idx++) {
190 if (f_idx == CLS_F_IDX_NW_SRC) {
191 eq = !((fixed->nw_src ^ wild->flow.nw_src) & wild->wc.nw_src_mask);
192 } else if (f_idx == CLS_F_IDX_NW_DST) {
193 eq = !((fixed->nw_dst ^ wild->flow.nw_dst) & wild->wc.nw_dst_mask);
194 } else if (f_idx == CLS_F_IDX_TP_SRC) {
195 eq = !((fixed->tp_src ^ wild->flow.tp_src) & wild->wc.tp_src_mask);
196 } else if (f_idx == CLS_F_IDX_TP_DST) {
197 eq = !((fixed->tp_dst ^ wild->flow.tp_dst) & wild->wc.tp_dst_mask);
198 } else if (f_idx == CLS_F_IDX_DL_SRC) {
199 eq = eth_addr_equal_except(fixed->dl_src, wild->flow.dl_src,
200 wild->wc.dl_src_mask);
201 } else if (f_idx == CLS_F_IDX_DL_DST) {
202 eq = eth_addr_equal_except(fixed->dl_dst, wild->flow.dl_dst,
203 wild->wc.dl_dst_mask);
204 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
205 eq = !((fixed->vlan_tci ^ wild->flow.vlan_tci)
206 & wild->wc.vlan_tci_mask);
207 } else if (f_idx == CLS_F_IDX_TUN_ID) {
208 eq = !((fixed->tun_id ^ wild->flow.tun_id) & wild->wc.tun_id_mask);
209 } else if (f_idx == CLS_F_IDX_METADATA) {
210 eq = !((fixed->metadata ^ wild->flow.metadata)
211 & wild->wc.metadata_mask);
212 } else if (f_idx == CLS_F_IDX_NW_DSCP) {
213 eq = !((fixed->nw_tos ^ wild->flow.nw_tos) &
214 (wild->wc.nw_tos_mask & IP_DSCP_MASK));
215 } else if (f_idx == CLS_F_IDX_NW_PROTO) {
216 eq = !((fixed->nw_proto ^ wild->flow.nw_proto)
217 & wild->wc.nw_proto_mask);
218 } else if (f_idx == CLS_F_IDX_DL_TYPE) {
219 eq = !((fixed->dl_type ^ wild->flow.dl_type)
220 & wild->wc.dl_type_mask);
221 } else if (f_idx == CLS_F_IDX_IN_PORT) {
222 eq = !((fixed->in_port ^ wild->flow.in_port)
223 & wild->wc.in_port_mask);
235 static struct cls_rule *
236 tcls_lookup(const struct tcls *cls, const struct flow *flow)
240 for (i = 0; i < cls->n_rules; i++) {
241 struct test_rule *pos = cls->rules[i];
242 if (match(&pos->cls_rule, flow)) {
243 return &pos->cls_rule;
250 tcls_delete_matches(struct tcls *cls, const struct cls_rule *target)
254 for (i = 0; i < cls->n_rules; ) {
255 struct test_rule *pos = cls->rules[i];
256 if (!flow_wildcards_has_extra(&pos->cls_rule.wc, &target->wc)
257 && match(target, &pos->cls_rule.flow)) {
258 tcls_remove(cls, pos);
265 static ovs_be32 nw_src_values[] = { CONSTANT_HTONL(0xc0a80001),
266 CONSTANT_HTONL(0xc0a04455) };
267 static ovs_be32 nw_dst_values[] = { CONSTANT_HTONL(0xc0a80002),
268 CONSTANT_HTONL(0xc0a04455) };
269 static ovs_be64 tun_id_values[] = {
271 CONSTANT_HTONLL(UINT64_C(0xfedcba9876543210)) };
272 static ovs_be64 metadata_values[] = {
274 CONSTANT_HTONLL(UINT64_C(0xfedcba9876543210)) };
275 static uint16_t in_port_values[] = { 1, OFPP_LOCAL };
276 static ovs_be16 vlan_tci_values[] = { CONSTANT_HTONS(101), CONSTANT_HTONS(0) };
277 static ovs_be16 dl_type_values[]
278 = { CONSTANT_HTONS(ETH_TYPE_IP), CONSTANT_HTONS(ETH_TYPE_ARP) };
279 static ovs_be16 tp_src_values[] = { CONSTANT_HTONS(49362),
280 CONSTANT_HTONS(80) };
281 static ovs_be16 tp_dst_values[] = { CONSTANT_HTONS(6667), CONSTANT_HTONS(22) };
282 static uint8_t dl_src_values[][6] = { { 0x00, 0x02, 0xe3, 0x0f, 0x80, 0xa4 },
283 { 0x5e, 0x33, 0x7f, 0x5f, 0x1e, 0x99 } };
284 static uint8_t dl_dst_values[][6] = { { 0x4a, 0x27, 0x71, 0xae, 0x64, 0xc1 },
285 { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff } };
286 static uint8_t nw_proto_values[] = { IPPROTO_TCP, IPPROTO_ICMP };
287 static uint8_t nw_dscp_values[] = { 48, 0 };
289 static void *values[CLS_N_FIELDS][2];
294 values[CLS_F_IDX_TUN_ID][0] = &tun_id_values[0];
295 values[CLS_F_IDX_TUN_ID][1] = &tun_id_values[1];
297 values[CLS_F_IDX_METADATA][0] = &metadata_values[0];
298 values[CLS_F_IDX_METADATA][1] = &metadata_values[1];
300 values[CLS_F_IDX_IN_PORT][0] = &in_port_values[0];
301 values[CLS_F_IDX_IN_PORT][1] = &in_port_values[1];
303 values[CLS_F_IDX_VLAN_TCI][0] = &vlan_tci_values[0];
304 values[CLS_F_IDX_VLAN_TCI][1] = &vlan_tci_values[1];
306 values[CLS_F_IDX_DL_SRC][0] = dl_src_values[0];
307 values[CLS_F_IDX_DL_SRC][1] = dl_src_values[1];
309 values[CLS_F_IDX_DL_DST][0] = dl_dst_values[0];
310 values[CLS_F_IDX_DL_DST][1] = dl_dst_values[1];
312 values[CLS_F_IDX_DL_TYPE][0] = &dl_type_values[0];
313 values[CLS_F_IDX_DL_TYPE][1] = &dl_type_values[1];
315 values[CLS_F_IDX_NW_SRC][0] = &nw_src_values[0];
316 values[CLS_F_IDX_NW_SRC][1] = &nw_src_values[1];
318 values[CLS_F_IDX_NW_DST][0] = &nw_dst_values[0];
319 values[CLS_F_IDX_NW_DST][1] = &nw_dst_values[1];
321 values[CLS_F_IDX_NW_PROTO][0] = &nw_proto_values[0];
322 values[CLS_F_IDX_NW_PROTO][1] = &nw_proto_values[1];
324 values[CLS_F_IDX_NW_DSCP][0] = &nw_dscp_values[0];
325 values[CLS_F_IDX_NW_DSCP][1] = &nw_dscp_values[1];
327 values[CLS_F_IDX_TP_SRC][0] = &tp_src_values[0];
328 values[CLS_F_IDX_TP_SRC][1] = &tp_src_values[1];
330 values[CLS_F_IDX_TP_DST][0] = &tp_dst_values[0];
331 values[CLS_F_IDX_TP_DST][1] = &tp_dst_values[1];
334 #define N_NW_SRC_VALUES ARRAY_SIZE(nw_src_values)
335 #define N_NW_DST_VALUES ARRAY_SIZE(nw_dst_values)
336 #define N_TUN_ID_VALUES ARRAY_SIZE(tun_id_values)
337 #define N_METADATA_VALUES ARRAY_SIZE(metadata_values)
338 #define N_IN_PORT_VALUES ARRAY_SIZE(in_port_values)
339 #define N_VLAN_TCI_VALUES ARRAY_SIZE(vlan_tci_values)
340 #define N_DL_TYPE_VALUES ARRAY_SIZE(dl_type_values)
341 #define N_TP_SRC_VALUES ARRAY_SIZE(tp_src_values)
342 #define N_TP_DST_VALUES ARRAY_SIZE(tp_dst_values)
343 #define N_DL_SRC_VALUES ARRAY_SIZE(dl_src_values)
344 #define N_DL_DST_VALUES ARRAY_SIZE(dl_dst_values)
345 #define N_NW_PROTO_VALUES ARRAY_SIZE(nw_proto_values)
346 #define N_NW_DSCP_VALUES ARRAY_SIZE(nw_dscp_values)
348 #define N_FLOW_VALUES (N_NW_SRC_VALUES * \
352 N_VLAN_TCI_VALUES * \
358 N_NW_PROTO_VALUES * \
362 get_value(unsigned int *x, unsigned n_values)
364 unsigned int rem = *x % n_values;
370 compare_classifiers(struct classifier *cls, struct tcls *tcls)
372 static const int confidence = 500;
375 assert(classifier_count(cls) == tcls->n_rules);
376 for (i = 0; i < confidence; i++) {
377 struct cls_rule *cr0, *cr1;
381 x = rand () % N_FLOW_VALUES;
382 memset(&flow, 0, sizeof flow);
383 flow.nw_src = nw_src_values[get_value(&x, N_NW_SRC_VALUES)];
384 flow.nw_dst = nw_dst_values[get_value(&x, N_NW_DST_VALUES)];
385 flow.tun_id = tun_id_values[get_value(&x, N_TUN_ID_VALUES)];
386 flow.metadata = metadata_values[get_value(&x, N_METADATA_VALUES)];
387 flow.in_port = in_port_values[get_value(&x, N_IN_PORT_VALUES)];
388 flow.vlan_tci = vlan_tci_values[get_value(&x, N_VLAN_TCI_VALUES)];
389 flow.dl_type = dl_type_values[get_value(&x, N_DL_TYPE_VALUES)];
390 flow.tp_src = tp_src_values[get_value(&x, N_TP_SRC_VALUES)];
391 flow.tp_dst = tp_dst_values[get_value(&x, N_TP_DST_VALUES)];
392 memcpy(flow.dl_src, dl_src_values[get_value(&x, N_DL_SRC_VALUES)],
394 memcpy(flow.dl_dst, dl_dst_values[get_value(&x, N_DL_DST_VALUES)],
396 flow.nw_proto = nw_proto_values[get_value(&x, N_NW_PROTO_VALUES)];
397 flow.nw_tos = nw_dscp_values[get_value(&x, N_NW_DSCP_VALUES)];
399 cr0 = classifier_lookup(cls, &flow);
400 cr1 = tcls_lookup(tcls, &flow);
401 assert((cr0 == NULL) == (cr1 == NULL));
403 const struct test_rule *tr0 = test_rule_from_cls_rule(cr0);
404 const struct test_rule *tr1 = test_rule_from_cls_rule(cr1);
406 assert(cls_rule_equal(cr0, cr1));
407 assert(tr0->aux == tr1->aux);
413 destroy_classifier(struct classifier *cls)
415 struct test_rule *rule, *next_rule;
416 struct cls_cursor cursor;
418 cls_cursor_init(&cursor, cls, NULL);
419 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
420 classifier_remove(cls, &rule->cls_rule);
423 classifier_destroy(cls);
427 check_tables(const struct classifier *cls,
428 int n_tables, int n_rules, int n_dups)
430 const struct cls_table *table;
431 struct test_rule *test_rule;
432 struct cls_cursor cursor;
433 int found_tables = 0;
436 int found_rules2 = 0;
438 HMAP_FOR_EACH (table, hmap_node, &cls->tables) {
439 const struct cls_rule *head;
441 assert(!hmap_is_empty(&table->rules));
444 HMAP_FOR_EACH (head, hmap_node, &table->rules) {
445 unsigned int prev_priority = UINT_MAX;
446 const struct cls_rule *rule;
449 LIST_FOR_EACH (rule, list, &head->list) {
450 assert(rule->priority < prev_priority);
451 prev_priority = rule->priority;
454 assert(classifier_find_rule_exactly(cls, rule) == rule);
459 assert(found_tables == hmap_count(&cls->tables));
460 assert(n_tables == -1 || n_tables == hmap_count(&cls->tables));
461 assert(n_rules == -1 || found_rules == n_rules);
462 assert(n_dups == -1 || found_dups == n_dups);
464 cls_cursor_init(&cursor, cls, NULL);
465 CLS_CURSOR_FOR_EACH (test_rule, cls_rule, &cursor) {
468 assert(found_rules == found_rules2);
471 static struct test_rule *
472 make_rule(int wc_fields, unsigned int priority, int value_pat)
474 const struct cls_field *f;
475 struct test_rule *rule;
477 rule = xzalloc(sizeof *rule);
478 cls_rule_init_catchall(&rule->cls_rule, wc_fields ? priority : UINT_MAX);
479 for (f = &cls_fields[0]; f < &cls_fields[CLS_N_FIELDS]; f++) {
480 int f_idx = f - cls_fields;
481 int value_idx = (value_pat & (1u << f_idx)) != 0;
482 memcpy((char *) &rule->cls_rule.flow + f->ofs,
483 values[f_idx][value_idx], f->len);
485 if (f_idx == CLS_F_IDX_NW_SRC) {
486 rule->cls_rule.wc.nw_src_mask = htonl(UINT32_MAX);
487 } else if (f_idx == CLS_F_IDX_NW_DST) {
488 rule->cls_rule.wc.nw_dst_mask = htonl(UINT32_MAX);
489 } else if (f_idx == CLS_F_IDX_TP_SRC) {
490 rule->cls_rule.wc.tp_src_mask = htons(UINT16_MAX);
491 } else if (f_idx == CLS_F_IDX_TP_DST) {
492 rule->cls_rule.wc.tp_dst_mask = htons(UINT16_MAX);
493 } else if (f_idx == CLS_F_IDX_DL_SRC) {
494 memset(rule->cls_rule.wc.dl_src_mask, 0xff, ETH_ADDR_LEN);
495 } else if (f_idx == CLS_F_IDX_DL_DST) {
496 memset(rule->cls_rule.wc.dl_dst_mask, 0xff, ETH_ADDR_LEN);
497 } else if (f_idx == CLS_F_IDX_VLAN_TCI) {
498 rule->cls_rule.wc.vlan_tci_mask = htons(UINT16_MAX);
499 } else if (f_idx == CLS_F_IDX_TUN_ID) {
500 rule->cls_rule.wc.tun_id_mask = htonll(UINT64_MAX);
501 } else if (f_idx == CLS_F_IDX_METADATA) {
502 rule->cls_rule.wc.metadata_mask = htonll(UINT64_MAX);
503 } else if (f_idx == CLS_F_IDX_NW_DSCP) {
504 rule->cls_rule.wc.nw_tos_mask |= IP_DSCP_MASK;
505 } else if (f_idx == CLS_F_IDX_NW_PROTO) {
506 rule->cls_rule.wc.nw_proto_mask = UINT8_MAX;
507 } else if (f_idx == CLS_F_IDX_DL_TYPE) {
508 rule->cls_rule.wc.dl_type_mask = htons(UINT16_MAX);
509 } else if (f_idx == CLS_F_IDX_IN_PORT) {
510 rule->cls_rule.wc.in_port_mask = UINT16_MAX;
519 shuffle(unsigned int *p, size_t n)
521 for (; n > 1; n--, p++) {
522 unsigned int *q = &p[rand() % n];
523 unsigned int tmp = *p;
529 /* Tests an empty classifier. */
531 test_empty(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
533 struct classifier cls;
536 classifier_init(&cls);
538 assert(classifier_is_empty(&cls));
539 assert(tcls_is_empty(&tcls));
540 compare_classifiers(&cls, &tcls);
541 classifier_destroy(&cls);
545 /* Destroys a null classifier. */
547 test_destroy_null(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
549 classifier_destroy(NULL);
552 /* Tests classification with one rule at a time. */
554 test_single_rule(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
556 unsigned int wc_fields; /* Hilarious. */
558 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
559 struct classifier cls;
560 struct test_rule *rule, *tcls_rule;
563 rule = make_rule(wc_fields,
564 hash_bytes(&wc_fields, sizeof wc_fields, 0), 0);
566 classifier_init(&cls);
569 tcls_rule = tcls_insert(&tcls, rule);
570 classifier_insert(&cls, &rule->cls_rule);
571 check_tables(&cls, 1, 1, 0);
572 compare_classifiers(&cls, &tcls);
574 classifier_remove(&cls, &rule->cls_rule);
575 tcls_remove(&tcls, tcls_rule);
576 assert(classifier_is_empty(&cls));
577 assert(tcls_is_empty(&tcls));
578 compare_classifiers(&cls, &tcls);
581 classifier_destroy(&cls);
586 /* Tests replacing one rule by another. */
588 test_rule_replacement(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
590 unsigned int wc_fields;
592 for (wc_fields = 0; wc_fields < (1u << CLS_N_FIELDS); wc_fields++) {
593 struct classifier cls;
594 struct test_rule *rule1;
595 struct test_rule *rule2;
598 rule1 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
599 rule2 = make_rule(wc_fields, OFP_DEFAULT_PRIORITY, UINT_MAX);
603 classifier_init(&cls);
605 tcls_insert(&tcls, rule1);
606 classifier_insert(&cls, &rule1->cls_rule);
607 check_tables(&cls, 1, 1, 0);
608 compare_classifiers(&cls, &tcls);
612 tcls_insert(&tcls, rule2);
613 assert(test_rule_from_cls_rule(
614 classifier_replace(&cls, &rule2->cls_rule)) == rule1);
616 check_tables(&cls, 1, 1, 0);
617 compare_classifiers(&cls, &tcls);
619 destroy_classifier(&cls);
624 factorial(int n_items)
629 for (i = 2; i <= n_items; i++) {
644 reverse(int *a, int n)
648 for (i = 0; i < n / 2; i++) {
655 next_permutation(int *a, int n)
659 for (k = n - 2; k >= 0; k--) {
660 if (a[k] < a[k + 1]) {
663 for (l = n - 1; ; l--) {
666 reverse(a + (k + 1), n - (k + 1));
675 /* Tests classification with rules that have the same matching criteria. */
677 test_many_rules_in_one_list (int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
679 enum { N_RULES = 3 };
682 for (n_pris = N_RULES; n_pris >= 1; n_pris--) {
683 int ops[N_RULES * 2];
689 for (i = 1; i < N_RULES; i++) {
690 pris[i] = pris[i - 1] + (n_pris > i);
693 for (i = 0; i < N_RULES * 2; i++) {
699 struct test_rule *rules[N_RULES];
700 struct test_rule *tcls_rules[N_RULES];
701 int pri_rules[N_RULES];
702 struct classifier cls;
707 for (i = 0; i < N_RULES; i++) {
708 rules[i] = make_rule(456, pris[i], 0);
709 tcls_rules[i] = NULL;
713 classifier_init(&cls);
716 for (i = 0; i < ARRAY_SIZE(ops); i++) {
720 if (!tcls_rules[j]) {
721 struct test_rule *displaced_rule;
723 tcls_rules[j] = tcls_insert(&tcls, rules[j]);
724 displaced_rule = test_rule_from_cls_rule(
725 classifier_replace(&cls, &rules[j]->cls_rule));
726 if (pri_rules[pris[j]] >= 0) {
727 int k = pri_rules[pris[j]];
728 assert(displaced_rule != NULL);
729 assert(displaced_rule != rules[j]);
730 assert(pris[j] == displaced_rule->cls_rule.priority);
731 tcls_rules[k] = NULL;
733 assert(displaced_rule == NULL);
735 pri_rules[pris[j]] = j;
737 classifier_remove(&cls, &rules[j]->cls_rule);
738 tcls_remove(&tcls, tcls_rules[j]);
739 tcls_rules[j] = NULL;
740 pri_rules[pris[j]] = -1;
744 for (m = 0; m < N_RULES; m++) {
745 n += tcls_rules[m] != NULL;
747 check_tables(&cls, n > 0, n, n - 1);
749 compare_classifiers(&cls, &tcls);
752 classifier_destroy(&cls);
755 for (i = 0; i < N_RULES; i++) {
758 } while (next_permutation(ops, ARRAY_SIZE(ops)));
759 assert(n_permutations == (factorial(N_RULES * 2) >> N_RULES));
764 count_ones(unsigned long int x)
777 array_contains(int *array, int n, int value)
781 for (i = 0; i < n; i++) {
782 if (array[i] == value) {
790 /* Tests classification with two rules at a time that fall into the same
791 * table but different lists. */
793 test_many_rules_in_one_table(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
797 for (iteration = 0; iteration < 50; iteration++) {
798 enum { N_RULES = 20 };
799 struct test_rule *rules[N_RULES];
800 struct test_rule *tcls_rules[N_RULES];
801 struct classifier cls;
803 int value_pats[N_RULES];
809 wcf = rand() & ((1u << CLS_N_FIELDS) - 1);
810 value_mask = ~wcf & ((1u << CLS_N_FIELDS) - 1);
811 } while ((1 << count_ones(value_mask)) < N_RULES);
813 classifier_init(&cls);
816 for (i = 0; i < N_RULES; i++) {
817 unsigned int priority = rand();
820 value_pats[i] = rand() & value_mask;
821 } while (array_contains(value_pats, i, value_pats[i]));
823 rules[i] = make_rule(wcf, priority, value_pats[i]);
824 tcls_rules[i] = tcls_insert(&tcls, rules[i]);
825 classifier_insert(&cls, &rules[i]->cls_rule);
827 check_tables(&cls, 1, i + 1, 0);
828 compare_classifiers(&cls, &tcls);
831 for (i = 0; i < N_RULES; i++) {
832 tcls_remove(&tcls, tcls_rules[i]);
833 classifier_remove(&cls, &rules[i]->cls_rule);
836 check_tables(&cls, i < N_RULES - 1, N_RULES - (i + 1), 0);
837 compare_classifiers(&cls, &tcls);
840 classifier_destroy(&cls);
845 /* Tests classification with many rules at a time that fall into random lists
848 test_many_rules_in_n_tables(int n_tables)
850 enum { MAX_RULES = 50 };
855 assert(n_tables < 10);
856 for (i = 0; i < n_tables; i++) {
858 wcfs[i] = rand() & ((1u << CLS_N_FIELDS) - 1);
859 } while (array_contains(wcfs, i, wcfs[i]));
862 for (iteration = 0; iteration < 30; iteration++) {
863 unsigned int priorities[MAX_RULES];
864 struct classifier cls;
868 for (i = 0; i < MAX_RULES; i++) {
869 priorities[i] = i * 129;
871 shuffle(priorities, ARRAY_SIZE(priorities));
873 classifier_init(&cls);
876 for (i = 0; i < MAX_RULES; i++) {
877 struct test_rule *rule;
878 unsigned int priority = priorities[i];
879 int wcf = wcfs[rand() % n_tables];
880 int value_pat = rand() & ((1u << CLS_N_FIELDS) - 1);
881 rule = make_rule(wcf, priority, value_pat);
882 tcls_insert(&tcls, rule);
883 classifier_insert(&cls, &rule->cls_rule);
884 check_tables(&cls, -1, i + 1, -1);
885 compare_classifiers(&cls, &tcls);
888 while (!classifier_is_empty(&cls)) {
889 struct test_rule *rule, *next_rule;
890 struct test_rule *target;
891 struct cls_cursor cursor;
893 target = xmemdup(tcls.rules[rand() % tcls.n_rules],
894 sizeof(struct test_rule));
896 cls_cursor_init(&cursor, &cls, &target->cls_rule);
897 CLS_CURSOR_FOR_EACH_SAFE (rule, next_rule, cls_rule, &cursor) {
898 classifier_remove(&cls, &rule->cls_rule);
901 tcls_delete_matches(&tcls, &target->cls_rule);
902 compare_classifiers(&cls, &tcls);
903 check_tables(&cls, -1, -1, -1);
907 destroy_classifier(&cls);
913 test_many_rules_in_two_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
915 test_many_rules_in_n_tables(2);
919 test_many_rules_in_five_tables(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
921 test_many_rules_in_n_tables(5);
924 static const struct command commands[] = {
925 {"empty", 0, 0, test_empty},
926 {"destroy-null", 0, 0, test_destroy_null},
927 {"single-rule", 0, 0, test_single_rule},
928 {"rule-replacement", 0, 0, test_rule_replacement},
929 {"many-rules-in-one-list", 0, 0, test_many_rules_in_one_list},
930 {"many-rules-in-one-table", 0, 0, test_many_rules_in_one_table},
931 {"many-rules-in-two-tables", 0, 0, test_many_rules_in_two_tables},
932 {"many-rules-in-five-tables", 0, 0, test_many_rules_in_five_tables},
937 main(int argc, char *argv[])
939 set_program_name(argv[0]);
941 run_command(argc - 1, argv + 1, commands);