1 | /* |
2 | * Copyright (C) 2017 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 | #include "IsoHeapImpl.h" |
27 | |
28 | #include "AllIsoHeaps.h" |
29 | #include "PerProcess.h" |
30 | #include <climits> |
31 | |
32 | namespace bmalloc { |
33 | |
34 | IsoHeapImplBase::IsoHeapImplBase() |
35 | { |
36 | } |
37 | |
38 | IsoHeapImplBase::~IsoHeapImplBase() |
39 | { |
40 | } |
41 | |
42 | void IsoHeapImplBase::addToAllIsoHeaps() |
43 | { |
44 | AllIsoHeaps::get()->add(this); |
45 | } |
46 | |
47 | void IsoHeapImplBase::scavengeNow() |
48 | { |
49 | Vector<DeferredDecommit> deferredDecommits; |
50 | scavenge(deferredDecommits); |
51 | finishScavenging(deferredDecommits); |
52 | } |
53 | |
54 | void IsoHeapImplBase::finishScavenging(Vector<DeferredDecommit>& deferredDecommits) |
55 | { |
56 | std::sort( |
57 | deferredDecommits.begin(), deferredDecommits.end(), |
58 | [&] (const DeferredDecommit& a, const DeferredDecommit& b) -> bool { |
59 | return a.page < b.page; |
60 | }); |
61 | unsigned runStartIndex = UINT_MAX; |
62 | char* run = nullptr; |
63 | size_t size = 0; |
64 | auto resetRun = [&] (unsigned endIndex) { |
65 | if (!run) { |
66 | RELEASE_BASSERT(!size); |
67 | RELEASE_BASSERT(runStartIndex == UINT_MAX); |
68 | return; |
69 | } |
70 | RELEASE_BASSERT(size); |
71 | RELEASE_BASSERT(runStartIndex != UINT_MAX); |
72 | vmDeallocatePhysicalPages(run, size); |
73 | for (unsigned i = runStartIndex; i < endIndex; ++i) { |
74 | const DeferredDecommit& value = deferredDecommits[i]; |
75 | value.directory->didDecommit(value.pageIndex); |
76 | } |
77 | run = nullptr; |
78 | size = 0; |
79 | runStartIndex = UINT_MAX; |
80 | }; |
81 | for (unsigned i = 0; i < deferredDecommits.size(); ++i) { |
82 | const DeferredDecommit& value = deferredDecommits[i]; |
83 | char* page = reinterpret_cast<char*>(value.page); |
84 | RELEASE_BASSERT(page >= run + size); |
85 | if (page != run + size) { |
86 | resetRun(i); |
87 | runStartIndex = i; |
88 | run = page; |
89 | } |
90 | size += IsoPageBase::pageSize; |
91 | } |
92 | resetRun(deferredDecommits.size()); |
93 | } |
94 | |
95 | } // namespace bmalloc |
96 | |
97 | |