Home
last modified time | relevance | path

Searched refs:IsLast (Results 1 – 7 of 7) sorted by relevance

/art/libdexfile/dex/
Dtype_lookup_table.cc57 DCHECK(entries[pos].IsLast(mask_bits)); in Create()
72 while (!entries[tail_pos].IsLast(mask_bits)) { in Create()
84 DCHECK(entries[insert_pos].IsLast(mask_bits)); in Create()
85 DCHECK(!entries[tail_pos].IsLast(mask_bits)); in Create()
112 if (entry->IsLast(mask_bits_)) { in Lookup()
125 if (entry->IsLast(mask_bits_)) { in Lookup()
142 } while (!entry->IsLast(mask_bits_)); in Lookup()
Dbytecode_utils.h113 bool IsLast() const { return index_ == num_entries_ - 1; } in IsLast() function
Dtype_lookup_table.h132 bool IsLast(uint32_t mask_bits) const { in IsLast() function
/art/compiler/optimizing/
Dblock_builder.cc117 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in CreateBranchTargets()
199 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in ConnectBasicBlocks()
Dinstruction_builder.cc817 if (!it.IsLast()) { in BuildSwitch()
/art/runtime/
Dstack_map.h183 BIT_TABLE_COLUMN(0, IsLast) // Determines if there are further rows for further depths.
/art/tools/veridex/
Dflow_analysis.cc106 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in FindBranches()