Searched refs:postorder (Results 1 - 25 of 40) sorted by relevance

12

/netbsd-current/lib/libc/gen/
H A Dnftw.c47 int ftsflags, fnflag, error, postorder, sverrno; local
62 postorder = (ftwflags & FTW_DEPTH) != 0;
70 if (postorder)
78 if (!postorder)
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/roken/
H A Dsearch.hin28 postorder,
H A Dtsearch-test.c52 if (order == postorder || order == leaf) {
H A Dtsearch.c89 (*action)(root, postorder, level);
/netbsd-current/lib/libc/stdlib/
H A Dtwalk.c40 (*action)(root, postorder, level);
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgraphds.c196 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, tru
[all...]
H A Dcfganal.h66 extern void inverted_post_order_compute (vec<int> *postorder, sbitmap *start_points = 0);
H A Ddomwalk.c141 /* 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);
H A Ddf-core.c704 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, in
1154 df_analyze_problem(struct dataflow *dflow, bitmap blocks_to_consider, int *postorder, int n_blocks) argument
1492 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 Dlcm.c104 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...]
H A Dgimple-ssa-backprop.c879 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); local
880 unsigned int postorder_num = post_order_compute (postorder, false, false);
883 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i]));
884 bitmap_set_bit (m_visited_blocks, postorder[i]);
886 XDELETEVEC (postorder);
H A Ddce.c1079 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);
H A Dearly-remat.c78 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[
2466 int *postorder = df_get_postorder (DF_BACKWARD); local
[all...]
H A Dtree-ssa-dce.c114 /* When non-NULL holds map from basic block index into the postorder. */
1166 auto_vec<int, 20> postorder; local
1167 inverted_post_order_compute (&postorder,
1170 for (unsigned int i = 0; i < postorder.length (); ++i)
1171 bb_postorder[postorder[i]] = i;
H A Dgraphite-scop-detection.c1605 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); variable
1606 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, true);
1609 bb_to_rpo[postorder[i]] = i;
1610 free (postorder); variable
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dgraphds.cc196 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, tru
[all...]
H A Ddomwalk.cc141 /* 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);
H A Dcfganal.h69 extern void inverted_post_order_compute (vec<int> *postorder, sbitmap *start_points = 0);
H A Ddf-core.cc704 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, in
1154 df_analyze_problem(struct dataflow *dflow, bitmap blocks_to_consider, int *postorder, int n_blocks) argument
1492 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 Dlcm.cc104 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...]
H A Dgimple-ssa-backprop.cc879 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); local
880 unsigned int postorder_num = post_order_compute (postorder, false, false);
883 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i]));
884 bitmap_set_bit (m_visited_blocks, postorder[i]);
886 XDELETEVEC (postorder);
H A Ddce.cc1079 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);
H A Dearly-remat.cc78 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[
2466 int *postorder = df_get_postorder (DF_BACKWARD); local
[all...]
/netbsd-current/include/
H A Dsearch.h40 postorder, enumerator in enum:__anon7434
/netbsd-current/external/gpl3/gcc/dist/gcc/rtl-ssa/
H A Dblocks.cc1202 // Compute the starting reverse postorder. We tweak this later to try
1204 auto *postorder = new int[n_basic_blocks_for_fn (m_fn)]; local
1206 = pre_and_rev_post_order_compute (nullptr, postorder, true);
1209 // Iterate over the blocks in reverse postorder. In cases where
1216 if (!m_bbs[postorder[i]])
1219 basic_block cfg_bb = BASIC_BLOCK_FOR_FN (m_fn, postorder[i]);
1236 delete[] postorder;

Completed in 218 milliseconds

12