mirror of
https://github.com/nodejs/node.git
synced 2025-05-15 16:01:52 +00:00
ec02b811a8
Pick up latest commit from the 5.4-lkgr branch. deps: edit V8 gitignore to allow trace event copy deps: update V8 trace event to 315bf1e2d45be7d53346c31cfcc37424a32c30c8 deps: edit V8 gitignore to allow gtest_prod.h copy deps: update V8 gtest to 6f8a66431cb592dad629028a50b3dd418a408c87 PR-URL: https://github.com/nodejs/node/pull/8317 Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl> Reviewed-By: Ali Ijaz Sheikh <ofrobots@google.com>
93 lines
2.8 KiB
C++
93 lines
2.8 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/objects.h"
|
|
#include "src/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(zone());
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
builder.AddPosition(offsets[i], offsets[i], true);
|
|
}
|
|
|
|
// To test correctness, we rely on the assertions in ToSourcePositionTable().
|
|
// (Also below.)
|
|
CHECK(!builder.ToSourcePositionTable(isolate(), Handle<AbstractCode>())
|
|
.is_null());
|
|
}
|
|
|
|
TEST_F(SourcePositionTableTest, EncodeStatementDuplicates) {
|
|
SourcePositionTableBuilder builder(zone());
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
builder.AddPosition(offsets[i], offsets[i], true);
|
|
builder.AddPosition(offsets[i], offsets[i] + 1, true);
|
|
}
|
|
|
|
// To test correctness, we rely on the assertions in ToSourcePositionTable().
|
|
// (Also below.)
|
|
CHECK(!builder.ToSourcePositionTable(isolate(), Handle<AbstractCode>())
|
|
.is_null());
|
|
}
|
|
|
|
TEST_F(SourcePositionTableTest, EncodeExpression) {
|
|
SourcePositionTableBuilder builder(zone());
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
builder.AddPosition(offsets[i], offsets[i], false);
|
|
}
|
|
CHECK(!builder.ToSourcePositionTable(isolate(), Handle<AbstractCode>())
|
|
.is_null());
|
|
}
|
|
|
|
TEST_F(SourcePositionTableTest, EncodeAscending) {
|
|
SourcePositionTableBuilder builder(zone());
|
|
|
|
int code_offset = 0;
|
|
int source_position = 0;
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
code_offset += offsets[i];
|
|
source_position += offsets[i];
|
|
if (i % 2) {
|
|
builder.AddPosition(code_offset, source_position, true);
|
|
} else {
|
|
builder.AddPosition(code_offset, source_position, false);
|
|
}
|
|
}
|
|
|
|
// Also test negative offsets for source positions:
|
|
for (int i = 0; i < arraysize(offsets); i++) {
|
|
code_offset += offsets[i];
|
|
source_position -= offsets[i];
|
|
if (i % 2) {
|
|
builder.AddPosition(code_offset, source_position, true);
|
|
} else {
|
|
builder.AddPosition(code_offset, source_position, false);
|
|
}
|
|
}
|
|
|
|
CHECK(!builder.ToSourcePositionTable(isolate(), Handle<AbstractCode>())
|
|
.is_null());
|
|
}
|
|
|
|
} // namespace interpreter
|
|
} // namespace internal
|
|
} // namespace v8
|