Lines Matching defs:length
273 int length = args_state_info.parameter_count() - 1; // Minus receiver.
292 a.Store(AccessBuilder::ForArgumentsLength(), jsgraph()->Constant(length));
313 int length = args_state_info.parameter_count() - 1; // Minus receiver.
329 a.Store(AccessBuilder::ForArgumentsLength(), jsgraph()->Constant(length));
364 int length = std::max(0, argument_count - start_index);
372 jsgraph()->Constant(length));
407 int length = parameter_count_no_receiver +
411 if (!ab.CanAllocateArray(length, fixed_array_map)) {
414 ab.AllocateArray(length, fixed_array_map);
415 for (int i = 0; i < length; ++i) {
459 // Constructs an array with a variable {length} when no upper bound
462 Node* node, Node* length, MapRef initial_map, ElementsKind elements_kind,
479 length = effect = graph()->NewNode(
480 simplified()->CheckNumber(FeedbackSource{}), length, effect, control);
485 length = effect = graph()->NewNode(
486 simplified()->CheckBounds(FeedbackSource()), length,
495 length, effect, control);
504 a.Store(AccessBuilder::ForJSArrayLength(initial_map.elements_kind()), length);
515 // Constructs an array with a variable {length} when an actual
518 Node* node, Node* length, int capacity, MapRef initial_map,
523 DCHECK(NodeProperties::GetType(length).Is(Type::Number()));
528 if (NodeProperties::GetType(length).Max() > 0.0) {
555 a.Store(AccessBuilder::ForJSArrayLength(elements_kind), length);
604 // Setup elements, properties and length.
607 Node* length = jsgraph()->Constant(static_cast<int>(values.size()));
616 a.Store(AccessBuilder::ForJSArrayLength(elements_kind), length);
665 Node* length = jsgraph()->ZeroConstant();
667 return ReduceNewArray(node, length, capacity, *initial_map, elements_kind,
670 Node* length = NodeProperties::GetValueInput(node, 2);
671 Type length_type = NodeProperties::GetType(length);
674 // cannot be a valid Array length.
678 return ReduceNewArray(node, std::vector<Node*>{length}, *initial_map,
686 // Replace length with a constant in order to protect against a potential
687 // typer bug leading to length > capacity.
688 length = jsgraph()->Constant(capacity);
689 return ReduceNewArray(node, length, capacity, *initial_map, elements_kind,
693 return ReduceNewArray(node, length, *initial_map, elements_kind,
1045 Node* length = jsgraph()->Constant(2);
1061 a.Store(AccessBuilder::ForJSArrayLength(PACKED_ELEMENTS), length);
1135 Node* length = jsgraph()->ZeroConstant();
1139 return ReduceNewArray(node, length, 0, initial_map,
1302 // JSCreateBlockContext[scope[length < limit]](fun)
1367 int length = NameDictionary::EntryToIndex(InternalIndex(capacity));
1368 int size = NameDictionary::SizeFor(length);
1375 jsgraph()->SmiConstant(length));
1392 for (int index = NameDictionary::kElementsStartIndex; index < length;
1854 int const elements_length = boilerplate_elements.length();
1860 if (boilerplate_elements.length() == 0 || elements_map.IsFixedCowArrayMap()) {
1871 int const size = FixedDoubleArray::SizeFor(boilerplate_elements.length());