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
|
#ifndef COMMAND_GRAPH_H
#define COMMAND_GRAPH_H
#include "command.h"
enum graph_node_type
{
IPV4_GN,
IPV4_PREFIX_GN,
IPV6_GN,
IPV6_PREFIX_GN,
WORD_GN,
RANGE_GN,
NUMBER_GN,
VARIABLE_GN,
SELECTOR_GN,
OPTION_GN,
NUL_GN,
START_GN,
END_GN
};
struct graph_node
{
enum graph_node_type type;// data type this node matches or holds
int is_start; // whether this node is a start node
vector children; // this node's children
struct graph_node * end; // pointer to end for SELECTOR_GN & OPTION_GN
char* text; // for WORD_GN and VARIABLE_GN
long value; // for NUMBER_GN
int min, max; // for RANGE_GN
/* cmd_element struct pointer, only valid for END_GN */
struct cmd_element *element;
/* used for passing arguments to command functions */
char *arg;
/* refcount for node parents */
int refs;
};
/*
* Adds a node as a child of another node.
*
* @param[in] parent node
* @param[in] child node
* @return child node, for convenience
*/
struct graph_node *
add_node(struct graph_node *, struct graph_node *);
/*
* Compares two nodes for parsing equivalence.
* Equivalence in this case means that a single user input token
* should be able to unambiguously match one of the two nodes.
* For example, two nodes which have all fields equal except their
* function pointers would be considered equal.
*
* @param[in] first node to compare
* @param[in] second node to compare
* @return 1 if equal, zero otherwise.
*/
int
cmp_node(struct graph_node *, struct graph_node *);
/*
* Create a new node.
* Initializes all fields to default values and sets the node type.
*
* @param[in] node type
* @return pointer to the newly allocated node
*/
struct graph_node *
new_node(enum graph_node_type);
/**
* Frees the data associated with a graph_node.
* @param[out] pointer to graph_node to free
*/
void
free_node(struct graph_node *);
/**
* Recursively calls free_node on a graph node
* and all its children.
* @param[out] graph to free
*/
void
free_graph(struct graph_node *);
/**
* Walks a command DFA, printing structure to stdout.
* For debugging.
*
* @param[in] start node of graph to walk
* @param[in] graph depth for recursion, caller passes 0
*/
void
walk_graph(struct graph_node *, int);
/**
* Returns a string representation of the given node.
* @param[in] the node to describe
* @param[out] the buffer to write the description into
* @return pointer to description string
*/
char *
describe_node(struct graph_node *, char *, unsigned int);
void
dump_node (struct graph_node *);
#endif
|
