Lines Matching defs:capacity
460 // is known for the capacity.
516 // upper bound is known for the {capacity}.
518 Node* node, Node* length, int capacity, MapRef initial_map,
541 if (capacity == 0) {
545 AllocateElements(effect, control, elements_kind, capacity, allocation);
666 int capacity = JSArray::kPreallocatedArrayElements;
667 return ReduceNewArray(node, length, capacity, *initial_map, elements_kind,
685 int capacity = static_cast<int>(length_type.Max());
687 // typer bug leading to length > capacity.
688 length = jsgraph()->Constant(capacity);
689 return ReduceNewArray(node, length, capacity, *initial_map, elements_kind,
1364 int capacity =
1366 DCHECK(base::bits::IsPowerOfTwo(capacity));
1367 int length = NameDictionary::EntryToIndex(InternalIndex(capacity));
1382 jsgraph()->SmiConstant(capacity));
1618 int capacity,
1620 DCHECK_LE(1, capacity);
1621 DCHECK_LE(capacity, JSArray::kInitialMaxFastElementArray);
1633 a.AllocateArray(capacity, MakeRef(broker(), elements_map), allocation);
1634 for (int i = 0; i < capacity; ++i) {
1645 int const capacity = static_cast<int>(values.size());
1646 DCHECK_LE(1, capacity);
1647 DCHECK_LE(capacity, JSArray::kInitialMaxFastElementArray);
1658 a.AllocateArray(capacity, MakeRef(broker(), elements_map), allocation);
1659 for (int i = 0; i < capacity; ++i) {