blob: 9b18fde6d13aab762df9588ef7535fc0d04d764c (
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
71
72
73
74
|
/* -*- 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/. */
#ifndef gc_StoreBuffer_inl_h
#define gc_StoreBuffer_inl_h
#include "gc/StoreBuffer.h"
#include "gc/Heap.h"
namespace js {
namespace gc {
inline /* static */ size_t
ArenaCellSet::getCellIndex(const TenuredCell* cell)
{
MOZ_ASSERT((uintptr_t(cell) & ~ArenaMask) % CellSize == 0);
return (uintptr_t(cell) & ArenaMask) / CellSize;
}
inline /* static */ void
ArenaCellSet::getWordIndexAndMask(size_t cellIndex, size_t* wordp, uint32_t* maskp)
{
BitArray<ArenaCellCount>::getIndexAndMask(cellIndex, wordp, maskp);
}
inline bool
ArenaCellSet::hasCell(size_t cellIndex) const
{
MOZ_ASSERT(cellIndex < ArenaCellCount);
return bits.get(cellIndex);
}
inline void
ArenaCellSet::putCell(size_t cellIndex)
{
MOZ_ASSERT(cellIndex < ArenaCellCount);
bits.set(cellIndex);
}
inline void
ArenaCellSet::check() const
{
#ifdef DEBUG
bool bitsZero = bits.isAllClear();
MOZ_ASSERT(isEmpty() == bitsZero);
MOZ_ASSERT(isEmpty() == !arena);
MOZ_ASSERT_IF(!isEmpty(), arena->bufferedCells == this);
#endif
}
inline void
StoreBuffer::putWholeCell(Cell* cell)
{
MOZ_ASSERT(cell->isTenured());
Arena* arena = cell->asTenured().arena();
ArenaCellSet* cells = arena->bufferedCells;
if (cells->isEmpty()) {
cells = AllocateWholeCellSet(arena);
if (!cells)
return;
}
cells->putCell(&cell->asTenured());
cells->check();
}
} // namespace gc
} // namespace js
#endif // gc_StoreBuffer_inl_h
|
