bytecode-pipeline-unittest.cc 4.46 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
// Copyright 2016 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/v8.h"

#include "src/interpreter/bytecode-pipeline.h"
#include "src/interpreter/bytecode-register-allocator.h"
#include "src/isolate.h"
#include "test/unittests/test-utils.h"

namespace v8 {
namespace internal {
namespace interpreter {

using BytecodeNodeTest = TestWithIsolateAndZone;

TEST(BytecodeSourceInfo, Operations) {
  BytecodeSourceInfo x(0, true);
  CHECK_EQ(x.source_position(), 0);
  CHECK_EQ(x.is_statement(), true);
  CHECK_EQ(x.is_valid(), true);
  x.set_invalid();
  CHECK_EQ(x.is_statement(), false);
  CHECK_EQ(x.is_valid(), false);

27
  x.MakeStatementPosition(1);
28 29 30 31 32 33 34 35
  BytecodeSourceInfo y(1, true);
  CHECK(x == y);
  CHECK(!(x != y));

  x.set_invalid();
  CHECK(!(x == y));
  CHECK(x != y);

36
  y.MakeStatementPosition(1);
37 38 39
  CHECK_EQ(y.source_position(), 1);
  CHECK_EQ(y.is_statement(), true);

40
  y.MakeStatementPosition(2);
41 42 43 44
  CHECK_EQ(y.source_position(), 2);
  CHECK_EQ(y.is_statement(), true);

  y.set_invalid();
45
  y.MakeExpressionPosition(3);
46 47 48
  CHECK_EQ(y.source_position(), 3);
  CHECK_EQ(y.is_statement(), false);

49
  y.MakeStatementPosition(3);
50 51 52 53 54 55 56 57 58 59 60 61 62
  CHECK_EQ(y.source_position(), 3);
  CHECK_EQ(y.is_statement(), true);
}

TEST_F(BytecodeNodeTest, Constructor1) {
  BytecodeNode node(Bytecode::kLdaZero);
  CHECK_EQ(node.bytecode(), Bytecode::kLdaZero);
  CHECK_EQ(node.operand_count(), 0);
  CHECK(!node.source_info().is_valid());
}

TEST_F(BytecodeNodeTest, Constructor2) {
  uint32_t operands[] = {0x11};
63
  BytecodeNode node(Bytecode::kJumpIfTrue, operands[0]);
64 65 66 67 68 69 70
  CHECK_EQ(node.bytecode(), Bytecode::kJumpIfTrue);
  CHECK_EQ(node.operand_count(), 1);
  CHECK_EQ(node.operand(0), operands[0]);
  CHECK(!node.source_info().is_valid());
}

TEST_F(BytecodeNodeTest, Constructor3) {
71 72
  uint32_t operands[] = {0x11, 0x22};
  BytecodeNode node(Bytecode::kLdaGlobal, operands[0], operands[1]);
73
  CHECK_EQ(node.bytecode(), Bytecode::kLdaGlobal);
74
  CHECK_EQ(node.operand_count(), 2);
75
  CHECK_EQ(node.operand(0), operands[0]);
76
  CHECK_EQ(node.operand(1), operands[1]);
77 78 79 80 81
  CHECK(!node.source_info().is_valid());
}

TEST_F(BytecodeNodeTest, Constructor4) {
  uint32_t operands[] = {0x11, 0x22, 0x33};
82
  BytecodeNode node(Bytecode::kLdaNamedProperty, operands[0], operands[1],
83
                    operands[2]);
84
  CHECK_EQ(node.operand_count(), 3);
85
  CHECK_EQ(node.bytecode(), Bytecode::kLdaNamedProperty);
86 87 88 89 90 91 92 93 94
  CHECK_EQ(node.operand(0), operands[0]);
  CHECK_EQ(node.operand(1), operands[1]);
  CHECK_EQ(node.operand(2), operands[2]);
  CHECK(!node.source_info().is_valid());
}

TEST_F(BytecodeNodeTest, Constructor5) {
  uint32_t operands[] = {0x71, 0xa5, 0x5a, 0xfc};
  BytecodeNode node(Bytecode::kForInNext, operands[0], operands[1], operands[2],
95
                    operands[3]);
96 97 98 99 100 101 102 103 104 105 106 107
  CHECK_EQ(node.operand_count(), 4);
  CHECK_EQ(node.bytecode(), Bytecode::kForInNext);
  CHECK_EQ(node.operand(0), operands[0]);
  CHECK_EQ(node.operand(1), operands[1]);
  CHECK_EQ(node.operand(2), operands[2]);
  CHECK_EQ(node.operand(3), operands[3]);
  CHECK(!node.source_info().is_valid());
}

TEST_F(BytecodeNodeTest, Equality) {
  uint32_t operands[] = {0x71, 0xa5, 0x5a, 0xfc};
  BytecodeNode node(Bytecode::kForInNext, operands[0], operands[1], operands[2],
108
                    operands[3]);
109 110
  CHECK_EQ(node, node);
  BytecodeNode other(Bytecode::kForInNext, operands[0], operands[1],
111
                     operands[2], operands[3]);
112 113 114 115 116
  CHECK_EQ(node, other);
}

TEST_F(BytecodeNodeTest, EqualityWithSourceInfo) {
  uint32_t operands[] = {0x71, 0xa5, 0x5a, 0xfc};
117
  BytecodeSourceInfo first_source_info(3, true);
118
  BytecodeNode node(Bytecode::kForInNext, operands[0], operands[1], operands[2],
119
                    operands[3], first_source_info);
120
  CHECK_EQ(node, node);
121
  BytecodeSourceInfo second_source_info(3, true);
122
  BytecodeNode other(Bytecode::kForInNext, operands[0], operands[1],
123
                     operands[2], operands[3], second_source_info);
124 125 126 127 128
  CHECK_EQ(node, other);
}

TEST_F(BytecodeNodeTest, NoEqualityWithDifferentSourceInfo) {
  uint32_t operands[] = {0x71, 0xa5, 0x5a, 0xfc};
129
  BytecodeSourceInfo source_info(77, true);
130
  BytecodeNode node(Bytecode::kForInNext, operands[0], operands[1], operands[2],
131
                    operands[3], source_info);
132
  BytecodeNode other(Bytecode::kForInNext, operands[0], operands[1],
133
                     operands[2], operands[3]);
134 135 136 137 138 139
  CHECK_NE(node, other);
}

}  // namespace interpreter
}  // namespace internal
}  // namespace v8