Chromium Code Reviews| Index: test/unittests/interpreter/source-position-table-unittest.cc |
| diff --git a/test/unittests/interpreter/source-position-table-unittest.cc b/test/unittests/interpreter/source-position-table-unittest.cc |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..ddd37fd56f7841c430845d6361fd608f61c1e05f |
| --- /dev/null |
| +++ b/test/unittests/interpreter/source-position-table-unittest.cc |
| @@ -0,0 +1,92 @@ |
| +// 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/source-position-table.h" |
| +#include "test/unittests/test-utils.h" |
| + |
| +namespace v8 { |
| +namespace internal { |
| +namespace interpreter { |
| + |
| +class SourcePositionTableTest : public TestWithIsolateAndZone { |
| + public: |
| + SourcePositionTableTest() {} |
| + ~SourcePositionTableTest() override {} |
| +}; |
| + |
| +// Some random offsets, mostly at 'suspicious' bit boundaries. |
| +static int offsets[] = {0, 1, 2, 3, 4, 30, 31, 32, |
| + 33, 62, 63, 64, 65, 126, 127, 128, |
| + 129, 250, 1000, 9999, 12000, 31415926}; |
|
Yang
2016/02/17 19:54:51
Since we are encoding the delta, these are not rea
vogelheim
2016/02/18 13:06:09
I disagree. Your feedback is correct for the first
Yang
2016/02/19 08:28:02
I see. Ok.
|
| + |
| +TEST_F(SourcePositionTableTest, EncodeStatement) { |
| + SourcePositionTableBuilder builder(isolate(), zone()); |
| + for (int i = 0; i < arraysize(offsets); i++) { |
| + builder.AddStatementPosition(offsets[i], offsets[i]); |
| + } |
| + |
| + // To test correctness, we rely on the assertions in ToSourcePositionTable(). |
| + // (Also below.) |
| + CHECK(!builder.ToSourcePositionTable().is_null()); |
| +} |
| + |
| +TEST_F(SourcePositionTableTest, EncodeExpression) { |
| + SourcePositionTableBuilder builder(isolate(), zone()); |
| + for (int i = 0; i < arraysize(offsets); i++) { |
| + builder.AddExpressionPosition(offsets[i], offsets[i]); |
| + } |
| + CHECK(!builder.ToSourcePositionTable().is_null()); |
| +} |
| + |
| +TEST_F(SourcePositionTableTest, EncodeAscending) { |
| + SourcePositionTableBuilder builder(isolate(), zone()); |
| + |
| + int accumulator = 0; |
| + for (int i = 0; i < arraysize(offsets); i++) { |
| + accumulator += offsets[i]; |
| + if (i % 2) { |
| + builder.AddStatementPosition(accumulator, accumulator); |
| + } else { |
| + builder.AddExpressionPosition(accumulator, accumulator); |
| + } |
| + } |
| + |
| + // Also test negative offsets: |
| + for (int i = 0; i < arraysize(offsets); i++) { |
| + accumulator -= offsets[i]; |
| + if (i % 2) { |
| + builder.AddStatementPosition(accumulator, accumulator); |
| + } else { |
| + builder.AddExpressionPosition(accumulator, accumulator); |
| + } |
| + } |
| + |
| + CHECK(!builder.ToSourcePositionTable().is_null()); |
| +} |
| + |
| +TEST_F(SourcePositionTableTest, EncodeRevert) { |
| + SourcePositionTableBuilder builder(isolate(), zone()); |
| + |
| + int accumulator = 0; |
| + for (int i = 0; i < arraysize(offsets); i++) { |
| + accumulator += offsets[i]; |
| + builder.AddStatementPosition(accumulator, accumulator); |
| + |
| + // Every other position is reverted. Among these, every other position |
| + // is reverted with the same bytecode offset. |
| + if (i % 4 == 1) { |
| + builder.RevertPosition(accumulator); |
| + } else if (i % 4 == 3) { |
| + builder.RevertPosition(accumulator + 1); |
| + } |
| + } |
| + |
| + CHECK(!builder.ToSourcePositionTable().is_null()); |
| +} |
| + |
| +} // namespace interpreter |
| +} // namespace internal |
| +} // namespace v8 |