1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2016, Olivier MATZ <zer0@droids-corp.org>
6 * @defgroup parse Parse
9 * @brief Create parse tree from string input and grammar tree
13 * The parse operation is to check if an input (a string or vector of
14 * strings) matches the node tree. On success, the result is stored in a
15 * tree that describes which part of the input matches which node.
23 #include <sys/queue.h>
24 #include <sys/types.h>
33 * Create an empty parse tree.
36 * The empty parse tree.
38 struct ec_pnode *ec_pnode(const struct ec_node *node);
45 void ec_pnode_free(struct ec_pnode *pnode);
52 void ec_pnode_free_children(struct ec_pnode *pnode);
59 struct ec_pnode *ec_pnode_dup(const struct ec_pnode *pnode);
67 const struct ec_strvec *ec_pnode_strvec(const struct ec_pnode *pnode);
69 /* a NULL return value is an error, with errno set
70 ENOTSUP: no ->parse() operation
77 struct ec_pnode *ec_parse(const struct ec_node *node, const char *str);
84 struct ec_pnode *ec_parse_strvec(const struct ec_node *node,
85 const struct ec_strvec *strvec);
92 #define EC_PARSE_NOMATCH INT_MAX
94 /* internal: used by nodes
96 * state is the current parse tree, which is built piece by piece while
97 * parsing the node tree: ec_parse_child() creates a new child in
98 * this state parse tree, and calls the parse() method for the child
99 * node, with state pointing to this new child. If it does not match,
100 * the child is removed in the state, else it is kept, with its
101 * possible descendants.
104 * the number of matched strings in strvec on success
105 * EC_PARSE_NOMATCH (positive) if it does not match
106 * -1 on error, and errno is set
108 int ec_parse_child(const struct ec_node *node,
109 struct ec_pnode *state,
110 const struct ec_strvec *strvec);
117 void ec_pnode_link_child(struct ec_pnode *pnode,
118 struct ec_pnode *child);
124 void ec_pnode_unlink_child(struct ec_pnode *pnode,
125 struct ec_pnode *child);
128 #define ec_pnode_get_root(parse) ({ \
129 const struct ec_pnode *p_ = parse; /* check type */ \
130 struct ec_pnode *pnode_ = (struct ec_pnode *)parse; \
131 typeof(parse) res_; \
133 res_ = __ec_pnode_get_root(pnode_); \
142 struct ec_pnode *__ec_pnode_get_root(struct ec_pnode *pnode);
149 struct ec_pnode *ec_pnode_get_parent(const struct ec_pnode *pnode);
152 * Get the first child of a tree.
155 struct ec_pnode *ec_pnode_get_first_child(const struct ec_pnode *pnode);
162 struct ec_pnode *ec_pnode_get_last_child(const struct ec_pnode *pnode);
169 struct ec_pnode *ec_pnode_next(const struct ec_pnode *pnode);
176 #define EC_PNODE_FOREACH_CHILD(child, parse) \
177 for (child = ec_pnode_get_first_child(parse); \
179 child = ec_pnode_next(child)) \
186 bool ec_pnode_has_child(const struct ec_pnode *pnode);
193 const struct ec_node *ec_pnode_get_node(const struct ec_pnode *pnode);
200 void ec_pnode_del_last_child(struct ec_pnode *pnode);
207 struct ec_dict *ec_pnode_get_attrs(struct ec_pnode *pnode);
214 void ec_pnode_dump(FILE *out, const struct ec_pnode *pnode);
221 struct ec_pnode *ec_pnode_find(struct ec_pnode *pnode,
229 struct ec_pnode *ec_pnode_find_next(struct ec_pnode *root,
230 struct ec_pnode *start,
231 const char *id, bool iter_children);
234 * Iterate among parse tree
237 * for (iter = state; iter != NULL; iter = EC_PNODE_ITER_NEXT(state, iter, 1))
239 struct ec_pnode *__ec_pnode_iter_next(const struct ec_pnode *root,
240 struct ec_pnode *pnode, bool iter_children);
242 /* keep the const if any */
243 #define EC_PNODE_ITER_NEXT(root, parse, iter_children) ({ \
244 const struct ec_pnode *p_ = parse; /* check type */ \
245 struct ec_pnode *pnode_ = (struct ec_pnode *)parse; \
246 typeof(parse) res_; \
248 res_ = __ec_pnode_iter_next(root, pnode_, iter_children); \
257 size_t ec_pnode_len(const struct ec_pnode *pnode);
264 size_t ec_pnode_matches(const struct ec_pnode *pnode);