126     int node_count = static_cast<int>(count);  in GetValuesNodeFromCache()  local
127     node = graph()->NewNode(common()->StateValues(node_count, mask), node_count,  in GetValuesNodeFromCache()
139     WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx,  in FillBufferWithValues()  argument
146   size_t virtual_node_count = *node_count;  in FillBufferWithValues()
148   while (*values_idx < count && *node_count < kMaxInputCount &&  in FillBufferWithValues()
155       (*node_buffer)[(*node_count)++] = values[*values_idx];  in FillBufferWithValues()
162   DCHECK_GE(StateValuesCache::kMaxInputCount, *node_count);  in FillBufferWithValues()
175   size_t node_count = 0;  in BuildTree()  local
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()
191         size_t previous_input_count = node_count;  in BuildTree()
193             FillBufferWithValues(node_buffer, &node_count, values_idx, values,  in BuildTree()
212         (*node_buffer)[node_count++] = subtree;  in BuildTree()
218   if (node_count == 1 && input_mask == SparseInputMask::kDenseBitMask) {  in BuildTree()
225     return GetValuesNodeFromCache(node_buffer->data(), node_count,  in BuildTree()