forked from openvswitch/ovs
-
Notifications
You must be signed in to change notification settings - Fork 0
/
test-ovn.c
1586 lines (1413 loc) · 48.2 KB
/
test-ovn.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2015, 2016, 2017 Nicira, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <config.h>
#include <errno.h>
#include <getopt.h>
#include <sys/wait.h>
#include "command-line.h"
#include "dp-packet.h"
#include "fatal-signal.h"
#include "flow.h"
#include "openvswitch/dynamic-string.h"
#include "openvswitch/match.h"
#include "openvswitch/ofp-actions.h"
#include "openvswitch/ofpbuf.h"
#include "openvswitch/vlog.h"
#include "ovn/actions.h"
#include "ovn/expr.h"
#include "ovn/lex.h"
#include "ovn/logical-fields.h"
#include "ovn/lib/ovn-l7.h"
#include "ovn/lib/extend-table.h"
#include "ovs-thread.h"
#include "ovstest.h"
#include "openvswitch/shash.h"
#include "simap.h"
#include "util.h"
/* --relops: Bitmap of the relational operators to test, in exhaustive test. */
static unsigned int test_relops;
/* --nvars: Number of numeric variables to test, in exhaustive test. */
static int test_nvars = 2;
/* --svars: Number of string variables to test, in exhaustive test. */
static int test_svars = 2;
/* --bits: Number of bits per variable, in exhaustive test. */
static int test_bits = 3;
/* --operation: The operation to test, in exhaustive test. */
static enum { OP_CONVERT, OP_SIMPLIFY, OP_NORMALIZE, OP_FLOW } operation
= OP_FLOW;
/* --parallel: Number of parallel processes to use in test. */
static int test_parallel = 1;
/* -m, --more: Message verbosity */
static int verbosity;
static void
compare_token(const struct lex_token *a, const struct lex_token *b)
{
if (a->type != b->type) {
fprintf(stderr, "type differs: %d -> %d\n", a->type, b->type);
return;
}
if (!((a->s && b->s && !strcmp(a->s, b->s))
|| (!a->s && !b->s))) {
fprintf(stderr, "string differs: %s -> %s\n",
a->s ? a->s : "(null)",
b->s ? b->s : "(null)");
return;
}
if (a->type == LEX_T_INTEGER || a->type == LEX_T_MASKED_INTEGER) {
if (memcmp(&a->value, &b->value, sizeof a->value)) {
fprintf(stderr, "value differs\n");
return;
}
if (a->type == LEX_T_MASKED_INTEGER
&& memcmp(&a->mask, &b->mask, sizeof a->mask)) {
fprintf(stderr, "mask differs\n");
return;
}
if (a->format != b->format
&& !(a->format == LEX_F_HEXADECIMAL
&& b->format == LEX_F_DECIMAL
&& a->value.integer == 0)) {
fprintf(stderr, "format differs: %d -> %d\n",
a->format, b->format);
}
}
}
static void
test_lex(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
struct ds input;
struct ds output;
ds_init(&input);
ds_init(&output);
while (!ds_get_test_line(&input, stdin)) {
struct lexer lexer;
lexer_init(&lexer, ds_cstr(&input));
ds_clear(&output);
while (lexer_get(&lexer) != LEX_T_END) {
size_t len = output.length;
lex_token_format(&lexer.token, &output);
/* Check that the formatted version can really be parsed back
* losslessly. */
if (lexer.token.type != LEX_T_ERROR) {
const char *s = ds_cstr(&output) + len;
struct lexer l2;
lexer_init(&l2, s);
lexer_get(&l2);
compare_token(&lexer.token, &l2.token);
lexer_destroy(&l2);
}
ds_put_char(&output, ' ');
}
lexer_destroy(&lexer);
ds_chomp(&output, ' ');
puts(ds_cstr(&output));
}
ds_destroy(&input);
ds_destroy(&output);
}
static void
create_symtab(struct shash *symtab)
{
ovn_init_symtab(symtab);
/* For negative testing. */
expr_symtab_add_field(symtab, "bad_prereq", MFF_XREG0, "xyzzy", false);
expr_symtab_add_field(symtab, "self_recurse", MFF_XREG0,
"self_recurse != 0", false);
expr_symtab_add_field(symtab, "mutual_recurse_1", MFF_XREG0,
"mutual_recurse_2 != 0", false);
expr_symtab_add_field(symtab, "mutual_recurse_2", MFF_XREG0,
"mutual_recurse_1 != 0", false);
expr_symtab_add_string(symtab, "big_string", MFF_XREG0, NULL);
}
static void
create_gen_opts(struct hmap *dhcp_opts, struct hmap *dhcpv6_opts,
struct hmap *nd_ra_opts,
struct controller_event_options *event_opts)
{
hmap_init(dhcp_opts);
dhcp_opt_add(dhcp_opts, "offerip", 0, "ipv4");
dhcp_opt_add(dhcp_opts, "netmask", 1, "ipv4");
dhcp_opt_add(dhcp_opts, "router", 3, "ipv4");
dhcp_opt_add(dhcp_opts, "dns_server", 6, "ipv4");
dhcp_opt_add(dhcp_opts, "log_server", 7, "ipv4");
dhcp_opt_add(dhcp_opts, "lpr_server", 9, "ipv4");
dhcp_opt_add(dhcp_opts, "domain_name", 15, "str");
dhcp_opt_add(dhcp_opts, "swap_server", 16, "ipv4");
dhcp_opt_add(dhcp_opts, "policy_filter", 21, "ipv4");
dhcp_opt_add(dhcp_opts, "router_solicitation", 32, "ipv4");
dhcp_opt_add(dhcp_opts, "nis_server", 41, "ipv4");
dhcp_opt_add(dhcp_opts, "ntp_server", 42, "ipv4");
dhcp_opt_add(dhcp_opts, "server_id", 54, "ipv4");
dhcp_opt_add(dhcp_opts, "tftp_server", 66, "ipv4");
dhcp_opt_add(dhcp_opts, "classless_static_route", 121, "static_routes");
dhcp_opt_add(dhcp_opts, "ip_forward_enable", 19, "bool");
dhcp_opt_add(dhcp_opts, "router_discovery", 31, "bool");
dhcp_opt_add(dhcp_opts, "ethernet_encap", 36, "bool");
dhcp_opt_add(dhcp_opts, "default_ttl", 23, "uint8");
dhcp_opt_add(dhcp_opts, "tcp_ttl", 37, "uint8");
dhcp_opt_add(dhcp_opts, "mtu", 26, "uint16");
dhcp_opt_add(dhcp_opts, "lease_time", 51, "uint32");
dhcp_opt_add(dhcp_opts, "wpad", 252, "str");
dhcp_opt_add(dhcp_opts, "bootfile_name", 67, "str");
dhcp_opt_add(dhcp_opts, "path_prefix", 210, "str");
dhcp_opt_add(dhcp_opts, "tftp_server_address", 150, "ipv4");
dhcp_opt_add(dhcp_opts, "file", 300, "str");
/* DHCPv6 options. */
hmap_init(dhcpv6_opts);
dhcp_opt_add(dhcpv6_opts, "server_id", 2, "mac");
dhcp_opt_add(dhcpv6_opts, "ia_addr", 5, "ipv6");
dhcp_opt_add(dhcpv6_opts, "dns_server", 23, "ipv6");
dhcp_opt_add(dhcpv6_opts, "domain_search", 24, "str");
/* IPv6 ND RA options. */
hmap_init(nd_ra_opts);
nd_ra_opts_init(nd_ra_opts);
/* OVN controller events options. */
controller_event_opts_init(event_opts);
}
static void
create_addr_sets(struct shash *addr_sets)
{
shash_init(addr_sets);
static const char *const addrs1[] = {
"10.0.0.1", "10.0.0.2", "10.0.0.3",
};
static const char *const addrs2[] = {
"::1", "::2", "::3",
};
static const char *const addrs3[] = {
"00:00:00:00:00:01", "00:00:00:00:00:02", "00:00:00:00:00:03",
};
static const char *const addrs4[] = { NULL };
expr_const_sets_add(addr_sets, "set1", addrs1, 3, true);
expr_const_sets_add(addr_sets, "set2", addrs2, 3, true);
expr_const_sets_add(addr_sets, "set3", addrs3, 3, true);
expr_const_sets_add(addr_sets, "set4", addrs4, 0, true);
}
static void
create_port_groups(struct shash *port_groups)
{
shash_init(port_groups);
static const char *const pg1[] = {
"lsp1", "lsp2", "lsp3",
};
static const char *const pg2[] = { NULL };
expr_const_sets_add(port_groups, "pg1", pg1, 3, false);
expr_const_sets_add(port_groups, "pg_empty", pg2, 0, false);
}
static bool
lookup_port_cb(const void *ports_, const char *port_name, unsigned int *portp)
{
const struct simap *ports = ports_;
const struct simap_node *node = simap_find(ports, port_name);
if (!node) {
return false;
}
*portp = node->data;
return true;
}
static bool
is_chassis_resident_cb(const void *ports_, const char *port_name)
{
const struct simap *ports = ports_;
const struct simap_node *node = simap_find(ports, port_name);
if (node) {
return true;
}
return false;
}
static void
test_parse_expr__(int steps)
{
struct shash symtab;
struct shash addr_sets;
struct shash port_groups;
struct simap ports;
struct ds input;
create_symtab(&symtab);
create_addr_sets(&addr_sets);
create_port_groups(&port_groups);
simap_init(&ports);
simap_put(&ports, "eth0", 5);
simap_put(&ports, "eth1", 6);
simap_put(&ports, "LOCAL", ofp_to_u16(OFPP_LOCAL));
simap_put(&ports, "lsp1", 0x11);
simap_put(&ports, "lsp2", 0x12);
simap_put(&ports, "lsp3", 0x13);
ds_init(&input);
while (!ds_get_test_line(&input, stdin)) {
struct expr *expr;
char *error;
expr = expr_parse_string(ds_cstr(&input), &symtab, &addr_sets,
&port_groups, NULL, &error);
if (!error && steps > 0) {
expr = expr_annotate(expr, &symtab, &error);
}
if (!error) {
if (steps > 1) {
expr = expr_simplify(expr, is_chassis_resident_cb, &ports);
}
if (steps > 2) {
expr = expr_normalize(expr);
ovs_assert(expr_is_normalized(expr));
}
}
if (!error) {
if (steps > 3) {
struct hmap matches;
expr_to_matches(expr, lookup_port_cb, &ports, &matches);
expr_matches_print(&matches, stdout);
expr_matches_destroy(&matches);
} else {
struct ds output = DS_EMPTY_INITIALIZER;
expr_format(expr, &output);
puts(ds_cstr(&output));
ds_destroy(&output);
}
} else {
puts(error);
free(error);
}
expr_destroy(expr);
}
ds_destroy(&input);
simap_destroy(&ports);
expr_symtab_destroy(&symtab);
shash_destroy(&symtab);
expr_const_sets_destroy(&addr_sets);
shash_destroy(&addr_sets);
expr_const_sets_destroy(&port_groups);
shash_destroy(&port_groups);
}
static void
test_parse_expr(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
test_parse_expr__(0);
}
static void
test_annotate_expr(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
test_parse_expr__(1);
}
static void
test_simplify_expr(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
test_parse_expr__(2);
}
static void
test_normalize_expr(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
test_parse_expr__(3);
}
static void
test_expr_to_flows(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
test_parse_expr__(4);
}
/* Print the symbol table. */
static void
test_dump_symtab(struct ovs_cmdl_context *ctx OVS_UNUSED)
{
struct shash symtab;
create_symtab(&symtab);
const struct shash_node **nodes = shash_sort(&symtab);
for (size_t i = 0; i < shash_count(&symtab); i++) {
const struct expr_symbol *symbol = nodes[i]->data;
struct ds s = DS_EMPTY_INITIALIZER;
expr_symbol_format(symbol, &s);
puts(ds_cstr(&s));
ds_destroy(&s);
}
free(nodes);
expr_symtab_destroy(&symtab);
shash_destroy(&symtab);
}
/* Evaluate an expression. */
static bool
lookup_atoi_cb(const void *aux OVS_UNUSED, const char *port_name,
unsigned int *portp)
{
*portp = atoi(port_name);
return true;
}
static void
test_evaluate_expr(struct ovs_cmdl_context *ctx)
{
struct shash symtab;
struct ds input;
ovn_init_symtab(&symtab);
struct flow uflow;
char *error = expr_parse_microflow(ctx->argv[1], &symtab, NULL, NULL,
lookup_atoi_cb, NULL, &uflow);
if (error) {
ovs_fatal(0, "%s", error);
}
ds_init(&input);
while (!ds_get_test_line(&input, stdin)) {
struct expr *expr;
expr = expr_parse_string(ds_cstr(&input), &symtab, NULL, NULL, NULL,
&error);
if (!error) {
expr = expr_annotate(expr, &symtab, &error);
}
if (!error) {
printf("%d\n", expr_evaluate(expr, &uflow, lookup_atoi_cb, NULL));
} else {
puts(error);
free(error);
}
expr_destroy(expr);
}
ds_destroy(&input);
expr_symtab_destroy(&symtab);
shash_destroy(&symtab);
}
/* Compositions.
*
* The "compositions" of a positive integer N are all of the ways that one can
* add up positive integers to sum to N. For example, the compositions of 3
* are 3, 2+1, 1+2, and 1+1+1.
*
* We use compositions to find all the ways to break up N terms of a Boolean
* expression into subexpressions. Suppose we want to generate all expressions
* with 3 terms. The compositions of 3 (ignoring 3 itself) provide the
* possibilities (x && x) || x, x || (x && x), and x || x || x. (Of course one
* can exchange && for || in each case.) One must recursively compose the
* sub-expressions whose values are 3 or greater; that is what the "tree shape"
* concept later covers.
*
* To iterate through all compositions of, e.g., 5:
*
* unsigned int state;
* int s[5];
* int n;
*
* for (n = first_composition(ARRAY_SIZE(s), &state, s); n > 0;
* n = next_composition(&state, s, n)) {
* // Do something with composition 's' with 'n' elements.
* }
*
* Algorithm from D. E. Knuth, _The Art of Computer Programming, Vol. 4A:
* Combinatorial Algorithms, Part 1_, section 7.2.1.1, answer to exercise
* 12(a).
*/
/* Begins iteration through the compositions of 'n'. Initializes 's' to the
* number of elements in the first composition of 'n' and returns that number
* of elements. The first composition in fact is always 'n' itself, so the
* return value will be 1.
*
* Initializes '*state' to some internal state information. The caller must
* maintain this state (and 's') for use by next_composition().
*
* 's' must have room for at least 'n' elements. */
static int
first_composition(int n, unsigned int *state, int s[])
{
*state = 0;
s[0] = n;
return 1;
}
/* Advances 's', with 'sn' elements, to the next composition and returns the
* number of elements in this new composition, or 0 if no compositions are
* left. 'state' is the same internal state passed to first_composition(). */
static int
next_composition(unsigned int *state, int s[], int sn)
{
int j = sn - 1;
if (++*state & 1) {
if (s[j] > 1) {
s[j]--;
s[j + 1] = 1;
j++;
} else {
j--;
s[j]++;
}
} else {
if (s[j - 1] > 1) {
s[j - 1]--;
s[j + 1] = s[j];
s[j] = 1;
j++;
} else {
j--;
if (!j) {
return 0;
}
s[j] = s[j + 1];
s[j - 1]++;
}
}
return j + 1;
}
static void
test_composition(struct ovs_cmdl_context *ctx)
{
int n = atoi(ctx->argv[1]);
unsigned int state;
int s[50];
for (int sn = first_composition(n, &state, s); sn;
sn = next_composition(&state, s, sn)) {
for (int i = 0; i < sn; i++) {
printf("%d%c", s[i], i == sn - 1 ? '\n' : ' ');
}
}
}
/* Tree shapes.
*
* This code generates all possible Boolean expressions with a specified number
* of terms N (equivalent to the number of external nodes in a tree).
*
* See test_tree_shape() for a simple example. */
/* An array of these structures describes the shape of a tree.
*
* A single element of struct tree_shape describes a single node in the tree.
* The node has 'sn' direct children. From left to right, for i in 0...sn-1,
* s[i] is 1 if the child is a leaf node, otherwise the child is a subtree and
* s[i] is the number of leaf nodes within that subtree. In the latter case,
* the subtree is described by another struct tree_shape within the enclosing
* array. The tree_shapes are ordered in the array in in-order.
*/
struct tree_shape {
unsigned int state;
int s[50];
int sn;
};
static int
init_tree_shape__(struct tree_shape ts[], int n)
{
if (n <= 2) {
return 0;
}
int n_tses = 1;
/* Skip the first composition intentionally. */
ts->sn = first_composition(n, &ts->state, ts->s);
ts->sn = next_composition(&ts->state, ts->s, ts->sn);
for (int i = 0; i < ts->sn; i++) {
n_tses += init_tree_shape__(&ts[n_tses], ts->s[i]);
}
return n_tses;
}
/* Initializes 'ts[]' as the first in the set of all of possible shapes of
* trees with 'n' leaves. Returns the number of "struct tree_shape"s in the
* first tree shape. */
static int
init_tree_shape(struct tree_shape ts[], int n)
{
switch (n) {
case 1:
ts->sn = 1;
ts->s[0] = 1;
return 1;
case 2:
ts->sn = 2;
ts->s[0] = 1;
ts->s[1] = 1;
return 1;
default:
return init_tree_shape__(ts, n);
}
}
/* Advances 'ts', which currently has 'n_tses' elements, to the next possible
* tree shape with the number of leaves passed to init_tree_shape(). Returns
* the number of "struct tree_shape"s in the next shape, or 0 if all tree
* shapes have been visited. */
static int
next_tree_shape(struct tree_shape ts[], int n_tses)
{
if (n_tses == 1 && ts->sn == 2 && ts->s[0] == 1 && ts->s[1] == 1) {
return 0;
}
while (n_tses > 0) {
struct tree_shape *p = &ts[n_tses - 1];
p->sn = p->sn > 1 ? next_composition(&p->state, p->s, p->sn) : 0;
if (p->sn) {
for (int i = 0; i < p->sn; i++) {
n_tses += init_tree_shape__(&ts[n_tses], p->s[i]);
}
break;
}
n_tses--;
}
return n_tses;
}
static void
print_tree_shape(const struct tree_shape ts[], int n_tses)
{
for (int i = 0; i < n_tses; i++) {
if (i) {
printf(", ");
}
for (int j = 0; j < ts[i].sn; j++) {
int k = ts[i].s[j];
if (k > 9) {
printf("(%d)", k);
} else {
printf("%d", k);
}
}
}
}
static void
test_tree_shape(struct ovs_cmdl_context *ctx)
{
int n = atoi(ctx->argv[1]);
struct tree_shape ts[50];
int n_tses;
for (n_tses = init_tree_shape(ts, n); n_tses;
n_tses = next_tree_shape(ts, n_tses)) {
print_tree_shape(ts, n_tses);
putchar('\n');
}
}
/* Iteration through all possible terminal expressions (e.g. EXPR_T_CMP and
* EXPR_T_BOOLEAN expressions).
*
* Given a tree shape, this allows the code to try all possible ways to plug in
* terms.
*
* Example use:
*
* struct expr terminal;
* const struct expr_symbol *vars = ...;
* int n_vars = ...;
* int n_bits = ...;
*
* init_terminal(&terminal, vars[0]);
* do {
* // Something with 'terminal'.
* } while (next_terminal(&terminal, vars, n_vars, n_bits));
*/
/* Sets 'expr' to the first possible terminal expression. 'var' should be the
* first variable in the ones to be tested. */
static void
init_terminal(struct expr *expr, int phase,
const struct expr_symbol *nvars[], int n_nvars,
const struct expr_symbol *svars[], int n_svars)
{
if (phase < 1 && n_nvars) {
expr->type = EXPR_T_CMP;
expr->cmp.symbol = nvars[0];
expr->cmp.relop = rightmost_1bit_idx(test_relops);
memset(&expr->cmp.value, 0, sizeof expr->cmp.value);
memset(&expr->cmp.mask, 0, sizeof expr->cmp.mask);
expr->cmp.value.integer = htonll(0);
expr->cmp.mask.integer = htonll(0);
return;
}
if (phase < 2 && n_svars) {
expr->type = EXPR_T_CMP;
expr->cmp.symbol = svars[0];
expr->cmp.relop = EXPR_R_EQ;
expr->cmp.string = xstrdup("0");
return;
}
expr->type = EXPR_T_BOOLEAN;
expr->boolean = false;
}
/* Returns 'x' with the rightmost contiguous string of 1s changed to 0s,
* e.g. 01011100 => 01000000. See H. S. Warren, Jr., _Hacker's Delight_, 2nd
* ed., section 2-1. */
static unsigned int
turn_off_rightmost_1s(unsigned int x)
{
return ((x & -x) + x) & x;
}
static const struct expr_symbol *
next_var(const struct expr_symbol *symbol,
const struct expr_symbol *vars[], int n_vars)
{
for (int i = 0; i < n_vars; i++) {
if (symbol == vars[i]) {
return i + 1 >= n_vars ? NULL : vars[i + 1];
}
}
OVS_NOT_REACHED();
}
static enum expr_relop
next_relop(enum expr_relop relop)
{
unsigned int remaining_relops = test_relops & ~((1u << (relop + 1)) - 1);
return (remaining_relops
? rightmost_1bit_idx(remaining_relops)
: rightmost_1bit_idx(test_relops));
}
/* Advances 'expr' to the next possible terminal expression within the 'n_vars'
* variables of 'n_bits' bits each in 'vars[]'. */
static bool
next_terminal(struct expr *expr,
const struct expr_symbol *nvars[], int n_nvars, int n_bits,
const struct expr_symbol *svars[], int n_svars)
{
if (expr->type == EXPR_T_BOOLEAN) {
if (expr->boolean) {
return false;
} else {
expr->boolean = true;
return true;
}
}
if (!expr->cmp.symbol->width) {
int next_value = atoi(expr->cmp.string) + 1;
free(expr->cmp.string);
if (next_value > 1) {
expr->cmp.symbol = next_var(expr->cmp.symbol, svars, n_svars);
if (!expr->cmp.symbol) {
init_terminal(expr, 2, nvars, n_nvars, svars, n_svars);
return true;
}
next_value = 0;
}
expr->cmp.string = xasprintf("%d", next_value);
return true;
}
unsigned int next;
next = (ntohll(expr->cmp.value.integer)
+ (ntohll(expr->cmp.mask.integer) << n_bits));
for (;;) {
next++;
unsigned m = next >> n_bits;
unsigned v = next & ((1u << n_bits) - 1);
if (next >= (1u << (2 * n_bits))) {
enum expr_relop old_relop = expr->cmp.relop;
expr->cmp.relop = next_relop(old_relop);
if (expr->cmp.relop <= old_relop) {
expr->cmp.symbol = next_var(expr->cmp.symbol, nvars, n_nvars);
if (!expr->cmp.symbol) {
init_terminal(expr, 1, nvars, n_nvars, svars, n_svars);
return true;
}
}
next = UINT_MAX;
} else if (v & ~m) {
/* Skip: 1-bits in value correspond to 0-bits in mask. */
} else if ((!m || turn_off_rightmost_1s(m))
&& (expr->cmp.relop != EXPR_R_EQ &&
expr->cmp.relop != EXPR_R_NE)) {
/* Skip: can't have discontiguous or all-0 mask for > >= < <=. */
} else {
expr->cmp.value.integer = htonll(v);
expr->cmp.mask.integer = htonll(m);
return true;
}
}
}
static struct expr *
make_terminal(struct expr ***terminalp)
{
struct expr *e = expr_create_boolean(true);
**terminalp = e;
(*terminalp)++;
return e;
}
static struct expr *
build_simple_tree(enum expr_type type, int n, struct expr ***terminalp)
{
if (n == 2) {
struct expr *e = expr_create_andor(type);
for (int i = 0; i < 2; i++) {
struct expr *sub = make_terminal(terminalp);
ovs_list_push_back(&e->andor, &sub->node);
}
return e;
} else if (n == 1) {
return make_terminal(terminalp);
} else {
OVS_NOT_REACHED();
}
}
static struct expr *
build_tree_shape(enum expr_type type, const struct tree_shape **tsp,
struct expr ***terminalp)
{
const struct tree_shape *ts = *tsp;
(*tsp)++;
struct expr *e = expr_create_andor(type);
enum expr_type t = type == EXPR_T_AND ? EXPR_T_OR : EXPR_T_AND;
for (int i = 0; i < ts->sn; i++) {
struct expr *sub = (ts->s[i] > 2
? build_tree_shape(t, tsp, terminalp)
: build_simple_tree(t, ts->s[i], terminalp));
ovs_list_push_back(&e->andor, &sub->node);
}
return e;
}
struct test_rule {
struct cls_rule cr;
};
static void
free_rule(struct test_rule *test_rule)
{
cls_rule_destroy(&test_rule->cr);
free(test_rule);
}
static bool
tree_shape_is_chassis_resident_cb(const void *c_aux OVS_UNUSED,
const char *port_name OVS_UNUSED)
{
return true;
}
static int
test_tree_shape_exhaustively(struct expr *expr, struct shash *symtab,
struct expr *terminals[], int n_terminals,
const struct expr_symbol *nvars[], int n_nvars,
int n_bits,
const struct expr_symbol *svars[], int n_svars)
{
int n_tested = 0;
const unsigned int var_mask = (1u << n_bits) - 1;
for (int i = 0; i < n_terminals; i++) {
init_terminal(terminals[i], 0, nvars, n_nvars, svars, n_svars);
}
struct ds s = DS_EMPTY_INITIALIZER;
struct flow f;
memset(&f, 0, sizeof f);
for (;;) {
for (int i = n_terminals - 1; ; i--) {
if (!i) {
ds_destroy(&s);
return n_tested;
}
if (next_terminal(terminals[i], nvars, n_nvars, n_bits,
svars, n_svars)) {
break;
}
init_terminal(terminals[i], 0, nvars, n_nvars, svars, n_svars);
}
ovs_assert(expr_honors_invariants(expr));
n_tested++;
struct expr *modified;
if (operation == OP_CONVERT) {
ds_clear(&s);
expr_format(expr, &s);
char *error;
modified = expr_parse_string(ds_cstr(&s), symtab, NULL,
NULL, NULL, &error);
if (error) {
fprintf(stderr, "%s fails to parse (%s)\n",
ds_cstr(&s), error);
exit(EXIT_FAILURE);
}
} else if (operation >= OP_SIMPLIFY) {
modified = expr_simplify(expr_clone(expr),
tree_shape_is_chassis_resident_cb,
NULL);
ovs_assert(expr_honors_invariants(modified));
if (operation >= OP_NORMALIZE) {
modified = expr_normalize(modified);
ovs_assert(expr_honors_invariants(modified));
ovs_assert(expr_is_normalized(modified));
}
}
struct hmap matches;
struct classifier cls;
if (operation >= OP_FLOW) {
struct expr_match *m;
struct test_rule *test_rule;
expr_to_matches(modified, lookup_atoi_cb, NULL, &matches);
classifier_init(&cls, NULL);
HMAP_FOR_EACH (m, hmap_node, &matches) {
test_rule = xmalloc(sizeof *test_rule);
cls_rule_init(&test_rule->cr, &m->match, 0);
classifier_insert(&cls, &test_rule->cr, OVS_VERSION_MIN,
m->conjunctions, m->n);
}
}
for (int subst = 0; subst < 1 << (n_bits * n_nvars + n_svars);
subst++) {
for (int i = 0; i < n_nvars; i++) {
f.regs[i] = (subst >> (i * n_bits)) & var_mask;
}
for (int i = 0; i < n_svars; i++) {
f.regs[n_nvars + i] = ((subst >> (n_nvars * n_bits + i))
& 1);
}
bool expected = expr_evaluate(expr, &f, lookup_atoi_cb, NULL);
bool actual = expr_evaluate(modified, &f, lookup_atoi_cb, NULL);
if (actual != expected) {
struct ds expr_s, modified_s;
ds_init(&expr_s);
expr_format(expr, &expr_s);
ds_init(&modified_s);
expr_format(modified, &modified_s);
fprintf(stderr,
"%s evaluates to %d, but %s evaluates to %d, for",
ds_cstr(&expr_s), expected,
ds_cstr(&modified_s), actual);
for (int i = 0; i < n_nvars; i++) {
if (i > 0) {
fputs(",", stderr);
}
fprintf(stderr, " n%d = 0x%x", i,
(subst >> (n_bits * i)) & var_mask);
}
for (int i = 0; i < n_svars; i++) {
fprintf(stderr, ", s%d = \"%d\"", i,
(subst >> (n_bits * n_nvars + i)) & 1);
}
putc('\n', stderr);
exit(EXIT_FAILURE);
}
if (operation >= OP_FLOW) {
bool found = classifier_lookup(&cls, OVS_VERSION_MIN,
&f, NULL) != NULL;
if (expected != found) {
struct ds expr_s, modified_s;
ds_init(&expr_s);
expr_format(expr, &expr_s);
ds_init(&modified_s);
expr_format(modified, &modified_s);
fprintf(stderr,
"%s and %s evaluate to %d, for",
ds_cstr(&expr_s), ds_cstr(&modified_s), expected);
for (int i = 0; i < n_nvars; i++) {
if (i > 0) {
fputs(",", stderr);
}
fprintf(stderr, " n%d = 0x%x", i,
(subst >> (n_bits * i)) & var_mask);
}
for (int i = 0; i < n_svars; i++) {
fprintf(stderr, ", s%d = \"%d\"", i,
(subst >> (n_bits * n_nvars + i)) & 1);
}
fputs(".\n", stderr);
fprintf(stderr, "Converted to classifier:\n");
expr_matches_print(&matches, stderr);
fprintf(stderr,
"However, %s flow was found in the classifier.\n",
found ? "a" : "no");