| /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/VMCore/ |
| 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 | 266 PHINode *PN;
268 (PN = dyn_cast<PHINode>(I++)); )
269 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
270 if (AA) AA->deleteValue(PN);
271 if (SE) SE->forgetValue(PN);
272 PN->replaceAllUsesWith(V);
273 PN->eraseFromParent();
464 PHINode *PN = cast<PHINode>(I);
466 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
468 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...] |
| DemoteRegToStack.cpp | 43 if (PHINode *PN = dyn_cast<PHINode>(U)) {
54 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
55 if (PN->getIncomingValue(i) == &I) {
56 Value *&V = Loads[PN->getIncomingBlock(i)];
60 PN->getIncomingBlock(i)->getTerminator());
62 PN->setIncomingValue(i, V);
|
| 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 | 188 if (PHINode *PN = dyn_cast<PHINode>(U))
189 UserBB = PN->getIncomingBlock(UI);
225 PHINode *PN = PHINode::Create(Inst->getType(),
232 PN->addIncoming(Inst, *PI);
239 &PN->getOperandUse(
240 PN->getOperandNumForIncomingValue(PN->getNumIncomingValues()-1)));
243 AddedPHIs.push_back(PN);
246 SSAUpdate.AddAvailableValue(ExitBB, PN);
258 if (PHINode *PN = dyn_cast<PHINode>(User)
[all...] |
| Local.cpp | 341 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN,
344 for (Instruction *I = PN; areAllUsesEqual(I) && !I->mayHaveSideEffects();
425 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
429 if (!recursivelySimplifyInstruction(PN, TD))
447 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
448 Value *NewVal = PN->getIncomingValue(0);
450 if (NewVal == PN) NewVal = UndefValue::get(PN->getType());
451 PN->replaceAllUsesWith(NewVal);
452 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 | 408 if (const PHINode *PN = dyn_cast<PHINode>(I))
409 PHIToResolve.push_back(PN);
432 PHINode *PN = cast<PHINode>(VMap[OPN]);
434 Value *V = VMap[PN->getIncomingBlock(pred)];
436 Value *InVal = MapValue(PN->getIncomingValue(pred),
440 PN->setIncomingValue(pred, InVal);
441 PN->setIncomingBlock(pred, MappedBlock);
443 PN->removeIncomingValue(pred, false);
454 PHINode *PN = cast<PHINode>(NewBB->begin());
456 if (NumPreds != PN->getNumIncomingValues())
[all...] |
| 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 | 191 PHINode *PN = dyn_cast<PHINode>(Header->begin());
192 if (!PN) return; // No PHI nodes.
197 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
198 if (Blocks.count(PN->getIncomingBlock(i)))
231 PHINode *PN = cast<PHINode>(OldPred->begin());
234 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
235 if (Blocks.count(PN->getIncomingBlock(i))) {
236 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
243 PHINode *PN = cast<PHINode>(AfterPHIs);
245 // 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...] |
| 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);
|
| SimplifyCFG.cpp | 118 PHINode *PN = cast<PHINode>(BBI);
119 if (PN->getIncomingValueForBlock(SI1BB) !=
120 PN->getIncomingValueForBlock(SI2BB))
159 PHINode *PN = cast<PHINode>(BBI);
160 if (PN->getIncomingValueForBlock(SI1BB) != Cond ||
161 !isa<ConstantInt>(PN->getIncomingValueForBlock(SI2BB)))
163 PhiNodes.push_back(PN);
176 PHINode *PN;
178 (PN = dyn_cast<PHINode>(I)); ++I)
179 PN->addIncoming(PN->getIncomingValueForBlock(ExistPred), NewPred)
[all...] |
| /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...] |
| /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/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 305 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
306 for (Value::const_use_iterator UI = PN->use_begin(), E = PN->use_end();
347 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
348 const Value *V1 = PN->getIncomingValueForBlock(Pred);
349 const Value *V2 = PN->getIncomingValueForBlock(BB);
393 PHINode *PN;
395 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
397 Value *InVal = PN->removeIncomingValue(BB, false);
405 PN->addIncoming(InValPhi->getIncomingValue(i)
[all...] |
| IndVarSimplify.cpp | 243 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
244 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
249 dyn_cast<ConstantFP>(PN->getIncomingValue(IncomingEdge));
255 // Check IV increment. Reject this PN if increment operation is not
258 dyn_cast<BinaryOperator>(PN->getIncomingValue(BackEdge));
265 if (IncValueVal == 0 || Incr->getOperand(0) != PN ||
269 // Check Incr uses. One user is PN and the other user is an exit condition
395 IntegerType *Int32Ty = Type::getInt32Ty(PN->getContext());
398 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
[all...] |
| LoopRotation.cpp | 101 for (I = OrigHeader->begin(); PHINode *PN = dyn_cast<PHINode>(I); ++I)
102 PN->removeIncomingValue(PN->getBasicBlockIndex(OrigPreheader));
324 for (; PHINode *PN = dyn_cast<PHINode>(I); ++I)
325 ValueMap[PN] = PN->getIncomingValueForBlock(OrigPreheader);
377 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
378 PN->addIncoming(PN->getIncomingValueForBlock(OrigHeader), OrigPreheader);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| FunctionLoweringInfo.cpp | 159 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
160 if (PN->use_empty()) continue;
163 if (PN->getType()->isEmptyTy())
166 DebugLoc DL = PN->getDebugLoc();
167 unsigned PHIReg = ValueMap[PN];
171 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
265 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
266 Type *Ty = PN->getType();
276 if (TLI.getNumRegisters(PN->getContext(), IntVT) != 1)
278 IntVT = TLI.getTypeToTransformTo(PN->getContext(), IntVT)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 186 void setChainedPhi(PHINode *PN) { ChainedPhis.insert(PN); }
255 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
257 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
264 Value *expandIVInc(PHINode *PN, Value *StepV, const Loop *L,
|
