mirror of
https://github.com/nodejs/node.git
synced 2025-05-15 16:01:52 +00:00
2cc2951796
Pick up the latest branch-head for V8 5.1. This branch brings in improved language support and performance improvements. For full details: http://v8project.blogspot.com/2016/04/v8-release-51.html * Picks up the latest branch head for 5.1 [1] * Edit v8 gitignore to allow trace_event copy * Update V8 DEP trace_event as per deps/v8/DEPS [2] [1] https://chromium.googlesource.com/v8/v8.git/+/dc81244 [2] https://chromium.googlesource.com/chromium/src/base/trace_event/common/+/c8c8665 PR-URL: https://github.com/nodejs/node/pull/7016 Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl>
85 lines
2.6 KiB
C++
85 lines
2.6 KiB
C++
// 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};
|
|
|
|
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, EncodeStatementDuplicates) {
|
|
SourcePositionTableBuilder builder(isolate(), zone());
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
builder.AddStatementPosition(offsets[i], offsets[i]);
|
|
builder.AddStatementPosition(offsets[i], offsets[i] + 1);
|
|
}
|
|
|
|
// 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());
|
|
}
|
|
|
|
} // namespace interpreter
|
|
} // namespace internal
|
|
} // namespace v8
|