| /external/llvm/lib/Transforms/InstCombine/ |
| 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/IR/ |
| 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...] |
| 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...] |
| /external/llvm/lib/Transforms/Utils/ |
| 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...] |
| 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...] |
| 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);
|
| 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...] |
| 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...] |
| 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...] |
| 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...] |
| DemoteRegToStack.cpp | 44 if (PHINode *PN = dyn_cast<PHINode>(U)) {
55 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
56 if (PN->getIncomingValue(i) == &I) {
57 Value *&V = Loads[PN->getIncomingBlock(i)];
61 PN->getIncomingBlock(i)->getTerminator());
63 PN->setIncomingValue(i, V);
|
| LoopUnrollRuntime.cpp | 71 PHINode *PN = dyn_cast<PHINode>(BBI); ++BBI) {
75 PHINode *NewPN = PHINode::Create(PN->getType(), 2, PN->getName()+".unr",
79 if (L->contains(PN)) {
80 NewPN->addIncoming(PN->getIncomingValueForBlock(NewPH), OrigPH);
82 NewPN->addIncoming(Constant::getNullValue(PN->getType()), OrigPH);
85 Value *V = PN->getIncomingValueForBlock(Latch);
98 if (L->contains(PN)) {
99 PN->setIncomingValue(PN->getBasicBlockIndex(NewPH), NewPN)
[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...] |
| 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...] |
| SimplifyCFG.cpp | 129 PHINode *PN = cast<PHINode>(BBI);
130 if (PN->getIncomingValueForBlock(SI1BB) !=
131 PN->getIncomingValueForBlock(SI2BB))
170 PHINode *PN = cast<PHINode>(BBI);
171 if (PN->getIncomingValueForBlock(SI1BB) != Cond ||
172 !isa<ConstantInt>(PN->getIncomingValueForBlock(SI2BB)))
174 PhiNodes.push_back(PN);
187 PHINode *PN;
189 (PN = dyn_cast<PHINode>(I)); ++I)
190 PN->addIncoming(PN->getIncomingValueForBlock(ExistPred), NewPred)
[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);
|
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 229 void SparseSolver::visitPHINode(PHINode &PN) {
233 if (LatticeFunc->IsSpecialCasedPHI(&PN)) {
234 LatticeVal IV = LatticeFunc->ComputeInstructionState(PN, *this);
236 UpdateState(PN, IV);
240 LatticeVal PNIV = getOrInitValueState(&PN);
249 if (PN.getNumIncomingValues() > 64) {
250 UpdateState(PN, Overdefined);
257 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
259 if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent(), true)
[all...] |
| ScalarEvolutionNormalization.cpp | 47 PHINode *PN = dyn_cast<PHINode>(User);
48 if (!PN || !Operand) return false; // not a phi, not dominated by latch block.
53 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
54 if (PN->getIncomingValue(i) == Operand &&
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
58 // Okay, all uses of Operand by PN are in predecessor blocks that really are
|
| ScalarEvolutionExpander.cpp | [all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 150 if (const PHINode *PN = dyn_cast<PHINode>(A))
151 return relatedPHI(PN, B);
152 if (const PHINode *PN = dyn_cast<PHINode>(B))
153 return relatedPHI(PN, A);
|
| /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/CodeGen/SelectionDAG/ |
| FunctionLoweringInfo.cpp | 158 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
159 if (PN->use_empty()) continue;
162 if (PN->getType()->isEmptyTy())
165 DebugLoc DL = PN->getDebugLoc();
166 unsigned PHIReg = ValueMap[PN];
170 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
264 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
265 Type *Ty = PN->getType();
275 if (TLI.getNumRegisters(PN->getContext(), IntVT) != 1)
277 IntVT = TLI.getTypeToTransformTo(PN->getContext(), IntVT)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 241 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
242 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
247 dyn_cast<ConstantFP>(PN->getIncomingValue(IncomingEdge));
253 // Check IV increment. Reject this PN if increment operation is not
256 dyn_cast<BinaryOperator>(PN->getIncomingValue(BackEdge));
263 if (IncValueVal == 0 || Incr->getOperand(0) != PN ||
267 // Check Incr uses. One user is PN and the other user is an exit condition
393 IntegerType *Int32Ty = Type::getInt32Ty(PN->getContext());
396 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
[all...] |
| LoopRotation.cpp | 106 for (I = OrigHeader->begin(); PHINode *PN = dyn_cast<PHINode>(I); ++I)
107 PN->removeIncomingValue(PN->getBasicBlockIndex(OrigPreheader));
335 for (; PHINode *PN = dyn_cast<PHINode>(I); ++I)
336 ValueMap[PN] = PN->getIncomingValueForBlock(OrigPreheader);
388 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
389 PN->addIncoming(PN->getIncomingValueForBlock(OrigHeader), OrigPreheader);
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 188 void setChainedPhi(PHINode *PN) { ChainedPhis.insert(PN); }
257 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
259 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
266 Value *expandIVInc(PHINode *PN, Value *StepV, const Loop *L,
|
