Properly handle FastDoubleArrays in Runtime_MoveArrayContents
BUG=91013 TEST=regress91013.js Review URL: http://codereview.chromium.org/7551004 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@8773 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
parent
6bc1aa0db2
commit
008f834117
@ -1339,6 +1339,8 @@ void JSObject::set_elements(HeapObject* value, WriteBarrierMode mode) {
|
||||
ASSERT(map()->has_fast_elements() ==
|
||||
(value->map() == GetHeap()->fixed_array_map() ||
|
||||
value->map() == GetHeap()->fixed_cow_array_map()));
|
||||
ASSERT(map()->has_fast_double_elements() ==
|
||||
value->IsFixedDoubleArray());
|
||||
ASSERT(value->HasValidElements());
|
||||
WRITE_FIELD(this, kElementsOffset, value);
|
||||
CONDITIONAL_WRITE_BARRIER(GetHeap(), this, kElementsOffset, mode);
|
||||
|
@ -9589,6 +9589,9 @@ RUNTIME_FUNCTION(MaybeObject*, Runtime_MoveArrayContents) {
|
||||
if (new_elements->map() == isolate->heap()->fixed_array_map() ||
|
||||
new_elements->map() == isolate->heap()->fixed_cow_array_map()) {
|
||||
maybe_new_map = to->map()->GetFastElementsMap();
|
||||
} else if (new_elements->map() ==
|
||||
isolate->heap()->fixed_double_array_map()) {
|
||||
maybe_new_map = to->map()->GetFastDoubleElementsMap();
|
||||
} else {
|
||||
maybe_new_map = to->map()->GetSlowElementsMap();
|
||||
}
|
||||
@ -9676,12 +9679,13 @@ RUNTIME_FUNCTION(MaybeObject*, Runtime_GetArrayKeys) {
|
||||
}
|
||||
return *isolate->factory()->NewJSArrayWithElements(keys);
|
||||
} else {
|
||||
ASSERT(array->HasFastElements());
|
||||
ASSERT(array->HasFastElements() || array->HasFastDoubleElements());
|
||||
Handle<FixedArray> single_interval = isolate->factory()->NewFixedArray(2);
|
||||
// -1 means start of array.
|
||||
single_interval->set(0, Smi::FromInt(-1));
|
||||
FixedArrayBase* elements = FixedArrayBase::cast(array->elements());
|
||||
uint32_t actual_length =
|
||||
static_cast<uint32_t>(FixedArray::cast(array->elements())->length());
|
||||
static_cast<uint32_t>(elements->length());
|
||||
uint32_t min_length = actual_length < length ? actual_length : length;
|
||||
Handle<Object> length_object =
|
||||
isolate->factory()->NewNumber(static_cast<double>(min_length));
|
||||
|
36
test/mjsunit/regress/regress-91010.js
Normal file
36
test/mjsunit/regress/regress-91010.js
Normal file
@ -0,0 +1,36 @@
|
||||
// Copyright 2011 the V8 project authors. All rights reserved.
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following
|
||||
// disclaimer in the documentation and/or other materials provided
|
||||
// with the distribution.
|
||||
// * Neither the name of Google Inc. nor the names of its
|
||||
// contributors may be used to endorse or promote products derived
|
||||
// from this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
try {
|
||||
try {
|
||||
var N = 100*1000;
|
||||
var array = Array(N);
|
||||
for (var i = 0; i != N; ++i)
|
||||
array[i] = i;
|
||||
} catch(ex) {}
|
||||
array.unshift('Kibo');
|
||||
} catch(ex) {}
|
Loading…
Reference in New Issue
Block a user