contrib/gcc/tree-vectorizer.c

222   tree phi;
243       for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
244         rename_use_op (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e));
287      step 1. For each loop-header-phi:
288              Add the first phi argument for the phi in NEW_LOOP
291      step 2. For each loop-header-phi:
292              Add the second phi argument for the phi in NEW_LOOP
302                 phi nodes, organized in the same order.
399    1. creates and updates the relevant phi nodes to account for the new
401       1.1. Create phi nodes at NEW_MERGE_BB.
402       1.2. Update the phi nodes at the successor of NEW_MERGE_BB (denoted
404    2. preserves loop-closed-ssa-form by creating the required phi nodes
446    that change between iterations of a loop (and therefore have a phi-node
500    an entry (loop-header) phi in LOOP) we create a new phi in:
502    2. loop1_exit_bb (an exit-phi to keep LOOP in loop-closed form)
531       /* Virtual phi; Mark it for renaming. We actually want to call
542       /* 1.1. Generate new phi node in NEW_MERGE_BB:  */
547             of LOOP. Set the two phi args in NEW_PHI for these edges:  */
554       /* 1.3. Update phi in successor block.  */
563       /* 2.1. Generate new phi node in NEW_EXIT_BB:  */
570       /* 2.3. Update phi in successor of NEW_EXIT_BB:  */
625    phi in next_bb) we create a new phi in:
627    2. loop2_exit_bb (an exit-phi to keep LOOP in loop-closed form)
628    3. guard2 bb (an exit phi to keep the preceding loop in loop-closed form),
658       /* This loop-closed-phi actually doesn't represent a use
659          out of the loop - the phi arg is a constant.  */
667       /* 1.1. Generate new phi node in NEW_MERGE_BB:  */
701       /* 1.3. Update phi in successor block.  */
709       /* 2.1. Generate new phi node in NEW_EXIT_BB:  */
716       /* 2.3. Update phi in successor of NEW_EXIT_BB:  */
723       /* 3.1. Find the relevant names that need an exit-phi in
726 	 phi node. This is the case for names that are used outside
727 	 the loop (and therefore need an exit phi) but are not updated
729 	 loop-header-phi).
733 	 loop-header-phi.  When such a phi is created we also record
737 	 is an indication that an exit-phi in GUARD_BB was not yet
743       /* 3.2. Generate new phi node in GUARD_BB:  */
751       /* 3.4. Update phi in successor of GUARD_BB:  */
836   tree phi, phi_arg;
870   /* Duplicating phi args at exit bbs as coming
872   for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi))
874       phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, loop->single_exit);
884 	  add_phi_arg (phi, phi_arg, new_loop_exit_edge);
911       /* We have to add phi args to the loop->header here as coming
913       for (phi = phi_nodes (loop->header); phi; phi = PHI_CHAIN (phi))
915 	  phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, entry_e);
917 	    add_phi_arg (phi, phi_arg, new_exit_e);
1401       tree phi;
1403       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1405           stmt_ann_t ann = get_stmt_ann (phi);
1406           set_stmt_info (ann, new_stmt_vec_info (phi, res));
1461       tree phi;
1464       for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1466           stmt_ann_t ann = stmt_ann (phi);
1468           stmt_info = vinfo_for_stmt (phi);
1799      a1 = phi < a0, a2 >
1813 vect_is_simple_reduction (struct loop *loop, tree phi)
1816   tree loop_arg = PHI_ARG_DEF_FROM_EDGE (phi, latch_e);
1942       && def2 == phi)
1953       && def1 == phi)