2013-07-11 08:21:50 +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-11 08:21:50 +00:00
|
|
|
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/hydrogen-canonicalize.h"
|
|
|
|
#include "src/hydrogen-redundant-phi.h"
|
2013-07-11 08:21:50 +00:00
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
void HCanonicalizePhase::Run() {
|
|
|
|
const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
|
|
|
|
// Before removing no-op instructions, save their semantic value.
|
|
|
|
// We must be careful not to set the flag unnecessarily, because GVN
|
|
|
|
// cannot identify two instructions when their flag value differs.
|
|
|
|
for (int i = 0; i < blocks->length(); ++i) {
|
|
|
|
for (HInstructionIterator it(blocks->at(i)); !it.Done(); it.Advance()) {
|
|
|
|
HInstruction* instr = it.Current();
|
2013-07-25 11:53:38 +00:00
|
|
|
if (instr->IsArithmeticBinaryOperation()) {
|
|
|
|
if (instr->representation().IsInteger32()) {
|
|
|
|
if (instr->HasAtLeastOneUseWithFlagAndNoneWithout(
|
|
|
|
HInstruction::kTruncatingToInt32)) {
|
|
|
|
instr->SetFlag(HInstruction::kAllUsesTruncatingToInt32);
|
|
|
|
}
|
|
|
|
} else if (instr->representation().IsSmi()) {
|
|
|
|
if (instr->HasAtLeastOneUseWithFlagAndNoneWithout(
|
|
|
|
HInstruction::kTruncatingToSmi)) {
|
|
|
|
instr->SetFlag(HInstruction::kAllUsesTruncatingToSmi);
|
2013-08-27 13:55:00 +00:00
|
|
|
} else if (instr->HasAtLeastOneUseWithFlagAndNoneWithout(
|
|
|
|
HInstruction::kTruncatingToInt32)) {
|
|
|
|
// Avoid redundant minus zero check
|
|
|
|
instr->SetFlag(HInstruction::kAllUsesTruncatingToInt32);
|
2013-07-25 11:53:38 +00:00
|
|
|
}
|
|
|
|
}
|
2013-07-11 08:21:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-10-10 08:50:44 +00:00
|
|
|
|
2013-07-11 08:21:50 +00:00
|
|
|
// Perform actual Canonicalization pass.
|
2013-10-10 08:50:44 +00:00
|
|
|
HRedundantPhiEliminationPhase redundant_phi_eliminator(graph());
|
2013-07-11 08:21:50 +00:00
|
|
|
for (int i = 0; i < blocks->length(); ++i) {
|
2013-10-10 08:50:44 +00:00
|
|
|
// Eliminate redundant phis in the block first; changes to their inputs
|
|
|
|
// might have made them redundant, and eliminating them creates more
|
|
|
|
// opportunities for constant folding and strength reduction.
|
|
|
|
redundant_phi_eliminator.ProcessBlock(blocks->at(i));
|
|
|
|
// Now canonicalize each instruction.
|
2013-07-11 08:21:50 +00:00
|
|
|
for (HInstructionIterator it(blocks->at(i)); !it.Done(); it.Advance()) {
|
|
|
|
HInstruction* instr = it.Current();
|
|
|
|
HValue* value = instr->Canonicalize();
|
|
|
|
if (value != instr) instr->DeleteAndReplaceWith(value);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
} } // namespace v8::internal
|