| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | graphds.cc | 295 vec<int> postorder = vNULL; in graphds_scc() local
315 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p); in graphds_scc()
316 gcc_assert (postorder.length () == (unsigned) nq); in graphds_scc()
319 queue[i] = postorder[nq - i - 1]; in graphds_scc()
323 postorder.release (); in graphds_scc()
408 vec<int> postorder = vNULL; in graphds_domtree() local
438 graphds_dfs (g, &entry, 1, &postorder, true, NULL); in graphds_domtree()
439 gcc_assert (postorder.length () == (unsigned) g->n_vertices); in graphds_domtree()
440 gcc_assert (postorder[g->n_vertices - 1] == entry); in graphds_domtree()
448 v = postorder[i]; in graphds_domtree()
[all …]
|
| H A D | lcm.cc | 103 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in compute_antinout_edge() local
104 int postorder_num = post_order_compute (postorder, false, false); in compute_antinout_edge()
107 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); in compute_antinout_edge()
111 free (postorder); in compute_antinout_edge()
273 auto_vec<int, 20> postorder; in compute_laterin() local
274 inverted_post_order_compute (&postorder); in compute_laterin()
275 for (unsigned int i = 0; i < postorder.length (); ++i) in compute_laterin()
277 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); in compute_laterin()
514 auto_vec<int, 20> postorder; in compute_available() local
515 inverted_post_order_compute (&postorder); in compute_available()
[all …]
|
| H A D | df-core.cc | 704 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in rest_of_handle_df_initialize()
705 df->n_blocks = post_order_compute (df->postorder, true, true); in rest_of_handle_df_initialize()
817 free (df->postorder); in rest_of_handle_df_finish()
1156 int *postorder, int n_blocks) in df_analyze_problem() argument
1176 postorder, n_blocks); in df_analyze_problem()
1230 df->postorder, in df_analyze_1()
1253 free (df->postorder); in df_analyze()
1254 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in df_analyze()
1255 df->n_blocks = post_order_compute (df->postorder, true, true); in df_analyze()
1260 bitmap_set_bit (current_all_blocks, df->postorder[i]); in df_analyze()
[all …]
|
| H A D | domwalk.cc | 278 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in walk() local
279 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, in walk()
283 m_bb_to_rpo[postorder[i]] = i; in walk()
284 free (postorder); in walk()
|
| H A D | gimple-ssa-backprop.cc | 878 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); in execute() local
879 unsigned int postorder_num = post_order_compute (postorder, false, false); in execute()
882 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i])); in execute()
883 bitmap_set_bit (m_visited_blocks, postorder[i]); in execute()
885 XDELETEVEC (postorder); in execute()
|
| H A D | dce.cc | 1079 int *postorder = df_get_postorder (DF_BACKWARD); in fast_dce() local
1102 bitmap_set_bit (all_blocks, postorder[i]); in fast_dce()
1112 int index = postorder[i]; in fast_dce()
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks); in fast_dce()
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks); in fast_dce()
|
| H A D | cfganal.h | 69 extern void inverted_post_order_compute (vec<int> *postorder, sbitmap *start_points = 0);
|
| H A D | early-remat.cc | 1054 int *postorder = df_get_postorder (DF_BACKWARD); in sort_candidates() local
1058 postorder_index[postorder[i]] = i; in sort_candidates()
2100 int *postorder = df_get_postorder (DF_BACKWARD); in local_phase() local
2103 if (postorder[i] >= NUM_FIXED_BLOCKS) in local_phase()
2104 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i])); in local_phase()
2466 int *postorder = df_get_postorder (DF_BACKWARD); in choose_rematerialization_points() local
2475 unsigned int bb_index = postorder[i]; in choose_rematerialization_points()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | graphds.c | 295 vec<int> postorder = vNULL; in graphds_scc() local
315 graphds_dfs (g, queue, nq, &postorder, false, subgraph, skip_edge_p); in graphds_scc()
316 gcc_assert (postorder.length () == (unsigned) nq); in graphds_scc()
319 queue[i] = postorder[nq - i - 1]; in graphds_scc()
323 postorder.release (); in graphds_scc()
408 vec<int> postorder = vNULL; in graphds_domtree() local
438 graphds_dfs (g, &entry, 1, &postorder, true, NULL); in graphds_domtree()
439 gcc_assert (postorder.length () == (unsigned) g->n_vertices); in graphds_domtree()
440 gcc_assert (postorder[g->n_vertices - 1] == entry); in graphds_domtree()
448 v = postorder[i]; in graphds_domtree()
[all …]
|
| H A D | lcm.c | 103 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in compute_antinout_edge() local
104 int postorder_num = post_order_compute (postorder, false, false); in compute_antinout_edge()
107 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); in compute_antinout_edge()
111 free (postorder); in compute_antinout_edge()
273 auto_vec<int, 20> postorder; in compute_laterin() local
274 inverted_post_order_compute (&postorder); in compute_laterin()
275 for (unsigned int i = 0; i < postorder.length (); ++i) in compute_laterin()
277 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]); in compute_laterin()
514 auto_vec<int, 20> postorder; in compute_available() local
515 inverted_post_order_compute (&postorder); in compute_available()
[all …]
|
| H A D | df-core.c | 704 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in rest_of_handle_df_initialize()
705 df->n_blocks = post_order_compute (df->postorder, true, true); in rest_of_handle_df_initialize()
817 free (df->postorder); in rest_of_handle_df_finish()
1156 int *postorder, int n_blocks) in df_analyze_problem() argument
1176 postorder, n_blocks); in df_analyze_problem()
1230 df->postorder, in df_analyze_1()
1253 free (df->postorder); in df_analyze()
1254 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun)); in df_analyze()
1255 df->n_blocks = post_order_compute (df->postorder, true, true); in df_analyze()
1260 bitmap_set_bit (current_all_blocks, df->postorder[i]); in df_analyze()
[all …]
|
| H A D | domwalk.c | 278 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in walk() local
279 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, in walk()
283 m_bb_to_rpo[postorder[i]] = i; in walk()
284 free (postorder); in walk()
|
| H A D | gimple-ssa-backprop.c | 879 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (m_fn)); in execute() local
880 unsigned int postorder_num = post_order_compute (postorder, false, false); in execute()
883 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i])); in execute()
884 bitmap_set_bit (m_visited_blocks, postorder[i]); in execute()
886 XDELETEVEC (postorder); in execute()
|
| H A D | dce.c | 1079 int *postorder = df_get_postorder (DF_BACKWARD); in fast_dce() local
1102 bitmap_set_bit (all_blocks, postorder[i]); in fast_dce()
1112 int index = postorder[i]; in fast_dce()
1167 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks); in fast_dce()
1169 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks); in fast_dce()
|
| H A D | cfganal.h | 66 extern void inverted_post_order_compute (vec<int> *postorder, sbitmap *start_points = 0);
|
| H A D | early-remat.c | 1054 int *postorder = df_get_postorder (DF_BACKWARD); in sort_candidates() local
1058 postorder_index[postorder[i]] = i; in sort_candidates()
2100 int *postorder = df_get_postorder (DF_BACKWARD); in local_phase() local
2103 if (postorder[i] >= NUM_FIXED_BLOCKS) in local_phase()
2104 process_block (BASIC_BLOCK_FOR_FN (m_fn, postorder[i])); in local_phase()
2466 int *postorder = df_get_postorder (DF_BACKWARD); in choose_rematerialization_points() local
2475 unsigned int bb_index = postorder[i]; in choose_rematerialization_points()
|
| H A D | tree-ssa-dce.c | 1166 auto_vec<int, 20> postorder; in remove_dead_stmt() local
1167 inverted_post_order_compute (&postorder, in remove_dead_stmt()
1170 for (unsigned int i = 0; i < postorder.length (); ++i) in remove_dead_stmt()
1171 bb_postorder[postorder[i]] = i; in remove_dead_stmt()
|
| H A D | graphite-scop-detection.c | 1605 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); in build_scops() local
1606 int postorder_num = pre_and_rev_post_order_compute (NULL, postorder, true); in build_scops()
1609 bb_to_rpo[postorder[i]] = i; in build_scops()
1610 free (postorder); in build_scops()
|
| /netbsd-src/lib/libc/gen/ |
| H A D | nftw.c | 47 int ftsflags, fnflag, error, postorder, sverrno; in nftw() local
62 postorder = (ftwflags & FTW_DEPTH) != 0; in nftw()
70 if (postorder) in nftw()
78 if (!postorder) in nftw()
|
| /netbsd-src/lib/libc/stdlib/ |
| H A D | twalk.c | 40 (*action)(root, postorder, level); in trecurse()
|
| /netbsd-src/include/ |
| H A D | search.h | 40 postorder, enumerator
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| H A D | search.hin | 28 postorder,
|
| H A D | tsearch-test.c | 52 if (order == postorder || order == leaf) { in list_node()
|
| H A D | tsearch.c | 89 (*action)(root, postorder, level); in trecurse()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| H A D | blocks.cc | 1209 auto *postorder = new int[n_basic_blocks_for_fn (m_fn)]; in create_ebbs() local
1211 = pre_and_rev_post_order_compute (nullptr, postorder, true); in create_ebbs()
1221 if (!m_bbs[postorder[i]]) in create_ebbs()
1224 basic_block cfg_bb = BASIC_BLOCK_FOR_FN (m_fn, postorder[i]); in create_ebbs()
1241 delete[] postorder; in create_ebbs()
|