Home
last modified time | relevance | path

Searched refs:range (Results 1 – 25 of 51) sorted by relevance

123

/art/compiler/optimizing/
Dlive_ranges_test.cc69 LiveRange* range = interval->GetFirstRange(); in TEST_F() local
70 ASSERT_EQ(2u, range->GetStart()); in TEST_F()
72 ASSERT_EQ(8u, range->GetEnd()); in TEST_F()
76 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
113 LiveRange* range = interval->GetFirstRange(); in TEST_F() local
114 ASSERT_EQ(2u, range->GetStart()); in TEST_F()
116 ASSERT_EQ(22u, range->GetEnd()); in TEST_F()
120 ASSERT_TRUE(range->GetNext() == nullptr); in TEST_F()
161 LiveRange* range = interval->GetFirstRange(); in TEST_F() local
162 ASSERT_EQ(4u, range->GetStart()); in TEST_F()
[all …]
Dlive_interval_test.cc290 LiveRange* range = interval->GetFirstRange(); in TEST() local
291 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
292 ASSERT_EQ(range->GetStart(), 0u); in TEST()
293 ASSERT_EQ(range->GetEnd(), 8u); in TEST()
301 LiveRange* range = interval->GetFirstRange(); in TEST() local
302 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
303 ASSERT_EQ(range->GetStart(), 0u); in TEST()
304 ASSERT_EQ(range->GetEnd(), 8u); in TEST()
312 LiveRange* range = interval->GetFirstRange(); in TEST() local
313 ASSERT_TRUE(range->GetNext() == nullptr); in TEST()
[all …]
Dbounds_check_elimination.cc320 virtual ValueRange* Narrow(ValueRange* range) { in Narrow() argument
321 if (range == nullptr) { in Narrow()
325 if (range->IsMonotonicValueRange()) { in Narrow()
331 ValueBound::NarrowLowerBound(lower_, range->lower_), in Narrow()
332 ValueBound::NarrowUpperBound(upper_, range->upper_)); in Narrow()
405 ValueRange* Narrow(ValueRange* range) override { in Narrow() argument
406 if (range == nullptr) { in Narrow()
409 DCHECK(!range->IsMonotonicValueRange()); in Narrow()
413 ValueBound lower = ValueBound::NarrowLowerBound(bound_, range->GetLower()); in Narrow()
428 ValueBound upper_bound = range->GetUpper(); in Narrow()
[all …]
Dregister_allocation_resolver.cc327 LiveRange* range = current->GetFirstRange(); in ConnectSiblings() local
328 while (range != nullptr) { in ConnectSiblings()
331 size_t range_begin = range->GetStart(); in ConnectSiblings()
332 size_t range_end = range->GetEnd() + 1u; in ConnectSiblings()
339 DCHECK(current->CoversSlow(use.GetPosition()) || (use.GetPosition() == range->GetEnd())); in ConnectSiblings()
365 || (env_use.GetPosition() == range->GetEnd())); in ConnectSiblings()
371 range = range->GetNext(); in ConnectSiblings()
/art/test/701-easy-div-rem/
DgenMain.py22 [('CheckDiv', 'idiv_by_pow2_', [2**i for i in range(upper_bound_int_pow2)]),
23 ('CheckDiv', 'idiv_by_pow2_neg_', [-2**i for i in range(upper_bound_int_pow2_neg)]),
24 ('CheckDiv', 'idiv_by_constant_', [i for i in range(1, upper_bound_constant)]),
25 ('CheckDiv', 'idiv_by_constant_neg_', [-i for i in range(1, upper_bound_constant)]),
26 ('CheckRem', 'irem_by_pow2_', [2**i for i in range(upper_bound_int_pow2)]),
27 ('CheckRem', 'irem_by_pow2_neg_', [-2**i for i in range(upper_bound_int_pow2_neg)]),
28 ('CheckRem', 'irem_by_constant_', [i for i in range(1, upper_bound_constant)]),
29 ('CheckRem', 'irem_by_constant_neg_', [-i for i in range(1, upper_bound_constant)])]),
31 [('CheckDiv', 'ldiv_by_pow2_', [2**i for i in range(upper_bound_long_pow2)]),
32 ('CheckDiv', 'ldiv_by_pow2_neg_', [-2**i for i in range(upper_bound_long_pow2_neg)]),
[all …]
/art/libartbase/base/
Dmemory_type_table.h117 for (const auto& range : ranges_) { in Print() local
118 os << range << std::endl; in Print()
176 std::ostream& operator<<(std::ostream& os, const MemoryTypeRange<T>& range) {
177 os << reinterpret_cast<void*>(range.Start())
179 << reinterpret_cast<void*>(range.Limit())
181 << range.Type();
192 bool MemoryTypeTable<T>::Builder::Add(const MemoryTypeRange<T>& range) { in Add() argument
193 if (UNLIKELY(!range.IsValid() || range.Size() == 0u)) { in Add()
200 succ = ranges_.lower_bound(range.Limit()); in Add()
216 DCHECK_GE(succ->second.Limit(), range.Start()); in Add()
[all …]
Dmemory_type_table_test.cc25 TEST(memory_type_range, range) { in TEST() argument
174 MemoryTypeRange<int> range(0x1000u, 0x2000u, 0); in TEST() local
176 EXPECT_EQ(builder.Add(range), true); in TEST()
177 EXPECT_EQ(builder.Lookup(range.Start() - 1u), nullptr); in TEST()
180 const MemoryTypeRange<int>* first = builder.Lookup(range.Start()); in TEST()
182 EXPECT_EQ(range, *first); in TEST()
184 const MemoryTypeRange<int>* last = builder.Lookup(range.Limit() - 1u); in TEST()
186 EXPECT_EQ(range, *last); in TEST()
188 EXPECT_EQ(builder.Lookup(range.Limit()), nullptr); in TEST()
199 for (const auto& range : ranges) { in TEST() local
[all …]
Dtransform_iterator.h171 auto MakeTransformRange(BaseRange& range, Function f) { in MakeTransformRange() argument
172 return MakeIterationRange(MakeTransformIterator(range.begin(), f), in MakeTransformRange()
173 MakeTransformIterator(range.end(), f)); in MakeTransformRange()
Dbit_table.h312 auto range = dedup_.equal_range(hash);
313 for (auto it = range.first; it != range.second; ++it) {
425 auto range = dedup_.equal_range(hash); in Dedup() local
426 for (auto it = range.first; it != range.second; ++it) { in Dedup()
/art/dexlayout/
Dcompact_dex_writer.h74 size_t operator()(const HashedMemoryRange& range) const { in operator()
75 DCHECK_LE(range.offset_ + range.length_, section_->Size()); in operator()
76 return HashBytes(Data() + range.offset_, range.length_); in operator()
/art/runtime/gc/accounting/
Dspace_bitmap_test.cc113 for (const std::pair<uintptr_t, uintptr_t>& range : ranges) { in TEST_F() local
114 const mirror::Object* obj_begin = reinterpret_cast<mirror::Object*>(heap_begin + range.first); in TEST_F()
115 const mirror::Object* obj_end = reinterpret_cast<mirror::Object*>(heap_begin + range.second); in TEST_F()
118 for (uintptr_t i = 0; i < range.first; i += kObjectAlignment) { in TEST_F()
121 for (uintptr_t i = range.second; i < range.second + kPageSize; i += kObjectAlignment) { in TEST_F()
125 for (uintptr_t i = range.first; i < range.second; i += kObjectAlignment) { in TEST_F()
/art/test/412-new-array/smali/
Dfilled_new_array.smali28 filled-new-array/range {v1 .. v3}, [I
35 filled-new-array/range {v1 .. v2}, [Ljava/lang/Object;
42 filled-new-array/range {v1 .. v2}, [[I
/art/runtime/gc/
Dtask_processor.cc82 auto range = tasks_.equal_range(task); in UpdateTargetRunTime() local
83 for (auto it = range.first; it != range.second; ++it) { in UpdateTargetRunTime()
/art/test/961-default-iface-resolution-gen/util-src/
Dgenerate_java.py303 for i in range(MAX_IFACE_DEPTH + 1)]
329 for i in range(len(all_supers) + 1):
333 for i in range(len(split)):
342 for i in range(len(all_supers) + 1):
346 for num in range(1, MAX_IFACE_DEPTH):
/art/tools/bisection_search/
Dbisection_test.py46 _METHODS = ['method_{0}'.format(i) for i in range(_METHODS_COUNT)]
47 _PASSES = ['pass_{0}'.format(i) for i in range(_PASSES_COUNT)]
/art/test/573-checker-checkcast-regression/
Dinfo.txt3 art::x86_64::NearLabel, the range of which was sometimes too short
/art/tools/checker/common/
Dlogger.py22 NoOutput, Error, Info = range(3)
25 Default, Blue, Gray, Purple, Red, Green = range(6)
/art/test/utils/python/testgen/
Dutils.py76 for i in range(len(prev)):
/art/tools/
Dfindbuildbotwarnings.py47 for build_num in range(-2, -2 - NUM_BUILDS, -1):
/art/test/964-default-iface-init-gen/util-src/
Dgenerate_java.py357 for i in range(MAX_IFACE_DEPTH + 1)]
363 for num in range(1, MAX_IFACE_DEPTH + 1):
370 for i in range(len(set(dump_tree(supers)) - set(supers))):
/art/tools/jfuzz/
Drun_jfuzz_test_nightly.py51 output_files = [TemporaryFile('wb+') for _ in range(args.num_proc)]
/art/tools/checker/file_format/checker/
Dstruct.py78 InOrder, NextLine, DAG, Not, Eval = range(5)
122 PlainText, Pattern, VarRef, VarDef, Separator = range(5)
/art/tools/checker/match/
Dfile.py57 for i in range(scope.start, scope.end):
91 for i in range(scope.start, scope.end):
/art/test/648-many-direct-methods/util-src/
Dgenerate_java.py124 for i in range(1, NUM_TEST_METHODS + 1):
/art/tools/checker/file_format/c1visualizer/
Dparser.py22 OutsideBlock, InsideCompilationBlock, StartingCfgBlock, InsideCfgBlock = range(4)

123