| /netbsd-6-1-5-RELEASE/lib/libc/gen/ |
| H A D | nftw.c | 47 int ftsflags, fnflag, error, postorder, sverrno; local
62 postorder = (ftwflags & FTW_DEPTH) != 0;
70 if (postorder)
78 if (!postorder)
|
| /netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/roken/ |
| H A D | search.hin | 26 postorder,
|
| H A D | tsearch-test.c | 52 if (order == postorder || order == leaf) {
|
| H A D | tsearch.c | 89 (*action)(root, postorder, level);
|
| /netbsd-6-1-5-RELEASE/include/ |
| H A D | search.h | 39 postorder, enumerator in enum:__anon5017
|
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
| H A D | graphds.c | 184 The vertices in postorder are stored into QT. If FORWARD is false,
264 Tarjan -- first determine the postorder dfs numbering in reversed graph,
278 VEC (int, heap) *postorder = NULL;
298 graphds_dfs (g, queue, nq, &postorder, false, subgraph);
299 gcc_assert (VEC_length (int, postorder) == (unsigned) nq);
302 queue[i] = VEC_index (int, postorder, nq - i - 1);
306 VEC_free (int, heap, postorder);
404 VEC (int, heap) *postorder = NULL;
416 sort vertices in reverse postorder
434 graphds_dfs (g, &entry, 1, &postorder, tru
[all...] |
| H A D | df-core.c | 725 df->postorder = XNEWVEC (int, last_basic_block);
727 df->n_blocks = post_order_compute (df->postorder, true, true);
815 if (df->postorder)
816 free (df->postorder);
997 with "n"-th bit representing the n-th block in the reverse-postorder order.
1019 /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1034 /* Initialize the mapping of block index to postorder. */
1083 int *postorder, int n_blocks)
1103 postorder, n_blocks);
1130 if (df->postorder)
1080 df_analyze_problem(struct dataflow *dflow, bitmap blocks_to_consider, int *postorder, int n_blocks) argument
1263 df_simple_dataflow(enum df_flow_dir dir, df_init_function init_fun, df_confluence_function_0 con_fun_0, df_confluence_function_n con_fun_n, df_transfer_function trans_fun, bitmap blocks, int * postorder, int n_blocks) argument
[all...] |
| H A D | dce.c | 928 int *postorder = df_get_postorder (DF_BACKWARD); local
950 bitmap_set_bit (all_blocks, postorder[i]);
958 int index = postorder[i];
1012 df_analyze_problem (df_byte_lr, all_blocks, postorder, n_blocks);
1014 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
|
| H A D | sel-sched-ir.c | 3560 int *postorder, n_blocks;
3562 postorder = XALLOCAVEC (int, n_basic_blocks);
3563 n_blocks = post_order_compute (postorder, false, false);
3567 if (CONTAINING_RGN (postorder[i]) == rgn)
3569 BLOCK_TO_BB (postorder[i]) = n;
3570 BB_TO_BLOCK (n) = postorder[i];
4774 int *postorder;
4784 postorder = XNEWVEC (int, n_basic_blocks);
4786 n_blocks = post_order_compute (postorder, true, false);
4793 gcc_assert (postorder[
3540 int *postorder, n_blocks; local
4750 int *postorder; local
[all...] |
| H A D | tree-ssa-pre.c | 434 /* Basic block list in postorder. */
435 static int *postorder; variable
2569 if (TEST_BIT (changed_blocks, postorder[i]))
2571 basic_block block = BASIC_BLOCK (postorder[i]);
2600 if (TEST_BIT (changed_blocks, postorder[i]))
2602 basic_block block = BASIC_BLOCK (postorder[i]);
4677 postorder = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
4678 my_rev_post_order_compute (postorder, false);
4716 free (postorder);
|
| H A D | df.h | 582 int *postorder; /* The current set of basic blocks
583 in reverse postorder. */
585 in reverse postorder of inverted CFG. */
586 int n_blocks; /* The number of blocks in reverse postorder. */
588 in reverse postorder of inverted CFG. */
581 int *postorder; /* The current set of basic blocks member in struct:df
|
| H A D | df-problems.c | 1068 df_worklist_dataflow (df_lr, all_blocks, df->postorder, df->n_blocks);
|
| /netbsd-6-1-5-RELEASE/lib/libc/stdlib/ |
| H A D | twalk.c | 43 (*action)(root, postorder, level);
|
| /netbsd-6-1-5-RELEASE/external/bsd/bind/dist/contrib/dbus/ |
| H A D | dbus_service.c | 666 if( (tpp != 0L) && (*tpp != 0L) && ((which == postorder) || (which == leaf)) )
811 if((wpp != 0L) && (*wpp != 0L) && ( (which == postorder) || (which == leaf) ) )
|
| H A D | dbus_mgr.c | 2425 ||((which != leaf) && (which != postorder))
|
| /netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/ |
| H A D | regcomp.c | 38 static reg_errcode_t postorder (bin_tree_t *root,
1131 ret = postorder (dfa->str_tree, lower_subexps, preg);
1134 ret = postorder (dfa->str_tree, calc_first, dfa);
1163 postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
1315 nodes. Requires a postorder visit. */
2504 postorder (elem, free_tree, NULL);
2531 postorder (elem, mark_opt_subexp, (void *) (long) elem->token.opr.idx);
3710 To be called from preorder or postorder. */
1156 postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), function
|