Searched refs:Insts (Results 1 - 22 of 22) sorted by relevance

/external/llvm/lib/MC/
H A DMCAtom.cpp77 Insts.push_back(MCDecodedInst(I, NextInstAddress, Size));
84 InstListTy::iterator I = Insts.begin();
85 while (I != Insts.end() && I->Address <= TruncPt) ++I;
87 assert(I != Insts.end() && "Truncation point not found in disassembly!");
91 Insts.erase(I, Insts.end());
101 InstListTy::iterator I = Insts.begin();
102 while (I != Insts.end() && I->Address < SplitPt) ++I;
103 assert(I != Insts.end() && "Split point not found in disassembly!");
107 std::copy(I, Insts
[all...]
H A DMCFunction.cpp35 MCBasicBlock::MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent) argument
36 : Insts(&Insts), Parent(Parent)
/external/llvm/lib/Target/Mips/
H A DMipsAnalyzeImmediate.h54 /// return it in Insts.
55 void GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts);
59 InstSeq Insts; member in class:llvm::MipsAnalyzeImmediate
H A DMipsAnalyzeImmediate.cpp105 void MipsAnalyzeImmediate::GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts) { argument
120 Insts.clear();
121 Insts.append(ShortestSeq->begin(), ShortestSeq->end());
149 // Set Insts to the shortest instruction sequence.
150 GetShortestSeq(SeqLs, Insts);
152 return Insts;
/external/llvm/include/llvm/MC/
H A DMCFunction.h34 const MCTextAtom *Insts; member in class:llvm::MCBasicBlock
39 MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent);
50 const MCTextAtom *getInsts() const { return Insts; }
92 /// \brief Create an MCBasicBlock backed by Insts and add it to this function.
93 /// \param Insts Sequence of straight-line code backing the basic block.
95 MCBasicBlock &createBlock(const MCTextAtom &Insts);
H A DMCAtom.h124 InstListTy Insts; member in class:llvm::MCTextAtom
136 const_iterator begin() const { return Insts.begin(); }
137 const_iterator end() const { return Insts.end(); }
139 const MCDecodedInst &back() const { return Insts.back(); }
140 const MCDecodedInst &at(size_t n) const { return Insts.at(n); }
141 uint64_t size() const { return Insts.size(); }
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h64 Instructions Insts; member in class:llvm::MachineBasicBlock
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
[all...]
/external/llvm/lib/Transforms/Utils/
H A DSSAUpdater.cpp325 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts, argument
327 if (Insts.empty()) return;
330 if (LoadInst *LI = dyn_cast<LoadInst>(Insts[0]))
333 SomeVal = cast<StoreInst>(Insts[0])->getOperand(0);
342 run(const SmallVectorImpl<Instruction*> &Insts) const {
349 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
350 Instruction *User = Insts[i];
360 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
361 Instruction *User = Insts[i];
410 if (!isInstInList(L, Insts)) continu
[all...]
/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdater.h137 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
143 /// Insts is a list of loads and stores to promote, and Name is the basename
146 void run(const SmallVectorImpl<Instruction*> &Insts) const;
151 /// The Insts list is the one passed into the constructor. Clients should
154 const SmallVectorImpl<Instruction*> &Insts) const;
/external/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp46 void reverseBits(std::vector<Record*> &Insts);
56 void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) { argument
57 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end();
238 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); local
241 if (Target.isLittleEndianEncoding()) reverseBits(Insts);
286 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
H A DCodeGenTarget.cpp264 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); local
265 if (Insts.size() <= 2)
269 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
270 Instructions[Insts[i]] = new CodeGenInstruction(Insts[i]);
275 const DenseMap<const Record*, CodeGenInstruction*> &Insts,
280 I = Insts.find(Rec);
281 if (Rec == 0 || I == Insts.end())
321 const DenseMap<const Record*, CodeGenInstruction*> &Insts = getInstructions(); local
323 const CodeGenInstruction *Instr = GetInstByName(*p, Insts, Record
274 GetInstByName(const char *Name, const DenseMap<const Record*, CodeGenInstruction*> &Insts, RecordKeeper &Records) argument
[all...]
H A DPseudoLoweringEmitter.cpp275 std::vector<Record*> Insts; local
280 Insts.push_back(I->second);
284 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
285 evaluateExpansion(Insts[i]);
H A DAsmWriterEmitter.cpp81 static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
83 AsmWriterInst FirstInst = Insts.back();
84 Insts.pop_back();
88 for (unsigned i = Insts.size(); i != 0; --i) {
89 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
97 SimilarInsts.push_back(Insts[i-1]);
98 Insts.erase(Insts.begin()+i-1);
H A DFixedLenDecoderEmitter.cpp345 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, argument
350 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(),
358 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, argument
363 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops),
/external/llvm/tools/bugpoint/
H A DCrashDebugger.cpp380 &Insts) {
387 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
388 assert(!isa<TerminatorInst>(Insts[i]));
389 Instructions.insert(cast<Instruction>(VMap[Insts[i]]));
421 Insts.clear();
424 Insts.push_back(*I);
528 std::vector<const Instruction*> Insts; local
536 Insts.push_back(I);
538 ReduceCrashingInstructions(BD, TestFn).reduceList(Insts, Error);
379 TestInsts(std::vector<const Instruction*> &Insts) argument
/external/llvm/lib/Transforms/Scalar/
H A DScalarReplAggregates.cpp1051 AllocaPromoter(const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, argument
1053 : LoadAndStorePromoter(Insts, S), AI(0), DIB(DB) {}
1055 void run(AllocaInst *AI, const SmallVectorImpl<Instruction*> &Insts) { argument
1067 LoadAndStorePromoter::run(Insts);
1082 const SmallVectorImpl<Instruction*> &Insts) const {
1415 SmallVector<Instruction*, 64> Insts; local
1438 Insts.push_back(cast<Instruction>(*UI));
1439 AllocaPromoter(Insts, SSA, &DIB).run(AI, Insts);
1440 Insts
[all...]
H A DLICM.cpp671 const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S,
677 : LoadAndStorePromoter(Insts, S), SomePtr(SP),
670 LoopPromoter(Value *SP, const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, SmallPtrSet<Value*, 4> &PMA, SmallVectorImpl<BasicBlock*> &LEB, SmallVectorImpl<Instruction*> &LIP, AliasSetTracker &ast, DebugLoc dl, int alignment, MDNode *TBAATag) argument
H A DSROA.cpp736 AllocaPromoter(const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, argument
738 : LoadAndStorePromoter(Insts, S), AI(AI), DIB(DIB) {}
740 void run(const SmallVectorImpl<Instruction*> &Insts) { argument
753 LoadAndStorePromoter::run(Insts);
764 const SmallVectorImpl<Instruction*> &Insts) const {
3399 SmallVector<Instruction*, 64> Insts; local
3433 Insts.push_back(LI);
3438 Insts.push_back(SI);
3448 AllocaPromoter(Insts, SSA, *AI, DIB).run(Insts);
[all...]
H A DLoopUnswitch.cpp312 UnswitchedValsMap &Insts = OldLoopProps.UnswitchedVals; local
326 for (UnswitchedValsIt I = Insts.begin(); I != Insts.end(); ++I) {
/external/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp42 Insts.Parent = this;
967 return Insts.erase(I);
974 return Insts.remove(MI);
986 return Insts.insert(I, MI);
H A DMachineFunction.cpp90 I->Insts.clearAndLeakNodesUnsafely();
/external/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp3705 SmallPtrSet<Instruction *, 8> &Insts) {
3708 if (Insts.count(dyn_cast<Instruction>(*Use)))

Completed in 252 milliseconds