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 | #pragma once |
27 | |
28 | #include "FreeList.h" |
29 | |
30 | namespace bmalloc { |
31 | |
32 | template<typename Config, typename Func> |
33 | void* FreeList::allocate(const Func& slowPath) |
34 | { |
35 | unsigned remaining = m_remaining; |
36 | if (remaining) { |
37 | remaining -= Config::objectSize; |
38 | m_remaining = remaining; |
39 | return m_payloadEnd - remaining - Config::objectSize; |
40 | } |
41 | |
42 | FreeCell* result = head(); |
43 | if (!result) |
44 | return slowPath(); |
45 | |
46 | m_scrambledHead = result->scrambledNext; |
47 | return result; |
48 | } |
49 | |
50 | template<typename Config, typename Func> |
51 | void FreeList::forEach(const Func& func) const |
52 | { |
53 | if (m_remaining) { |
54 | for (unsigned remaining = m_remaining; remaining; remaining -= Config::objectSize) |
55 | func(static_cast<void*>(m_payloadEnd - remaining)); |
56 | } else { |
57 | for (FreeCell* cell = head(); cell;) { |
58 | // We can use this to overwrite free objects before destroying the free list. So, we need |
59 | // to get next before proceeding further. |
60 | FreeCell* next = cell->next(m_secret); |
61 | func(static_cast<void*>(cell)); |
62 | cell = next; |
63 | } |
64 | } |
65 | } |
66 | |
67 | } // namespace bmalloc |
68 | |
69 | |