[heap] Simplify adjusting of live bytes.

src/runtime/runtime-array.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/runtime/runtime-utils.h"
 
 #include "src/arguments.h"
 #include "src/code-stubs.h"
 #include "src/conversions-inl.h"
 #include "src/elements.h"
@@ skipping 231 matching lines @@
   Handle<FixedArray> keys =
       accumulator.GetKeys(GetKeysConversion::kKeepNumbers);
   int j = 0;
   for (int i = 0; i < keys->length(); i++) {
     if (NumberToUint32(keys->get(i)) >= length) continue;
     if (i != j) keys->set(j, keys->get(i));
     j++;
   }
 
   if (j != keys->length()) {
-    isolate->heap()->RightTrimFixedArray<Heap::CONCURRENT_TO_SWEEPER>(
-        *keys, keys->length() - j);
+    isolate->heap()->RightTrimFixedArray(*keys, keys->length() - j);
   }
 
   return *isolate->factory()->NewJSArrayWithElements(keys);
 }
 
 
 namespace {
 
 Object* ArrayConstructorCommon(Isolate* isolate, Handle<JSFunction> constructor,
                                Handle<JSReceiver> new_target,
@@ skipping 410 matching lines @@
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, spreaded,
       Execution::Call(isolate, spread_iterable_function,
                       isolate->factory()->undefined_value(), 1, &spread));
 
   return *spreaded;
 }
 
 }  // namespace internal
 }  // namespace v8