Lines Matching defs:Phi
143 /// The condition for the optional "Else" region is expressed as a PHI node.
144 /// The incomming values of the PHI node are true for the "If" edge and false
162 /// consist of a network of PHI nodes where the true incoming values expresses
567 /// \brief Remove all PHI values coming from "From" into "To" and remember
574 PHINode &Phi = cast<PHINode>(*I++);
575 while (Phi.getBasicBlockIndex(From) != -1) {
576 Value *Deleted = Phi.removeIncomingValue(From, false);
577 Map[&Phi].push_back(std::make_pair(From, Deleted));
582 /// \brief Add a dummy PHI value as soon as we knew the new predecessor
587 PHINode &Phi = cast<PHINode>(*I++);
588 Value *Undef = UndefValue::get(Phi.getType());
589 Phi.addIncoming(Undef, From);
594 /// \brief Add the real PHI value as soon as everything is set up
608 PHINode *Phi = PI.first;
609 Value *Undef = UndefValue::get(Phi->getType());
610 Updater.Initialize(Phi->getType(), "");
627 int Idx = Phi->getBasicBlockIndex(FI);
629 Phi->setIncomingValue(Idx, Updater.GetValueAtEndOfBlock(FI));
638 /// \brief Remove phi values from all successors and then remove the terminator.
865 /// branches and PHI nodes only have undefined conditions.
