| /external/llvm/lib/CodeGen/ |
| 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),
|
| 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;
|
| 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...] |
| 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...] |
| 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...] |
| 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...] |
| RegAllocGreedy.cpp | 124 SlotIndexes *Indexes;
574 Prio = LI->beginIndex().getInstrDistance(Indexes->getLastIndex());
579 Prio = Indexes->getZeroIndex().getInstrDistance(LI->endIndex());
[all...] |
| RegisterCoalescer.cpp | [all...] |
| /art/runtime/base/ |
| 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/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...] |
| /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...] |
| /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/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...] |
| /external/clang/lib/CodeGen/ |
| CGStmtOpenMP.cpp | 682 llvm::SmallVector<llvm::Value *, 4> Indexes;
683 Indexes.push_back(Zero);
688 Indexes.push_back(Zero);
692 Address(Builder.CreateInBoundsGEP(BaseLValue.getPointer(), Indexes),
747 llvm::SmallVector<llvm::Value *, 4> Indexes;
748 Indexes.push_back(Zero);
753 Indexes.push_back(Zero);
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| adoctint.h | 150 typedef struct ADOIndexes Indexes;
[all...] |
