mirror of
https://github.com/nodejs/node.git
synced 2025-05-15 11:22:59 +00:00
1d29d81c69
PR-URL: https://github.com/nodejs/node/pull/52293 Reviewed-By: Moshe Atlow <moshe@atlow.co.il> Reviewed-By: Rafael Gonzaga <rafael.nunu@hotmail.com> Reviewed-By: Richard Lau <rlau@redhat.com>
104 lines
3.6 KiB
C++
104 lines
3.6 KiB
C++
// Copyright 2017 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include "src/compiler/simplified-lowering.h"
|
|
|
|
#include "src/codegen/tick-counter.h"
|
|
#include "src/compiler/compiler-source-position-table.h"
|
|
#include "src/compiler/machine-operator.h"
|
|
#include "src/compiler/simplified-operator.h"
|
|
#include "test/unittests/compiler/graph-unittest.h"
|
|
#include "test/unittests/compiler/node-test-utils.h"
|
|
#include "test/unittests/fuzztest.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
namespace compiler {
|
|
|
|
class SimplifiedLoweringTest : public GraphTest {
|
|
public:
|
|
explicit SimplifiedLoweringTest(int num_parameters = 1)
|
|
: GraphTest(num_parameters),
|
|
num_parameters_(num_parameters),
|
|
machine_(zone()),
|
|
javascript_(zone()),
|
|
simplified_(zone()),
|
|
jsgraph_(isolate(), graph(), common(), &javascript_, &simplified_,
|
|
&machine_) {}
|
|
~SimplifiedLoweringTest() override = default;
|
|
|
|
void LowerGraph(Node* node) {
|
|
// Make sure we always start with an empty graph.
|
|
graph()->SetStart(graph()->NewNode(common()->Start(num_parameters())));
|
|
graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start()));
|
|
|
|
// Return {node} directly, so that we can match it with
|
|
// "IsReturn(expected)".
|
|
Node* zero = graph()->NewNode(common()->NumberConstant(0));
|
|
Node* ret = graph()->NewNode(common()->Return(), zero, node,
|
|
graph()->start(), graph()->start());
|
|
NodeProperties::MergeControlToEnd(graph(), common(), ret);
|
|
|
|
{
|
|
// Simplified lowering needs to run w/o the typer decorator so make sure
|
|
// the object is not live at the same time.
|
|
Typer typer(broker(), Typer::kNoFlags, graph(), tick_counter());
|
|
typer.Run();
|
|
}
|
|
|
|
Linkage* linkage = zone()->New<Linkage>(Linkage::GetJSCallDescriptor(
|
|
zone(), false, num_parameters_ + 1, CallDescriptor::kCanUseRoots));
|
|
SimplifiedLowering lowering(jsgraph(), broker(), zone(), source_positions(),
|
|
node_origins(), tick_counter(), linkage,
|
|
nullptr);
|
|
lowering.LowerAllNodes();
|
|
}
|
|
|
|
void SmiConstantToIntPtrConstantP(int x);
|
|
|
|
int num_parameters() const { return num_parameters_; }
|
|
JSGraph* jsgraph() { return &jsgraph_; }
|
|
|
|
private:
|
|
const int num_parameters_;
|
|
MachineOperatorBuilder machine_;
|
|
JSOperatorBuilder javascript_;
|
|
SimplifiedOperatorBuilder simplified_;
|
|
JSGraph jsgraph_;
|
|
};
|
|
|
|
V8_FUZZ_SUITE(SimplifiedLoweringFuzzTest, SimplifiedLoweringTest);
|
|
|
|
const int kSmiValues[] = {Smi::kMinValue,
|
|
Smi::kMinValue + 1,
|
|
Smi::kMinValue + 2,
|
|
-3,
|
|
-2,
|
|
-1,
|
|
0,
|
|
1,
|
|
2,
|
|
3,
|
|
Smi::kMaxValue - 2,
|
|
Smi::kMaxValue - 1,
|
|
Smi::kMaxValue};
|
|
|
|
void SimplifiedLoweringTest::SmiConstantToIntPtrConstantP(int x) {
|
|
LowerGraph(jsgraph()->ConstantNoHole(x));
|
|
intptr_t smi = base::bit_cast<intptr_t>(Smi::FromInt(x));
|
|
EXPECT_THAT(graph()->end()->InputAt(1),
|
|
IsReturn(IsIntPtrConstant(smi), start(), start()));
|
|
}
|
|
|
|
TEST_F(SimplifiedLoweringTest, SmiConstantToIntPtrConstant) {
|
|
TRACED_FOREACH(int, x, kSmiValues) { SmiConstantToIntPtrConstantP(x); }
|
|
}
|
|
|
|
V8_FUZZ_TEST_F(SimplifiedLoweringFuzzTest, SmiConstantToIntPtrConstantP)
|
|
.WithDomains(fuzztest::InRange(Smi::kMinValue, Smi::kMaxValue));
|
|
|
|
} // namespace compiler
|
|
} // namespace internal
|
|
} // namespace v8
|