Fix parallel recompilation wrt initial object/array map dependency.
R=ulan@chromium.org BUG= Review URL: https://chromiumcodereview.appspot.com/16641002 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@15030 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
parent
b12e6a9c1e
commit
1594eca8ed
@ -93,12 +93,6 @@ void LCodeGen::FinishCode(Handle<Code> code) {
|
||||
transition_maps_.at(i)->AddDependentCode(
|
||||
DependentCode::kTransitionGroup, code);
|
||||
}
|
||||
if (graph()->depends_on_empty_array_proto_elements()) {
|
||||
isolate()->initial_object_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
isolate()->initial_array_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
@ -402,13 +402,15 @@ class HGraph: public ZoneObject {
|
||||
}
|
||||
|
||||
void MarkDependsOnEmptyArrayProtoElements() {
|
||||
// Add map dependency if not already added.
|
||||
if (depends_on_empty_array_proto_elements_) return;
|
||||
isolate()->initial_object_prototype()->map()->AddDependentCompilationInfo(
|
||||
DependentCode::kElementsCantBeAddedGroup, info());
|
||||
isolate()->initial_array_prototype()->map()->AddDependentCompilationInfo(
|
||||
DependentCode::kElementsCantBeAddedGroup, info());
|
||||
depends_on_empty_array_proto_elements_ = true;
|
||||
}
|
||||
|
||||
bool depends_on_empty_array_proto_elements() {
|
||||
return depends_on_empty_array_proto_elements_;
|
||||
}
|
||||
|
||||
void RecordUint32Instruction(HInstruction* instr) {
|
||||
if (uint32_instructions_ == NULL) {
|
||||
uint32_instructions_ = new(zone()) ZoneList<HInstruction*>(4, zone());
|
||||
|
@ -115,12 +115,6 @@ void LCodeGen::FinishCode(Handle<Code> code) {
|
||||
transition_maps_.at(i)->AddDependentCode(
|
||||
DependentCode::kTransitionGroup, code);
|
||||
}
|
||||
if (graph()->depends_on_empty_array_proto_elements()) {
|
||||
isolate()->initial_object_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
isolate()->initial_array_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
@ -93,12 +93,6 @@ void LCodeGen::FinishCode(Handle<Code> code) {
|
||||
transition_maps_.at(i)->AddDependentCode(
|
||||
DependentCode::kTransitionGroup, code);
|
||||
}
|
||||
if (graph()->depends_on_empty_array_proto_elements()) {
|
||||
isolate()->initial_object_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
isolate()->initial_array_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
@ -98,12 +98,6 @@ void LCodeGen::FinishCode(Handle<Code> code) {
|
||||
transition_maps_.at(i)->AddDependentCode(
|
||||
DependentCode::kTransitionGroup, code);
|
||||
}
|
||||
if (graph()->depends_on_empty_array_proto_elements()) {
|
||||
isolate()->initial_object_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
isolate()->initial_array_prototype()->map()->AddDependentCode(
|
||||
DependentCode::kElementsCantBeAddedGroup, code);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
50
test/mjsunit/parallel-initial-prototype-change.js
Normal file
50
test/mjsunit/parallel-initial-prototype-change.js
Normal file
@ -0,0 +1,50 @@
|
||||
// Copyright 2013 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.
|
||||
|
||||
// Flags: --allow-natives-syntax
|
||||
// Flags: --parallel-recompilation --parallel-recompilation-delay=50
|
||||
|
||||
function assertUnoptimized(fun) {
|
||||
assertTrue(%GetOptimizationStatus(fun) != 1);
|
||||
}
|
||||
|
||||
function f1(a, i) {
|
||||
return a[i] + 0.5;
|
||||
}
|
||||
|
||||
var arr = [0.0,,2.5];
|
||||
assertEquals(0.5, f1(arr, 0));
|
||||
assertEquals(0.5, f1(arr, 0));
|
||||
|
||||
// Optimized code of f1 depends on initial object and array maps.
|
||||
%OptimizeFunctionOnNextCall(f1, "parallel");
|
||||
assertEquals(0.5, f1(arr, 0));
|
||||
assertUnoptimized(f1); // Not yet optimized.
|
||||
Object.prototype[1] = 1.5; // Invalidate current initial object map.
|
||||
assertEquals(2, f1(arr, 1));
|
||||
%CompleteOptimization(f1); // Conclude optimization with...
|
||||
assertUnoptimized(f1); // ... bailing out due to map dependency.
|
Loading…
Reference in New Issue
Block a user