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

/haiku-buildtools/gcc/gcc/
H A Ddomwalk.c167 int *postorder, postorder_num; local
171 postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
172 postorder_num = inverted_post_order_compute (postorder);
175 bb_postorder[postorder[i]] = i;
176 free (postorder);
H A Dgraphds.c183 The vertices in postorder are stored into QT. If FORWARD is false,
263 Tarjan -- first determine the postorder dfs numbering in reversed graph,
277 vec<int> postorder = vNULL; local
297 graphds_dfs (g, queue, nq, &postorder, false, subgraph);
298 gcc_assert (postorder.length () == (unsigned) nq);
301 queue[i] = postorder[nq - i - 1];
305 postorder.release ();
390 vec<int> postorder = vNULL; local
402 sort vertices in reverse postorder
420 graphds_dfs (g, &entry, 1, &postorder, tru
[all...]
H A Ddf-core.c734 df->postorder = XNEWVEC (int, last_basic_block_for_fn (cfun));
736 df->n_blocks = post_order_compute (df->postorder, true, true);
848 free (df->postorder);
1016 BLOCK_IN_POSTORDER is array of size N_BLOCKS specifying postorder in BBs and
1017 BBINDEX_TO_POSTORDER is array mapping back BB->index to postorder position.
1020 The worklists are bitmaps indexed by postorder positions.
1105 with "n"-th bit representing the n-th block in the reverse-postorder order.
1127 /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1142 /* Initialize the mapping of block index to postorder. */
1191 int *postorder, in
1188 df_analyze_problem(struct dataflow *dflow, bitmap blocks_to_consider, int *postorder, int n_blocks) argument
1531 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.c123 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
124 int postorder_num = post_order_compute (postorder, false, false);
127 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
131 free (postorder);
299 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
300 int postorder_num = inverted_post_order_compute (postorder);
303 bb = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
310 free (postorder);
539 optimistic initialization of AVOUT above. Use inverted postorder
541 int *postorder
122 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
298 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
540 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun)); local
[all...]
H A Ddce.c1050 int *postorder = df_get_postorder (DF_BACKWARD); local
1073 bitmap_set_bit (all_blocks, postorder[i]);
1083 int index = postorder[i];
1138 df_analyze_problem (df_word_lr, all_blocks, postorder, n_blocks);
1140 df_analyze_problem (df_lr, all_blocks, postorder, n_blocks);
H A Dsel-sched-ir.c3712 int *postorder, n_blocks;
3714 postorder = XALLOCAVEC (int, n_basic_blocks_for_fn (cfun));
3715 n_blocks = post_order_compute (postorder, false, false);
3719 if (CONTAINING_RGN (postorder[i]) == rgn)
3721 BLOCK_TO_BB (postorder[i]) = n;
3722 BB_TO_BLOCK (n) = postorder[i];
4985 int *postorder;
4996 postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
4998 n_blocks = post_order_compute (postorder, true, false);
5005 gcc_assert (postorder[
3692 int *postorder, n_blocks; local
4961 int *postorder; local
[all...]
H A Dtree-ssa-pre.c483 /* Basic block list in postorder. */
484 static int *postorder; variable
2437 if (bitmap_bit_p (worklist, postorder[i]))
2439 basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
2472 if (bitmap_bit_p (worklist, postorder[i]))
2474 basic_block block = BASIC_BLOCK_FOR_FN (cfun, postorder[i]);
4775 /* For ANTIC computation we need a postorder that also guarantees that
4778 postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
4779 postorder_num = inverted_post_order_compute (postorder);
4807 free (postorder);
[all...]
H A Dtree-ssa-forwprop.c2142 int *postorder = XNEWVEC (int, n_basic_blocks_for_fn (fun)); local
2143 int postorder_num = inverted_post_order_compute (postorder);
2149 basic_block bb = BASIC_BLOCK_FOR_FN (fun, postorder[i]);
2476 free (postorder);
H A Ddf.h584 int *postorder; /* The current set of basic blocks
585 in reverse postorder. */
587 in reverse postorder of inverted CFG. */
588 int n_blocks; /* The number of blocks in reverse postorder. */
590 in reverse postorder of inverted CFG. */
583 int *postorder; /* The current set of basic blocks member in struct:df_d
H A Ddf-problems.c1061 df_worklist_dataflow (df_lr, all_blocks, df->postorder, df->n_blocks);
3291 loop to postorder would still leave room for visiting a death

Completed in 135 milliseconds