Searched defs:Phi (Results 1 - 25 of 26) sorted by relevance

12

/external/llvm/lib/Transforms/Scalar/
H A DPartiallyInlineLibCalls.cpp133 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2); local
134 Call->replaceAllUsesWith(Phi);
154 Phi->addIncoming(Call, &CurrBB);
155 Phi->addIncoming(LibCall, LibCallBB);
H A DLoopIdiomRecognize.cpp845 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0)); local
846 if (!Phi || Phi->getParent() != LoopEntry)
860 CountPhi = Phi;
H A DStructurizeCFG.cpp564 PHINode &Phi = cast<PHINode>(*I++); local
565 while (Phi.getBasicBlockIndex(From) != -1) {
566 Value *Deleted = Phi.removeIncomingValue(From, false);
567 Map[&Phi].push_back(std::make_pair(From, Deleted));
577 PHINode &Phi = cast<PHINode>(*I++); local
578 Value *Undef = UndefValue::get(Phi.getType());
579 Phi.addIncoming(Undef, From);
600 PHINode *Phi = PI->first; local
601 Value *Undef = UndefValue::get(Phi->getType());
602 Updater.Initialize(Phi
[all...]
H A DIndVarSimplify.cpp639 // Do not count the Phi as a use. LCSSA may have inserted
681 for (const RewritePhi &Phi : RewritePhiSet) {
682 PHINode *PN = Phi.PN;
683 Value *ExitVal = Phi.Val;
687 if (ReplaceExitValue == OnlyCheapRepl && !LoopCanBeDel && Phi.HighCost) {
694 Instruction *Inst = cast<Instruction>(PN->getIncomingValue(Phi.Ith));
695 PN->setIncomingValue(Phi.Ith, ExitVal);
704 if (Phi.SafePhi) {
746 for (const RewritePhi &Phi : RewritePhiSet) {
747 unsigned i = Phi
1579 PHINode *Phi = dyn_cast<PHINode>(IncI->getOperand(0)); local
1634 PHINode *Phi = dyn_cast<PHINode>(LHS); local
1695 AlmostDeadIV(PHINode *Phi, BasicBlock *LatchBlock, Value *Cond) argument
1734 PHINode *Phi = cast<PHINode>(I); local
[all...]
H A DGVN.cpp2680 PHINode *Phi = local
2685 Phi->addIncoming(V, predMap[i].second);
2687 Phi->addIncoming(PREInstr, PREPred);
2690 VN.add(Phi, ValNo);
2691 addToLeaderTable(ValNo, Phi, CurrentBlock);
2692 Phi->setDebugLoc(CurInst->getDebugLoc());
2693 CurInst->replaceAllUsesWith(Phi);
2694 if (MD && Phi->getType()->getScalarType()->isPointerTy())
2695 MD->invalidateCachedPointerInfo(Phi);
2875 PHINode &Phi local
[all...]
H A DRewriteStatepointsForGC.cpp782 if (PHINode *Phi = dyn_cast<PHINode>(Current)) {
783 for (Value *InVal : Phi->incoming_values())
843 } else if (PHINode *Phi = dyn_cast<PHINode>(BDV)) {
844 for (Value *Val : Phi->incoming_values())
1851 PHINode *Phi = cast<PHINode>(Use); local
1852 for (unsigned i = 0; i < Phi->getNumIncomingValues(); i++) {
1853 if (Def == Phi->getIncomingValue(i)) {
1855 Alloca, "", Phi->getIncomingBlock(i)->getTerminator());
1856 Phi->setIncomingValue(i, Load);
2029 if (auto Phi
2732 PHINode *Phi = cast<PHINode>(&*I); local
[all...]
/external/v8/src/compiler/
H A Ddiamond.h52 Node* Phi(MachineRepresentation rep, Node* tv, Node* fv) { function in struct:v8::internal::compiler::Diamond
53 return graph->NewNode(common->Phi(rep, 2), tv, fv, merge);
H A Draw-machine-assembler.cc467 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count, function in class:v8::internal::compiler::RawMachineAssembler
473 return AddNode(common()->Phi(rep, input_count), input_count + 1, buffer);
H A Dcommon-operator.cc441 "Phi", // name
772 const Operator* CommonOperatorBuilder::Phi(MachineRepresentation rep, function in class:v8::internal::compiler::CommonOperatorBuilder
785 "Phi", // name
930 return Phi(PhiRepresentationOf(op), size);
H A Draw-machine-assembler.h719 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) { function in class:v8::internal::compiler::RawMachineAssembler
720 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
722 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) { function in class:v8::internal::compiler::RawMachineAssembler
723 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
725 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) { function in class:v8::internal::compiler::RawMachineAssembler
726 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
728 Node* Phi(MachineRepresentation rep, int input_count, Node* const* inputs);
H A Dwasm-compiler.cc218 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
221 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 1),
342 Node* WasmGraphBuilder::Phi(wasm::LocalType type, unsigned count, Node** vals, function in class:v8::internal::compiler::WasmGraphBuilder
347 return graph()->NewNode(jsgraph()->common()->Phi(type, count), count + 1,
1077 return left_le_right.Phi(
1079 right_lt_left.Phi(
1081 left_is_not_nan.Phi(
1097 return left_ge_right.Phi(
1099 right_gt_left.Phi(
1101 left_is_not_nan.Phi(
[all...]
/external/llvm/lib/Target/AMDGPU/
H A DSIAnnotateControlFlow.cpp78 bool isElse(PHINode *Phi);
80 void eraseIfUnused(PHINode *Phi);
172 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { argument
173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
174 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
175 if (Phi->getIncomingBlock(i) == IDom) {
177 if (Phi->getIncomingValue(i) != BoolTrue)
181 if (Phi->getIncomingValue(i) != BoolFalse)
189 // \brief Erase "Phi" if it is not used any more
190 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) { argument
218 PHINode *Phi = nullptr; local
346 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); local
[all...]
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp403 Instruction *InstCombiner::FoldPHIArgZextsIntoPHI(PHINode &Phi) { argument
406 if (TerminatorInst *TI = Phi.getParent()->getTerminator())
413 unsigned NumIncomingValues = Phi.getNumIncomingValues();
419 for (Value *V : Phi.incoming_values()) {
433 for (Value *V : Phi.incoming_values()) {
466 Phi.getName() + ".shrunk");
468 NewPhi->addIncoming(NewIncoming[i], Phi.getIncomingBlock(i));
470 InsertNewInstBefore(NewPhi, Phi);
471 return CastInst::CreateZExtOrBitCast(NewPhi, Phi.getType());
/external/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp70 RecurrenceDescriptor::lookThroughAnd(PHINode *Phi, Type *&RT, argument
73 if (!Phi->hasOneUse())
74 return Phi;
77 Instruction *I, *J = cast<Instruction>(Phi->use_begin()->getUser());
85 RT = IntegerType::get(Phi->getContext(), Bits);
86 Visited.insert(Phi);
91 return Phi;
155 bool RecurrenceDescriptor::AddReductionVar(PHINode *Phi, RecurrenceKind Kind, argument
158 if (Phi->getNumIncomingValues() != 2)
162 if (Phi
466 isReductionPHI(PHINode *Phi, Loop *TheLoop, RecurrenceDescriptor &RedDes) argument
660 isInductionPHI(PHINode *Phi, ScalarEvolution *SE, InductionDescriptor &D) argument
[all...]
H A DSimplifyCFG.cpp3792 PHINode *Phi = I->first; local
3798 Phi->setIncomingValue(Indexes[I], SI->getCondition());
3904 if (PHINode *Phi = dyn_cast<PHINode>(User))
3905 if (Phi->getIncomingBlock(Use) == CaseDest)
/external/v8/test/cctest/compiler/
H A Dtest-osr.cc94 return graph.NewNode(common.Phi(MachineRepresentation::kTagged, count),
316 Node* Phi(Node* i1, Node* i2, Node* i3) { function in struct:v8::internal::compiler::While
318 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2),
321 return t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 3),
344 Node* outer_phi = outer.Phi(T.p0, T.p0, nullptr);
347 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
403 Node* outer_phi = outer.Phi(T.p0, T.p0, T.p0);
406 Node* osr_phi = inner.Phi(T.jsgraph.TrueConstant(), T.osr_values[0],
479 jsgraph->common()->Phi(MachineRepresentation::kWord32, count), count + 1,
501 T.graph.NewNode(T.common.Phi(MachineRepresentatio
[all...]
H A Dtest-loop-analysis.cc74 Node* Phi(Node* a) { function in class:v8::internal::compiler::LoopFinderTester
78 Node* Phi(Node* a, Node* b) { function in class:v8::internal::compiler::LoopFinderTester
82 Node* Phi(Node* a, Node* b, Node* c) { function in class:v8::internal::compiler::LoopFinderTester
86 Node* Phi(Node* a, Node* b, Node* c, Node* d) { function in class:v8::internal::compiler::LoopFinderTester
115 : common.Phi(MachineRepresentation::kTagged, count);
270 Node* phi = t.graph.NewNode(t.common.Phi(MachineRepresentation::kTagged, 2),
479 const Operator* op = t.common.Phi(MachineRepresentation::kWord32, 2);
693 t.common.Phi(MachineRepresentation::kWord32, 2), t.one, p1, loop);
729 t.common.Phi(MachineRepresentation::kWord32, 2), t.one, p1, loop1);
738 t.common.Phi(MachineRepresentatio
[all...]
/external/v8/test/unittests/compiler/
H A Dinstruction-sequence-unittest.cc164 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0, function in class:v8::internal::compiler::InstructionSequenceTest
184 PhiInstruction* InstructionSequenceTest::Phi(VReg incoming_vreg_0, function in class:v8::internal::compiler::InstructionSequenceTest
/external/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp926 // Check that the chain of IV operands leading back to Phi can be hoisted.
1008 const SCEVAddRecExpr *Phi,
1011 Type *PhiTy = SE.getEffectiveSCEVType(Phi->getType());
1018 Phi = dyn_cast<SCEVAddRecExpr>(SE.getTruncateOrNoop(Phi, RequestedTy));
1019 if (!Phi)
1023 if (Phi == Requested) {
1030 SE.getNegativeSCEV(Requested)) == Phi) {
1714 for (PHINode *Phi : Phis) {
1728 if (Value *V = SimplifyPHINode(Phi)) {
1007 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp215 /// \brief Return true if the Phi may generate a value that may underflow,
217 bool phiMayWrapOrUnderflow(MachineInstr *Phi, const MachineOperand *EndVal,
407 MachineInstr *Phi = &*I; local
412 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) {
413 if (Phi->getOperand(i+1).getMBB() != Latch)
416 unsigned PhiOpReg = Phi->getOperand(i).getReg();
427 if (MRI->getVRegDef(IndReg) == Phi && checkForImmediate(Opnd2, V)) {
1345 /// Return true if a Phi may generate a value that can underflow.
1346 /// This function calls loopCountMayWrapOrUnderFlow for each Phi operand.
1348 MachineInstr *Phi, cons
1347 phiMayWrapOrUnderflow( MachineInstr *Phi, const MachineOperand *EndVal, MachineBasicBlock *MBB, MachineLoop *L, LoopFeederMap &LoopFeederPhi) const argument
1590 MachineInstr *Phi = &*I; local
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h1295 /// Phi Node, for code in SSA form.
1296 /// Each Phi node has an array of possible values that it can take,
1298 class Phi : public SExpr { class in namespace:clang::threadSafety
1302 // In minimal SSA form, all Phi nodes are MultiVal.
1303 // During conversion to SSA, incomplete Phi nodes may be introduced, which
1306 PH_MultiVal = 0, // Phi node has multiple distinct values. (Normal)
1307 PH_SingleVal, // Phi node has one distinct value, and can be eliminated
1308 PH_Incomplete // Phi node is incomplete
1313 Phi() function in class:clang::threadSafety::Phi
1315 Phi(MemRegionRe function in class:clang::threadSafety::Phi
1317 Phi(const Phi &P, ValArray &&Vs) function in class:clang::threadSafety::Phi
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DDataFlowSanitizer.cpp1009 PHINode *Phi = PHINode::Create(DFS.ShadowTy, 2, "", &Tail->front()); local
1010 Phi->addIncoming(Call, Call->getParent());
1011 Phi->addIncoming(V1, Head);
1014 CCS.Shadow = Phi;
/external/clang/lib/CodeGen/
H A DMicrosoftCXXABI.cpp2919 llvm::PHINode *Phi = Builder.CreatePHI(CGM.Int8PtrTy, 2, "memptr.base"); local
2920 Phi->addIncoming(Base.getPointer(), OriginalBB);
2921 Phi->addIncoming(AdjustedBase, VBaseAdjustBB);
2922 return Phi;
3031 llvm::PHINode *Phi = Builder.CreatePHI(DstNull->getType(), 2, "memptr.converted"); local
3032 Phi->addIncoming(DstNull, OriginalBB);
3033 Phi->addIncoming(Dst, ConvertBB);
3034 return Phi;
/external/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp1201 PHINode *Phi = nullptr; local
1214 Phi = Builder.CreatePHI(VecType, 2, "res.phi.else");
1215 Phi->addIncoming(VResult, CondBlock);
1216 Phi->addIncoming(PrevPhi, PrevIfBlock);
1217 PrevPhi = Phi;
1218 VResult = Phi;
1250 Phi = Builder.CreatePHI(VecType, 2, "res.phi.select");
1251 Phi->addIncoming(VResult, CondBlock);
1252 Phi->addIncoming(PrevPhi, PrevIfBlock);
1253 Value *NewI = Builder.CreateSelect(Mask, Phi, Src
1452 PHINode *Phi = nullptr; local
[all...]
/external/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1995 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr);
1996 if (Phi && Inductions.count(Phi)) {
1997 InductionDescriptor II = Inductions[Phi];
2009 Phi = dyn_cast<PHINode>(GpPtr);
2010 if (Phi && Inductions.count(Phi)) {
2022 InductionDescriptor II = Inductions[Phi];
3267 // Phi nodes. Phi node
3990 PHINode *Phi = dyn_cast<PHINode>(I); local
[all...]

Completed in 5027 milliseconds

12