Lines Matching refs:tree
95 static VOID cmtreefree _ANSI_ARGS_((struct colormap *, union tree *, int));
113 static VOID fillcheck _ANSI_ARGS_((struct colormap *, union tree *, int, FILE *));
216 struct subre *tree; /* subexpression tree */
217 struct subre *treechain; /* all tree nodes allocated */
218 struct subre *treefree; /* any free tree nodes */
219 int ntree; /* number of tree nodes */
324 v->tree = NULL;
343 g->tree = NULL;
372 v->tree = parse(v, EOS, PLAIN, v->nfa->init, v->nfa->final);
375 assert(v->tree != NULL);
377 /* finish setup of nfa and its subre tree */
383 dumpst(v->tree, debug, 1);
385 optst(v, v->tree);
386 v->ntree = numst(v->tree, 1);
387 markst(v->tree);
391 dumpst(v->tree, debug, 1);
394 /* build compacted NFAs for tree and lacons */
395 re->re_info |= nfatree(v, v->tree, debug);
404 if (v->tree->flags&SHORTER)
407 /* build compacted NFAs for tree, lacons, fast search */
425 g->tree = v->tree;
426 v->tree = NULL;
489 if (v->tree != NULL)
490 freesubre(v, v->tree);
584 * tied together with '|'. They appear in the tree as the left children
878 /* need new endpoints because tree will contain pointers */
1168 * subRE tree, although the important bits are now handled by the in-line
1851 - numst - number tree nodes (assigning retry indexes)
1873 - markst - mark tree nodes as INUSE
1890 - cleanst - free any tree nodes not marked INUSE
1910 - nfatree - turn a subRE subtree into a tree of compacted NFAs
2035 if (g->tree != NULL)
2036 freesubre((struct vars *)NULL, g->tree);
2084 dumpst(g->tree, f, 0);
2089 - dumpst - dump a subRE tree
2099 fprintf(f, "null tree\n");