Searched refs:PHI_NUM_ARGS (Results 1 - 25 of 26) sorted by relevance

12

/freebsd-11.0-release/contrib/gcc/
H A Dtree-phinodes.c219 PHI_NUM_ARGS (phi) = len;
248 for (x = 0; x < PHI_NUM_ARGS (phi); x++)
274 first PHI_NUM_ARGS elements. Therefore, all we have to copy is a
277 + (PHI_NUM_ARGS (*phi) - 1) * sizeof (struct phi_arg_d));
283 for (i = 0; i < PHI_NUM_ARGS (new_phi); i++)
294 for (i = PHI_NUM_ARGS (new_phi); i < len; i++)
342 PHI_NUM_ARGS (*loc)++;
380 gcc_assert (PHI_NUM_ARGS (phi) <= PHI_ARG_CAPACITY (phi));
384 gcc_assert (e->dest_idx < (unsigned int) PHI_NUM_ARGS (phi));
405 int num_elem = PHI_NUM_ARGS (ph
[all...]
H A Dtree-ssa-dce.c521 for (k = 0; k < PHI_NUM_ARGS (i); k++)
530 for (k = 0; k < PHI_NUM_ARGS (i); k++)
591 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
620 for (i = 0; i < PHI_NUM_ARGS (use); i++)
H A Dtree-ssa.c308 unsigned i, phi_num_args = PHI_NUM_ARGS (phi);
1063 for (i = 0; i < PHI_NUM_ARGS (def_stmt); i++)
1068 for (i = 0; i < PHI_NUM_ARGS (def_stmt); i++)
1079 for (i = 0; i < PHI_NUM_ARGS (def_stmt); i++)
1232 int i, n = PHI_NUM_ARGS (phi);
H A Dtree-dfa.c537 dfa_stats_p->num_phi_args += PHI_NUM_ARGS (phi);
538 if (PHI_NUM_ARGS (phi) > dfa_stats_p->max_num_phi_args)
539 dfa_stats_p->max_num_phi_args = PHI_NUM_ARGS (phi);
H A Dtree-ssa-copyrename.c341 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
H A Dtree-ssa-sink.c91 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
H A Dtree-outof-ssa.c696 for (x = 0; x < PHI_NUM_ARGS (phi); x++)
1108 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
1175 for (x = 0; x < (unsigned)PHI_NUM_ARGS (phi); x++)
1886 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
2449 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
H A Dtree-scalar-evolution.c1294 for (i = 1; i < PHI_NUM_ARGS (condition_phi); i++)
1336 for (i = 0; i < PHI_NUM_ARGS (loop_phi_node); i++)
1450 for (i = 0; i < PHI_NUM_ARGS (loop_phi_node); i++)
1518 for (i = 0; i < PHI_NUM_ARGS (loop_phi_node); i++)
1597 for (i = 0; i < PHI_NUM_ARGS (condition_phi); i++)
H A Dtree-ssa-dom.c732 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
764 if (i == PHI_NUM_ARGS (phi)
1205 for (i = 0; i < (unsigned) PHI_NUM_ARGS (phi); i++)
2065 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
2076 return (i == PHI_NUM_ARGS (phi) ? val : NULL);
H A Dtree-ssa-live.c440 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
668 for (i = 0; i < (unsigned)PHI_NUM_ARGS (phi); i++)
784 for (z = 0; z < PHI_NUM_ARGS (phi); z++)
832 for (i = 0; i < (unsigned)PHI_NUM_ARGS (phi); i++)
H A Dtree-if-conv.c310 if (bb != loop->header && PHI_NUM_ARGS (phi) != 2)
809 gcc_assert (PHI_NUM_ARGS (phi) == 2);
H A Dtree-object-size.c741 for (i = 0; i < PHI_NUM_ARGS (stmt); i++)
865 for (i = 0; i < PHI_NUM_ARGS (stmt); i++)
H A Dtree-ssa-ccp.c587 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
761 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
2162 for (i = 0; i < PHI_NUM_ARGS (def_stmt); i++)
H A Dlambda-code.c1315 if (PHI_NUM_ARGS (phi) != 2)
1995 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
2213 || PHI_NUM_ARGS (stmt) != 1
2393 if (PHI_NUM_ARGS (phi) != 1)
H A Dtree-ssa-copy.c780 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
H A Dtree-ssa-propagate.c1008 for (i = 0; i < PHI_NUM_ARGS (phi); i++)
H A Dpredict.c923 for (i = 0; i < PHI_NUM_ARGS (def); i++)
1224 phi_num_args = PHI_NUM_ARGS (phi);
H A Dtree-complex.c370 for (i = PHI_NUM_ARGS (phi) - 1; i >= 0; --i)
692 for (i = 0, n = PHI_NUM_ARGS (phi); i < n; ++i)
H A Dtree-ssa-loop-manip.c434 for (i = 0; i < (unsigned) PHI_NUM_ARGS (phi); i++)
H A Dtree-pretty-print.c1617 for (i = 0; i < PHI_NUM_ARGS (node); i++)
1623 if (i < PHI_NUM_ARGS (node) - 1)
H A Dtree-flow-inline.h1269 ptr->num_phi = PHI_NUM_ARGS (phi);
H A Dtree-ssa-pre.c3687 VEC_reserve (tree, heap, worklist, PHI_NUM_ARGS (t));
3688 for (k = 0; k < PHI_NUM_ARGS (t); k++)
H A Dtree-cfg.c3599 int phi_num_args = PHI_NUM_ARGS (phi);
H A Dtree-ssa-structalias.c3358 for (i = 0; i < PHI_NUM_ARGS (t); i++)
H A Dtree-vrp.c4785 for (i = 0; i < PHI_NUM_ARGS (phi); i++)

Completed in 231 milliseconds

12