/art/compiler/optimizing/ |
H A D | pretty_printer.h | 44 bool first = true; local 46 if (first) { 47 first = false; 57 bool first = true; local 59 if (first) { 60 first = false;
|
H A D | nodes.cc | 95 HBasicBlock* HGraph::FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const { argument 97 // Walk the dominator tree of the first block and mark the visited blocks. 98 while (first != nullptr) { 99 visited.SetBit(first->GetBlockId()); 100 first = first->GetDominator();
|
H A D | builder.cc | 141 HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt); local 143 T* comparison = new (arena_) T(first, second); 237 // Create the first block for the dex instructions, single successor of the entry block. 274 HInstruction* first = LoadLocal(instruction.VRegB(), type); local 276 current_block_->AddInstruction(new (arena_) T(type, first, second)); 282 HInstruction* first = LoadLocal(instruction.VRegA(), type); local 284 current_block_->AddInstruction(new (arena_) T(type, first, second)); 290 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); local 293 std::swap(first, second); 295 current_block_->AddInstruction(new (arena_) T(Primitive::kPrimInt, first, secon 301 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); local [all...] |
H A D | nodes.h | 151 HBasicBlock* FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const; 918 HCondition(HInstruction* first, HInstruction* second) argument 919 : HBinaryOperation(Primitive::kPrimBoolean, first, second) {} 935 HEqual(HInstruction* first, HInstruction* second) argument 936 : HCondition(first, second) {} 950 HNotEqual(HInstruction* first, HInstruction* second) argument 951 : HCondition(first, second) {} 965 HLessThan(HInstruction* first, HInstruction* second) argument 966 : HCondition(first, second) {} 980 HLessThanOrEqual(HInstruction* first, HInstructio argument 995 HGreaterThan(HInstruction* first, HInstruction* second) argument 1010 HGreaterThanOrEqual(HInstruction* first, HInstruction* second) argument 1028 HCompare(Primitive::Type type, HInstruction* first, HInstruction* second) argument [all...] |
/art/compiler/dex/quick/mips/ |
H A D | utility_mips.cc | 358 LIR *first = NULL; local 373 first = NewLIR3(kMipsAddu, t_reg.GetReg() , r_base.GetReg(), r_index.GetReg()); 375 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale); 405 return (first) ? first : res; 411 LIR *first = NULL; local 425 first = NewLIR3(kMipsAddu, t_reg.GetReg() , r_base.GetReg(), r_index.GetReg()); 427 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale); 451 return first; 658 // Ensure that prior accesses become visible to other threads first [all...] |
/art/compiler/utils/ |
H A D | arena_allocator.cc | 83 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, argument 88 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { 189 void ArenaPool::FreeArenaChain(Arena* first) { argument 191 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { 195 if (first != nullptr) { 196 Arena* last = first; 203 free_arenas_ = first;
|
H A D | arena_allocator.h | 77 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const { argument 78 UNUSED(os); UNUSED(first); UNUSED(lost_bytes_adjustment); 93 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const; 150 void FreeArenaChain(Arena* first) LOCKS_EXCLUDED(lock_);
|
/art/runtime/jdwp/ |
H A D | jdwp_main.cc | 469 bool first = true; local 483 if (first && !netState->IsAwaitingHandshake()) { 485 first = false;
|
/art/runtime/ |
H A D | reference_table.cc | 160 int first = count - kLast; local 161 if (first < 0) { 162 first = 0; 164 os << " Last " << (count - first) << " entries (of " << count << "):\n"; 165 for (int idx = count - 1; idx >= first; --idx) {
|
H A D | jni_internal.cc | 483 bool first = true; local 485 if (!first) { 488 first = false; 489 os << library.first;
|
/art/disassembler/ |
H A D | disassembler_arm.cc | 184 bool first = true; local 187 if (first) { 188 first = false; 225 : first(instr, 12, 22), imm8(instr & 0xFF) {} 226 FpRegister first; member in struct:art::arm::FpRegisterRange 230 os << "{" << rhs.first; 231 int count = (rhs.first.size != 0 ? ((rhs.imm8 + 1u) >> 1) : rhs.imm8); 233 os << "-" << FpRegister(rhs.first, count - 1); 237 } else if (rhs.first.size != 0 && (rhs.imm8 & 1) != 0) { 238 os << rhs.first << " (HAL [all...] |
/art/compiler/dex/quick/ |
H A D | codegen_util.cc | 38 const Signature& signature, uint32_t size, It first) { 45 line = StringPrintf(" {0x%05x, 0x%04x},", first.NativePcOffset(), first.DexPc()); 46 ++first; 911 * int first_key first (and lowest) switch case value 1069 // Core regs may have been inserted out of order - sort first. 1084 // For other platforms regs may have been inserted out of order - sort first. 1159 * first instruction. 37 DumpMappingTable(const char* table_name, const char* descriptor, const char* name, const Signature& signature, uint32_t size, It first) argument
|
/art/oatdump/ |
H A D | oatdump.cc | 677 bool first = true; local 684 os << (first ? "v" : ", v") << dex_reg; 690 first = false; 724 bool first = true; local 727 if (first) { 731 first = false; 739 if (first) { 831 bool first = true; local 834 if (first) { 838 first 858 bool first = true; local 1517 bool first = true; local 1556 bool first = true; local [all...] |