| /external/llvm/include/llvm/CodeGen/ |
| LiveIntervalAnalysis.h | 57 SlotIndexes* Indexes;
77 /// MI = Indexes->getInstructionFromIndex(RegMaskSlot[N]);
190 return Indexes;
200 return !Indexes->hasIndex(Instr);
205 return Indexes->getInstructionIndex(instr);
210 return Indexes->getInstructionFromIndex(index);
215 return Indexes->getMBBStartIdx(mbb);
220 return Indexes->getMBBEndIdx(mbb);
234 return Indexes->getMBBFromIndex(index);
238 Indexes->insertMBBInMaps(MBB)
[all...] |
| LiveInterval.h | 486 bool isZeroLength(SlotIndexes *Indexes) const {
488 if (Indexes->getNextNonNullIndex(i->start).getBaseIndex() <
|
| /external/llvm/lib/CodeGen/ |
| LiveRangeCalc.cpp | 28 Indexes = SI;
41 assert(MRI && Indexes && "call reset() first");
51 Idx = Indexes->getMBBStartIdx(MI->getParent());
54 Idx = Indexes->getInstructionIndex(MI)
64 assert(MRI && Indexes && "call reset() first");
85 Idx = Indexes->getMBBEndIdx(MI->getOperand(OpNo+1).getMBB());
88 Idx = Indexes->getInstructionIndex(MI).getRegSlot();
116 std::tie(Start, End) = Indexes->getMBBRange(MBB);
136 assert(Indexes && "Missing SlotIndexes");
139 MachineBasicBlock *KillMBB = Indexes->getMBBFromIndex(Kill.getPrevSlot())
[all...] |
| LiveRangeCalc.h | 39 SlotIndexes *Indexes;
50 /// redundant, it can be computed as: MDT[Indexes.getMBBFromIndex(VNI->def)].
128 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;
|
| LiveIntervalAnalysis.cpp | 117 Indexes = &getAnalysis<SlotIndexes>();
165 MF->print(OS, Indexes);
215 RegMaskSlots.push_back(Indexes->getInstructionIndex(MI).getRegSlot());
288 SlotIndex Begin = Indexes->getMBBStartIdx(MBB);
472 MachineBasicBlock *KillMBB = Indexes->getMBBFromIndex(Kill);
474 std::tie(MBBStart, MBBEnd) = Indexes->getMBBRange(KillMBB);
501 std::tie(MBBStart, MBBEnd) = Indexes->getMBBRange(MBB);
609 // getMBBFromIndex doesn't need to search the MBB table when both indexes
611 MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
612 MachineBasicBlock *MBB2 = Indexes->getMBBFromIndex(Stop)
[all...] |
| MachineBasicBlock.cpp | 266 void MachineBasicBlock::print(raw_ostream &OS, SlotIndexes *Indexes) const {
274 if (Indexes)
275 OS << Indexes->getMBBStartIdx(this) << '\t';
295 if (Indexes) OS << '\t';
303 if (Indexes) OS << '\t';
311 if (Indexes) {
312 if (Indexes->hasIndex(I))
313 OS << Indexes->getInstructionIndex(I);
324 if (Indexes) OS << '\t';
717 SlotIndexes *Indexes = P->getAnalysisIfAvailable<SlotIndexes>()
[all...] |
| StackColoring.cpp | 121 SlotIndexes *Indexes;
397 SlotIndex ThisIndex = Indexes->getInstructionIndex(MI);
412 Starts[pos] = Indexes->getMBBStartIdx(&MBB);
416 Finishes[pos] = Indexes->getMBBEndIdx(&MBB);
434 SlotIndex NewStart = Indexes->getMBBStartIdx(&MBB);
435 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...] |
| VirtRegMap.cpp | 162 SlotIndexes *Indexes;
211 Indexes = &getAnalysis<SlotIndexes>();
257 if (!Indexes->findLiveInMBBs(I->start, I->end, LiveIn))
289 DEBUG(MBBI->print(dbgs(), Indexes));
366 // PhysReg operands cannot have subregister indexes.
394 if (Indexes)
395 Indexes->removeMachineInstrFromMaps(MI);
|
| MachineVerifier.cpp | 196 SlotIndexes *Indexes;
302 Indexes = nullptr;
309 Indexes = PASS->getAnalysisIfAvailable<SlotIndexes>();
384 MF->print(*OS, Indexes);
396 if (Indexes)
397 *OS << " [" << Indexes->getMBBStartIdx(MBB)
398 << ';' << Indexes->getMBBEndIdx(MBB) << ')';
406 if (Indexes && Indexes->hasIndex(MI))
407 *OS << Indexes->getInstructionIndex(MI) << '\t'
[all...] |
| RegisterCoalescer.cpp | [all...] |
| InterferenceCache.cpp | 44 SlotIndexes *indexes,
52 Entries[i].clear(mf, indexes, lis);
125 std::tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
202 std::tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
|
| RegAllocGreedy.cpp | 116 SlotIndexes *Indexes;
526 Prio = LI->beginIndex().getInstrDistance(Indexes->getLastIndex());
531 Prio = Indexes->getZeroIndex().getInstrDistance(LI->beginIndex());
[all...] |
| /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 | 41 EXPECT_TRUE(bv.Indexes().begin().Done());
42 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end());
57 BitVector::IndexIterator iterator = bv.Indexes().begin();
58 EXPECT_TRUE(iterator != bv.Indexes().end());
61 EXPECT_TRUE(iterator != bv.Indexes().end());
64 EXPECT_TRUE(iterator == bv.Indexes().end());
|
| bit_vector.h | 38 * @brief Convenient iterator across the indexes of the BitVector's set bits.
42 * only through BitVector::Indexes() which returns an IndexContainer wrapper
44 * for (uint32_t idx : bit_vector.Indexes()) {
78 // Helper function to check for end without comparing with bit_vector.Indexes().end().
128 * @brief BitVector wrapper class for iteration across indexes of set bits.
186 IndexContainer Indexes() const {
|
| /external/chromium_org/third_party/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.
|
| /art/compiler/dex/ |
| ssa_transformation.cc | 141 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) {
195 work_stack.push_back(std::make_pair(bb, bb->i_dominated->Indexes().begin()));
208 work_stack.push_back(std::make_pair(new_bb, new_bb->i_dominated->Indexes().begin()));
260 for (uint32_t dominated_idx : bb->i_dominated->Indexes()) {
262 for (uint32_t df_up_block_idx : dominated_bb->dom_frontier->Indexes()) {
514 // TUNING: When we repeat this, we could skip indexes from the previous pass.
515 for (uint32_t idx : input_blocks->Indexes()) {
527 for (uint32_t idx : phi_blocks->Indexes()) {
|
| /external/chromium_org/chrome/browser/ui/views/profiles/ |
| profile_chooser_view.h | 76 typedef std::vector<size_t> Indexes;
134 views::View* CreateOtherProfilesView(const Indexes& avatars_to_show);
|
| /art/compiler/optimizing/ |
| ssa_liveness_analysis.cc | 190 for (uint32_t idx : live_in->Indexes()) {
246 for (uint32_t idx : live_in->Indexes()) {
|
| /external/chromium_org/tools/python/google/httpd_config/ |
| httpd2_mac.conf | 48 Options Indexes FollowSymLinks MultiViews ExecCGI Includes
|
| httpd.conf | 330 # This may also be "None", "All", or any combination of "Indexes",
336 Options Indexes FollowSymLinks MultiViews ExecCGI Includes
|
| httpd2.conf | 99 Options Indexes FollowSymLinks MultiViews ExecCGI Includes
|
| /external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
| drag_selector.js | 42 * Indexes of selected items by dragging at the last update.
49 * Indexes of selected items at the start of dragging.
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCalls.cpp | 784 uint32_t Indexes[8];
792 Indexes[I] = Index;
796 Indexes[I] = 0;
806 Indexes[I] += Size / 2;
809 ConstantDataVector::get(V->getContext(), makeArrayRef(Indexes, Size));
[all...] |
