| /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/lib/libc/stdlib/ |
| twalk.c | 40 (*action)(root, postorder, level);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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...] |
| cfganal.h | 69 extern void inverted_post_order_compute (vec<int> *postorder, sbitmap *start_points = 0);
|
| 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);
|
| df-core.cc | 704 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun));
705 df->n_blocks = post_order_compute (df->postorder, true, true);
817 free (df->postorder);
986 BLOCK_IN_POSTORDER is array of size N_BLOCKS specifying postorder in BBs and
987 BBINDEX_TO_POSTORDER is array mapping back BB->index to postorder position.
990 The worklists are bitmaps indexed by postorder positions.
1072 with "n"-th bit representing the n-th block in the reverse-postorder order.
1093 /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1109 /* Initialize the mapping of block index to postorder. */
1157 int *postorder, int n_blocks
[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);
|
| 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...] |
| 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;
|
| sel-sched-ir.cc | 3696 int *postorder, n_blocks;
3698 postorder = XALLOCAVEC (int, n_basic_blocks_for_fn (cfun));
3699 n_blocks = post_order_compute (postorder, false, false);
3703 if (CONTAINING_RGN (postorder[i]) == rgn)
3705 BLOCK_TO_BB (postorder[i]) = n;
3706 BB_TO_BLOCK (n) = postorder[i];
4953 int *postorder;
4964 postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
4966 n_blocks = post_order_compute (postorder, true, false);
4973 gcc_assert (postorder[i] < rev_top_order_index_len)
3676 int *postorder, n_blocks; local
4929 int *postorder; 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);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| 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...] |
| 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);
|
| df-core.cc | 812 free (df->postorder);
996 BLOCK_IN_POSTORDER is array of size N_BLOCKS specifying postorder in BBs and
997 BBINDEX_TO_POSTORDER is array mapping back BB->index to postorder position.
1000 The worklists are bitmaps indexed by postorder positions.
1082 with "n"-th bit representing the n-th block in the reverse-postorder order.
1103 /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1119 /* Initialize the mapping of block index to postorder. */
1167 int *postorder, int n_blocks)
1187 postorder, n_blocks);
1238 df->postorder,
[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);
|
| sel-sched-ir.cc | 3696 int *postorder, n_blocks;
3698 postorder = XALLOCAVEC (int, n_basic_blocks_for_fn (cfun));
3699 n_blocks = post_order_compute (postorder, false, false);
3703 if (CONTAINING_RGN (postorder[i]) == rgn)
3705 BLOCK_TO_BB (postorder[i]) = n;
3706 BB_TO_BLOCK (n) = postorder[i];
4953 int *postorder;
4964 postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
4966 n_blocks = post_order_compute (postorder, true, false);
4973 gcc_assert (postorder[i] < rev_top_order_index_len)
3676 int *postorder, n_blocks; local
4929 int *postorder; local
[all...] |
| 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);
|
| /src/include/ |
| search.h | 40 postorder, enumerator in enum:__anon164
|
| /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/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;
|
