/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 1352 class Phi : public SExpr { class in namespace:clang::threadSafety 1357 // In minimal SSA form, all Phi nodes are MultiVal. 1358 // During conversion to SSA, incomplete Phi nodes may be introduced, which 1361 PH_MultiVal = 0, // Phi node has multiple distinct values. (Normal) 1362 PH_SingleVal, // Phi node has one distinct value, and can be eliminated 1363 PH_Incomplete // Phi node is incomplete 1368 Phi() : SExpr(COP_Phi) {} function in class:clang::threadSafety::Phi 1369 Phi(MemRegionRef A, unsigned Nvals) : SExpr(COP_Phi), Values(A, Nvals) {} function in class:clang::threadSafety::Phi 1370 Phi(const Phi function in class:clang::threadSafety::Phi [all...] |
/external/clang/lib/CodeGen/ |
H A D | MicrosoftCXXABI.cpp | 2194 llvm::PHINode *Phi = Builder.CreatePHI(CGM.Int8PtrTy, 2, "memptr.base"); local 2195 Phi->addIncoming(Base, OriginalBB); 2196 Phi->addIncoming(AdjustedBase, VBaseAdjustBB); 2197 return Phi; 2359 llvm::PHINode *Phi = Builder.CreatePHI(DstNull->getType(), 2, "memptr.converted"); local 2360 Phi->addIncoming(DstNull, OriginalBB); 2361 Phi->addIncoming(Dst, ConvertBB); 2362 return Phi;
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 953 // Check that the chain of IV operands leading back to Phi can be hoisted. 1036 const SCEVAddRecExpr *Phi, 1039 Type *PhiTy = SE.getEffectiveSCEVType(Phi->getType()); 1046 Phi = dyn_cast<SCEVAddRecExpr>(SE.getTruncateOrNoop(Phi, RequestedTy)); 1047 if (!Phi) 1051 if (Phi == Requested) { 1058 SE.getNegativeSCEV(Requested)) == Phi) { 1688 PHINode *Phi = dyn_cast<PHINode>(I); ++I) { 1689 Phis.push_back(Phi); 1035 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument 1706 PHINode *Phi = *PIter; local [all...] |
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonHardwareLoops.cpp | 345 MachineInstr *Phi = &*I; local 350 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) { 351 if (Phi->getOperand(i+1).getMBB() != Latch) 354 unsigned PhiOpReg = Phi->getOperand(i).getReg(); 363 if (MRI->getVRegDef(IndReg) == Phi) { 1267 MachineInstr *Phi = &*I; local 1270 for (unsigned i = 1, n = Phi->getNumOperands(); i < n; i += 2) { 1271 if (Phi->getOperand(i+1).getMBB() != Latch) 1274 unsigned PhiReg = Phi->getOperand(i).getReg(); 1283 if (MRI->getVRegDef(IndReg) == Phi) { [all...] |
/external/llvm/lib/Target/R600/ |
H A D | SIAnnotateControlFlow.cpp | 75 bool isElse(PHINode *Phi); 77 void eraseIfUnused(PHINode *Phi); 168 bool SIAnnotateControlFlow::isElse(PHINode *Phi) { argument 169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 170 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) { 171 if (Phi->getIncomingBlock(i) == IDom) { 173 if (Phi->getIncomingValue(i) != BoolTrue) 177 if (Phi->getIncomingValue(i) != BoolFalse) 185 // \brief Erase "Phi" if it is not used any more 186 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) { argument 311 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition()); local [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | AddressSanitizer.cpp | 1633 PHINode *Phi = IRB.CreatePHI(IntptrTy, 2); local 1634 Phi->addIncoming(OrigStackBase, CmpBlock); 1635 Phi->addIncoming(LocalStackBase, SetBlock); 1636 LocalStackBase = Phi;
|
H A D | DataFlowSanitizer.cpp | 896 PHINode *Phi = PHINode::Create(ShadowTy, 2, "", Tail->begin()); local 897 Phi->addIncoming(Call, Call->getParent()); 898 Phi->addIncoming(V1, Head); 899 return Phi;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | GVN.cpp | 2572 PHINode* Phi = PHINode::Create(CurInst->getType(), predMap.size(), local 2577 Phi->addIncoming(V, predMap[i].second); 2579 Phi->addIncoming(PREInstr, PREPred); 2582 VN.add(Phi, ValNo); 2583 addToLeaderTable(ValNo, Phi, CurrentBlock); 2584 Phi->setDebugLoc(CurInst->getDebugLoc()); 2585 CurInst->replaceAllUsesWith(Phi); 2586 if (Phi->getType()->getScalarType()->isPointerTy()) { 2590 for (unsigned ii = 0, ee = Phi->getNumIncomingValues(); ii != ee; 2593 VN.getAliasAnalysis()->addEscapingUse(Phi 2764 PHINode &Phi = cast<PHINode>(*II); local [all...] |
H A D | IndVarSimplify.cpp | 577 // Do not count the Phi as a use. LCSSA may have inserted 745 assert(L->getHeader() == OrigPhi->getParent() && "Phi must be an IV"); 1301 PHINode *Phi = dyn_cast<PHINode>(IncI->getOperand(0)); local 1302 if (Phi && Phi->getParent() == L->getHeader()) { 1304 return Phi; 1311 Phi = dyn_cast<PHINode>(IncI->getOperand(1)); 1312 if (Phi && Phi->getParent() == L->getHeader()) { 1314 return Phi; 1356 PHINode *Phi = dyn_cast<PHINode>(LHS); local 1417 AlmostDeadIV(PHINode *Phi, BasicBlock *LatchBlock, Value *Cond) argument 1457 PHINode *Phi = cast<PHINode>(I); local [all...] |
H A D | LoopIdiomRecognize.cpp | 454 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0)); local 455 if (!Phi || Phi->getParent() != LoopEntry) 468 CountPhi = Phi;
|
H A D | PartiallyInlineLibCalls.cpp | 127 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2); local 128 Call->replaceAllUsesWith(Phi); 148 Phi->addIncoming(Call, &CurrBB); 149 Phi->addIncoming(LibCall, LibCallBB);
|
H A D | StructurizeCFG.cpp | 503 PHINode &Phi = cast<PHINode>(*I++); local 504 while (Phi.getBasicBlockIndex(From) != -1) { 505 Value *Deleted = Phi.removeIncomingValue(From, false); 506 Map[&Phi].push_back(std::make_pair(From, Deleted)); 516 PHINode &Phi = cast<PHINode>(*I++); local 517 Value *Undef = UndefValue::get(Phi.getType()); 518 Phi.addIncoming(Undef, From); 539 PHINode *Phi = PI->first; local 540 Value *Undef = UndefValue::get(Phi->getType()); 541 Updater.Initialize(Phi [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 3317 PHINode *Phi = I->first; local 3323 Phi->setIncomingValue(Indexes[I], SI->getCondition());
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 751 /// Returns True, if 'Phi' is the kind of reduction variable for type 753 bool AddReductionVar(PHINode *Phi, ReductionKind Kind); 765 /// Returns the induction kind of Phi. This function may return NoInduction 767 InductionKind isInductionVariable(PHINode *Phi); 1492 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr); 1493 if (Phi && Inductions.count(Phi)) { 1494 InductionInfo II = Inductions[Phi]; 1509 Phi = dyn_cast<PHINode>(GpPtr); 1510 if (Phi 3298 PHINode *Phi = dyn_cast<PHINode>(I); local [all...] |
H A D | SLPVectorizer.cpp | 2623 bool matchAssociativeReduction(PHINode *Phi, BinaryOperator *B, argument 2625 assert((!Phi || 2626 std::find(Phi->op_begin(), Phi->op_end(), B) != Phi->op_end()) && 2632 if (Phi) { 2633 if (B->getOperand(0) == Phi) { 2634 Phi = nullptr; 2636 } else if (B->getOperand(1) == Phi) { 2637 Phi [all...] |