mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
71 lines
2.8 KiB
71 lines
2.8 KiB
// 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.
|
|
|
|
#include "hydrogen-mark-deoptimize.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
void HMarkDeoptimizeOnUndefinedPhase::Run() {
|
|
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->CheckFlag(HValue::kAllowUndefinedAsNaN)) {
|
|
for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
|
|
HValue* use_value = it.value();
|
|
if (!use_value->CheckFlag(HValue::kAllowUndefinedAsNaN)) {
|
|
ProcessPhi(phi);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
void HMarkDeoptimizeOnUndefinedPhase::ProcessPhi(HPhi* phi) {
|
|
ASSERT(phi->CheckFlag(HValue::kAllowUndefinedAsNaN));
|
|
ASSERT(worklist_.is_empty());
|
|
|
|
// Push the phi onto the worklist
|
|
phi->ClearFlag(HValue::kAllowUndefinedAsNaN);
|
|
worklist_.Add(phi, zone());
|
|
|
|
// Process all phis that can reach this phi
|
|
while (!worklist_.is_empty()) {
|
|
phi = worklist_.RemoveLast();
|
|
for (int i = phi->OperandCount() - 1; i >= 0; --i) {
|
|
HValue* input = phi->OperandAt(i);
|
|
if (input->IsPhi() && input->CheckFlag(HValue::kAllowUndefinedAsNaN)) {
|
|
input->ClearFlag(HValue::kAllowUndefinedAsNaN);
|
|
worklist_.Add(HPhi::cast(input), zone());
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
} } // namespace v8::internal
|
|
|