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
|
/*
* Command DFA module.
* Provides a DFA data structure and associated functions for manipulating it.
* Used to match user command line input.
*
* @author Quentin Young <qlyoung@cumulusnetworks.com>
*/
#include <zebra.h>
#include "command_graph.h"
#include "memory.h"
struct graph_node *
add_node(struct graph_node *parent, struct graph_node *child)
{
struct graph_node *p_child;
for (unsigned int i = 0; i < vector_active(parent->children); i++)
{
p_child = vector_slot(parent->children, i);
if (cmp_node(child, p_child))
return p_child;
}
vector_set(parent->children, child);
return child;
}
int
cmp_node(struct graph_node *first, struct graph_node *second)
{
// compare types
if (first->type != second->type) return 0;
switch (first->type) {
case WORD_GN: // words and variables are equal if their
case VARIABLE_GN: // text value is equal
if (first->text && second->text) {
if (strcmp(first->text, second->text)) return 0;
}
else if (first->text != second->text) return 0;
break;
case RANGE_GN: // ranges are equal if their bounds are equal
if (first->min != second->min || first->max != second->max)
return 0;
break;
case NUMBER_GN: // numbers are equal if their values are equal
if (first->value != second->value) return 0;
break;
/* selectors and options should be equal if all paths are equal,
* but the graph isomorphism problem is not solvable in polynomial
* time so we consider selectors and options inequal in all cases
*/
case SELECTOR_GN:
case OPTION_GN:
return 0;
default:
break;
}
return 1;
}
struct graph_node *
new_node(enum graph_node_type type)
{
struct graph_node *node = malloc(sizeof(struct graph_node));
node->type = type;
node->children = vector_init(VECTOR_MIN_SIZE);
node->is_leaf = 0;
node->is_root = 0;
node->end = NULL;
node->text = NULL;
node->value = 0;
node->min = 0;
node->max = 0;
node->func = NULL;
return node;
}
const char *
describe_node(struct graph_node *node)
{
const char *desc = NULL;
char num[21];
if (node == NULL) {
desc = "(null node)";
return desc;
}
// print this node
switch (node->type) {
case WORD_GN:
case IPV4_GN:
case IPV4_PREFIX_GN:
case IPV6_GN:
case IPV6_PREFIX_GN:
case VARIABLE_GN:
case RANGE_GN:
desc = node->text;
break;
case NUMBER_GN:
sprintf(num, "%d", node->value);
break;
case SELECTOR_GN:
desc = "<>";
break;
case OPTION_GN:
desc = "[]";
break;
case NUL_GN:
desc = "NUL";
break;
default:
desc = "ERROR";
}
return desc;
}
void
walk_graph(struct graph_node *start, int level)
{
// print this node
fprintf(stderr, "%s[%d] ", describe_node(start), vector_active(start->children));
if (vector_active(start->children)) {
if (vector_active(start->children) == 1)
walk_graph(vector_slot(start->children, 0), level);
else {
fprintf(stderr, "\n");
for (unsigned int i = 0; i < vector_active(start->children); i++) {
struct graph_node *r = vector_slot(start->children, i);
for (int j = 0; j < level+1; j++)
fprintf(stderr, " ");
walk_graph(r, level+1);
}
}
}
else
fprintf(stderr, "\n");
}
|
