/art/test/626-const-class-linking/src/ |
H A D | ClassPair.java | 18 public Class<?> first; field in class:ClassPair 21 public ClassPair(Class<?> first, Class<?> second) { argument 22 this.first = first; 27 String first_loader_name = first.getClassLoader().getClass().getName(); 28 System.out.println("first: " + first.getName() + " class loader: " + first_loader_name);
|
/art/test/001-HelloWorld/src/ |
H A D | Main.java | 29 final CountDownLatch first = new CountDownLatch(1); 36 first.countDown(); 45 first.await();
|
/art/test/504-regression-baseline-entry/smali/ |
H A D | Test.smali | 24 :first 29 goto :first
|
/art/test/170-interface-init/src/ |
H A D | Main.java | 28 final CountDownLatch first = new CountDownLatch(1); 35 first.countDown(); 44 first.await();
|
/art/test/597-deopt-new-string/ |
H A D | deopt.cc | 37 // We need to suspend mutator threads first. 39 static bool first = true; local 40 if (first) { 43 first = false; 56 // We need to suspend mutator threads first.
|
/art/libartbase/base/ |
H A D | bit_vector_test.cc | 146 BitVector first(2, true, Allocator::GetMallocAllocator()); 152 bool changed = first.UnionIfNotIn(&second, &third); 153 EXPECT_EQ(0u, first.NumSetBits()); 158 BitVector first(2, true, Allocator::GetMallocAllocator()); 163 bool changed = first.UnionIfNotIn(&second, &third); 164 EXPECT_EQ(1u, first.NumSetBits()); 166 EXPECT_TRUE(first.IsBitSet(64)); 172 BitVector first(2, true, Allocator::GetMallocAllocator()); 175 EXPECT_TRUE(first.IsSubsetOf(&second)); 177 EXPECT_TRUE(first [all...] |
H A D | hash_map.h | 32 return fn_(pair.first); 40 return fn_(a.first, b.first); 44 return fn_(a.first, element);
|
H A D | iteration_range.h | 25 // range [first, last) defined by two iterators. 35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
|
H A D | dchecked_vector.h | 69 dchecked_vector(InputIterator first, argument 72 : Base(first, last, alloc) { } 159 iterator insert(const_iterator position, InputIterator first, InputIterator last) { argument 161 return Base::insert(position, first, last); 177 iterator erase(const_iterator first, const_iterator last) { 178 DCHECK(cbegin() <= first && first <= cend()); 179 DCHECK(first <= last && last <= cend()); 180 return Base::erase(first, last);
|
H A D | safe_map.h | 97 return result.first; 102 return result.first; 108 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 109 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); 114 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); 115 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); 126 result.first->second = v; 128 return result.first; 136 if (lb != end() && !key_comp()(k, lb->first)) {
|
/art/compiler/optimizing/ |
H A D | pretty_printer.h | 46 bool first = true; local 48 if (first) { 49 first = false; 59 bool first = true; local 61 if (first) { 62 first = false;
|
H A D | dead_code_elimination.cc | 243 HInstruction* first = block->GetFirstInstruction(); local 246 if (first->AlwaysThrows() && 247 first->GetNext() == last && 327 HInstruction* first = block->GetFirstInstruction(); local 332 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); 335 first->IsCondition() && 336 HasInput(first->AsCondition(), block->GetFirstPhi()) && 337 (first->GetNext() == last) && 338 (last->InputAt(0) == first) && 339 first [all...] |
/art/tools/dexfuzz/src/dexfuzz/ |
H A D | MutationStats.java | 62 boolean first = true; 64 if (!first) { 67 first = false;
|
/art/compiler/debug/dwarf/ |
H A D | debug_abbrev_writer.h | 70 uint32_t abbrev_code = it.first->second; 72 const Vector& abbrev = it.first->first;
|
/art/libdexfile/dex/ |
H A D | test_dex_file_builder.h | 42 auto it = strings_.emplace(str, IdxAndDataOffset()).first; 43 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. 74 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; 75 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. 109 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */; 128 size_t num_args = entry.first.args.size(); 170 CHECK_LT(entry.first.size(), 128u); 172 dex_file_data_[raw_offset] = static_cast<uint8_t>(entry.first.size()); 173 std::memcpy(&dex_file_data_[raw_offset + 1], entry.first.c_str(), entry.first [all...] |
/art/runtime/interpreter/ |
H A D | lock_count_data.cc | 52 // We arbitrarily choose the first one. 96 // Raise an exception, just give the first object as the sample. 97 mirror::Object* first = (*monitors_)[0]; local 100 mirror::Object::PrettyTypeOf(first).c_str());
|
/art/runtime/ |
H A D | cha_test.cc | 48 ASSERT_EQ(dependents[0].first, METHOD2); 56 ASSERT_EQ(dependents[0].first, METHOD2); 58 ASSERT_EQ(dependents[1].first, METHOD3); 68 ASSERT_EQ(dependents[0].first, METHOD3); 84 ASSERT_EQ(dependents[0].first, METHOD1);
|
H A D | imtable_test.cc | 82 classes.first->FindDeclaredVirtualMethodByName(method_name, pointer_size); 94 CHECK_EQ(ImTable::GetImtIndex(methods.first), ImTable::GetImtIndex(methods.second)); 101 CHECK_EQ(ImTable::GetImtIndex(methods.first), ImTable::GetImtIndex(methods.second));
|
H A D | dex_reference_collection.h | 76 current_vector_ = &map_.emplace(dex, IndexVector(vector_allocator_)).first->second;
|
/art/compiler/utils/ |
H A D | intrusive_forward_list.h | 149 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { argument 150 insert_after(before_begin(), first, last); local 184 void assign(InputIterator first, InputIterator last) { argument 185 IntrusiveForwardList tmp(first, last); 202 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { argument 203 while (first != last) { 204 position = insert_after(position, *first++); 237 // `splice_after(position, src, first, last)` does not allow `position` inside 238 // the range `(first, last)`. 250 // Splice elements between `first` an 251 splice_after(const_iterator position, IntrusiveForwardList& src, const_iterator first, const_iterator last) argument 280 splice_after(const_iterator position, IntrusiveForwardList&& src, const_iterator first, const_iterator last) argument [all...] |
/art/runtime/base/ |
H A D | arena_allocator.cc | 131 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, argument 136 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { 351 void ArenaPool::FreeArenaChain(Arena* first) { argument 353 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { 360 while (first != nullptr) { 361 Arena* next = first->next_; 362 delete first; 363 first = next; 368 if (first != nullptr) { 369 Arena* last = first; [all...] |
/art/compiler/linker/mips64/ |
H A D | relative_patcher_mips64_test.cc | 39 CHECK(result.first); 66 ASSERT_TRUE(result.first);
|
/art/runtime/interpreter/mterp/arm/ |
H A D | op_cmp_long.S | 18 cmpeq r0, r2 @ For correct EQ/NE, we may need to repeat the first CMP
|
/art/compiler/linker/x86/ |
H A D | relative_patcher_x86_test.cc | 34 CHECK(result.first); 99 ASSERT_TRUE(result.first); 130 ASSERT_TRUE(result.first); 162 ASSERT_TRUE(result.first);
|
/art/compiler/linker/x86_64/ |
H A D | relative_patcher_x86_64_test.cc | 38 CHECK(result.first); 119 ASSERT_TRUE(result.first); 143 ASSERT_TRUE(result.first); 167 ASSERT_TRUE(result.first);
|