HomeSort by relevance Sort by last modified time
    Searched refs:parse_tree (Results 1 - 7 of 7) sorted by null

  /external/selinux/libsepol/cil/src/
cil_parser.h 35 int cil_parser(char *path, char *buffer, uint32_t size, struct cil_tree **parse_tree);
cil_parser.c 199 int cil_parser(char *_path, char *buffer, uint32_t size, struct cil_tree **parse_tree)
222 tree = *parse_tree;
305 *parse_tree = tree;
cil_build_ast.h 235 int cil_build_ast(struct cil_db *db, struct cil_tree_node *parse_tree, struct cil_tree_node *ast);
cil_build_ast.c     [all...]
  /external/python/cpython3/Lib/email/
headerregistry.py 170 the dictionary must contain two additional keys: parse_tree, set to the
205 def init(self, name, *, parse_tree, defects):
207 self._parse_tree = parse_tree
269 kwds['parse_tree'] = cls.value_parser(value)
270 kwds['decoded'] = str(kwds['parse_tree'])
300 kwds['parse_tree'] = parser.TokenList()
306 kwds['parse_tree'] = cls.value_parser(kwds['decoded'])
337 kwds['parse_tree'] = address_list = cls.value_parser(value)
357 if 'parse_tree' not in kwds:
358 kwds['parse_tree'] = cls.value_parser(kwds['decoded']
    [all...]
  /external/iproute2/tc/
m_ematch.c 173 static int parse_tree(struct nlmsghdr *n, struct ematch *tree) function
352 if (parse_tree(n, ematch_root) < 0)
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
wizard.rb 202 when :open then return parse_tree
213 def parse_tree method in class:ANTLR3.AST.Wizard.PatternParser
221 subtree = parse_tree

Completed in 736 milliseconds