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

12

/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/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 Dblock_builder.cc39 // Create the first block for the dex instructions, single successor of the entry block.
222 const Instruction& first = GetDexInstructionAt(code_item_, catch_block->GetDexPc()); local
223 if (first.Opcode() == Instruction::MOVE_EXCEPTION) {
314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
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...]
H A Dregister_allocator.cc364 Location first = locations->InAt(0); local
365 if (first.IsRegister() || first.IsFpuRegister()) {
367 current->SetRegister(first.reg());
368 } else if (first.IsPair()) {
370 current->SetRegister(first.low());
372 high->SetRegister(first.high());
400 // Split just before first register use.
413 // processed first.
967 // Split the first interva
[all...]
H A Dinstruction_builder.cc45 // be deleted when the first throwing instruction with the vreg undefined
49 // the first throwing instruction.
176 // This is the first instruction throwing into `catch_block` where
474 HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt); local
476 T* comparison = new (arena_) T(first, second, dex_pc);
495 HInstruction* first = LoadLocal(instruction.VRegB(), type); local
496 AppendInstruction(new (arena_) T(type, first, dex_pc));
504 HInstruction* first = LoadLocal(instruction.VRegB(), input_type); local
505 AppendInstruction(new (arena_) HTypeConversion(result_type, first, dex_pc));
513 HInstruction* first local
523 HInstruction* first = LoadLocal(instruction.VRegB(), type); local
533 HInstruction* first = LoadLocal(instruction.VRegB(), type); local
543 HInstruction* first = LoadLocal(instruction.VRegA(), type); local
553 HInstruction* first = LoadLocal(instruction.VRegA(), type); local
561 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); local
572 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); local
1426 HInstruction* first = LoadLocal(first_vreg, type); local
[all...]
H A Dnodes.cc358 // Make sure the first predecessor of a loop header is the incoming block.
389 // Infer try membership from the first predecessor. Having simplified loops,
390 // the first predecessor can never be a back edge and therefore it must have
398 // We are either setting try block membership for the first time or it
609 // If we hit a loop header in an irreducible loop, we first check if the
924 // is the first input of the phi.
1401 // Move to the first dominator not in a loop.
2045 // into two blocks, merge the first block of the inlined graph into
2046 // the first half, and replace the exit block of the inlined graph
2053 HBasicBlock* first local
[all...]
/art/runtime/base/
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 Diteration_range.h25 // range [first, last) defined by two iterators.
35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } argument
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/runtime/arch/
H A Dinstruction_set_features.cc222 bool first = false; // Is this first feature? local
231 if (!first) {
251 first = true;
/art/compiler/debug/
H A Delf_debug_line_writer.h110 // Guess that the first map with local variables is the end of prologue.
224 bool first = true; local
236 // Look for first valid mapping after the prologue.
239 if (first) {
240 first = false;
/art/runtime/interpreter/
H A Dinterpreter.cc525 // Are we executing the first shadow frame?
526 bool first = true; local
541 first ? nullptr : Runtime::Current()->GetInstrumentation();
598 first = false;
/art/runtime/jdwp/
H A Djdwp_main.cc351 * we need to wait for it to finish first.
503 bool first = true; local
517 if (first && !netState->IsAwaitingHandshake()) {
519 first = false;
/art/runtime/
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 Dutf.cc185 const uint16_t first = GetLeadingUtf16Char(pair); local
186 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;
H A Djava_vm_ext.cc210 bool first = true; variable
212 if (!first) {
215 first = false;
216 os << library.first;
H A Dstack.cc977 // We arbitrarily choose the first one.
1021 // Raise an exception, just give the first object as the sample.
1022 mirror::Object* first = (*monitors_)[0]; local
1025 PrettyTypeOf(first).c_str());
/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/compiler/utils/
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 Dassembler.h329 result.first.swap(opcodes_);
340 void AppendRawData(const std::vector<uint8_t>& raw_data, size_t first, size_t last) { argument
341 DCHECK_LE(0u, first);
342 DCHECK_LE(first, last);
344 opcodes_.insert(opcodes_.end(), raw_data.begin() + first, raw_data.begin() + last);
/art/runtime/verifier/
H A Dreg_type.cc314 bool first = true; local
316 if (!first) {
319 first = false;
/art/compiler/
H A Dcompiled_method.h126 SrcMap(InputIt first, InputIt last, const Allocator& alloc) argument
127 : std::vector<SrcMapElem, Allocator>(first, last, alloc) {}
145 // Finds first mapping such that lb.from_ >= from.
154 // Not found because 'from' is smaller than first entry in the map.
/art/disassembler/
H A Ddisassembler_arm.cc189 bool first = true; local
192 if (first) {
193 first = false;
229 : first(instr, 12, 22), imm8(instr & 0xFF) {}
230 FpRegister first; member in struct:art::arm::FpRegisterRange
234 os << "{" << rhs.first;
235 int count = (rhs.first.size != 0 ? ((rhs.imm8 + 1u) >> 1) : rhs.imm8);
237 os << "-" << FpRegister(rhs.first, count - 1);
241 } else if (rhs.first.size != 0 && (rhs.imm8 & 1) != 0) {
242 os << rhs.first << " (HAL
[all...]

Completed in 456 milliseconds

12