Searched refs:second (Results 1 - 25 of 100) sorted by relevance

1234

/art/test/113-multidex/src/
H A DMain.java21 Inf1 second = new Second();
22 System.out.println(second.getClass().getName());
23 second.zcall();
24 second.zcall1();
25 second.zcall2();
26 second.zcall3();
27 second.zcall4();
28 second.zcall5();
29 second.zcall6();
30 second
[all...]
/art/test/MultiDex/
H A DMain.java19 Second second = new Second();
20 System.out.println(second.getSecond());
/art/test/MultiDexModifiedSecondary/
H A DMain.java19 Second second = new Second();
20 System.out.println(second.getSecond());
/art/runtime/
H A Dclass_reference.h31 if (lhs.second < rhs.second) {
33 } else if (lhs.second > rhs.second) {
H A Dprofiler.cc495 i->second++;
525 uint32_t dex_pc = inst_loc.second;
556 TrieNodeSet* node_set = i->second;
588 uint32_t count = meth_iter.second;
594 count += pi->second.count_;
606 TrieNodeSet* node_set = method_iter.second;
634 total_count += pi->second.count_;
635 PreviousContextMap* previous_context_map = pi->second.context_map_;
638 uint32_t count = context_i.second;
643 ci->second
[all...]
H A Dtransaction.cc45 field_values_count += it.second.Size();
50 array_values_count += it.second.Size();
209 it.second.Undo(it.first);
218 it.second.Undo(it.first);
247 it.second.VisitRoots(visitor);
259 mirror::Object* new_root = pair.second;
263 object_logs_.insert(std::make_pair(new_root, old_root_it->second));
286 mirror::Array* new_root = pair.second;
290 array_logs_.insert(std::make_pair(new_root, old_root_it->second));
355 FieldValue& field_value = it.second;
[all...]
H A Dmem_map.cc58 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) {
73 MemMap* map = it->second;
342 ptr = std::max(ptr, reinterpret_cast<uintptr_t>(before_it->second->BaseEnd()));
353 ptr = reinterpret_cast<uintptr_t>(it->second->BaseEnd());
527 if (it->second == this) {
690 MemMap* map = it->second;
703 it->second->GetProtect() == map->GetProtect() &&
704 it->second->GetName() == map->GetName() &&
705 (it->second->BaseBegin() == end || num_gaps < kMaxGaps)) {
706 if (it->second
[all...]
/art/test/504-regression-baseline-entry/smali/
H A DTest.smali22 goto :second
27 :second
/art/runtime/base/
H A Dbit_vector_test.cc147 BitVector second(5, true, Allocator::GetMallocAllocator());
150 second.SetBit(64);
152 bool changed = first.UnionIfNotIn(&second, &third);
159 BitVector second(5, true, Allocator::GetMallocAllocator());
162 second.SetBit(64);
163 bool changed = first.UnionIfNotIn(&second, &third);
173 BitVector second(5, true, Allocator::GetMallocAllocator());
175 EXPECT_TRUE(first.IsSubsetOf(&second));
176 second.SetBit(4);
177 EXPECT_TRUE(first.IsSubsetOf(&second));
[all...]
H A Dstl_util.h77 delete i->second;
/art/compiler/dex/quick/
H A Ddex_file_to_method_inliner_map.cc36 delete entry.second;
46 return it->second;
/art/compiler/dex/
H A Dpost_opt_passes.cc62 AllNodesIterator second(mir_graph);
63 for (BasicBlock* bb = second.Next(); bb != nullptr; bb = second.Next()) {
H A Dverification_results.cc65 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size());
66 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size());
68 DCHECK_EQ(it->second->GetDexGcMap().size(), verified_method->GetDexGcMap().size());
83 return (it != verified_methods_.end()) ? it->second : nullptr;
90 delete it->second;
H A Dpass_me.h108 LOG(INFO) << "\t" << option.first << ":" << option.second;
175 return overridden_it->second;
184 return default_it->second;
H A Dlocal_value_numbering.cc85 ? lb->second
208 return &lb->second;
243 } else if (it->second.store_loc_set.count(location) != 0u) {
244 value_name = it->second.last_stored_value;
246 auto load_it = it->second.load_value_map.find(location);
247 if (load_it != it->second.load_value_map.end()) {
248 value_name = load_it->second;
250 value_name = Versions::LookupGlobalValue(gvn, key, location, it->second.last_load_memory_version);
268 res = lb->second;
282 if (load_values_it != values->load_value_map.end() && load_values_it->second
[all...]
/art/test/003-omnibus-opcodes/src/
H A DThrow.java90 boolean second = false;
108 second = true;
113 Main.assertTrue(second);
/art/compiler/utils/
H A Dtest_dex_file_builder.h102 entry.second.idx = string_idx;
104 entry.second.data_offset = data_section_size;
113 entry.second = type_idx;
122 entry.second.idx = proto_idx;
126 entry.second.data_offset = RoundUp(data_section_size, 4u);
127 data_section_size = entry.second.data_offset + 4u + num_args * sizeof(DexFile::TypeItem);
129 entry.second.data_offset = 0u;
138 entry.second = field_idx;
147 entry.second = method_idx;
168 uint32_t raw_offset = data_section_offset + entry.second
[all...]
H A Ddedupe_set.h62 b.in_key->second->begin(), b.in_key->second->end());
64 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
67 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
68 b.in_key->second->begin(), b.in_key->second->end());
H A Dswap_space.cc42 LOG(INFO) << " 0x" << std::hex << entry.second->Start()
43 << " size=" << std::dec << entry.second->size;
51 auto free_by_start_pos = free_by_size_pos->second;
62 DCHECK(insert_result.second);
89 sum1 += entry.second->size;
115 old_chunk = *it->second;
/art/runtime/jdwp/
H A Dobject_registry.cc126 ObjectRegistryEntry* entry = it->second;
157 const ObjectRegistryEntry* entry = pair.second;
178 ObjectRegistryEntry& entry = *it->second;
191 ObjectRegistryEntry& entry = *it->second;
200 Promote(*it->second);
208 Demote(*it->second);
238 ObjectRegistryEntry& entry = *it->second;
254 ObjectRegistryEntry* entry = it->second;
263 if (entry == inner_it->second) {
/art/compiler/linker/x86/
H A Drelative_patcher_x86_test.cc34 return result.second;
95 uint32_t diff = kTrampolineOffset - (result.second + kCallCode.size());
123 dex_cache_arrays_begin_ + kElementOffset - (result.second + anchor_offset);
/art/compiler/linker/x86_64/
H A Drelative_patcher_x86_64_test.cc36 return result.second;
105 uint32_t diff = kTrampolineOffset - (result.second + kCallCode.size());
126 dex_cache_arrays_begin_ + kElementOffset - (result.second + kDexCacheLoadCode.size());
/art/runtime/jit/
H A Djit_instrumentation.cc91 it->second += count;
92 sample_count = it->second;
/art/tools/dexfuzz/src/dexfuzz/program/
H A DCodeTranslator.java329 MTryBlock second = mutatableCode.mutatableTries.get(i + 1);
332 if (first.endInsn.location > second.startInsn.location) {
336 Log.debug("2nd TryBlock goes from " + second.startInsn + " to " + second.endInsn);
340 MInsn newInsn = second.startInsn;
346 second.startInsn = newInsn;
348 Log.debug("Now 2nd TryBlock goes from " + second.startInsn + " to " + second.endInsn);
535 public int compare(MInsn first, MInsn second) {
536 if (first.location < second
[all...]
/art/compiler/optimizing/
H A Dcode_generator_x86_64.cc2113 Location second = locations->InAt(1); local
2118 if (second.IsRegister()) {
2120 __ addl(out.AsRegister<CpuRegister>(), second.AsRegister<CpuRegister>());
2123 first.AsRegister<CpuRegister>(), second.AsRegister<CpuRegister>(), TIMES_1, 0));
2125 } else if (second.IsConstant()) {
2128 Immediate(second.GetConstant()->AsIntConstant()->GetValue()));
2131 first.AsRegister<CpuRegister>(), second.GetConstant()->AsIntConstant()->GetValue()));
2135 __ addl(first.AsRegister<CpuRegister>(), Address(CpuRegister(RSP), second.GetStackIndex()));
2141 if (second.IsRegister()) {
2143 __ addq(out.AsRegister<CpuRegister>(), second
2227 Location second = locations->InAt(1); local
2322 Location second = locations->InAt(1); local
2415 Location second = locations->InAt(1); local
2466 Location second = locations->InAt(1); local
2507 Location second = locations->InAt(1); local
2553 Location second = locations->InAt(1); local
2680 Location second = locations->InAt(1); local
2763 Location second = locations->InAt(1); local
2938 Location second = locations->InAt(1); local
4352 Location second = locations->InAt(1); local
[all...]

Completed in 364 milliseconds

1234