| /src/lib/libc/gen/ |
| nftw.c | 47 int ftsflags, fnflag, error, postorder, sverrno; local
62 postorder = (ftwflags & FTW_DEPTH) != 0;
70 if (postorder)
78 if (!postorder)
|
| /src/include/ |
| search.h | 40 postorder, enumerator in enum:__anon164
|
| /src/external/gpl3/gcc/dist/gcc/ |
| domwalk.cc | 141 /* Permute array BBS of N basic blocks in postorder,
280 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
281 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder,
285 m_bb_to_rpo[postorder[i]] = i;
286 free (postorder);
|
| graphds.cc | 196 The vertices in postorder are stored into QT. If FORWARD is false,
279 Kosaraju -- first determine the postorder dfs numbering in reversed graph,
302 vec<int> postorder = vNULL; local
322 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p);
323 gcc_assert (postorder.length () == (unsigned) nq);
326 queue[i] = postorder[nq - i - 1];
330 postorder.release ();
415 vec<int> postorder = vNULL; local
427 sort vertices in reverse postorder
445 graphds_dfs (g, &entry, 1, &postorder, true, NULL)
[all...] |
| gimple-ssa-backprop.cc | 890 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); local
891 unsigned int postorder_num = post_order_compute (postorder, false, false);
894 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i]));
895 bitmap_set_bit (m_visited_blocks, postorder[i]);
897 XDELETEVEC (postorder);
|
| dce.cc | 1079 int *postorder = df_get_postorder (DF_BACKWARD); local
1102 bitmap_set_bit (all_blocks, postorder[i]);
1112 int index = postorder[i];
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks);
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
|
| graphite-scop-detection.cc | 1739 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
1740 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, true);
1743 bb_to_rpo[postorder[i]] = i;
1744 free (postorder);
|
| early-remat.cc | 78 Next we sort the candidates based on the cfg postorder, so that if
1014 /* Order remat_candidates X_IN and Y_IN according to the cfg postorder. */
1024 /* Make X and Y follow block postorder. */
1032 cfg postorder. */
1050 postorder. */
2464 int *postorder = df_get_postorder (DF_BACKWARD); local
2469 /* Process the blocks in postorder, to reduce the number of iterations
2473 unsigned int bb_index = postorder[i];
|
| tree-ssa-threadupdate.cc | 2710 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
2711 unsigned int postorder_num = post_order_compute (postorder, false, false);
2714 unsigned int indx = postorder[i];
2721 free (postorder);
|
| tree-ssa-forwprop.cc | 3501 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (fun)); local
3503 postorder, false);
3507 bb_to_rpo[postorder[i]] = i;
3510 FOR_EACH_EDGE (e, ei, BASIC_BLOCK_FOR_FN (fun, postorder[i])->succs)
3524 basic_block bb = BASIC_BLOCK_FOR_FN (fun, postorder[i]);
4123 free (postorder);
|
| df.h | 585 int *postorder; /* The current set of basic blocks in reverse
586 postorder for DF_BACKWARD problems. */
588 postorder for DF_FORWARD problems. */
589 int n_blocks; /* The number of blocks in reverse postorder. */
584 int *postorder; \/* The current set of basic blocks in reverse member in class:df_d
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| domwalk.cc | 141 /* Permute array BBS of N basic blocks in postorder,
278 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
279 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder,
283 m_bb_to_rpo[postorder[i]] = i;
284 free (postorder);
|
| graphds.cc | 196 The vertices in postorder are stored into QT. If FORWARD is false,
279 Tarjan -- first determine the postorder dfs numbering in reversed graph,
295 vec<int> postorder = vNULL; local
315 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p);
316 gcc_assert (postorder.length () == (unsigned) nq);
319 queue[i] = postorder[nq - i - 1];
323 postorder.release ();
408 vec<int> postorder = vNULL; local
420 sort vertices in reverse postorder
438 graphds_dfs (g, &entry, 1, &postorder, true, NULL)
[all...] |
| lcm.cc | 104 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
105 int postorder_num = post_order_compute (postorder, false, false);
108 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
112 free (postorder);
274 auto_vec<int, 20> postorder;
275 inverted_post_order_compute (&postorder);
276 for (unsigned int i = 0; i < postorder.length (); ++i)
278 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
513 optimistic initialization of AVOUT above. Use inverted postorder
515 auto_vec<int, 20> postorder;
103 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
273 auto_vec<int, 20> postorder; local
514 auto_vec<int, 20> postorder; local
[all...] |
| gimple-ssa-backprop.cc | 884 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); local
885 unsigned int postorder_num = post_order_compute (postorder, false, false);
888 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i]));
889 bitmap_set_bit (m_visited_blocks, postorder[i]);
891 XDELETEVEC (postorder);
|
| dce.cc | 1079 int *postorder = df_get_postorder (DF_BACKWARD); local
1102 bitmap_set_bit (all_blocks, postorder[i]);
1112 int index = postorder[i];
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks);
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
|
| graphite-scop-detection.cc | 1603 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
1604 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, true);
1607 bb_to_rpo[postorder[i]] = i;
1608 free (postorder);
|
| tree-ssa-dce.cc | 115 /* When non-NULL holds map from basic block index into the postorder. */
1107 auto_vec<int, 20> postorder; local
1108 inverted_post_order_compute (&postorder,
1111 for (unsigned int i = 0; i < postorder.length (); ++i)
1112 bb_postorder[postorder[i]] = i;
|
| early-remat.cc | 78 Next we sort the candidates based on the cfg postorder, so that if
1016 /* Order remat_candidates X_IN and Y_IN according to the cfg postorder. */
1026 /* Make X and Y follow block postorder. */
1034 cfg postorder. */
1052 postorder. */
1054 int *postorder = df_get_postorder (DF_BACKWARD); local
1058 postorder_index[postorder[i]] = i;
2100 int *postorder = df_get_postorder (DF_BACKWARD); local
2103 if (postorder[i] >= NUM_FIXED_BLOCKS)
2104 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i]))
2466 int *postorder = df_get_postorder (DF_BACKWARD); local
[all...] |
| tree-ssa-threadupdate.cc | 2714 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
2715 unsigned int postorder_num = post_order_compute (postorder, false, false);
2718 unsigned int indx = postorder[i];
2725 free (postorder);
|
| tree-ssa-forwprop.cc | 3418 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (fun)); local
3420 postorder, false);
3427 basic_block bb = BASIC_BLOCK_FOR_FN (fun, postorder[i]);
3921 free (postorder);
|
| tree-ssa-pre.cc | 822 expressions in SET in postorder into POST. */
847 expressions in SET in postorder into POST. */
2468 /* For ANTIC computation we need a postorder that also guarantees that
2471 auto_vec<int, 20> postorder; local
2472 inverted_post_order_compute (&postorder);
2488 for (i = postorder.length () - 1; i >= 0; i--)
2490 if (bitmap_bit_p (worklist, postorder[i]))
2492 basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
2520 to perform any iteration when we process blocks in postorder. */
2521 for (i = postorder.length () - 1; i >= 0; i--
[all...] |
| /src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| blocks.cc | 1226 // Compute the starting reverse postorder. We tweak this later to try
1228 auto *postorder = new int[n_basic_blocks_for_fn (m_fn)]; local
1230 = pre_and_rev_post_order_compute (nullptr, postorder, true);
1233 // Iterate over the blocks in reverse postorder. In cases where
1240 if (!m_bbs[postorder[i]])
1243 basic_block cfg_bb = BASIC_BLOCK_FOR_FN (m_fn, postorder[i]);
1260 delete[] postorder;
|
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| blocks.cc | 1207 // Compute the starting reverse postorder. We tweak this later to try
1209 auto *postorder = new int[n_basic_blocks_for_fn (m_fn)]; local
1211 = pre_and_rev_post_order_compute (nullptr, postorder, true);
1214 // Iterate over the blocks in reverse postorder. In cases where
1221 if (!m_bbs[postorder[i]])
1224 basic_block cfg_bb = BASIC_BLOCK_FOR_FN (m_fn, postorder[i]);
1241 delete[] postorder;
|
| /src/external/gpl2/xcvs/dist/lib/ |
| regcomp.c | 41 static reg_errcode_t postorder (bin_tree_t *root,
1134 ret = postorder (dfa->str_tree, lower_subexps, preg);
1137 ret = postorder (dfa->str_tree, calc_first, dfa);
1166 postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)),
1318 nodes. Requires a postorder visit. */
2507 postorder (elem, free_tree, NULL);
2534 postorder (elem, mark_opt_subexp, (void *) (long) elem->token.opr.idx);
3713 To be called from preorder or postorder. */
1159 postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), function
|
