Lines Matching defs:length
137 return input.length();
192 if (!s.length().has_value()) return base::nullopt;
194 s.object(), static_cast<size_t>(s.length().value()));
1423 // Constant-fold "length" property on constant strings.
1424 if (!object.AsString().length().has_value()) return NoChange();
1425 Node* value = jsgraph()->Constant(object.AsString().length().value());
1565 // Determine the {receiver} length.
1566 Node* length = graph()->NewNode(simplified()->StringLength(), receiver);
1570 value = BuildIndexedStringLoad(receiver, index, length, &effect, &control,
1921 // accesses using the known length, which doesn't change.
1924 // Ensure that {key} is less than {receiver} length.
1925 if (!receiver_ref.AsString().length().has_value()) return NoChange();
1926 Node* length =
1927 jsgraph()->Constant(receiver_ref.AsString().length().value());
1932 Node* value = BuildIndexedStringLoad(receiver, key, length, &effect,
2653 Node* length;
2662 length = jsgraph()->Constant(static_cast<double>(typed_array->length()));
2673 // Load the {receiver}s length.
2674 length = effect = graph()->NewNode(
2751 index, length, effect, control);
2763 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2771 // Do a real bounds check against {length}. This is in order to
2779 index, length, etrue, if_true);
2835 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2842 // Do a real bounds check against {length}. This is in order to
2850 index, length, etrue, if_true);
2883 index, length, effect, control);
2912 // Load the length of the {receiver}.
2913 Node* length = effect =
2941 index, length, effect, control);
2975 graph()->NewNode(simplified()->NumberLessThan(), index, length);
2983 // Do a real bounds check against {length}. This is in order to
2991 index, length, etrue, if_true);
3069 index, length, effect, control);
3093 index, length, etrue, if_true);
3160 // Determine the length of the {elements} backing store.
3173 // [0,length+1[ to be valid. In case {index} equals {length},
3179 : graph()->NewNode(simplified()->NumberAdd(), length,
3204 // Also update the "length" property if {receiver} is a JSArray.
3207 graph()->NewNode(simplified()->NumberLessThan(), index, length);
3220 // Update the JSArray::length field. Since this is observable,
3246 Node* receiver, Node* index, Node* length, Node** effect, Node** control,
3250 // Ensure that the {index} is a valid String length.
3259 graph()->NewNode(simplified()->NumberLessThan(), index, length);
3264 // Do a real bounds check against {length}. This is in order to protect
3271 index, length, *effect, if_true);
3285 // Ensure that {index} is less than {receiver} length.
3289 index, length, *effect, *control);
3305 // store in that case (i.e. when properties->length() >= new_length).
3311 // Compute the length of the old {properties} and the new properties.
3312 int length = map.NextFreePropertyIndex() - map.GetInObjectProperties();
3313 int new_length = length + JSObject::kFieldsAdded;
3317 for (int i = 0; i < length; ++i) {
3328 // Compute new length and hash.
3330 if (length == 0) {