HomeSort by: relevance | last modified time | path
    Searched defs:dest_bb (Results 1 - 16 of 16) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/rtl-ssa/
blocks.cc 1010 bb_info *dest_bb = this->bb (e->dest); local
1011 if (dest_bb->ebb () != ebb || dest_bb == ebb->first_bb ())
blocks.cc 1010 bb_info *dest_bb = this->bb (e->dest); local
1011 if (dest_bb->ebb () != ebb || dest_bb == ebb->first_bb ())
  /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/
blocks.cc 991 bb_info *dest_bb = this->bb (e->dest); local
992 if (dest_bb->ebb () != ebb || dest_bb == ebb->first_bb ())
blocks.cc 991 bb_info *dest_bb = this->bb (e->dest); local
992 if (dest_bb->ebb () != ebb || dest_bb == ebb->first_bb ())
  /src/external/gpl3/gcc/dist/gcc/
tree-vect-data-refs.cc 670 basic_block dest_bb = NULL; local
693 dest_bb = loop->latch;
695 dest_bb = single_pred (loop->latch);
697 /* We start looking from dest_bb, for the non-PEELED case we don't want to
700 basic_block bb = dest_bb;
702 /* We move stores across all loads to the beginning of dest_bb, so
724 /* We know everything below dest_bb is safe since we know we
828 gcc_assert (dest_bb->loop_father == loop);
835 if (!single_pred (dest_bb))
840 dest_bb->index)
    [all...]
tree-vect-data-refs.cc 670 basic_block dest_bb = NULL; local
693 dest_bb = loop->latch;
695 dest_bb = single_pred (loop->latch);
697 /* We start looking from dest_bb, for the non-PEELED case we don't want to
700 basic_block bb = dest_bb;
702 /* We move stores across all loads to the beginning of dest_bb, so
724 /* We know everything below dest_bb is safe since we know we
828 gcc_assert (dest_bb->loop_father == loop);
835 if (!single_pred (dest_bb))
840 dest_bb->index)
    [all...]
omp-expand.cc 1450 basic_block dest_bb = e2->dest; local
1452 make_edge (new_bb, dest_bb, EDGE_FALLTHRU);
1454 set_immediate_dominator (CDI_DOMINATORS, dest_bb, new_bb);
tree-cfg.cc 2538 basic_block dest_bb; local
2553 dest_bb = label_to_block (cfun, CASE_LABEL (taken_case));
2555 e = find_edge (gimple_bb (switch_stmt), dest_bb);
omp-expand.cc 1450 basic_block dest_bb = e2->dest; local
1452 make_edge (new_bb, dest_bb, EDGE_FALLTHRU);
1454 set_immediate_dominator (CDI_DOMINATORS, dest_bb, new_bb);
tree-cfg.cc 2538 basic_block dest_bb; local
2553 dest_bb = label_to_block (cfun, CASE_LABEL (taken_case));
2555 e = find_edge (gimple_bb (switch_stmt), dest_bb);
  /src/external/gpl3/gcc.old/dist/gcc/
tree-vrp.cc 2767 basic_block dest_bb; local
2796 dest_bb = (bb) ? bb : e->dest;
2799 VAL at a block dominating DEST_BB, then we don't need to insert a new
2801 dominated by DEST_BB and the new location is not on a critical
2819 /* If E is not a critical edge and DEST_BB
2824 && dominated_by_p (CDI_DOMINATORS, loc->bb, dest_bb))
2826 loc->bb = dest_bb;
2842 n->bb = dest_bb;
tree-vrp.cc 2767 basic_block dest_bb; local
2796 dest_bb = (bb) ? bb : e->dest;
2799 VAL at a block dominating DEST_BB, then we don't need to insert a new
2801 dominated by DEST_BB and the new location is not on a critical
2819 /* If E is not a critical edge and DEST_BB
2824 && dominated_by_p (CDI_DOMINATORS, loc->bb, dest_bb))
2826 loc->bb = dest_bb;
2842 n->bb = dest_bb;
omp-expand.cc 1447 basic_block dest_bb = e2->dest; local
1449 make_edge (new_bb, dest_bb, EDGE_FALLTHRU);
1451 set_immediate_dominator (CDI_DOMINATORS, dest_bb, new_bb);
tree-cfg.cc 2462 basic_block dest_bb; local
2477 dest_bb = label_to_block (cfun, CASE_LABEL (taken_case));
2479 e = find_edge (gimple_bb (switch_stmt), dest_bb);
omp-expand.cc 1447 basic_block dest_bb = e2->dest; local
1449 make_edge (new_bb, dest_bb, EDGE_FALLTHRU);
1451 set_immediate_dominator (CDI_DOMINATORS, dest_bb, new_bb);
tree-cfg.cc 2462 basic_block dest_bb; local
2477 dest_bb = label_to_block (cfun, CASE_LABEL (taken_case));
2479 e = find_edge (gimple_bb (switch_stmt), dest_bb);

Completed in 189 milliseconds