blob: adc100d72376455fa1eb24a913df29194eab8848 (
plain)
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
// Copyright 2013 the V8 project authors. All rights reserved.
// Check that we can traverse very deep stacks of ConsStrings using
// StringCharacterStram. Check that Get(int) works on very deep stacks
// of ConsStrings. These operations may not be very fast, but they
// should be possible without getting errors due to too deep recursion.
#include "v8.h"
#include "cctest.h"
#include "objects.h"
using namespace v8::internal;
static v8::Persistent<v8::Context> env;
static void InitializeVM() {
if (env.IsEmpty()) {
v8::HandleScope scope;
const char* extensions[] = { "v8/print" };
v8::ExtensionConfiguration config(1, extensions);
env = v8::Context::New(&config);
}
v8::HandleScope scope;
env->Enter();
}
TEST(Create) {
InitializeVM();
Isolate* isolate = Isolate::Current();
HandleScope scope(isolate);
const int kNumSymbols = 30;
Handle<Symbol> symbols[kNumSymbols];
for (int i = 0; i < kNumSymbols; ++i) {
symbols[i] = isolate->factory()->NewSymbol();
CHECK(symbols[i]->IsName());
CHECK(symbols[i]->IsSymbol());
CHECK(symbols[i]->HasHashCode());
CHECK_GT(symbols[i]->Hash(), 0);
symbols[i]->ShortPrint();
PrintF("\n");
#if OBJECT_PRINT
symbols[i]->Print();
#endif
#if VERIFY_HEAP
symbols[i]->Verify();
#endif
}
HEAP->PerformScavenge();
HEAP->CollectAllGarbage(Heap::kNoGCFlags);
// All symbols should be distinct.
for (int i = 0; i < kNumSymbols; ++i) {
CHECK(symbols[i]->SameValue(*symbols[i]));
for (int j = i + 1; j < kNumSymbols; ++j) {
CHECK(!symbols[i]->SameValue(*symbols[j]));
}
}
}
|
