| /external/llvm/lib/MC/ |
| D | MCAtom.cpp | 77 Insts.push_back(MCDecodedInst(I, NextInstAddress, Size)); in addInst()
84 InstListTy::iterator I = Insts.begin(); in truncate()
85 while (I != Insts.end() && I->Address <= TruncPt) ++I; in truncate()
87 assert(I != Insts.end() && "Truncation point not found in disassembly!"); in truncate()
91 Insts.erase(I, Insts.end()); in truncate()
101 InstListTy::iterator I = Insts.begin(); in split()
102 while (I != Insts.end() && I->Address < SplitPt) ++I; in split()
103 assert(I != Insts.end() && "Split point not found in disassembly!"); in split()
107 std::copy(I, Insts.end(), std::back_inserter(RightAtom->Insts)); in split()
108 Insts.erase(I, Insts.end()); in split()
|
| D | MCFunction.cpp | 35 MCBasicBlock::MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent) in MCBasicBlock() argument
36 : Insts(&Insts), Parent(Parent) in MCBasicBlock()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineBasicBlock.h | 64 Instructions Insts;
219 unsigned size() const { return (unsigned)Insts.size(); }
220 bool empty() const { return Insts.empty(); }
222 MachineInstr& front() { return Insts.front(); }
223 MachineInstr& back() { return Insts.back(); }
224 const MachineInstr& front() const { return Insts.front(); }
225 const MachineInstr& back() const { return Insts.back(); }
227 instr_iterator instr_begin() { return Insts.begin(); }
228 const_instr_iterator instr_begin() const { return Insts.begin(); }
229 instr_iterator instr_end() { return Insts.end(); }
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | SSAUpdater.cpp | 325 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts, in LoadAndStorePromoter() argument
327 if (Insts.empty()) return; in LoadAndStorePromoter()
330 if (LoadInst *LI = dyn_cast<LoadInst>(Insts[0])) in LoadAndStorePromoter()
333 SomeVal = cast<StoreInst>(Insts[0])->getOperand(0); in LoadAndStorePromoter()
342 run(const SmallVectorImpl<Instruction*> &Insts) const { in run()
349 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { in run()
350 Instruction *User = Insts[i]; in run()
360 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { in run()
361 Instruction *User = Insts[i]; in run()
410 if (!isInstInList(L, Insts)) continue; in run()
[all …]
|
| /external/llvm/include/llvm/MC/ |
| D | MCAtom.h | 124 InstListTy Insts; variable
136 const_iterator begin() const { return Insts.begin(); } in begin()
137 const_iterator end() const { return Insts.end(); } in end()
139 const MCDecodedInst &back() const { return Insts.back(); } in back()
140 const MCDecodedInst &at(size_t n) const { return Insts.at(n); } in at()
141 uint64_t size() const { return Insts.size(); } in size()
|
| D | MCFunction.h | 34 const MCTextAtom *Insts; variable
39 MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent);
50 const MCTextAtom *getInsts() const { return Insts; } in getInsts()
95 MCBasicBlock &createBlock(const MCTextAtom &Insts);
|
| /external/llvm/lib/Target/Mips/ |
| D | MipsAnalyzeImmediate.cpp | 105 void MipsAnalyzeImmediate::GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts) { in GetShortestSeq() argument
120 Insts.clear(); in GetShortestSeq()
121 Insts.append(ShortestSeq->begin(), ShortestSeq->end()); in GetShortestSeq()
150 GetShortestSeq(SeqLs, Insts); in Analyze()
152 return Insts; in Analyze()
|
| D | MipsAnalyzeImmediate.h | 55 void GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts);
59 InstSeq Insts; variable
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenTarget.cpp | 264 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); in ReadInstructions() local
265 if (Insts.size() <= 2) in ReadInstructions()
269 for (unsigned i = 0, e = Insts.size(); i != e; ++i) in ReadInstructions()
270 Instructions[Insts[i]] = new CodeGenInstruction(Insts[i]); in ReadInstructions()
275 const DenseMap<const Record*, CodeGenInstruction*> &Insts, in GetInstByName() argument
280 I = Insts.find(Rec); in GetInstByName()
281 if (Rec == 0 || I == Insts.end()) in GetInstByName()
321 const DenseMap<const Record*, CodeGenInstruction*> &Insts = getInstructions(); in ComputeInstrsByEnum() local
323 const CodeGenInstruction *Instr = GetInstByName(*p, Insts, Records); in ComputeInstrsByEnum()
331 I = Insts.begin(), E = Insts.end(); I != E; ++I) { in ComputeInstrsByEnum()
[all …]
|
| D | CodeEmitterGen.cpp | 46 void reverseBits(std::vector<Record*> &Insts);
56 void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) { in reverseBits() argument
57 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end(); in reverseBits()
238 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); in run() local
241 if (Target.isLittleEndianEncoding()) reverseBits(Insts); in run()
286 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end(); in run()
|
| D | PseudoLoweringEmitter.cpp | 275 std::vector<Record*> Insts; in run() local
280 Insts.push_back(I->second); in run()
284 for (unsigned i = 0, e = Insts.size(); i != e; ++i) in run()
285 evaluateExpansion(Insts[i]); in run()
|
| D | AsmWriterEmitter.cpp | 81 static void EmitInstructions(std::vector<AsmWriterInst> &Insts, in EmitInstructions() argument
83 AsmWriterInst FirstInst = Insts.back(); in EmitInstructions()
84 Insts.pop_back(); in EmitInstructions()
88 for (unsigned i = Insts.size(); i != 0; --i) { in EmitInstructions()
89 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst); in EmitInstructions()
97 SimilarInsts.push_back(Insts[i-1]); in EmitInstructions()
98 Insts.erase(Insts.begin()+i-1); in EmitInstructions()
|
| D | FixedLenDecoderEmitter.cpp | 345 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, in FilterChooser() argument
350 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(), in FilterChooser()
358 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, in FilterChooser() argument
363 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), in FilterChooser()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | SSAUpdater.h | 137 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
146 void run(const SmallVectorImpl<Instruction*> &Insts) const;
154 const SmallVectorImpl<Instruction*> &Insts) const;
|
| /external/llvm/tools/bugpoint/ |
| D | CrashDebugger.cpp | 380 &Insts) { in TestInsts() argument
387 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { in TestInsts()
388 assert(!isa<TerminatorInst>(Insts[i])); in TestInsts()
389 Instructions.insert(cast<Instruction>(VMap[Insts[i]])); in TestInsts()
421 Insts.clear(); in TestInsts()
424 Insts.push_back(*I); in TestInsts()
528 std::vector<const Instruction*> Insts; in DebugACrash() local
536 Insts.push_back(I); in DebugACrash()
538 ReduceCrashingInstructions(BD, TestFn).reduceList(Insts, Error); in DebugACrash()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | ScalarReplAggregates.cpp | 1051 AllocaPromoter(const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, in AllocaPromoter() argument
1053 : LoadAndStorePromoter(Insts, S), AI(0), DIB(DB) {} in AllocaPromoter()
1055 void run(AllocaInst *AI, const SmallVectorImpl<Instruction*> &Insts) { in run() argument
1067 LoadAndStorePromoter::run(Insts); in run()
1082 const SmallVectorImpl<Instruction*> &Insts) const { in isInstInList()
1415 SmallVector<Instruction*, 64> Insts; in performPromotion() local
1438 Insts.push_back(cast<Instruction>(*UI)); in performPromotion()
1439 AllocaPromoter(Insts, SSA, &DIB).run(AI, Insts); in performPromotion()
1440 Insts.clear(); in performPromotion()
|
| D | SROA.cpp | 736 AllocaPromoter(const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, in AllocaPromoter() argument
738 : LoadAndStorePromoter(Insts, S), AI(AI), DIB(DIB) {} in AllocaPromoter()
740 void run(const SmallVectorImpl<Instruction*> &Insts) { in run() argument
753 LoadAndStorePromoter::run(Insts); in run()
764 const SmallVectorImpl<Instruction*> &Insts) const { in isInstInList()
3399 SmallVector<Instruction*, 64> Insts; in promoteAllocas() local
3433 Insts.push_back(LI); in promoteAllocas()
3438 Insts.push_back(SI); in promoteAllocas()
3448 AllocaPromoter(Insts, SSA, *AI, DIB).run(Insts); in promoteAllocas()
3449 Insts.clear(); in promoteAllocas()
|
| D | LICM.cpp | 671 const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, in LoopPromoter() argument
677 : LoadAndStorePromoter(Insts, S), SomePtr(SP), in LoopPromoter()
|
| D | LoopUnswitch.cpp | 312 UnswitchedValsMap &Insts = OldLoopProps.UnswitchedVals; in cloneData() local
326 for (UnswitchedValsIt I = Insts.begin(); I != Insts.end(); ++I) { in cloneData()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBasicBlock.cpp | 42 Insts.Parent = this; in MachineBasicBlock()
967 return Insts.erase(I); in erase()
974 return Insts.remove(MI); in remove_instr()
986 return Insts.insert(I, MI); in insert()
|
| D | MachineFunction.cpp | 90 I->Insts.clearAndLeakNodesUnsafely(); in ~MachineFunction()
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 3705 SmallPtrSet<Instruction *, 8> &Insts) { in hasMultipleUsesOf() argument
3708 if (Insts.count(dyn_cast<Instruction>(*Use))) in hasMultipleUsesOf()
|