Fix sequence of element access in array builtins.
R=rossberg@chromium.org BUG=v8:1790 TEST=mjsunit/regress/regress-1790,test262/15.4.4.22-9-9 Review URL: https://chromiumcodereview.appspot.com/9419044 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@10737 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
parent
1dd2b094a5
commit
e423637898
40
src/array.js
40
src/array.js
@ -1024,10 +1024,10 @@ function ArrayFilter(f, receiver) {
|
||||
var accumulator = new InternalArray();
|
||||
var accumulator_length = 0;
|
||||
for (var i = 0; i < length; i++) {
|
||||
var current = array[i];
|
||||
if (!IS_UNDEFINED(current) || i in array) {
|
||||
if (%_CallFunction(receiver, current, i, array, f)) {
|
||||
accumulator[accumulator_length++] = current;
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
if (%_CallFunction(receiver, element, i, array, f)) {
|
||||
accumulator[accumulator_length++] = element;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1057,9 +1057,9 @@ function ArrayForEach(f, receiver) {
|
||||
}
|
||||
|
||||
for (var i = 0; i < length; i++) {
|
||||
var current = array[i];
|
||||
if (!IS_UNDEFINED(current) || i in array) {
|
||||
%_CallFunction(receiver, current, i, array, f);
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
%_CallFunction(receiver, element, i, array, f);
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1088,9 +1088,9 @@ function ArraySome(f, receiver) {
|
||||
}
|
||||
|
||||
for (var i = 0; i < length; i++) {
|
||||
var current = array[i];
|
||||
if (!IS_UNDEFINED(current) || i in array) {
|
||||
if (%_CallFunction(receiver, current, i, array, f)) return true;
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
if (%_CallFunction(receiver, element, i, array, f)) return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
@ -1118,9 +1118,9 @@ function ArrayEvery(f, receiver) {
|
||||
}
|
||||
|
||||
for (var i = 0; i < length; i++) {
|
||||
var current = array[i];
|
||||
if (!IS_UNDEFINED(current) || i in array) {
|
||||
if (!%_CallFunction(receiver, current, i, array, f)) return false;
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
if (!%_CallFunction(receiver, element, i, array, f)) return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
@ -1149,9 +1149,9 @@ function ArrayMap(f, receiver) {
|
||||
var result = new $Array();
|
||||
var accumulator = new InternalArray(length);
|
||||
for (var i = 0; i < length; i++) {
|
||||
var current = array[i];
|
||||
if (!IS_UNDEFINED(current) || i in array) {
|
||||
accumulator[i] = %_CallFunction(receiver, current, i, array, f);
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
accumulator[i] = %_CallFunction(receiver, element, i, array, f);
|
||||
}
|
||||
}
|
||||
%MoveArrayContents(accumulator, result);
|
||||
@ -1308,8 +1308,8 @@ function ArrayReduce(callback, current) {
|
||||
|
||||
var receiver = %GetDefaultReceiver(callback);
|
||||
for (; i < length; i++) {
|
||||
var element = array[i];
|
||||
if (!IS_UNDEFINED(element) || i in array) {
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
current = %_CallFunction(receiver, current, element, i, array, callback);
|
||||
}
|
||||
}
|
||||
@ -1345,8 +1345,8 @@ function ArrayReduceRight(callback, current) {
|
||||
|
||||
var receiver = %GetDefaultReceiver(callback);
|
||||
for (; i >= 0; i--) {
|
||||
var element = array[i];
|
||||
if (!IS_UNDEFINED(element) || i in array) {
|
||||
if (i in array) {
|
||||
var element = array[i];
|
||||
current = %_CallFunction(receiver, current, element, i, array, callback);
|
||||
}
|
||||
}
|
||||
|
58
test/mjsunit/regress/regress-1790.js
Normal file
58
test/mjsunit/regress/regress-1790.js
Normal file
@ -0,0 +1,58 @@
|
||||
// Copyright 2012 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.
|
||||
|
||||
// Regression test checking that the sequence of element access in built-in
|
||||
// array functions is specification conform (i.e. [[HasProperty]] might return
|
||||
// bogus result after [[Get]] has been called).
|
||||
|
||||
function CheckSequence(builtin, callback) {
|
||||
var array = [1,2,3];
|
||||
var callback_count = 0;
|
||||
var callback_wrapper = function() {
|
||||
callback_count++;
|
||||
return callback()
|
||||
}
|
||||
|
||||
// Define getter that will delete itself upon first invocation.
|
||||
Object.defineProperty(array, '1', {
|
||||
get: function () { delete array[1]; },
|
||||
configurable: true
|
||||
});
|
||||
|
||||
assertTrue(array.hasOwnProperty('1'));
|
||||
builtin.apply(array, [callback_wrapper, 'argument']);
|
||||
assertFalse(array.hasOwnProperty('1'));
|
||||
assertEquals(3, callback_count);
|
||||
}
|
||||
|
||||
CheckSequence(Array.prototype.every, function() { return true; });
|
||||
CheckSequence(Array.prototype.filter, function() { return true; });
|
||||
CheckSequence(Array.prototype.forEach, function() { return 0; });
|
||||
CheckSequence(Array.prototype.map, function() { return 0; });
|
||||
CheckSequence(Array.prototype.reduce, function() { return 0; });
|
||||
CheckSequence(Array.prototype.reduceRight, function() { return 0; });
|
||||
CheckSequence(Array.prototype.some, function() { return false; });
|
@ -59,9 +59,6 @@ S10.4.2.1_A1: FAIL
|
||||
15.2.3.7-6-a-284: FAIL
|
||||
15.2.3.7-6-a-285: FAIL
|
||||
|
||||
# V8 Bug: http://code.google.com/p/v8/issues/detail?id=1790
|
||||
15.4.4.22-9-9: FAIL
|
||||
|
||||
# Invalid test cases (recent change adding var changes semantics)
|
||||
S8.3_A1_T1: FAIL
|
||||
S15.3_A3_T1: FAIL
|
||||
|
Loading…
Reference in New Issue
Block a user