Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 120) sorted by relevance

12345

/art/runtime/base/
Dbit_vector_test.cc146 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
152 bool changed = first.UnionIfNotIn(&second, &third); in TEST()
153 EXPECT_EQ(0u, first.NumSetBits()); in TEST()
158 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
163 bool changed = first.UnionIfNotIn(&second, &third); in TEST()
164 EXPECT_EQ(1u, first.NumSetBits()); in TEST()
166 EXPECT_TRUE(first.IsBitSet(64)); in TEST()
172 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
175 EXPECT_TRUE(first.IsSubsetOf(&second)); in TEST()
177 EXPECT_TRUE(first.IsSubsetOf(&second)); in TEST()
[all …]
Dhash_map.h32 return fn_(pair.first); in operator()
40 return fn_(a.first, b.first); in operator()
44 return fn_(a.first, element); in operator()
Darena_allocator.cc93 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, in Dump() argument
98 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { in Dump()
219 void ArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument
221 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()
225 if (first != nullptr) { in FreeArenaChain()
226 Arena* last = first; in FreeArenaChain()
233 free_arenas_ = first; in FreeArenaChain()
Diteration_range.h35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } in IterationRange() argument
/art/compiler/utils/
Dtest_dex_file_builder.h39 auto it = strings_.emplace(str, IdxAndDataOffset()).first; in AddString()
40 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. in AddString()
71 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; in AddMethod()
72 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. in AddMethod()
105 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; in Build()
124 size_t num_args = entry.first.args.size(); in Build()
167 CHECK_LT(entry.first.size(), 128u); in Build()
169 dex_file_data_[raw_offset] = static_cast<uint8_t>(entry.first.size()); in Build()
170 std::memcpy(&dex_file_data_[raw_offset + 1], entry.first.c_str(), entry.first.size() + 1); in Build()
175 Write32(type_ids_offset + entry.second * sizeof(DexFile::TypeId), GetStringIdx(entry.first)); in Build()
[all …]
Dswap_space.h87 if (lhs.first != rhs.first) { in operator()
88 return lhs.first < rhs.first; in operator()
/art/compiler/optimizing/
Dpretty_printer.h44 bool first = true; in PrintPostInstruction() local
46 if (first) { in PrintPostInstruction()
47 first = false; in PrintPostInstruction()
57 bool first = true; in PrintPostInstruction() local
59 if (first) { in PrintPostInstruction()
60 first = false; in PrintPostInstruction()
Dcode_generator_x86.cc1953 Location first = locations->InAt(0); in VisitAdd() local
1960 if (out.AsRegister<Register>() == first.AsRegister<Register>()) { in VisitAdd()
1964 first.AsRegister<Register>(), second.AsRegister<Register>(), TIMES_1, 0)); in VisitAdd()
1968 if (out.AsRegister<Register>() == first.AsRegister<Register>()) { in VisitAdd()
1971 __ leal(out.AsRegister<Register>(), Address(first.AsRegister<Register>(), value)); in VisitAdd()
1974 DCHECK(first.Equals(locations->Out())); in VisitAdd()
1975 __ addl(first.AsRegister<Register>(), Address(ESP, second.GetStackIndex())); in VisitAdd()
1982 __ addl(first.AsRegisterPairLow<Register>(), second.AsRegisterPairLow<Register>()); in VisitAdd()
1983 __ adcl(first.AsRegisterPairHigh<Register>(), second.AsRegisterPairHigh<Register>()); in VisitAdd()
1985 __ addl(first.AsRegisterPairLow<Register>(), Address(ESP, second.GetStackIndex())); in VisitAdd()
[all …]
Dregister_allocator_test.cc738 HInstruction* first = new (allocator) HParameterValue(0, Primitive::kPrimInt); in BuildDiv() local
740 entry->AddInstruction(first); in BuildDiv()
747 *div = new (allocator) HDiv(Primitive::kPrimInt, first, second, 0); // don't care about dex_pc. in BuildDiv()
816 LiveInterval* first = BuildInterval(ranges1, arraysize(ranges1), &allocator, -1, one); in TEST() local
817 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 8, first->first_use_); in TEST()
818 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 7, first->first_use_); in TEST()
819 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 6, first->first_use_); in TEST()
821 locations = new (&allocator) LocationSummary(first->GetDefinedBy(), LocationSummary::kNoCall); in TEST()
823 first = first->SplitAt(1); in TEST()
866 register_allocator.unhandled_core_intervals_.Add(first); in TEST()
[all …]
Dbuilder.cc198 HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt); in If_22t() local
200 T* comparison = new (arena_) T(first, second); in If_22t()
443 HInstruction* first = LoadLocal(instruction.VRegB(), type); in Unop_12x() local
444 current_block_->AddInstruction(new (arena_) T(type, first)); in Unop_12x()
452 HInstruction* first = LoadLocal(instruction.VRegB(), input_type); in Conversion_12x() local
453 current_block_->AddInstruction(new (arena_) HTypeConversion(result_type, first, dex_pc)); in Conversion_12x()
459 HInstruction* first = LoadLocal(instruction.VRegB(), type); in Binop_23x() local
461 current_block_->AddInstruction(new (arena_) T(type, first, second)); in Binop_23x()
469 HInstruction* first = LoadLocal(instruction.VRegB(), type); in Binop_23x() local
471 current_block_->AddInstruction(new (arena_) T(type, first, second, dex_pc)); in Binop_23x()
[all …]
/art/tools/dexfuzz/src/dexfuzz/
DMutationStats.java62 boolean first = true; in getStatsString()
64 if (!first) { in getStatsString()
67 first = false; in getStatsString()
/art/compiler/utils/arm/
Dassembler_arm_test.h91 bool first = true; in RepeatTemplatedRRIIC() local
140 if (first) { in RepeatTemplatedRRIIC()
141 first = false; in RepeatTemplatedRRIIC()
182 bool first = true; in RepeatTemplatedRRiiC() local
192 Imm i = pair.first; in RepeatTemplatedRRiiC()
232 if (first) { in RepeatTemplatedRRiiC()
233 first = false; in RepeatTemplatedRRiiC()
268 bool first = true; in RepeatTemplatedRRC() local
295 if (first) { in RepeatTemplatedRRC()
296 first = false; in RepeatTemplatedRRC()
[all …]
/art/runtime/
Dclass_reference.h36 return (lhs.first < rhs.first);
Dprofiler.cc451 ArtMethod* method = stack.front().first; in RecordStack()
520 ArtMethod* method = inst_loc.first; in PutStack()
580 ArtMethod *method = meth_iter.first; in Write()
605 MethodReference method = method_iter.first; in Write()
639 PreviousContextMap::iterator ci = new_context_map.find(context_i.first); in Write()
641 new_context_map[context_i.first] = count; in Write()
654 context_count_vector.push_back(StringPrintf("%u:%u:%s", context_i.first.first, in Write()
655 context_i.second, context_i.first.second.c_str())); in Write()
667 os << StringPrintf("%s/%u/%u\n", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write()
669 os << StringPrintf("%s/%u/%u/[", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write()
[all …]
Dreference_table.cc159 int first = count - kLast; in Dump() local
160 if (first < 0) { in Dump()
161 first = 0; in Dump()
163 os << " Last " << (count - first) << " entries (of " << count << "):\n"; in Dump()
165 for (int idx = count - 1; idx >= first; --idx) { in Dump()
Dsafe_map.h93 return result.first; in Put()
99 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); in PutBefore()
111 result.first->second = v; in Overwrite()
/art/test/092-locale/
Dexpected.txt2 USA: first=1, name=Sunday
4 France: first=2, name=lundi
/art/compiler/dex/
Dpost_opt_passes.cc56 AllNodesIterator first(mir_graph); in Start() local
57 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) { in Start()
Dglobal_value_numbering.h104 if (lb != global_value_map_.end() && lb->first == key) { in LookupValue()
118 if (lb != global_value_map_.end() && lb->first == key) { in FindValue()
167 return array_location_reverse_map_[location]->first.base; in GetArrayLocationBase()
172 return array_location_reverse_map_[location]->first.index; in GetArrayLocationIndex()
184 if (lb != ref_set_map_.end() && !ref_set_map_.key_comp()(ref_set, lb->first)) { in GetRefSetId()
Dpass_me.h108 LOG(INFO) << "\t" << option.first << ":" << option.second; in PrintPassDefaultOptions()
120 LOG(INFO) << "\t" << option.first << ":" in PrintPassOptions()
121 << GetPassOption(option.first, overridden_options); in PrintPassOptions()
Ddataflow_iterator-inl.h123 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { in Next()
160 (*loop_ends_)[loop_head_stack_->back().first] == idx_) { in Next()
162 uint16_t loop_head_idx = top.first; in Next()
/art/test/504-regression-baseline-entry/smali/
DTest.smali24 :first
29 goto :first
/art/compiler/linker/x86/
Drelative_patcher_x86_test.cc33 CHECK(result.first); in GetMethodOffset()
94 ASSERT_TRUE(result.first); in TEST_F()
121 ASSERT_TRUE(result.first); in TEST_F()
/art/compiler/linker/x86_64/
Drelative_patcher_x86_64_test.cc35 CHECK(result.first); in GetMethodOffset()
104 ASSERT_TRUE(result.first); in TEST_F()
124 ASSERT_TRUE(result.first); in TEST_F()
/art/tools/dexfuzz/src/dexfuzz/program/
DCodeTranslator.java328 MTryBlock first = mutatableCode.mutatableTries.get(i); in updateTryBlocks() local
332 if (first.endInsn.location > second.startInsn.location) { in updateTryBlocks()
335 Log.debug("1st TryBlock goes from " + first.startInsn + " to " + first.endInsn); in updateTryBlocks()
342 while (first.endInsn.location > newInsn.location) { in updateTryBlocks()
535 public int compare(MInsn first, MInsn second) { in alignDataInstructions()
536 if (first.location < second.location) { in alignDataInstructions()
538 } else if (first.location > second.location) { in alignDataInstructions()

12345