HomeSort by relevance Sort by last modified time
    Searched refs:Indexes (Results 1 - 25 of 36) sorted by null

1 2

  /external/llvm/lib/CodeGen/
LiveRangeCalc.cpp 35 Indexes = SI;
43 static void createDeadDef(SlotIndexes &Indexes, VNInfo::Allocator &Alloc,
47 Indexes.getInstructionIndex(MI).getRegSlot(MO.isEarlyClobber());
54 assert(MRI && Indexes && "call reset() first");
94 createDeadDef(*Indexes, *Alloc, *CommonRange, MO);
101 createDeadDef(*Indexes, *Alloc, *NewRange, MO);
108 createDeadDef(*Indexes, *Alloc, LI, MO);
123 LI.constructMainRangeFromSubranges(*Indexes, *Alloc);
132 assert(MRI && Indexes && "call reset() first");
137 createDeadDef(*Indexes, *Alloc, LR, MO)
    [all...]
LiveRangeCalc.h 39 SlotIndexes *Indexes;
44 /// redundant, it can be computed as: MDT[Indexes.getMBBFromIndex(VNI->def)].
138 LiveRangeCalc() : MF(nullptr), MRI(nullptr), Indexes(nullptr),
VirtRegMap.cpp 163 SlotIndexes *Indexes;
214 Indexes = &getAnalysis<SlotIndexes>();
261 for (SlotIndexes::MBBIndexIterator MBBI = Indexes->findMBBIndex(First);
262 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
304 // sorted by slot indexes.
305 SlotIndexes::MBBIndexIterator I = Indexes->MBBIndexBegin();
307 I = Indexes->advanceMBBIndex(I, Seg.start);
308 for (; I != Indexes->MBBIndexEnd() && I->first < Seg.end; ++I) {
355 DEBUG(MBBI->print(dbgs(), Indexes));
413 // PhysReg operands cannot have subregister indexes
    [all...]
InterferenceCache.h 54 /// Indexes - Mapping block numbers to SlotIndex ranges.
55 SlotIndexes *Indexes;
97 Entry() : PhysReg(0), Tag(0), RefCount(0), Indexes(nullptr), LIS(nullptr) {}
99 void clear(MachineFunction *mf, SlotIndexes *indexes, LiveIntervals *lis) {
103 Indexes = indexes;
LiveIntervalAnalysis.cpp 127 Indexes = &getAnalysis<SlotIndexes>();
179 MF->print(OS, Indexes);
231 RegMaskSlots.push_back(Indexes->getMBBStartIdx(&MBB));
239 RegMaskSlots.push_back(Indexes->getInstructionIndex(&MI).getRegSlot());
246 RegMaskSlots.push_back(Indexes->getMBBEndIdx(&MBB));
324 SlotIndex Begin = Indexes->getMBBStartIdx(MBB);
364 static void extendSegmentsToUses(LiveRange &LR, const SlotIndexes &Indexes,
377 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(Idx.getPrevSlot());
378 SlotIndex BlockStart = Indexes.getMBBStartIdx(MBB);
392 SlotIndex Stop = Indexes.getMBBEndIdx(Pred)
    [all...]
MachineBasicBlock.cpp 244 void MachineBasicBlock::print(raw_ostream &OS, SlotIndexes *Indexes) const {
254 print(OS, MST, Indexes);
258 SlotIndexes *Indexes) const {
266 if (Indexes)
267 OS << Indexes->getMBBStartIdx(this) << '\t';
287 if (Indexes) OS << '\t';
298 if (Indexes) OS << '\t';
306 if (Indexes) {
307 if (Indexes->hasIndex(&*I))
308 OS << Indexes->getInstructionIndex(&*I)
    [all...]
StackColoring.cpp 120 SlotIndexes *Indexes;
396 SlotIndex ThisIndex = Indexes->getInstructionIndex(MI);
411 Starts[pos] = Indexes->getMBBStartIdx(&MBB);
415 Finishes[pos] = Indexes->getMBBEndIdx(&MBB);
433 SlotIndex NewStart = Indexes->getMBBStartIdx(&MBB);
434 SlotIndex NewFin = Indexes->getMBBEndIdx(&MBB);
559 SlotIndex Index = Indexes->getInstructionIndex(&I);
610 SlotIndex Index = Indexes->getInstructionIndex(&I);
645 Indexes = &getAnalysis<SlotIndexes>();
687 LI->getNextValue(Indexes->getZeroIndex(), VNInfoAllocator)
    [all...]
MachineVerifier.cpp 195 SlotIndexes *Indexes;
280 if (Indexes == nullptr)
283 // Ensure the IdxMBB list is sorted by slot indexes.
285 for (SlotIndexes::MBBIndexIterator I = Indexes->MBBIndexBegin(),
286 E = Indexes->MBBIndexEnd(); I != E; ++I) {
304 Indexes = nullptr;
311 Indexes = PASS->getAnalysisIfAvailable<SlotIndexes>();
401 MF->print(errs(), Indexes);
413 if (Indexes)
414 errs() << " [" << Indexes->getMBBStartIdx(MBB
    [all...]
LiveInterval.cpp 389 const SlotIndexes &Indexes) const {
413 !CP.isCoalescable(Indexes.getInstructionFromIndex(Def)))
786 static VNInfo *searchForVNI(const SlotIndexes &Indexes, LiveRange &LR,
790 SlotIndex EndIdx = Indexes.getMBBEndIdx(MBB);
806 VNI = searchForVNI(Indexes, LR, Pred, Visited);
816 static void determineMissingVNIs(const SlotIndexes &Indexes, LiveInterval &LI) {
829 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(S.start);
831 VNInfo *VNI = searchForVNI(Indexes, LI, Pred, Visited);
860 const SlotIndexes &Indexes, VNInfo::Allocator &VNIAllocator) {
966 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(Pos)
    [all...]
RegisterCoalescer.cpp     [all...]
InterferenceCache.cpp 45 SlotIndexes *indexes,
53 Entries[i].clear(mf, indexes, lis);
126 std::tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
204 std::tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
RegAllocGreedy.cpp 124 SlotIndexes *Indexes;
574 Prio = LI->beginIndex().getInstrDistance(Indexes->getLastIndex());
579 Prio = Indexes->getZeroIndex().getInstrDistance(LI->endIndex());
    [all...]
  /external/llvm/include/llvm/CodeGen/
LiveIntervalAnalysis.h 59 SlotIndexes* Indexes;
79 /// MI = Indexes->getInstructionFromIndex(RegMaskSlot[N]);
189 return Indexes;
199 return !Indexes->hasIndex(Instr);
204 return Indexes->getInstructionIndex(instr);
209 return Indexes->getInstructionFromIndex(index);
214 return Indexes->getMBBStartIdx(mbb);
219 return Indexes->getMBBEndIdx(mbb);
233 return Indexes->getMBBFromIndex(index);
237 Indexes->insertMBBInMaps(MBB)
    [all...]
LiveInterval.h 539 bool isZeroLength(SlotIndexes *Indexes) const {
541 if (Indexes->getNextNonNullIndex(S.start).getBaseIndex() <
711 void constructMainRangeFromSubranges(const SlotIndexes &Indexes,
  /external/clang/test/CXX/temp/temp.decls/temp.variadic/
example-bind.cpp 207 template<int I, int... Indexes, typename T, typename... Types>
208 struct make_indexes_impl<I, int_tuple<Indexes...>, T, Types...> {
209 typedef typename make_indexes_impl<I+1, int_tuple<Indexes..., I>, Types...>::type type;
212 template<int I, int... Indexes>
213 struct make_indexes_impl<I, int_tuple<Indexes...> > {
214 typedef int_tuple<Indexes...> type;
232 typedef typename make_indexes<BoundArgs...>::type indexes; typedef in class:bound_functor
287 template<typename F, int... Indexes, typename... Args>
289 unwrap_and_forward(F& f, int_tuple<Indexes...>, const tuple<Args&...>& args) {
290 return f(get<Indexes>(args)...)
    [all...]
  /art/runtime/base/
bit_vector_test.cc 42 EXPECT_TRUE(bv.Indexes().begin().Done());
43 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end());
58 BitVector::IndexIterator iterator = bv.Indexes().begin();
59 EXPECT_TRUE(iterator != bv.Indexes().end());
62 EXPECT_TRUE(iterator != bv.Indexes().end());
65 EXPECT_TRUE(iterator == bv.Indexes().end());
bit_vector.h 39 * @brief Convenient iterator across the indexes of the BitVector's set bits.
43 * only through BitVector::Indexes() which returns an IndexContainer wrapper
45 * for (uint32_t idx : bit_vector.Indexes()) {
64 // Helper function to check for end without comparing with bit_vector.Indexes().end().
96 * @brief BitVector wrapper class for iteration across indexes of set bits.
213 IndexContainer Indexes() const {
  /external/llvm/lib/IR/
ConstantsContext.h 453 ArrayRef<unsigned> Indexes;
459 ArrayRef<unsigned> Indexes = None,
462 SubclassData(SubclassData), Ops(Ops), Indexes(Indexes),
468 Indexes(CE->hasIndices() ? CE->getIndices() : ArrayRef<unsigned>()) {}
474 Indexes(CE->hasIndices() ? CE->getIndices() : ArrayRef<unsigned>()) {
484 Indexes == X.Indexes;
499 if (Indexes != (CE->hasIndices() ? CE->getIndices() : ArrayRef<unsigned>()))
507 hash_combine_range(Indexes.begin(), Indexes.end()))
    [all...]
  /external/webrtc/webrtc/common_audio/signal_processing/
complex_bit_reverse_arm.S 87 @ The index tables. Note the values are doubles of the actual indexes for 16-bit
89 @ for the indexes.
92 index_7: @ Indexes for stages == 7.
102 index_8: @ Indexes for stages == 8.
  /external/llvm/lib/Transforms/Instrumentation/
PGOInstrumentation.cpp 257 std::vector<char> Indexes;
265 Indexes.push_back((char)(Index >> (J * 8)));
268 JC.update(Indexes);
  /external/llvm/lib/Transforms/InstCombine/
InstCombineCalls.cpp     [all...]
  /art/compiler/optimizing/
ssa_liveness_analysis.cc 246 for (uint32_t idx : live_in->Indexes()) {
318 for (uint32_t idx : live_in->Indexes()) {
gvn.cc 538 for (size_t block_id : visited_blocks_.Indexes()) {
  /external/llvm/lib/AsmParser/
LLParser.h 497 bool ParseUseListOrderIndexes(SmallVectorImpl<unsigned> &Indexes);
498 bool sortUseListOrder(Value *V, ArrayRef<unsigned> Indexes, SMLoc Loc);
LLParser.cpp     [all...]

Completed in 1999 milliseconds

1 2