Searched refs:IsLast (Results 1 – 7 of 7) sorted by relevance
57 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()
113 bool IsLast() const { return index_ == num_entries_ - 1; } in IsLast() function
130 bool IsLast(uint32_t mask_bits) const { in IsLast() function
117 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in CreateBranchTargets()199 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in ConnectBasicBlocks()
762 if (!it.IsLast()) { in BuildSwitch()
178 BIT_TABLE_COLUMN(0, IsLast) // Determines if there are further rows for further depths.
98 if (table.ShouldBuildDecisionTree() && !s_it.IsLast()) { in FindBranches()