HomeSort by relevance Sort by last modified time
    Searched refs:PHINode (Results 51 - 75 of 169) sorted by null

1 23 4 5 6 7

  /external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp 295 DenseMap<std::pair<unsigned, unsigned>, PHINode *> NewPhiNodes;
299 DenseMap<PHINode *, unsigned> PhiToAllocaMap;
750 for (DenseMap<std::pair<unsigned, unsigned>, PHINode *>::iterator
754 PHINode *PN = I->second;
776 for (DenseMap<std::pair<unsigned, unsigned>, PHINode *>::iterator
782 PHINode *SomePHI = I->second;
820 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
    [all...]
IntegerDivision.cpp 263 PHINode *Carry_1 = Builder.CreatePHI(I32Ty, 2);
264 PHINode *SR_3 = Builder.CreatePHI(I32Ty, 2);
265 PHINode *R_1 = Builder.CreatePHI(I32Ty, 2);
266 PHINode *Q_2 = Builder.CreatePHI(I32Ty, 2);
288 PHINode *Carry_2 = Builder.CreatePHI(I32Ty, 2);
289 PHINode *Q_3 = Builder.CreatePHI(I32Ty, 2);
298 PHINode *Q_5 = Builder.CreatePHI(I32Ty, 2);
ValueMapper.cpp 198 if (PHINode *PN = dyn_cast<PHINode>(I)) {
  /external/llvm/lib/Transforms/IPO/
GlobalOpt.cpp 83 const SmallPtrSet<const PHINode*, 16> &PHIUsers,
194 SmallPtrSet<const PHINode*, 16> &PHIUsers) {
269 } else if (const PHINode *PN = dyn_cast<PHINode>(I)) {
807 SmallPtrSet<const PHINode*, 8> &PHIs) {
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 123 (Instruction *&CntInst, PHINode *&CntPhi, Value *&Var) const;
126 void transform (Instruction *CntInst, PHINode *CntPhi, Value *Var);
368 PHINode *&CntPhi,
393 PHINode *PhiX, *CountPhi;
435 PhiX = dyn_cast<PHINode>(VarX1);
455 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0));
496 PHINode *CntPhi, Value *Var) {
576 PHINode *TcPhi = PHINode::Create(Ty, 2, "tcphi", Body->begin())
    [all...]
StructurizeCFG.cpp 37 typedef MapVector<PHINode *, BBValueVector> PhiMap;
497 I != E && isa<PHINode>(*I);) {
499 PHINode &Phi = cast<PHINode>(*I++);
510 I != E && isa<PHINode>(*I);) {
512 PHINode &Phi = cast<PHINode>(*I++);
535 PHINode *Phi = PI->first;
823 } else if (PHINode *UserPN = dyn_cast<PHINode>(User))
    [all...]
LoopUnswitch.cpp 618 if (!LoopExitBB || isa<PHINode>(LoopExitBB->begin()))
    [all...]
  /external/llvm/lib/Analysis/
ScalarEvolutionExpander.cpp 145 while (isa<PHINode>(IP) || isa<LandingPadInst>(IP))
    [all...]
LoopInfo.cpp 142 PHINode *Loop::getCanonicalInductionVariable() const {
162 for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) {
163 PHINode *PN = cast<PHINode>(I);
191 if (PHINode *P = dyn_cast<PHINode>(U))
PHITransAddr.cpp 26 if (isa<PHINode>(Inst) ||
136 assert(!isa<PHINode>(I) && "Error, removing something that isn't an input");
170 if (PHINode *PN = dyn_cast<PHINode>(Inst))
BasicAliasAnalysis.cpp 549 AliasResult aliasPHI(const PHINode *PN, uint64_t PNSize,
624 if (const PHINode *PN = dyn_cast<PHINode>(V)) {
    [all...]
ScalarEvolutionNormalization.cpp 47 PHINode *PN = dyn_cast<PHINode>(User);
InstructionSimplify.cpp 93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
518 PHINode *PI;
519 if (isa<PHINode>(LHS)) {
520 PI = cast<PHINode>(LHS);
525 assert(isa<PHINode>(RHS) && "No PHI instruction operand!");
526 PI = cast<PHINode>(RHS);
562 if (!isa<PHINode>(LHS)) {
566 assert(isa<PHINode>(LHS) && "Not comparing with a phi instruction!");
567 PHINode *PI = cast<PHINode>(LHS)
    [all...]
ScalarEvolution.cpp     [all...]
Loads.cpp 43 isa<PHINode>(A) || isa<GetElementPtrInst>(A))
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 172 typedef SmallVector<PHINode*, 4> PhiVector;
319 PHINode *Induction;
321 PHINode *OldInduction;
493 typedef DenseMap<PHINode*, ReductionDescriptor> ReductionList;
497 typedef MapVector<PHINode*, InductionInfo> InductionList;
505 PHINode *getInduction() { return Induction; }
574 bool AddReductionVar(PHINode *Phi, ReductionKind Kind);
588 InductionKind isInductionVariable(PHINode *Phi);
605 PHINode *Induction;
    [all...]
  /external/llvm/lib/IR/
Instruction.cpp 319 if (const PHINode *thisPHI = dyn_cast<PHINode>(this)) {
320 const PHINode *otherPHI = cast<PHINode>(I);
405 const PHINode *PN = dyn_cast<PHINode>(U);
  /external/llvm/lib/CodeGen/
StackProtector.cpp 65 SmallPtrSet<const PHINode*, 16> VisitedPHIs;
188 } else if (const PHINode *PN = dyn_cast<PHINode>(U)) {
UnreachableBlockElim.cpp 80 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCContract.cpp 465 if (PHINode *PHI = dyn_cast<PHINode>(U.getUser())) {
467 unsigned ValNo = PHINode::getIncomingValueNumForOperand(OperandNo);
479 PHINode::getOperandNumForIncomingValue(i)) ==
  /external/llvm/include/llvm/Analysis/
MemoryBuiltins.h 200 SizeOffsetType visitPHINode(PHINode&);
261 SizeOffsetEvalType visitPHINode(PHINode &PHI);
  /external/llvm/lib/Target/NVPTX/
NVPTXLowerAggrCopies.cpp 57 PHINode *ind = loop.CreatePHI(indType, 0);
91 PHINode *ind = loop.CreatePHI(len->getType(), 0);
  /external/llvm/lib/Transforms/Instrumentation/
PathProfiling.cpp 86 // constant or phinode. Used by the instrumentation code to remember
94 // Get/set the PHINode Instruction for this node.
95 PHINode* getPathPHI();
96 void setPathPHI(PHINode* pathPHI);
102 PHINode* _pathPHI; // The PHINode for current pathNumber.
295 // have multiple predecessors, and may or may not have its phiNode
301 // target's phiNode.
318 // A PHINode is created in the node, and its values initialized to -1U.
743 // or phinode. Used by the instrumentation code to remember pat
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
FunctionLoweringInfo.cpp 47 if (isa<PHINode>(I)) return true;
52 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U))
159 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
268 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
  /external/llvm/lib/Transforms/InstCombine/
InstCombineVectorOps.cpp 111 Instruction *InstCombiner::scalarizePHI(ExtractElementInst &EI, PHINode *PN) {
133 PHINode *scalarPHI = cast<PHINode>(InsertNewInstWith(
134 PHINode::Create(EI.getType(), PN->getNumIncomingValues(), ""), *PN));
160 if (pos && !isa<PHINode>(pos)) {
222 if (PHINode *PN = dyn_cast<PHINode>(EI.getOperand(0))) {
    [all...]

Completed in 2586 milliseconds

1 23 4 5 6 7