| /external/llvm/lib/Transforms/Utils/ |
| UnifyFunctionExitNodes.cpp | 93 PHINode *PN = nullptr;
98 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
100 NewRetBlock->getInstList().push_back(PN);
101 ReturnInst::Create(F.getContext(), PN, NewRetBlock);
113 if (PN)
114 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
|
| LoopVersioning.cpp | 125 PHINode *PN;
129 for (auto I = PHIBlock->begin(); (PN = dyn_cast<PHINode>(I)); ++I) {
130 assert(PN->getNumOperands() == 1 &&
132 if (PN->getIncomingValue(0) == Inst)
136 if (!PN) {
137 PN = PHINode::Create(Inst->getType(), 2, Inst->getName() + ".lver",
141 User->replaceUsesOfWith(Inst, PN);
142 PN->addIncoming(Inst, VersionedLoop->getExitingBlock());
145 PN->addIncoming(NonVersionedLoopInst, NonVersionedLoop->getExitingBlock());
|
| BreakCriticalEdges.cpp | 93 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
94 unsigned Idx = PN->getBasicBlockIndex(SplitBB);
95 Value *V = PN->getIncomingValue(Idx);
105 PN->getType(), Preds.size(), "split",
111 PN->setIncomingValue(Idx, NewPN);
170 PHINode *PN = cast<PHINode>(I);
177 if (PN->getIncomingBlock(BBIdx) != TIBB)
178 BBIdx = PN->getBasicBlockIndex(TIBB);
179 PN->setIncomingBlock(BBIdx, NewBB);
213 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
[all...] |
| LCSSA.cpp | 81 if (PHINode *PN = dyn_cast<PHINode>(User))
82 UserBB = PN->getIncomingBlock(U);
120 PHINode *PN = PHINode::Create(Inst.getType(), PredCache.size(ExitBB),
125 PN->addIncoming(&Inst, Pred);
132 &PN->getOperandUse(PN->getOperandNumForIncomingValue(
133 PN->getNumIncomingValues() - 1)));
136 AddedPHIs.push_back(PN);
139 SSAUpdate.AddAvailableValue(ExitBB, PN);
151 PostProcessPHIs.push_back(PN);
[all...] |
| LoopUnroll.cpp | 58 if (PHINode *PN = dyn_cast<PHINode>(I)) {
59 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
60 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i));
62 PN->setIncomingBlock(i, cast<BasicBlock>(It->second));
401 PHINode *PN = OrigPHINode[i];
403 PN->replaceAllUsesWith(PN->getIncomingValueForBlock(Preheader));
404 Header->getInstList().erase(PN);
407 Value *InVal = PN->removeIncomingValue(LatchBlock, false);
415 PN->addIncoming(InVal, Latches.back())
[all...] |
| BasicBlockUtils.cpp | 72 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
73 if (PN->getIncomingValue(0) != PN)
74 PN->replaceAllUsesWith(PN->getIncomingValue(0));
76 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
79 MemDep->removeInstruction(PN); // Memdep updates AA itself.
81 PN->eraseFromParent();
95 PHINode *PN = dyn_cast<PHINode>(I); ++I
[all...] |
| CloneFunction.cpp | 547 if (const PHINode *PN = dyn_cast<PHINode>(I)) {
548 if (isa<PHINode>(VMap[PN]))
549 PHIToResolve.push_back(PN);
577 PHINode *PN = cast<PHINode>(VMap[OPN]);
579 Value *V = VMap[PN->getIncomingBlock(pred)];
581 Value *InVal = MapValue(PN->getIncomingValue(pred),
585 PN->setIncomingValue(pred, InVal);
586 PN->setIncomingBlock(pred, MappedBlock);
588 PN->removeIncomingValue(pred, false);
599 PHINode *PN = cast<PHINode>(NewBB->begin())
[all...] |
| CodeExtractor.cpp | 193 PHINode *PN = dyn_cast<PHINode>(Header->begin());
194 if (!PN) return; // No PHI nodes.
199 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
200 if (Blocks.count(PN->getIncomingBlock(i)))
233 PHINode *PN = cast<PHINode>(OldPred->begin());
236 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
237 if (Blocks.count(PN->getIncomingBlock(i))) {
238 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
245 PHINode *PN = cast<PHINode>(AfterPHIs);
247 // from OldPred of PN
[all...] |
| LoopSimplify.cpp | 210 PHINode *PN = cast<PHINode>(I);
212 if (Value *V = SimplifyInstruction(PN, DL, nullptr, DT, AC)) {
214 PN->replaceAllUsesWith(V);
215 PN->eraseFromParent();
220 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
221 if (PN->getIncomingValue(i) == PN &&
222 L->contains(PN->getIncomingBlock(i)))
224 return PN;
260 PHINode *PN = findPHIToPartitionLoops(L, DT, AC)
[all...] |
| LowerSwitch.cpp | 173 PHINode *PN = cast<PHINode>(I);
176 unsigned Idx = 0, E = PN->getNumIncomingValues();
179 if (PN->getIncomingBlock(Idx) == OrigBB) {
180 PN->setIncomingBlock(Idx, NewBB);
189 if (PN->getIncomingBlock(Idx) == OrigBB) {
196 PN->removeIncomingValue(*III);
344 PHINode* PN = cast<PHINode>(I);
349 PN->removeIncomingValue(OrigBlock);
352 int BlockIdx = PN->getBasicBlockIndex(OrigBlock);
354 PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf)
[all...] |
| PromoteMemoryToRegister.cpp | 693 PHINode *PN = I->second;
696 if (Value *V = SimplifyInstruction(PN, DL, nullptr, &DT, AC)) {
697 if (AST && PN->getType()->isPointerTy())
698 AST->deleteValue(PN);
699 PN->replaceAllUsesWith(V);
700 PN->eraseFromParent();
852 PHINode *&PN = NewPhiNodes[std::make_pair(BBNumbers[BB], AllocaNo)];
855 if (PN)
860 PN = PHINode::Create(Allocas[AllocaNo]->getAllocatedType(), getNumPreds(BB),
864 PhiToAllocaMap[PN] = AllocaNo
[all...] |
| /external/llvm/lib/IR/ |
| Dominators.cpp | 201 PHINode *PN = dyn_cast<PHINode>(UserInst);
202 if (PN && PN->getParent() == BBE.getEnd() &&
203 PN->getIncomingBlock(U) == BBE.getStart())
209 if (PN)
210 UseBB = PN->getIncomingBlock(U);
224 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
225 UseBB = PN->getIncomingBlock(U);
275 if (PHINode *PN = dyn_cast<PHINode>(I))
276 return isReachableFromEntry(PN->getIncomingBlock(U))
[all...] |
| BasicBlock.cpp | 300 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
302 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
306 if (PN->getIncomingValue(0) != PN)
307 PN->replaceAllUsesWith(PN->getIncomingValue(0));
310 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
320 PHINode *PN;
321 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); )
[all...] |
| Instruction.cpp | 399 const PHINode *PN = dyn_cast<PHINode>(I);
400 if (!PN) {
406 if (PN->getIncomingBlock(U) != BB)
|
| Value.cpp | 522 PHINode *PN = dyn_cast<PHINode>(this);
523 if (PN && PN->getParent() == CurBB)
524 return PN->getIncomingValueForBlock(PredBB);
|
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 232 PHINode *PN = PHINode::Create(Type::getInt8PtrTy(Ctx), ResumesLeft,
242 PN->addIncoming(ExnObj, Parent);
248 CallInst *CI = CallInst::Create(RewindFunction, PN, "", UnwindBB);
|
| SjLjEHPrepare.cpp | 316 PHINode *PN = cast<PHINode>(U);
317 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
318 if (PN->getIncomingValue(i) == Inst)
319 MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
354 for (BasicBlock::iterator PN = UnwindBlock->begin(); isa<PHINode>(PN); ++PN)
355 PHIsToDemote.insert(cast<PHINode>(PN));
360 for (PHINode *PN : PHIsToDemote)
361 DemotePHIToStack(PN);
[all...] |
| /frameworks/base/core/java/android/content/ |
| ComponentName.java | 156 int PN = mPackage.length();
158 if (CN > PN && mClass.charAt(PN) == '.') {
159 return mClass.substring(PN, CN);
168 int PN = packageName.length();
170 if (CN > PN && className.charAt(PN) == '.') {
171 sb.append(className, PN, CN);
181 int PN = packageName.length();
183 if (CN > PN && className.charAt(PN) == '.')
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineShifts.cpp | 177 PHINode *PN = cast<PHINode>(I);
178 for (Value *IncValue : PN->incoming_values())
180 IC, PN))
310 PHINode *PN = cast<PHINode>(I);
311 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
312 PN->setIncomingValue(i, GetShiftedValue(PN->getIncomingValue(i), NumBits,
314 return PN;
[all...] |
| InstCombineLoadStoreAlloca.cpp | 603 if (PHINode *PN = dyn_cast<PHINode>(P)) {
604 for (Value *IncValue : PN->incoming_values())
[all...] |
| InstCombinePHI.cpp | 25 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
26 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
45 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
46 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
84 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
85 FirstInst->getOperand(0)->getName() + ".pn");
86 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
87 InsertNewInstBefore(NewLHS, PN);
92 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
93 FirstInst->getOperand(1)->getName() + ".pn");
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LICM.cpp | 97 PHINode &PN,
525 static bool isTriviallyReplacablePHI(const PHINode &PN, const Instruction &I) {
526 for (const Value *IncValue : PN.incoming_values())
540 if (const PHINode *PN = dyn_cast<PHINode>(UI)) {
545 if (isTriviallyReplacablePHI(*PN, I)) {
546 if (CurLoop->contains(PN))
554 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
555 if (PN->getIncomingValue(i) == &I)
556 if (CurLoop->contains(PN->getIncomingBlock(i)))
570 PHINode &PN,
[all...] |
| TailRecursionElimination.cpp | 429 PHINode *PN = ArgumentPHIs[i];
432 if (Value *PNV = SimplifyInstruction(PN, F.getParent()->getDataLayout())) {
433 PN->replaceAllUsesWith(PNV);
434 PN->eraseFromParent();
713 PHINode *PN = PHINode::Create(I->getType(), 2,
715 I->replaceAllUsesWith(PN); // Everyone use the PHI node now!
716 PN->addIncoming(&*I, NewEntry);
717 ArgumentPHIs.push_back(PN);
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 641 PHINode *PN =
644 PN->addIncoming(ThenV, ThenBB);
645 PN->addIncoming(ElseV, ElseBB);
646 return PN;
|
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 752 PHINode *PN =
755 PN->addIncoming(ThenV, ThenBB);
756 PN->addIncoming(ElseV, ElseBB);
757 return PN;
|
