Searched refs:phi_nodes (Results 1 - 25 of 39) sorted by relevance
12
/freebsd-9.3-release/contrib/gcc/ |
H A D | tree-phinodes.c | 317 for (loc = &(bb->phi_nodes); 356 PHI_CHAIN (phi) = phi_nodes (bb); 357 bb->phi_nodes = phi; 438 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 456 for (loc = &(bb_for_stmt (phi)->phi_nodes);
|
H A D | tree-cfgcleanup.c | 270 || (phi_nodes (bb) != NULL_TREE) != phi_wanted 361 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 421 || phi_nodes (dest) != NULL_TREE) 428 if (phi_nodes (dest)) 457 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 685 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 781 if (!phi_nodes (dest) 804 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-vectorizer.c | 243 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 315 for (phi_new = phi_nodes (new_loop->header), 316 phi_orig = phi_nodes (orig_loop->header); 527 for (orig_phi = phi_nodes (orig_bb), update_phi = phi_nodes (update_bb); 602 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb))); 653 for (update_phi = phi_nodes (update_bb); update_phi; 757 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb))); 872 for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi)) 913 for (phi = phi_nodes (loo [all...] |
H A D | tree-tailcall.c | 364 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 595 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) 604 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) 774 phi = phi_nodes (first); 964 set_phi_nodes (first, phi_reverse (phi_nodes (first)));
|
H A D | tree-ssa-dce.c | 402 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 587 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 680 phi = phi_nodes (bb); 762 || phi_nodes (post_dom_bb))
|
H A D | tree-outof-ssa.c | 370 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) 594 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 687 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1099 for (phi = phi_nodes (bb); phi; phi = next) 1163 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1878 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1973 phi = phi_nodes (bb); 2407 for (phi = phi_nodes (bb); phi; phi = next) 2439 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-loop-manip.c | 286 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 433 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 454 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) 910 for (phi_old_loop = phi_nodes (loop->header), 911 phi_new_loop = phi_nodes (new_loop->header);
|
H A D | tree-cfg.c | 1221 phi = phi_nodes (b); 1327 for (phi = phi_nodes (b); phi; phi = phi_nodes (b)) 1981 phi = phi_nodes (bb); 3001 && ! phi_nodes (dest) 3151 for (var = PENDING_STMT (old_edge), phi = phi_nodes (new_edge->dest); 3597 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 4003 for (phi = phi_nodes (dummy); phi; phi = PHI_CHAIN (phi)) 4013 set_phi_nodes (bb, phi_reverse (phi_nodes (bb))); 4310 for (phi = phi_nodes (b [all...] |
H A D | tree-ssa-copyrename.c | 332 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-dse.c | 373 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa.c | 61 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 90 for (phi = phi_nodes (e->dest), arg = PENDING_STMT (e); 731 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1275 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-live.c | 362 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 436 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 666 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 691 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 780 for (phi = phi_nodes (e->dest); 831 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1502 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-vect-analyze.c | 252 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 509 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1634 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1798 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1948 || phi_nodes (loop->latch))
|
H A D | tree-into-ssa.c | 416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1308 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1412 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) 1473 print_generic_stmt (file, phi_nodes (bb), dump_flags); 1655 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 2233 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-propagate.c | 402 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) 1110 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-loop-ivcanon.c | 421 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-math-opts.c | 482 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-threadedge.c | 170 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-if-conv.c | 567 phi = phi_nodes (bb); 870 phi = phi_nodes (bb); 885 bb->phi_nodes = NULL;
|
H A D | tree-flow-inline.h | 540 phi_nodes (basic_block bb) function 542 return bb->phi_nodes; 552 bb->phi_nodes = l;
|
H A D | tree-scalar-evolution.c | 2119 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) 2687 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 2909 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 2989 for (phi = phi_nodes (exit->dest); phi; phi = next_phi)
|
H A D | tree-ssa-dom.c | 726 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) 1234 phi = phi_nodes (e->dest); 2298 for (phi = phi_nodes (e->dest); 2398 for (phi = phi_nodes (bb); phi; phi = next)
|
H A D | tree-ssa-threadupdate.c | 324 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
|
H A D | tree-ssa-uncprop.c | 479 tree phi = phi_nodes (e->dest);
|
H A D | lambda-code.c | 2392 for (phi = phi_nodes (exitdest); phi; phi = PHI_CHAIN (phi)) 2471 for (phi = phi_nodes (olddest); phi; phi = PHI_CHAIN (phi)) 2481 while (phi_nodes (olddest) != NULL) 2483 SET_PHI_RESULT (phi_nodes (olddest), NULL); 2484 remove_phi_node (phi_nodes (olddest), NULL);
|
Completed in 283 milliseconds
12