/external/llvm/tools/llvm-ar/ |
H A D | llvm-ar.cpp | 542 int InsertPos = -1; local 555 InsertPos = Pos; 557 InsertPos = Pos + 1; 586 if (!RelPos.empty() && InsertPos == -1) 590 InsertPos = Ret.size(); 592 assert(unsigned(InsertPos) <= Ret.size()); 593 Ret.insert(Ret.begin() + InsertPos, Moved.begin(), Moved.end()); 595 Ret.insert(Ret.begin() + InsertPos, Members.size(), NewArchiveIterator()); 596 int Pos = InsertPos;
|
/external/llvm/include/llvm/ADT/ |
H A D | FoldingSet.h | 162 Node *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos); 165 /// it is not already in the folding set. InsertPos must be obtained from 167 void InsertNode(Node *N, void *InsertPos); 450 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument 451 return static_cast<T *>(FoldingSetImpl::FindNodeOrInsertPos(ID, InsertPos)); 529 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument 530 return static_cast<T *>(FoldingSetImpl::FindNodeOrInsertPos(ID, InsertPos)); 604 T *FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) { argument 605 return Set.FindNodeOrInsertPos(ID, InsertPos); 618 /// it is not already in the folding set. InsertPos mus 620 InsertNode(T *N, void *InsertPos) argument [all...] |
H A D | ImmutableList.h | 169 void* InsertPos; local 173 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos); 182 Cache.InsertNode(L, InsertPos);
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 887 /// operands dominate InsertPos. 893 Instruction *InsertPos, 895 if (IncV == InsertPos) 905 if (!OInst || SE.DT->dominates(OInst, InsertPos)) 917 if (!SE.DT->dominates(OInst, InsertPos)) 940 /// hoistStep - Attempt to hoist a simple IV increment above InsertPos to make 942 /// until we reach a value that dominates InsertPos. 943 bool SCEVExpander::hoistIVInc(Instruction *IncV, Instruction *InsertPos) { argument 944 if (SE.DT->dominates(IncV, InsertPos)) 947 // InsertPos mus 892 getIVIncOperand(Instruction *IncV, Instruction *InsertPos, bool allowScale) argument 1212 Instruction *InsertPos = L == IVIncInsertLoop ? local [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineBlockPlacement.cpp | 970 MachineFunction::iterator InsertPos = F.begin(); local 977 if (InsertPos != MachineFunction::iterator(*BI)) 978 F.splice(InsertPos, *BI); 980 ++InsertPos;
|
H A D | MachineScheduler.cpp | 611 MachineInstr *MI, MachineBasicBlock::iterator InsertPos) { 617 BB->splice(InsertPos, BB, MI); 624 if (RegionBegin == InsertPos) 2806 MachineBasicBlock::iterator InsertPos = SU->getInstr(); local 2808 ++InsertPos; 2825 DAG->moveInstruction(Copy, InsertPos); 610 moveInstruction( MachineInstr *MI, MachineBasicBlock::iterator InsertPos) argument
|
H A D | MachineSink.cpp | 697 MachineBasicBlock::iterator InsertPos = SuccToSinkTo->begin(); local 698 while (InsertPos != SuccToSinkTo->end() && InsertPos->isPHI()) 699 ++InsertPos; 706 SuccToSinkTo->splice(InsertPos, ParentBlock, MI, 713 SuccToSinkTo->splice(InsertPos, ParentBlock, DbgMI,
|
H A D | PHIElimination.cpp | 377 MachineBasicBlock::iterator InsertPos = local 387 NewSrcInstr = BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(), 396 NewSrcInstr = BuildMI(opBlock, InsertPos, MPhi->getDebugLoc(), 447 KillInst = std::prev(InsertPos); 507 KillInst = std::prev(InsertPos);
|
H A D | TwoAddressInstructionPass.cpp | 882 MachineBasicBlock::iterator InsertPos = KillPos; local 889 MBB->splice(InsertPos, MBB, CopyMI); 891 InsertPos = CopyMI; 897 MBB->splice(InsertPos, MBB, Begin, End); 1059 MachineBasicBlock::iterator InsertPos = mi; local 1060 while (InsertPos != MBB->begin() && std::prev(InsertPos)->isDebugValue()) 1061 --InsertPos; 1066 MBB->splice(InsertPos, MBB, From, To); 1068 nmi = std::prev(InsertPos); // Backtrac [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.h | 38 MachineBasicBlock::iterator InsertPos; member in class:llvm::InstrEmitter 131 MachineBasicBlock::iterator getInsertPos() { return InsertPos; }
|
H A D | ScheduleDAGFast.cpp | 653 EmitSchedule(MachineBasicBlock::iterator &InsertPos) override; 767 ScheduleDAGLinearize::EmitSchedule(MachineBasicBlock::iterator &InsertPos) { argument 768 InstrEmitter Emitter(BB, InsertPos); 785 InsertPos = Emitter.getInsertPos();
|
H A D | SelectionDAG.cpp | 795 void *&InsertPos) { 803 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos); 813 void *&InsertPos) { 821 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos); 831 void *&InsertPos) { 838 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos); 5217 void *InsertPos = nullptr; local 5218 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos)) 5222 if (InsertPos) 5224 InsertPos 794 FindModifiedNodeSlot(SDNode *N, SDValue Op, void *&InsertPos) argument 811 FindModifiedNodeSlot(SDNode *N, SDValue Op1, SDValue Op2, void *&InsertPos) argument 830 FindModifiedNodeSlot(SDNode *N, ArrayRef<SDValue> Ops, void *&InsertPos) argument 5242 void *InsertPos = nullptr; local 5301 void *InsertPos = nullptr; local [all...] |
H A D | SelectionDAGISel.cpp | 477 MachineBasicBlock::iterator InsertPos = Def; local 479 Def->getParent()->insert(std::next(InsertPos), MI); 491 MachineBasicBlock::iterator InsertPos = Def; local 496 // Def is never a terminator here, so it is ok to increment InsertPos. 497 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
|
/external/llvm/lib/IR/ |
H A D | Instruction.cpp | 82 void Instruction::insertBefore(Instruction *InsertPos) { argument 83 InsertPos->getParent()->getInstList().insert(InsertPos, this); 88 void Instruction::insertAfter(Instruction *InsertPos) { argument 89 InsertPos->getParent()->getInstList().insertAfter(InsertPos, this);
|
/external/llvm/lib/Support/ |
H A D | FoldingSet.cpp | 283 void *&InsertPos) { 288 InsertPos = nullptr; 299 // Didn't find the node, return null with the bucket as the InsertPos. 300 InsertPos = Bucket; 305 /// is not already in the map. InsertPos must be obtained from 307 void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { argument 313 InsertPos = GetBucketFor(ComputeNodeHash(N, TempID), Buckets, NumBuckets); 319 void **Bucket = static_cast<void**>(InsertPos); 282 FindNodeOrInsertPos(const FoldingSetNodeID &ID, void *&InsertPos) argument
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMLoadStoreOptimizer.cpp | 2027 MachineBasicBlock::iterator InsertPos = isLd ? FirstOp : LastOp; local 2028 while (InsertPos != MBB->end() 2029 && (MemOps.count(InsertPos) || InsertPos->isDebugValue())) 2030 ++InsertPos; 2056 MachineInstrBuilder MIB = BuildMI(*MBB, InsertPos, dl, MCID) 2070 MachineInstrBuilder MIB = BuildMI(*MBB, InsertPos, dl, MCID) 2094 MBB->splice(InsertPos, MBB, Op);
|
H A D | Thumb2ITBlockPass.cpp | 191 MachineBasicBlock::iterator InsertPos = MIB; local 224 MBB.insert(InsertPos, NMI); 246 finalizeBundle(MBB, InsertPos.getInstrIterator(), std::next(LI));
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonHardwareLoops.cpp | 703 MachineBasicBlock::iterator InsertPos = PH->getFirstTerminator(); local 704 DebugLoc DL = (InsertPos != PH->end()) ? InsertPos->getDebugLoc() 786 BuildMI(*PH, InsertPos, DL, SubD, SubR); 812 BuildMI(*PH, InsertPos, DL, AddD, AddR) 833 BuildMI(*PH, InsertPos, DL, LsrD, LsrR) 1034 MachineBasicBlock::iterator InsertPos = Preheader->getFirstTerminator(); local 1077 if (InsertPos != Preheader->end()) 1078 DL = InsertPos->getDebugLoc(); 1083 BuildMI(*Preheader, InsertPos, D [all...] |
/external/llvm/lib/Target/R600/ |
H A D | R600ControlFlowFinalizer.cpp | 369 MachineBasicBlock::iterator InsertPos, 371 MachineBasicBlock *MBB = InsertPos->getParent(); 375 InsertPos = BuildMI(MBB, InsertPos->getDebugLoc(), 380 return InsertPos; 433 EmitFetchClause(MachineBasicBlock::iterator InsertPos, ClauseFile &Clause, argument 437 BuildMI(BB, InsertPos->getDebugLoc(), TII->get(AMDGPU::FETCH_CLAUSE)) 440 BB->splice(InsertPos, BB, Clause.second[i]); 446 EmitALUClause(MachineBasicBlock::iterator InsertPos, ClauseFile &Clause, argument 451 BuildMI(BB, InsertPos 368 insertLiterals( MachineBasicBlock::iterator InsertPos, const std::vector<unsigned> &Literals) const argument [all...] |
/external/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 141 Instruction *InsertPos = PredBB->getTerminator(); local 142 Instruction *NewInst = createReplacementInstr(CE, InsertPos);
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineVectorOps.cpp | 163 BasicBlock::iterator InsertPos; local 165 InsertPos = pos; 166 ++InsertPos; 168 InsertPos = inBB->getFirstInsertionPt(); 171 InsertNewInstWith(newEI, *InsertPos);
|
H A D | InstructionCombining.cpp | 2520 BasicBlock::iterator InsertPos = DestBlock->getFirstInsertionPt(); local 2521 I->moveBefore(InsertPos); 2770 BasicBlock::iterator InsertPos = I; local 2774 if (!isa<PHINode>(Result) && isa<PHINode>(InsertPos)) 2775 InsertPos = InstParent->getFirstInsertionPt(); 2777 InstParent->getInstList().insert(InsertPos, Result);
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 1531 Instruction *InsertPos = &PN->getIncomingBlock(i)->back(); local 1533 Op = new BitCastInst(Op, ParamTy, "", InsertPos); 1535 Clone->insertBefore(InsertPos); 1539 "And inserting clone at " << *InsertPos << "\n"); local
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 742 Instruction *InsertPos = LoopInsertPts[i]; variable 743 StoreInst *NewSI = new StoreInst(LiveInValue, Ptr, InsertPos);
|
H A D | TailRecursionElimination.cpp | 709 Instruction *InsertPos = OldEntry->begin(); local 713 I->getName() + ".tr", InsertPos);
|