1 | /* |
2 | * Copyright (C) 2011 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. AND ITS CONTRIBUTORS ``AS IS'' |
14 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
15 | * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
17 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
18 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
19 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
20 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
21 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
22 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
23 | * THE POSSIBILITY OF SUCH DAMAGE. |
24 | */ |
25 | |
26 | #pragma once |
27 | |
28 | #include "MarkedBlock.h" |
29 | #include "TinyBloomFilter.h" |
30 | #include <wtf/HashSet.h> |
31 | |
32 | namespace JSC { |
33 | |
34 | class MarkedBlock; |
35 | |
36 | class MarkedBlockSet { |
37 | public: |
38 | void add(MarkedBlock*); |
39 | void remove(MarkedBlock*); |
40 | |
41 | TinyBloomFilter filter() const; |
42 | const HashSet<MarkedBlock*>& set() const; |
43 | |
44 | private: |
45 | void recomputeFilter(); |
46 | |
47 | TinyBloomFilter m_filter; |
48 | HashSet<MarkedBlock*> m_set; |
49 | }; |
50 | |
51 | inline void MarkedBlockSet::add(MarkedBlock* block) |
52 | { |
53 | m_filter.add(reinterpret_cast<Bits>(block)); |
54 | m_set.add(block); |
55 | } |
56 | |
57 | inline void MarkedBlockSet::remove(MarkedBlock* block) |
58 | { |
59 | unsigned oldCapacity = m_set.capacity(); |
60 | m_set.remove(block); |
61 | if (m_set.capacity() != oldCapacity) // Indicates we've removed a lot of blocks. |
62 | recomputeFilter(); |
63 | } |
64 | |
65 | inline void MarkedBlockSet::recomputeFilter() |
66 | { |
67 | TinyBloomFilter filter; |
68 | for (HashSet<MarkedBlock*>::iterator it = m_set.begin(); it != m_set.end(); ++it) |
69 | filter.add(reinterpret_cast<Bits>(*it)); |
70 | m_filter = filter; |
71 | } |
72 | |
73 | inline TinyBloomFilter MarkedBlockSet::filter() const |
74 | { |
75 | return m_filter; |
76 | } |
77 | |
78 | inline const HashSet<MarkedBlock*>& MarkedBlockSet::set() const |
79 | { |
80 | return m_set; |
81 | } |
82 | |
83 | } // namespace JSC |
84 | |