Searched refs:parse_tree (Results 1 – 8 of 8) sorted by relevance
| /external/python/cpython3/Lib/email/ |
| D | headerregistry.py | 205 def init(self, name, *, parse_tree, defects): argument
207 self._parse_tree = parse_tree
408 kwds['parse_tree'] = parse_tree = cls.value_parser(value)
409 kwds['decoded'] = str(parse_tree)
410 kwds['defects'].extend(parse_tree.all_defects)
411 kwds['major'] = None if parse_tree.minor is None else parse_tree.major
412 kwds['minor'] = parse_tree.minor
413 if parse_tree.minor is not None:
446 kwds['parse_tree'] = parse_tree = cls.value_parser(value)
447 kwds['decoded'] = str(parse_tree)
[all …]
|
| D | _header_value_parser.py | 2589 def _refold_parse_tree(parse_tree, *, policy): argument
2601 parts = list(parse_tree)
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_parser.c | 199 int cil_parser(char *_path, char *buffer, uint32_t size, struct cil_tree **parse_tree) in cil_parser() argument
222 tree = *parse_tree; in cil_parser()
305 *parse_tree = tree; in cil_parser()
|
| D | cil_parser.h | 35 int cil_parser(char *path, char *buffer, uint32_t size, struct cil_tree **parse_tree);
|
| D | cil_build_ast.h | 235 int cil_build_ast(struct cil_db *db, struct cil_tree_node *parse_tree, struct cil_tree_node *ast);
|
| D | cil_build_ast.c | 6554 int cil_build_ast(struct cil_db *db, struct cil_tree_node *parse_tree, struct cil_tree_node *ast) in cil_build_ast() argument
6559 if (db == NULL || parse_tree == NULL || ast == NULL) { in cil_build_ast()
6570 …rc = cil_tree_walk(parse_tree, __cil_build_ast_node_helper, NULL, __cil_build_ast_last_child_helpe… in cil_build_ast()
|
| /external/antlr/runtime/Ruby/lib/antlr3/tree/ |
| D | wizard.rb | 202 when :open then return parse_tree
213 def parse_tree method in ANTLR3.AST.Wizard.PatternParser
221 subtree = parse_tree
|
| /external/iproute2/tc/ |
| D | m_ematch.c | 173 static int parse_tree(struct nlmsghdr *n, struct ematch *tree) in parse_tree() function
352 if (parse_tree(n, ematch_root) < 0) in parse_ematch()
|