blob: 8c30251f792d64a107fdb92cd841f05764d8e7c4 (
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
64
65
66
67
68
69
70
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
*/
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "mozilla/Move.h"
#include "gc/GCRuntime.h"
#include "gc/Heap.h"
#include "jsapi-tests/tests.h"
BEGIN_TEST(testGCChunkPool)
{
const int N = 10;
js::gc::ChunkPool pool;
// Create.
for (int i = 0; i < N; ++i) {
js::gc::Chunk* chunk = js::gc::Chunk::allocate(cx);
CHECK(chunk);
pool.push(chunk);
}
MOZ_ASSERT(pool.verify());
// Iterate.
uint32_t i = 0;
for (js::gc::ChunkPool::Iter iter(pool); !iter.done(); iter.next(), ++i)
CHECK(iter.get());
CHECK(i == pool.count());
MOZ_ASSERT(pool.verify());
// Push/Pop.
for (int i = 0; i < N; ++i) {
js::gc::Chunk* chunkA = pool.pop();
js::gc::Chunk* chunkB = pool.pop();
js::gc::Chunk* chunkC = pool.pop();
pool.push(chunkA);
pool.push(chunkB);
pool.push(chunkC);
}
MOZ_ASSERT(pool.verify());
// Remove.
js::gc::Chunk* chunk = nullptr;
int offset = N / 2;
for (js::gc::ChunkPool::Iter iter(pool); !iter.done(); iter.next(), --offset) {
if (offset == 0) {
chunk = pool.remove(iter.get());
break;
}
}
CHECK(chunk);
MOZ_ASSERT(!pool.contains(chunk));
MOZ_ASSERT(pool.verify());
pool.push(chunk);
// Destruct.
js::AutoLockGC lock(cx);
for (js::gc::ChunkPool::Iter iter(pool); !iter.done();) {
js::gc::Chunk* chunk = iter.get();
iter.next();
pool.remove(chunk);
js::gc::UnmapPages(chunk, js::gc::ChunkSize);
}
return true;
}
END_TEST(testGCChunkPool)
|
