Home
last modified time | relevance | path

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

123456789

/art/test/626-const-class-linking/
Dexpected.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/libartbase/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 …]
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.h32 return fn_(pair.first); in operator()
40 return fn_(a.first, b.first); in operator()
44 return fn_(a.first, element); in operator()
Dsafe_map.h97 return result.first; in Put()
102 return result.first; in Put()
108 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
109 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
114 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
115 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
126 result.first->second = v; in Overwrite()
128 return result.first; in Overwrite()
136 if (lb != end() && !key_comp()(k, lb->first)) { in GetOrCreate()
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/runtime/base/
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/optimizing/
Ddead_code_elimination.cc243 HInstruction* first = block->GetFirstInstruction(); in SimplifyAlwaysThrows() local
246 if (first->AlwaysThrows() && in SimplifyAlwaysThrows()
247 first->GetNext() == last && in SimplifyAlwaysThrows()
327 HInstruction* first = block->GetFirstInstruction(); in SimplifyIfs() local
332 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
335 first->IsCondition() && in SimplifyIfs()
336 HasInput(first->AsCondition(), block->GetFirstPhi()) && in SimplifyIfs()
337 (first->GetNext() == last) && in SimplifyIfs()
338 (last->InputAt(0) == first) && in SimplifyIfs()
339 first->HasOnlyOneNonEnvironmentUse(); in SimplifyIfs()
[all …]
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()
/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/libdexfile/dex/
Dtest_dex_file_builder.h43 auto it = strings_.emplace(str, IdxAndDataOffset()).first; in AddString()
44 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. in AddString()
75 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; in AddMethod()
76 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. in AddMethod()
110 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; in Build()
129 size_t num_args = entry.first.args.size(); in Build()
171 CHECK_LT(entry.first.size(), 128u); in Build()
173 dex_file_data_[raw_offset] = static_cast<uint8_t>(entry.first.size()); in Build()
174 std::memcpy(&dex_file_data_[raw_offset + 1], entry.first.c_str(), entry.first.size() + 1); in Build()
179 Write32(type_ids_offset + entry.second * sizeof(dex::TypeId), GetStringIdx(entry.first)); in Build()
[all …]
/art/test/597-deopt-new-string/
Ddeopt.cc39 static bool first = true; in Java_Main_deoptimizeAll() local
40 if (first) { in Java_Main_deoptimizeAll()
43 first = false; in Java_Main_deoptimizeAll()
/art/compiler/utils/
Dintrusive_forward_list.h149 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { in IntrusiveForwardList() argument
150 insert_after(before_begin(), first, last); in IntrusiveForwardList()
184 void assign(InputIterator first, InputIterator last) { in assign() argument
185 IntrusiveForwardList tmp(first, last); in assign()
202 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument
203 while (first != last) { in insert_after()
204 position = insert_after(position, *first++); in insert_after()
253 const_iterator first, in splice_after() argument
256 DCHECK(first != last); in splice_after()
257 if (++const_iterator(first) == last) { in splice_after()
[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()
Dimtable_test.cc82 classes.first->FindDeclaredVirtualMethodByName(method_name, pointer_size); in LoadMethods()
94 CHECK_EQ(ImTable::GetImtIndex(methods.first), ImTable::GetImtIndex(methods.second)); in TEST_F()
101 CHECK_EQ(ImTable::GetImtIndex(methods.first), ImTable::GetImtIndex(methods.second)); in TEST_F()
/art/test/092-locale/
Dexpected.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/test/996-breakpoint-obsolete/
Dexpected.txt3 Should be after first breakpoint.
9 Should be after first breakpoint.
/art/runtime/gc/collector/
Dgarbage_collector.cc105 return std::less()(a.first, b.first); in ExtractRssFromMincore()
115 if (it->second == next_it->first) { in ExtractRssFromMincore()
122 size_t length = static_cast<uint8_t*>(it->second) - static_cast<uint8_t*>(it->first); in ExtractRssFromMincore()
128 size_t length = static_cast<uint8_t*>(it.second) - static_cast<uint8_t*>(it.first); in ExtractRssFromMincore()
129 if (mincore(it.first, length, vec.get()) == 0) { in ExtractRssFromMincore()
136 LOG(WARNING) << "Call to mincore() on memory range [0x" << std::hex << it.first in ExtractRssFromMincore()
/art/dex2oat/linker/x86/
Drelative_patcher_x86_test.cc34 CHECK(result.first); in GetMethodOffset()
99 ASSERT_TRUE(result.first); in TEST_F()
130 ASSERT_TRUE(result.first); in TEST_F()
162 ASSERT_TRUE(result.first); in TEST_F()
/art/dex2oat/linker/x86_64/
Drelative_patcher_x86_64_test.cc38 CHECK(result.first); in GetMethodOffset()
119 ASSERT_TRUE(result.first); in TEST_F()
143 ASSERT_TRUE(result.first); in TEST_F()
167 ASSERT_TRUE(result.first); in TEST_F()
/art/tools/veridex/
Dhidden_api_finder.cc182 hiddenapi::ApiList api_list = hidden_api_.GetApiList(pair.first); in Dump()
185 os << "#" << ++stats->count << ": Linking " << api_list << " " << pair.first << " use(s):"; in Dump()
194 hiddenapi::ApiList api_list = hidden_api_.GetApiList(pair.first); in Dump()
197 os << "#" << ++stats->count << ": Linking " << api_list << " " << pair.first << " use(s):"; in Dump()
238 os << kPrefix << pair.first; in DumpReferences()
/art/runtime/interpreter/
Dlock_count_data.cc97 mirror::Object* first = (*monitors_)[0]; in CheckAllMonitorsReleasedOrThrow() local
100 mirror::Object::PrettyTypeOf(first).c_str()); in CheckAllMonitorsReleasedOrThrow()

123456789