Searched defs:first (Results 1 - 25 of 34) sorted by relevance

12

/art/test/626-const-class-linking/src/
H A DClassPair.java18 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/runtime/interpreter/
H A Dlock_count_data.cc52 // 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());
H A Dinterpreter.cc279 // Calculate the offset of the first input reg. The input registers are in the high regs.
494 // Are we executing the first shadow frame?
495 bool first = true; local
510 first ? nullptr : Runtime::Current()->GetInstrumentation();
517 DCHECK(first);
527 DCHECK(first);
553 DCHECK(first);
566 DCHECK(first);
580 first = false;
/art/test/597-deopt-new-string/
H A Ddeopt.cc37 // 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/compiler/optimizing/
H A Dpretty_printer.h46 bool first = true; local
48 if (first) {
49 first = false;
59 bool first = true; local
61 if (first) {
62 first = false;
H A Dblock_builder.cc63 // Create the first block for the dex instructions, single successor of the entry block.
258 const Instruction& first = code_item_accessor_.InstructionAt(catch_block->GetDexPc()); local
259 if (first.Opcode() == Instruction::MOVE_EXCEPTION) {
350 uint32_t block_id = entry.first;
369 uint32_t block_id = entry.first;
H A Ddead_code_elimination.cc243 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...]
H A Dregister_allocator_test.cc167 // Sibling of the first interval has no register allocated to it.
813 HInstruction* first = new (GetAllocator()) HParameterValue( local
817 entry->AddInstruction(first);
825 DataType::Type::kInt32, first, second, 0); // don't care about dex_pc.
847 // div on x86 requires its first input in eax and the output be the same as the first input.
898 LiveInterval* first = BuildInterval(ranges1, arraysize(ranges1), GetScopedAllocator(), -1, one); local
899 first->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, false, 8));
900 first->uses_.push_front(*new (GetScopedAllocator()) UsePosition(user, false, 7));
901 first
[all...]
H A Dregister_allocator_linear_scan.cc346 Location first = locations->InAt(0); local
347 if (first.IsRegister() || first.IsFpuRegister()) {
349 current->SetRegister(first.reg());
350 } else if (first.IsPair()) {
352 current->SetRegister(first.low());
354 high->SetRegister(first.high());
382 // Split just before first register use.
395 // processed first.
850 // Split the first interva
[all...]
/art/libartbase/base/
H A Ddchecked_vector.h69 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 Diteration_range.h25 // range [first, last) defined by two iterators.
35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
/art/runtime/arch/
H A Dinstruction_set_features.cc192 bool first = false; // Is this first feature? local
201 if (!first) {
214 first = true;
/art/compiler/debug/
H A Delf_debug_line_writer.h112 // Guess that the first map with local variables is the end of prologue.
228 bool first = true; local
240 // Look for first valid mapping after the prologue.
243 if (first) {
244 first = false;
/art/libdexfile/dex/
H A Dutf.cc182 const uint16_t first = GetLeadingUtf16Char(pair); local
183 hash = hash * 31 + first;
H A Dutf_test.cc179 const std::vector<uint16_t>& prefix_in = prefix.first;
182 const std::vector<uint16_t>& test_in = test.first;
185 const std::vector<uint16_t>& suffix_in = suffix.first;
309 static void codePointToSurrogatePair(uint32_t code_point, uint16_t &first, uint16_t &second) { argument
310 first = (code_point >> 10) + 0xd7c0;
/art/runtime/mirror/
H A Dvar_handle_test.cc128 static int32_t AccessModesBitMask(VarHandle::AccessMode first, Args... args) { argument
129 return AccessModesBitMask(first) | AccessModesBitMask(args...);
H A Ddex_cache.h458 ConversionPair(IntType f, IntType s) : first(f), second(s) { }
461 IntType first; variable
490 uint64_t first, second; local
493 : "=&a"(first), "=&d"(second)
496 return ConversionPair64(first, second);
501 uint64_t first, second; local
508 : "=&a"(first), "=&d"(second)
509 : "r"(target), "b"(value.first), "c"(value.second)
/art/runtime/
H A Dreference_table.cc126 // Compare GC roots, first by class, then size, then address.
166 int first = count - kLast; local
167 if (first < 0) {
168 first = 0;
170 os << " Last " << (count - first) << " entries (of " << count << "):\n";
172 for (int idx = count - 1; idx >= first; --idx) {
222 GcRoot<mirror::Object>& stack_for_object = it->first;
322 // Compare summary elements, first by combined count, then by identical (indicating leaks),
H A Djava_vm_ext.cc224 bool first = true; variable
226 if (!first) {
229 first = false;
230 os << library.first;
/art/runtime/jdwp/
H A Djdwp_main.cc469 * we need to wait for it to finish first.
623 bool first = true; local
637 if (first && !netState->IsAwaitingHandshake()) {
639 first = false;
/art/runtime/verifier/
H A Dreg_type.cc322 bool first = true; local
324 if (!first) {
327 first = false;
/art/compiler/utils/arm/
H A Djni_macro_assembler_arm_vixl.cc79 uint32_t first = CTZ(fp_spill_mask); local
84 ___ Vpush(SRegisterList(vixl32::SRegister(first), POPCOUNT(fp_spill_mask)));
143 uint32_t first = CTZ(fp_spill_mask); local
147 ___ Vpop(SRegisterList(vixl32::SRegister(first), POPCOUNT(fp_spill_mask)));
396 // Ensure that the first move doesn't clobber the input of the second.
/art/compiler/utils/
H A Dassembler.h334 result.first.swap(opcodes_);
345 void AppendRawData(const std::vector<uint8_t>& raw_data, size_t first, size_t last) { argument
346 DCHECK_LE(0u, first);
347 DCHECK_LE(first, last);
349 opcodes_.insert(opcodes_.end(), raw_data.begin() + first, raw_data.begin() + last);
H A Dintrusive_forward_list.h149 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 Darena_allocator.cc131 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...]

Completed in 1438 milliseconds

12