Lines Matching refs:kEntrySize
9557 if (length == kEntrySize) {
9571 if (length == kEntrySize) return OneElementLookup(cache, name, flags);
9582 static const int kEntrySize = 2;
9592 return kLinearReservedSlots + kEntrySize * entries;
9596 int old_entries = (old_size - kLinearReservedSlots) / kEntrySize;
9602 DCHECK_EQ(cache->length(), kEntrySize);
9610 DCHECK_GE(cache->length(), kEntrySize);
9613 for (int i = kLinearReservedSlots; i < usage; i += kEntrySize) {
9623 Handle<FixedArray> cache = isolate->factory()->NewFixedArray(kEntrySize);
9633 DCHECK_EQ(cache->length(), kEntrySize);
9663 DCHECK_GE(cache->length(), usage + kEntrySize);
9666 cache->set(kLinearUsageIndex, Smi::FromInt(usage + kEntrySize));
9687 for (int i = kLinearReservedSlots; i < length; i += kEntrySize) {
9701 DCHECK_GT(linear_cache->length(), kEntrySize);
15066 SeededNumberDictionary::kEntrySize;
15128 SeededNumberDictionary::kEntrySize;
16250 for (int j = 0; j < Shape::kEntrySize; j++) {
16283 Object* temp[Shape::kEntrySize];
16284 for (int j = 0; j < Shape::kEntrySize; j++) {
16287 for (int j = 0; j < Shape::kEntrySize; j++) {
16290 for (int j = 0; j < Shape::kEntrySize; j++) {
17849 kHashTableStartIndex + num_buckets + (capacity * kEntrySize), pretenure);
17962 int index = kHashTableStartIndex + nof_buckets + (i * kEntrySize);
