Minor change to for-in
Return (smi) 0 instead of object null from the FILTER_KEY builtin. Add a test which tests keys being deleted during for-in. Review URL: http://codereview.chromium.org/3170004 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@5243 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
parent
7d20398fd3
commit
fcfe6d74d9
@ -2481,11 +2481,8 @@ void CodeGenerator::VisitForInStatement(ForInStatement* node) {
|
||||
frame_->EmitPush(r0);
|
||||
frame_->EmitPush(r3); // push entry
|
||||
frame_->InvokeBuiltin(Builtins::FILTER_KEY, CALL_JS, 2);
|
||||
__ mov(r3, Operand(r0));
|
||||
|
||||
__ mov(r3, Operand(r0), SetCC);
|
||||
// If the property has been removed while iterating, we just skip it.
|
||||
__ LoadRoot(ip, Heap::kNullValueRootIndex);
|
||||
__ cmp(r3, ip);
|
||||
node->continue_target()->Branch(eq);
|
||||
|
||||
end_del_check.Bind();
|
||||
|
@ -956,15 +956,13 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) {
|
||||
__ cmp(r4, Operand(r2));
|
||||
__ b(eq, &update_each);
|
||||
|
||||
// Convert the entry to a string or null if it isn't a property
|
||||
// anymore. If the property has been removed while iterating, we
|
||||
// Convert the entry to a string or (smi) 0 if it isn't a property
|
||||
// any more. If the property has been removed while iterating, we
|
||||
// just skip it.
|
||||
__ push(r1); // Enumerable.
|
||||
__ push(r3); // Current entry.
|
||||
__ InvokeBuiltin(Builtins::FILTER_KEY, CALL_JS);
|
||||
__ mov(r3, Operand(r0));
|
||||
__ LoadRoot(ip, Heap::kNullValueRootIndex);
|
||||
__ cmp(r3, ip);
|
||||
__ mov(r3, Operand(r0), SetCC);
|
||||
__ b(eq, loop_statement.continue_target());
|
||||
|
||||
// Update the 'each' property or variable from the possibly filtered
|
||||
|
@ -4610,7 +4610,7 @@ void CodeGenerator::VisitForInStatement(ForInStatement* node) {
|
||||
__ mov(ebx, Operand(eax));
|
||||
|
||||
// If the property has been removed while iterating, we just skip it.
|
||||
__ cmp(ebx, Factory::null_value());
|
||||
__ test(ebx, Operand(ebx));
|
||||
node->continue_target()->Branch(equal);
|
||||
|
||||
end_del_check.Bind();
|
||||
|
@ -1048,7 +1048,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) {
|
||||
__ push(ecx); // Enumerable.
|
||||
__ push(ebx); // Current entry.
|
||||
__ InvokeBuiltin(Builtins::FILTER_KEY, CALL_FUNCTION);
|
||||
__ cmp(eax, Factory::null_value());
|
||||
__ test(eax, Operand(eax));
|
||||
__ j(equal, loop_statement.continue_target());
|
||||
__ mov(ebx, Operand(eax));
|
||||
|
||||
|
@ -387,11 +387,11 @@ function GET_KEYS() {
|
||||
|
||||
// Filter a given key against an object by checking if the object
|
||||
// has a property with the given key; return the key as a string if
|
||||
// it has. Otherwise returns null. Used in for-in statements.
|
||||
// it has. Otherwise returns 0 (smi). Used in for-in statements.
|
||||
function FILTER_KEY(key) {
|
||||
var string = %ToString(key);
|
||||
if (%HasProperty(this, string)) return string;
|
||||
return null;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
|
@ -3925,7 +3925,7 @@ void CodeGenerator::VisitForInStatement(ForInStatement* node) {
|
||||
__ movq(rbx, rax);
|
||||
|
||||
// If the property has been removed while iterating, we just skip it.
|
||||
__ CompareRoot(rbx, Heap::kNullValueRootIndex);
|
||||
__ SmiCompare(rbx, Smi::FromInt(0));
|
||||
node->continue_target()->Branch(equal);
|
||||
|
||||
end_del_check.Bind();
|
||||
|
@ -1053,7 +1053,7 @@ void FullCodeGenerator::VisitForInStatement(ForInStatement* stmt) {
|
||||
__ push(rcx); // Enumerable.
|
||||
__ push(rbx); // Current entry.
|
||||
__ InvokeBuiltin(Builtins::FILTER_KEY, CALL_FUNCTION);
|
||||
__ CompareRoot(rax, Heap::kNullValueRootIndex);
|
||||
__ SmiCompare(rax, Smi::FromInt(0));
|
||||
__ j(equal, loop_statement.continue_target());
|
||||
__ movq(rbx, rax);
|
||||
|
||||
|
50
test/mjsunit/for-in-delete.js
Normal file
50
test/mjsunit/for-in-delete.js
Normal file
@ -0,0 +1,50 @@
|
||||
// Copyright 2010 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.
|
||||
|
||||
// Test that properties deleted during a for-in iteration do not show up in
|
||||
// the for-in.
|
||||
|
||||
function f(o, expected, del) {
|
||||
var index = 0;
|
||||
for (p in o) {
|
||||
if (del) delete o[del];
|
||||
assertEquals(expected[index], p);
|
||||
index++;
|
||||
}
|
||||
assertEquals(expected.length, index);
|
||||
}
|
||||
|
||||
var o = {}
|
||||
o.a = 1;
|
||||
o.b = 2;
|
||||
o.c = 3;
|
||||
o.d = 3;
|
||||
|
||||
f(o, ['a', 'b', 'c', 'd']);
|
||||
f(o, ['a', 'b', 'c', 'd']);
|
||||
f(o, ['a', 'c', 'd'], 'b');
|
||||
f(o, ['a', 'c'], 'd');
|
Loading…
Reference in New Issue
Block a user