Lines Matching refs:node_count
126 int node_count = static_cast<int>(count);
127 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count,
139 WorkingBuffer* node_buffer, size_t* node_count, size_t* values_idx,
146 size_t virtual_node_count = *node_count;
148 while (*values_idx < count && *node_count < kMaxInputCount &&
155 (*node_buffer)[(*node_count)++] = values[*values_idx];
162 DCHECK(*node_count <= StateValuesCache::kMaxInputCount);
175 size_t node_count = 0;
179 input_mask = FillBufferWithValues(node_buffer, &node_count, values_idx,
184 while (*values_idx < count && node_count < kMaxInputCount) {
185 if (count - *values_idx < kMaxInputCount - node_count) {
191 size_t previous_input_count = node_count;
193 FillBufferWithValues(node_buffer, &node_count, values_idx, values,
212 (*node_buffer)[node_count++] = subtree;
218 if (node_count == 1 && input_mask == SparseInputMask::kDenseBitMask) {
225 return GetValuesNodeFromCache(node_buffer->data(), node_count,
