Home
last modified time | relevance | path

Searched refs:first (Results 1 – 25 of 70) sorted by relevance

123

/art/compiler/optimizing/
Dpretty_printer.h44 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()
Dbuilder.cc141 HInstruction* first = LoadLocal(instruction.VRegA(), Primitive::kPrimInt); in If_22t() local
143 T* comparison = new (arena_) T(first, second); in If_22t()
274 HInstruction* first = LoadLocal(instruction.VRegB(), type); in Binop_23x() local
276 current_block_->AddInstruction(new (arena_) T(type, first, second)); in Binop_23x()
282 HInstruction* first = LoadLocal(instruction.VRegA(), type); in Binop_12x() local
284 current_block_->AddInstruction(new (arena_) T(type, first, second)); in Binop_12x()
290 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); in Binop_22s() local
293 std::swap(first, second); in Binop_22s()
295 current_block_->AddInstruction(new (arena_) T(Primitive::kPrimInt, first, second)); in Binop_22s()
301 HInstruction* first = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); in Binop_22b() local
[all …]
Dnodes.h151 HBasicBlock* FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const;
918 HCondition(HInstruction* first, HInstruction* second) in HCondition() argument
919 : HBinaryOperation(Primitive::kPrimBoolean, first, second) {} in HCondition()
935 HEqual(HInstruction* first, HInstruction* second) in HEqual() argument
936 : HCondition(first, second) {} in HEqual()
950 HNotEqual(HInstruction* first, HInstruction* second) in HNotEqual() argument
951 : HCondition(first, second) {} in HNotEqual()
965 HLessThan(HInstruction* first, HInstruction* second) in HLessThan() argument
966 : HCondition(first, second) {} in HLessThan()
980 HLessThanOrEqual(HInstruction* first, HInstruction* second) in HLessThanOrEqual() argument
[all …]
Dnodes.cc95 HBasicBlock* HGraph::FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const { in FindCommonDominator() argument
98 while (first != nullptr) { in FindCommonDominator()
99 visited.SetBit(first->GetBlockId()); in FindCommonDominator()
100 first = first->GetDominator(); in FindCommonDominator()
/art/runtime/base/
Dhash_map.h32 return fn_(pair.first); in operator()
40 return fn_(a.first, b.first); in operator()
44 return fn_(a.first, element); in operator()
/art/compiler/utils/
Darena_allocator.cc83 void ArenaAllocatorStatsImpl<kCount>::Dump(std::ostream& os, const Arena* first, in Dump() argument
88 for (const Arena* arena = first; arena != nullptr; arena = arena->next_) { in Dump()
189 void ArenaPool::FreeArenaChain(Arena* first) { in FreeArenaChain() argument
191 for (Arena* arena = first; arena != nullptr; arena = arena->next_) { in FreeArenaChain()
195 if (first != nullptr) { in FreeArenaChain()
196 Arena* last = first; in FreeArenaChain()
203 free_arenas_ = first; in FreeArenaChain()
Darena_allocator.h77 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const { in Dump() argument
78 UNUSED(os); UNUSED(first); UNUSED(lost_bytes_adjustment); in Dump()
93 void Dump(std::ostream& os, const Arena* first, ssize_t lost_bytes_adjustment) const;
150 void FreeArenaChain(Arena* first) LOCKS_EXCLUDED(lock_);
Dswap_space.h88 if (lhs.first != rhs.first) { in operator()
89 return lhs.first < rhs.first; in operator()
Dswap_space.cc38 if (last_size != entry.first) { in DumpFreeMap()
39 last_size = entry.first; in DumpFreeMap()
63 free_by_size->emplace(chunk.size, insert_result.first); in InsertChunk()
/art/runtime/
Dclass_reference.h36 return (lhs.first < rhs.first);
Dprofiler.cc454 mirror::ArtMethod* method = stack.front().first; in RecordStack()
523 mirror::ArtMethod* method = inst_loc.first; in PutStack()
583 mirror::ArtMethod *method = meth_iter.first; in Write()
608 MethodReference method = method_iter.first; in Write()
642 PreviousContextMap::iterator ci = new_context_map.find(context_i.first); in Write()
644 new_context_map[context_i.first] = count; in Write()
657 context_count_vector.push_back(StringPrintf("%u:%u:%s", context_i.first.first, in Write()
658 context_i.second, context_i.first.second.c_str())); in Write()
670 os << StringPrintf("%s/%u/%u\n", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write()
672 os << StringPrintf("%s/%u/%u/[", pi.first.c_str(), pi.second.count_, pi.second.method_size_); in Write()
[all …]
Dreference_table.cc160 int first = count - kLast; in Dump() local
161 if (first < 0) { in Dump()
162 first = 0; in Dump()
164 os << " Last " << (count - first) << " entries (of " << count << "):\n"; in Dump()
165 for (int idx = count - 1; idx >= first; --idx) { in Dump()
Dsafe_map.h92 return result.first; in Put()
98 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); in PutBefore()
110 result.first->second = v; in Overwrite()
Dtransaction.cc134 it.second.Undo(it.first); in UndoObjectModifications()
143 it.second.Undo(it.first); in UndoArrayModifications()
173 mirror::Object* old_root = it.first; in VisitObjectLogs()
183 mirror::Object* old_root = pair.first; in VisitObjectLogs()
199 mirror::Array* old_root = it.first; in VisitArrayLogs()
210 mirror::Array* old_root = pair.first; in VisitArrayLogs()
263 MemberOffset field_offset(it.first); in Undo()
382 UndoArrayWrite(array, type, it.first, it.second); in Undo()
/art/test/092-locale/
Dexpected.txt2 USA: first=1, name=Sunday
4 France: first=2, name=lundi
/art/compiler/dex/
Dglobal_value_numbering.h89 if (lb != global_value_map_.end() && lb->first == key) { in LookupValue()
137 return field_index_reverse_map_[field_id]->first.type; in GetFieldType()
161 return array_location_reverse_map_[location]->first.base; in GetArrayLocationBase()
166 return array_location_reverse_map_[location]->first.index; in GetArrayLocationIndex()
178 if (lb != ref_set_map_.end() && !ref_set_map_.key_comp()(ref_set, lb->first)) { in GetRefSetId()
Dpost_opt_passes.cc85 AllNodesIterator first(mir_graph); in Start() local
86 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) { in Start()
Dlocal_value_numbering.cc199 if (lb == map->end() || map->key_comp()(key, lb->first)) { in GetAliasingValues()
261 if (lb != values->load_value_map.end() && lb->first == location) { in HandleAliasingValuesGet()
313 auto it = dest->PutBefore(dest->end(), entry.first, AliasingValues(this)); in CopyAliasingValuesMap()
509 bool live = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first)); in CopyLiveSregValues()
511 dest->PutBefore(dest_end, entry.first, entry.second); in CopyLiveSregValues()
532 bool live_and_same = live_in_v->IsBitSet(gvn_->GetMirGraph()->SRegToVReg(entry.first)); in IntersectSregValueMaps()
536 auto it = (lvn->*map_ptr).find(entry.first); in IntersectSregValueMaps()
545 (this->*map_ptr).PutBefore((this->*map_ptr).end(), entry.first, entry.second); in IntersectSregValueMaps()
597 if (store_it != store_end && (load_it == load_end || *store_it < load_it->first)) { in IntersectAliasingValueLocations()
601 loc = load_it->first; in IntersectAliasingValueLocations()
[all …]
Ddataflow_iterator-inl.h142 loop_ends_->Get(loop_head_stack_->Peek().first) == idx_) { in Next()
144 uint16_t loop_head_idx = top.first; in Next()
/art/compiler/dex/quick/mips/
Dutility_mips.cc358 LIR *first = NULL; in LoadBaseIndexed() local
373 first = NewLIR3(kMipsAddu, t_reg.GetReg() , r_base.GetReg(), r_index.GetReg()); in LoadBaseIndexed()
375 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale); in LoadBaseIndexed()
405 return (first) ? first : res; in LoadBaseIndexed()
411 LIR *first = NULL; in StoreBaseIndexed() local
425 first = NewLIR3(kMipsAddu, t_reg.GetReg() , r_base.GetReg(), r_index.GetReg()); in StoreBaseIndexed()
427 first = OpRegRegImm(kOpLsl, t_reg, r_index, scale); in StoreBaseIndexed()
451 return first; in StoreBaseIndexed()
/art/oatdump/
Doatdump.cc677 bool first = true; in DumpVmap() local
684 os << (first ? "v" : ", v") << dex_reg; in DumpVmap()
690 first = false; in DumpVmap()
724 bool first = true; in DumpGcMapRegisters() local
727 if (first) { in DumpGcMapRegisters()
731 first = false; in DumpGcMapRegisters()
739 if (first) { in DumpGcMapRegisters()
831 bool first = true; in DumpGcMapAtNativePcOffset() local
834 if (first) { in DumpGcMapAtNativePcOffset()
838 first = false; in DumpGcMapAtNativePcOffset()
[all …]
/art/test/097-duplicate-method/
Dinfo.txt2 properly (all but the first are ignored).
/art/test/015-switch/
Dexpected.txt9 CORRECT big sparse / first
/art/test/008-exceptions/
Dexpected.txt6 Caused by: java.lang.NullPointerException: first throw
/art/test/098-ddmc/src/
DMain.java72 Allocations first = new Allocations(DdmVmInternal.getRecentAllocations()); in testRecentAllocationTracking() local
76 System.out.println("second > first =" + (second.numberOfEntries > first.numberOfEntries)); in testRecentAllocationTracking()

123