| /external/llvm/lib/Transforms/Utils/ |
| UnifyFunctionExitNodes.cpp | 94 PHINode *PN = 0;
99 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
101 NewRetBlock->getInstList().push_back(PN);
102 ReturnInst::Create(F.getContext(), PN, NewRetBlock);
114 if (PN)
115 PN->addIncoming(BB->getTerminator()->getOperand(0), BB);
|
| BreakCriticalEdges.cpp | 134 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
135 unsigned Idx = PN->getBasicBlockIndex(SplitBB);
136 Value *V = PN->getIncomingValue(Idx);
146 PHINode::Create(PN->getType(), Preds.size(), "split",
153 PN->setIncomingValue(Idx, NewPN);
213 PHINode *PN = cast<PHINode>(I);
220 if (PN->getIncomingBlock(BBIdx) != TIBB)
221 BBIdx = PN->getBasicBlockIndex(TIBB);
222 PN->setIncomingBlock(BBIdx, NewBB);
263 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
[all...] |
| LCSSA.cpp | 198 if (PHINode *PN = dyn_cast<PHINode>(U))
199 UserBB = PN->getIncomingBlock(UI);
235 PHINode *PN = PHINode::Create(Inst->getType(),
242 PN->addIncoming(Inst, *PI);
249 &PN->getOperandUse(
250 PN->getOperandNumForIncomingValue(PN->getNumIncomingValues()-1)));
253 AddedPHIs.push_back(PN);
256 SSAUpdate.AddAvailableValue(ExitBB, PN);
268 if (PHINode *PN = dyn_cast<PHINode>(User)
[all...] |
| LoopUnroll.cpp | 50 if (PHINode *PN = dyn_cast<PHINode>(I)) {
51 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
52 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i));
54 PN->setIncomingBlock(i, cast<BasicBlock>(It->second));
332 PHINode *PN = OrigPHINode[i];
334 PN->replaceAllUsesWith(PN->getIncomingValueForBlock(Preheader));
335 Header->getInstList().erase(PN);
338 Value *InVal = PN->removeIncomingValue(LatchBlock, false);
346 PN->addIncoming(InVal, Latches.back())
[all...] |
| CloneFunction.cpp | 410 if (const PHINode *PN = dyn_cast<PHINode>(I))
411 PHIToResolve.push_back(PN);
434 PHINode *PN = cast<PHINode>(VMap[OPN]);
436 Value *V = VMap[PN->getIncomingBlock(pred)];
438 Value *InVal = MapValue(PN->getIncomingValue(pred),
442 PN->setIncomingValue(pred, InVal);
443 PN->setIncomingBlock(pred, MappedBlock);
445 PN->removeIncomingValue(pred, false);
456 PHINode *PN = cast<PHINode>(NewBB->begin());
458 if (NumPreds != PN->getNumIncomingValues())
[all...] |
| LowerSwitch.cpp | 207 PHINode* PN = cast<PHINode>(I);
212 PN->removeIncomingValue(OrigBlock);
215 int BlockIdx = PN->getBasicBlockIndex(OrigBlock);
217 PN->setIncomingBlock((unsigned)BlockIdx, NewLeaf);
282 PHINode *PN = cast<PHINode>(I);
283 int BlockIdx = PN->getBasicBlockIndex(OrigBlock);
285 PN->setIncomingBlock((unsigned)BlockIdx, NewDefault);
|
| BasicBlockUtils.cpp | 77 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
78 if (PN->getIncomingValue(0) != PN)
79 PN->replaceAllUsesWith(PN->getIncomingValue(0));
81 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
84 MemDep->removeInstruction(PN); // Memdep updates AA itself.
85 else if (AA && isa<PointerType>(PN->getType()))
86 AA->deleteValue(PN);
[all...] |
| CodeExtractor.cpp | 192 PHINode *PN = dyn_cast<PHINode>(Header->begin());
193 if (!PN) return; // No PHI nodes.
198 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
199 if (Blocks.count(PN->getIncomingBlock(i)))
232 PHINode *PN = cast<PHINode>(OldPred->begin());
235 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
236 if (Blocks.count(PN->getIncomingBlock(i))) {
237 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
244 PHINode *PN = cast<PHINode>(AfterPHIs);
246 // from OldPred of PN
[all...] |
| Local.cpp | 376 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN,
379 for (Instruction *I = PN; areAllUsesEqual(I) && !I->mayHaveSideEffects();
460 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
464 if (!recursivelySimplifyInstruction(PN, TD))
482 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
483 Value *NewVal = PN->getIncomingValue(0);
485 if (NewVal == PN) NewVal = UndefValue::get(PN->getType());
486 PN->replaceAllUsesWith(NewVal);
487 PN->eraseFromParent()
[all...] |
| LoopSimplify.cpp | 273 PHINode *PN;
275 (PN = dyn_cast<PHINode>(I++)); )
276 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
277 if (AA) AA->deleteValue(PN);
278 if (SE) SE->forgetValue(PN);
279 PN->replaceAllUsesWith(V);
280 PN->eraseFromParent();
471 PHINode *PN = cast<PHINode>(I);
473 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
475 PN->replaceAllUsesWith(V)
[all...] |
| LowerInvoke.cpp | 213 while (PHINode *PN = dyn_cast<PHINode>(II->getUnwindDest()->begin())) {
214 PN->replaceAllUsesWith(PN->getIncomingValue(0));
215 PN->eraseFromParent();
365 PHINode *PN = cast<PHINode>(U);
366 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
367 if (PN->getIncomingValue(i) == Inst)
368 MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 222 PHINode *PN = dyn_cast<PHINode>(UserInst);
223 if (PN && PN->getParent() == BBE.getEnd() &&
224 PN->getIncomingBlock(U) == BBE.getStart())
230 if (PN)
231 UseBB = PN->getIncomingBlock(U);
246 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
247 UseBB = PN->getIncomingBlock(U);
297 if (PHINode *PN = dyn_cast<PHINode>(I))
298 return isReachableFromEntry(PN->getIncomingBlock(U))
[all...] |
| BasicBlock.cpp | 250 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
252 PN->removeIncomingValue(Pred, !DontDeleteUselessPHIs);
256 if (PN->getIncomingValue(0) != PN)
257 PN->replaceAllUsesWith(PN->getIncomingValue(0));
260 PN->replaceAllUsesWith(UndefValue::get(PN->getType()));
270 PHINode *PN;
271 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); )
[all...] |
| Instruction.cpp | 405 const PHINode *PN = dyn_cast<PHINode>(U);
406 if (PN == 0) {
412 if (PN->getIncomingBlock(UI) != BB)
|
| Value.cpp | 469 PHINode *PN = dyn_cast<PHINode>(this);
470 if (PN && PN->getParent() == CurBB)
471 return PN->getIncomingValueForBlock(PredBB);
|
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 154 PHINode *PN = PHINode::Create(Type::getInt8PtrTy(Ctx), ResumesSize,
166 PN->addIncoming(ExnObj, Parent);
172 CallInst *CI = CallInst::Create(RewindFunction, PN, "", UnwindBB);
|
| SjLjEHPrepare.cpp | 325 PHINode *PN = cast<PHINode>(U);
326 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
327 if (PN->getIncomingValue(i) == Inst)
328 MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
364 PN = UnwindBlock->begin(); isa<PHINode>(PN); ++PN)
365 PHIsToDemote.insert(cast<PHINode>(PN));
|
| /frameworks/base/core/java/android/content/ |
| ComponentName.java | 103 int PN = mPackage.length();
105 if (CN > PN && mClass.charAt(PN) == '.') {
106 return mClass.substring(PN, CN);
|
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 160 PHINode *PN = cast<PHINode>(I);
162 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
165 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
167 Inc->getOperand(0) == PN)
170 return PN;
|
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 522 PHINode *PN = cast<PHINode>(RVI);
523 for (int i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
524 FlowsToReturn.insert(PN->getIncomingValue(i));
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 788 PHINode *PN = PHINode::Create(MergedVal->getType(), 2, "storemerge");
789 PN->addIncoming(SI.getOperand(0), SI.getParent());
790 PN->addIncoming(OtherStore->getOperand(0), OtherBB);
791 MergedVal = InsertNewInstBefore(PN, DestBB->front());
|
| InstCombineShifts.cpp | 172 PHINode *PN = cast<PHINode>(I);
173 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
174 if (!CanEvaluateShifted(PN->getIncomingValue(i), NumBits, isLeftShift,IC))
301 PHINode *PN = cast<PHINode>(I);
302 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
303 PN->setIncomingValue(i, GetShiftedValue(PN->getIncomingValue(i),
305 return PN;
|
| InstCombinePHI.cpp | 24 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
25 Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0));
44 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
45 Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i));
83 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
84 FirstInst->getOperand(0)->getName() + ".pn");
85 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
86 InsertNewInstBefore(NewLHS, PN);
91 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
92 FirstInst->getOperand(1)->getName() + ".pn");
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| TailRecursionElimination.cpp | 216 PHINode *PN = ArgumentPHIs[i];
219 if (Value *PNV = SimplifyInstruction(PN)) {
220 PN->replaceAllUsesWith(PNV);
221 PN->eraseFromParent();
514 PHINode *PN = PHINode::Create(I->getType(), 2,
516 I->replaceAllUsesWith(PN); // Everyone use the PHI node now!
517 PN->addIncoming(I, NewEntry);
518 ArgumentPHIs.push_back(PN);
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 553 PHINode *PN = Builder.CreatePHI(Type::getDoubleTy(getGlobalContext()), 2,
556 PN->addIncoming(ThenV, ThenBB);
557 PN->addIncoming(ElseV, ElseBB);
558 return PN;
|
