/external/llvm/tools/llvm-objdump/ |
MCFunction.h | 49 std::vector<MCDecodedInst> Insts; 53 ArrayRef<MCDecodedInst> getInsts() const { return Insts; } 61 void addInst(const MCDecodedInst &Inst) { Insts.push_back(Inst); } 65 return Insts.size() < RHS.Insts.size();
|
/external/llvm/include/llvm/CodeGen/ |
MachineBasicBlock.h | 64 Instructions Insts; 216 unsigned size() const { return (unsigned)Insts.size(); } 217 bool empty() const { return Insts.empty(); } 219 MachineInstr& front() { return Insts.front(); } 220 MachineInstr& back() { return Insts.back(); } 221 const MachineInstr& front() const { return Insts.front(); } 222 const MachineInstr& back() const { return Insts.back(); } 224 instr_iterator instr_begin() { return Insts.begin(); } 225 const_instr_iterator instr_begin() const { return Insts.begin(); } 226 instr_iterator instr_end() { return Insts.end(); [all...] |
/external/llvm/lib/Target/Mips/ |
MipsAnalyzeImmediate.h | 54 /// return it in Insts. 55 void GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts); 59 InstSeq Insts;
|
MipsAnalyzeImmediate.cpp | 105 void MipsAnalyzeImmediate::GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts) { 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/Transforms/Utils/ |
SSAUpdater.h | 128 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts, 132 /// run - This does the promotion. Insts is a list of loads and stores to 135 void run(const SmallVectorImpl<Instruction*> &Insts) const; 142 const SmallVectorImpl<Instruction*> &Insts) const;
|
/external/llvm/lib/Transforms/Utils/ |
SSAUpdater.cpp | 363 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts, 365 if (Insts.empty()) return; 368 if (LoadInst *LI = dyn_cast<LoadInst>(Insts[0])) 371 SomeVal = cast<StoreInst>(Insts[0])->getOperand(0); 380 run(const SmallVectorImpl<Instruction*> &Insts) const { 387 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { 388 Instruction *User = Insts[i]; 398 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { 399 Instruction *User = Insts[i]; 448 if (!isInstInList(L, Insts)) continue [all...] |
/external/llvm/utils/TableGen/ |
CodeEmitterGen.cpp | 46 void reverseBits(std::vector<Record*> &Insts); 56 void CodeEmitterGen::reverseBits(std::vector<Record*> &Insts) { 57 for (std::vector<Record*>::iterator I = Insts.begin(), E = Insts.end(); 235 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); 238 if (Target.isLittleEndianEncoding()) reverseBits(Insts); 283 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
|
CodeGenTarget.cpp | 250 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); 251 if (Insts.size() <= 2) 255 for (unsigned i = 0, e = Insts.size(); i != e; ++i) 256 Instructions[Insts[i]] = new CodeGenInstruction(Insts[i]); 261 const DenseMap<const Record*, CodeGenInstruction*> &Insts, 266 I = Insts.find(Rec); 267 if (Rec == 0 || I == Insts.end()) 307 const DenseMap<const Record*, CodeGenInstruction*> &Insts = getInstructions(); 309 const CodeGenInstruction *Instr = GetInstByName(*p, Insts, Records) [all...] |
PseudoLoweringEmitter.cpp | 274 std::vector<Record*> Insts; 279 Insts.push_back(I->second); 283 for (unsigned i = 0, e = Insts.size(); i != e; ++i) 284 evaluateExpansion(Insts[i]);
|
AsmWriterEmitter.cpp | 81 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); [all...] |
FixedLenDecoderEmitter.cpp | 345 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, 350 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(), 358 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts, 363 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), [all...] |
/external/llvm/tools/bugpoint/ |
CrashDebugger.cpp | 382 &Insts) { 389 for (unsigned i = 0, e = Insts.size(); i != e; ++i) { 390 assert(!isa<TerminatorInst>(Insts[i])); 391 Instructions.insert(cast<Instruction>(VMap[Insts[i]])); 423 Insts.clear(); 426 Insts.push_back(*I); 530 std::vector<const Instruction*> Insts; 538 Insts.push_back(I); 540 ReduceCrashingInstructions(BD, TestFn).reduceList(Insts, Error);
|
/external/llvm/lib/CodeGen/ |
MachineBasicBlock.cpp | 39 Insts.Parent = this; 794 return Insts.erase(I.getInstrIterator(), E.getInstrIterator()); 797 return Insts.erase(I.getInstrIterator()); 806 Insts.remove(MI); 810 return Insts.remove(I); 818 Insts.splice(where.getInstrIterator(), Other->Insts, 823 Insts.splice(where.getInstrIterator(), Other->Insts, From.getInstrIterator()); [all...] |
/external/llvm/lib/Transforms/Scalar/ |
ScalarReplAggregates.cpp | [all...] |
LICM.cpp | 61 STATISTIC(NumMovedLoads, "Number of load insts hoisted or sunk"); 62 STATISTIC(NumMovedCalls, "Number of call insts hoisted or sunk"); 668 const SmallVectorImpl<Instruction*> &Insts, SSAUpdater &S, 673 : LoadAndStorePromoter(Insts, S), SomePtr(SP), [all...] |
LoopUnswitch.cpp | 303 UnswitchedValsMap& Insts = OldLoopProps.UnswitchedVals; 317 for (UnswitchedValsIt I = Insts.begin(); I != Insts.end(); ++I) { [all...] |
/external/llvm/lib/Target/X86/AsmParser/ |
X86AsmParser.cpp | [all...] |