contrib/gcc/tree-tailcall.c

362   tree phi;
364   for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi))
365     if (PHI_ARG_DEF_FROM_EDGE (phi, e) == var)
366       return PHI_RESULT (phi);
452 	      /* The parameter should be a real operand, so that phi node
544    the phi nodes on edge BACK.  */
549   tree stmt, var, phi, tmp;
595       for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi))
596 	if (PHI_RESULT (phi) == a_acc)
599       add_phi_arg (phi, a_acc_arg, back);
604       for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi))
605 	if (PHI_RESULT (phi) == m_acc)
608       add_phi_arg (phi, m_acc_arg, back);
721   tree phi;
770   /* Add phi node entries for arguments.  The ordering of the phi nodes should
774        phi = phi_nodes (first);
781       gcc_assert (param == SSA_NAME_VAR (PHI_RESULT (phi)));
783       add_phi_arg (phi, TREE_VALUE (args), e);
784       phi = PHI_CHAIN (phi);
804 /* Add phi nodes for the virtual operands defined in the function to the
807    Originally, we used to add phi nodes only for call clobbered variables,
812    which requires adding phi nodes.
821      to put into phi nodes (there in fact does not have to be such
876   tree stmt, param, ret_type, tmp, phi;
895   /* Construct the phi nodes and accumulators if necessary.  */
916 		tree phi;
919 		phi = create_phi_node (name, first);
920 		SSA_NAME_DEF_STMT (name) = phi;
921 		add_phi_arg (phi, new_name, single_pred_edge (first));
933 	  phi = create_phi_node (tmp, first);
934 	  add_phi_arg (phi,
939 	  a_acc = PHI_RESULT (phi);
949 	  phi = create_phi_node (tmp, first);
950 	  add_phi_arg (phi,
955 	  m_acc = PHI_RESULT (phi);
962       /* Reverse the order of the phi nodes, so that it matches the order