1/*
2 * Copyright (C) 2016-2018 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 "MarkedBlockInlines.h"
29#include "MarkedSpace.h"
30
31namespace JSC {
32
33template<typename Functor> inline void MarkedSpace::forEachLiveCell(HeapIterationScope&, const Functor& functor)
34{
35 ASSERT(isIterating());
36 forEachLiveCell(functor);
37}
38
39template<typename Functor> inline void MarkedSpace::forEachLiveCell(const Functor& functor)
40{
41 BlockIterator end = m_blocks.set().end();
42 for (BlockIterator it = m_blocks.set().begin(); it != end; ++it) {
43 IterationStatus result = (*it)->handle().forEachLiveCell(
44 [&] (size_t, HeapCell* cell, HeapCell::Kind kind) -> IterationStatus {
45 return functor(cell, kind);
46 });
47 if (result == IterationStatus::Done)
48 return;
49 }
50 for (LargeAllocation* allocation : m_largeAllocations) {
51 if (allocation->isLive()) {
52 if (functor(allocation->cell(), allocation->attributes().cellKind) == IterationStatus::Done)
53 return;
54 }
55 }
56}
57
58template<typename Functor> inline void MarkedSpace::forEachDeadCell(HeapIterationScope&, const Functor& functor)
59{
60 ASSERT(isIterating());
61 BlockIterator end = m_blocks.set().end();
62 for (BlockIterator it = m_blocks.set().begin(); it != end; ++it) {
63 if ((*it)->handle().forEachDeadCell(functor) == IterationStatus::Done)
64 return;
65 }
66 for (LargeAllocation* allocation : m_largeAllocations) {
67 if (!allocation->isLive()) {
68 if (functor(allocation->cell(), allocation->attributes().cellKind) == IterationStatus::Done)
69 return;
70 }
71 }
72}
73
74} // namespace JSC
75
76