| /external/llvm/lib/Target/Sparc/ |
| SparcJITInfo.cpp | 126 SmallVectorImpl<uint32_t> &Insts) {
131 Insts.push_back(JMP_INST(0, LO10(Addr), scratch));
132 Insts.push_back(NOP_INST);
140 Insts.push_back(SETHI_INST(HI22(Addr), scratch));
141 Insts.push_back(JMP_INST(scratch, LO10(Addr), scratch));
142 Insts.push_back(SUB_INST(scratch, 4, scratch));
151 Insts.push_back(SETHI_INST(HIX22(Addr), scratch));
152 Insts.push_back(XOR_INST(scratch, LOX10(Addr), scratch));
153 Insts.push_back(JMP_INST(scratch, 0, scratch));
154 Insts.push_back(SUB_INST(scratch, 8, scratch))
[all...] |
| /external/llvm/lib/MC/MCAnalysis/ |
| MCAtom.cpp | 80 Insts.push_back(MCDecodedInst(I, NextInstAddress, Size));
87 InstListTy::iterator I = Insts.begin();
88 while (I != Insts.end() && I->Address <= TruncPt) ++I;
90 assert(I != Insts.end() && "Truncation point not found in disassembly!");
94 Insts.erase(I, Insts.end());
104 InstListTy::iterator I = Insts.begin();
105 while (I != Insts.end() && I->Address < SplitPt) ++I;
106 assert(I != Insts.end() && "Split point not found in disassembly!");
110 std::copy(I, Insts.end(), std::back_inserter(RightAtom->Insts))
[all...] |
| MCFunction.cpp | 42 MCBasicBlock::MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent)
43 : Insts(&Insts), Parent(Parent) {
44 getParent()->getParent()->trackBBForAtom(&Insts, this);
68 assert(Insts->getEndAddr() + 1 == SplitBB->Insts->getBeginAddr() &&
|
| MCModuleYAML.cpp | 104 std::vector<Inst> Insts;
187 IO.mapRequired("Content", A.Insts);
317 A.Insts.resize(InstCount);
320 A.Insts[i].Opcode = MCDI.Inst.getOpcode();
321 A.Insts[i].Size = MCDI.Size;
323 A.Insts[i].Operands.resize(OpCount);
325 A.Insts[i].Operands[oi].MCOp = MCDI.Inst.getOperand(oi);
377 for (InstIt II = AI->Insts.begin(), IE = AI->Insts.end(); II != IE;
|
| /external/llvm/include/llvm/MC/MCAnalysis/ |
| MCAtom.h | 126 InstListTy Insts;
138 const_iterator begin() const { return Insts.begin(); }
139 const_iterator end() const { return Insts.end(); }
141 const MCDecodedInst &back() const { return Insts.back(); }
142 const MCDecodedInst &at(size_t n) const { return Insts.at(n); }
143 size_t size() const { return Insts.size(); }
|
| MCFunction.h | 35 const MCTextAtom *Insts;
40 MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent);
51 const MCTextAtom *getInsts() const { return Insts; }
75 /// \brief Split block, mirrorring NewAtom = Insts->split(..).
78 /// \p SplitBB The result of splitting Insts, a basic block directly following
100 /// \brief Create an MCBasicBlock backed by Insts and add it to this function.
101 /// \param Insts Sequence of straight-line code backing the basic block.
103 MCBasicBlock &createBlock(const MCTextAtom &Insts);
|
| /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 | 138 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
144 /// Insts is a list of loads and stores to promote, and Name is the basename
147 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/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 64 Instructions Insts;
219 unsigned size() const { return (unsigned)Insts.size(); }
220 bool empty() const { return Insts.empty(); }
222 MachineInstr &instr_front() { return Insts.front(); }
223 MachineInstr &instr_back() { return Insts.back(); }
224 const MachineInstr &instr_front() const { return Insts.front(); }
225 const MachineInstr &instr_back() const { return Insts.back(); }
227 MachineInstr &front() { return Insts.front(); }
229 const MachineInstr &front() const { return Insts.front(); }
232 instr_iterator instr_begin() { return Insts.begin();
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 324 LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
326 if (Insts.empty()) return;
329 if (LoadInst *LI = dyn_cast<LoadInst>(Insts[0]))
332 SomeVal = cast<StoreInst>(Insts[0])->getOperand(0);
341 run(const SmallVectorImpl<Instruction*> &Insts) const {
348 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
349 Instruction *User = Insts[i];
359 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
360 Instruction *User = Insts[i];
409 if (!isInstInList(L, Insts)) continue
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenTarget.cpp | 273 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
274 if (Insts.size() <= 2)
278 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
279 Instructions[Insts[i]] = new CodeGenInstruction(Insts[i]);
284 const DenseMap<const Record*, CodeGenInstruction*> &Insts,
289 I = Insts.find(Rec);
290 if (!Rec || I == Insts.end())
305 const DenseMap<const Record*, CodeGenInstruction*> &Insts = getInstructions();
307 const CodeGenInstruction *Instr = GetInstByName(*p, Insts, Records)
[all...] |
| PseudoLoweringEmitter.cpp | 279 std::vector<Record*> Insts;
284 Insts.push_back(I->second);
288 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
289 evaluateExpansion(Insts[i]);
|
| CodeEmitterGen.cpp | 236 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction");
284 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
|
| AsmWriterEmitter.cpp | 88 static void EmitInstructions(std::vector<AsmWriterInst> &Insts,
90 AsmWriterInst FirstInst = Insts.back();
91 Insts.pop_back();
95 for (unsigned i = Insts.size(); i != 0; --i) {
96 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
104 SimilarInsts.push_back(Insts[i-1]);
105 Insts.erase(Insts.begin()+i-1);
[all...] |
| FixedLenDecoderEmitter.cpp | 344 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts,
349 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(),
357 FilterChooser(const std::vector<const CodeGenInstruction*> &Insts,
362 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops),
[all...] |
| /external/llvm/tools/bugpoint/ |
| CrashDebugger.cpp | 380 &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]]));
422 Insts.clear();
425 Insts.push_back(*I);
529 std::vector<const Instruction*> Insts;
537 Insts.push_back(I);
539 ReduceCrashingInstructions(BD, TestFn).reduceList(Insts, Error);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64AddressTypePromotion.cpp | 381 Instructions &Insts = Entry.second;
383 for (Instruction *Inst : Insts) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| ScalarReplAggregates.cpp | [all...] |
| LoopUnswitch.cpp | 301 UnswitchedValsMap &Insts = OldLoopProps.UnswitchedVals;
315 for (UnswitchedValsIt I = Insts.begin(); I != Insts.end(); ++I) {
[all...] |
| SROA.cpp | 812 AllocaPromoter(const SmallVectorImpl<Instruction *> &Insts, SSAUpdater &S,
814 : LoadAndStorePromoter(Insts, S), AI(AI), DIB(DIB) {}
816 void run(const SmallVectorImpl<Instruction*> &Insts) {
827 LoadAndStorePromoter::run(Insts);
838 const SmallVectorImpl<Instruction*> &Insts) const override {
[all...] |
| LICM.cpp | 66 STATISTIC(NumMovedLoads, "Number of load insts hoisted or sunk");
67 STATISTIC(NumMovedCalls, "Number of call insts hoisted or sunk");
712 LoopPromoter(Value *SP, const SmallVectorImpl<Instruction *> &Insts,
718 : LoadAndStorePromoter(Insts, S), SomePtr(SP), PointerMustAliases(PMA),
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 43 Insts.Parent = this;
[all...] |
| MachineFunction.cpp | 91 I->Insts.clearAndLeakNodesUnsafely();
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
