Lines Matching defs:length
726 // the length and backing store.
732 TNode<Number> length = LoadJSArrayLength(o, kind);
733 index = CheckBounds(index, length);
1183 TNode<Number> length = StringLength(receiver_string);
1186 .Then(_ { return length; })
1192 TNode<Number> finalStart = NumberMin(NumberMax(start_smi, zero), length);
1193 TNode<Number> finalEnd = NumberMin(NumberMax(end_smi, zero), length);
1207 TNode<Number> length = StringLength(receiver_string);
1210 TNode<Number> clamped_start = NumberMin(NumberMax(start_smi, zero), length);
1212 int search_string_length = search_element_string.length().value();
1218 NumberLessThan(NumberSubtract(length, clamped_start),
1252 TNode<Number> length = StringLength(receiver_string);
1255 TNode<Number> clamped_start = NumberMin(NumberMax(start_smi, zero), length);
1262 NumberSubtract(length, clamped_start), search_string_length);
1293 TNode<Number> length = StringLength(receiver_string);
1296 .Then(_ { return length; })
1304 .Then(_ { return NumberMax(NumberAdd(length, start_smi), zero); })
1305 .Else(_ { return NumberMin(start_smi, length); })
1314 .Then(_ { return NumberMax(NumberAdd(length, end_smi), zero); })
1315 .Else(_ { return NumberMin(end_smi, length); })
1650 // If the array length >= kMaxFastArrayLength, then CreateArray
1688 // this loop if the input array length is non-zero, and "new Array({x > 0})"
2126 TNode<Number> length = LoadJSArrayLength(receiver, kind);
2134 // therefore needs to be added to the length. If the result is still
2139 return NumberMax(NumberAdd(length, from_index_smi),
2148 context, elements, search_element, length, from_index);
2733 // whether the length and name property are in the original state.
2736 // Check whether the length and name properties are still present
2764 broker(), "name or length descriptors on map " << receiver_map);
3615 // 1. Let max_arg be the length of the longest type list of the entries in
3619 // 4. Remove from the set all entries whose type list is not of length
3637 // Calculates the length of the longest type list of the entries in
3649 // Only considers entries whose type list length matches arg_count.
3996 Node* length = effect = graph()->NewNode(
3999 Node* check = graph()->NewNode(simplified()->NumberEqual(), length,
4031 // Ignore uses for arguments#length.
4237 // Find array length and elements' kind from the feedback's allocation
4285 // Speculate on that array's length being equal to the dynamic length of
4373 const int bound_arguments_length = bound_arguments.length();
4928 TNode<Number> length = TNode<Number>::UncheckedCast(
4930 return SelectIf<Object>(NumberEqual(length, ZeroConstant()))
5159 const int bound_arguments_length = bound_arguments.length();
5362 Node* length = graph()->NewNode(simplified()->StringLength(), receiver);
5364 // Replace {end} argument with {length} if it is undefined.
5373 Node* vtrue = length;
5392 graph()->NewNode(simplified()->NumberAdd(), length, start),
5404 graph()->NewNode(simplified()->NumberSubtract(), length, initStart));
5608 // Load the "length" property of the {receiver}.
5609 Node* length = effect = graph()->NewNode(
5612 return_value = length;
5616 // Compute the resulting "length" of the {receiver}.
5618 simplified()->NumberAdd(), length, jsgraph()->Constant(num_values));
5635 graph()->NewNode(simplified()->NumberAdd(), length,
5639 // Update the JSArray::length field. Since this is observable,
5648 Node* index = graph()->NewNode(simplified()->NumberAdd(), length,
5727 // Load the "length" property of the {receiver}.
5728 Node* length = effect = graph()->NewNode(
5733 Node* check = graph()->NewNode(simplified()->NumberEqual(), length,
5761 // Compute the new {length}.
5763 length, jsgraph()->OneConstant());
5770 new_length, length, efalse, if_false);
5772 // Store the new {length} to the {receiver}.
5874 // Load length of the {receiver}.
5875 Node* length = effect = graph()->NewNode(
5880 Node* check0 = graph()->NewNode(simplified()->NumberEqual(), length,
5895 graph()->NewNode(simplified()->NumberLessThanOrEqual(), length,
5935 graph()->NewNode(simplified()->NumberLessThan(), index, length);
5975 // Compute the new {length}.
5977 length, jsgraph()->OneConstant());
5984 new_length, length, etrue1, if_true1);
5986 // Store the new {length} to the {receiver}.
6084 // {receiver}s "length" property). This logic should be in sync with
6328 // Load the length of the {iterated_object}. Due to the map checks we
6329 // already know something about the length here, which we can leverage
6335 Node* length = effect = graph()->NewNode(
6339 Node* check = graph()->NewNode(simplified()->NumberLessThan(), index, length);
6353 index, length, etrue, if_true);
6436 // iterator.[[NextIndex]] >= array.length, stop iterating.
6442 // value that will never pass the length check again (aka the maximum
6446 // to eliminate the map checks and "length" accesses in for..of loops.
6448 // This is not necessary for JSTypedArray's, since the length of those
6494 // Determine the {receiver} length.
6523 // Second, If search_element is definitely a string and its length is less
6533 if (search_element_string.length().has_value()) {
6534 int length = search_element_string.length().value();
6535 // If search_element's length is less or equal than
6538 if (length <= kMaxInlineMatchSequence) {
6569 // Determine the {receiver} length.
6784 Node* length = graph()->NewNode(simplified()->StringLength(), string);
6786 // branch0: if (index < length)
6788 graph()->NewNode(simplified()->NumberLessThan(), index, length);
6859 Node* length = graph()->NewNode(simplified()->NumberAdd(), receiver_length,
6861 length = effect = graph()->NewNode(
6862 simplified()->CheckBounds(p.feedback()), length,
6865 Node* value = graph()->NewNode(simplified()->StringConcat(), length, receiver,
7866 size_t length = dataview.byte_length();
7867 if (length < element_size) return NoChange();
7869 // Check that the {offset} is within range of the {length}.
7870 Node* byte_length = jsgraph()->Constant(length - (element_size - 1));