Searched refs:PHI_ARG_DEF (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-10.1-release/contrib/gcc/
H A Dtree-cfgcleanup.c363 tree val1 = PHI_ARG_DEF (phi, n1);
364 tree val2 = PHI_ARG_DEF (phi, n2);
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s);
687 tree def = PHI_ARG_DEF (phi, succ->dest_idx);
819 || PHI_ARG_DEF (use_stmt, dest_idx) != result)
H A Dtree-ssa-operands.h144 #define PHI_ARG_DEF(PHI, I) USE_FROM_PTR (PHI_ARG_DEF_PTR ((PHI), (I))) macro
148 PHI_ARG_DEF ((PHI), (E)->dest_idx)
H A Dtree-ssa.c63 if (PHI_ARG_DEF (phi, e->dest_idx) == NULL_TREE)
66 src = PHI_ARG_DEF (phi, e->dest_idx);
1064 if (fn (PHI_ARG_DEF (def_stmt, i), def_stmt, data))
1070 tree arg = PHI_ARG_DEF (def_stmt, i);
1080 if (fn (PHI_ARG_DEF (def_stmt, i), def_stmt, data))
1240 tree op = PHI_ARG_DEF (phi, i);
H A Dtree-outof-ssa.c378 Ti = PHI_ARG_DEF (phi, g->e->dest_idx);
605 tmp = PHI_ARG_DEF (phi, e->dest_idx);
698 tree arg = PHI_ARG_DEF (phi, x);
705 p2 = var_to_partition (map, PHI_ARG_DEF (phi, x));
1110 tree arg = PHI_ARG_DEF (phi, i);
1177 arg = PHI_ARG_DEF (phi, x);
1888 tree arg = PHI_ARG_DEF (phi, i);
2451 tree arg = PHI_ARG_DEF (phi, i);
2492 NULL_TREE, PHI_ARG_DEF (phi, i));
H A Dtree-ssa-dce.c523 tree arg = PHI_ARG_DEF (i, k);
592 mark_operand_necessary (PHI_ARG_DEF (phi, i), true);
621 mark_operand_necessary (PHI_ARG_DEF (use, i), true);
H A Dtree-if-conv.c817 arg_0 = PHI_ARG_DEF (phi, 1);
818 arg_1 = PHI_ARG_DEF (phi, 0);
822 arg_0 = PHI_ARG_DEF (phi, 0);
823 arg_1 = PHI_ARG_DEF (phi, 1);
H A Dtree-ssa-copyrename.c343 tree arg = PHI_ARG_DEF (phi, i);
H A Dpredict.c925 tree arg = PHI_ARG_DEF (def, i);
1225 pred = return_prediction (PHI_ARG_DEF (phi, 0), &direction);
1231 if (pred != return_prediction (PHI_ARG_DEF (phi, i), &direction))
1236 pred = return_prediction (PHI_ARG_DEF (phi, i), &direction);
H A Dtree-ssa-sink.c92 if (PHI_ARG_DEF (phi, i) == def)
H A Dtree-scalar-evolution.c1248 tree branch = PHI_ARG_DEF (condition_phi, i);
1338 tree arg = PHI_ARG_DEF (loop_phi_node, i);
1452 tree arg = PHI_ARG_DEF (loop_phi_node, i);
1520 tree branch = PHI_ARG_DEF (loop_phi_node, i);
1608 (loop, PHI_ARG_DEF (condition_phi, i));
H A Dtree-ssa-live.c442 arg = PHI_ARG_DEF (phi, i);
670 var = PHI_ARG_DEF (phi, i);
785 if (var == PHI_ARG_DEF (phi, z))
834 t = PHI_ARG_DEF (phi, i);
H A Dtree-ssa-threadupdate.c327 add_phi_arg (phi, PHI_ARG_DEF (phi, indx), e);
H A Dtree-ssa-uncprop.c497 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
H A Dtree-object-size.c743 tree rhs = PHI_ARG_DEF (stmt, i);
867 tree rhs = PHI_ARG_DEF (stmt, i);
H A Dtree-ssa-ccp.c589 arg = PHI_ARG_DEF (phi, i);
779 tree arg = PHI_ARG_DEF (phi, i);
2164 tree arg = PHI_ARG_DEF (def_stmt, i);
H A Dtree-ssa-dom.c734 tree t = PHI_ARG_DEF (phi, i);
1206 if (PHI_ARG_DEF (phi, i) == lhs)
2067 tree arg = PHI_ARG_DEF (phi, i);
H A Dlambda-code.c1338 lboundvar = PHI_ARG_DEF (phi, 1);
1345 lboundvar = PHI_ARG_DEF (phi, 0);
1997 if (PHI_ARG_DEF (phi, i) == def)
2475 VEC_quick_push (tree, phis, PHI_ARG_DEF (phi, 0));
H A Dtree-ssa-copy.c783 tree arg = PHI_ARG_DEF (phi, i);
H A Dtree-ssa-propagate.c1010 tree arg = PHI_ARG_DEF (phi, i);
H A Dtree-ssa-pre.c1009 tree def = PHI_ARG_DEF (phi, e->dest_idx);
1377 if (is_undefined_value (PHI_ARG_DEF (phi, e->dest_idx)))
1379 vn_lookup_or_add (PHI_ARG_DEF (phi, e->dest_idx), NULL);
1380 return PHI_ARG_DEF (phi, e->dest_idx);
3690 tree arg = PHI_ARG_DEF (t, k);
H A Dtree-complex.c371 new_l |= find_lattice_value (PHI_ARG_DEF (phi, i));
694 tree comp, arg = PHI_ARG_DEF (phi, i);
H A Dtree-cfg.c1229 && !may_propagate_copy (PHI_RESULT (phi), PHI_ARG_DEF (phi, 0)))
1329 tree def = PHI_RESULT (phi), use = PHI_ARG_DEF (phi, 0);
3609 tree t = PHI_ARG_DEF (phi, i);
5557 tree def = PHI_ARG_DEF (phi2, e2->dest_idx);
H A Dtree-ssa-loop-manip.c436 PHI_ARG_DEF (phi, i));
H A Dtree-ssa-structalias.c3361 tree strippedrhs = PHI_ARG_DEF (t, i);
3365 get_constraint_for (PHI_ARG_DEF (t, i), &rhsc);
H A Dtree-pretty-print.c1619 dump_generic_node (buffer, PHI_ARG_DEF (node, i), spc, flags, false);

Completed in 269 milliseconds

12