/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 | 71 dchecked_vector(InputIterator first, 74 : Base(first, last, alloc) { } in Base() argument 161 iterator insert(const_iterator position, InputIterator first, InputIterator last) { in insert() argument 163 return Base::insert(position, first, last); in insert() 179 iterator erase(const_iterator first, const_iterator last) { in erase() argument 180 DCHECK(cbegin() <= first && first <= cend()); in erase() 181 DCHECK(first <= last && last <= cend()); in erase() 182 return Base::erase(first, last); in erase()
|
D | iteration_range.h | 35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } in IterationRange() argument
|
D | arena_allocator.cc | 117 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, in Dump() argument 122 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { in Dump() 269 void ArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument 271 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain() 275 if (first != nullptr) { in FreeArenaChain() 276 Arena* last = first; in FreeArenaChain() 283 free_arenas_ = first; in FreeArenaChain()
|
/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 | 138 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { in IntrusiveForwardList() argument 139 insert_after(before_begin(), first, last); in IntrusiveForwardList() 173 void assign(InputIterator first, InputIterator last) { in assign() argument 174 IntrusiveForwardList tmp(first, last); in assign() 191 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { in insert_after() argument 192 while (first != last) { in insert_after() 193 position = insert_after(position, *first++); in insert_after() 242 const_iterator first, in splice_after() argument 245 DCHECK(first != last); in splice_after() 246 if (++const_iterator(first) == last) { in splice_after() [all …]
|
D | swap_space.h | 72 if (lhs.first != rhs.first) { in operator() 73 return lhs.first < rhs.first; in operator()
|
/art/compiler/optimizing/ |
D | pretty_printer.h | 44 bool first = true; in PrintPostInstruction() local 46 if (first) { in PrintPostInstruction() 47 first = false; in PrintPostInstruction() 57 bool first = true; in PrintPostInstruction() local 59 if (first) { in PrintPostInstruction() 60 first = false; in PrintPostInstruction()
|
D | optimizing_unit_test.h | 111 std::string::size_type pos = result.find(p.first); in Patch() 113 << "Could not find: \"" << p.first << "\" in \"" << result << "\""; in Patch() 114 result.replace(pos, p.first.size(), p.second); in Patch()
|
D | register_allocator_test.cc | 765 HInstruction* first = new (allocator) HParameterValue( in BuildDiv() local 769 entry->AddInstruction(first); in BuildDiv() 776 *div = new (allocator) HDiv(Primitive::kPrimInt, first, second, 0); // don't care about dex_pc. in BuildDiv() 849 LiveInterval* first = BuildInterval(ranges1, arraysize(ranges1), &allocator, -1, one); in TEST_F() local 850 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 8, first->first_use_); in TEST_F() 851 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 7, first->first_use_); in TEST_F() 852 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 6, first->first_use_); in TEST_F() 854 locations = new (&allocator) LocationSummary(first->GetDefinedBy(), LocationSummary::kNoCall); in TEST_F() 856 first = first->SplitAt(1); in TEST_F() 899 register_allocator.unhandled_core_intervals_.push_back(first); in TEST_F() [all …]
|
/art/test/597-deopt-new-string/ |
D | deopt.cc | 37 static bool first = true; in Java_Main_deoptimizeAll() local 38 if (first) { in Java_Main_deoptimizeAll() 41 first = false; in Java_Main_deoptimizeAll()
|
/art/runtime/ |
D | safe_map.h | 94 return result.first; in Put() 99 return result.first; in Put() 105 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore() 106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore() 111 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore() 112 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore() 123 result.first->second = v; in Overwrite() 125 return result.first; in Overwrite() 133 if (lb != end() && !key_comp()(k, lb->first)) { in GetOrCreate()
|
D | class_reference.h | 36 return (lhs.first < rhs.first);
|
D | profiler.cc | 455 ArtMethod* method = stack.front().first; in RecordStack() 529 ArtMethod* method = inst_loc.first; in PutStack() 589 ArtMethod *method = meth_iter.first; in Write() 614 MethodReference method = method_iter.first; in Write() 648 PreviousContextMap::iterator ci = new_context_map.find(context_i.first); in Write() 650 new_context_map[context_i.first] = count; in Write() 663 context_count_vector.push_back(StringPrintf("%u:%u:%s", context_i.first.first, in Write() 664 context_i.second, context_i.first.second.c_str())); in Write() 676 os << StringPrintf("%s/%u/%u\n", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write() 678 os << StringPrintf("%s/%u/%u/[", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write() [all …]
|
D | utf_test.cc | 179 const std::vector<uint16_t>& prefix_in = prefix.first; in TEST_F() 182 const std::vector<uint16_t>& test_in = test.first; in TEST_F() 185 const std::vector<uint16_t>& suffix_in = suffix.first; in TEST_F() 309 static void codePointToSurrogatePair(uint32_t code_point, uint16_t &first, uint16_t &second) { in codePointToSurrogatePair() argument 310 first = (code_point >> 10) + 0xd7c0; in codePointToSurrogatePair()
|
D | reference_table.cc | 159 int first = count - kLast; in Dump() local 160 if (first < 0) { in Dump() 161 first = 0; in Dump() 163 os << " Last " << (count - first) << " entries (of " << count << "):\n"; in Dump() 165 for (int idx = count - 1; idx >= first; --idx) { in Dump()
|
/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/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/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() 140 ASSERT_TRUE(result.first); in TEST_F() 165 ASSERT_TRUE(result.first); in TEST_F()
|
/art/compiler/linker/x86/ |
D | relative_patcher_x86_test.cc | 33 CHECK(result.first); in GetMethodOffset() 98 ASSERT_TRUE(result.first); in TEST_F() 127 ASSERT_TRUE(result.first); in TEST_F() 160 ASSERT_TRUE(result.first); in TEST_F()
|
/art/test/504-regression-baseline-entry/smali/ |
D | Test.smali | 24 :first 29 goto :first
|
/art/runtime/lambda/ |
D | box_table.cc | 68 Closure* closure = key_value_pair.first; in ~BoxTable() 239 const ClosureType& closure = key_value_pair.first; in SweepWeakBoxedLambdas() 286 item.first = nullptr; in MakeEmpty() 293 return item.first == nullptr; in IsEmpty()
|