1 | /* |
2 | * Copyright (C) 2009-2019 Apple Inc. All rights reserved. |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions |
6 | * are met: |
7 | * 1. Redistributions of source code must retain the above copyright |
8 | * notice, this list of conditions and the following disclaimer. |
9 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * |
13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #pragma once |
27 | |
28 | #include "Heap.h" |
29 | |
30 | namespace JSC { |
31 | |
32 | class CodeBlockSet; |
33 | class HeapCell; |
34 | class JITStubRoutineSet; |
35 | |
36 | class ConservativeRoots { |
37 | public: |
38 | ConservativeRoots(Heap&); |
39 | ~ConservativeRoots(); |
40 | |
41 | void add(void* begin, void* end); |
42 | void add(void* begin, void* end, JITStubRoutineSet&, CodeBlockSet&); |
43 | |
44 | size_t size() const; |
45 | HeapCell** roots() const; |
46 | |
47 | private: |
48 | static constexpr size_t inlineCapacity = 128; |
49 | static constexpr size_t nonInlineCapacity = 8192 / sizeof(HeapCell*); |
50 | |
51 | template<typename MarkHook> |
52 | void genericAddPointer(void*, HeapVersion markingVersion, HeapVersion newlyAllocatedVersion, TinyBloomFilter, MarkHook&); |
53 | |
54 | template<typename MarkHook> |
55 | void genericAddSpan(void*, void* end, MarkHook&); |
56 | |
57 | void grow(); |
58 | |
59 | HeapCell** m_roots; |
60 | size_t m_size; |
61 | size_t m_capacity; |
62 | Heap& m_heap; |
63 | HeapCell* m_inlineRoots[inlineCapacity]; |
64 | }; |
65 | |
66 | inline size_t ConservativeRoots::size() const |
67 | { |
68 | return m_size; |
69 | } |
70 | |
71 | inline HeapCell** ConservativeRoots::roots() const |
72 | { |
73 | return m_roots; |
74 | } |
75 | |
76 | } // namespace JSC |
77 | |