2013-07-08 09:02:09 +00:00
|
|
|
// Copyright 2013 the V8 project authors. All rights reserved.
|
2014-04-29 06:42:26 +00:00
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
2013-07-08 09:02:09 +00:00
|
|
|
|
|
|
|
#include "hydrogen-representation-changes.h"
|
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
void HRepresentationChangesPhase::InsertRepresentationChangeForUse(
|
|
|
|
HValue* value, HValue* use_value, int use_index, Representation to) {
|
|
|
|
// Insert the representation change right before its use. For phi-uses we
|
|
|
|
// insert at the end of the corresponding predecessor.
|
|
|
|
HInstruction* next = NULL;
|
|
|
|
if (use_value->IsPhi()) {
|
|
|
|
next = use_value->block()->predecessors()->at(use_index)->end();
|
|
|
|
} else {
|
|
|
|
next = HInstruction::cast(use_value);
|
|
|
|
}
|
|
|
|
// For constants we try to make the representation change at compile
|
|
|
|
// time. When a representation change is not possible without loss of
|
|
|
|
// information we treat constants like normal instructions and insert the
|
|
|
|
// change instructions for them.
|
|
|
|
HInstruction* new_value = NULL;
|
2013-07-25 11:53:38 +00:00
|
|
|
bool is_truncating_to_smi = use_value->CheckFlag(HValue::kTruncatingToSmi);
|
|
|
|
bool is_truncating_to_int = use_value->CheckFlag(HValue::kTruncatingToInt32);
|
2013-07-08 09:02:09 +00:00
|
|
|
if (value->IsConstant()) {
|
|
|
|
HConstant* constant = HConstant::cast(value);
|
|
|
|
// Try to create a new copy of the constant with the new representation.
|
2013-07-25 11:53:38 +00:00
|
|
|
if (is_truncating_to_int && to.IsInteger32()) {
|
2013-07-23 09:13:59 +00:00
|
|
|
Maybe<HConstant*> res = constant->CopyToTruncatedInt32(graph()->zone());
|
|
|
|
if (res.has_value) new_value = res.value;
|
|
|
|
} else {
|
|
|
|
new_value = constant->CopyToRepresentation(to, graph()->zone());
|
|
|
|
}
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (new_value == NULL) {
|
2013-08-14 08:54:27 +00:00
|
|
|
new_value = new(graph()->zone()) HChange(
|
|
|
|
value, to, is_truncating_to_smi, is_truncating_to_int);
|
2014-02-13 16:09:28 +00:00
|
|
|
if (!use_value->operand_position(use_index).IsUnknown()) {
|
2013-11-18 17:24:00 +00:00
|
|
|
new_value->set_position(use_value->operand_position(use_index));
|
2013-10-21 13:35:48 +00:00
|
|
|
} else {
|
2014-02-13 16:09:28 +00:00
|
|
|
ASSERT(!FLAG_hydrogen_track_positions ||
|
|
|
|
!graph()->info()->IsOptimizing());
|
2013-10-21 13:35:48 +00:00
|
|
|
}
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
new_value->InsertBefore(next);
|
|
|
|
use_value->SetOperandAt(use_index, new_value);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void HRepresentationChangesPhase::InsertRepresentationChangesForValue(
|
|
|
|
HValue* value) {
|
|
|
|
Representation r = value->representation();
|
|
|
|
if (r.IsNone()) return;
|
2014-03-06 09:47:27 +00:00
|
|
|
if (value->HasNoUses()) {
|
|
|
|
if (value->IsForceRepresentation()) value->DeleteAndReplaceWith(NULL);
|
|
|
|
return;
|
|
|
|
}
|
2013-07-08 09:02:09 +00:00
|
|
|
|
|
|
|
for (HUseIterator it(value->uses()); !it.Done(); it.Advance()) {
|
|
|
|
HValue* use_value = it.value();
|
|
|
|
int use_index = it.index();
|
|
|
|
Representation req = use_value->RequiredInputRepresentation(use_index);
|
|
|
|
if (req.IsNone() || req.Equals(r)) continue;
|
|
|
|
InsertRepresentationChangeForUse(value, use_value, use_index, req);
|
|
|
|
}
|
|
|
|
if (value->HasNoUses()) {
|
|
|
|
ASSERT(value->IsConstant());
|
|
|
|
value->DeleteAndReplaceWith(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
// The only purpose of a HForceRepresentation is to represent the value
|
|
|
|
// after the (possible) HChange instruction. We make it disappear.
|
|
|
|
if (value->IsForceRepresentation()) {
|
|
|
|
value->DeleteAndReplaceWith(HForceRepresentation::cast(value)->value());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void HRepresentationChangesPhase::Run() {
|
|
|
|
// Compute truncation flag for phis: Initially assume that all
|
|
|
|
// int32-phis allow truncation and iteratively remove the ones that
|
|
|
|
// are used in an operation that does not allow a truncating
|
|
|
|
// conversion.
|
2013-08-27 13:55:00 +00:00
|
|
|
ZoneList<HPhi*> int_worklist(8, zone());
|
|
|
|
ZoneList<HPhi*> smi_worklist(8, zone());
|
2013-07-08 09:02:09 +00:00
|
|
|
|
|
|
|
const ZoneList<HPhi*>* phi_list(graph()->phi_list());
|
|
|
|
for (int i = 0; i < phi_list->length(); i++) {
|
|
|
|
HPhi* phi = phi_list->at(i);
|
|
|
|
if (phi->representation().IsInteger32()) {
|
|
|
|
phi->SetFlag(HValue::kTruncatingToInt32);
|
2013-07-25 11:53:38 +00:00
|
|
|
} else if (phi->representation().IsSmi()) {
|
|
|
|
phi->SetFlag(HValue::kTruncatingToSmi);
|
2013-08-27 13:55:00 +00:00
|
|
|
phi->SetFlag(HValue::kTruncatingToInt32);
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < phi_list->length(); i++) {
|
|
|
|
HPhi* phi = phi_list->at(i);
|
2013-08-27 13:55:00 +00:00
|
|
|
HValue* value = NULL;
|
|
|
|
if (phi->representation().IsSmiOrInteger32() &&
|
|
|
|
!phi->CheckUsesForFlag(HValue::kTruncatingToInt32, &value)) {
|
|
|
|
int_worklist.Add(phi, zone());
|
|
|
|
phi->ClearFlag(HValue::kTruncatingToInt32);
|
|
|
|
if (FLAG_trace_representation) {
|
|
|
|
PrintF("#%d Phi is not truncating Int32 because of #%d %s\n",
|
|
|
|
phi->id(), value->id(), value->Mnemonic());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (phi->representation().IsSmi() &&
|
|
|
|
!phi->CheckUsesForFlag(HValue::kTruncatingToSmi, &value)) {
|
|
|
|
smi_worklist.Add(phi, zone());
|
|
|
|
phi->ClearFlag(HValue::kTruncatingToSmi);
|
|
|
|
if (FLAG_trace_representation) {
|
|
|
|
PrintF("#%d Phi is not truncating Smi because of #%d %s\n",
|
|
|
|
phi->id(), value->id(), value->Mnemonic());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (!int_worklist.is_empty()) {
|
|
|
|
HPhi* current = int_worklist.RemoveLast();
|
|
|
|
for (int i = 0; i < current->OperandCount(); ++i) {
|
|
|
|
HValue* input = current->OperandAt(i);
|
|
|
|
if (input->IsPhi() &&
|
|
|
|
input->representation().IsSmiOrInteger32() &&
|
|
|
|
input->CheckFlag(HValue::kTruncatingToInt32)) {
|
2013-07-08 09:02:09 +00:00
|
|
|
if (FLAG_trace_representation) {
|
2013-08-27 13:55:00 +00:00
|
|
|
PrintF("#%d Phi is not truncating Int32 because of #%d %s\n",
|
|
|
|
input->id(), current->id(), current->Mnemonic());
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
2013-08-27 13:55:00 +00:00
|
|
|
input->ClearFlag(HValue::kTruncatingToInt32);
|
|
|
|
int_worklist.Add(HPhi::cast(input), zone());
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-08-27 13:55:00 +00:00
|
|
|
while (!smi_worklist.is_empty()) {
|
|
|
|
HPhi* current = smi_worklist.RemoveLast();
|
2013-07-08 09:02:09 +00:00
|
|
|
for (int i = 0; i < current->OperandCount(); ++i) {
|
|
|
|
HValue* input = current->OperandAt(i);
|
|
|
|
if (input->IsPhi() &&
|
2013-08-27 13:55:00 +00:00
|
|
|
input->representation().IsSmi() &&
|
|
|
|
input->CheckFlag(HValue::kTruncatingToSmi)) {
|
2013-07-08 09:02:09 +00:00
|
|
|
if (FLAG_trace_representation) {
|
2013-08-27 13:55:00 +00:00
|
|
|
PrintF("#%d Phi is not truncating Smi because of #%d %s\n",
|
2013-07-08 09:02:09 +00:00
|
|
|
input->id(), current->id(), current->Mnemonic());
|
|
|
|
}
|
2013-07-25 11:53:38 +00:00
|
|
|
input->ClearFlag(HValue::kTruncatingToSmi);
|
2013-08-27 13:55:00 +00:00
|
|
|
smi_worklist.Add(HPhi::cast(input), zone());
|
2013-07-08 09:02:09 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
|
|
|
for (int i = 0; i < blocks->length(); ++i) {
|
|
|
|
// Process phi instructions first.
|
|
|
|
const HBasicBlock* block(blocks->at(i));
|
|
|
|
const ZoneList<HPhi*>* phis = block->phis();
|
|
|
|
for (int j = 0; j < phis->length(); j++) {
|
|
|
|
InsertRepresentationChangesForValue(phis->at(j));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Process normal instructions.
|
|
|
|
for (HInstruction* current = block->first(); current != NULL; ) {
|
|
|
|
HInstruction* next = current->next();
|
|
|
|
InsertRepresentationChangesForValue(current);
|
|
|
|
current = next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} } // namespace v8::internal
|