Lines Matching defs:count
51 if (key->count != static_cast<size_t>(node->InputCount())) {
64 for (size_t i = 0; i < key->count; i++) {
76 if (key1->count != key2->count) {
82 for (size_t i = 0; i < key1->count; i++) {
109 int StateValuesHashKey(Node** nodes, size_t count) {
110 size_t hash = count;
111 for (size_t i = 0; i < count; i++) {
119 Node* StateValuesCache::GetValuesNodeFromCache(Node** nodes, size_t count,
121 StateValuesKey key(count, mask, nodes);
122 int hash = StateValuesHashKey(nodes, count);
127 int node_count = static_cast<int>(count);
141 Node** values, size_t count, const BytecodeLivenessState* liveness) {
148 while (*values_idx < count && *node_count < kMaxInputCount &&
172 size_t count,
181 values, count, liveness);
185 while (*values_idx < count && node_count < kMaxInputCount) {
186 if (count - *values_idx < kMaxInputCount - node_count) {
194 values, count, liveness);
196 DCHECK_EQ(*values_idx, count);
211 BuildTree(values_idx, values, count, liveness, level - 1);
233 void CheckTreeContainsValues(Node* tree, Node** values, size_t count,
235 DCHECK_EQ(count, StateValuesAccess(tree).size());
248 DCHECK_EQ(static_cast<size_t>(i), count);
255 Node** values, size_t count, const BytecodeLivenessState* liveness) {
258 for (size_t i = 0; i < count; i++) {
265 DCHECK_LE(count, static_cast<size_t>(liveness->register_count()));
267 for (size_t i = 0; i < count; i++) {
275 if (count == 0) {
285 while (count > max_inputs) {
291 Node* tree = BuildTree(&values_idx, values, count, liveness, height);
293 DCHECK_EQ(values_idx, count);
299 CheckTreeContainsValues(tree, values, count, liveness);
336 size_t count = 0;
338 count += Top()->AdvanceToNextRealOrEnd();
341 return count;
416 size_t count = 0;
423 count++;
428 count += StateValuesAccess(value).size();
430 count++;
435 return count;