| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-reassoc.cc | 4435 of TEST_BB, and *OTHER_BB is either NULL and filled by the routine,
4439 TEST_BB is a bb ending in condition where the edge to non-*OTHER_BB
4440 block points to an empty block that falls through into *OTHER_BB and
4444 suitable_cond_bb (basic_block bb, basic_block test_bb, basic_block *other_bb,
4463 || *other_bb == bb)
4470 to *OTHER_BB (if not set yet, try to find it out). */
4486 if (*other_bb == NULL)
4492 *other_bb = e->dest;
4493 if (*other_bb == NULL)
4496 if (e->dest == *other_bb)
4740 basic_block other_bb = NULL; local
[all...] |
| tree-ssa-tail-merge.cc | 1073 basic_block merge_bb, other_bb; local
1089 other_bb = BB_CLUSTER (bb1) == NULL ? bb1 : bb2;
1091 add_bb_to_cluster (merge, other_bb);
1092 BB_CLUSTER (other_bb) = merge;
|
| ifcvt.cc | 5272 basic_block other_bb, trap_bb;
5281 trap_bb = then_bb, other_bb = else_bb;
5283 trap_bb = else_bb, other_bb = then_bb;
5354 if (can_merge_blocks_p (test_bb, other_bb))
5356 merge_blocks (test_bb, other_bb);
5700 basic_block other_bb, edge dest_edge, bool reversep)
5850 df_get_live_in (other_bb), NULL);
5923 if (other_bb != new_dest)
5947 if (other_bb != new_dest)
6001 if (other_bb == new_dest
5266 basic_block other_bb, trap_bb; local
[all...] |
| cfgcleanup.cc | 2350 basic_block other_bb = e->dest;
2352 if (df_get_bb_dirty (other_bb))
2379 if (EDGE_COUNT (other_bb->preds) != 1)
2385 || EDGE_COUNT (other_bb->preds) != 2)
2402 if (incoming_bb_other_edge->dest != other_bb)
|
| sel-sched-ir.cc | 5510 basic_block new_bb, src, other_bb = NULL;
5532 gcc_assert (!other_bb && (new_bb->index != bb->index));
5533 other_bb = bb;
5545 if (other_bb && !sel_bb_empty_p (other_bb))
5546 compute_live (sel_bb_head (other_bb));
5485 basic_block new_bb, src, other_bb = NULL; local
|
| tree-cfg.cc | 485 basic_block other_bb = EDGE_SUCC (pred_bb, 0)->dest; local
486 if (other_bb == e->dest)
487 other_bb = EDGE_SUCC (pred_bb, 1)->dest;
488 if (EDGE_COUNT (other_bb->succs) == 0)
489 return gimple_seq_unreachable_p (bb_seq (other_bb));
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-reassoc.cc | 4390 of TEST_BB, and *OTHER_BB is either NULL and filled by the routine,
4394 TEST_BB is a bb ending in condition where the edge to non-*OTHER_BB
4395 block points to an empty block that falls through into *OTHER_BB and
4399 suitable_cond_bb (basic_block bb, basic_block test_bb, basic_block *other_bb,
4418 || *other_bb == bb)
4425 to *OTHER_BB (if not set yet, try to find it out). */
4441 if (*other_bb == NULL)
4447 *other_bb = e->dest;
4448 if (*other_bb == NULL)
4451 if (e->dest == *other_bb)
4695 basic_block other_bb = NULL; local
[all...] |
| tree-ssa-tail-merge.cc | 1062 basic_block merge_bb, other_bb; local
1078 other_bb = BB_CLUSTER (bb1) == NULL ? bb1 : bb2;
1080 add_bb_to_cluster (merge, other_bb);
1081 BB_CLUSTER (other_bb) = merge;
|
| ifcvt.cc | 5076 basic_block other_bb, trap_bb;
5085 trap_bb = then_bb, other_bb = else_bb;
5087 trap_bb = else_bb, other_bb = then_bb;
5158 if (can_merge_blocks_p (test_bb, other_bb))
5160 merge_blocks (test_bb, other_bb);
5504 basic_block other_bb, edge dest_edge, int reversep)
5654 df_get_live_in (other_bb), NULL);
5727 if (other_bb != new_dest)
5751 if (other_bb != new_dest)
5805 if (other_bb == new_dest
5070 basic_block other_bb, trap_bb; local
[all...] |
| cfgcleanup.cc | 2350 basic_block other_bb = e->dest;
2352 if (df_get_bb_dirty (other_bb))
2379 if (EDGE_COUNT (other_bb->preds) != 1)
2385 || EDGE_COUNT (other_bb->preds) != 2)
2402 if (incoming_bb_other_edge->dest != other_bb)
|
| sel-sched-ir.cc | 5510 basic_block new_bb, src, other_bb = NULL;
5532 gcc_assert (!other_bb && (new_bb->index != bb->index));
5533 other_bb = bb;
5545 if (other_bb && !sel_bb_empty_p (other_bb))
5546 compute_live (sel_bb_head (other_bb));
5485 basic_block new_bb, src, other_bb = NULL; local
|
| tree-cfg.cc | 482 basic_block other_bb = EDGE_SUCC (pred_bb, 0)->dest; local
483 if (other_bb == e->dest)
484 other_bb = EDGE_SUCC (pred_bb, 1)->dest;
485 if (EDGE_COUNT (other_bb->succs) == 0)
486 return gimple_seq_unreachable_p (bb_seq (other_bb));
|
