| /art/test/626-const-class-linking/ |
| D | expected.txt | 2 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/ |
| D | ClassPair.java | 18 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/ |
| D | bit_vector_test.cc | 146 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 …]
|
| D | hash_map.h | 32 return fn_(pair.first); in operator()
40 return fn_(a.first, b.first); in operator()
44 return fn_(a.first, element); in operator()
|
| D | dchecked_vector.h | 69 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()
|
| D | arena_allocator.cc | 127 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, in Dump() argument
132 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { in Dump()
344 void ArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument
346 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()
353 while (first != nullptr) { in FreeArenaChain()
354 Arena* next = first->next_; in FreeArenaChain()
355 delete first; in FreeArenaChain()
356 first = next; in FreeArenaChain()
361 if (first != nullptr) { in FreeArenaChain()
362 Arena* last = first; in FreeArenaChain()
[all …]
|
| /art/compiler/optimizing/ |
| D | dead_code_elimination.cc | 187 HInstruction* first = block->GetFirstInstruction(); in SimplifyIfs() local
192 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
195 first->IsCondition() && in SimplifyIfs()
196 HasInput(first->AsCondition(), block->GetFirstPhi()) && in SimplifyIfs()
197 (first->GetNext() == last) && in SimplifyIfs()
198 (last->InputAt(0) == first) && in SimplifyIfs()
199 first->HasOnlyOneNonEnvironmentUse(); in SimplifyIfs()
204 bool phi_input_is_left = (first->InputAt(0) == phi); in SimplifyIfs()
219 value_to_check = Evaluate(first->AsCondition(), input, first->InputAt(1)); in SimplifyIfs()
221 value_to_check = Evaluate(first->AsCondition(), first->InputAt(0), input); in SimplifyIfs()
[all …]
|
| D | pretty_printer.h | 46 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()
|
| D | optimizing_unit_test.h | 116 std::string::size_type pos = result.find(p.first); in Patch()
118 << "Could not find: \"" << p.first << "\" in \"" << result << "\""; in Patch()
119 result.replace(pos, p.first.size(), p.second); in Patch()
|
| /art/compiler/utils/ |
| D | test_dex_file_builder.h | 40 auto it = strings_.emplace(str, IdxAndDataOffset()).first; in AddString()
41 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. in AddString()
72 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; in AddMethod()
73 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. in AddMethod()
107 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; in Build()
126 size_t num_args = entry.first.args.size(); in Build()
168 CHECK_LT(entry.first.size(), 128u); in Build()
170 dex_file_data_[raw_offset] = static_cast<uint8_t>(entry.first.size()); in Build()
171 std::memcpy(&dex_file_data_[raw_offset + 1], entry.first.c_str(), entry.first.size() + 1); in Build()
176 Write32(type_ids_offset + entry.second * sizeof(DexFile::TypeId), GetStringIdx(entry.first)); in Build()
[all …]
|
| D | intrusive_forward_list.h | 148 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 …]
|
| /art/test/597-deopt-new-string/ |
| D | deopt.cc | 38 static bool first = true; in Java_Main_deoptimizeAll() local
39 if (first) { in Java_Main_deoptimizeAll()
42 first = false; in Java_Main_deoptimizeAll()
|
| /art/tools/dexfuzz/src/dexfuzz/ |
| D | MutationStats.java | 62 boolean first = true; in getStatsString()
64 if (!first) { in getStatsString()
67 first = false; in getStatsString()
|
| /art/runtime/ |
| D | cha_test.cc | 48 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()
|
| D | class_reference.h | 36 return (lhs.first < rhs.first);
|
| D | safe_map.h | 98 return result.first; in Put()
103 return result.first; in Put()
109 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
110 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
115 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
116 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
127 result.first->second = v; in Overwrite()
129 return result.first; in Overwrite()
137 if (lb != end() && !key_comp()(k, lb->first)) { in GetOrCreate()
|
| D | imtable_test.cc | 82 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/ |
| D | expected.txt | 2 USA: first=1, name=Sunday
4 France: first=2, name=lundi
|
| /art/compiler/debug/dwarf/ |
| D | debug_abbrev_writer.h | 70 uint32_t abbrev_code = it.first->second; in EndAbbrev()
72 const Vector& abbrev = it.first->first; in EndAbbrev()
|
| /art/compiler/utils/arm/ |
| D | assembler_arm_test.h | 97 bool first = true; in RepeatTemplatedRRIIC() local
146 if (first) { in RepeatTemplatedRRIIC()
147 first = false; in RepeatTemplatedRRIIC()
188 bool first = true; in RepeatTemplatedRRiiC() local
198 Imm i = pair.first; in RepeatTemplatedRRiiC()
238 if (first) { in RepeatTemplatedRRiiC()
239 first = false; in RepeatTemplatedRRiiC()
274 bool first = true; in RepeatTemplatedRRC() local
301 if (first) { in RepeatTemplatedRRC()
302 first = false; in RepeatTemplatedRRC()
[all …]
|
| /art/test/996-breakpoint-obsolete/ |
| D | expected.txt | 3 Should be after first breakpoint.
9 Should be after first breakpoint.
|
| /art/compiler/linker/x86/ |
| D | relative_patcher_x86_test.cc | 33 CHECK(result.first); in GetMethodOffset()
98 ASSERT_TRUE(result.first); in TEST_F()
129 ASSERT_TRUE(result.first); in TEST_F()
161 ASSERT_TRUE(result.first); in TEST_F()
|
| /art/compiler/linker/x86_64/ |
| D | relative_patcher_x86_64_test.cc | 37 CHECK(result.first); in GetMethodOffset()
118 ASSERT_TRUE(result.first); in TEST_F()
142 ASSERT_TRUE(result.first); in TEST_F()
166 ASSERT_TRUE(result.first); in TEST_F()
|
| /art/test/504-regression-baseline-entry/smali/ |
| D | Test.smali | 24 :first
29 goto :first
|
| /art/runtime/interpreter/ |
| D | lock_count_data.cc | 97 mirror::Object* first = (*monitors_)[0]; in CheckAllMonitorsReleasedOrThrow() local
100 mirror::Object::PrettyTypeOf(first).c_str()); in CheckAllMonitorsReleasedOrThrow()
|