Home
last modified time | relevance | path

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

12345678910

/art/test/626-const-class-linking/
Dexpected-stdout.txt2 first: Helper1 class loader: DelegatingLoader
4 first: Helper1 class loader: DelegatingLoader
7 first: Helper1 class loader: DelegatingLoader
9 first: Helper2 class loader: DelegatingLoader
12 first: Helper1 class loader: RacyLoader
14 first: Helper1 class loader: RacyLoader
16 first: Helper1 class loader: RacyLoader
18 first: Helper1 class loader: RacyLoader
24 first: Helper1 class loader: RacyLoader
26 first: Helper1 class loader: RacyLoader
[all …]
/art/test/626-const-class-linking/src/
DClassPair.java18 public Class<?> first; field in ClassPair
21 public ClassPair(Class<?> first, Class<?> second) { in ClassPair() argument
22 this.first = first; in ClassPair()
27 String first_loader_name = first.getClassLoader().getClass().getName(); in print()
28 System.out.println("first: " + first.getName() + " class loader: " + first_loader_name); in print()
/art/runtime/base/
Datomic_pair.h31 constexpr AtomicPair() : first(0), second(0) { } in AtomicPair()
32 AtomicPair(IntType f, IntType s) : first(f), second(s) { } in AtomicPair()
36 IntType first; member
58 uint64_t first, second; in AtomicPairLoadAcquire() local
61 : "=&a"(first), "=&d"(second) in AtomicPairLoadAcquire()
64 return {first, second}; in AtomicPairLoadAcquire()
69 uint64_t first, second; in AtomicPairStoreRelease() local
76 : "=&a"(first), "=&d"(second) in AtomicPairStoreRelease()
77 : "r"(target), "b"(value.first), "c"(value.second) in AtomicPairStoreRelease()
Dmem_map_arena_pool.cc137 void MemMapArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument
139 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()
146 while (first != nullptr) { in FreeArenaChain()
147 Arena* next = first->next_; in FreeArenaChain()
148 delete first; in FreeArenaChain()
149 first = next; in FreeArenaChain()
154 if (first != nullptr) { in FreeArenaChain()
155 Arena* last = first; in FreeArenaChain()
161 free_arenas_ = first; in FreeArenaChain()
/art/compiler/debug/
Delf_symtab_writer.h58 const MethodDebugInfo* first = methods.front(); in GetDedupedName() local
59 auto is_same_class = [&first](const MethodDebugInfo* mi) { in GetDedupedName()
61 return mi->dex_file == first->dex_file && mi->class_def_index == first->class_def_index; in GetDedupedName()
63 auto is_same_method_name = [&first](const MethodDebugInfo* mi) { in GetDedupedName()
65 first->dex_file->GetMethodName(first->dex_method_index)) == 0; in GetDedupedName()
73 auto& dex_class_def = first->dex_file->GetClassDef(first->class_def_index); in GetDedupedName()
74 AppendPrettyDescriptor(first->dex_file->GetClassDescriptor(dex_class_def), &*out); in GetDedupedName()
80 *out += first->dex_file->GetMethodName(first->dex_method_index); in GetDedupedName()
163 uint64_t dex_address = dex->GetAddress() + it.first /* offset within the section */; in WriteDebugSymbols()
/art/test/676-proxy-jit-at-first-use/
DAndroid.bp3 // Build rules for ART run-test `676-proxy-jit-at-first-use`.
16 name: "art-run-test-676-proxy-jit-at-first-use",
21 ":art-run-test-676-proxy-jit-at-first-use-expected-stdout",
22 ":art-run-test-676-proxy-jit-at-first-use-expected-stderr",
28 name: "art-run-test-676-proxy-jit-at-first-use-expected-stdout",
29 out: ["art-run-test-676-proxy-jit-at-first-use-expected-stdout.txt"],
36 name: "art-run-test-676-proxy-jit-at-first-use-expected-stderr",
37 out: ["art-run-test-676-proxy-jit-at-first-use-expected-stderr.txt"],
/art/test/1906-suspend-list-me-first/
DAndroid.bp3 // Build rules for ART run-test `1906-suspend-list-me-first`.
16 name: "art-run-test-1906-suspend-list-me-first",
21 ":art-run-test-1906-suspend-list-me-first-expected-stdout",
22 ":art-run-test-1906-suspend-list-me-first-expected-stderr",
28 name: "art-run-test-1906-suspend-list-me-first-expected-stdout",
29 out: ["art-run-test-1906-suspend-list-me-first-expected-stdout.txt"],
36 name: "art-run-test-1906-suspend-list-me-first-expected-stderr",
37 out: ["art-run-test-1906-suspend-list-me-first-expected-stderr.txt"],
/art/libartbase/base/
Dbit_vector_test.cc175 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
181 bool changed = first.UnionIfNotIn(&second, &third); in TEST()
182 EXPECT_EQ(0u, first.NumSetBits()); in TEST()
187 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
192 bool changed = first.UnionIfNotIn(&second, &third); in TEST()
193 EXPECT_EQ(1u, first.NumSetBits()); in TEST()
195 EXPECT_TRUE(first.IsBitSet(64)); in TEST()
201 BitVector first(2, true, Allocator::GetMallocAllocator()); in TEST() local
204 EXPECT_TRUE(first.IsSubsetOf(&second)); in TEST()
206 EXPECT_TRUE(first.IsSubsetOf(&second)); in TEST()
[all …]
Dmalloc_arena_pool.cc134 void MallocArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument
136 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()
143 while (first != nullptr) { in FreeArenaChain()
144 Arena* next = first->next_; in FreeArenaChain()
145 delete first; in FreeArenaChain()
146 first = next; in FreeArenaChain()
151 if (first != nullptr) { in FreeArenaChain()
152 Arena* last = first; in FreeArenaChain()
158 free_arenas_ = first; in FreeArenaChain()
Dhash_map.h34 return hash_fn_(pair.first); in operator()
45 return pred_fn_(a.first, b.first); in operator()
50 return pred_fn_(a.first, element); in operator()
64 return item.first == Key(); in IsEmpty()
92 auto res = Base::insert({ k, v }).first; in Overwrite()
Dsafe_map.h78 iterator erase(iterator first, iterator last) { return map_.erase(first, last); } in erase() argument
116 return result.first; in Put()
121 return result.first; in Put()
127 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
128 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
133 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
134 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
145 result.first->second = v; in Overwrite()
147 return result.first; in Overwrite()
155 if (lb != end() && !key_comp()(k, lb->first)) { in GetOrCreate()
Dintrusive_forward_list.h148 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { in IntrusiveForwardList() argument
149 insert_after(before_begin(), first, last); in IntrusiveForwardList()
183 void assign(InputIterator first, InputIterator last) { in assign() argument
184 IntrusiveForwardList tmp(first, last); in assign()
201 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
202 while (first != last) { in insert_after()
203 position = insert_after(position, *first++); in insert_after()
252 const_iterator first, in splice_after() argument
255 DCHECK(first != last); in splice_after()
256 if (++const_iterator(first) == last) { in splice_after()
[all …]
Ddchecked_vector.h69 dchecked_vector(InputIterator first,
72 : Base(first, last, alloc) { } in Base() argument
159 iterator insert(const_iterator position, InputIterator first, InputIterator last) { in insert() argument
161 return Base::insert(position, first, last); in insert()
177 iterator erase(const_iterator first, const_iterator last) { in erase() argument
178 DCHECK(cbegin() <= first && first <= cend()); in erase()
179 DCHECK(first <= last && last <= cend()); in erase()
180 return Base::erase(first, last); in erase()
/art/test/170-interface-init/src/
DMain.java28 final CountDownLatch first = new CountDownLatch(1); in main() local
35 first.countDown(); in main()
44 first.await(); in main()
/art/compiler/optimizing/
Dpretty_printer.h46 bool first = true; in PrintPostInstruction() local
48 if (first) { in PrintPostInstruction()
49 first = false; in PrintPostInstruction()
59 bool first = true; in PrintPostInstruction() local
61 if (first) { in PrintPostInstruction()
62 first = false; in PrintPostInstruction()
Ddead_code_elimination.cc349 HInstruction* first = block->GetFirstInstruction(); in SimplifyIfs() local
354 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
357 first->IsCondition() && in SimplifyIfs()
358 HasInput(first->AsCondition(), block->GetFirstPhi()) && in SimplifyIfs()
359 (first->GetNext() == last) && in SimplifyIfs()
360 (last->InputAt(0) == first) && in SimplifyIfs()
361 first->HasOnlyOneNonEnvironmentUse(); in SimplifyIfs()
366 bool phi_input_is_left = (first->InputAt(0) == phi); in SimplifyIfs()
381 value_to_check = Evaluate(first->AsCondition(), input, first->InputAt(1)); in SimplifyIfs()
383 value_to_check = Evaluate(first->AsCondition(), first->InputAt(0), input); in SimplifyIfs()
[all …]
/art/tools/create_minidebuginfo/
Dcreate_minidebuginfo.cc85 std::string_view name = entry.first; in WriteMinidebugInfo()
108 new_cie_offset[cie] = it.first->second; in WriteMinidebugInfo()
117 lhs.first->data() + opcode_offset, lhs.first->data() + lhs.first->size(), in WriteMinidebugInfo()
118 rhs.first->data() + opcode_offset, rhs.first->data() + rhs.first->size()); in WriteMinidebugInfo()
122 const FDE* fde = entry.first; in WriteMinidebugInfo()
/art/libdexfile/dex/
Dtest_dex_file_builder.h74 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; in AddMethod()
75 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. in AddMethod()
108 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */;
127 size_t num_args = entry.first.args.size();
168 CHECK_LT(entry.first.size(), 128u);
170 dex_file_data[raw_offset] = static_cast<uint8_t>(entry.first.size());
171 std::memcpy(&dex_file_data[raw_offset + 1], entry.first.c_str(), entry.first.size() + 1);
180 GetStringIdx(entry.first));
185 size_t num_args = entry.first.args.size();
189 Write32(dex_file_data, raw_offset + 0u, GetStringIdx(entry.first.shorty));
[all …]
/art/tools/dexfuzz/src/dexfuzz/
DMutationStats.java62 boolean first = true; in getStatsString()
64 if (!first) { in getStatsString()
67 first = false; in getStatsString()
/art/runtime/
Dcha_test.cc48 ASSERT_EQ(dependents[0].first, METHOD2); in TEST_F()
56 ASSERT_EQ(dependents[0].first, METHOD2); in TEST_F()
58 ASSERT_EQ(dependents[1].first, METHOD3); in TEST_F()
68 ASSERT_EQ(dependents[0].first, METHOD3); in TEST_F()
84 ASSERT_EQ(dependents[0].first, METHOD1); in TEST_F()
/art/tools/jvmti-agents/chain-agents/
Dchainagents.cc57 std::string first(source.substr(0, source.find(delim))); in Split() local
59 return std::pair(first, ""); in Split()
61 return std::pair(first, source.substr(source.find(delim) + 1)); in Split()
70 void* handle = dlopen(lib_and_args.first.c_str(), RTLD_LAZY); in Load()
108 PLOG(WARNING) << "Failed to load library " << lib_and_args.first in AgentStart()
/art/test/092-locale/
Dexpected-stdout.txt2 USA: first=1, name=Sunday
4 France: first=2, name=lundi
/art/libelffile/dwarf/
Ddebug_abbrev_writer.h70 uint32_t abbrev_code = it.first->second; in EndAbbrev()
72 const Vector& abbrev = it.first->first; in EndAbbrev()
/art/tools/veridex/
Dhidden_api_finder.cc185 const auto& name = pair.first; in Dump()
189 hiddenapi::ApiList api_list = hidden_api_.GetApiList(pair.first); in Dump()
191 os << "#" << ++stats->count << ": Linking " << api_list << " " << pair.first << " use(s):"; in Dump()
201 const auto& name = pair.first; in Dump()
205 hiddenapi::ApiList api_list = hidden_api_.GetApiList(pair.first); in Dump()
209 os << "#" << ++stats->count << ": Linking " << api_list << " " << pair.first << " use(s):"; in Dump()
254 os << kPrefix << pair.first; in DumpReferences()
/art/tools/
Dhost_bcp.sh20 host_bcp <image> [--use-first-dir] | xargs <art-host-tool> ...
26 If --use-first-dir is specified, the script will use the first apex dir instead

12345678910