Searched refs:first (Results 1 - 25 of 113) sorted by relevance

12345

/art/test/504-regression-baseline-entry/smali/
H A DTest.smali24 :first
29 goto :first
/art/runtime/
H A Dclass_reference.h36 return (lhs.first < rhs.first);
H A Dsafe_map.h94 return result.first;
99 return result.first;
105 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));
106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
111 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));
112 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
123 result.first->second = v;
125 return result.first;
133 if (lb != end() && !key_comp()(k, lb->first)) {
H A Dreference_table.cc119 // Compare GC roots, first by class, then size, then address.
159 int first = count - kLast; local
160 if (first < 0) {
161 first = 0;
163 os << " Last " << (count - first) << " entries (of " << count << "):\n";
165 for (int idx = count - 1; idx >= first; --idx) {
H A Dprofiler.cc160 // Add a random delay for the first time run so that we don't hammer the CPU
455 ArtMethod* method = stack.front().first;
492 // Add a method to the profile table. If it's the first time the method
529 ArtMethod* method = inst_loc.first;
589 ArtMethod *method = meth_iter.first;
614 MethodReference method = method_iter.first;
648 PreviousContextMap::iterator ci = new_context_map.find(context_i.first);
650 new_context_map[context_i.first] = count;
663 context_count_vector.push_back(StringPrintf("%u:%u:%s", context_i.first.first,
[all...]
H A Dtype_lookup_table_test.cc48 const char* descriptor = pair.first;
/art/test/597-deopt-new-string/
H A Ddeopt.cc35 // We need to suspend mutator threads first.
37 static bool first = true; local
38 if (first) {
41 first = false;
54 // We need to suspend mutator threads first.
/art/runtime/base/
H A Dbit_vector_test.cc146 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 Dhash_map.h32 return fn_(pair.first);
40 return fn_(a.first, b.first);
44 return fn_(a.first, element);
H A Diteration_range.h25 // range [first, last) defined by two iterators.
35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
H A Ddchecked_vector.h71 dchecked_vector(InputIterator first, argument
74 : Base(first, last, alloc) { }
161 iterator insert(const_iterator position, InputIterator first, InputIterator last) { argument
163 return Base::insert(position, first, last);
179 iterator erase(const_iterator first, const_iterator last) {
180 DCHECK(cbegin() <= first && first <= cend());
181 DCHECK(first <= last && last <= cend());
182 return Base::erase(first, last);
H A Darena_allocator.cc117 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, argument
122 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) {
269 void ArenaPool::FreeArenaChain(Arena* first) { argument
271 for (Arena* arena = first; arena != nullptr; arena = arena->next_) {
275 if (first != nullptr) {
276 Arena* last = first;
283 free_arenas_ = first;
/art/compiler/optimizing/
H A Dpretty_printer.h44 bool first = true; local
46 if (first) {
47 first = false;
57 bool first = true; local
59 if (first) {
60 first = false;
H A Doptimizing_unit_test.h111 std::string::size_type pos = result.find(p.first);
113 << "Could not find: \"" << p.first << "\" in \"" << result << "\"";
114 result.replace(pos, p.first.size(), p.second);
H A Dregister_allocator_test.cc135 // Sibling of the first interval has no register allocated to it.
765 HInstruction* first = new (allocator) HParameterValue( local
769 entry->AddInstruction(first);
776 *div = new (allocator) HDiv(Primitive::kPrimInt, first, second, 0); // don't care about dex_pc.
801 // div on x86 requires its first input in eax and the output be the same as the first input.
849 LiveInterval* first = BuildInterval(ranges1, arraysize(ranges1), &allocator, -1, one); local
850 first->first_use_ = new(&allocator) UsePosition(user, 0, false, 8, first->first_use_);
851 first
[all...]
/art/tools/dexfuzz/src/dexfuzz/
H A DMutationStats.java62 boolean first = true;
64 if (!first) {
67 first = false;
/art/compiler/debug/dwarf/
H A Ddebug_abbrev_writer.h70 uint32_t abbrev_code = it.first->second;
72 const Vector& abbrev = it.first->first;
/art/compiler/utils/
H A Dtest_dex_file_builder.h40 auto it = strings_.emplace(str, IdxAndDataOffset()).first;
41 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128.
72 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first;
73 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_.
107 data_section_size += entry.first.length() + 1u /* length */ + 1u /* null-terminator */;
126 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
[all...]
H A Dintrusive_forward_list.h138 IntrusiveForwardList(InputIterator first, InputIterator last) : IntrusiveForwardList() { argument
139 insert_after(before_begin(), first, last); local
173 void assign(InputIterator first, InputIterator last) { argument
174 IntrusiveForwardList tmp(first, last);
191 iterator insert_after(const_iterator position, InputIterator first, InputIterator last) { argument
192 while (first != last) {
193 position = insert_after(position, *first++);
226 // `splice_after(position, src, first, last)` does not allow `position` inside
227 // the range `(first, last)`.
239 // Splice elements between `first` an
240 splice_after(const_iterator position, IntrusiveForwardList& src, const_iterator first, const_iterator last) argument
269 splice_after(const_iterator position, IntrusiveForwardList&& src, const_iterator first, const_iterator last) argument
[all...]
H A Dswap_space.h72 if (lhs.first != rhs.first) {
73 return lhs.first < rhs.first;
/art/compiler/utils/arm/
H A Dassembler_arm_test.h97 bool first = true; local
146 if (first) {
147 first = false;
188 bool first = true; local
198 Imm i = pair.first;
238 if (first) {
239 first = false;
274 bool first = true; local
301 if (first) {
302 first
340 bool first = true; local
404 bool first = true; local
460 bool first = true; local
[all...]
/art/runtime/interpreter/mterp/arm/
H A Dop_cmp_long.S18 cmpeq r0, r2 @ For correct EQ/NE, we may need to repeat the first CMP
/art/compiler/linker/x86/
H A Drelative_patcher_x86_test.cc33 CHECK(result.first);
98 ASSERT_TRUE(result.first);
127 ASSERT_TRUE(result.first);
160 ASSERT_TRUE(result.first);
/art/compiler/linker/x86_64/
H A Drelative_patcher_x86_64_test.cc37 CHECK(result.first);
118 ASSERT_TRUE(result.first);
140 ASSERT_TRUE(result.first);
165 ASSERT_TRUE(result.first);
/art/runtime/lambda/
H A Dbox_table.cc32 // TODO: Generate a proxy class for the closure when boxing the first time.
68 Closure* closure = key_value_pair.first;
70 // Remove from the map first, so that it doesn't try to access dangling pointer.
239 const ClosureType& closure = key_value_pair.first;
286 item.first = nullptr;
293 return item.first == nullptr;

Completed in 532 milliseconds

12345