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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/*
* Copyright (C) 2010 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef GCHandle_h
#define GCHandle_h
#include "AlignedMemoryAllocator.h"
namespace JSC {
class Heap;
class JSCell;
class WeakGCHandle;
class WeakGCHandlePool;
class WeakGCHandle {
friend class WeakGCHandlePool;
public:
// Because JSCell objects are aligned, we can use the lower two bits as
// status flags. The least significant bit is set when the handle is not a
// pointer, i.e. when it's used as a offset for the free list in
// WeakGCHandlePool. The second least significant bit is set when the object
// the pointer corresponds to has been deleted by a garbage collection
bool isValidPtr() { return !(m_ptr & 3); }
bool isPtr() { return !(m_ptr & 1); }
bool isNext() { return (m_ptr & 3) == 1; }
void invalidate()
{
ASSERT(isValidPtr());
m_ptr |= 2;
}
JSCell* get()
{
ASSERT(isPtr());
return reinterpret_cast<JSCell*>(m_ptr & ~3);
}
void set(JSCell* p)
{
m_ptr = reinterpret_cast<uintptr_t>(p);
ASSERT(isPtr());
}
WeakGCHandlePool* pool();
private:
uintptr_t getNextInFreeList()
{
ASSERT(isNext());
return m_ptr >> 2;
}
void setNextInFreeList(uintptr_t n)
{
m_ptr = (n << 2) | 1;
ASSERT(isNext());
}
uintptr_t m_ptr;
};
class WeakGCHandlePool {
public:
static const size_t poolSize = 32 * 1024; // 32k
static const size_t poolMask = ~(poolSize - 1);
static const size_t numPoolEntries = (poolSize - sizeof(Heap*) - 3 * sizeof(unsigned)) / sizeof(WeakGCHandle);
typedef AlignedMemoryAllocator<WeakGCHandlePool::poolSize> Allocator;
WeakGCHandlePool();
WeakGCHandle* allocate(JSCell* cell);
void free(WeakGCHandle*);
bool isFull()
{
ASSERT(m_entriesSize < WeakGCHandlePool::numPoolEntries);
return m_entriesSize == WeakGCHandlePool::numPoolEntries - 1;
}
void update();
void* operator new(size_t, AlignedMemory<WeakGCHandlePool::poolSize>&);
private:
Heap* m_heap;
unsigned m_entriesSize;
unsigned m_initialAlloc;
WeakGCHandle m_entries[WeakGCHandlePool::numPoolEntries];
};
}
#endif
|
