Searched refs:postorder (Results 1 - 6 of 6) sorted by relevance
| /openbsd-current/lib/libc/gen/ |
| H A D | nftw.c | 37 int error = 0, ftsflags, fnflag, postorder, sverrno; local
54 postorder = (ftwflags & FTW_DEPTH) != 0;
61 if (postorder)
69 if (!postorder)
|
| /openbsd-current/include/ |
| H A D | search.h | 31 postorder, enumerator in enum:__anon7499
|
| /openbsd-current/lib/libc/stdlib/ |
| H A D | tsearch.c | 103 (*action)(root, postorder, level);
|
| /openbsd-current/gnu/gcc/gcc/ |
| H A D | df-core.c | 668 /* For forward problems, you want to pass in reverse postorder
669 and for backward problems you want postorder. This has been
673 The nodes are passed into this function in postorder. */
759 int *postorder, int n_blocks, bool single_pass)
775 postorder, n_blocks, single_pass);
789 int *postorder = XNEWVEC (int, last_basic_block);
795 n_blocks = post_order_compute (postorder, true);
801 bitmap_set_bit (current_all_blocks, postorder[i]);
815 n_blocks = df_prune_to_subcfg (postorder, n_blocks, df->blocks_to_analyze);
830 postorder, n_block
754 df_analyze_problem(struct dataflow *dflow, bitmap blocks_to_consider, bitmap blocks_to_init, bitmap blocks_to_scan, int *postorder, int n_blocks, bool single_pass) argument
788 int *postorder = XNEWVEC (int, last_basic_block); local
[all...] |
| H A D | tree-ssa-pre.c | 1938 int *postorder; local
2039 postorder = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
2040 pre_and_rev_post_order_compute (NULL, postorder, false);
2051 bb = BASIC_BLOCK (postorder[j]);
2062 free (postorder);
|
| /openbsd-current/gnu/usr.bin/perl/ext/B/B/ |
| H A D | Concise.pm | 1247 of constructs this is a postorder traversal of the tree, ending at the
|
Completed in 146 milliseconds