Lines Matching defs:new_length
489 int new_length = len + to_add;
491 if (new_length > elms->length()) {
493 int capacity = new_length + (new_length >> 1) + 16;
520 array->set_length(Smi::FromInt(new_length));
521 return Smi::FromInt(new_length);
534 int new_length = len + to_add;
538 if (new_length > elms_len) {
540 int capacity = new_length + (new_length >> 1) + 16;
552 // to_add is > 0 and new_length <= elms_len, so elms_obj cannot be the
570 array->set_length(Smi::FromInt(new_length));
571 return Smi::FromInt(new_length);
592 int new_length = len - 1;
594 if (accessor->HasElement(array, array, new_length, elms_obj)) {
595 maybe_result = accessor->Get(array, array, new_length, elms_obj);
601 accessor->SetLength(array, Smi::FromInt(new_length));
680 int new_length = len + to_add;
690 if (new_length > elms->length()) {
692 int capacity = new_length + (new_length >> 1) + 16;
720 array->set_length(Smi::FromInt(new_length));
721 return Smi::FromInt(new_length);
922 int new_length = len - actual_delete_count + item_count;
925 if (new_length > len && IsFastDoubleElementsKind(elements_kind)) {
929 if (new_length == 0) {
984 FillWithHoles(elms, new_length, len);
991 FillWithHoles(heap, elms, new_length, len);
1001 if (new_length > elms->length()) {
1003 int capacity = new_length + (new_length >> 1) + 16;
1059 array->set_length(Smi::FromInt(new_length));
