Fix materialization of captured objects with field tracking.

R=titzer@chromium.org
BUG=chromium:298990
TEST=mjsunit/compiler/escape-analysis-representation

Review URL: https://codereview.chromium.org/35133003

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@17321 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent d65cc1e2
......@@ -1614,7 +1614,10 @@ Handle<Object> Deoptimizer::MaterializeNextHeapObject() {
}
} else {
// Dispatch on the instance type of the object to be materialized.
Handle<Map> map = Handle<Map>::cast(MaterializeNextValue());
// We also need to make sure that the representation of all fields
// in the given object are general enough to hold a tagged value.
Handle<Map> map = Map::GeneralizeAllFieldRepresentations(
Handle<Map>::cast(MaterializeNextValue()), Representation::Tagged());
switch (map->instance_type()) {
case HEAP_NUMBER_TYPE: {
Handle<HeapNumber> object = isolate_->factory()->NewHeapNumber(0.0);
......
......@@ -2734,6 +2734,21 @@ Handle<Map> Map::GeneralizeRepresentation(Handle<Map> old_map,
}
// Generalize the representation of all FIELD descriptors.
Handle<Map> Map::GeneralizeAllFieldRepresentations(
Handle<Map> map,
Representation new_representation) {
Handle<DescriptorArray> descriptors(map->instance_descriptors());
for (int i = 0; i < map->NumberOfOwnDescriptors(); i++) {
PropertyDetails details = descriptors->GetDetails(i);
if (details.type() == FIELD) {
map = GeneralizeRepresentation(map, i, new_representation, FORCE_FIELD);
}
}
return map;
}
Map* Map::CurrentMapForDeprecated() {
DisallowHeapAllocation no_allocation;
if (!is_deprecated()) return this;
......
......@@ -5769,6 +5769,9 @@ class Map: public HeapObject {
int target_number_of_fields,
int target_inobject,
int target_unused);
static Handle<Map> GeneralizeAllFieldRepresentations(
Handle<Map> map,
Representation new_representation);
static Handle<Map> GeneralizeRepresentation(
Handle<Map> map,
int modify_index,
......
// 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 --use-escape-analysis --max-opt-count=100
// This tests that captured objects materialized through the deoptimizer
// have field descriptors with a representation matching the values that
// have actually been stored in the object.
var values = [ function() { return {}; },
function() { return 23; },
function() { return 4.2; } ];
function constructor(value_track) {
this.x = value_track();
}
function access(value_track, value_break, deopt) {
var o = new constructor(value_track);
o.x = value_break;
deopt.deopt
assertEquals(value_break, o.x);
}
function test(value_track, value_break) {
var deopt = { deopt:false };
// Warm-up field tracking to a certain representation.
access(value_track, value_track(), deopt);
access(value_track, value_track(), deopt);
%OptimizeFunctionOnNextCall(access);
access(value_track, value_track(), deopt);
// Deoptimize on a run with a different representation.
delete deopt.deopt;
access(value_track, value_break(), deopt);
// Clear type feedback of the access function for next run.
%ClearFunctionTypeFeedback(access);
// Also make sure the initial map of the constructor is reset.
constructor.prototype = {};
}
for (var i = 0; i < values.length; i++) {
for (var j = 0; j < values.length; j++) {
test(values[i], values[j])
}
}
......@@ -301,3 +301,43 @@
delete deopt.deopt;
deep(); deep();
})();
// Test materialization of a field that requires a Smi value.
(function testSmiField() {
var deopt = { deopt:false };
function constructor() {
this.x = 1;
}
function field(x) {
var o = new constructor();
o.x = x;
deopt.deopt
assertEquals(x, o.x);
}
field(1); field(2);
%OptimizeFunctionOnNextCall(field);
field(3); field(4);
delete deopt.deopt;
field(5.5); field(6.5);
})();
// Test materialization of a field that requires a heap object value.
(function testHeapObjectField() {
var deopt = { deopt:false };
function constructor() {
this.x = {};
}
function field(x) {
var o = new constructor();
o.x = x;
deopt.deopt
assertEquals(x, o.x);
}
field({}); field({});
%OptimizeFunctionOnNextCall(field);
field({}); field({});
delete deopt.deopt;
field(1); field(2);
})();
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment