chromium/v8/test/cctest/compiler/test-node.cc

// Copyright 2013 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 <functional>

#include "src/compiler/graph.h"
#include "src/compiler/node.h"
#include "src/compiler/operator.h"
#include "test/cctest/cctest.h"

namespace v8 {
namespace internal {
namespace compiler {
namespace node {

#define NONE …

static Operator dummy_operator0(IrOpcode::kParameter, Operator::kNoWrite,
                                "dummy", 0, 0, 0, 1, 0, 0);
static Operator dummy_operator1(IrOpcode::kParameter, Operator::kNoWrite,
                                "dummy", 1, 0, 0, 1, 0, 0);
static Operator dummy_operator2(IrOpcode::kParameter, Operator::kNoWrite,
                                "dummy", 2, 0, 0, 1, 0, 0);
static Operator dummy_operator3(IrOpcode::kParameter, Operator::kNoWrite,
                                "dummy", 3, 0, 0, 1, 0, 0);

#define CHECK_USES …


namespace {

using NodeMSet = std::multiset<Node*, std::less<Node*>>;

void CheckUseChain(Node* node, Node** uses, int use_count) { … }


void CheckInputs(Node* node, Node** inputs, int input_count) { … }

}  // namespace


#define CHECK_INPUTS …


TEST(NodeUseIteratorReplaceUses) { … }


TEST(NodeUseIteratorReplaceUsesSelf) { … }


TEST(ReplaceInput) { … }


TEST(OwnedBy) { … }


TEST(Uses) { … }


TEST(Inputs) { … }

TEST(InsertInputs) { … }

TEST(RemoveInput) { … }


TEST(AppendInputsAndIterator) { … }


TEST(NullInputsSimple) { … }


TEST(NullInputsAppended) { … }


TEST(ReplaceUsesFromAppendedInputs) { … }


TEST(ReplaceInputMultipleUses) { … }


TEST(TrimInputCountInline) { … }


TEST(TrimInputCountOutOfLine1) { … }


TEST(TrimInputCountOutOfLine2) { … }


TEST(NullAllInputs) { … }


TEST(AppendAndTrim) { … }

#undef NONE
#undef CHECK_USES
#undef CHECK_INPUTS

}  // namespace node
}  // namespace compiler
}  // namespace internal
}  // namespace v8