Lines Matching refs:values_idx
139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx, in FillBufferWithValues() argument
148 while (*values_idx < count && *node_count < kMaxInputCount && in FillBufferWithValues()
150 DCHECK_LE(*values_idx, static_cast<size_t>(INT_MAX)); in FillBufferWithValues()
153 liveness->Contains(liveness_offset + static_cast<int>(*values_idx))) { in FillBufferWithValues()
155 (*node_buffer)[(*node_count)++] = values[*values_idx]; in FillBufferWithValues()
159 (*values_idx)++; in FillBufferWithValues()
171 Node* StateValuesCache::BuildTree(size_t* values_idx, Node** values, in BuildTree() argument
179 input_mask = FillBufferWithValues(node_buffer, &node_count, values_idx, in BuildTree()
184 while (*values_idx < count && node_count < kMaxInputCount) { in BuildTree()
185 if (count - *values_idx < kMaxInputCount - node_count) { in BuildTree()
193 FillBufferWithValues(node_buffer, &node_count, values_idx, values, in BuildTree()
196 DCHECK_EQ(*values_idx, count); in BuildTree()
210 Node* subtree = BuildTree(values_idx, values, count, liveness, in BuildTree()
291 size_t values_idx = 0; in GetNodeForValues() local
293 BuildTree(&values_idx, values, count, liveness, liveness_offset, height); in GetNodeForValues()
295 DCHECK_EQ(values_idx, count); in GetNodeForValues()