/art/test/504-regression-baseline-entry/smali/ |
H A D | Test.smali | 24 :first 29 goto :first
|
/art/runtime/ |
H A D | class_reference.h | 36 return (lhs.first < rhs.first);
|
H A D | reference_table.cc | 119 // Compare GC roots, first by class, then size, then address. 159 int first = count - kLast; local 160 if (first < 0) { 161 first = 0; 163 os << " Last " << (count - first) << " entries (of " << count << "):\n"; 165 for (int idx = count - 1; idx >= first; --idx) {
|
H A D | profiler.cc | 158 // Add a random delay for the first time run so that we don't hammer the CPU 451 ArtMethod* method = stack.front().first; 483 // Add a method to the profile table. If it's the first time the method 520 ArtMethod* method = inst_loc.first; 580 ArtMethod *method = meth_iter.first; 605 MethodReference method = method_iter.first; 639 PreviousContextMap::iterator ci = new_context_map.find(context_i.first); 641 new_context_map[context_i.first] = count; 654 context_count_vector.push_back(StringPrintf("%u:%u:%s", context_i.first.first, [all...] |
H A D | safe_map.h | 93 return result.first; 99 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); 111 result.first->second = v;
|
/art/runtime/base/ |
H A D | bit_vector_test.cc | 146 BitVector first(2, true, Allocator::GetMallocAllocator()); 152 bool changed = first.UnionIfNotIn(&second, &third); 153 EXPECT_EQ(0u, first.NumSetBits()); 158 BitVector first(2, true, Allocator::GetMallocAllocator()); 163 bool changed = first.UnionIfNotIn(&second, &third); 164 EXPECT_EQ(1u, first.NumSetBits()); 166 EXPECT_TRUE(first.IsBitSet(64)); 172 BitVector first(2, true, Allocator::GetMallocAllocator()); 175 EXPECT_TRUE(first.IsSubsetOf(&second)); 177 EXPECT_TRUE(first [all...] |
H A D | hash_map.h | 32 return fn_(pair.first); 40 return fn_(a.first, b.first); 44 return fn_(a.first, element);
|
H A D | iteration_range.h | 25 // range [first, last) defined by two iterators. 35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
|
H A D | arena_allocator.cc | 93 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, argument 98 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { 219 void ArenaPool::FreeArenaChain(Arena* first) { argument 221 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { 225 if (first != nullptr) { 226 Arena* last = first; 233 free_arenas_ = first;
|
H A D | arena_allocator.h | 88 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const { argument 89 UNUSED(os); UNUSED(first); UNUSED(lost_bytes_adjustment); 104 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const; 186 void FreeArenaChain(Arena* first) LOCKS_EXCLUDED(lock_);
|
/art/compiler/optimizing/ |
H A D | pretty_printer.h | 44 bool first = true; local 46 if (first) { 47 first = false; 57 bool first = true; local 59 if (first) { 60 first = false;
|
H A D | optimizing_unit_test.h | 104 std::string::size_type pos = result.find(p.first); 106 result.replace(pos, p.first.size(), p.second);
|
H A D | register_allocator_test.cc | 139 // Sibling of the first interval has no register allocated to it. 738 HInstruction* first = new (allocator) HParameterValue(0, Primitive::kPrimInt); local 740 entry->AddInstruction(first); 747 *div = new (allocator) HDiv(Primitive::kPrimInt, first, second, 0); // don't care about dex_pc. 772 // div on x86 requires its first input in eax and the output be the same as the first input. 816 LiveInterval* first = BuildInterval(ranges1, arraysize(ranges1), &allocator, -1, one); local 817 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 8, first->first_use_); 818 first [all...] |
H A D | stack_map_stream.h | 34 item.first = DexRegisterLocation::None(); 37 return item.first == DexRegisterLocation::None();
|
/art/compiler/dex/ |
H A D | post_opt_passes.cc | 56 AllNodesIterator first(mir_graph); 57 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) {
|
H A D | global_value_numbering.h | 104 if (lb != global_value_map_.end() && lb->first == key) { 118 if (lb != global_value_map_.end() && lb->first == key) { 167 return array_location_reverse_map_[location]->first.base; 172 return array_location_reverse_map_[location]->first.index; 184 if (lb != ref_set_map_.end() && !ref_set_map_.key_comp()(ref_set, lb->first)) {
|
H A D | dataflow_iterator-inl.h | 123 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { 160 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { 162 uint16_t loop_head_idx = top.first;
|
H A D | pass_me.h | 108 LOG(INFO) << "\t" << option.first << ":" << option.second; 120 LOG(INFO) << "\t" << option.first << ":" 121 << GetPassOption(option.first, overridden_options);
|
/art/tools/dexfuzz/src/dexfuzz/ |
H A D | MutationStats.java | 62 boolean first = true; 64 if (!first) { 67 first = false;
|
/art/compiler/utils/ |
H A D | test_dex_file_builder.h | 39 auto it = strings_.emplace(str, IdxAndDataOffset()).first; 40 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. 71 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; 72 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. 105 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; 124 size_t num_args = entry.first.args.size(); 167 CHECK_LT(entry.first.size(), 128u); 169 dex_file_data_[raw_offset] = static_cast<uint8_t>(entry.first.size()); 170 std::memcpy(&dex_file_data_[raw_offset + 1], entry.first.c_str(), entry.first [all...] |
H A D | swap_space.h | 87 if (lhs.first != rhs.first) { 88 return lhs.first < rhs.first;
|
/art/test/097-duplicate-method/ |
H A D | build | 28 # We set jack.import.type.policy=keep-first to consider class definitions from jasmin first. 29 ${JACK} --import jasmin.jack --import src.jack -D jack.import.type.policy=keep-first --output-dex .
|
/art/compiler/utils/arm/ |
H A D | assembler_arm_test.h | 91 bool first = true; local 140 if (first) { 141 first = false; 182 bool first = true; local 192 Imm i = pair.first; 232 if (first) { 233 first = false; 268 bool first = true; local 295 if (first) { 296 first 334 bool first = true; local 398 bool first = true; local 454 bool first = true; local [all...] |
/art/compiler/linker/x86/ |
H A D | relative_patcher_x86_test.cc | 33 CHECK(result.first); 94 ASSERT_TRUE(result.first); 121 ASSERT_TRUE(result.first);
|
/art/compiler/linker/x86_64/ |
H A D | relative_patcher_x86_64_test.cc | 35 CHECK(result.first); 104 ASSERT_TRUE(result.first); 124 ASSERT_TRUE(result.first);
|