Searched refs:EDGE_PRED (Results 1 - 16 of 16) sorted by relevance
/freebsd-11.0-release/contrib/gcc/ |
H A D | sbitmap.c | 580 e = EDGE_PRED (b, ix); 596 e = EDGE_PRED (b, ix); 660 e = EDGE_PRED (b, ix); 676 e = EDGE_PRED (b, ix);
|
H A D | tree-vectorizer.c | 749 add_phi_arg (new_phi, arg, EDGE_PRED (guard_edge->src, 0)); 1020 && ((EDGE_PRED (loop2_entry_bb, 0)->src == loop1_exit_bb 1021 && EDGE_PRED (loop2_entry_bb, 1)->src == loop1_entry_bb) 1022 || (EDGE_PRED (loop2_entry_bb, 1)->src == loop1_exit_bb 1023 && EDGE_PRED (loop2_entry_bb, 0)->src == loop1_entry_bb)));
|
H A D | cfgcleanup.c | 1717 && !(EDGE_PRED (src2, 0)->flags & EDGE_EH)) 1857 if (BB_PARTITION (EDGE_PRED (bb, 0)->src) != 1858 BB_PARTITION (EDGE_PRED (bb, 1)->src) 1859 || (EDGE_PRED (bb, 0)->flags & EDGE_CROSSING)) 1880 e = EDGE_PRED (ev, ix); 1923 e2 = EDGE_PRED (ev2, ix2);
|
H A D | tree-if-conv.c | 691 first_edge = EDGE_PRED (bb, 0); 692 second_edge = EDGE_PRED (bb, 1); 815 if (EDGE_PRED (bb, 1)->src == true_bb)
|
H A D | cfgloopmanip.c | 1119 e = EDGE_PRED (loop->header, 1120 EDGE_PRED (loop->header, 0)->src == loop->latch); 1152 e = EDGE_PRED (dummy, 0);
|
H A D | tree-cfgcleanup.c | 656 edge e = EDGE_PRED (bb, 0), s;
|
H A D | tree-ssa-threadupdate.c | 786 edge e = EDGE_PRED (bb, 0)->aux;
|
H A D | basic-block.h | 599 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i)) 635 return EDGE_PRED (bb, 0); 598 #define EDGE_PRED macro
|
H A D | cfghooks.c | 380 remove_edge (EDGE_PRED (bb, 0));
|
H A D | tree-vect-transform.c | 2624 if (EDGE_PRED (preheader, 0)->src == loop->single_exit->dest) 2625 update_e = EDGE_PRED (preheader, 0); 2627 update_e = EDGE_PRED (preheader, 1);
|
H A D | cfg.c | 260 EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
|
H A D | tree-ssa.c | 323 e = EDGE_PRED (bb, i);
|
H A D | cfgexpand.c | 1565 e = EDGE_PRED (EXIT_BLOCK_PTR, ix);
|
H A D | tree-ssa-pre.c | 2495 tree type = TREE_TYPE (avail[EDGE_PRED (block, 0)->src->index]); 2515 EDGE_PRED (block, 0)->src); 2517 EDGE_PRED (block, 1)->src);
|
H A D | tree-ssa-live.c | 674 e = EDGE_PRED (bb, i);
|
H A D | tree.h | 1802 #define PHI_ARG_EDGE(NODE, I) (EDGE_PRED (PHI_BB ((NODE)), (I)))
|
Completed in 128 milliseconds