Ticket #9903: report-b9b381.html

File report-b9b381.html, 249.8 KB (added by mt, 11 years ago)

Report by Clang Static Analyzer

Line 
1<!doctype html>
2<html>
3<head>
4<title>/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp</title>
5<style type="text/css">
6 body { color:#000000; background-color:#ffffff }
7 body { font-family:Helvetica, sans-serif; font-size:10pt }
8 h1 { font-size:14pt }
9 .code { border-collapse:collapse; width:100%; }
10 .code { font-family: "Monospace", monospace; font-size:10pt }
11 .code { line-height: 1.2em }
12 .comment { color: green; font-style: oblique }
13 .keyword { color: blue }
14 .string_literal { color: red }
15 .directive { color: darkmagenta }
16 .expansion { display: none; }
17 .macro:hover .expansion { display: block; border: 2px solid #FF0000; padding: 2px; background-color:#FFF0F0; font-weight: normal; -webkit-border-radius:5px; -webkit-box-shadow:1px 1px 7px #000; position: absolute; top: -1em; left:10em; z-index: 1 }
18 .macro { color: darkmagenta; background-color:LemonChiffon; position: relative }
19 .num { width:2.5em; padding-right:2ex; background-color:#eeeeee }
20 .num { text-align:right; font-size:8pt }
21 .num { color:#444444 }
22 .line { padding-left: 1ex; border-left: 3px solid #ccc }
23 .line { white-space: pre }
24 .msg { -webkit-box-shadow:1px 1px 7px #000 }
25 .msg { -webkit-border-radius:5px }
26 .msg { font-family:Helvetica, sans-serif; font-size:8pt }
27 .msg { float:left }
28 .msg { padding:0.25em 1ex 0.25em 1ex }
29 .msg { margin-top:10px; margin-bottom:10px }
30 .msg { font-weight:bold }
31 .msg { max-width:60em; word-wrap: break-word; white-space: pre-wrap }
32 .msgT { padding:0x; spacing:0x }
33 .msgEvent { background-color:#fff8b4; color:#000000 }
34 .msgControl { background-color:#bbbbbb; color:#000000 }
35 .mrange { background-color:#dfddf3 }
36 .mrange { border-bottom:1px solid #6F9DBE }
37 .PathIndex { font-weight: bold; padding:0px 5px; margin-right:5px; }
38 .PathIndex { -webkit-border-radius:8px }
39 .PathIndexEvent { background-color:#bfba87 }
40 .PathIndexControl { background-color:#8c8c8c }
41 .PathNav a { text-decoration:none; font-size: larger }
42 .CodeInsertionHint { font-weight: bold; background-color: #10dd10 }
43 .CodeRemovalHint { background-color:#de1010 }
44 .CodeRemovalHint { border-bottom:1px solid #6F9DBE }
45 table.simpletable {
46 padding: 5px;
47 font-size:12pt;
48 margin:20px;
49 border-collapse: collapse; border-spacing: 0px;
50 }
51 td.rowname {
52 text-align:right; font-weight:bold; color:#444444;
53 padding-right:2ex; }
54</style>
55</head>
56<body>
57<!-- BUGDESC Called C++ object pointer is null -->
58
59<!-- BUGTYPE Called C++ object pointer is null -->
60
61<!-- BUGCATEGORY Logic error -->
62
63<!-- BUGFILE /home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp -->
64
65<!-- BUGLINE 1122 -->
66
67<!-- BUGPATHLENGTH 7 -->
68
69<!-- BUGMETAEND -->
70<!-- REPORTHEADER -->
71<h3>Bug Summary</h3>
72<table class="simpletable">
73<tr><td class="rowname">File:</td><td>src/system/kernel/slab/MemoryManager.cpp</td></tr>
74<tr><td class="rowname">Location:</td><td><a href="#EndPath">line 1122, column 5</a></td></tr>
75<tr><td class="rowname">Description:</td><td>Called C++ object pointer is null</td></tr>
76</table>
77<!-- REPORTSUMMARYEXTRA -->
78<h3>Annotated Source Code</h3>
79<table class="code">
80<tr><td class="num" id="LN1">1</td><td class="line"><span class='comment'>/*</span></td></tr>
81<tr><td class="num" id="LN2">2</td><td class="line"> <span class='comment'>* Copyright 2010, Ingo Weinhold &lt;ingo_weinhold@gmx.de&gt;.</span></td></tr>
82<tr><td class="num" id="LN3">3</td><td class="line"> <span class='comment'>* Distributed under the terms of the MIT License.</span></td></tr>
83<tr><td class="num" id="LN4">4</td><td class="line"> <span class='comment'>*/</span></td></tr>
84<tr><td class="num" id="LN5">5</td><td class="line"> </td></tr>
85<tr><td class="num" id="LN6">6</td><td class="line"> </td></tr>
86<tr><td class="num" id="LN7">7</td><td class="line"><span class='directive'>#include "MemoryManager.h"</span></td></tr>
87<tr><td class="num" id="LN8">8</td><td class="line"> </td></tr>
88<tr><td class="num" id="LN9">9</td><td class="line"><span class='directive'>#include &lt;algorithm&gt;</span></td></tr>
89<tr><td class="num" id="LN10">10</td><td class="line"> </td></tr>
90<tr><td class="num" id="LN11">11</td><td class="line"><span class='directive'>#include &lt;debug.h&gt;</span></td></tr>
91<tr><td class="num" id="LN12">12</td><td class="line"><span class='directive'>#include &lt;tracing.h&gt;</span></td></tr>
92<tr><td class="num" id="LN13">13</td><td class="line"><span class='directive'>#include &lt;util/AutoLock.h&gt;</span></td></tr>
93<tr><td class="num" id="LN14">14</td><td class="line"><span class='directive'>#include &lt;vm/vm.h&gt;</span></td></tr>
94<tr><td class="num" id="LN15">15</td><td class="line"><span class='directive'>#include &lt;vm/vm_page.h&gt;</span></td></tr>
95<tr><td class="num" id="LN16">16</td><td class="line"><span class='directive'>#include &lt;vm/vm_priv.h&gt;</span></td></tr>
96<tr><td class="num" id="LN17">17</td><td class="line"><span class='directive'>#include &lt;vm/VMAddressSpace.h&gt;</span></td></tr>
97<tr><td class="num" id="LN18">18</td><td class="line"><span class='directive'>#include &lt;vm/VMArea.h&gt;</span></td></tr>
98<tr><td class="num" id="LN19">19</td><td class="line"><span class='directive'>#include &lt;vm/VMCache.h&gt;</span></td></tr>
99<tr><td class="num" id="LN20">20</td><td class="line"><span class='directive'>#include &lt;vm/VMTranslationMap.h&gt;</span></td></tr>
100<tr><td class="num" id="LN21">21</td><td class="line"> </td></tr>
101<tr><td class="num" id="LN22">22</td><td class="line"><span class='directive'>#include "kernel_debug_config.h"</span></td></tr>
102<tr><td class="num" id="LN23">23</td><td class="line"> </td></tr>
103<tr><td class="num" id="LN24">24</td><td class="line"><span class='directive'>#include "ObjectCache.h"</span></td></tr>
104<tr><td class="num" id="LN25">25</td><td class="line"> </td></tr>
105<tr><td class="num" id="LN26">26</td><td class="line"> </td></tr>
106<tr><td class="num" id="LN27">27</td><td class="line"><span class='comment'>//#define TRACE_MEMORY_MANAGER</span></td></tr>
107<tr><td class="num" id="LN28">28</td><td class="line"><span class='directive'>#ifdef TRACE_MEMORY_MANAGER</span></td></tr>
108<tr><td class="num" id="LN29">29</td><td class="line"><span class='directive'># define <span class='macro'>TRACE(x...)<span class='expansion'>do {} while (false)</span></span> dprintf(x)</span></td></tr>
109<tr><td class="num" id="LN30">30</td><td class="line"><span class='directive'>#else</span></td></tr>
110<tr><td class="num" id="LN31">31</td><td class="line"><span class='directive'># define <span class='macro'>TRACE(x...)<span class='expansion'>do {} while (false)</span></span> do {} while (false)</span></td></tr>
111<tr><td class="num" id="LN32">32</td><td class="line"><span class='directive'>#endif</span></td></tr>
112<tr><td class="num" id="LN33">33</td><td class="line"> </td></tr>
113<tr><td class="num" id="LN34">34</td><td class="line"><span class='directive'>#if <span class='macro'>DEBUG_SLAB_MEMORY_MANAGER_PARANOID_CHECKS<span class='expansion'>0</span></span></span></td></tr>
114<tr><td class="num" id="LN35">35</td><td class="line"><span class='directive'># define PARANOID_CHECKS_ONLY(x) x</span></td></tr>
115<tr><td class="num" id="LN36">36</td><td class="line"><span class='directive'>#else</span></td></tr>
116<tr><td class="num" id="LN37">37</td><td class="line"><span class='directive'># define PARANOID_CHECKS_ONLY(x)</span></td></tr>
117<tr><td class="num" id="LN38">38</td><td class="line"><span class='directive'>#endif</span></td></tr>
118<tr><td class="num" id="LN39">39</td><td class="line"> </td></tr>
119<tr><td class="num" id="LN40">40</td><td class="line"> </td></tr>
120<tr><td class="num" id="LN41">41</td><td class="line"><span class='keyword'>static</span> <span class='keyword'>const</span> <span class='keyword'>char</span>* <span class='keyword'>const</span> kSlabAreaName = <span class='string_literal'>"slab area"</span>;</td></tr>
121<tr><td class="num" id="LN42">42</td><td class="line"> </td></tr>
122<tr><td class="num" id="LN43">43</td><td class="line"><span class='keyword'>static</span> <span class='keyword'>void</span>* sAreaTableBuffer[1024];</td></tr>
123<tr><td class="num" id="LN44">44</td><td class="line"> </td></tr>
124<tr><td class="num" id="LN45">45</td><td class="line">mutex MemoryManager::sLock;</td></tr>
125<tr><td class="num" id="LN46">46</td><td class="line">rw_lock MemoryManager::sAreaTableLock;</td></tr>
126<tr><td class="num" id="LN47">47</td><td class="line">kernel_args* MemoryManager::sKernelArgs;</td></tr>
127<tr><td class="num" id="LN48">48</td><td class="line">MemoryManager::AreaTable MemoryManager::sAreaTable;</td></tr>
128<tr><td class="num" id="LN49">49</td><td class="line">MemoryManager::Area* MemoryManager::sFreeAreas;</td></tr>
129<tr><td class="num" id="LN50">50</td><td class="line"><span class='keyword'>int</span> MemoryManager::sFreeAreaCount;</td></tr>
130<tr><td class="num" id="LN51">51</td><td class="line">MemoryManager::MetaChunkList MemoryManager::sFreeCompleteMetaChunks;</td></tr>
131<tr><td class="num" id="LN52">52</td><td class="line">MemoryManager::MetaChunkList MemoryManager::sFreeShortMetaChunks;</td></tr>
132<tr><td class="num" id="LN53">53</td><td class="line">MemoryManager::MetaChunkList MemoryManager::sPartialMetaChunksSmall;</td></tr>
133<tr><td class="num" id="LN54">54</td><td class="line">MemoryManager::MetaChunkList MemoryManager::sPartialMetaChunksMedium;</td></tr>
134<tr><td class="num" id="LN55">55</td><td class="line">MemoryManager::AllocationEntry* MemoryManager::sAllocationEntryCanWait;</td></tr>
135<tr><td class="num" id="LN56">56</td><td class="line">MemoryManager::AllocationEntry* MemoryManager::sAllocationEntryDontWait;</td></tr>
136<tr><td class="num" id="LN57">57</td><td class="line"><span class='keyword'>bool</span> MemoryManager::sMaintenanceNeeded;</td></tr>
137<tr><td class="num" id="LN58">58</td><td class="line"> </td></tr>
138<tr><td class="num" id="LN59">59</td><td class="line"> </td></tr>
139<tr><td class="num" id="LN60">60</td><td class="line"><span class='macro'>RANGE_MARKER_FUNCTION_BEGIN(SlabMemoryManager)<span class='expansion'>void SlabMemoryManager_begin() {}</span></span></td></tr>
140<tr><td class="num" id="LN61">61</td><td class="line"> </td></tr>
141<tr><td class="num" id="LN62">62</td><td class="line"> </td></tr>
142<tr><td class="num" id="LN63">63</td><td class="line"><span class='comment'>// #pragma mark - kernel tracing</span></td></tr>
143<tr><td class="num" id="LN64">64</td><td class="line"> </td></tr>
144<tr><td class="num" id="LN65">65</td><td class="line"> </td></tr>
145<tr><td class="num" id="LN66">66</td><td class="line"><span class='directive'>#if SLAB_MEMORY_MANAGER_TRACING</span></td></tr>
146<tr><td class="num" id="LN67">67</td><td class="line"> </td></tr>
147<tr><td class="num" id="LN68">68</td><td class="line"> </td></tr>
148<tr><td class="num" id="LN69">69</td><td class="line"><span class='comment'>//namespace SlabMemoryManagerCacheTracing {</span></td></tr>
149<tr><td class="num" id="LN70">70</td><td class="line"><span class='keyword'>struct</span> MemoryManager::Tracing {</td></tr>
150<tr><td class="num" id="LN71">71</td><td class="line"> </td></tr>
151<tr><td class="num" id="LN72">72</td><td class="line"><span class='keyword'>class</span> MemoryManagerTraceEntry</td></tr>
152<tr><td class="num" id="LN73">73</td><td class="line"> : <span class='keyword'>public</span> <span class='macro'>TRACE_ENTRY_SELECTOR(SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE)<span class='expansion'>AbstractTraceEntrySelector&lt;SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE<br>&gt;::Type</span></span> {</td></tr>
153<tr><td class="num" id="LN74">74</td><td class="line"><span class='keyword'>public</span>:</td></tr>
154<tr><td class="num" id="LN75">75</td><td class="line"> MemoryManagerTraceEntry()</td></tr>
155<tr><td class="num" id="LN76">76</td><td class="line"> :</td></tr>
156<tr><td class="num" id="LN77">77</td><td class="line"> TraceEntryBase(SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE, 0, <span class='keyword'>true</span>)</td></tr>
157<tr><td class="num" id="LN78">78</td><td class="line"> {</td></tr>
158<tr><td class="num" id="LN79">79</td><td class="line"> }</td></tr>
159<tr><td class="num" id="LN80">80</td><td class="line">};</td></tr>
160<tr><td class="num" id="LN81">81</td><td class="line"> </td></tr>
161<tr><td class="num" id="LN82">82</td><td class="line"> </td></tr>
162<tr><td class="num" id="LN83">83</td><td class="line"><span class='keyword'>class</span> Allocate : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
163<tr><td class="num" id="LN84">84</td><td class="line"><span class='keyword'>public</span>:</td></tr>
164<tr><td class="num" id="LN85">85</td><td class="line"> Allocate(ObjectCache* cache, uint32 flags)</td></tr>
165<tr><td class="num" id="LN86">86</td><td class="line"> :</td></tr>
166<tr><td class="num" id="LN87">87</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
167<tr><td class="num" id="LN88">88</td><td class="line"> fCache(cache),</td></tr>
168<tr><td class="num" id="LN89">89</td><td class="line"> fFlags(flags)</td></tr>
169<tr><td class="num" id="LN90">90</td><td class="line"> {</td></tr>
170<tr><td class="num" id="LN91">91</td><td class="line"> Initialized();</td></tr>
171<tr><td class="num" id="LN92">92</td><td class="line"> }</td></tr>
172<tr><td class="num" id="LN93">93</td><td class="line"> </td></tr>
173<tr><td class="num" id="LN94">94</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
174<tr><td class="num" id="LN95">95</td><td class="line"> {</td></tr>
175<tr><td class="num" id="LN96">96</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc: cache: %p, flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>,</td></tr>
176<tr><td class="num" id="LN97">97</td><td class="line"> fCache, fFlags);</td></tr>
177<tr><td class="num" id="LN98">98</td><td class="line"> }</td></tr>
178<tr><td class="num" id="LN99">99</td><td class="line"> </td></tr>
179<tr><td class="num" id="LN100">100</td><td class="line"><span class='keyword'>private</span>:</td></tr>
180<tr><td class="num" id="LN101">101</td><td class="line"> ObjectCache* fCache;</td></tr>
181<tr><td class="num" id="LN102">102</td><td class="line"> uint32 fFlags;</td></tr>
182<tr><td class="num" id="LN103">103</td><td class="line">};</td></tr>
183<tr><td class="num" id="LN104">104</td><td class="line"> </td></tr>
184<tr><td class="num" id="LN105">105</td><td class="line"> </td></tr>
185<tr><td class="num" id="LN106">106</td><td class="line"><span class='keyword'>class</span> Free : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
186<tr><td class="num" id="LN107">107</td><td class="line"><span class='keyword'>public</span>:</td></tr>
187<tr><td class="num" id="LN108">108</td><td class="line"> Free(<span class='keyword'>void</span>* address, uint32 flags)</td></tr>
188<tr><td class="num" id="LN109">109</td><td class="line"> :</td></tr>
189<tr><td class="num" id="LN110">110</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
190<tr><td class="num" id="LN111">111</td><td class="line"> fAddress(address),</td></tr>
191<tr><td class="num" id="LN112">112</td><td class="line"> fFlags(flags)</td></tr>
192<tr><td class="num" id="LN113">113</td><td class="line"> {</td></tr>
193<tr><td class="num" id="LN114">114</td><td class="line"> Initialized();</td></tr>
194<tr><td class="num" id="LN115">115</td><td class="line"> }</td></tr>
195<tr><td class="num" id="LN116">116</td><td class="line"> </td></tr>
196<tr><td class="num" id="LN117">117</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
197<tr><td class="num" id="LN118">118</td><td class="line"> {</td></tr>
198<tr><td class="num" id="LN119">119</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager free: address: %p, flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>,</td></tr>
199<tr><td class="num" id="LN120">120</td><td class="line"> fAddress, fFlags);</td></tr>
200<tr><td class="num" id="LN121">121</td><td class="line"> }</td></tr>
201<tr><td class="num" id="LN122">122</td><td class="line"> </td></tr>
202<tr><td class="num" id="LN123">123</td><td class="line"><span class='keyword'>private</span>:</td></tr>
203<tr><td class="num" id="LN124">124</td><td class="line"> <span class='keyword'>void</span>* fAddress;</td></tr>
204<tr><td class="num" id="LN125">125</td><td class="line"> uint32 fFlags;</td></tr>
205<tr><td class="num" id="LN126">126</td><td class="line">};</td></tr>
206<tr><td class="num" id="LN127">127</td><td class="line"> </td></tr>
207<tr><td class="num" id="LN128">128</td><td class="line"> </td></tr>
208<tr><td class="num" id="LN129">129</td><td class="line"><span class='keyword'>class</span> AllocateRaw : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
209<tr><td class="num" id="LN130">130</td><td class="line"><span class='keyword'>public</span>:</td></tr>
210<tr><td class="num" id="LN131">131</td><td class="line"> AllocateRaw(size_t size, uint32 flags)</td></tr>
211<tr><td class="num" id="LN132">132</td><td class="line"> :</td></tr>
212<tr><td class="num" id="LN133">133</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
213<tr><td class="num" id="LN134">134</td><td class="line"> fSize(size),</td></tr>
214<tr><td class="num" id="LN135">135</td><td class="line"> fFlags(flags)</td></tr>
215<tr><td class="num" id="LN136">136</td><td class="line"> {</td></tr>
216<tr><td class="num" id="LN137">137</td><td class="line"> Initialized();</td></tr>
217<tr><td class="num" id="LN138">138</td><td class="line"> }</td></tr>
218<tr><td class="num" id="LN139">139</td><td class="line"> </td></tr>
219<tr><td class="num" id="LN140">140</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
220<tr><td class="num" id="LN141">141</td><td class="line"> {</td></tr>
221<tr><td class="num" id="LN142">142</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc raw: size: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span></td></tr>
222<tr><td class="num" id="LN143">143</td><td class="line"> <span class='string_literal'>", flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>, fSize, fFlags);</td></tr>
223<tr><td class="num" id="LN144">144</td><td class="line"> }</td></tr>
224<tr><td class="num" id="LN145">145</td><td class="line"> </td></tr>
225<tr><td class="num" id="LN146">146</td><td class="line"><span class='keyword'>private</span>:</td></tr>
226<tr><td class="num" id="LN147">147</td><td class="line"> size_t fSize;</td></tr>
227<tr><td class="num" id="LN148">148</td><td class="line"> uint32 fFlags;</td></tr>
228<tr><td class="num" id="LN149">149</td><td class="line">};</td></tr>
229<tr><td class="num" id="LN150">150</td><td class="line"> </td></tr>
230<tr><td class="num" id="LN151">151</td><td class="line"> </td></tr>
231<tr><td class="num" id="LN152">152</td><td class="line"><span class='keyword'>class</span> FreeRawOrReturnCache : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
232<tr><td class="num" id="LN153">153</td><td class="line"><span class='keyword'>public</span>:</td></tr>
233<tr><td class="num" id="LN154">154</td><td class="line"> FreeRawOrReturnCache(<span class='keyword'>void</span>* address, uint32 flags)</td></tr>
234<tr><td class="num" id="LN155">155</td><td class="line"> :</td></tr>
235<tr><td class="num" id="LN156">156</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
236<tr><td class="num" id="LN157">157</td><td class="line"> fAddress(address),</td></tr>
237<tr><td class="num" id="LN158">158</td><td class="line"> fFlags(flags)</td></tr>
238<tr><td class="num" id="LN159">159</td><td class="line"> {</td></tr>
239<tr><td class="num" id="LN160">160</td><td class="line"> Initialized();</td></tr>
240<tr><td class="num" id="LN161">161</td><td class="line"> }</td></tr>
241<tr><td class="num" id="LN162">162</td><td class="line"> </td></tr>
242<tr><td class="num" id="LN163">163</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
243<tr><td class="num" id="LN164">164</td><td class="line"> {</td></tr>
244<tr><td class="num" id="LN165">165</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager free raw/return: address: %p, flags: %#"</span></td></tr>
245<tr><td class="num" id="LN166">166</td><td class="line"> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>, fAddress, fFlags);</td></tr>
246<tr><td class="num" id="LN167">167</td><td class="line"> }</td></tr>
247<tr><td class="num" id="LN168">168</td><td class="line"> </td></tr>
248<tr><td class="num" id="LN169">169</td><td class="line"><span class='keyword'>private</span>:</td></tr>
249<tr><td class="num" id="LN170">170</td><td class="line"> <span class='keyword'>void</span>* fAddress;</td></tr>
250<tr><td class="num" id="LN171">171</td><td class="line"> uint32 fFlags;</td></tr>
251<tr><td class="num" id="LN172">172</td><td class="line">};</td></tr>
252<tr><td class="num" id="LN173">173</td><td class="line"> </td></tr>
253<tr><td class="num" id="LN174">174</td><td class="line"> </td></tr>
254<tr><td class="num" id="LN175">175</td><td class="line"><span class='keyword'>class</span> AllocateArea : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
255<tr><td class="num" id="LN176">176</td><td class="line"><span class='keyword'>public</span>:</td></tr>
256<tr><td class="num" id="LN177">177</td><td class="line"> AllocateArea(Area* area, uint32 flags)</td></tr>
257<tr><td class="num" id="LN178">178</td><td class="line"> :</td></tr>
258<tr><td class="num" id="LN179">179</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
259<tr><td class="num" id="LN180">180</td><td class="line"> fArea(area),</td></tr>
260<tr><td class="num" id="LN181">181</td><td class="line"> fFlags(flags)</td></tr>
261<tr><td class="num" id="LN182">182</td><td class="line"> {</td></tr>
262<tr><td class="num" id="LN183">183</td><td class="line"> Initialized();</td></tr>
263<tr><td class="num" id="LN184">184</td><td class="line"> }</td></tr>
264<tr><td class="num" id="LN185">185</td><td class="line"> </td></tr>
265<tr><td class="num" id="LN186">186</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
266<tr><td class="num" id="LN187">187</td><td class="line"> {</td></tr>
267<tr><td class="num" id="LN188">188</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc area: flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span></td></tr>
268<tr><td class="num" id="LN189">189</td><td class="line"> <span class='string_literal'>" -&gt; %p"</span>, fFlags, fArea);</td></tr>
269<tr><td class="num" id="LN190">190</td><td class="line"> }</td></tr>
270<tr><td class="num" id="LN191">191</td><td class="line"> </td></tr>
271<tr><td class="num" id="LN192">192</td><td class="line"><span class='keyword'>private</span>:</td></tr>
272<tr><td class="num" id="LN193">193</td><td class="line"> Area* fArea;</td></tr>
273<tr><td class="num" id="LN194">194</td><td class="line"> uint32 fFlags;</td></tr>
274<tr><td class="num" id="LN195">195</td><td class="line">};</td></tr>
275<tr><td class="num" id="LN196">196</td><td class="line"> </td></tr>
276<tr><td class="num" id="LN197">197</td><td class="line"> </td></tr>
277<tr><td class="num" id="LN198">198</td><td class="line"><span class='keyword'>class</span> AddArea : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
278<tr><td class="num" id="LN199">199</td><td class="line"><span class='keyword'>public</span>:</td></tr>
279<tr><td class="num" id="LN200">200</td><td class="line"> AddArea(Area* area)</td></tr>
280<tr><td class="num" id="LN201">201</td><td class="line"> :</td></tr>
281<tr><td class="num" id="LN202">202</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
282<tr><td class="num" id="LN203">203</td><td class="line"> fArea(area)</td></tr>
283<tr><td class="num" id="LN204">204</td><td class="line"> {</td></tr>
284<tr><td class="num" id="LN205">205</td><td class="line"> Initialized();</td></tr>
285<tr><td class="num" id="LN206">206</td><td class="line"> }</td></tr>
286<tr><td class="num" id="LN207">207</td><td class="line"> </td></tr>
287<tr><td class="num" id="LN208">208</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
288<tr><td class="num" id="LN209">209</td><td class="line"> {</td></tr>
289<tr><td class="num" id="LN210">210</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager add area: %p"</span>, fArea);</td></tr>
290<tr><td class="num" id="LN211">211</td><td class="line"> }</td></tr>
291<tr><td class="num" id="LN212">212</td><td class="line"> </td></tr>
292<tr><td class="num" id="LN213">213</td><td class="line"><span class='keyword'>private</span>:</td></tr>
293<tr><td class="num" id="LN214">214</td><td class="line"> Area* fArea;</td></tr>
294<tr><td class="num" id="LN215">215</td><td class="line">};</td></tr>
295<tr><td class="num" id="LN216">216</td><td class="line"> </td></tr>
296<tr><td class="num" id="LN217">217</td><td class="line"> </td></tr>
297<tr><td class="num" id="LN218">218</td><td class="line"><span class='keyword'>class</span> FreeArea : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
298<tr><td class="num" id="LN219">219</td><td class="line"><span class='keyword'>public</span>:</td></tr>
299<tr><td class="num" id="LN220">220</td><td class="line"> FreeArea(Area* area, <span class='keyword'>bool</span> areaRemoved, uint32 flags)</td></tr>
300<tr><td class="num" id="LN221">221</td><td class="line"> :</td></tr>
301<tr><td class="num" id="LN222">222</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
302<tr><td class="num" id="LN223">223</td><td class="line"> fArea(area),</td></tr>
303<tr><td class="num" id="LN224">224</td><td class="line"> fFlags(flags),</td></tr>
304<tr><td class="num" id="LN225">225</td><td class="line"> fRemoved(areaRemoved)</td></tr>
305<tr><td class="num" id="LN226">226</td><td class="line"> {</td></tr>
306<tr><td class="num" id="LN227">227</td><td class="line"> Initialized();</td></tr>
307<tr><td class="num" id="LN228">228</td><td class="line"> }</td></tr>
308<tr><td class="num" id="LN229">229</td><td class="line"> </td></tr>
309<tr><td class="num" id="LN230">230</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
310<tr><td class="num" id="LN231">231</td><td class="line"> {</td></tr>
311<tr><td class="num" id="LN232">232</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager free area: %p%s, flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>,</td></tr>
312<tr><td class="num" id="LN233">233</td><td class="line"> fArea, fRemoved ? <span class='string_literal'>" (removed)"</span> : <span class='string_literal'>""</span>, fFlags);</td></tr>
313<tr><td class="num" id="LN234">234</td><td class="line"> }</td></tr>
314<tr><td class="num" id="LN235">235</td><td class="line"> </td></tr>
315<tr><td class="num" id="LN236">236</td><td class="line"><span class='keyword'>private</span>:</td></tr>
316<tr><td class="num" id="LN237">237</td><td class="line"> Area* fArea;</td></tr>
317<tr><td class="num" id="LN238">238</td><td class="line"> uint32 fFlags;</td></tr>
318<tr><td class="num" id="LN239">239</td><td class="line"> <span class='keyword'>bool</span> fRemoved;</td></tr>
319<tr><td class="num" id="LN240">240</td><td class="line">};</td></tr>
320<tr><td class="num" id="LN241">241</td><td class="line"> </td></tr>
321<tr><td class="num" id="LN242">242</td><td class="line"> </td></tr>
322<tr><td class="num" id="LN243">243</td><td class="line"><span class='keyword'>class</span> AllocateMetaChunk : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
323<tr><td class="num" id="LN244">244</td><td class="line"><span class='keyword'>public</span>:</td></tr>
324<tr><td class="num" id="LN245">245</td><td class="line"> AllocateMetaChunk(MetaChunk* metaChunk)</td></tr>
325<tr><td class="num" id="LN246">246</td><td class="line"> :</td></tr>
326<tr><td class="num" id="LN247">247</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
327<tr><td class="num" id="LN248">248</td><td class="line"> fMetaChunk(metaChunk-&gt;chunkBase)</td></tr>
328<tr><td class="num" id="LN249">249</td><td class="line"> {</td></tr>
329<tr><td class="num" id="LN250">250</td><td class="line"> Initialized();</td></tr>
330<tr><td class="num" id="LN251">251</td><td class="line"> }</td></tr>
331<tr><td class="num" id="LN252">252</td><td class="line"> </td></tr>
332<tr><td class="num" id="LN253">253</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
333<tr><td class="num" id="LN254">254</td><td class="line"> {</td></tr>
334<tr><td class="num" id="LN255">255</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc meta chunk: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span>,</td></tr>
335<tr><td class="num" id="LN256">256</td><td class="line"> fMetaChunk);</td></tr>
336<tr><td class="num" id="LN257">257</td><td class="line"> }</td></tr>
337<tr><td class="num" id="LN258">258</td><td class="line"> </td></tr>
338<tr><td class="num" id="LN259">259</td><td class="line"><span class='keyword'>private</span>:</td></tr>
339<tr><td class="num" id="LN260">260</td><td class="line"> addr_t fMetaChunk;</td></tr>
340<tr><td class="num" id="LN261">261</td><td class="line">};</td></tr>
341<tr><td class="num" id="LN262">262</td><td class="line"> </td></tr>
342<tr><td class="num" id="LN263">263</td><td class="line"> </td></tr>
343<tr><td class="num" id="LN264">264</td><td class="line"><span class='keyword'>class</span> FreeMetaChunk : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
344<tr><td class="num" id="LN265">265</td><td class="line"><span class='keyword'>public</span>:</td></tr>
345<tr><td class="num" id="LN266">266</td><td class="line"> FreeMetaChunk(MetaChunk* metaChunk)</td></tr>
346<tr><td class="num" id="LN267">267</td><td class="line"> :</td></tr>
347<tr><td class="num" id="LN268">268</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
348<tr><td class="num" id="LN269">269</td><td class="line"> fMetaChunk(metaChunk-&gt;chunkBase)</td></tr>
349<tr><td class="num" id="LN270">270</td><td class="line"> {</td></tr>
350<tr><td class="num" id="LN271">271</td><td class="line"> Initialized();</td></tr>
351<tr><td class="num" id="LN272">272</td><td class="line"> }</td></tr>
352<tr><td class="num" id="LN273">273</td><td class="line"> </td></tr>
353<tr><td class="num" id="LN274">274</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
354<tr><td class="num" id="LN275">275</td><td class="line"> {</td></tr>
355<tr><td class="num" id="LN276">276</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager free meta chunk: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span>,</td></tr>
356<tr><td class="num" id="LN277">277</td><td class="line"> fMetaChunk);</td></tr>
357<tr><td class="num" id="LN278">278</td><td class="line"> }</td></tr>
358<tr><td class="num" id="LN279">279</td><td class="line"> </td></tr>
359<tr><td class="num" id="LN280">280</td><td class="line"><span class='keyword'>private</span>:</td></tr>
360<tr><td class="num" id="LN281">281</td><td class="line"> addr_t fMetaChunk;</td></tr>
361<tr><td class="num" id="LN282">282</td><td class="line">};</td></tr>
362<tr><td class="num" id="LN283">283</td><td class="line"> </td></tr>
363<tr><td class="num" id="LN284">284</td><td class="line"> </td></tr>
364<tr><td class="num" id="LN285">285</td><td class="line"><span class='keyword'>class</span> AllocateChunk : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
365<tr><td class="num" id="LN286">286</td><td class="line"><span class='keyword'>public</span>:</td></tr>
366<tr><td class="num" id="LN287">287</td><td class="line"> AllocateChunk(size_t chunkSize, MetaChunk* metaChunk, Chunk* chunk)</td></tr>
367<tr><td class="num" id="LN288">288</td><td class="line"> :</td></tr>
368<tr><td class="num" id="LN289">289</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
369<tr><td class="num" id="LN290">290</td><td class="line"> fChunkSize(chunkSize),</td></tr>
370<tr><td class="num" id="LN291">291</td><td class="line"> fMetaChunk(metaChunk-&gt;chunkBase),</td></tr>
371<tr><td class="num" id="LN292">292</td><td class="line"> fChunk(chunk - metaChunk-&gt;chunks)</td></tr>
372<tr><td class="num" id="LN293">293</td><td class="line"> {</td></tr>
373<tr><td class="num" id="LN294">294</td><td class="line"> Initialized();</td></tr>
374<tr><td class="num" id="LN295">295</td><td class="line"> }</td></tr>
375<tr><td class="num" id="LN296">296</td><td class="line"> </td></tr>
376<tr><td class="num" id="LN297">297</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
377<tr><td class="num" id="LN298">298</td><td class="line"> {</td></tr>
378<tr><td class="num" id="LN299">299</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc chunk: size: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span></td></tr>
379<tr><td class="num" id="LN300">300</td><td class="line"> <span class='string_literal'>" -&gt; meta chunk: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span> <span class='string_literal'>", chunk: %"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span>, fChunkSize,</td></tr>
380<tr><td class="num" id="LN301">301</td><td class="line"> fMetaChunk, fChunk);</td></tr>
381<tr><td class="num" id="LN302">302</td><td class="line"> }</td></tr>
382<tr><td class="num" id="LN303">303</td><td class="line"> </td></tr>
383<tr><td class="num" id="LN304">304</td><td class="line"><span class='keyword'>private</span>:</td></tr>
384<tr><td class="num" id="LN305">305</td><td class="line"> size_t fChunkSize;</td></tr>
385<tr><td class="num" id="LN306">306</td><td class="line"> addr_t fMetaChunk;</td></tr>
386<tr><td class="num" id="LN307">307</td><td class="line"> uint32 fChunk;</td></tr>
387<tr><td class="num" id="LN308">308</td><td class="line">};</td></tr>
388<tr><td class="num" id="LN309">309</td><td class="line"> </td></tr>
389<tr><td class="num" id="LN310">310</td><td class="line"> </td></tr>
390<tr><td class="num" id="LN311">311</td><td class="line"><span class='keyword'>class</span> AllocateChunks : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
391<tr><td class="num" id="LN312">312</td><td class="line"><span class='keyword'>public</span>:</td></tr>
392<tr><td class="num" id="LN313">313</td><td class="line"> AllocateChunks(size_t chunkSize, uint32 chunkCount, MetaChunk* metaChunk,</td></tr>
393<tr><td class="num" id="LN314">314</td><td class="line"> Chunk* chunk)</td></tr>
394<tr><td class="num" id="LN315">315</td><td class="line"> :</td></tr>
395<tr><td class="num" id="LN316">316</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
396<tr><td class="num" id="LN317">317</td><td class="line"> fMetaChunk(metaChunk-&gt;chunkBase),</td></tr>
397<tr><td class="num" id="LN318">318</td><td class="line"> fChunkSize(chunkSize),</td></tr>
398<tr><td class="num" id="LN319">319</td><td class="line"> fChunkCount(chunkCount),</td></tr>
399<tr><td class="num" id="LN320">320</td><td class="line"> fChunk(chunk - metaChunk-&gt;chunks)</td></tr>
400<tr><td class="num" id="LN321">321</td><td class="line"> {</td></tr>
401<tr><td class="num" id="LN322">322</td><td class="line"> Initialized();</td></tr>
402<tr><td class="num" id="LN323">323</td><td class="line"> }</td></tr>
403<tr><td class="num" id="LN324">324</td><td class="line"> </td></tr>
404<tr><td class="num" id="LN325">325</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
405<tr><td class="num" id="LN326">326</td><td class="line"> {</td></tr>
406<tr><td class="num" id="LN327">327</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager alloc chunks: size: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span></td></tr>
407<tr><td class="num" id="LN328">328</td><td class="line"> <span class='string_literal'>", count %"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" -&gt; meta chunk: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span> <span class='string_literal'>", chunk: %"</span></td></tr>
408<tr><td class="num" id="LN329">329</td><td class="line"> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span>, fChunkSize, fChunkCount, fMetaChunk, fChunk);</td></tr>
409<tr><td class="num" id="LN330">330</td><td class="line"> }</td></tr>
410<tr><td class="num" id="LN331">331</td><td class="line"> </td></tr>
411<tr><td class="num" id="LN332">332</td><td class="line"><span class='keyword'>private</span>:</td></tr>
412<tr><td class="num" id="LN333">333</td><td class="line"> addr_t fMetaChunk;</td></tr>
413<tr><td class="num" id="LN334">334</td><td class="line"> size_t fChunkSize;</td></tr>
414<tr><td class="num" id="LN335">335</td><td class="line"> uint32 fChunkCount;</td></tr>
415<tr><td class="num" id="LN336">336</td><td class="line"> uint32 fChunk;</td></tr>
416<tr><td class="num" id="LN337">337</td><td class="line">};</td></tr>
417<tr><td class="num" id="LN338">338</td><td class="line"> </td></tr>
418<tr><td class="num" id="LN339">339</td><td class="line"> </td></tr>
419<tr><td class="num" id="LN340">340</td><td class="line"><span class='keyword'>class</span> FreeChunk : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
420<tr><td class="num" id="LN341">341</td><td class="line"><span class='keyword'>public</span>:</td></tr>
421<tr><td class="num" id="LN342">342</td><td class="line"> FreeChunk(MetaChunk* metaChunk, Chunk* chunk)</td></tr>
422<tr><td class="num" id="LN343">343</td><td class="line"> :</td></tr>
423<tr><td class="num" id="LN344">344</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
424<tr><td class="num" id="LN345">345</td><td class="line"> fMetaChunk(metaChunk-&gt;chunkBase),</td></tr>
425<tr><td class="num" id="LN346">346</td><td class="line"> fChunk(chunk - metaChunk-&gt;chunks)</td></tr>
426<tr><td class="num" id="LN347">347</td><td class="line"> {</td></tr>
427<tr><td class="num" id="LN348">348</td><td class="line"> Initialized();</td></tr>
428<tr><td class="num" id="LN349">349</td><td class="line"> }</td></tr>
429<tr><td class="num" id="LN350">350</td><td class="line"> </td></tr>
430<tr><td class="num" id="LN351">351</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
431<tr><td class="num" id="LN352">352</td><td class="line"> {</td></tr>
432<tr><td class="num" id="LN353">353</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager free chunk: meta chunk: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span></td></tr>
433<tr><td class="num" id="LN354">354</td><td class="line"> <span class='string_literal'>", chunk: %"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span>, fMetaChunk, fChunk);</td></tr>
434<tr><td class="num" id="LN355">355</td><td class="line"> }</td></tr>
435<tr><td class="num" id="LN356">356</td><td class="line"> </td></tr>
436<tr><td class="num" id="LN357">357</td><td class="line"><span class='keyword'>private</span>:</td></tr>
437<tr><td class="num" id="LN358">358</td><td class="line"> addr_t fMetaChunk;</td></tr>
438<tr><td class="num" id="LN359">359</td><td class="line"> uint32 fChunk;</td></tr>
439<tr><td class="num" id="LN360">360</td><td class="line">};</td></tr>
440<tr><td class="num" id="LN361">361</td><td class="line"> </td></tr>
441<tr><td class="num" id="LN362">362</td><td class="line"> </td></tr>
442<tr><td class="num" id="LN363">363</td><td class="line"><span class='keyword'>class</span> Map : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
443<tr><td class="num" id="LN364">364</td><td class="line"><span class='keyword'>public</span>:</td></tr>
444<tr><td class="num" id="LN365">365</td><td class="line"> Map(addr_t address, size_t size, uint32 flags)</td></tr>
445<tr><td class="num" id="LN366">366</td><td class="line"> :</td></tr>
446<tr><td class="num" id="LN367">367</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
447<tr><td class="num" id="LN368">368</td><td class="line"> fAddress(address),</td></tr>
448<tr><td class="num" id="LN369">369</td><td class="line"> fSize(size),</td></tr>
449<tr><td class="num" id="LN370">370</td><td class="line"> fFlags(flags)</td></tr>
450<tr><td class="num" id="LN371">371</td><td class="line"> {</td></tr>
451<tr><td class="num" id="LN372">372</td><td class="line"> Initialized();</td></tr>
452<tr><td class="num" id="LN373">373</td><td class="line"> }</td></tr>
453<tr><td class="num" id="LN374">374</td><td class="line"> </td></tr>
454<tr><td class="num" id="LN375">375</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
455<tr><td class="num" id="LN376">376</td><td class="line"> {</td></tr>
456<tr><td class="num" id="LN377">377</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager map: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span> <span class='string_literal'>", size: %"</span></td></tr>
457<tr><td class="num" id="LN378">378</td><td class="line"> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>", flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>, fAddress, fSize, fFlags);</td></tr>
458<tr><td class="num" id="LN379">379</td><td class="line"> }</td></tr>
459<tr><td class="num" id="LN380">380</td><td class="line"> </td></tr>
460<tr><td class="num" id="LN381">381</td><td class="line"><span class='keyword'>private</span>:</td></tr>
461<tr><td class="num" id="LN382">382</td><td class="line"> addr_t fAddress;</td></tr>
462<tr><td class="num" id="LN383">383</td><td class="line"> size_t fSize;</td></tr>
463<tr><td class="num" id="LN384">384</td><td class="line"> uint32 fFlags;</td></tr>
464<tr><td class="num" id="LN385">385</td><td class="line">};</td></tr>
465<tr><td class="num" id="LN386">386</td><td class="line"> </td></tr>
466<tr><td class="num" id="LN387">387</td><td class="line"> </td></tr>
467<tr><td class="num" id="LN388">388</td><td class="line"><span class='keyword'>class</span> Unmap : <span class='keyword'>public</span> MemoryManagerTraceEntry {</td></tr>
468<tr><td class="num" id="LN389">389</td><td class="line"><span class='keyword'>public</span>:</td></tr>
469<tr><td class="num" id="LN390">390</td><td class="line"> Unmap(addr_t address, size_t size, uint32 flags)</td></tr>
470<tr><td class="num" id="LN391">391</td><td class="line"> :</td></tr>
471<tr><td class="num" id="LN392">392</td><td class="line"> MemoryManagerTraceEntry(),</td></tr>
472<tr><td class="num" id="LN393">393</td><td class="line"> fAddress(address),</td></tr>
473<tr><td class="num" id="LN394">394</td><td class="line"> fSize(size),</td></tr>
474<tr><td class="num" id="LN395">395</td><td class="line"> fFlags(flags)</td></tr>
475<tr><td class="num" id="LN396">396</td><td class="line"> {</td></tr>
476<tr><td class="num" id="LN397">397</td><td class="line"> Initialized();</td></tr>
477<tr><td class="num" id="LN398">398</td><td class="line"> }</td></tr>
478<tr><td class="num" id="LN399">399</td><td class="line"> </td></tr>
479<tr><td class="num" id="LN400">400</td><td class="line"> <span class='keyword'>virtual</span> <span class='keyword'>void</span> AddDump(TraceOutput&amp; out)</td></tr>
480<tr><td class="num" id="LN401">401</td><td class="line"> {</td></tr>
481<tr><td class="num" id="LN402">402</td><td class="line"> out.Print(<span class='string_literal'>"slab memory manager unmap: %#"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span> <span class='string_literal'>", size: %"</span></td></tr>
482<tr><td class="num" id="LN403">403</td><td class="line"> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>", flags: %#"</span> <span class='macro'>B_PRIx32<span class='expansion'>"l" "x"</span></span>, fAddress, fSize, fFlags);</td></tr>
483<tr><td class="num" id="LN404">404</td><td class="line"> }</td></tr>
484<tr><td class="num" id="LN405">405</td><td class="line"> </td></tr>
485<tr><td class="num" id="LN406">406</td><td class="line"><span class='keyword'>private</span>:</td></tr>
486<tr><td class="num" id="LN407">407</td><td class="line"> addr_t fAddress;</td></tr>
487<tr><td class="num" id="LN408">408</td><td class="line"> size_t fSize;</td></tr>
488<tr><td class="num" id="LN409">409</td><td class="line"> uint32 fFlags;</td></tr>
489<tr><td class="num" id="LN410">410</td><td class="line">};</td></tr>
490<tr><td class="num" id="LN411">411</td><td class="line"> </td></tr>
491<tr><td class="num" id="LN412">412</td><td class="line"> </td></tr>
492<tr><td class="num" id="LN413">413</td><td class="line"><span class='comment'>//} // namespace SlabMemoryManagerCacheTracing</span></td></tr>
493<tr><td class="num" id="LN414">414</td><td class="line">}; <span class='comment'>// struct MemoryManager::Tracing</span></td></tr>
494<tr><td class="num" id="LN415">415</td><td class="line"> </td></tr>
495<tr><td class="num" id="LN416">416</td><td class="line"> </td></tr>
496<tr><td class="num" id="LN417">417</td><td class="line"><span class='comment'>//# define T(x) new(std::nothrow) SlabMemoryManagerCacheTracing::x</span></td></tr>
497<tr><td class="num" id="LN418">418</td><td class="line"><span class='directive'># define T(x) new(std::nothrow) MemoryManager::Tracing::x</span></td></tr>
498<tr><td class="num" id="LN419">419</td><td class="line"> </td></tr>
499<tr><td class="num" id="LN420">420</td><td class="line"><span class='directive'>#else</span></td></tr>
500<tr><td class="num" id="LN421">421</td><td class="line"><span class='directive'># define T(x)</span></td></tr>
501<tr><td class="num" id="LN422">422</td><td class="line"><span class='directive'>#endif // SLAB_MEMORY_MANAGER_TRACING</span></td></tr>
502<tr><td class="num" id="LN423">423</td><td class="line"> </td></tr>
503<tr><td class="num" id="LN424">424</td><td class="line"> </td></tr>
504<tr><td class="num" id="LN425">425</td><td class="line"><span class='comment'>// #pragma mark - MemoryManager</span></td></tr>
505<tr><td class="num" id="LN426">426</td><td class="line"> </td></tr>
506<tr><td class="num" id="LN427">427</td><td class="line"> </td></tr>
507<tr><td class="num" id="LN428">428</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
508<tr><td class="num" id="LN429">429</td><td class="line">MemoryManager::Init(kernel_args* args)</td></tr>
509<tr><td class="num" id="LN430">430</td><td class="line">{</td></tr>
510<tr><td class="num" id="LN431">431</td><td class="line"> mutex_init(&amp;sLock, <span class='string_literal'>"slab memory manager"</span>);</td></tr>
511<tr><td class="num" id="LN432">432</td><td class="line"> rw_lock_init(&amp;sAreaTableLock, <span class='string_literal'>"slab memory manager area table"</span>);</td></tr>
512<tr><td class="num" id="LN433">433</td><td class="line"> sKernelArgs = args;</td></tr>
513<tr><td class="num" id="LN434">434</td><td class="line"> </td></tr>
514<tr><td class="num" id="LN435">435</td><td class="line"> <span class='keyword'>new</span>(&amp;sFreeCompleteMetaChunks) MetaChunkList;</td></tr>
515<tr><td class="num" id="LN436">436</td><td class="line"> <span class='keyword'>new</span>(&amp;sFreeShortMetaChunks) MetaChunkList;</td></tr>
516<tr><td class="num" id="LN437">437</td><td class="line"> <span class='keyword'>new</span>(&amp;sPartialMetaChunksSmall) MetaChunkList;</td></tr>
517<tr><td class="num" id="LN438">438</td><td class="line"> <span class='keyword'>new</span>(&amp;sPartialMetaChunksMedium) MetaChunkList;</td></tr>
518<tr><td class="num" id="LN439">439</td><td class="line"> </td></tr>
519<tr><td class="num" id="LN440">440</td><td class="line"> <span class='keyword'>new</span>(&amp;sAreaTable) AreaTable;</td></tr>
520<tr><td class="num" id="LN441">441</td><td class="line"> sAreaTable.Resize(sAreaTableBuffer, <span class='keyword'>sizeof</span>(sAreaTableBuffer), <span class='keyword'>true</span>);</td></tr>
521<tr><td class="num" id="LN442">442</td><td class="line"> <span class='comment'>// A bit hacky: The table now owns the memory. Since we never resize or</span></td></tr>
522<tr><td class="num" id="LN443">443</td><td class="line"> <span class='comment'>// free it, that's not a problem, though.</span></td></tr>
523<tr><td class="num" id="LN444">444</td><td class="line"> </td></tr>
524<tr><td class="num" id="LN445">445</td><td class="line"> sFreeAreas = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
525<tr><td class="num" id="LN446">446</td><td class="line"> sFreeAreaCount = 0;</td></tr>
526<tr><td class="num" id="LN447">447</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>false</span>;</td></tr>
527<tr><td class="num" id="LN448">448</td><td class="line">}</td></tr>
528<tr><td class="num" id="LN449">449</td><td class="line"> </td></tr>
529<tr><td class="num" id="LN450">450</td><td class="line"> </td></tr>
530<tr><td class="num" id="LN451">451</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
531<tr><td class="num" id="LN452">452</td><td class="line">MemoryManager::InitPostArea()</td></tr>
532<tr><td class="num" id="LN453">453</td><td class="line">{</td></tr>
533<tr><td class="num" id="LN454">454</td><td class="line"> sKernelArgs = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
534<tr><td class="num" id="LN455">455</td><td class="line"> </td></tr>
535<tr><td class="num" id="LN456">456</td><td class="line"> <span class='comment'>// Convert all areas to actual areas. This loop might look a bit weird, but</span></td></tr>
536<tr><td class="num" id="LN457">457</td><td class="line"> <span class='comment'>// is necessary since creating the actual area involves memory allocations,</span></td></tr>
537<tr><td class="num" id="LN458">458</td><td class="line"> <span class='comment'>// which in turn can change the situation.</span></td></tr>
538<tr><td class="num" id="LN459">459</td><td class="line"> <span class='keyword'>bool</span> done;</td></tr>
539<tr><td class="num" id="LN460">460</td><td class="line"> <span class='keyword'>do</span> {</td></tr>
540<tr><td class="num" id="LN461">461</td><td class="line"> done = <span class='keyword'>true</span>;</td></tr>
541<tr><td class="num" id="LN462">462</td><td class="line"> </td></tr>
542<tr><td class="num" id="LN463">463</td><td class="line"> <span class='keyword'>for</span> (AreaTable::Iterator it = sAreaTable.GetIterator();</td></tr>
543<tr><td class="num" id="LN464">464</td><td class="line"> Area* area = it.Next();) {</td></tr>
544<tr><td class="num" id="LN465">465</td><td class="line"> <span class='keyword'>if</span> (area-&gt;vmArea == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
545<tr><td class="num" id="LN466">466</td><td class="line"> _ConvertEarlyArea(area);</td></tr>
546<tr><td class="num" id="LN467">467</td><td class="line"> done = <span class='keyword'>false</span>;</td></tr>
547<tr><td class="num" id="LN468">468</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
548<tr><td class="num" id="LN469">469</td><td class="line"> }</td></tr>
549<tr><td class="num" id="LN470">470</td><td class="line"> }</td></tr>
550<tr><td class="num" id="LN471">471</td><td class="line"> } <span class='keyword'>while</span> (!done);</td></tr>
551<tr><td class="num" id="LN472">472</td><td class="line"> </td></tr>
552<tr><td class="num" id="LN473">473</td><td class="line"> <span class='comment'>// unmap and free unused pages</span></td></tr>
553<tr><td class="num" id="LN474">474</td><td class="line"> <span class='keyword'>if</span> (sFreeAreas != <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
554<tr><td class="num" id="LN475">475</td><td class="line"> <span class='comment'>// Just "leak" all but the first of the free areas -- the VM will</span></td></tr>
555<tr><td class="num" id="LN476">476</td><td class="line"> <span class='comment'>// automatically free all unclaimed memory.</span></td></tr>
556<tr><td class="num" id="LN477">477</td><td class="line"> sFreeAreas-&gt;next = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
557<tr><td class="num" id="LN478">478</td><td class="line"> sFreeAreaCount = 1;</td></tr>
558<tr><td class="num" id="LN479">479</td><td class="line"> </td></tr>
559<tr><td class="num" id="LN480">480</td><td class="line"> Area* area = sFreeAreas;</td></tr>
560<tr><td class="num" id="LN481">481</td><td class="line"> _ConvertEarlyArea(area);</td></tr>
561<tr><td class="num" id="LN482">482</td><td class="line"> _UnmapFreeChunksEarly(area);</td></tr>
562<tr><td class="num" id="LN483">483</td><td class="line"> }</td></tr>
563<tr><td class="num" id="LN484">484</td><td class="line"> </td></tr>
564<tr><td class="num" id="LN485">485</td><td class="line"> <span class='keyword'>for</span> (AreaTable::Iterator it = sAreaTable.GetIterator();</td></tr>
565<tr><td class="num" id="LN486">486</td><td class="line"> Area* area = it.Next();) {</td></tr>
566<tr><td class="num" id="LN487">487</td><td class="line"> _UnmapFreeChunksEarly(area);</td></tr>
567<tr><td class="num" id="LN488">488</td><td class="line"> }</td></tr>
568<tr><td class="num" id="LN489">489</td><td class="line"> </td></tr>
569<tr><td class="num" id="LN490">490</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>true</span>;</td></tr>
570<tr><td class="num" id="LN491">491</td><td class="line"> <span class='comment'>// might not be necessary, but doesn't harm</span></td></tr>
571<tr><td class="num" id="LN492">492</td><td class="line"> </td></tr>
572<tr><td class="num" id="LN493">493</td><td class="line"> add_debugger_command_etc(<span class='string_literal'>"slab_area"</span>, &amp;_DumpArea,</td></tr>
573<tr><td class="num" id="LN494">494</td><td class="line"> <span class='string_literal'>"Dump information on a given slab area"</span>,</td></tr>
574<tr><td class="num" id="LN495">495</td><td class="line"> <span class='string_literal'>"[ -c ] &lt;area&gt;\n"</span></td></tr>
575<tr><td class="num" id="LN496">496</td><td class="line"> <span class='string_literal'>"Dump information on a given slab area specified by its base "</span></td></tr>
576<tr><td class="num" id="LN497">497</td><td class="line"> <span class='string_literal'>"address.\n"</span></td></tr>
577<tr><td class="num" id="LN498">498</td><td class="line"> <span class='string_literal'>"If \"-c\" is given, the chunks of all meta chunks area printed as "</span></td></tr>
578<tr><td class="num" id="LN499">499</td><td class="line"> <span class='string_literal'>"well.\n"</span>, 0);</td></tr>
579<tr><td class="num" id="LN500">500</td><td class="line"> add_debugger_command_etc(<span class='string_literal'>"slab_areas"</span>, &amp;_DumpAreas,</td></tr>
580<tr><td class="num" id="LN501">501</td><td class="line"> <span class='string_literal'>"List all slab areas"</span>,</td></tr>
581<tr><td class="num" id="LN502">502</td><td class="line"> <span class='string_literal'>"\n"</span></td></tr>
582<tr><td class="num" id="LN503">503</td><td class="line"> <span class='string_literal'>"Lists all slab areas.\n"</span>, 0);</td></tr>
583<tr><td class="num" id="LN504">504</td><td class="line"> add_debugger_command_etc(<span class='string_literal'>"slab_meta_chunk"</span>, &amp;_DumpMetaChunk,</td></tr>
584<tr><td class="num" id="LN505">505</td><td class="line"> <span class='string_literal'>"Dump information on a given slab meta chunk"</span>,</td></tr>
585<tr><td class="num" id="LN506">506</td><td class="line"> <span class='string_literal'>"&lt;meta chunk&gt;\n"</span></td></tr>
586<tr><td class="num" id="LN507">507</td><td class="line"> <span class='string_literal'>"Dump information on a given slab meta chunk specified by its base "</span></td></tr>
587<tr><td class="num" id="LN508">508</td><td class="line"> <span class='string_literal'>"or object address.\n"</span>, 0);</td></tr>
588<tr><td class="num" id="LN509">509</td><td class="line"> add_debugger_command_etc(<span class='string_literal'>"slab_meta_chunks"</span>, &amp;_DumpMetaChunks,</td></tr>
589<tr><td class="num" id="LN510">510</td><td class="line"> <span class='string_literal'>"List all non-full slab meta chunks"</span>,</td></tr>
590<tr><td class="num" id="LN511">511</td><td class="line"> <span class='string_literal'>"[ -c ]\n"</span></td></tr>
591<tr><td class="num" id="LN512">512</td><td class="line"> <span class='string_literal'>"Lists all non-full slab meta chunks.\n"</span></td></tr>
592<tr><td class="num" id="LN513">513</td><td class="line"> <span class='string_literal'>"If \"-c\" is given, the chunks of all meta chunks area printed as "</span></td></tr>
593<tr><td class="num" id="LN514">514</td><td class="line"> <span class='string_literal'>"well.\n"</span>, 0);</td></tr>
594<tr><td class="num" id="LN515">515</td><td class="line"> add_debugger_command_etc(<span class='string_literal'>"slab_raw_allocations"</span>, &amp;_DumpRawAllocations,</td></tr>
595<tr><td class="num" id="LN516">516</td><td class="line"> <span class='string_literal'>"List all raw allocations in slab areas"</span>,</td></tr>
596<tr><td class="num" id="LN517">517</td><td class="line"> <span class='string_literal'>"\n"</span></td></tr>
597<tr><td class="num" id="LN518">518</td><td class="line"> <span class='string_literal'>"Lists all raw allocations in slab areas.\n"</span>, 0);</td></tr>
598<tr><td class="num" id="LN519">519</td><td class="line">}</td></tr>
599<tr><td class="num" id="LN520">520</td><td class="line"> </td></tr>
600<tr><td class="num" id="LN521">521</td><td class="line"> </td></tr>
601<tr><td class="num" id="LN522">522</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
602<tr><td class="num" id="LN523">523</td><td class="line">MemoryManager::Allocate(ObjectCache* cache, uint32 flags, <span class='keyword'>void</span>*&amp; _pages)</td></tr>
603<tr><td class="num" id="LN524">524</td><td class="line">{</td></tr>
604<tr><td class="num" id="LN525">525</td><td class="line"> <span class='comment'>// TODO: Support CACHE_UNLOCKED_PAGES!</span></td></tr>
605<tr><td class="num" id="LN526">526</td><td class="line"> </td></tr>
606<tr><td class="num" id="LN527">527</td><td class="line"> T(Allocate(cache, flags));</td></tr>
607<tr><td class="num" id="LN528">528</td><td class="line"> </td></tr>
608<tr><td class="num" id="LN529">529</td><td class="line"> size_t chunkSize = cache-&gt;slab_size;</td></tr>
609<tr><td class="num" id="LN530">530</td><td class="line"> </td></tr>
610<tr><td class="num" id="LN531">531</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::Allocate(%p, %#"</span> B_PRIx32 <span class='string_literal'>"): chunkSize: %"<span class='expansion'>do {} while (false)</span></span></span></td></tr>
611<tr><td class="num" id="LN532">532</td><td class="line"> <span class='macro'>B_PRIuSIZE <span class='string_literal'>"\n"</span>, cache, flags, chunkSize)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
612<tr><td class="num" id="LN533">533</td><td class="line"> </td></tr>
613<tr><td class="num" id="LN534">534</td><td class="line"> MutexLocker locker(sLock);</td></tr>
614<tr><td class="num" id="LN535">535</td><td class="line"> </td></tr>
615<tr><td class="num" id="LN536">536</td><td class="line"> <span class='comment'>// allocate a chunk</span></td></tr>
616<tr><td class="num" id="LN537">537</td><td class="line"> MetaChunk* metaChunk;</td></tr>
617<tr><td class="num" id="LN538">538</td><td class="line"> Chunk* chunk;</td></tr>
618<tr><td class="num" id="LN539">539</td><td class="line"> status_t error = _AllocateChunks(chunkSize, 1, flags, metaChunk, chunk);</td></tr>
619<tr><td class="num" id="LN540">540</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>)</td></tr>
620<tr><td class="num" id="LN541">541</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
621<tr><td class="num" id="LN542">542</td><td class="line"> </td></tr>
622<tr><td class="num" id="LN543">543</td><td class="line"> <span class='comment'>// map the chunk</span></td></tr>
623<tr><td class="num" id="LN544">544</td><td class="line"> Area* area = metaChunk-&gt;GetArea();</td></tr>
624<tr><td class="num" id="LN545">545</td><td class="line"> addr_t chunkAddress = _ChunkAddress(metaChunk, chunk);</td></tr>
625<tr><td class="num" id="LN546">546</td><td class="line"> </td></tr>
626<tr><td class="num" id="LN547">547</td><td class="line"> locker.Unlock();</td></tr>
627<tr><td class="num" id="LN548">548</td><td class="line"> error = _MapChunk(area-&gt;vmArea, chunkAddress, chunkSize, 0, flags);</td></tr>
628<tr><td class="num" id="LN549">549</td><td class="line"> locker.Lock();</td></tr>
629<tr><td class="num" id="LN550">550</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>) {</td></tr>
630<tr><td class="num" id="LN551">551</td><td class="line"> <span class='comment'>// something failed -- free the chunk</span></td></tr>
631<tr><td class="num" id="LN552">552</td><td class="line"> _FreeChunk(area, metaChunk, chunk, chunkAddress, <span class='keyword'>true</span>, flags);</td></tr>
632<tr><td class="num" id="LN553">553</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
633<tr><td class="num" id="LN554">554</td><td class="line"> }</td></tr>
634<tr><td class="num" id="LN555">555</td><td class="line"> </td></tr>
635<tr><td class="num" id="LN556">556</td><td class="line"> chunk-&gt;reference = (addr_t)cache;</td></tr>
636<tr><td class="num" id="LN557">557</td><td class="line"> _pages = (<span class='keyword'>void</span>*)chunkAddress;</td></tr>
637<tr><td class="num" id="LN558">558</td><td class="line"> </td></tr>
638<tr><td class="num" id="LN559">559</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::Allocate() done: %p (meta chunk: %d, chunk %d)\n"</span>,<span class='expansion'>do {} while (false)</span></span></td></tr>
639<tr><td class="num" id="LN560">560</td><td class="line"> <span class='macro'>_pages, <span class='keyword'>int</span>(metaChunk - area-&gt;metaChunks),<span class='expansion'>do {} while (false)</span></span></td></tr>
640<tr><td class="num" id="LN561">561</td><td class="line"> <span class='keyword'><span class='macro'>int</span>(chunk - metaChunk-&gt;chunks))<span class='expansion'>do {} while (false)</span></span>;</td></tr>
641<tr><td class="num" id="LN562">562</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
642<tr><td class="num" id="LN563">563</td><td class="line">}</td></tr>
643<tr><td class="num" id="LN564">564</td><td class="line"> </td></tr>
644<tr><td class="num" id="LN565">565</td><td class="line"> </td></tr>
645<tr><td class="num" id="LN566">566</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
646<tr><td class="num" id="LN567">567</td><td class="line">MemoryManager::Free(<span class='keyword'>void</span>* pages, uint32 flags)</td></tr>
647<tr><td class="num" id="LN568">568</td><td class="line">{</td></tr>
648<tr><td class="num" id="LN569">569</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::Free(%p, %#"</span> B_PRIx32 <span class='string_literal'>")\n"</span>, pages, flags)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
649<tr><td class="num" id="LN570">570</td><td class="line"> </td></tr>
650<tr><td class="num" id="LN571">571</td><td class="line"> T(Free(pages, flags));</td></tr>
651<tr><td class="num" id="LN572">572</td><td class="line"> </td></tr>
652<tr><td class="num" id="LN573">573</td><td class="line"> <span class='comment'>// get the area and the meta chunk</span></td></tr>
653<tr><td class="num" id="LN574">574</td><td class="line"> Area* area = _AreaForAddress((addr_t)pages);</td></tr>
654<tr><td class="num" id="LN575">575</td><td class="line"> MetaChunk* metaChunk = &amp;area-&gt;metaChunks[</td></tr>
655<tr><td class="num" id="LN576">576</td><td class="line"> ((addr_t)pages % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>];</td></tr>
656<tr><td class="num" id="LN577">577</td><td class="line"> </td></tr>
657<tr><td class="num" id="LN578">578</td><td class="line"> <span class='macro'>ASSERT(metaChunk-&gt;chunkSize &gt; 0)<span class='expansion'>do { if (!(metaChunk-&gt;chunkSize &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 578, "metaChunk-&gt;chunkSize &gt; 0"); } } while (0)</span></span>;</td></tr>
658<tr><td class="num" id="LN579">579</td><td class="line"> <span class='macro'>ASSERT((addr_t)pages &gt;= metaChunk-&gt;chunkBase)<span class='expansion'>do { if (!((addr_t)pages &gt;= metaChunk-&gt;chunkBase)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 579, "(addr_t)pages &gt;= metaChunk-&gt;chunkBase"); } } while<br> (0)</span></span>;</td></tr>
659<tr><td class="num" id="LN580">580</td><td class="line"> <span class='macro'>ASSERT(((addr_t)pages % metaChunk-&gt;chunkSize) == 0)<span class='expansion'>do { if (!(((addr_t)pages % metaChunk-&gt;chunkSize) == 0)) {<br> panic("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 580, "((addr_t)pages % metaChunk-&gt;chunkSize) == 0"); } }<br> while (0)</span></span>;</td></tr>
660<tr><td class="num" id="LN581">581</td><td class="line"> </td></tr>
661<tr><td class="num" id="LN582">582</td><td class="line"> <span class='comment'>// get the chunk</span></td></tr>
662<tr><td class="num" id="LN583">583</td><td class="line"> uint16 chunkIndex = _ChunkIndexForAddress(metaChunk, (addr_t)pages);</td></tr>
663<tr><td class="num" id="LN584">584</td><td class="line"> Chunk* chunk = &amp;metaChunk-&gt;chunks[chunkIndex];</td></tr>
664<tr><td class="num" id="LN585">585</td><td class="line"> </td></tr>
665<tr><td class="num" id="LN586">586</td><td class="line"> <span class='macro'>ASSERT(chunk-&gt;next != NULL)<span class='expansion'>do { if (!(chunk-&gt;next != __null)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 586, "chunk-&gt;next != __null"); } } while (0)</span></span>;</td></tr>
666<tr><td class="num" id="LN587">587</td><td class="line"> <span class='macro'>ASSERT(chunk-&gt;next &lt; metaChunk-&gt;chunks<span class='expansion'>do { if (!(chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;<br>next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096))) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 589, "chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096)"<br>); } } while (0)</span></span></td></tr>
667<tr><td class="num" id="LN588">588</td><td class="line"> <span class='macro'>|| chunk-&gt;next<span class='expansion'>do { if (!(chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;<br>next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096))) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 589, "chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096)"<br>); } } while (0)</span></span></td></tr>
668<tr><td class="num" id="LN589">589</td><td class="line"> <span class='macro'>&gt;= metaChunk-&gt;chunks + SLAB_SMALL_CHUNKS_PER_META_CHUNK)<span class='expansion'>do { if (!(chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;<br>next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096))) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 589, "chunk-&gt;next &lt; metaChunk-&gt;chunks || chunk-&gt;next &gt;= metaChunk-&gt;chunks + ((128 * 4096) / 4096)"<br>); } } while (0)</span></span>;</td></tr>
669<tr><td class="num" id="LN590">590</td><td class="line"> </td></tr>
670<tr><td class="num" id="LN591">591</td><td class="line"> <span class='comment'>// and free it</span></td></tr>
671<tr><td class="num" id="LN592">592</td><td class="line"> MutexLocker locker(sLock);</td></tr>
672<tr><td class="num" id="LN593">593</td><td class="line"> _FreeChunk(area, metaChunk, chunk, (addr_t)pages, <span class='keyword'>false</span>, flags);</td></tr>
673<tr><td class="num" id="LN594">594</td><td class="line">}</td></tr>
674<tr><td class="num" id="LN595">595</td><td class="line"> </td></tr>
675<tr><td class="num" id="LN596">596</td><td class="line"> </td></tr>
676<tr><td class="num" id="LN597">597</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
677<tr><td class="num" id="LN598">598</td><td class="line">MemoryManager::AllocateRaw(size_t size, uint32 flags, <span class='keyword'>void</span>*&amp; _pages)</td></tr>
678<tr><td class="num" id="LN599">599</td><td class="line">{</td></tr>
679<tr><td class="num" id="LN600">600</td><td class="line"><span class='directive'>#if SLAB_MEMORY_MANAGER_TRACING</span></td></tr>
680<tr><td class="num" id="LN601">601</td><td class="line"><span class='directive'>#if <span class='macro'>SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING<span class='expansion'>(0 != 0 &amp;&amp; SLAB_MEMORY_MANAGER_TRACING != 0 &amp;&amp;<br> SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE &gt; 0)</span></span></span></td></tr>
681<tr><td class="num" id="LN602">602</td><td class="line"> AbstractTraceEntryWithStackTrace* traceEntry = T(AllocateRaw(size, flags));</td></tr>
682<tr><td class="num" id="LN603">603</td><td class="line"> size += <span class='keyword'>sizeof</span>(AllocationTrackingInfo);</td></tr>
683<tr><td class="num" id="LN604">604</td><td class="line"><span class='directive'>#else</span></td></tr>
684<tr><td class="num" id="LN605">605</td><td class="line"> T(AllocateRaw(size, flags));</td></tr>
685<tr><td class="num" id="LN606">606</td><td class="line"><span class='directive'>#endif</span></td></tr>
686<tr><td class="num" id="LN607">607</td><td class="line"><span class='directive'>#endif</span></td></tr>
687<tr><td class="num" id="LN608">608</td><td class="line"> </td></tr>
688<tr><td class="num" id="LN609">609</td><td class="line"> size = <span class='macro'>ROUNDUP(size, SLAB_CHUNK_SIZE_SMALL)<span class='expansion'>((((size) + (4096) - 1) / (4096)) * (4096))</span></span>;</td></tr>
689<tr><td class="num" id="LN610">610</td><td class="line"> </td></tr>
690<tr><td class="num" id="LN611">611</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::AllocateRaw(%"</span> B_PRIuSIZE <span class='string_literal'>", %#"</span> B_PRIx32 <span class='string_literal'>")\n"</span>, size,<span class='expansion'>do {} while (false)</span></span></td></tr>
691<tr><td class="num" id="LN612">612</td><td class="line"> <span class='macro'>flags)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
692<tr><td class="num" id="LN613">613</td><td class="line"> </td></tr>
693<tr><td class="num" id="LN614">614</td><td class="line"> <span class='keyword'>if</span> (size &gt; <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span> || (flags &amp; CACHE_ALIGN_ON_SIZE) != 0) {</td></tr>
694<tr><td class="num" id="LN615">615</td><td class="line"> <span class='comment'>// Requested size greater than a large chunk or an aligned allocation.</span></td></tr>
695<tr><td class="num" id="LN616">616</td><td class="line"> <span class='comment'>// Allocate as an area.</span></td></tr>
696<tr><td class="num" id="LN617">617</td><td class="line"> <span class='keyword'>if</span> ((flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) != 0)</td></tr>
697<tr><td class="num" id="LN618">618</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_WOULD_BLOCK<span class='expansion'>((-2147483647 - 1) + 11)</span></span>;</td></tr>
698<tr><td class="num" id="LN619">619</td><td class="line"> </td></tr>
699<tr><td class="num" id="LN620">620</td><td class="line"> virtual_address_restrictions virtualRestrictions = {};</td></tr>
700<tr><td class="num" id="LN621">621</td><td class="line"> virtualRestrictions.address_specification</td></tr>
701<tr><td class="num" id="LN622">622</td><td class="line"> = (flags &amp; CACHE_ALIGN_ON_SIZE) != 0</td></tr>
702<tr><td class="num" id="LN623">623</td><td class="line"> ? <span class='macro'>B_ANY_KERNEL_BLOCK_ADDRESS<span class='expansion'>(4 + 1)</span></span> : <span class='macro'>B_ANY_KERNEL_ADDRESS<span class='expansion'>4</span></span>;</td></tr>
703<tr><td class="num" id="LN624">624</td><td class="line"> physical_address_restrictions physicalRestrictions = {};</td></tr>
704<tr><td class="num" id="LN625">625</td><td class="line"> area_id area = create_area_etc(VMAddressSpace::KernelID(),</td></tr>
705<tr><td class="num" id="LN626">626</td><td class="line"> <span class='string_literal'>"slab large raw allocation"</span>, size, <span class='macro'>B_FULL_LOCK<span class='expansion'>2</span></span>,</td></tr>
706<tr><td class="num" id="LN627">627</td><td class="line"> <span class='macro'>B_KERNEL_READ_AREA<span class='expansion'>16</span></span> | <span class='macro'>B_KERNEL_WRITE_AREA<span class='expansion'>32</span></span>,</td></tr>
707<tr><td class="num" id="LN628">628</td><td class="line"> ((flags &amp; CACHE_DONT_WAIT_FOR_MEMORY) != 0</td></tr>
708<tr><td class="num" id="LN629">629</td><td class="line"> ? <span class='macro'>CREATE_AREA_DONT_WAIT<span class='expansion'>0x01</span></span> : 0)</td></tr>
709<tr><td class="num" id="LN630">630</td><td class="line"> | <span class='macro'>CREATE_AREA_DONT_CLEAR<span class='expansion'>0x04</span></span>, 0,</td></tr>
710<tr><td class="num" id="LN631">631</td><td class="line"> &amp;virtualRestrictions, &amp;physicalRestrictions, &amp;_pages);</td></tr>
711<tr><td class="num" id="LN632">632</td><td class="line"> </td></tr>
712<tr><td class="num" id="LN633">633</td><td class="line"> status_t result = area &gt;= 0 ? <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span> : area;</td></tr>
713<tr><td class="num" id="LN634">634</td><td class="line"> <span class='keyword'>if</span> (result == <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>) {</td></tr>
714<tr><td class="num" id="LN635">635</td><td class="line"> fill_allocated_block(_pages, size);</td></tr>
715<tr><td class="num" id="LN636">636</td><td class="line"><span class='directive'>#if <span class='macro'>SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING<span class='expansion'>(0 != 0 &amp;&amp; SLAB_MEMORY_MANAGER_TRACING != 0 &amp;&amp;<br> SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE &gt; 0)</span></span></span></td></tr>
716<tr><td class="num" id="LN637">637</td><td class="line"> _AddTrackingInfo(_pages, size, traceEntry);</td></tr>
717<tr><td class="num" id="LN638">638</td><td class="line"><span class='directive'>#endif</span></td></tr>
718<tr><td class="num" id="LN639">639</td><td class="line"> }</td></tr>
719<tr><td class="num" id="LN640">640</td><td class="line"> </td></tr>
720<tr><td class="num" id="LN641">641</td><td class="line"> <span class='keyword'>return</span> result;</td></tr>
721<tr><td class="num" id="LN642">642</td><td class="line"> }</td></tr>
722<tr><td class="num" id="LN643">643</td><td class="line"> </td></tr>
723<tr><td class="num" id="LN644">644</td><td class="line"> <span class='comment'>// determine chunk size (small or medium)</span></td></tr>
724<tr><td class="num" id="LN645">645</td><td class="line"> size_t chunkSize = <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>;</td></tr>
725<tr><td class="num" id="LN646">646</td><td class="line"> uint32 chunkCount = size / <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>;</td></tr>
726<tr><td class="num" id="LN647">647</td><td class="line"> </td></tr>
727<tr><td class="num" id="LN648">648</td><td class="line"> <span class='keyword'>if</span> (size % <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span> == 0) {</td></tr>
728<tr><td class="num" id="LN649">649</td><td class="line"> chunkSize = <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>;</td></tr>
729<tr><td class="num" id="LN650">650</td><td class="line"> chunkCount = size / <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>;</td></tr>
730<tr><td class="num" id="LN651">651</td><td class="line"> }</td></tr>
731<tr><td class="num" id="LN652">652</td><td class="line"> </td></tr>
732<tr><td class="num" id="LN653">653</td><td class="line"> MutexLocker locker(sLock);</td></tr>
733<tr><td class="num" id="LN654">654</td><td class="line"> </td></tr>
734<tr><td class="num" id="LN655">655</td><td class="line"> <span class='comment'>// allocate the chunks</span></td></tr>
735<tr><td class="num" id="LN656">656</td><td class="line"> MetaChunk* metaChunk;</td></tr>
736<tr><td class="num" id="LN657">657</td><td class="line"> Chunk* chunk;</td></tr>
737<tr><td class="num" id="LN658">658</td><td class="line"> status_t error = _AllocateChunks(chunkSize, chunkCount, flags, metaChunk,</td></tr>
738<tr><td class="num" id="LN659">659</td><td class="line"> chunk);</td></tr>
739<tr><td class="num" id="LN660">660</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>)</td></tr>
740<tr><td class="num" id="LN661">661</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
741<tr><td class="num" id="LN662">662</td><td class="line"> </td></tr>
742<tr><td class="num" id="LN663">663</td><td class="line"> <span class='comment'>// map the chunks</span></td></tr>
743<tr><td class="num" id="LN664">664</td><td class="line"> Area* area = metaChunk-&gt;GetArea();</td></tr>
744<tr><td class="num" id="LN665">665</td><td class="line"> addr_t chunkAddress = _ChunkAddress(metaChunk, chunk);</td></tr>
745<tr><td class="num" id="LN666">666</td><td class="line"> </td></tr>
746<tr><td class="num" id="LN667">667</td><td class="line"> locker.Unlock();</td></tr>
747<tr><td class="num" id="LN668">668</td><td class="line"> error = _MapChunk(area-&gt;vmArea, chunkAddress, size, 0, flags);</td></tr>
748<tr><td class="num" id="LN669">669</td><td class="line"> locker.Lock();</td></tr>
749<tr><td class="num" id="LN670">670</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>) {</td></tr>
750<tr><td class="num" id="LN671">671</td><td class="line"> <span class='comment'>// something failed -- free the chunks</span></td></tr>
751<tr><td class="num" id="LN672">672</td><td class="line"> <span class='keyword'>for</span> (uint32 i = 0; i &lt; chunkCount; i++)</td></tr>
752<tr><td class="num" id="LN673">673</td><td class="line"> _FreeChunk(area, metaChunk, chunk + i, chunkAddress, <span class='keyword'>true</span>, flags);</td></tr>
753<tr><td class="num" id="LN674">674</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
754<tr><td class="num" id="LN675">675</td><td class="line"> }</td></tr>
755<tr><td class="num" id="LN676">676</td><td class="line"> </td></tr>
756<tr><td class="num" id="LN677">677</td><td class="line"> chunk-&gt;reference = (addr_t)chunkAddress + size - 1;</td></tr>
757<tr><td class="num" id="LN678">678</td><td class="line"> _pages = (<span class='keyword'>void</span>*)chunkAddress;</td></tr>
758<tr><td class="num" id="LN679">679</td><td class="line"> </td></tr>
759<tr><td class="num" id="LN680">680</td><td class="line"> fill_allocated_block(_pages, size);</td></tr>
760<tr><td class="num" id="LN681">681</td><td class="line"><span class='directive'>#if <span class='macro'>SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING<span class='expansion'>(0 != 0 &amp;&amp; SLAB_MEMORY_MANAGER_TRACING != 0 &amp;&amp;<br> SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE &gt; 0)</span></span></span></td></tr>
761<tr><td class="num" id="LN682">682</td><td class="line"> _AddTrackingInfo(_pages, size, traceEntry);</td></tr>
762<tr><td class="num" id="LN683">683</td><td class="line"><span class='directive'>#endif</span></td></tr>
763<tr><td class="num" id="LN684">684</td><td class="line"> </td></tr>
764<tr><td class="num" id="LN685">685</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::AllocateRaw() done: %p (meta chunk: %d, chunk %d)\n"</span>,<span class='expansion'>do {} while (false)</span></span></td></tr>
765<tr><td class="num" id="LN686">686</td><td class="line"> <span class='macro'>_pages, <span class='keyword'>int</span>(metaChunk - area-&gt;metaChunks),<span class='expansion'>do {} while (false)</span></span></td></tr>
766<tr><td class="num" id="LN687">687</td><td class="line"> <span class='keyword'><span class='macro'>int</span>(chunk - metaChunk-&gt;chunks))<span class='expansion'>do {} while (false)</span></span>;</td></tr>
767<tr><td class="num" id="LN688">688</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
768<tr><td class="num" id="LN689">689</td><td class="line">}</td></tr>
769<tr><td class="num" id="LN690">690</td><td class="line"> </td></tr>
770<tr><td class="num" id="LN691">691</td><td class="line"> </td></tr>
771<tr><td class="num" id="LN692">692</td><td class="line"><span class='comment'>/*static*/</span> ObjectCache*</td></tr>
772<tr><td class="num" id="LN693">693</td><td class="line">MemoryManager::FreeRawOrReturnCache(<span class='keyword'>void</span>* pages, uint32 flags)</td></tr>
773<tr><td class="num" id="LN694">694</td><td class="line">{</td></tr>
774<tr><td class="num" id="LN695">695</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::FreeRawOrReturnCache(%p, %#"</span> B_PRIx32 <span class='string_literal'>")\n"</span>, pages,<span class='expansion'>do {} while (false)</span></span></td></tr>
775<tr><td class="num" id="LN696">696</td><td class="line"> <span class='macro'>flags)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
776<tr><td class="num" id="LN697">697</td><td class="line"> </td></tr>
777<tr><td class="num" id="LN698">698</td><td class="line"> T(FreeRawOrReturnCache(pages, flags));</td></tr>
778<tr><td class="num" id="LN699">699</td><td class="line"> </td></tr>
779<tr><td class="num" id="LN700">700</td><td class="line"> <span class='comment'>// get the area</span></td></tr>
780<tr><td class="num" id="LN701">701</td><td class="line"> addr_t areaBase = _AreaBaseAddressForAddress((addr_t)pages);</td></tr>
781<tr><td class="num" id="LN702">702</td><td class="line"> </td></tr>
782<tr><td class="num" id="LN703">703</td><td class="line"> ReadLocker readLocker(sAreaTableLock);</td></tr>
783<tr><td class="num" id="LN704">704</td><td class="line"> Area* area = sAreaTable.Lookup(areaBase);</td></tr>
784<tr><td class="num" id="LN705">705</td><td class="line"> readLocker.Unlock();</td></tr>
785<tr><td class="num" id="LN706">706</td><td class="line"> </td></tr>
786<tr><td class="num" id="LN707">707</td><td class="line"> <span class='keyword'>if</span> (area == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
787<tr><td class="num" id="LN708">708</td><td class="line"> <span class='comment'>// Probably a large allocation. Look up the VM area.</span></td></tr>
788<tr><td class="num" id="LN709">709</td><td class="line"> VMAddressSpace* addressSpace = VMAddressSpace::Kernel();</td></tr>
789<tr><td class="num" id="LN710">710</td><td class="line"> addressSpace-&gt;ReadLock();</td></tr>
790<tr><td class="num" id="LN711">711</td><td class="line"> VMArea* area = addressSpace-&gt;LookupArea((addr_t)pages);</td></tr>
791<tr><td class="num" id="LN712">712</td><td class="line"> addressSpace-&gt;ReadUnlock();</td></tr>
792<tr><td class="num" id="LN713">713</td><td class="line"> </td></tr>
793<tr><td class="num" id="LN714">714</td><td class="line"> <span class='keyword'>if</span> (area != <span class='macro'>NULL<span class='expansion'>__null</span></span> &amp;&amp; (addr_t)pages == area-&gt;Base())</td></tr>
794<tr><td class="num" id="LN715">715</td><td class="line"> delete_area(area-&gt;id);</td></tr>
795<tr><td class="num" id="LN716">716</td><td class="line"> <span class='keyword'>else</span></td></tr>
796<tr><td class="num" id="LN717">717</td><td class="line"> panic(<span class='string_literal'>"freeing unknown block %p from area %p"</span>, pages, area);</td></tr>
797<tr><td class="num" id="LN718">718</td><td class="line"> </td></tr>
798<tr><td class="num" id="LN719">719</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
799<tr><td class="num" id="LN720">720</td><td class="line"> }</td></tr>
800<tr><td class="num" id="LN721">721</td><td class="line"> </td></tr>
801<tr><td class="num" id="LN722">722</td><td class="line"> MetaChunk* metaChunk = &amp;area-&gt;metaChunks[</td></tr>
802<tr><td class="num" id="LN723">723</td><td class="line"> ((addr_t)pages % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>];</td></tr>
803<tr><td class="num" id="LN724">724</td><td class="line"> </td></tr>
804<tr><td class="num" id="LN725">725</td><td class="line"> <span class='comment'>// get the chunk</span></td></tr>
805<tr><td class="num" id="LN726">726</td><td class="line"> <span class='macro'>ASSERT(metaChunk-&gt;chunkSize &gt; 0)<span class='expansion'>do { if (!(metaChunk-&gt;chunkSize &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 726, "metaChunk-&gt;chunkSize &gt; 0"); } } while (0)</span></span>;</td></tr>
806<tr><td class="num" id="LN727">727</td><td class="line"> <span class='macro'>ASSERT((addr_t)pages &gt;= metaChunk-&gt;chunkBase)<span class='expansion'>do { if (!((addr_t)pages &gt;= metaChunk-&gt;chunkBase)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 727, "(addr_t)pages &gt;= metaChunk-&gt;chunkBase"); } } while<br> (0)</span></span>;</td></tr>
807<tr><td class="num" id="LN728">728</td><td class="line"> uint16 chunkIndex = _ChunkIndexForAddress(metaChunk, (addr_t)pages);</td></tr>
808<tr><td class="num" id="LN729">729</td><td class="line"> Chunk* chunk = &amp;metaChunk-&gt;chunks[chunkIndex];</td></tr>
809<tr><td class="num" id="LN730">730</td><td class="line"> </td></tr>
810<tr><td class="num" id="LN731">731</td><td class="line"> addr_t reference = chunk-&gt;reference;</td></tr>
811<tr><td class="num" id="LN732">732</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0)</td></tr>
812<tr><td class="num" id="LN733">733</td><td class="line"> <span class='keyword'>return</span> (ObjectCache*)reference;</td></tr>
813<tr><td class="num" id="LN734">734</td><td class="line"> </td></tr>
814<tr><td class="num" id="LN735">735</td><td class="line"> <span class='comment'>// Seems we have a raw chunk allocation.</span></td></tr>
815<tr><td class="num" id="LN736">736</td><td class="line"> <span class='macro'>ASSERT((addr_t)pages == _ChunkAddress(metaChunk, chunk))<span class='expansion'>do { if (!((addr_t)pages == _ChunkAddress(metaChunk, chunk)))<br> { panic("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 736, "(addr_t)pages == _ChunkAddress(metaChunk, chunk)"); }<br> } while (0)</span></span>;</td></tr>
816<tr><td class="num" id="LN737">737</td><td class="line"> <span class='macro'>ASSERT(reference &gt; (addr_t)pages)<span class='expansion'>do { if (!(reference &gt; (addr_t)pages)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 737, "reference &gt; (addr_t)pages"); } } while (0)</span></span>;</td></tr>
817<tr><td class="num" id="LN738">738</td><td class="line"> <span class='macro'>ASSERT(reference &lt;= areaBase + SLAB_AREA_SIZE - 1)<span class='expansion'>do { if (!(reference &lt;= areaBase + (2048 * 4096) - 1)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 738, "reference &lt;= areaBase + (2048 * 4096) - 1"); } } while<br> (0)</span></span>;</td></tr>
818<tr><td class="num" id="LN739">739</td><td class="line"> size_t size = reference - (addr_t)pages + 1;</td></tr>
819<tr><td class="num" id="LN740">740</td><td class="line"> <span class='macro'>ASSERT((size % SLAB_CHUNK_SIZE_SMALL) == 0)<span class='expansion'>do { if (!((size % 4096) == 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 740, "(size % 4096) == 0"); } } while (0)</span></span>;</td></tr>
820<tr><td class="num" id="LN741">741</td><td class="line"> </td></tr>
821<tr><td class="num" id="LN742">742</td><td class="line"> <span class='comment'>// unmap the chunks</span></td></tr>
822<tr><td class="num" id="LN743">743</td><td class="line"> _UnmapChunk(area-&gt;vmArea, (addr_t)pages, size, flags);</td></tr>
823<tr><td class="num" id="LN744">744</td><td class="line"> </td></tr>
824<tr><td class="num" id="LN745">745</td><td class="line"> <span class='comment'>// and free them</span></td></tr>
825<tr><td class="num" id="LN746">746</td><td class="line"> MutexLocker locker(sLock);</td></tr>
826<tr><td class="num" id="LN747">747</td><td class="line"> uint32 chunkCount = size / metaChunk-&gt;chunkSize;</td></tr>
827<tr><td class="num" id="LN748">748</td><td class="line"> <span class='keyword'>for</span> (uint32 i = 0; i &lt; chunkCount; i++)</td></tr>
828<tr><td class="num" id="LN749">749</td><td class="line"> _FreeChunk(area, metaChunk, chunk + i, (addr_t)pages, <span class='keyword'>true</span>, flags);</td></tr>
829<tr><td class="num" id="LN750">750</td><td class="line"> </td></tr>
830<tr><td class="num" id="LN751">751</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
831<tr><td class="num" id="LN752">752</td><td class="line">}</td></tr>
832<tr><td class="num" id="LN753">753</td><td class="line"> </td></tr>
833<tr><td class="num" id="LN754">754</td><td class="line"> </td></tr>
834<tr><td class="num" id="LN755">755</td><td class="line"><span class='comment'>/*static*/</span> size_t</td></tr>
835<tr><td class="num" id="LN756">756</td><td class="line">MemoryManager::AcceptableChunkSize(size_t size)</td></tr>
836<tr><td class="num" id="LN757">757</td><td class="line">{</td></tr>
837<tr><td class="num" id="LN758">758</td><td class="line"> <span class='keyword'>if</span> (size &lt;= <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>)</td></tr>
838<tr><td class="num" id="LN759">759</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>;</td></tr>
839<tr><td class="num" id="LN760">760</td><td class="line"> <span class='keyword'>if</span> (size &lt;= <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>)</td></tr>
840<tr><td class="num" id="LN761">761</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>;</td></tr>
841<tr><td class="num" id="LN762">762</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>;</td></tr>
842<tr><td class="num" id="LN763">763</td><td class="line">}</td></tr>
843<tr><td class="num" id="LN764">764</td><td class="line"> </td></tr>
844<tr><td class="num" id="LN765">765</td><td class="line"> </td></tr>
845<tr><td class="num" id="LN766">766</td><td class="line"><span class='comment'>/*static*/</span> ObjectCache*</td></tr>
846<tr><td class="num" id="LN767">767</td><td class="line">MemoryManager::GetAllocationInfo(<span class='keyword'>void</span>* address, size_t&amp; _size)</td></tr>
847<tr><td class="num" id="LN768">768</td><td class="line">{</td></tr>
848<tr><td class="num" id="LN769">769</td><td class="line"> <span class='comment'>// get the area</span></td></tr>
849<tr><td class="num" id="LN770">770</td><td class="line"> ReadLocker readLocker(sAreaTableLock);</td></tr>
850<tr><td class="num" id="LN771">771</td><td class="line"> Area* area = sAreaTable.Lookup(_AreaBaseAddressForAddress((addr_t)address));</td></tr>
851<tr><td class="num" id="LN772">772</td><td class="line"> readLocker.Unlock();</td></tr>
852<tr><td class="num" id="LN773">773</td><td class="line"> </td></tr>
853<tr><td class="num" id="LN774">774</td><td class="line"> <span class='keyword'>if</span> (area == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
854<tr><td class="num" id="LN775">775</td><td class="line"> VMAddressSpace* addressSpace = VMAddressSpace::Kernel();</td></tr>
855<tr><td class="num" id="LN776">776</td><td class="line"> addressSpace-&gt;ReadLock();</td></tr>
856<tr><td class="num" id="LN777">777</td><td class="line"> VMArea* area = addressSpace-&gt;LookupArea((addr_t)address);</td></tr>
857<tr><td class="num" id="LN778">778</td><td class="line"> <span class='keyword'>if</span> (area != <span class='macro'>NULL<span class='expansion'>__null</span></span> &amp;&amp; (addr_t)address == area-&gt;Base())</td></tr>
858<tr><td class="num" id="LN779">779</td><td class="line"> _size = area-&gt;Size();</td></tr>
859<tr><td class="num" id="LN780">780</td><td class="line"> <span class='keyword'>else</span></td></tr>
860<tr><td class="num" id="LN781">781</td><td class="line"> _size = 0;</td></tr>
861<tr><td class="num" id="LN782">782</td><td class="line"> addressSpace-&gt;ReadUnlock();</td></tr>
862<tr><td class="num" id="LN783">783</td><td class="line"> </td></tr>
863<tr><td class="num" id="LN784">784</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
864<tr><td class="num" id="LN785">785</td><td class="line"> }</td></tr>
865<tr><td class="num" id="LN786">786</td><td class="line"> </td></tr>
866<tr><td class="num" id="LN787">787</td><td class="line"> MetaChunk* metaChunk = &amp;area-&gt;metaChunks[</td></tr>
867<tr><td class="num" id="LN788">788</td><td class="line"> ((addr_t)address % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>];</td></tr>
868<tr><td class="num" id="LN789">789</td><td class="line"> </td></tr>
869<tr><td class="num" id="LN790">790</td><td class="line"> <span class='comment'>// get the chunk</span></td></tr>
870<tr><td class="num" id="LN791">791</td><td class="line"> <span class='macro'>ASSERT(metaChunk-&gt;chunkSize &gt; 0)<span class='expansion'>do { if (!(metaChunk-&gt;chunkSize &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 791, "metaChunk-&gt;chunkSize &gt; 0"); } } while (0)</span></span>;</td></tr>
871<tr><td class="num" id="LN792">792</td><td class="line"> <span class='macro'>ASSERT((addr_t)address &gt;= metaChunk-&gt;chunkBase)<span class='expansion'>do { if (!((addr_t)address &gt;= metaChunk-&gt;chunkBase)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 792, "(addr_t)address &gt;= metaChunk-&gt;chunkBase"); } } while<br> (0)</span></span>;</td></tr>
872<tr><td class="num" id="LN793">793</td><td class="line"> uint16 chunkIndex = _ChunkIndexForAddress(metaChunk, (addr_t)address);</td></tr>
873<tr><td class="num" id="LN794">794</td><td class="line"> </td></tr>
874<tr><td class="num" id="LN795">795</td><td class="line"> addr_t reference = metaChunk-&gt;chunks[chunkIndex].reference;</td></tr>
875<tr><td class="num" id="LN796">796</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0) {</td></tr>
876<tr><td class="num" id="LN797">797</td><td class="line"> ObjectCache* cache = (ObjectCache*)reference;</td></tr>
877<tr><td class="num" id="LN798">798</td><td class="line"> _size = cache-&gt;object_size;</td></tr>
878<tr><td class="num" id="LN799">799</td><td class="line"> <span class='keyword'>return</span> cache;</td></tr>
879<tr><td class="num" id="LN800">800</td><td class="line"> }</td></tr>
880<tr><td class="num" id="LN801">801</td><td class="line"> </td></tr>
881<tr><td class="num" id="LN802">802</td><td class="line"> _size = reference - (addr_t)address + 1;</td></tr>
882<tr><td class="num" id="LN803">803</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
883<tr><td class="num" id="LN804">804</td><td class="line">}</td></tr>
884<tr><td class="num" id="LN805">805</td><td class="line"> </td></tr>
885<tr><td class="num" id="LN806">806</td><td class="line"> </td></tr>
886<tr><td class="num" id="LN807">807</td><td class="line"><span class='comment'>/*static*/</span> ObjectCache*</td></tr>
887<tr><td class="num" id="LN808">808</td><td class="line">MemoryManager::CacheForAddress(<span class='keyword'>void</span>* address)</td></tr>
888<tr><td class="num" id="LN809">809</td><td class="line">{</td></tr>
889<tr><td class="num" id="LN810">810</td><td class="line"> <span class='comment'>// get the area</span></td></tr>
890<tr><td class="num" id="LN811">811</td><td class="line"> ReadLocker readLocker(sAreaTableLock);</td></tr>
891<tr><td class="num" id="LN812">812</td><td class="line"> Area* area = sAreaTable.Lookup(_AreaBaseAddressForAddress((addr_t)address));</td></tr>
892<tr><td class="num" id="LN813">813</td><td class="line"> readLocker.Unlock();</td></tr>
893<tr><td class="num" id="LN814">814</td><td class="line"> </td></tr>
894<tr><td class="num" id="LN815">815</td><td class="line"> <span class='keyword'>if</span> (area == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
895<tr><td class="num" id="LN816">816</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
896<tr><td class="num" id="LN817">817</td><td class="line"> </td></tr>
897<tr><td class="num" id="LN818">818</td><td class="line"> MetaChunk* metaChunk = &amp;area-&gt;metaChunks[</td></tr>
898<tr><td class="num" id="LN819">819</td><td class="line"> ((addr_t)address % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>];</td></tr>
899<tr><td class="num" id="LN820">820</td><td class="line"> </td></tr>
900<tr><td class="num" id="LN821">821</td><td class="line"> <span class='comment'>// get the chunk</span></td></tr>
901<tr><td class="num" id="LN822">822</td><td class="line"> <span class='macro'>ASSERT(metaChunk-&gt;chunkSize &gt; 0)<span class='expansion'>do { if (!(metaChunk-&gt;chunkSize &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 822, "metaChunk-&gt;chunkSize &gt; 0"); } } while (0)</span></span>;</td></tr>
902<tr><td class="num" id="LN823">823</td><td class="line"> <span class='macro'>ASSERT((addr_t)address &gt;= metaChunk-&gt;chunkBase)<span class='expansion'>do { if (!((addr_t)address &gt;= metaChunk-&gt;chunkBase)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 823, "(addr_t)address &gt;= metaChunk-&gt;chunkBase"); } } while<br> (0)</span></span>;</td></tr>
903<tr><td class="num" id="LN824">824</td><td class="line"> uint16 chunkIndex = _ChunkIndexForAddress(metaChunk, (addr_t)address);</td></tr>
904<tr><td class="num" id="LN825">825</td><td class="line"> </td></tr>
905<tr><td class="num" id="LN826">826</td><td class="line"> addr_t reference = metaChunk-&gt;chunks[chunkIndex].reference;</td></tr>
906<tr><td class="num" id="LN827">827</td><td class="line"> <span class='keyword'>return</span> (reference &amp; 1) == 0 ? (ObjectCache*)reference : <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
907<tr><td class="num" id="LN828">828</td><td class="line">}</td></tr>
908<tr><td class="num" id="LN829">829</td><td class="line"> </td></tr>
909<tr><td class="num" id="LN830">830</td><td class="line"> </td></tr>
910<tr><td class="num" id="LN831">831</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
911<tr><td class="num" id="LN832">832</td><td class="line">MemoryManager::PerformMaintenance()</td></tr>
912<tr><td class="num" id="LN833">833</td><td class="line">{</td></tr>
913<tr><td class="num" id="LN834">834</td><td class="line"> MutexLocker locker(sLock);</td></tr>
914<tr><td class="num" id="LN835">835</td><td class="line"> </td></tr>
915<tr><td class="num" id="LN836">836</td><td class="line"> <span class='keyword'>while</span> (sMaintenanceNeeded) {</td></tr>
916<tr><td class="num" id="LN837">837</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>false</span>;</td></tr>
917<tr><td class="num" id="LN838">838</td><td class="line"> </td></tr>
918<tr><td class="num" id="LN839">839</td><td class="line"> <span class='comment'>// We want to keep one or two areas as a reserve. This way we have at</span></td></tr>
919<tr><td class="num" id="LN840">840</td><td class="line"> <span class='comment'>// least one area to use in situations when we aren't allowed to</span></td></tr>
920<tr><td class="num" id="LN841">841</td><td class="line"> <span class='comment'>// allocate one and also avoid ping-pong effects.</span></td></tr>
921<tr><td class="num" id="LN842">842</td><td class="line"> <span class='keyword'>if</span> (sFreeAreaCount &gt; 0 &amp;&amp; sFreeAreaCount &lt;= 2)</td></tr>
922<tr><td class="num" id="LN843">843</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
923<tr><td class="num" id="LN844">844</td><td class="line"> </td></tr>
924<tr><td class="num" id="LN845">845</td><td class="line"> <span class='keyword'>if</span> (sFreeAreaCount == 0) {</td></tr>
925<tr><td class="num" id="LN846">846</td><td class="line"> <span class='comment'>// try to allocate one</span></td></tr>
926<tr><td class="num" id="LN847">847</td><td class="line"> Area* area;</td></tr>
927<tr><td class="num" id="LN848">848</td><td class="line"> <span class='keyword'>if</span> (_AllocateArea(0, area) != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>)</td></tr>
928<tr><td class="num" id="LN849">849</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
929<tr><td class="num" id="LN850">850</td><td class="line"> </td></tr>
930<tr><td class="num" id="LN851">851</td><td class="line"> _PushFreeArea(area);</td></tr>
931<tr><td class="num" id="LN852">852</td><td class="line"> <span class='keyword'>if</span> (sFreeAreaCount &gt; 2)</td></tr>
932<tr><td class="num" id="LN853">853</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>true</span>;</td></tr>
933<tr><td class="num" id="LN854">854</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
934<tr><td class="num" id="LN855">855</td><td class="line"> <span class='comment'>// free until we only have two free ones</span></td></tr>
935<tr><td class="num" id="LN856">856</td><td class="line"> <span class='keyword'>while</span> (sFreeAreaCount &gt; 2)</td></tr>
936<tr><td class="num" id="LN857">857</td><td class="line"> _FreeArea(_PopFreeArea(), <span class='keyword'>true</span>, 0);</td></tr>
937<tr><td class="num" id="LN858">858</td><td class="line"> </td></tr>
938<tr><td class="num" id="LN859">859</td><td class="line"> <span class='keyword'>if</span> (sFreeAreaCount == 0)</td></tr>
939<tr><td class="num" id="LN860">860</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>true</span>;</td></tr>
940<tr><td class="num" id="LN861">861</td><td class="line"> }</td></tr>
941<tr><td class="num" id="LN862">862</td><td class="line"> }</td></tr>
942<tr><td class="num" id="LN863">863</td><td class="line">}</td></tr>
943<tr><td class="num" id="LN864">864</td><td class="line"> </td></tr>
944<tr><td class="num" id="LN865">865</td><td class="line"> </td></tr>
945<tr><td class="num" id="LN866">866</td><td class="line"><span class='directive'>#if <span class='macro'>SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING<span class='expansion'>(0 != 0 &amp;&amp; SLAB_MEMORY_MANAGER_TRACING != 0 &amp;&amp;<br> SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE &gt; 0)</span></span></span></td></tr>
946<tr><td class="num" id="LN867">867</td><td class="line"> </td></tr>
947<tr><td class="num" id="LN868">868</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>bool</span></td></tr>
948<tr><td class="num" id="LN869">869</td><td class="line">MemoryManager::AnalyzeAllocationCallers(AllocationTrackingCallback&amp; callback)</td></tr>
949<tr><td class="num" id="LN870">870</td><td class="line">{</td></tr>
950<tr><td class="num" id="LN871">871</td><td class="line"> <span class='keyword'>for</span> (AreaTable::Iterator it = sAreaTable.GetIterator();</td></tr>
951<tr><td class="num" id="LN872">872</td><td class="line"> Area* area = it.Next();) {</td></tr>
952<tr><td class="num" id="LN873">873</td><td class="line"> <span class='keyword'>for</span> (int32 i = 0; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
953<tr><td class="num" id="LN874">874</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + i;</td></tr>
954<tr><td class="num" id="LN875">875</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0)</td></tr>
955<tr><td class="num" id="LN876">876</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
956<tr><td class="num" id="LN877">877</td><td class="line"> </td></tr>
957<tr><td class="num" id="LN878">878</td><td class="line"> <span class='keyword'>for</span> (uint32 k = 0; k &lt; metaChunk-&gt;chunkCount; k++) {</td></tr>
958<tr><td class="num" id="LN879">879</td><td class="line"> Chunk* chunk = metaChunk-&gt;chunks + k;</td></tr>
959<tr><td class="num" id="LN880">880</td><td class="line"> </td></tr>
960<tr><td class="num" id="LN881">881</td><td class="line"> <span class='comment'>// skip free chunks</span></td></tr>
961<tr><td class="num" id="LN882">882</td><td class="line"> <span class='keyword'>if</span> (_IsChunkFree(metaChunk, chunk))</td></tr>
962<tr><td class="num" id="LN883">883</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
963<tr><td class="num" id="LN884">884</td><td class="line"> </td></tr>
964<tr><td class="num" id="LN885">885</td><td class="line"> addr_t reference = chunk-&gt;reference;</td></tr>
965<tr><td class="num" id="LN886">886</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0 || reference == 1)</td></tr>
966<tr><td class="num" id="LN887">887</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
967<tr><td class="num" id="LN888">888</td><td class="line"> </td></tr>
968<tr><td class="num" id="LN889">889</td><td class="line"> addr_t chunkAddress = _ChunkAddress(metaChunk, chunk);</td></tr>
969<tr><td class="num" id="LN890">890</td><td class="line"> size_t size = reference - chunkAddress + 1;</td></tr>
970<tr><td class="num" id="LN891">891</td><td class="line"> </td></tr>
971<tr><td class="num" id="LN892">892</td><td class="line"> <span class='keyword'>if</span> (!callback.ProcessTrackingInfo(</td></tr>
972<tr><td class="num" id="LN893">893</td><td class="line"> _TrackingInfoFor((<span class='keyword'>void</span>*)chunkAddress, size),</td></tr>
973<tr><td class="num" id="LN894">894</td><td class="line"> (<span class='keyword'>void</span>*)chunkAddress, size)) {</td></tr>
974<tr><td class="num" id="LN895">895</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>false</span>;</td></tr>
975<tr><td class="num" id="LN896">896</td><td class="line"> }</td></tr>
976<tr><td class="num" id="LN897">897</td><td class="line"> }</td></tr>
977<tr><td class="num" id="LN898">898</td><td class="line"> }</td></tr>
978<tr><td class="num" id="LN899">899</td><td class="line"> }</td></tr>
979<tr><td class="num" id="LN900">900</td><td class="line"> </td></tr>
980<tr><td class="num" id="LN901">901</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>true</span>;</td></tr>
981<tr><td class="num" id="LN902">902</td><td class="line">}</td></tr>
982<tr><td class="num" id="LN903">903</td><td class="line"> </td></tr>
983<tr><td class="num" id="LN904">904</td><td class="line"><span class='directive'>#endif // SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING</span></td></tr>
984<tr><td class="num" id="LN905">905</td><td class="line"> </td></tr>
985<tr><td class="num" id="LN906">906</td><td class="line"> </td></tr>
986<tr><td class="num" id="LN907">907</td><td class="line"><span class='comment'>/*static*/</span> ObjectCache*</td></tr>
987<tr><td class="num" id="LN908">908</td><td class="line">MemoryManager::DebugObjectCacheForAddress(<span class='keyword'>void</span>* address)</td></tr>
988<tr><td class="num" id="LN909">909</td><td class="line">{</td></tr>
989<tr><td class="num" id="LN910">910</td><td class="line"> <span class='comment'>// get the area</span></td></tr>
990<tr><td class="num" id="LN911">911</td><td class="line"> addr_t areaBase = _AreaBaseAddressForAddress((addr_t)address);</td></tr>
991<tr><td class="num" id="LN912">912</td><td class="line"> Area* area = sAreaTable.Lookup(areaBase);</td></tr>
992<tr><td class="num" id="LN913">913</td><td class="line"> </td></tr>
993<tr><td class="num" id="LN914">914</td><td class="line"> <span class='keyword'>if</span> (area == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
994<tr><td class="num" id="LN915">915</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
995<tr><td class="num" id="LN916">916</td><td class="line"> </td></tr>
996<tr><td class="num" id="LN917">917</td><td class="line"> MetaChunk* metaChunk = &amp;area-&gt;metaChunks[</td></tr>
997<tr><td class="num" id="LN918">918</td><td class="line"> ((addr_t)address % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>];</td></tr>
998<tr><td class="num" id="LN919">919</td><td class="line"> </td></tr>
999<tr><td class="num" id="LN920">920</td><td class="line"> <span class='comment'>// get the chunk</span></td></tr>
1000<tr><td class="num" id="LN921">921</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0)</td></tr>
1001<tr><td class="num" id="LN922">922</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1002<tr><td class="num" id="LN923">923</td><td class="line"> <span class='keyword'>if</span> ((addr_t)address &lt; metaChunk-&gt;chunkBase)</td></tr>
1003<tr><td class="num" id="LN924">924</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1004<tr><td class="num" id="LN925">925</td><td class="line"> </td></tr>
1005<tr><td class="num" id="LN926">926</td><td class="line"> uint16 chunkIndex = _ChunkIndexForAddress(metaChunk, (addr_t)address);</td></tr>
1006<tr><td class="num" id="LN927">927</td><td class="line"> Chunk* chunk = &amp;metaChunk-&gt;chunks[chunkIndex];</td></tr>
1007<tr><td class="num" id="LN928">928</td><td class="line"> </td></tr>
1008<tr><td class="num" id="LN929">929</td><td class="line"> addr_t reference = chunk-&gt;reference;</td></tr>
1009<tr><td class="num" id="LN930">930</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0)</td></tr>
1010<tr><td class="num" id="LN931">931</td><td class="line"> <span class='keyword'>return</span> (ObjectCache*)reference;</td></tr>
1011<tr><td class="num" id="LN932">932</td><td class="line"> </td></tr>
1012<tr><td class="num" id="LN933">933</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1013<tr><td class="num" id="LN934">934</td><td class="line">}</td></tr>
1014<tr><td class="num" id="LN935">935</td><td class="line"> </td></tr>
1015<tr><td class="num" id="LN936">936</td><td class="line"> </td></tr>
1016<tr><td class="num" id="LN937">937</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
1017<tr><td class="num" id="LN938">938</td><td class="line">MemoryManager::_AllocateChunks(size_t chunkSize, uint32 chunkCount,</td></tr>
1018<tr><td class="num" id="LN939">939</td><td class="line"> uint32 flags, MetaChunk*&amp; _metaChunk, Chunk*&amp; _chunk)</td></tr>
1019<tr><td class="num" id="LN940">940</td><td class="line">{</td></tr>
1020<tr><td class="num" id="LN941">941</td><td class="line"> MetaChunkList* metaChunkList = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1021<tr><td class="num" id="LN942">942</td><td class="line"> <span class='keyword'>if</span> (chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>) {</td></tr>
1022<tr><td class="num" id="LN943">943</td><td class="line"> metaChunkList = &amp;sPartialMetaChunksSmall;</td></tr>
1023<tr><td class="num" id="LN944">944</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>) {</td></tr>
1024<tr><td class="num" id="LN945">945</td><td class="line"> metaChunkList = &amp;sPartialMetaChunksMedium;</td></tr>
1025<tr><td class="num" id="LN946">946</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (chunkSize != <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>) {</td></tr>
1026<tr><td class="num" id="LN947">947</td><td class="line"> panic(<span class='string_literal'>"MemoryManager::_AllocateChunks(): Unsupported chunk size: %"</span></td></tr>
1027<tr><td class="num" id="LN948">948</td><td class="line"> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span>, chunkSize);</td></tr>
1028<tr><td class="num" id="LN949">949</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_BAD_VALUE<span class='expansion'>((-2147483647 - 1) + 5)</span></span>;</td></tr>
1029<tr><td class="num" id="LN950">950</td><td class="line"> }</td></tr>
1030<tr><td class="num" id="LN951">951</td><td class="line"> </td></tr>
1031<tr><td class="num" id="LN952">952</td><td class="line"> <span class='keyword'>if</span> (_GetChunks(metaChunkList, chunkSize, chunkCount, _metaChunk, _chunk))</td></tr>
1032<tr><td class="num" id="LN953">953</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1033<tr><td class="num" id="LN954">954</td><td class="line"> </td></tr>
1034<tr><td class="num" id="LN955">955</td><td class="line"> <span class='keyword'>if</span> (sFreeAreas != <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1035<tr><td class="num" id="LN956">956</td><td class="line"> _AddArea(_PopFreeArea());</td></tr>
1036<tr><td class="num" id="LN957">957</td><td class="line"> _RequestMaintenance();</td></tr>
1037<tr><td class="num" id="LN958">958</td><td class="line"> </td></tr>
1038<tr><td class="num" id="LN959">959</td><td class="line"> _GetChunks(metaChunkList, chunkSize, chunkCount, _metaChunk, _chunk);</td></tr>
1039<tr><td class="num" id="LN960">960</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1040<tr><td class="num" id="LN961">961</td><td class="line"> }</td></tr>
1041<tr><td class="num" id="LN962">962</td><td class="line"> </td></tr>
1042<tr><td class="num" id="LN963">963</td><td class="line"> <span class='keyword'>if</span> ((flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) != 0) {</td></tr>
1043<tr><td class="num" id="LN964">964</td><td class="line"> <span class='comment'>// We can't create an area with this limitation and we must not wait for</span></td></tr>
1044<tr><td class="num" id="LN965">965</td><td class="line"> <span class='comment'>// someone else doing that.</span></td></tr>
1045<tr><td class="num" id="LN966">966</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_WOULD_BLOCK<span class='expansion'>((-2147483647 - 1) + 11)</span></span>;</td></tr>
1046<tr><td class="num" id="LN967">967</td><td class="line"> }</td></tr>
1047<tr><td class="num" id="LN968">968</td><td class="line"> </td></tr>
1048<tr><td class="num" id="LN969">969</td><td class="line"> <span class='comment'>// We need to allocate a new area. Wait, if someone else is trying to do</span></td></tr>
1049<tr><td class="num" id="LN970">970</td><td class="line"> <span class='comment'>// the same.</span></td></tr>
1050<tr><td class="num" id="LN971">971</td><td class="line"> <span class='keyword'>while</span> (<span class='keyword'>true</span>) {</td></tr>
1051<tr><td class="num" id="LN972">972</td><td class="line"> AllocationEntry* allocationEntry = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1052<tr><td class="num" id="LN973">973</td><td class="line"> <span class='keyword'>if</span> (sAllocationEntryDontWait != <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1053<tr><td class="num" id="LN974">974</td><td class="line"> allocationEntry = sAllocationEntryDontWait;</td></tr>
1054<tr><td class="num" id="LN975">975</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (sAllocationEntryCanWait != <span class='macro'>NULL<span class='expansion'>__null</span></span></td></tr>
1055<tr><td class="num" id="LN976">976</td><td class="line"> &amp;&amp; (flags &amp; CACHE_DONT_WAIT_FOR_MEMORY) == 0) {</td></tr>
1056<tr><td class="num" id="LN977">977</td><td class="line"> allocationEntry = sAllocationEntryCanWait;</td></tr>
1057<tr><td class="num" id="LN978">978</td><td class="line"> } <span class='keyword'>else</span></td></tr>
1058<tr><td class="num" id="LN979">979</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1059<tr><td class="num" id="LN980">980</td><td class="line"> </td></tr>
1060<tr><td class="num" id="LN981">981</td><td class="line"> ConditionVariableEntry entry;</td></tr>
1061<tr><td class="num" id="LN982">982</td><td class="line"> allocationEntry-&gt;condition.Add(&amp;entry);</td></tr>
1062<tr><td class="num" id="LN983">983</td><td class="line"> </td></tr>
1063<tr><td class="num" id="LN984">984</td><td class="line"> mutex_unlock(&amp;sLock);</td></tr>
1064<tr><td class="num" id="LN985">985</td><td class="line"> entry.Wait();</td></tr>
1065<tr><td class="num" id="LN986">986</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1066<tr><td class="num" id="LN987">987</td><td class="line"> </td></tr>
1067<tr><td class="num" id="LN988">988</td><td class="line"> <span class='keyword'>if</span> (_GetChunks(metaChunkList, chunkSize, chunkCount, _metaChunk,</td></tr>
1068<tr><td class="num" id="LN989">989</td><td class="line"> _chunk)) {</td></tr>
1069<tr><td class="num" id="LN990">990</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1070<tr><td class="num" id="LN991">991</td><td class="line"> }</td></tr>
1071<tr><td class="num" id="LN992">992</td><td class="line"> }</td></tr>
1072<tr><td class="num" id="LN993">993</td><td class="line"> </td></tr>
1073<tr><td class="num" id="LN994">994</td><td class="line"> <span class='comment'>// prepare the allocation entry others can wait on</span></td></tr>
1074<tr><td class="num" id="LN995">995</td><td class="line"> AllocationEntry*&amp; allocationEntry</td></tr>
1075<tr><td class="num" id="LN996">996</td><td class="line"> = (flags &amp; CACHE_DONT_WAIT_FOR_MEMORY) != 0</td></tr>
1076<tr><td class="num" id="LN997">997</td><td class="line"> ? sAllocationEntryDontWait : sAllocationEntryCanWait;</td></tr>
1077<tr><td class="num" id="LN998">998</td><td class="line"> </td></tr>
1078<tr><td class="num" id="LN999">999</td><td class="line"> AllocationEntry myResizeEntry;</td></tr>
1079<tr><td class="num" id="LN1000">1000</td><td class="line"> allocationEntry = &amp;myResizeEntry;</td></tr>
1080<tr><td class="num" id="LN1001">1001</td><td class="line"> allocationEntry-&gt;condition.Init(metaChunkList, <span class='string_literal'>"wait for slab area"</span>);</td></tr>
1081<tr><td class="num" id="LN1002">1002</td><td class="line"> allocationEntry-&gt;thread = find_thread(<span class='macro'>NULL<span class='expansion'>__null</span></span>);</td></tr>
1082<tr><td class="num" id="LN1003">1003</td><td class="line"> </td></tr>
1083<tr><td class="num" id="LN1004">1004</td><td class="line"> Area* area;</td></tr>
1084<tr><td class="num" id="LN1005">1005</td><td class="line"> status_t error = _AllocateArea(flags, area);</td></tr>
1085<tr><td class="num" id="LN1006">1006</td><td class="line"> </td></tr>
1086<tr><td class="num" id="LN1007">1007</td><td class="line"> allocationEntry-&gt;condition.NotifyAll();</td></tr>
1087<tr><td class="num" id="LN1008">1008</td><td class="line"> allocationEntry = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1088<tr><td class="num" id="LN1009">1009</td><td class="line"> </td></tr>
1089<tr><td class="num" id="LN1010">1010</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>)</td></tr>
1090<tr><td class="num" id="LN1011">1011</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
1091<tr><td class="num" id="LN1012">1012</td><td class="line"> </td></tr>
1092<tr><td class="num" id="LN1013">1013</td><td class="line"> <span class='comment'>// Try again to get a meta chunk. Something might have been freed in the</span></td></tr>
1093<tr><td class="num" id="LN1014">1014</td><td class="line"> <span class='comment'>// meantime. We can free the area in this case.</span></td></tr>
1094<tr><td class="num" id="LN1015">1015</td><td class="line"> <span class='keyword'>if</span> (_GetChunks(metaChunkList, chunkSize, chunkCount, _metaChunk, _chunk)) {</td></tr>
1095<tr><td class="num" id="LN1016">1016</td><td class="line"> _FreeArea(area, <span class='keyword'>true</span>, flags);</td></tr>
1096<tr><td class="num" id="LN1017">1017</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1097<tr><td class="num" id="LN1018">1018</td><td class="line"> }</td></tr>
1098<tr><td class="num" id="LN1019">1019</td><td class="line"> </td></tr>
1099<tr><td class="num" id="LN1020">1020</td><td class="line"> _AddArea(area);</td></tr>
1100<tr><td class="num" id="LN1021">1021</td><td class="line"> _GetChunks(metaChunkList, chunkSize, chunkCount, _metaChunk, _chunk);</td></tr>
1101<tr><td class="num" id="LN1022">1022</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1102<tr><td class="num" id="LN1023">1023</td><td class="line">}</td></tr>
1103<tr><td class="num" id="LN1024">1024</td><td class="line"> </td></tr>
1104<tr><td class="num" id="LN1025">1025</td><td class="line"> </td></tr>
1105<tr><td class="num" id="LN1026">1026</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>bool</span></td></tr>
1106<tr><td class="num" id="LN1027">1027</td><td class="line">MemoryManager::_GetChunks(MetaChunkList* metaChunkList, size_t chunkSize,</td></tr>
1107<tr><td class="num" id="LN1028">1028</td><td class="line"> uint32 chunkCount, MetaChunk*&amp; _metaChunk, Chunk*&amp; _chunk)</td></tr>
1108<tr><td class="num" id="LN1029">1029</td><td class="line">{</td></tr>
1109<tr><td class="num" id="LN1030">1030</td><td class="line"> <span class='comment'>// the common and less complicated special case</span></td></tr>
1110<tr><td class="num" id="LN1031">1031</td><td class="line"> <span class='keyword'>if</span> (chunkCount == 1)</td></tr>
1111<tr><td class="num" id="LN1032">1032</td><td class="line"> <span class='keyword'>return</span> _GetChunk(metaChunkList, chunkSize, _metaChunk, _chunk);</td></tr>
1112<tr><td class="num" id="LN1033">1033</td><td class="line"> </td></tr>
1113<tr><td class="num" id="LN1034">1034</td><td class="line"> <span class='macro'>ASSERT(metaChunkList != NULL)<span class='expansion'>do { if (!(metaChunkList != __null)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1034, "metaChunkList != __null"); } } while (0)</span></span>;</td></tr>
1114<tr><td class="num" id="LN1035">1035</td><td class="line"> </td></tr>
1115<tr><td class="num" id="LN1036">1036</td><td class="line"> <span class='comment'>// Iterate through the partial meta chunk list and try to find a free</span></td></tr>
1116<tr><td class="num" id="LN1037">1037</td><td class="line"> <span class='comment'>// range that is large enough.</span></td></tr>
1117<tr><td class="num" id="LN1038">1038</td><td class="line"> MetaChunk* metaChunk = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1118<tr><td class="num" id="LN1039">1039</td><td class="line"> <span class='keyword'>for</span> (MetaChunkList::Iterator it = metaChunkList-&gt;GetIterator();</td></tr>
1119<tr><td class="num" id="LN1040">1040</td><td class="line"> (metaChunk = it.Next()) != <span class='macro'>NULL<span class='expansion'>__null</span></span>;) {</td></tr>
1120<tr><td class="num" id="LN1041">1041</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;firstFreeChunk + chunkCount - 1</td></tr>
1121<tr><td class="num" id="LN1042">1042</td><td class="line"> &lt;= metaChunk-&gt;lastFreeChunk) {</td></tr>
1122<tr><td class="num" id="LN1043">1043</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1123<tr><td class="num" id="LN1044">1044</td><td class="line"> }</td></tr>
1124<tr><td class="num" id="LN1045">1045</td><td class="line"> }</td></tr>
1125<tr><td class="num" id="LN1046">1046</td><td class="line"> </td></tr>
1126<tr><td class="num" id="LN1047">1047</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1127<tr><td class="num" id="LN1048">1048</td><td class="line"> <span class='comment'>// try to get a free meta chunk</span></td></tr>
1128<tr><td class="num" id="LN1049">1049</td><td class="line"> <span class='keyword'>if</span> ((<span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span> - <span class='macro'>SLAB_AREA_STRUCT_OFFSET<span class='expansion'>4096</span></span> - kAreaAdminSize)</td></tr>
1129<tr><td class="num" id="LN1050">1050</td><td class="line"> / chunkSize &gt;= chunkCount) {</td></tr>
1130<tr><td class="num" id="LN1051">1051</td><td class="line"> metaChunk = sFreeShortMetaChunks.RemoveHead();</td></tr>
1131<tr><td class="num" id="LN1052">1052</td><td class="line"> }</td></tr>
1132<tr><td class="num" id="LN1053">1053</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1133<tr><td class="num" id="LN1054">1054</td><td class="line"> metaChunk = sFreeCompleteMetaChunks.RemoveHead();</td></tr>
1134<tr><td class="num" id="LN1055">1055</td><td class="line"> </td></tr>
1135<tr><td class="num" id="LN1056">1056</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1136<tr><td class="num" id="LN1057">1057</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>false</span>;</td></tr>
1137<tr><td class="num" id="LN1058">1058</td><td class="line"> </td></tr>
1138<tr><td class="num" id="LN1059">1059</td><td class="line"> metaChunkList-&gt;Add(metaChunk);</td></tr>
1139<tr><td class="num" id="LN1060">1060</td><td class="line"> metaChunk-&gt;GetArea()-&gt;usedMetaChunkCount++;</td></tr>
1140<tr><td class="num" id="LN1061">1061</td><td class="line"> _PrepareMetaChunk(metaChunk, chunkSize);</td></tr>
1141<tr><td class="num" id="LN1062">1062</td><td class="line"> </td></tr>
1142<tr><td class="num" id="LN1063">1063</td><td class="line"> T(AllocateMetaChunk(metaChunk));</td></tr>
1143<tr><td class="num" id="LN1064">1064</td><td class="line"> }</td></tr>
1144<tr><td class="num" id="LN1065">1065</td><td class="line"> </td></tr>
1145<tr><td class="num" id="LN1066">1066</td><td class="line"> <span class='comment'>// pull the chunks out of the free list</span></td></tr>
1146<tr><td class="num" id="LN1067">1067</td><td class="line"> Chunk* firstChunk = metaChunk-&gt;chunks + metaChunk-&gt;firstFreeChunk;</td></tr>
1147<tr><td class="num" id="LN1068">1068</td><td class="line"> Chunk* lastChunk = firstChunk + (chunkCount - 1);</td></tr>
1148<tr><td class="num" id="LN1069">1069</td><td class="line"> Chunk** chunkPointer = &amp;metaChunk-&gt;freeChunks;</td></tr>
1149<tr><td class="num" id="LN1070">1070</td><td class="line"> uint32 remainingChunks = chunkCount;</td></tr>
1150<tr><td class="num" id="LN1071">1071</td><td class="line"> <span class='keyword'>while</span> (remainingChunks &gt; 0) {</td></tr>
1151<tr><td class="num" id="LN1072">1072</td><td class="line"> <span class='macro'>ASSERT_PRINT(chunkPointer, <span class='string_literal'>"remaining: %"</span> B_PRIu32 <span class='string_literal'>"/%"</span> B_PRIu32<span class='expansion'>do { if (!(chunkPointer)) { panic("ASSERT FAILED (%s:%d): %s; "<br> "remaining: %" "l" "u" "/%" "l" "u" ", area: %p, meta chunk: %"<br> "l" "d" "\n", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1075, "chunkPointer", remainingChunks, chunkCount, metaChunk<br>-&gt;GetArea(), metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks<br>); } } while (0)</span></span></td></tr>
1152<tr><td class="num" id="LN1073">1073</td><td class="line"> <span class='string_literal'><span class='macro'>", area: %p, meta chunk: %"</span> B_PRIdSSIZE <span class='string_literal'>"\n"</span>, remainingChunks,<span class='expansion'>do { if (!(chunkPointer)) { panic("ASSERT FAILED (%s:%d): %s; "<br> "remaining: %" "l" "u" "/%" "l" "u" ", area: %p, meta chunk: %"<br> "l" "d" "\n", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1075, "chunkPointer", remainingChunks, chunkCount, metaChunk<br>-&gt;GetArea(), metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks<br>); } } while (0)</span></span></td></tr>
1153<tr><td class="num" id="LN1074">1074</td><td class="line"> <span class='macro'>chunkCount, metaChunk-&gt;GetArea(),<span class='expansion'>do { if (!(chunkPointer)) { panic("ASSERT FAILED (%s:%d): %s; "<br> "remaining: %" "l" "u" "/%" "l" "u" ", area: %p, meta chunk: %"<br> "l" "d" "\n", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1075, "chunkPointer", remainingChunks, chunkCount, metaChunk<br>-&gt;GetArea(), metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks<br>); } } while (0)</span></span></td></tr>
1154<tr><td class="num" id="LN1075">1075</td><td class="line"> <span class='macro'>metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks)<span class='expansion'>do { if (!(chunkPointer)) { panic("ASSERT FAILED (%s:%d): %s; "<br> "remaining: %" "l" "u" "/%" "l" "u" ", area: %p, meta chunk: %"<br> "l" "d" "\n", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1075, "chunkPointer", remainingChunks, chunkCount, metaChunk<br>-&gt;GetArea(), metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks<br>); } } while (0)</span></span>;</td></tr>
1155<tr><td class="num" id="LN1076">1076</td><td class="line"> Chunk* chunk = *chunkPointer;</td></tr>
1156<tr><td class="num" id="LN1077">1077</td><td class="line"> <span class='keyword'>if</span> (chunk &gt;= firstChunk &amp;&amp; chunk &lt;= lastChunk) {</td></tr>
1157<tr><td class="num" id="LN1078">1078</td><td class="line"> *chunkPointer = chunk-&gt;next;</td></tr>
1158<tr><td class="num" id="LN1079">1079</td><td class="line"> chunk-&gt;reference = 1;</td></tr>
1159<tr><td class="num" id="LN1080">1080</td><td class="line"> remainingChunks--;</td></tr>
1160<tr><td class="num" id="LN1081">1081</td><td class="line"> } <span class='keyword'>else</span></td></tr>
1161<tr><td class="num" id="LN1082">1082</td><td class="line"> chunkPointer = &amp;chunk-&gt;next;</td></tr>
1162<tr><td class="num" id="LN1083">1083</td><td class="line"> }</td></tr>
1163<tr><td class="num" id="LN1084">1084</td><td class="line"> </td></tr>
1164<tr><td class="num" id="LN1085">1085</td><td class="line"> <span class='comment'>// allocate the chunks</span></td></tr>
1165<tr><td class="num" id="LN1086">1086</td><td class="line"> metaChunk-&gt;usedChunkCount += chunkCount;</td></tr>
1166<tr><td class="num" id="LN1087">1087</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;usedChunkCount == metaChunk-&gt;chunkCount) {</td></tr>
1167<tr><td class="num" id="LN1088">1088</td><td class="line"> <span class='comment'>// meta chunk is full now -- remove it from its list</span></td></tr>
1168<tr><td class="num" id="LN1089">1089</td><td class="line"> <span class='keyword'>if</span> (metaChunkList != <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1169<tr><td class="num" id="LN1090">1090</td><td class="line"> metaChunkList-&gt;Remove(metaChunk);</td></tr>
1170<tr><td class="num" id="LN1091">1091</td><td class="line"> }</td></tr>
1171<tr><td class="num" id="LN1092">1092</td><td class="line"> </td></tr>
1172<tr><td class="num" id="LN1093">1093</td><td class="line"> <span class='comment'>// update the free range</span></td></tr>
1173<tr><td class="num" id="LN1094">1094</td><td class="line"> metaChunk-&gt;firstFreeChunk += chunkCount;</td></tr>
1174<tr><td class="num" id="LN1095">1095</td><td class="line"> </td></tr>
1175<tr><td class="num" id="LN1096">1096</td><td class="line"> PARANOID_CHECKS_ONLY(_CheckMetaChunk(metaChunk));</td></tr>
1176<tr><td class="num" id="LN1097">1097</td><td class="line"> </td></tr>
1177<tr><td class="num" id="LN1098">1098</td><td class="line"> _chunk = firstChunk;</td></tr>
1178<tr><td class="num" id="LN1099">1099</td><td class="line"> _metaChunk = metaChunk;</td></tr>
1179<tr><td class="num" id="LN1100">1100</td><td class="line"> </td></tr>
1180<tr><td class="num" id="LN1101">1101</td><td class="line"> T(AllocateChunks(chunkSize, chunkCount, metaChunk, firstChunk));</td></tr>
1181<tr><td class="num" id="LN1102">1102</td><td class="line"> </td></tr>
1182<tr><td class="num" id="LN1103">1103</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>true</span>;</td></tr>
1183<tr><td class="num" id="LN1104">1104</td><td class="line">}</td></tr>
1184<tr><td class="num" id="LN1105">1105</td><td class="line"> </td></tr>
1185<tr><td class="num" id="LN1106">1106</td><td class="line"> </td></tr>
1186<tr><td class="num" id="LN1107">1107</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>bool</span></td></tr>
1187<tr><td class="num" id="LN1108">1108</td><td class="line">MemoryManager::_GetChunk(MetaChunkList* metaChunkList, size_t chunkSize,</td></tr>
1188<tr><td class="num" id="LN1109">1109</td><td class="line"> MetaChunk*&amp; _metaChunk, Chunk*&amp; _chunk)</td></tr>
1189<tr><td class="num" id="LN1110">1110</td><td class="line">{</td></tr>
1190<tr><td class="num" id="LN1111">1111</td><td class="line"> MetaChunk* metaChunk = <span class="mrange">metaChunkList != <span class='macro'>NULL<span class='expansion'>__null</span></span></td></tr></span>
1191<tr><td class="num"></td><td class="line"><div id="Path1" class="msg msgEvent" style="margin-left:32ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexEvent">1</div></td><td>Assuming pointer value is null</td><td><div class="PathNav"><a href="#Path2" title="Next event (2)">&#x2192;</a></div></td></tr></table></div></td></tr>
1192<tr><td class="num"></td><td class="line"><div id="Path2" class="msg msgControl" style="margin-left:32ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexControl">2</div></td><td><div class="PathNav"><a href="#Path1" title="Previous event (1)">&#x2190;</a></div></td></td><td>'?' condition is false</td><td><div class="PathNav"><a href="#Path3" title="Next event (3)">&#x2192;</a></div></td></tr></table></div></td></tr>
1193<tr><td class="num" id="LN1112">1112</td><td class="line"> ? metaChunkList-&gt;Head() : <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1194<tr><td class="num" id="LN1113">1113</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1195<tr><td class="num"></td><td class="line"><div id="Path3" class="msg msgControl" style="margin-left:9ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexControl">3</div></td><td><div class="PathNav"><a href="#Path2" title="Previous event (2)">&#x2190;</a></div></td></td><td>Taking true branch</td><td><div class="PathNav"><a href="#Path4" title="Next event (4)">&#x2192;</a></div></td></tr></table></div></td></tr>
1196<tr><td class="num" id="LN1114">1114</td><td class="line"> <span class='comment'>// no partial meta chunk -- maybe there's a free one</span></td></tr>
1197<tr><td class="num" id="LN1115">1115</td><td class="line"> <span class='keyword'>if</span> (chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>) {</td></tr>
1198<tr><td class="num"></td><td class="line"><div id="Path4" class="msg msgControl" style="margin-left:17ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexControl">4</div></td><td><div class="PathNav"><a href="#Path3" title="Previous event (3)">&#x2190;</a></div></td></td><td>Taking false branch</td><td><div class="PathNav"><a href="#Path5" title="Next event (5)">&#x2192;</a></div></td></tr></table></div></td></tr>
1199<tr><td class="num" id="LN1116">1116</td><td class="line"> metaChunk = sFreeCompleteMetaChunks.RemoveHead();</td></tr>
1200<tr><td class="num" id="LN1117">1117</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1201<tr><td class="num" id="LN1118">1118</td><td class="line"> metaChunk = sFreeShortMetaChunks.RemoveHead();</td></tr>
1202<tr><td class="num" id="LN1119">1119</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1203<tr><td class="num"></td><td class="line"><div id="Path5" class="msg msgControl" style="margin-left:25ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexControl">5</div></td><td><div class="PathNav"><a href="#Path4" title="Previous event (4)">&#x2190;</a></div></td></td><td>Taking false branch</td><td><div class="PathNav"><a href="#Path6" title="Next event (6)">&#x2192;</a></div></td></tr></table></div></td></tr>
1204<tr><td class="num" id="LN1120">1120</td><td class="line"> metaChunk = sFreeCompleteMetaChunks.RemoveHead();</td></tr>
1205<tr><td class="num" id="LN1121">1121</td><td class="line"> <span class='keyword'>if</span> (metaChunk != <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1206<tr><td class="num"></td><td class="line"><div id="Path6" class="msg msgControl" style="margin-left:25ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexControl">6</div></td><td><div class="PathNav"><a href="#Path5" title="Previous event (5)">&#x2190;</a></div></td></td><td>Taking true branch</td><td><div class="PathNav"><a href="#EndPath" title="Next event (7)">&#x2192;</a></div></td></tr></table></div></td></tr>
1207<tr><td class="num" id="LN1122">1122</td><td class="line"> <span class="mrange">metaChunkList</span>-&gt;Add(metaChunk);</td></tr>
1208<tr><td class="num"></td><td class="line"><div id="EndPath" class="msg msgEvent" style="margin-left:33ex"><table class="msgT"><tr><td valign="top"><div class="PathIndex PathIndexEvent">7</div></td><td><div class="PathNav"><a href="#Path6" title="Previous event (6)">&#x2190;</a></div></td></td><td>Called C++ object pointer is null</td></tr></table></div></td></tr>
1209<tr><td class="num" id="LN1123">1123</td><td class="line"> }</td></tr>
1210<tr><td class="num" id="LN1124">1124</td><td class="line"> </td></tr>
1211<tr><td class="num" id="LN1125">1125</td><td class="line"> <span class='keyword'>if</span> (metaChunk == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1212<tr><td class="num" id="LN1126">1126</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>false</span>;</td></tr>
1213<tr><td class="num" id="LN1127">1127</td><td class="line"> </td></tr>
1214<tr><td class="num" id="LN1128">1128</td><td class="line"> metaChunk-&gt;GetArea()-&gt;usedMetaChunkCount++;</td></tr>
1215<tr><td class="num" id="LN1129">1129</td><td class="line"> _PrepareMetaChunk(metaChunk, chunkSize);</td></tr>
1216<tr><td class="num" id="LN1130">1130</td><td class="line"> </td></tr>
1217<tr><td class="num" id="LN1131">1131</td><td class="line"> T(AllocateMetaChunk(metaChunk));</td></tr>
1218<tr><td class="num" id="LN1132">1132</td><td class="line"> }</td></tr>
1219<tr><td class="num" id="LN1133">1133</td><td class="line"> </td></tr>
1220<tr><td class="num" id="LN1134">1134</td><td class="line"> <span class='comment'>// allocate the chunk</span></td></tr>
1221<tr><td class="num" id="LN1135">1135</td><td class="line"> <span class='keyword'>if</span> (++metaChunk-&gt;usedChunkCount == metaChunk-&gt;chunkCount) {</td></tr>
1222<tr><td class="num" id="LN1136">1136</td><td class="line"> <span class='comment'>// meta chunk is full now -- remove it from its list</span></td></tr>
1223<tr><td class="num" id="LN1137">1137</td><td class="line"> <span class='keyword'>if</span> (metaChunkList != <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1224<tr><td class="num" id="LN1138">1138</td><td class="line"> metaChunkList-&gt;Remove(metaChunk);</td></tr>
1225<tr><td class="num" id="LN1139">1139</td><td class="line"> }</td></tr>
1226<tr><td class="num" id="LN1140">1140</td><td class="line"> </td></tr>
1227<tr><td class="num" id="LN1141">1141</td><td class="line"> _chunk = _pop(metaChunk-&gt;freeChunks);</td></tr>
1228<tr><td class="num" id="LN1142">1142</td><td class="line"> _metaChunk = metaChunk;</td></tr>
1229<tr><td class="num" id="LN1143">1143</td><td class="line"> </td></tr>
1230<tr><td class="num" id="LN1144">1144</td><td class="line"> _chunk-&gt;reference = 1;</td></tr>
1231<tr><td class="num" id="LN1145">1145</td><td class="line"> </td></tr>
1232<tr><td class="num" id="LN1146">1146</td><td class="line"> <span class='comment'>// update the free range</span></td></tr>
1233<tr><td class="num" id="LN1147">1147</td><td class="line"> uint32 chunkIndex = _chunk - metaChunk-&gt;chunks;</td></tr>
1234<tr><td class="num" id="LN1148">1148</td><td class="line"> <span class='keyword'>if</span> (chunkIndex &gt;= metaChunk-&gt;firstFreeChunk</td></tr>
1235<tr><td class="num" id="LN1149">1149</td><td class="line"> &amp;&amp; chunkIndex &lt;= metaChunk-&gt;lastFreeChunk) {</td></tr>
1236<tr><td class="num" id="LN1150">1150</td><td class="line"> <span class='keyword'>if</span> (chunkIndex - metaChunk-&gt;firstFreeChunk</td></tr>
1237<tr><td class="num" id="LN1151">1151</td><td class="line"> &lt;= metaChunk-&gt;lastFreeChunk - chunkIndex) {</td></tr>
1238<tr><td class="num" id="LN1152">1152</td><td class="line"> metaChunk-&gt;firstFreeChunk = chunkIndex + 1;</td></tr>
1239<tr><td class="num" id="LN1153">1153</td><td class="line"> } <span class='keyword'>else</span></td></tr>
1240<tr><td class="num" id="LN1154">1154</td><td class="line"> metaChunk-&gt;lastFreeChunk = chunkIndex - 1;</td></tr>
1241<tr><td class="num" id="LN1155">1155</td><td class="line"> }</td></tr>
1242<tr><td class="num" id="LN1156">1156</td><td class="line"> </td></tr>
1243<tr><td class="num" id="LN1157">1157</td><td class="line"> PARANOID_CHECKS_ONLY(_CheckMetaChunk(metaChunk));</td></tr>
1244<tr><td class="num" id="LN1158">1158</td><td class="line"> </td></tr>
1245<tr><td class="num" id="LN1159">1159</td><td class="line"> T(AllocateChunk(chunkSize, metaChunk, _chunk));</td></tr>
1246<tr><td class="num" id="LN1160">1160</td><td class="line"> </td></tr>
1247<tr><td class="num" id="LN1161">1161</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>true</span>;</td></tr>
1248<tr><td class="num" id="LN1162">1162</td><td class="line">}</td></tr>
1249<tr><td class="num" id="LN1163">1163</td><td class="line"> </td></tr>
1250<tr><td class="num" id="LN1164">1164</td><td class="line"> </td></tr>
1251<tr><td class="num" id="LN1165">1165</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1252<tr><td class="num" id="LN1166">1166</td><td class="line">MemoryManager::_FreeChunk(Area* area, MetaChunk* metaChunk, Chunk* chunk,</td></tr>
1253<tr><td class="num" id="LN1167">1167</td><td class="line"> addr_t chunkAddress, <span class='keyword'>bool</span> alreadyUnmapped, uint32 flags)</td></tr>
1254<tr><td class="num" id="LN1168">1168</td><td class="line">{</td></tr>
1255<tr><td class="num" id="LN1169">1169</td><td class="line"> <span class='comment'>// unmap the chunk</span></td></tr>
1256<tr><td class="num" id="LN1170">1170</td><td class="line"> <span class='keyword'>if</span> (!alreadyUnmapped) {</td></tr>
1257<tr><td class="num" id="LN1171">1171</td><td class="line"> mutex_unlock(&amp;sLock);</td></tr>
1258<tr><td class="num" id="LN1172">1172</td><td class="line"> _UnmapChunk(area-&gt;vmArea, chunkAddress, metaChunk-&gt;chunkSize, flags);</td></tr>
1259<tr><td class="num" id="LN1173">1173</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1260<tr><td class="num" id="LN1174">1174</td><td class="line"> }</td></tr>
1261<tr><td class="num" id="LN1175">1175</td><td class="line"> </td></tr>
1262<tr><td class="num" id="LN1176">1176</td><td class="line"> T(FreeChunk(metaChunk, chunk));</td></tr>
1263<tr><td class="num" id="LN1177">1177</td><td class="line"> </td></tr>
1264<tr><td class="num" id="LN1178">1178</td><td class="line"> _push(metaChunk-&gt;freeChunks, chunk);</td></tr>
1265<tr><td class="num" id="LN1179">1179</td><td class="line"> </td></tr>
1266<tr><td class="num" id="LN1180">1180</td><td class="line"> uint32 chunkIndex = chunk - metaChunk-&gt;chunks;</td></tr>
1267<tr><td class="num" id="LN1181">1181</td><td class="line"> </td></tr>
1268<tr><td class="num" id="LN1182">1182</td><td class="line"> <span class='comment'>// free the meta chunk, if it is unused now</span></td></tr>
1269<tr><td class="num" id="LN1183">1183</td><td class="line"> PARANOID_CHECKS_ONLY(<span class='keyword'>bool</span> areaDeleted = <span class='keyword'>false</span>;)</td></tr>
1270<tr><td class="num" id="LN1184">1184</td><td class="line"> <span class='macro'>ASSERT(metaChunk-&gt;usedChunkCount &gt; 0)<span class='expansion'>do { if (!(metaChunk-&gt;usedChunkCount &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1184, "metaChunk-&gt;usedChunkCount &gt; 0"); } } while (0)</span></span>;</td></tr>
1271<tr><td class="num" id="LN1185">1185</td><td class="line"> <span class='keyword'>if</span> (--metaChunk-&gt;usedChunkCount == 0) {</td></tr>
1272<tr><td class="num" id="LN1186">1186</td><td class="line"> T(FreeMetaChunk(metaChunk));</td></tr>
1273<tr><td class="num" id="LN1187">1187</td><td class="line"> </td></tr>
1274<tr><td class="num" id="LN1188">1188</td><td class="line"> <span class='comment'>// remove from partial meta chunk list</span></td></tr>
1275<tr><td class="num" id="LN1189">1189</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>)</td></tr>
1276<tr><td class="num" id="LN1190">1190</td><td class="line"> sPartialMetaChunksSmall.Remove(metaChunk);</td></tr>
1277<tr><td class="num" id="LN1191">1191</td><td class="line"> <span class='keyword'>else</span> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>)</td></tr>
1278<tr><td class="num" id="LN1192">1192</td><td class="line"> sPartialMetaChunksMedium.Remove(metaChunk);</td></tr>
1279<tr><td class="num" id="LN1193">1193</td><td class="line"> </td></tr>
1280<tr><td class="num" id="LN1194">1194</td><td class="line"> <span class='comment'>// mark empty</span></td></tr>
1281<tr><td class="num" id="LN1195">1195</td><td class="line"> metaChunk-&gt;chunkSize = 0;</td></tr>
1282<tr><td class="num" id="LN1196">1196</td><td class="line"> </td></tr>
1283<tr><td class="num" id="LN1197">1197</td><td class="line"> <span class='comment'>// add to free list</span></td></tr>
1284<tr><td class="num" id="LN1198">1198</td><td class="line"> <span class='keyword'>if</span> (metaChunk == area-&gt;metaChunks)</td></tr>
1285<tr><td class="num" id="LN1199">1199</td><td class="line"> sFreeShortMetaChunks.Add(metaChunk, <span class='keyword'>false</span>);</td></tr>
1286<tr><td class="num" id="LN1200">1200</td><td class="line"> <span class='keyword'>else</span></td></tr>
1287<tr><td class="num" id="LN1201">1201</td><td class="line"> sFreeCompleteMetaChunks.Add(metaChunk, <span class='keyword'>false</span>);</td></tr>
1288<tr><td class="num" id="LN1202">1202</td><td class="line"> </td></tr>
1289<tr><td class="num" id="LN1203">1203</td><td class="line"> <span class='comment'>// free the area, if it is unused now</span></td></tr>
1290<tr><td class="num" id="LN1204">1204</td><td class="line"> <span class='macro'>ASSERT(area-&gt;usedMetaChunkCount &gt; 0)<span class='expansion'>do { if (!(area-&gt;usedMetaChunkCount &gt; 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1204, "area-&gt;usedMetaChunkCount &gt; 0"); } } while (0)</span></span>;</td></tr>
1291<tr><td class="num" id="LN1205">1205</td><td class="line"> <span class='keyword'>if</span> (--area-&gt;usedMetaChunkCount == 0) {</td></tr>
1292<tr><td class="num" id="LN1206">1206</td><td class="line"> _FreeArea(area, <span class='keyword'>false</span>, flags);</td></tr>
1293<tr><td class="num" id="LN1207">1207</td><td class="line"> PARANOID_CHECKS_ONLY(areaDeleted = <span class='keyword'>true</span>;)</td></tr>
1294<tr><td class="num" id="LN1208">1208</td><td class="line"> }</td></tr>
1295<tr><td class="num" id="LN1209">1209</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (metaChunk-&gt;usedChunkCount == metaChunk-&gt;chunkCount - 1) {</td></tr>
1296<tr><td class="num" id="LN1210">1210</td><td class="line"> <span class='comment'>// the meta chunk was full before -- add it back to its partial chunk</span></td></tr>
1297<tr><td class="num" id="LN1211">1211</td><td class="line"> <span class='comment'>// list</span></td></tr>
1298<tr><td class="num" id="LN1212">1212</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>)</td></tr>
1299<tr><td class="num" id="LN1213">1213</td><td class="line"> sPartialMetaChunksSmall.Add(metaChunk, <span class='keyword'>false</span>);</td></tr>
1300<tr><td class="num" id="LN1214">1214</td><td class="line"> <span class='keyword'>else</span> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>)</td></tr>
1301<tr><td class="num" id="LN1215">1215</td><td class="line"> sPartialMetaChunksMedium.Add(metaChunk, <span class='keyword'>false</span>);</td></tr>
1302<tr><td class="num" id="LN1216">1216</td><td class="line"> </td></tr>
1303<tr><td class="num" id="LN1217">1217</td><td class="line"> metaChunk-&gt;firstFreeChunk = chunkIndex;</td></tr>
1304<tr><td class="num" id="LN1218">1218</td><td class="line"> metaChunk-&gt;lastFreeChunk = chunkIndex;</td></tr>
1305<tr><td class="num" id="LN1219">1219</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1306<tr><td class="num" id="LN1220">1220</td><td class="line"> <span class='comment'>// extend the free range, if the chunk adjoins</span></td></tr>
1307<tr><td class="num" id="LN1221">1221</td><td class="line"> <span class='keyword'>if</span> (chunkIndex + 1 == metaChunk-&gt;firstFreeChunk) {</td></tr>
1308<tr><td class="num" id="LN1222">1222</td><td class="line"> uint32 firstFree = chunkIndex;</td></tr>
1309<tr><td class="num" id="LN1223">1223</td><td class="line"> <span class='keyword'>for</span> (; firstFree &gt; 0; firstFree--) {</td></tr>
1310<tr><td class="num" id="LN1224">1224</td><td class="line"> Chunk* previousChunk = &amp;metaChunk-&gt;chunks[firstFree - 1];</td></tr>
1311<tr><td class="num" id="LN1225">1225</td><td class="line"> <span class='keyword'>if</span> (!_IsChunkFree(metaChunk, previousChunk))</td></tr>
1312<tr><td class="num" id="LN1226">1226</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1313<tr><td class="num" id="LN1227">1227</td><td class="line"> }</td></tr>
1314<tr><td class="num" id="LN1228">1228</td><td class="line"> metaChunk-&gt;firstFreeChunk = firstFree;</td></tr>
1315<tr><td class="num" id="LN1229">1229</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (chunkIndex == (uint32)metaChunk-&gt;lastFreeChunk + 1) {</td></tr>
1316<tr><td class="num" id="LN1230">1230</td><td class="line"> uint32 lastFree = chunkIndex;</td></tr>
1317<tr><td class="num" id="LN1231">1231</td><td class="line"> <span class='keyword'>for</span> (; lastFree + 1 &lt; metaChunk-&gt;chunkCount; lastFree++) {</td></tr>
1318<tr><td class="num" id="LN1232">1232</td><td class="line"> Chunk* nextChunk = &amp;metaChunk-&gt;chunks[lastFree + 1];</td></tr>
1319<tr><td class="num" id="LN1233">1233</td><td class="line"> <span class='keyword'>if</span> (!_IsChunkFree(metaChunk, nextChunk))</td></tr>
1320<tr><td class="num" id="LN1234">1234</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1321<tr><td class="num" id="LN1235">1235</td><td class="line"> }</td></tr>
1322<tr><td class="num" id="LN1236">1236</td><td class="line"> metaChunk-&gt;lastFreeChunk = lastFree;</td></tr>
1323<tr><td class="num" id="LN1237">1237</td><td class="line"> }</td></tr>
1324<tr><td class="num" id="LN1238">1238</td><td class="line"> }</td></tr>
1325<tr><td class="num" id="LN1239">1239</td><td class="line"> </td></tr>
1326<tr><td class="num" id="LN1240">1240</td><td class="line"> PARANOID_CHECKS_ONLY(</td></tr>
1327<tr><td class="num" id="LN1241">1241</td><td class="line"> <span class='keyword'>if</span> (!areaDeleted)</td></tr>
1328<tr><td class="num" id="LN1242">1242</td><td class="line"> _CheckMetaChunk(metaChunk);</td></tr>
1329<tr><td class="num" id="LN1243">1243</td><td class="line"> )</td></tr>
1330<tr><td class="num" id="LN1244">1244</td><td class="line">}</td></tr>
1331<tr><td class="num" id="LN1245">1245</td><td class="line"> </td></tr>
1332<tr><td class="num" id="LN1246">1246</td><td class="line"> </td></tr>
1333<tr><td class="num" id="LN1247">1247</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1334<tr><td class="num" id="LN1248">1248</td><td class="line">MemoryManager::_PrepareMetaChunk(MetaChunk* metaChunk, size_t chunkSize)</td></tr>
1335<tr><td class="num" id="LN1249">1249</td><td class="line">{</td></tr>
1336<tr><td class="num" id="LN1250">1250</td><td class="line"> Area* area = metaChunk-&gt;GetArea();</td></tr>
1337<tr><td class="num" id="LN1251">1251</td><td class="line"> </td></tr>
1338<tr><td class="num" id="LN1252">1252</td><td class="line"> <span class='keyword'>if</span> (metaChunk == area-&gt;metaChunks) {</td></tr>
1339<tr><td class="num" id="LN1253">1253</td><td class="line"> <span class='comment'>// the first chunk is shorter</span></td></tr>
1340<tr><td class="num" id="LN1254">1254</td><td class="line"> size_t unusableSize = <span class='macro'>ROUNDUP(SLAB_AREA_STRUCT_OFFSET + kAreaAdminSize,<span class='expansion'>((((4096 + kAreaAdminSize) + (chunkSize) - 1) / (chunkSize)) *<br> (chunkSize))</span></span></td></tr>
1341<tr><td class="num" id="LN1255">1255</td><td class="line"> <span class='macro'>chunkSize)<span class='expansion'>((((4096 + kAreaAdminSize) + (chunkSize) - 1) / (chunkSize)) *<br> (chunkSize))</span></span>;</td></tr>
1342<tr><td class="num" id="LN1256">1256</td><td class="line"> metaChunk-&gt;chunkBase = area-&gt;BaseAddress() + unusableSize;</td></tr>
1343<tr><td class="num" id="LN1257">1257</td><td class="line"> metaChunk-&gt;totalSize = <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span> - unusableSize;</td></tr>
1344<tr><td class="num" id="LN1258">1258</td><td class="line"> }</td></tr>
1345<tr><td class="num" id="LN1259">1259</td><td class="line"> </td></tr>
1346<tr><td class="num" id="LN1260">1260</td><td class="line"> metaChunk-&gt;chunkSize = chunkSize;</td></tr>
1347<tr><td class="num" id="LN1261">1261</td><td class="line"> metaChunk-&gt;chunkCount = metaChunk-&gt;totalSize / chunkSize;</td></tr>
1348<tr><td class="num" id="LN1262">1262</td><td class="line"> metaChunk-&gt;usedChunkCount = 0;</td></tr>
1349<tr><td class="num" id="LN1263">1263</td><td class="line"> </td></tr>
1350<tr><td class="num" id="LN1264">1264</td><td class="line"> metaChunk-&gt;freeChunks = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1351<tr><td class="num" id="LN1265">1265</td><td class="line"> <span class='keyword'>for</span> (int32 i = metaChunk-&gt;chunkCount - 1; i &gt;= 0; i--)</td></tr>
1352<tr><td class="num" id="LN1266">1266</td><td class="line"> _push(metaChunk-&gt;freeChunks, metaChunk-&gt;chunks + i);</td></tr>
1353<tr><td class="num" id="LN1267">1267</td><td class="line"> </td></tr>
1354<tr><td class="num" id="LN1268">1268</td><td class="line"> metaChunk-&gt;firstFreeChunk = 0;</td></tr>
1355<tr><td class="num" id="LN1269">1269</td><td class="line"> metaChunk-&gt;lastFreeChunk = metaChunk-&gt;chunkCount - 1;</td></tr>
1356<tr><td class="num" id="LN1270">1270</td><td class="line"> </td></tr>
1357<tr><td class="num" id="LN1271">1271</td><td class="line"> PARANOID_CHECKS_ONLY(_CheckMetaChunk(metaChunk));</td></tr>
1358<tr><td class="num" id="LN1272">1272</td><td class="line">}</td></tr>
1359<tr><td class="num" id="LN1273">1273</td><td class="line"> </td></tr>
1360<tr><td class="num" id="LN1274">1274</td><td class="line"> </td></tr>
1361<tr><td class="num" id="LN1275">1275</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1362<tr><td class="num" id="LN1276">1276</td><td class="line">MemoryManager::_AddArea(Area* area)</td></tr>
1363<tr><td class="num" id="LN1277">1277</td><td class="line">{</td></tr>
1364<tr><td class="num" id="LN1278">1278</td><td class="line"> T(AddArea(area));</td></tr>
1365<tr><td class="num" id="LN1279">1279</td><td class="line"> </td></tr>
1366<tr><td class="num" id="LN1280">1280</td><td class="line"> <span class='comment'>// add the area to the hash table</span></td></tr>
1367<tr><td class="num" id="LN1281">1281</td><td class="line"> WriteLocker writeLocker(sAreaTableLock);</td></tr>
1368<tr><td class="num" id="LN1282">1282</td><td class="line"> sAreaTable.InsertUnchecked(area);</td></tr>
1369<tr><td class="num" id="LN1283">1283</td><td class="line"> writeLocker.Unlock();</td></tr>
1370<tr><td class="num" id="LN1284">1284</td><td class="line"> </td></tr>
1371<tr><td class="num" id="LN1285">1285</td><td class="line"> <span class='comment'>// add the area's meta chunks to the free lists</span></td></tr>
1372<tr><td class="num" id="LN1286">1286</td><td class="line"> sFreeShortMetaChunks.Add(&amp;area-&gt;metaChunks[0]);</td></tr>
1373<tr><td class="num" id="LN1287">1287</td><td class="line"> <span class='keyword'>for</span> (int32 i = 1; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++)</td></tr>
1374<tr><td class="num" id="LN1288">1288</td><td class="line"> sFreeCompleteMetaChunks.Add(&amp;area-&gt;metaChunks[i]);</td></tr>
1375<tr><td class="num" id="LN1289">1289</td><td class="line">}</td></tr>
1376<tr><td class="num" id="LN1290">1290</td><td class="line"> </td></tr>
1377<tr><td class="num" id="LN1291">1291</td><td class="line"> </td></tr>
1378<tr><td class="num" id="LN1292">1292</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
1379<tr><td class="num" id="LN1293">1293</td><td class="line">MemoryManager::_AllocateArea(uint32 flags, Area*&amp; _area)</td></tr>
1380<tr><td class="num" id="LN1294">1294</td><td class="line">{</td></tr>
1381<tr><td class="num" id="LN1295">1295</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_AllocateArea(%#"</span> B_PRIx32 <span class='string_literal'>")\n"</span>, flags)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1382<tr><td class="num" id="LN1296">1296</td><td class="line"> </td></tr>
1383<tr><td class="num" id="LN1297">1297</td><td class="line"> <span class='macro'>ASSERT((flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) == 0)<span class='expansion'>do { if (!((flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) == 0)) {<br> panic("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1297, "(flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) == 0"); }<br> } while (0)</span></span>;</td></tr>
1384<tr><td class="num" id="LN1298">1298</td><td class="line"> </td></tr>
1385<tr><td class="num" id="LN1299">1299</td><td class="line"> mutex_unlock(&amp;sLock);</td></tr>
1386<tr><td class="num" id="LN1300">1300</td><td class="line"> </td></tr>
1387<tr><td class="num" id="LN1301">1301</td><td class="line"> size_t pagesNeededToMap = 0;</td></tr>
1388<tr><td class="num" id="LN1302">1302</td><td class="line"> <span class='keyword'>void</span>* areaBase;</td></tr>
1389<tr><td class="num" id="LN1303">1303</td><td class="line"> Area* area;</td></tr>
1390<tr><td class="num" id="LN1304">1304</td><td class="line"> VMArea* vmArea = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1391<tr><td class="num" id="LN1305">1305</td><td class="line"> </td></tr>
1392<tr><td class="num" id="LN1306">1306</td><td class="line"> <span class='keyword'>if</span> (sKernelArgs == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1393<tr><td class="num" id="LN1307">1307</td><td class="line"> <span class='comment'>// create an area</span></td></tr>
1394<tr><td class="num" id="LN1308">1308</td><td class="line"> uint32 areaCreationFlags = (flags &amp; CACHE_PRIORITY_VIP) != 0</td></tr>
1395<tr><td class="num" id="LN1309">1309</td><td class="line"> ? <span class='macro'>CREATE_AREA_PRIORITY_VIP<span class='expansion'>0x08</span></span> : 0;</td></tr>
1396<tr><td class="num" id="LN1310">1310</td><td class="line"> area_id areaID = vm_create_null_area(<span class='macro'>B_SYSTEM_TEAM<span class='expansion'>1</span></span>, kSlabAreaName,</td></tr>
1397<tr><td class="num" id="LN1311">1311</td><td class="line"> &amp;areaBase, <span class='macro'>B_ANY_KERNEL_BLOCK_ADDRESS<span class='expansion'>(4 + 1)</span></span>, <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>,</td></tr>
1398<tr><td class="num" id="LN1312">1312</td><td class="line"> areaCreationFlags);</td></tr>
1399<tr><td class="num" id="LN1313">1313</td><td class="line"> <span class='keyword'>if</span> (areaID &lt; 0) {</td></tr>
1400<tr><td class="num" id="LN1314">1314</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1401<tr><td class="num" id="LN1315">1315</td><td class="line"> <span class='keyword'>return</span> areaID;</td></tr>
1402<tr><td class="num" id="LN1316">1316</td><td class="line"> }</td></tr>
1403<tr><td class="num" id="LN1317">1317</td><td class="line"> </td></tr>
1404<tr><td class="num" id="LN1318">1318</td><td class="line"> area = _AreaForAddress((addr_t)areaBase);</td></tr>
1405<tr><td class="num" id="LN1319">1319</td><td class="line"> </td></tr>
1406<tr><td class="num" id="LN1320">1320</td><td class="line"> <span class='comment'>// map the memory for the administrative structure</span></td></tr>
1407<tr><td class="num" id="LN1321">1321</td><td class="line"> VMAddressSpace* addressSpace = VMAddressSpace::Kernel();</td></tr>
1408<tr><td class="num" id="LN1322">1322</td><td class="line"> VMTranslationMap* translationMap = addressSpace-&gt;TranslationMap();</td></tr>
1409<tr><td class="num" id="LN1323">1323</td><td class="line"> </td></tr>
1410<tr><td class="num" id="LN1324">1324</td><td class="line"> pagesNeededToMap = translationMap-&gt;MaxPagesNeededToMap(</td></tr>
1411<tr><td class="num" id="LN1325">1325</td><td class="line"> (addr_t)area, (addr_t)areaBase + <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span> - 1);</td></tr>
1412<tr><td class="num" id="LN1326">1326</td><td class="line"> </td></tr>
1413<tr><td class="num" id="LN1327">1327</td><td class="line"> vmArea = VMAreaHash::Lookup(areaID);</td></tr>
1414<tr><td class="num" id="LN1328">1328</td><td class="line"> status_t error = _MapChunk(vmArea, (addr_t)area, kAreaAdminSize,</td></tr>
1415<tr><td class="num" id="LN1329">1329</td><td class="line"> pagesNeededToMap, flags);</td></tr>
1416<tr><td class="num" id="LN1330">1330</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>) {</td></tr>
1417<tr><td class="num" id="LN1331">1331</td><td class="line"> delete_area(areaID);</td></tr>
1418<tr><td class="num" id="LN1332">1332</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1419<tr><td class="num" id="LN1333">1333</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
1420<tr><td class="num" id="LN1334">1334</td><td class="line"> }</td></tr>
1421<tr><td class="num" id="LN1335">1335</td><td class="line"> </td></tr>
1422<tr><td class="num" id="LN1336">1336</td><td class="line"> dprintf(<span class='string_literal'>"slab memory manager: created area %p (%"</span> <span class='macro'>B_PRId32<span class='expansion'>"l" "d"</span></span> <span class='string_literal'>")\n"</span>, area,</td></tr>
1423<tr><td class="num" id="LN1337">1337</td><td class="line"> areaID);</td></tr>
1424<tr><td class="num" id="LN1338">1338</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1425<tr><td class="num" id="LN1339">1339</td><td class="line"> <span class='comment'>// no areas yet -- allocate raw memory</span></td></tr>
1426<tr><td class="num" id="LN1340">1340</td><td class="line"> areaBase = (<span class='keyword'>void</span>*)vm_allocate_early(sKernelArgs, <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>,</td></tr>
1427<tr><td class="num" id="LN1341">1341</td><td class="line"> <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>, <span class='macro'>B_KERNEL_READ_AREA<span class='expansion'>16</span></span> | <span class='macro'>B_KERNEL_WRITE_AREA<span class='expansion'>32</span></span>,</td></tr>
1428<tr><td class="num" id="LN1342">1342</td><td class="line"> <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>);</td></tr>
1429<tr><td class="num" id="LN1343">1343</td><td class="line"> <span class='keyword'>if</span> (areaBase == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1430<tr><td class="num" id="LN1344">1344</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1431<tr><td class="num" id="LN1345">1345</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_NO_MEMORY<span class='expansion'>((-2147483647 - 1) + 0)</span></span>;</td></tr>
1432<tr><td class="num" id="LN1346">1346</td><td class="line"> }</td></tr>
1433<tr><td class="num" id="LN1347">1347</td><td class="line"> area = _AreaForAddress((addr_t)areaBase);</td></tr>
1434<tr><td class="num" id="LN1348">1348</td><td class="line"> </td></tr>
1435<tr><td class="num" id="LN1349">1349</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_AllocateArea(): allocated early area %p\n"</span>,<span class='expansion'>do {} while (false)</span></span></td></tr>
1436<tr><td class="num" id="LN1350">1350</td><td class="line"> <span class='macro'>area)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1437<tr><td class="num" id="LN1351">1351</td><td class="line"> }</td></tr>
1438<tr><td class="num" id="LN1352">1352</td><td class="line"> </td></tr>
1439<tr><td class="num" id="LN1353">1353</td><td class="line"> <span class='comment'>// init the area structure</span></td></tr>
1440<tr><td class="num" id="LN1354">1354</td><td class="line"> area-&gt;vmArea = vmArea;</td></tr>
1441<tr><td class="num" id="LN1355">1355</td><td class="line"> area-&gt;reserved_memory_for_mapping = pagesNeededToMap * <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span>;</td></tr>
1442<tr><td class="num" id="LN1356">1356</td><td class="line"> area-&gt;usedMetaChunkCount = 0;</td></tr>
1443<tr><td class="num" id="LN1357">1357</td><td class="line"> area-&gt;fullyMapped = vmArea == <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1444<tr><td class="num" id="LN1358">1358</td><td class="line"> </td></tr>
1445<tr><td class="num" id="LN1359">1359</td><td class="line"> <span class='comment'>// init the meta chunks</span></td></tr>
1446<tr><td class="num" id="LN1360">1360</td><td class="line"> <span class='keyword'>for</span> (int32 i = 0; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
1447<tr><td class="num" id="LN1361">1361</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + i;</td></tr>
1448<tr><td class="num" id="LN1362">1362</td><td class="line"> metaChunk-&gt;chunkSize = 0;</td></tr>
1449<tr><td class="num" id="LN1363">1363</td><td class="line"> metaChunk-&gt;chunkBase = (addr_t)areaBase + i * <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>;</td></tr>
1450<tr><td class="num" id="LN1364">1364</td><td class="line"> metaChunk-&gt;totalSize = <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>;</td></tr>
1451<tr><td class="num" id="LN1365">1365</td><td class="line"> <span class='comment'>// Note: chunkBase and totalSize aren't correct for the first</span></td></tr>
1452<tr><td class="num" id="LN1366">1366</td><td class="line"> <span class='comment'>// meta chunk. They will be set in _PrepareMetaChunk().</span></td></tr>
1453<tr><td class="num" id="LN1367">1367</td><td class="line"> metaChunk-&gt;chunkCount = 0;</td></tr>
1454<tr><td class="num" id="LN1368">1368</td><td class="line"> metaChunk-&gt;usedChunkCount = 0;</td></tr>
1455<tr><td class="num" id="LN1369">1369</td><td class="line"> metaChunk-&gt;freeChunks = <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1456<tr><td class="num" id="LN1370">1370</td><td class="line"> }</td></tr>
1457<tr><td class="num" id="LN1371">1371</td><td class="line"> </td></tr>
1458<tr><td class="num" id="LN1372">1372</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1459<tr><td class="num" id="LN1373">1373</td><td class="line"> _area = area;</td></tr>
1460<tr><td class="num" id="LN1374">1374</td><td class="line"> </td></tr>
1461<tr><td class="num" id="LN1375">1375</td><td class="line"> T(AllocateArea(area, flags));</td></tr>
1462<tr><td class="num" id="LN1376">1376</td><td class="line"> </td></tr>
1463<tr><td class="num" id="LN1377">1377</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1464<tr><td class="num" id="LN1378">1378</td><td class="line">}</td></tr>
1465<tr><td class="num" id="LN1379">1379</td><td class="line"> </td></tr>
1466<tr><td class="num" id="LN1380">1380</td><td class="line"> </td></tr>
1467<tr><td class="num" id="LN1381">1381</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1468<tr><td class="num" id="LN1382">1382</td><td class="line">MemoryManager::_FreeArea(Area* area, <span class='keyword'>bool</span> areaRemoved, uint32 flags)</td></tr>
1469<tr><td class="num" id="LN1383">1383</td><td class="line">{</td></tr>
1470<tr><td class="num" id="LN1384">1384</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_FreeArea(%p, %#"</span> B_PRIx32 <span class='string_literal'>")\n"</span>, area, flags)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1471<tr><td class="num" id="LN1385">1385</td><td class="line"> </td></tr>
1472<tr><td class="num" id="LN1386">1386</td><td class="line"> T(FreeArea(area, areaRemoved, flags));</td></tr>
1473<tr><td class="num" id="LN1387">1387</td><td class="line"> </td></tr>
1474<tr><td class="num" id="LN1388">1388</td><td class="line"> <span class='macro'>ASSERT(area-&gt;usedMetaChunkCount == 0)<span class='expansion'>do { if (!(area-&gt;usedMetaChunkCount == 0)) { panic("ASSERT FAILED (%s:%d): %s"<br>, "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1388, "area-&gt;usedMetaChunkCount == 0"); } } while (0)</span></span>;</td></tr>
1475<tr><td class="num" id="LN1389">1389</td><td class="line"> </td></tr>
1476<tr><td class="num" id="LN1390">1390</td><td class="line"> <span class='keyword'>if</span> (!areaRemoved) {</td></tr>
1477<tr><td class="num" id="LN1391">1391</td><td class="line"> <span class='comment'>// remove the area's meta chunks from the free lists</span></td></tr>
1478<tr><td class="num" id="LN1392">1392</td><td class="line"> <span class='macro'>ASSERT(area-&gt;metaChunks[0].usedChunkCount == 0)<span class='expansion'>do { if (!(area-&gt;metaChunks[0].usedChunkCount == 0)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1392, "area-&gt;metaChunks[0].usedChunkCount == 0"); } } while<br> (0)</span></span>;</td></tr>
1479<tr><td class="num" id="LN1393">1393</td><td class="line"> sFreeShortMetaChunks.Remove(&amp;area-&gt;metaChunks[0]);</td></tr>
1480<tr><td class="num" id="LN1394">1394</td><td class="line"> </td></tr>
1481<tr><td class="num" id="LN1395">1395</td><td class="line"> <span class='keyword'>for</span> (int32 i = 1; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
1482<tr><td class="num" id="LN1396">1396</td><td class="line"> <span class='macro'>ASSERT(area-&gt;metaChunks[i].usedChunkCount == 0)<span class='expansion'>do { if (!(area-&gt;metaChunks[i].usedChunkCount == 0)) { panic<br>("ASSERT FAILED (%s:%d): %s", "/home/haiku/haiku/haiku/src/system/kernel/slab/MemoryManager.cpp"<br>, 1396, "area-&gt;metaChunks[i].usedChunkCount == 0"); } } while<br> (0)</span></span>;</td></tr>
1483<tr><td class="num" id="LN1397">1397</td><td class="line"> sFreeCompleteMetaChunks.Remove(&amp;area-&gt;metaChunks[i]);</td></tr>
1484<tr><td class="num" id="LN1398">1398</td><td class="line"> }</td></tr>
1485<tr><td class="num" id="LN1399">1399</td><td class="line"> </td></tr>
1486<tr><td class="num" id="LN1400">1400</td><td class="line"> <span class='comment'>// remove the area from the hash table</span></td></tr>
1487<tr><td class="num" id="LN1401">1401</td><td class="line"> WriteLocker writeLocker(sAreaTableLock);</td></tr>
1488<tr><td class="num" id="LN1402">1402</td><td class="line"> sAreaTable.RemoveUnchecked(area);</td></tr>
1489<tr><td class="num" id="LN1403">1403</td><td class="line"> writeLocker.Unlock();</td></tr>
1490<tr><td class="num" id="LN1404">1404</td><td class="line"> }</td></tr>
1491<tr><td class="num" id="LN1405">1405</td><td class="line"> </td></tr>
1492<tr><td class="num" id="LN1406">1406</td><td class="line"> <span class='comment'>// We want to keep one or two free areas as a reserve.</span></td></tr>
1493<tr><td class="num" id="LN1407">1407</td><td class="line"> <span class='keyword'>if</span> (sFreeAreaCount &lt;= 1) {</td></tr>
1494<tr><td class="num" id="LN1408">1408</td><td class="line"> _PushFreeArea(area);</td></tr>
1495<tr><td class="num" id="LN1409">1409</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1496<tr><td class="num" id="LN1410">1410</td><td class="line"> }</td></tr>
1497<tr><td class="num" id="LN1411">1411</td><td class="line"> </td></tr>
1498<tr><td class="num" id="LN1412">1412</td><td class="line"> <span class='keyword'>if</span> (area-&gt;vmArea == <span class='macro'>NULL<span class='expansion'>__null</span></span> || (flags &amp; CACHE_DONT_LOCK_KERNEL_SPACE) != 0) {</td></tr>
1499<tr><td class="num" id="LN1413">1413</td><td class="line"> <span class='comment'>// This is either early in the boot process or we aren't allowed to</span></td></tr>
1500<tr><td class="num" id="LN1414">1414</td><td class="line"> <span class='comment'>// delete the area now.</span></td></tr>
1501<tr><td class="num" id="LN1415">1415</td><td class="line"> _PushFreeArea(area);</td></tr>
1502<tr><td class="num" id="LN1416">1416</td><td class="line"> _RequestMaintenance();</td></tr>
1503<tr><td class="num" id="LN1417">1417</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1504<tr><td class="num" id="LN1418">1418</td><td class="line"> }</td></tr>
1505<tr><td class="num" id="LN1419">1419</td><td class="line"> </td></tr>
1506<tr><td class="num" id="LN1420">1420</td><td class="line"> mutex_unlock(&amp;sLock);</td></tr>
1507<tr><td class="num" id="LN1421">1421</td><td class="line"> </td></tr>
1508<tr><td class="num" id="LN1422">1422</td><td class="line"> dprintf(<span class='string_literal'>"slab memory manager: deleting area %p (%"</span> <span class='macro'>B_PRId32<span class='expansion'>"l" "d"</span></span> <span class='string_literal'>")\n"</span>, area,</td></tr>
1509<tr><td class="num" id="LN1423">1423</td><td class="line"> area-&gt;vmArea-&gt;id);</td></tr>
1510<tr><td class="num" id="LN1424">1424</td><td class="line"> </td></tr>
1511<tr><td class="num" id="LN1425">1425</td><td class="line"> size_t memoryToUnreserve = area-&gt;reserved_memory_for_mapping;</td></tr>
1512<tr><td class="num" id="LN1426">1426</td><td class="line"> delete_area(area-&gt;vmArea-&gt;id);</td></tr>
1513<tr><td class="num" id="LN1427">1427</td><td class="line"> vm_unreserve_memory(memoryToUnreserve);</td></tr>
1514<tr><td class="num" id="LN1428">1428</td><td class="line"> </td></tr>
1515<tr><td class="num" id="LN1429">1429</td><td class="line"> mutex_lock(&amp;sLock);</td></tr>
1516<tr><td class="num" id="LN1430">1430</td><td class="line">}</td></tr>
1517<tr><td class="num" id="LN1431">1431</td><td class="line"> </td></tr>
1518<tr><td class="num" id="LN1432">1432</td><td class="line"> </td></tr>
1519<tr><td class="num" id="LN1433">1433</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
1520<tr><td class="num" id="LN1434">1434</td><td class="line">MemoryManager::_MapChunk(VMArea* vmArea, addr_t address, size_t size,</td></tr>
1521<tr><td class="num" id="LN1435">1435</td><td class="line"> size_t reserveAdditionalMemory, uint32 flags)</td></tr>
1522<tr><td class="num" id="LN1436">1436</td><td class="line">{</td></tr>
1523<tr><td class="num" id="LN1437">1437</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_MapChunk(%p, %#"</span> B_PRIxADDR <span class='string_literal'>", %#"</span> B_PRIxSIZE<span class='expansion'>do {} while (false)</span></span></td></tr>
1524<tr><td class="num" id="LN1438">1438</td><td class="line"> <span class='string_literal'><span class='macro'>")\n"</span>, vmArea, address, size)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1525<tr><td class="num" id="LN1439">1439</td><td class="line"> </td></tr>
1526<tr><td class="num" id="LN1440">1440</td><td class="line"> T(Map(address, size, flags));</td></tr>
1527<tr><td class="num" id="LN1441">1441</td><td class="line"> </td></tr>
1528<tr><td class="num" id="LN1442">1442</td><td class="line"> <span class='keyword'>if</span> (vmArea == <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1529<tr><td class="num" id="LN1443">1443</td><td class="line"> <span class='comment'>// everything is mapped anyway</span></td></tr>
1530<tr><td class="num" id="LN1444">1444</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1531<tr><td class="num" id="LN1445">1445</td><td class="line"> }</td></tr>
1532<tr><td class="num" id="LN1446">1446</td><td class="line"> </td></tr>
1533<tr><td class="num" id="LN1447">1447</td><td class="line"> VMAddressSpace* addressSpace = VMAddressSpace::Kernel();</td></tr>
1534<tr><td class="num" id="LN1448">1448</td><td class="line"> VMTranslationMap* translationMap = addressSpace-&gt;TranslationMap();</td></tr>
1535<tr><td class="num" id="LN1449">1449</td><td class="line"> </td></tr>
1536<tr><td class="num" id="LN1450">1450</td><td class="line"> <span class='comment'>// reserve memory for the chunk</span></td></tr>
1537<tr><td class="num" id="LN1451">1451</td><td class="line"> <span class='keyword'>int</span> priority = (flags &amp; CACHE_PRIORITY_VIP) != 0</td></tr>
1538<tr><td class="num" id="LN1452">1452</td><td class="line"> ? <span class='macro'>VM_PRIORITY_VIP<span class='expansion'>2</span></span> : <span class='macro'>VM_PRIORITY_SYSTEM<span class='expansion'>1</span></span>;</td></tr>
1539<tr><td class="num" id="LN1453">1453</td><td class="line"> size_t reservedMemory = size + reserveAdditionalMemory;</td></tr>
1540<tr><td class="num" id="LN1454">1454</td><td class="line"> status_t error = vm_try_reserve_memory(size, priority,</td></tr>
1541<tr><td class="num" id="LN1455">1455</td><td class="line"> (flags &amp; CACHE_DONT_WAIT_FOR_MEMORY) != 0 ? 0 : 1000000);</td></tr>
1542<tr><td class="num" id="LN1456">1456</td><td class="line"> <span class='keyword'>if</span> (error != <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>)</td></tr>
1543<tr><td class="num" id="LN1457">1457</td><td class="line"> <span class='keyword'>return</span> error;</td></tr>
1544<tr><td class="num" id="LN1458">1458</td><td class="line"> </td></tr>
1545<tr><td class="num" id="LN1459">1459</td><td class="line"> <span class='comment'>// reserve the pages we need now</span></td></tr>
1546<tr><td class="num" id="LN1460">1460</td><td class="line"> size_t reservedPages = size / <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span></td></tr>
1547<tr><td class="num" id="LN1461">1461</td><td class="line"> + translationMap-&gt;MaxPagesNeededToMap(address, address + size - 1);</td></tr>
1548<tr><td class="num" id="LN1462">1462</td><td class="line"> vm_page_reservation reservation;</td></tr>
1549<tr><td class="num" id="LN1463">1463</td><td class="line"> <span class='keyword'>if</span> ((flags &amp; CACHE_DONT_WAIT_FOR_MEMORY) != 0) {</td></tr>
1550<tr><td class="num" id="LN1464">1464</td><td class="line"> <span class='keyword'>if</span> (!vm_page_try_reserve_pages(&amp;reservation, reservedPages, priority)) {</td></tr>
1551<tr><td class="num" id="LN1465">1465</td><td class="line"> vm_unreserve_memory(reservedMemory);</td></tr>
1552<tr><td class="num" id="LN1466">1466</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_WOULD_BLOCK<span class='expansion'>((-2147483647 - 1) + 11)</span></span>;</td></tr>
1553<tr><td class="num" id="LN1467">1467</td><td class="line"> }</td></tr>
1554<tr><td class="num" id="LN1468">1468</td><td class="line"> } <span class='keyword'>else</span></td></tr>
1555<tr><td class="num" id="LN1469">1469</td><td class="line"> vm_page_reserve_pages(&amp;reservation, reservedPages, priority);</td></tr>
1556<tr><td class="num" id="LN1470">1470</td><td class="line"> </td></tr>
1557<tr><td class="num" id="LN1471">1471</td><td class="line"> VMCache* cache = vm_area_get_locked_cache(vmArea);</td></tr>
1558<tr><td class="num" id="LN1472">1472</td><td class="line"> </td></tr>
1559<tr><td class="num" id="LN1473">1473</td><td class="line"> <span class='comment'>// map the pages</span></td></tr>
1560<tr><td class="num" id="LN1474">1474</td><td class="line"> translationMap-&gt;Lock();</td></tr>
1561<tr><td class="num" id="LN1475">1475</td><td class="line"> </td></tr>
1562<tr><td class="num" id="LN1476">1476</td><td class="line"> addr_t areaOffset = address - vmArea-&gt;Base();</td></tr>
1563<tr><td class="num" id="LN1477">1477</td><td class="line"> addr_t endAreaOffset = areaOffset + size;</td></tr>
1564<tr><td class="num" id="LN1478">1478</td><td class="line"> <span class='keyword'>for</span> (size_t offset = areaOffset; offset &lt; endAreaOffset;</td></tr>
1565<tr><td class="num" id="LN1479">1479</td><td class="line"> offset += <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span>) {</td></tr>
1566<tr><td class="num" id="LN1480">1480</td><td class="line"> vm_page* page = vm_page_allocate_page(&amp;reservation, PAGE_STATE_WIRED);</td></tr>
1567<tr><td class="num" id="LN1481">1481</td><td class="line"> cache-&gt;InsertPage(page, offset);</td></tr>
1568<tr><td class="num" id="LN1482">1482</td><td class="line"> </td></tr>
1569<tr><td class="num" id="LN1483">1483</td><td class="line"> page-&gt;IncrementWiredCount();</td></tr>
1570<tr><td class="num" id="LN1484">1484</td><td class="line"> <span class='macro'>atomic_add(&amp;gMappedPagesCount, 1)<span class='expansion'>__sync_fetch_and_add(&amp;gMappedPagesCount, 1)</span></span>;</td></tr>
1571<tr><td class="num" id="LN1485">1485</td><td class="line"> <span class='macro'>DEBUG_PAGE_ACCESS_END(page)<span class='expansion'>vm_page_debug_access_end(page)</span></span>;</td></tr>
1572<tr><td class="num" id="LN1486">1486</td><td class="line"> </td></tr>
1573<tr><td class="num" id="LN1487">1487</td><td class="line"> translationMap-&gt;Map(vmArea-&gt;Base() + offset,</td></tr>
1574<tr><td class="num" id="LN1488">1488</td><td class="line"> page-&gt;physical_page_number * <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span>,</td></tr>
1575<tr><td class="num" id="LN1489">1489</td><td class="line"> <span class='macro'>B_KERNEL_READ_AREA<span class='expansion'>16</span></span> | <span class='macro'>B_KERNEL_WRITE_AREA<span class='expansion'>32</span></span>,</td></tr>
1576<tr><td class="num" id="LN1490">1490</td><td class="line"> vmArea-&gt;MemoryType(), &amp;reservation);</td></tr>
1577<tr><td class="num" id="LN1491">1491</td><td class="line"> }</td></tr>
1578<tr><td class="num" id="LN1492">1492</td><td class="line"> </td></tr>
1579<tr><td class="num" id="LN1493">1493</td><td class="line"> translationMap-&gt;Unlock();</td></tr>
1580<tr><td class="num" id="LN1494">1494</td><td class="line"> </td></tr>
1581<tr><td class="num" id="LN1495">1495</td><td class="line"> cache-&gt;ReleaseRefAndUnlock();</td></tr>
1582<tr><td class="num" id="LN1496">1496</td><td class="line"> </td></tr>
1583<tr><td class="num" id="LN1497">1497</td><td class="line"> vm_page_unreserve_pages(&amp;reservation);</td></tr>
1584<tr><td class="num" id="LN1498">1498</td><td class="line"> </td></tr>
1585<tr><td class="num" id="LN1499">1499</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1586<tr><td class="num" id="LN1500">1500</td><td class="line">}</td></tr>
1587<tr><td class="num" id="LN1501">1501</td><td class="line"> </td></tr>
1588<tr><td class="num" id="LN1502">1502</td><td class="line"> </td></tr>
1589<tr><td class="num" id="LN1503">1503</td><td class="line"><span class='comment'>/*static*/</span> status_t</td></tr>
1590<tr><td class="num" id="LN1504">1504</td><td class="line">MemoryManager::_UnmapChunk(VMArea* vmArea, addr_t address, size_t size,</td></tr>
1591<tr><td class="num" id="LN1505">1505</td><td class="line"> uint32 flags)</td></tr>
1592<tr><td class="num" id="LN1506">1506</td><td class="line">{</td></tr>
1593<tr><td class="num" id="LN1507">1507</td><td class="line"> T(Unmap(address, size, flags));</td></tr>
1594<tr><td class="num" id="LN1508">1508</td><td class="line"> </td></tr>
1595<tr><td class="num" id="LN1509">1509</td><td class="line"> <span class='keyword'>if</span> (vmArea == <span class='macro'>NULL<span class='expansion'>__null</span></span>)</td></tr>
1596<tr><td class="num" id="LN1510">1510</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_ERROR<span class='expansion'>(-1)</span></span>;</td></tr>
1597<tr><td class="num" id="LN1511">1511</td><td class="line"> </td></tr>
1598<tr><td class="num" id="LN1512">1512</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_UnmapChunk(%p, %#"</span> B_PRIxADDR <span class='string_literal'>", %#"</span> B_PRIxSIZE<span class='expansion'>do {} while (false)</span></span></td></tr>
1599<tr><td class="num" id="LN1513">1513</td><td class="line"> <span class='string_literal'><span class='macro'>")\n"</span>, vmArea, address, size)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1600<tr><td class="num" id="LN1514">1514</td><td class="line"> </td></tr>
1601<tr><td class="num" id="LN1515">1515</td><td class="line"> VMAddressSpace* addressSpace = VMAddressSpace::Kernel();</td></tr>
1602<tr><td class="num" id="LN1516">1516</td><td class="line"> VMTranslationMap* translationMap = addressSpace-&gt;TranslationMap();</td></tr>
1603<tr><td class="num" id="LN1517">1517</td><td class="line"> VMCache* cache = vm_area_get_locked_cache(vmArea);</td></tr>
1604<tr><td class="num" id="LN1518">1518</td><td class="line"> </td></tr>
1605<tr><td class="num" id="LN1519">1519</td><td class="line"> <span class='comment'>// unmap the pages</span></td></tr>
1606<tr><td class="num" id="LN1520">1520</td><td class="line"> translationMap-&gt;Lock();</td></tr>
1607<tr><td class="num" id="LN1521">1521</td><td class="line"> translationMap-&gt;Unmap(address, address + size - 1);</td></tr>
1608<tr><td class="num" id="LN1522">1522</td><td class="line"> <span class='macro'>atomic_add(&amp;gMappedPagesCount, -(size / B_PAGE_SIZE))<span class='expansion'>__sync_fetch_and_add(&amp;gMappedPagesCount, -(size / 4096))</span></span>;</td></tr>
1609<tr><td class="num" id="LN1523">1523</td><td class="line"> translationMap-&gt;Unlock();</td></tr>
1610<tr><td class="num" id="LN1524">1524</td><td class="line"> </td></tr>
1611<tr><td class="num" id="LN1525">1525</td><td class="line"> <span class='comment'>// free the pages</span></td></tr>
1612<tr><td class="num" id="LN1526">1526</td><td class="line"> addr_t areaPageOffset = (address - vmArea-&gt;Base()) / <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span>;</td></tr>
1613<tr><td class="num" id="LN1527">1527</td><td class="line"> addr_t areaPageEndOffset = areaPageOffset + size / <span class='macro'>B_PAGE_SIZE<span class='expansion'>4096</span></span>;</td></tr>
1614<tr><td class="num" id="LN1528">1528</td><td class="line"> VMCachePagesTree::Iterator it = cache-&gt;pages.GetIterator(</td></tr>
1615<tr><td class="num" id="LN1529">1529</td><td class="line"> areaPageOffset, <span class='keyword'>true</span>, <span class='keyword'>true</span>);</td></tr>
1616<tr><td class="num" id="LN1530">1530</td><td class="line"> <span class='keyword'>while</span> (vm_page* page = it.Next()) {</td></tr>
1617<tr><td class="num" id="LN1531">1531</td><td class="line"> <span class='keyword'>if</span> (page-&gt;cache_offset &gt;= areaPageEndOffset)</td></tr>
1618<tr><td class="num" id="LN1532">1532</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1619<tr><td class="num" id="LN1533">1533</td><td class="line"> </td></tr>
1620<tr><td class="num" id="LN1534">1534</td><td class="line"> <span class='macro'>DEBUG_PAGE_ACCESS_START(page)<span class='expansion'>vm_page_debug_access_start(page)</span></span>;</td></tr>
1621<tr><td class="num" id="LN1535">1535</td><td class="line"> </td></tr>
1622<tr><td class="num" id="LN1536">1536</td><td class="line"> page-&gt;DecrementWiredCount();</td></tr>
1623<tr><td class="num" id="LN1537">1537</td><td class="line"> </td></tr>
1624<tr><td class="num" id="LN1538">1538</td><td class="line"> cache-&gt;RemovePage(page);</td></tr>
1625<tr><td class="num" id="LN1539">1539</td><td class="line"> <span class='comment'>// the iterator is remove-safe</span></td></tr>
1626<tr><td class="num" id="LN1540">1540</td><td class="line"> vm_page_free(cache, page);</td></tr>
1627<tr><td class="num" id="LN1541">1541</td><td class="line"> }</td></tr>
1628<tr><td class="num" id="LN1542">1542</td><td class="line"> </td></tr>
1629<tr><td class="num" id="LN1543">1543</td><td class="line"> cache-&gt;ReleaseRefAndUnlock();</td></tr>
1630<tr><td class="num" id="LN1544">1544</td><td class="line"> </td></tr>
1631<tr><td class="num" id="LN1545">1545</td><td class="line"> vm_unreserve_memory(size);</td></tr>
1632<tr><td class="num" id="LN1546">1546</td><td class="line"> </td></tr>
1633<tr><td class="num" id="LN1547">1547</td><td class="line"> <span class='keyword'>return</span> <span class='macro'>B_OK<span class='expansion'>((int)0)</span></span>;</td></tr>
1634<tr><td class="num" id="LN1548">1548</td><td class="line">}</td></tr>
1635<tr><td class="num" id="LN1549">1549</td><td class="line"> </td></tr>
1636<tr><td class="num" id="LN1550">1550</td><td class="line"> </td></tr>
1637<tr><td class="num" id="LN1551">1551</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1638<tr><td class="num" id="LN1552">1552</td><td class="line">MemoryManager::_UnmapFreeChunksEarly(Area* area)</td></tr>
1639<tr><td class="num" id="LN1553">1553</td><td class="line">{</td></tr>
1640<tr><td class="num" id="LN1554">1554</td><td class="line"> <span class='keyword'>if</span> (!area-&gt;fullyMapped)</td></tr>
1641<tr><td class="num" id="LN1555">1555</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1642<tr><td class="num" id="LN1556">1556</td><td class="line"> </td></tr>
1643<tr><td class="num" id="LN1557">1557</td><td class="line"> <span class='macro'>TRACE(<span class='string_literal'>"MemoryManager::_UnmapFreeChunksEarly(%p)\n"</span>, area)<span class='expansion'>do {} while (false)</span></span>;</td></tr>
1644<tr><td class="num" id="LN1558">1558</td><td class="line"> </td></tr>
1645<tr><td class="num" id="LN1559">1559</td><td class="line"> <span class='comment'>// unmap the space before the Area structure</span></td></tr>
1646<tr><td class="num" id="LN1560">1560</td><td class="line"> <span class='directive'>#if <span class='macro'>SLAB_AREA_STRUCT_OFFSET<span class='expansion'>4096</span></span> &gt; 0</span></td></tr>
1647<tr><td class="num" id="LN1561">1561</td><td class="line"> _UnmapChunk(area-&gt;vmArea, area-&gt;BaseAddress(), <span class='macro'>SLAB_AREA_STRUCT_OFFSET<span class='expansion'>4096</span></span>,</td></tr>
1648<tr><td class="num" id="LN1562">1562</td><td class="line"> 0);</td></tr>
1649<tr><td class="num" id="LN1563">1563</td><td class="line"> <span class='directive'>#endif</span></td></tr>
1650<tr><td class="num" id="LN1564">1564</td><td class="line"> </td></tr>
1651<tr><td class="num" id="LN1565">1565</td><td class="line"> <span class='keyword'>for</span> (int32 i = 0; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
1652<tr><td class="num" id="LN1566">1566</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + i;</td></tr>
1653<tr><td class="num" id="LN1567">1567</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0) {</td></tr>
1654<tr><td class="num" id="LN1568">1568</td><td class="line"> <span class='comment'>// meta chunk is free -- unmap it completely</span></td></tr>
1655<tr><td class="num" id="LN1569">1569</td><td class="line"> <span class='keyword'>if</span> (i == 0) {</td></tr>
1656<tr><td class="num" id="LN1570">1570</td><td class="line"> _UnmapChunk(area-&gt;vmArea, (addr_t)area + kAreaAdminSize,</td></tr>
1657<tr><td class="num" id="LN1571">1571</td><td class="line"> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span> - kAreaAdminSize, 0);</td></tr>
1658<tr><td class="num" id="LN1572">1572</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1659<tr><td class="num" id="LN1573">1573</td><td class="line"> _UnmapChunk(area-&gt;vmArea,</td></tr>
1660<tr><td class="num" id="LN1574">1574</td><td class="line"> area-&gt;BaseAddress() + i * <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>,</td></tr>
1661<tr><td class="num" id="LN1575">1575</td><td class="line"> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>, 0);</td></tr>
1662<tr><td class="num" id="LN1576">1576</td><td class="line"> }</td></tr>
1663<tr><td class="num" id="LN1577">1577</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1664<tr><td class="num" id="LN1578">1578</td><td class="line"> <span class='comment'>// unmap free chunks</span></td></tr>
1665<tr><td class="num" id="LN1579">1579</td><td class="line"> <span class='keyword'>for</span> (Chunk* chunk = metaChunk-&gt;freeChunks; chunk != <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1666<tr><td class="num" id="LN1580">1580</td><td class="line"> chunk = chunk-&gt;next) {</td></tr>
1667<tr><td class="num" id="LN1581">1581</td><td class="line"> _UnmapChunk(area-&gt;vmArea, _ChunkAddress(metaChunk, chunk),</td></tr>
1668<tr><td class="num" id="LN1582">1582</td><td class="line"> metaChunk-&gt;chunkSize, 0);</td></tr>
1669<tr><td class="num" id="LN1583">1583</td><td class="line"> }</td></tr>
1670<tr><td class="num" id="LN1584">1584</td><td class="line"> </td></tr>
1671<tr><td class="num" id="LN1585">1585</td><td class="line"> <span class='comment'>// The first meta chunk might have space before its first chunk.</span></td></tr>
1672<tr><td class="num" id="LN1586">1586</td><td class="line"> <span class='keyword'>if</span> (i == 0) {</td></tr>
1673<tr><td class="num" id="LN1587">1587</td><td class="line"> addr_t unusedStart = (addr_t)area + kAreaAdminSize;</td></tr>
1674<tr><td class="num" id="LN1588">1588</td><td class="line"> <span class='keyword'>if</span> (unusedStart &lt; metaChunk-&gt;chunkBase) {</td></tr>
1675<tr><td class="num" id="LN1589">1589</td><td class="line"> _UnmapChunk(area-&gt;vmArea, unusedStart,</td></tr>
1676<tr><td class="num" id="LN1590">1590</td><td class="line"> metaChunk-&gt;chunkBase - unusedStart, 0);</td></tr>
1677<tr><td class="num" id="LN1591">1591</td><td class="line"> }</td></tr>
1678<tr><td class="num" id="LN1592">1592</td><td class="line"> }</td></tr>
1679<tr><td class="num" id="LN1593">1593</td><td class="line"> }</td></tr>
1680<tr><td class="num" id="LN1594">1594</td><td class="line"> }</td></tr>
1681<tr><td class="num" id="LN1595">1595</td><td class="line"> </td></tr>
1682<tr><td class="num" id="LN1596">1596</td><td class="line"> area-&gt;fullyMapped = <span class='keyword'>false</span>;</td></tr>
1683<tr><td class="num" id="LN1597">1597</td><td class="line">}</td></tr>
1684<tr><td class="num" id="LN1598">1598</td><td class="line"> </td></tr>
1685<tr><td class="num" id="LN1599">1599</td><td class="line"> </td></tr>
1686<tr><td class="num" id="LN1600">1600</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1687<tr><td class="num" id="LN1601">1601</td><td class="line">MemoryManager::_ConvertEarlyArea(Area* area)</td></tr>
1688<tr><td class="num" id="LN1602">1602</td><td class="line">{</td></tr>
1689<tr><td class="num" id="LN1603">1603</td><td class="line"> <span class='keyword'>void</span>* address = (<span class='keyword'>void</span>*)area-&gt;BaseAddress();</td></tr>
1690<tr><td class="num" id="LN1604">1604</td><td class="line"> area_id areaID = create_area(kSlabAreaName, &amp;address, <span class='macro'>B_EXACT_ADDRESS<span class='expansion'>1</span></span>,</td></tr>
1691<tr><td class="num" id="LN1605">1605</td><td class="line"> <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>, B_ALREADY_WIRED,</td></tr>
1692<tr><td class="num" id="LN1606">1606</td><td class="line"> <span class='macro'>B_KERNEL_READ_AREA<span class='expansion'>16</span></span> | <span class='macro'>B_KERNEL_WRITE_AREA<span class='expansion'>32</span></span>);</td></tr>
1693<tr><td class="num" id="LN1607">1607</td><td class="line"> <span class='keyword'>if</span> (areaID &lt; 0)</td></tr>
1694<tr><td class="num" id="LN1608">1608</td><td class="line"> panic(<span class='string_literal'>"out of memory"</span>);</td></tr>
1695<tr><td class="num" id="LN1609">1609</td><td class="line"> </td></tr>
1696<tr><td class="num" id="LN1610">1610</td><td class="line"> area-&gt;vmArea = VMAreaHash::Lookup(areaID);</td></tr>
1697<tr><td class="num" id="LN1611">1611</td><td class="line">}</td></tr>
1698<tr><td class="num" id="LN1612">1612</td><td class="line"> </td></tr>
1699<tr><td class="num" id="LN1613">1613</td><td class="line"> </td></tr>
1700<tr><td class="num" id="LN1614">1614</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1701<tr><td class="num" id="LN1615">1615</td><td class="line">MemoryManager::_RequestMaintenance()</td></tr>
1702<tr><td class="num" id="LN1616">1616</td><td class="line">{</td></tr>
1703<tr><td class="num" id="LN1617">1617</td><td class="line"> <span class='keyword'>if</span> ((sFreeAreaCount &gt; 0 &amp;&amp; sFreeAreaCount &lt;= 2) || sMaintenanceNeeded)</td></tr>
1704<tr><td class="num" id="LN1618">1618</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1705<tr><td class="num" id="LN1619">1619</td><td class="line"> </td></tr>
1706<tr><td class="num" id="LN1620">1620</td><td class="line"> sMaintenanceNeeded = <span class='keyword'>true</span>;</td></tr>
1707<tr><td class="num" id="LN1621">1621</td><td class="line"> request_memory_manager_maintenance();</td></tr>
1708<tr><td class="num" id="LN1622">1622</td><td class="line">}</td></tr>
1709<tr><td class="num" id="LN1623">1623</td><td class="line"> </td></tr>
1710<tr><td class="num" id="LN1624">1624</td><td class="line"> </td></tr>
1711<tr><td class="num" id="LN1625">1625</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>bool</span></td></tr>
1712<tr><td class="num" id="LN1626">1626</td><td class="line">MemoryManager::_IsChunkInFreeList(<span class='keyword'>const</span> MetaChunk* metaChunk,</td></tr>
1713<tr><td class="num" id="LN1627">1627</td><td class="line"> <span class='keyword'>const</span> Chunk* chunk)</td></tr>
1714<tr><td class="num" id="LN1628">1628</td><td class="line">{</td></tr>
1715<tr><td class="num" id="LN1629">1629</td><td class="line"> Chunk* freeChunk = metaChunk-&gt;freeChunks;</td></tr>
1716<tr><td class="num" id="LN1630">1630</td><td class="line"> <span class='keyword'>while</span> (freeChunk != <span class='macro'>NULL<span class='expansion'>__null</span></span>) {</td></tr>
1717<tr><td class="num" id="LN1631">1631</td><td class="line"> <span class='keyword'>if</span> (freeChunk == chunk)</td></tr>
1718<tr><td class="num" id="LN1632">1632</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>true</span>;</td></tr>
1719<tr><td class="num" id="LN1633">1633</td><td class="line"> freeChunk = freeChunk-&gt;next;</td></tr>
1720<tr><td class="num" id="LN1634">1634</td><td class="line"> }</td></tr>
1721<tr><td class="num" id="LN1635">1635</td><td class="line"> </td></tr>
1722<tr><td class="num" id="LN1636">1636</td><td class="line"> <span class='keyword'>return</span> <span class='keyword'>false</span>;</td></tr>
1723<tr><td class="num" id="LN1637">1637</td><td class="line">}</td></tr>
1724<tr><td class="num" id="LN1638">1638</td><td class="line"> </td></tr>
1725<tr><td class="num" id="LN1639">1639</td><td class="line"> </td></tr>
1726<tr><td class="num" id="LN1640">1640</td><td class="line"><span class='directive'>#if <span class='macro'>DEBUG_SLAB_MEMORY_MANAGER_PARANOID_CHECKS<span class='expansion'>0</span></span></span></td></tr>
1727<tr><td class="num" id="LN1641">1641</td><td class="line"> </td></tr>
1728<tr><td class="num" id="LN1642">1642</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1729<tr><td class="num" id="LN1643">1643</td><td class="line">MemoryManager::_CheckMetaChunk(MetaChunk* metaChunk)</td></tr>
1730<tr><td class="num" id="LN1644">1644</td><td class="line">{</td></tr>
1731<tr><td class="num" id="LN1645">1645</td><td class="line"> Area* area = metaChunk-&gt;GetArea();</td></tr>
1732<tr><td class="num" id="LN1646">1646</td><td class="line"> int32 metaChunkIndex = metaChunk - area-&gt;metaChunks;</td></tr>
1733<tr><td class="num" id="LN1647">1647</td><td class="line"> <span class='keyword'>if</span> (metaChunkIndex &lt; 0 || metaChunkIndex &gt;= <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>) {</td></tr>
1734<tr><td class="num" id="LN1648">1648</td><td class="line"> panic(<span class='string_literal'>"invalid meta chunk %p!"</span>, metaChunk);</td></tr>
1735<tr><td class="num" id="LN1649">1649</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1736<tr><td class="num" id="LN1650">1650</td><td class="line"> }</td></tr>
1737<tr><td class="num" id="LN1651">1651</td><td class="line"> </td></tr>
1738<tr><td class="num" id="LN1652">1652</td><td class="line"> <span class='keyword'>switch</span> (metaChunk-&gt;chunkSize) {</td></tr>
1739<tr><td class="num" id="LN1653">1653</td><td class="line"> <span class='keyword'>case</span> 0:</td></tr>
1740<tr><td class="num" id="LN1654">1654</td><td class="line"> <span class='comment'>// unused</span></td></tr>
1741<tr><td class="num" id="LN1655">1655</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1742<tr><td class="num" id="LN1656">1656</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>:</td></tr>
1743<tr><td class="num" id="LN1657">1657</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>:</td></tr>
1744<tr><td class="num" id="LN1658">1658</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>:</td></tr>
1745<tr><td class="num" id="LN1659">1659</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1746<tr><td class="num" id="LN1660">1660</td><td class="line"> <span class='keyword'>default</span>:</td></tr>
1747<tr><td class="num" id="LN1661">1661</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid chunk size: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span>,</td></tr>
1748<tr><td class="num" id="LN1662">1662</td><td class="line"> metaChunk, metaChunk-&gt;chunkSize);</td></tr>
1749<tr><td class="num" id="LN1663">1663</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1750<tr><td class="num" id="LN1664">1664</td><td class="line"> }</td></tr>
1751<tr><td class="num" id="LN1665">1665</td><td class="line"> </td></tr>
1752<tr><td class="num" id="LN1666">1666</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;totalSize &gt; <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>) {</td></tr>
1753<tr><td class="num" id="LN1667">1667</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid total size: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span>,</td></tr>
1754<tr><td class="num" id="LN1668">1668</td><td class="line"> metaChunk, metaChunk-&gt;totalSize);</td></tr>
1755<tr><td class="num" id="LN1669">1669</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1756<tr><td class="num" id="LN1670">1670</td><td class="line"> }</td></tr>
1757<tr><td class="num" id="LN1671">1671</td><td class="line"> </td></tr>
1758<tr><td class="num" id="LN1672">1672</td><td class="line"> addr_t expectedBase = area-&gt;BaseAddress()</td></tr>
1759<tr><td class="num" id="LN1673">1673</td><td class="line"> + metaChunkIndex * <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>;</td></tr>
1760<tr><td class="num" id="LN1674">1674</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkBase &lt; expectedBase</td></tr>
1761<tr><td class="num" id="LN1675">1675</td><td class="line"> || metaChunk-&gt;chunkBase - expectedBase + metaChunk-&gt;totalSize</td></tr>
1762<tr><td class="num" id="LN1676">1676</td><td class="line"> &gt; <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>) {</td></tr>
1763<tr><td class="num" id="LN1677">1677</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid base address: %"</span> <span class='macro'>B_PRIxADDR<span class='expansion'>"l" "x"</span></span>, metaChunk,</td></tr>
1764<tr><td class="num" id="LN1678">1678</td><td class="line"> metaChunk-&gt;chunkBase);</td></tr>
1765<tr><td class="num" id="LN1679">1679</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1766<tr><td class="num" id="LN1680">1680</td><td class="line"> }</td></tr>
1767<tr><td class="num" id="LN1681">1681</td><td class="line"> </td></tr>
1768<tr><td class="num" id="LN1682">1682</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkCount != metaChunk-&gt;totalSize / metaChunk-&gt;chunkSize) {</td></tr>
1769<tr><td class="num" id="LN1683">1683</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid chunk count: %u"</span>, metaChunk,</td></tr>
1770<tr><td class="num" id="LN1684">1684</td><td class="line"> metaChunk-&gt;chunkCount);</td></tr>
1771<tr><td class="num" id="LN1685">1685</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1772<tr><td class="num" id="LN1686">1686</td><td class="line"> }</td></tr>
1773<tr><td class="num" id="LN1687">1687</td><td class="line"> </td></tr>
1774<tr><td class="num" id="LN1688">1688</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;usedChunkCount &gt; metaChunk-&gt;chunkCount) {</td></tr>
1775<tr><td class="num" id="LN1689">1689</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid unused chunk count: %u"</span>, metaChunk,</td></tr>
1776<tr><td class="num" id="LN1690">1690</td><td class="line"> metaChunk-&gt;usedChunkCount);</td></tr>
1777<tr><td class="num" id="LN1691">1691</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1778<tr><td class="num" id="LN1692">1692</td><td class="line"> }</td></tr>
1779<tr><td class="num" id="LN1693">1693</td><td class="line"> </td></tr>
1780<tr><td class="num" id="LN1694">1694</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;firstFreeChunk &gt; metaChunk-&gt;chunkCount) {</td></tr>
1781<tr><td class="num" id="LN1695">1695</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid first free chunk: %u"</span>, metaChunk,</td></tr>
1782<tr><td class="num" id="LN1696">1696</td><td class="line"> metaChunk-&gt;firstFreeChunk);</td></tr>
1783<tr><td class="num" id="LN1697">1697</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1784<tr><td class="num" id="LN1698">1698</td><td class="line"> }</td></tr>
1785<tr><td class="num" id="LN1699">1699</td><td class="line"> </td></tr>
1786<tr><td class="num" id="LN1700">1700</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;lastFreeChunk &gt;= metaChunk-&gt;chunkCount) {</td></tr>
1787<tr><td class="num" id="LN1701">1701</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid last free chunk: %u"</span>, metaChunk,</td></tr>
1788<tr><td class="num" id="LN1702">1702</td><td class="line"> metaChunk-&gt;lastFreeChunk);</td></tr>
1789<tr><td class="num" id="LN1703">1703</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1790<tr><td class="num" id="LN1704">1704</td><td class="line"> }</td></tr>
1791<tr><td class="num" id="LN1705">1705</td><td class="line"> </td></tr>
1792<tr><td class="num" id="LN1706">1706</td><td class="line"> <span class='comment'>// check free list for structural sanity</span></td></tr>
1793<tr><td class="num" id="LN1707">1707</td><td class="line"> uint32 freeChunks = 0;</td></tr>
1794<tr><td class="num" id="LN1708">1708</td><td class="line"> <span class='keyword'>for</span> (Chunk* chunk = metaChunk-&gt;freeChunks; chunk != <span class='macro'>NULL<span class='expansion'>__null</span></span>;</td></tr>
1795<tr><td class="num" id="LN1709">1709</td><td class="line"> chunk = chunk-&gt;next) {</td></tr>
1796<tr><td class="num" id="LN1710">1710</td><td class="line"> <span class='keyword'>if</span> ((addr_t)chunk % <span class='keyword'>sizeof</span>(Chunk) != 0 || chunk &lt; metaChunk-&gt;chunks</td></tr>
1797<tr><td class="num" id="LN1711">1711</td><td class="line"> || chunk &gt;= metaChunk-&gt;chunks + metaChunk-&gt;chunkCount) {</td></tr>
1798<tr><td class="num" id="LN1712">1712</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has invalid element in free list, chunk: %p"</span>,</td></tr>
1799<tr><td class="num" id="LN1713">1713</td><td class="line"> metaChunk, chunk);</td></tr>
1800<tr><td class="num" id="LN1714">1714</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1801<tr><td class="num" id="LN1715">1715</td><td class="line"> }</td></tr>
1802<tr><td class="num" id="LN1716">1716</td><td class="line"> </td></tr>
1803<tr><td class="num" id="LN1717">1717</td><td class="line"> <span class='keyword'>if</span> (++freeChunks &gt; metaChunk-&gt;chunkCount) {</td></tr>
1804<tr><td class="num" id="LN1718">1718</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has cyclic free list"</span>, metaChunk);</td></tr>
1805<tr><td class="num" id="LN1719">1719</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1806<tr><td class="num" id="LN1720">1720</td><td class="line"> }</td></tr>
1807<tr><td class="num" id="LN1721">1721</td><td class="line"> }</td></tr>
1808<tr><td class="num" id="LN1722">1722</td><td class="line"> </td></tr>
1809<tr><td class="num" id="LN1723">1723</td><td class="line"> <span class='keyword'>if</span> (freeChunks + metaChunk-&gt;usedChunkCount &gt; metaChunk-&gt;chunkCount) {</td></tr>
1810<tr><td class="num" id="LN1724">1724</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has mismatching free/used chunk counts: total: "</span></td></tr>
1811<tr><td class="num" id="LN1725">1725</td><td class="line"> <span class='string_literal'>"%u, used: %u, free: %"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span>, metaChunk, metaChunk-&gt;chunkCount,</td></tr>
1812<tr><td class="num" id="LN1726">1726</td><td class="line"> metaChunk-&gt;usedChunkCount, freeChunks);</td></tr>
1813<tr><td class="num" id="LN1727">1727</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1814<tr><td class="num" id="LN1728">1728</td><td class="line"> }</td></tr>
1815<tr><td class="num" id="LN1729">1729</td><td class="line"> </td></tr>
1816<tr><td class="num" id="LN1730">1730</td><td class="line"> <span class='comment'>// count used chunks by looking at their reference/next field</span></td></tr>
1817<tr><td class="num" id="LN1731">1731</td><td class="line"> uint32 usedChunks = 0;</td></tr>
1818<tr><td class="num" id="LN1732">1732</td><td class="line"> <span class='keyword'>for</span> (uint32 i = 0; i &lt; metaChunk-&gt;chunkCount; i++) {</td></tr>
1819<tr><td class="num" id="LN1733">1733</td><td class="line"> <span class='keyword'>if</span> (!_IsChunkFree(metaChunk, metaChunk-&gt;chunks + i))</td></tr>
1820<tr><td class="num" id="LN1734">1734</td><td class="line"> usedChunks++;</td></tr>
1821<tr><td class="num" id="LN1735">1735</td><td class="line"> }</td></tr>
1822<tr><td class="num" id="LN1736">1736</td><td class="line"> </td></tr>
1823<tr><td class="num" id="LN1737">1737</td><td class="line"> <span class='keyword'>if</span> (usedChunks != metaChunk-&gt;usedChunkCount) {</td></tr>
1824<tr><td class="num" id="LN1738">1738</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has used chunks that appear free: total: "</span></td></tr>
1825<tr><td class="num" id="LN1739">1739</td><td class="line"> <span class='string_literal'>"%u, used: %u, appearing used: %"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span>, metaChunk,</td></tr>
1826<tr><td class="num" id="LN1740">1740</td><td class="line"> metaChunk-&gt;chunkCount, metaChunk-&gt;usedChunkCount, usedChunks);</td></tr>
1827<tr><td class="num" id="LN1741">1741</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1828<tr><td class="num" id="LN1742">1742</td><td class="line"> }</td></tr>
1829<tr><td class="num" id="LN1743">1743</td><td class="line"> </td></tr>
1830<tr><td class="num" id="LN1744">1744</td><td class="line"> <span class='comment'>// check free range</span></td></tr>
1831<tr><td class="num" id="LN1745">1745</td><td class="line"> <span class='keyword'>for</span> (uint32 i = metaChunk-&gt;firstFreeChunk; i &lt; metaChunk-&gt;lastFreeChunk;</td></tr>
1832<tr><td class="num" id="LN1746">1746</td><td class="line"> i++) {</td></tr>
1833<tr><td class="num" id="LN1747">1747</td><td class="line"> <span class='keyword'>if</span> (!_IsChunkFree(metaChunk, metaChunk-&gt;chunks + i)) {</td></tr>
1834<tr><td class="num" id="LN1748">1748</td><td class="line"> panic(<span class='string_literal'>"meta chunk %p has used chunk in free range, chunk: %p (%"</span></td></tr>
1835<tr><td class="num" id="LN1749">1749</td><td class="line"> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>", free range: %u - %u)"</span>, metaChunk,</td></tr>
1836<tr><td class="num" id="LN1750">1750</td><td class="line"> metaChunk-&gt;chunks + i, i, metaChunk-&gt;firstFreeChunk,</td></tr>
1837<tr><td class="num" id="LN1751">1751</td><td class="line"> metaChunk-&gt;lastFreeChunk);</td></tr>
1838<tr><td class="num" id="LN1752">1752</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1839<tr><td class="num" id="LN1753">1753</td><td class="line"> }</td></tr>
1840<tr><td class="num" id="LN1754">1754</td><td class="line"> }</td></tr>
1841<tr><td class="num" id="LN1755">1755</td><td class="line">}</td></tr>
1842<tr><td class="num" id="LN1756">1756</td><td class="line"> </td></tr>
1843<tr><td class="num" id="LN1757">1757</td><td class="line"><span class='directive'>#endif // DEBUG_SLAB_MEMORY_MANAGER_PARANOID_CHECKS</span></td></tr>
1844<tr><td class="num" id="LN1758">1758</td><td class="line"> </td></tr>
1845<tr><td class="num" id="LN1759">1759</td><td class="line"> </td></tr>
1846<tr><td class="num" id="LN1760">1760</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>int</span></td></tr>
1847<tr><td class="num" id="LN1761">1761</td><td class="line">MemoryManager::_DumpRawAllocations(<span class='keyword'>int</span> argc, <span class='keyword'>char</span>** argv)</td></tr>
1848<tr><td class="num" id="LN1762">1762</td><td class="line">{</td></tr>
1849<tr><td class="num" id="LN1763">1763</td><td class="line"> kprintf(<span class='string_literal'>"%-*s meta chunk chunk %-*s size (KB)\n"</span>,</td></tr>
1850<tr><td class="num" id="LN1764">1764</td><td class="line"> <span class='macro'>B_PRINTF_POINTER_WIDTH<span class='expansion'>8</span></span>, <span class='string_literal'>"area"</span>, <span class='macro'>B_PRINTF_POINTER_WIDTH<span class='expansion'>8</span></span>, <span class='string_literal'>"base"</span>);</td></tr>
1851<tr><td class="num" id="LN1765">1765</td><td class="line"> </td></tr>
1852<tr><td class="num" id="LN1766">1766</td><td class="line"> size_t totalSize = 0;</td></tr>
1853<tr><td class="num" id="LN1767">1767</td><td class="line"> </td></tr>
1854<tr><td class="num" id="LN1768">1768</td><td class="line"> <span class='keyword'>for</span> (AreaTable::Iterator it = sAreaTable.GetIterator();</td></tr>
1855<tr><td class="num" id="LN1769">1769</td><td class="line"> Area* area = it.Next();) {</td></tr>
1856<tr><td class="num" id="LN1770">1770</td><td class="line"> <span class='keyword'>for</span> (int32 i = 0; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
1857<tr><td class="num" id="LN1771">1771</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + i;</td></tr>
1858<tr><td class="num" id="LN1772">1772</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0)</td></tr>
1859<tr><td class="num" id="LN1773">1773</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
1860<tr><td class="num" id="LN1774">1774</td><td class="line"> <span class='keyword'>for</span> (uint32 k = 0; k &lt; metaChunk-&gt;chunkCount; k++) {</td></tr>
1861<tr><td class="num" id="LN1775">1775</td><td class="line"> Chunk* chunk = metaChunk-&gt;chunks + k;</td></tr>
1862<tr><td class="num" id="LN1776">1776</td><td class="line"> </td></tr>
1863<tr><td class="num" id="LN1777">1777</td><td class="line"> <span class='comment'>// skip free chunks</span></td></tr>
1864<tr><td class="num" id="LN1778">1778</td><td class="line"> <span class='keyword'>if</span> (_IsChunkFree(metaChunk, chunk))</td></tr>
1865<tr><td class="num" id="LN1779">1779</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
1866<tr><td class="num" id="LN1780">1780</td><td class="line"> </td></tr>
1867<tr><td class="num" id="LN1781">1781</td><td class="line"> addr_t reference = chunk-&gt;reference;</td></tr>
1868<tr><td class="num" id="LN1782">1782</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0 || reference == 1)</td></tr>
1869<tr><td class="num" id="LN1783">1783</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
1870<tr><td class="num" id="LN1784">1784</td><td class="line"> </td></tr>
1871<tr><td class="num" id="LN1785">1785</td><td class="line"> addr_t chunkAddress = _ChunkAddress(metaChunk, chunk);</td></tr>
1872<tr><td class="num" id="LN1786">1786</td><td class="line"> size_t size = reference - chunkAddress + 1;</td></tr>
1873<tr><td class="num" id="LN1787">1787</td><td class="line"> totalSize += size;</td></tr>
1874<tr><td class="num" id="LN1788">1788</td><td class="line"> </td></tr>
1875<tr><td class="num" id="LN1789">1789</td><td class="line"> kprintf(<span class='string_literal'>"%p %10"</span> <span class='macro'>B_PRId32<span class='expansion'>"l" "d"</span></span> <span class='string_literal'>" %5"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" %p %9"</span></td></tr>
1876<tr><td class="num" id="LN1790">1790</td><td class="line"> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"\n"</span>, area, i, k, (<span class='keyword'>void</span>*)chunkAddress,</td></tr>
1877<tr><td class="num" id="LN1791">1791</td><td class="line"> size / 1024);</td></tr>
1878<tr><td class="num" id="LN1792">1792</td><td class="line"> }</td></tr>
1879<tr><td class="num" id="LN1793">1793</td><td class="line"> }</td></tr>
1880<tr><td class="num" id="LN1794">1794</td><td class="line"> }</td></tr>
1881<tr><td class="num" id="LN1795">1795</td><td class="line"> </td></tr>
1882<tr><td class="num" id="LN1796">1796</td><td class="line"> kprintf(<span class='string_literal'>"total:%*s%9"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"\n"</span>, (2 * <span class='macro'>B_PRINTF_POINTER_WIDTH<span class='expansion'>8</span></span>) + 21,</td></tr>
1883<tr><td class="num" id="LN1797">1797</td><td class="line"> <span class='string_literal'>""</span>, totalSize / 1024);</td></tr>
1884<tr><td class="num" id="LN1798">1798</td><td class="line"> </td></tr>
1885<tr><td class="num" id="LN1799">1799</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
1886<tr><td class="num" id="LN1800">1800</td><td class="line">}</td></tr>
1887<tr><td class="num" id="LN1801">1801</td><td class="line"> </td></tr>
1888<tr><td class="num" id="LN1802">1802</td><td class="line"> </td></tr>
1889<tr><td class="num" id="LN1803">1803</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1890<tr><td class="num" id="LN1804">1804</td><td class="line">MemoryManager::_PrintMetaChunkTableHeader(<span class='keyword'>bool</span> printChunks)</td></tr>
1891<tr><td class="num" id="LN1805">1805</td><td class="line">{</td></tr>
1892<tr><td class="num" id="LN1806">1806</td><td class="line"> <span class='keyword'>if</span> (printChunks)</td></tr>
1893<tr><td class="num" id="LN1807">1807</td><td class="line"> kprintf(<span class='string_literal'>"chunk base cache object size cache name\n"</span>);</td></tr>
1894<tr><td class="num" id="LN1808">1808</td><td class="line"> <span class='keyword'>else</span></td></tr>
1895<tr><td class="num" id="LN1809">1809</td><td class="line"> kprintf(<span class='string_literal'>"chunk base\n"</span>);</td></tr>
1896<tr><td class="num" id="LN1810">1810</td><td class="line">}</td></tr>
1897<tr><td class="num" id="LN1811">1811</td><td class="line"> </td></tr>
1898<tr><td class="num" id="LN1812">1812</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1899<tr><td class="num" id="LN1813">1813</td><td class="line">MemoryManager::_DumpMetaChunk(MetaChunk* metaChunk, <span class='keyword'>bool</span> printChunks,</td></tr>
1900<tr><td class="num" id="LN1814">1814</td><td class="line"> <span class='keyword'>bool</span> printHeader)</td></tr>
1901<tr><td class="num" id="LN1815">1815</td><td class="line">{</td></tr>
1902<tr><td class="num" id="LN1816">1816</td><td class="line"> <span class='keyword'>if</span> (printHeader)</td></tr>
1903<tr><td class="num" id="LN1817">1817</td><td class="line"> _PrintMetaChunkTableHeader(printChunks);</td></tr>
1904<tr><td class="num" id="LN1818">1818</td><td class="line"> </td></tr>
1905<tr><td class="num" id="LN1819">1819</td><td class="line"> <span class='keyword'>const</span> <span class='keyword'>char</span>* type = <span class='string_literal'>"empty"</span>;</td></tr>
1906<tr><td class="num" id="LN1820">1820</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize != 0) {</td></tr>
1907<tr><td class="num" id="LN1821">1821</td><td class="line"> <span class='keyword'>switch</span> (metaChunk-&gt;chunkSize) {</td></tr>
1908<tr><td class="num" id="LN1822">1822</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>:</td></tr>
1909<tr><td class="num" id="LN1823">1823</td><td class="line"> type = <span class='string_literal'>"small"</span>;</td></tr>
1910<tr><td class="num" id="LN1824">1824</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1911<tr><td class="num" id="LN1825">1825</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>:</td></tr>
1912<tr><td class="num" id="LN1826">1826</td><td class="line"> type = <span class='string_literal'>"medium"</span>;</td></tr>
1913<tr><td class="num" id="LN1827">1827</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1914<tr><td class="num" id="LN1828">1828</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>:</td></tr>
1915<tr><td class="num" id="LN1829">1829</td><td class="line"> type = <span class='string_literal'>"large"</span>;</td></tr>
1916<tr><td class="num" id="LN1830">1830</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
1917<tr><td class="num" id="LN1831">1831</td><td class="line"> }</td></tr>
1918<tr><td class="num" id="LN1832">1832</td><td class="line"> }</td></tr>
1919<tr><td class="num" id="LN1833">1833</td><td class="line"> </td></tr>
1920<tr><td class="num" id="LN1834">1834</td><td class="line"> <span class='keyword'>int</span> metaChunkIndex = metaChunk - metaChunk-&gt;GetArea()-&gt;metaChunks;</td></tr>
1921<tr><td class="num" id="LN1835">1835</td><td class="line"> kprintf(<span class='string_literal'>"%5d %p --- %6s meta chunk"</span>, metaChunkIndex,</td></tr>
1922<tr><td class="num" id="LN1836">1836</td><td class="line"> (<span class='keyword'>void</span>*)metaChunk-&gt;chunkBase, type);</td></tr>
1923<tr><td class="num" id="LN1837">1837</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize != 0) {</td></tr>
1924<tr><td class="num" id="LN1838">1838</td><td class="line"> kprintf(<span class='string_literal'>": %4u/%4u used, %-4u-%4u free ------------\n"</span>,</td></tr>
1925<tr><td class="num" id="LN1839">1839</td><td class="line"> metaChunk-&gt;usedChunkCount, metaChunk-&gt;chunkCount,</td></tr>
1926<tr><td class="num" id="LN1840">1840</td><td class="line"> metaChunk-&gt;firstFreeChunk, metaChunk-&gt;lastFreeChunk);</td></tr>
1927<tr><td class="num" id="LN1841">1841</td><td class="line"> } <span class='keyword'>else</span></td></tr>
1928<tr><td class="num" id="LN1842">1842</td><td class="line"> kprintf(<span class='string_literal'>" --------------------------------------------\n"</span>);</td></tr>
1929<tr><td class="num" id="LN1843">1843</td><td class="line"> </td></tr>
1930<tr><td class="num" id="LN1844">1844</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0 || !printChunks)</td></tr>
1931<tr><td class="num" id="LN1845">1845</td><td class="line"> <span class='keyword'>return</span>;</td></tr>
1932<tr><td class="num" id="LN1846">1846</td><td class="line"> </td></tr>
1933<tr><td class="num" id="LN1847">1847</td><td class="line"> <span class='keyword'>for</span> (uint32 i = 0; i &lt; metaChunk-&gt;chunkCount; i++) {</td></tr>
1934<tr><td class="num" id="LN1848">1848</td><td class="line"> Chunk* chunk = metaChunk-&gt;chunks + i;</td></tr>
1935<tr><td class="num" id="LN1849">1849</td><td class="line"> </td></tr>
1936<tr><td class="num" id="LN1850">1850</td><td class="line"> <span class='comment'>// skip free chunks</span></td></tr>
1937<tr><td class="num" id="LN1851">1851</td><td class="line"> <span class='keyword'>if</span> (_IsChunkFree(metaChunk, chunk)) {</td></tr>
1938<tr><td class="num" id="LN1852">1852</td><td class="line"> <span class='keyword'>if</span> (!_IsChunkInFreeList(metaChunk, chunk)) {</td></tr>
1939<tr><td class="num" id="LN1853">1853</td><td class="line"> kprintf(<span class='string_literal'>"%5"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" %p appears free, but isn't in free "</span></td></tr>
1940<tr><td class="num" id="LN1854">1854</td><td class="line"> <span class='string_literal'>"list!\n"</span>, i, (<span class='keyword'>void</span>*)_ChunkAddress(metaChunk, chunk));</td></tr>
1941<tr><td class="num" id="LN1855">1855</td><td class="line"> }</td></tr>
1942<tr><td class="num" id="LN1856">1856</td><td class="line"> </td></tr>
1943<tr><td class="num" id="LN1857">1857</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
1944<tr><td class="num" id="LN1858">1858</td><td class="line"> }</td></tr>
1945<tr><td class="num" id="LN1859">1859</td><td class="line"> </td></tr>
1946<tr><td class="num" id="LN1860">1860</td><td class="line"> addr_t reference = chunk-&gt;reference;</td></tr>
1947<tr><td class="num" id="LN1861">1861</td><td class="line"> <span class='keyword'>if</span> ((reference &amp; 1) == 0) {</td></tr>
1948<tr><td class="num" id="LN1862">1862</td><td class="line"> ObjectCache* cache = (ObjectCache*)reference;</td></tr>
1949<tr><td class="num" id="LN1863">1863</td><td class="line"> kprintf(<span class='string_literal'>"%5"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" %p %p %11"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" %s\n"</span>, i,</td></tr>
1950<tr><td class="num" id="LN1864">1864</td><td class="line"> (<span class='keyword'>void</span>*)_ChunkAddress(metaChunk, chunk), cache,</td></tr>
1951<tr><td class="num" id="LN1865">1865</td><td class="line"> cache != <span class='macro'>NULL<span class='expansion'>__null</span></span> ? cache-&gt;object_size : 0,</td></tr>
1952<tr><td class="num" id="LN1866">1866</td><td class="line"> cache != <span class='macro'>NULL<span class='expansion'>__null</span></span> ? cache-&gt;name : <span class='string_literal'>""</span>);</td></tr>
1953<tr><td class="num" id="LN1867">1867</td><td class="line"> } <span class='keyword'>else</span> <span class='keyword'>if</span> (reference != 1) {</td></tr>
1954<tr><td class="num" id="LN1868">1868</td><td class="line"> kprintf(<span class='string_literal'>"%5"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" %p raw allocation up to %p\n"</span>, i,</td></tr>
1955<tr><td class="num" id="LN1869">1869</td><td class="line"> (<span class='keyword'>void</span>*)_ChunkAddress(metaChunk, chunk), (<span class='keyword'>void</span>*)reference);</td></tr>
1956<tr><td class="num" id="LN1870">1870</td><td class="line"> }</td></tr>
1957<tr><td class="num" id="LN1871">1871</td><td class="line"> }</td></tr>
1958<tr><td class="num" id="LN1872">1872</td><td class="line">}</td></tr>
1959<tr><td class="num" id="LN1873">1873</td><td class="line"> </td></tr>
1960<tr><td class="num" id="LN1874">1874</td><td class="line"> </td></tr>
1961<tr><td class="num" id="LN1875">1875</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>int</span></td></tr>
1962<tr><td class="num" id="LN1876">1876</td><td class="line">MemoryManager::_DumpMetaChunk(<span class='keyword'>int</span> argc, <span class='keyword'>char</span>** argv)</td></tr>
1963<tr><td class="num" id="LN1877">1877</td><td class="line">{</td></tr>
1964<tr><td class="num" id="LN1878">1878</td><td class="line"> <span class='keyword'>if</span> (argc != 2) {</td></tr>
1965<tr><td class="num" id="LN1879">1879</td><td class="line"> print_debugger_command_usage(argv[0]);</td></tr>
1966<tr><td class="num" id="LN1880">1880</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
1967<tr><td class="num" id="LN1881">1881</td><td class="line"> }</td></tr>
1968<tr><td class="num" id="LN1882">1882</td><td class="line"> </td></tr>
1969<tr><td class="num" id="LN1883">1883</td><td class="line"> uint64 address;</td></tr>
1970<tr><td class="num" id="LN1884">1884</td><td class="line"> <span class='keyword'>if</span> (!evaluate_debug_expression(argv[1], &amp;address, <span class='keyword'>false</span>))</td></tr>
1971<tr><td class="num" id="LN1885">1885</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
1972<tr><td class="num" id="LN1886">1886</td><td class="line"> </td></tr>
1973<tr><td class="num" id="LN1887">1887</td><td class="line"> Area* area = _AreaForAddress(address);</td></tr>
1974<tr><td class="num" id="LN1888">1888</td><td class="line"> </td></tr>
1975<tr><td class="num" id="LN1889">1889</td><td class="line"> MetaChunk* metaChunk;</td></tr>
1976<tr><td class="num" id="LN1890">1890</td><td class="line"> <span class='keyword'>if</span> ((addr_t)address &gt;= (addr_t)area-&gt;metaChunks</td></tr>
1977<tr><td class="num" id="LN1891">1891</td><td class="line"> &amp;&amp; (addr_t)address</td></tr>
1978<tr><td class="num" id="LN1892">1892</td><td class="line"> &lt; (addr_t)(area-&gt;metaChunks + <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>)) {</td></tr>
1979<tr><td class="num" id="LN1893">1893</td><td class="line"> metaChunk = (MetaChunk*)(addr_t)address;</td></tr>
1980<tr><td class="num" id="LN1894">1894</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
1981<tr><td class="num" id="LN1895">1895</td><td class="line"> metaChunk = area-&gt;metaChunks</td></tr>
1982<tr><td class="num" id="LN1896">1896</td><td class="line"> + (address % <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span>) / <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>;</td></tr>
1983<tr><td class="num" id="LN1897">1897</td><td class="line"> }</td></tr>
1984<tr><td class="num" id="LN1898">1898</td><td class="line"> </td></tr>
1985<tr><td class="num" id="LN1899">1899</td><td class="line"> _DumpMetaChunk(metaChunk, <span class='keyword'>true</span>, <span class='keyword'>true</span>);</td></tr>
1986<tr><td class="num" id="LN1900">1900</td><td class="line"> </td></tr>
1987<tr><td class="num" id="LN1901">1901</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
1988<tr><td class="num" id="LN1902">1902</td><td class="line">}</td></tr>
1989<tr><td class="num" id="LN1903">1903</td><td class="line"> </td></tr>
1990<tr><td class="num" id="LN1904">1904</td><td class="line"> </td></tr>
1991<tr><td class="num" id="LN1905">1905</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>void</span></td></tr>
1992<tr><td class="num" id="LN1906">1906</td><td class="line">MemoryManager::_DumpMetaChunks(<span class='keyword'>const</span> <span class='keyword'>char</span>* name, MetaChunkList&amp; metaChunkList,</td></tr>
1993<tr><td class="num" id="LN1907">1907</td><td class="line"> <span class='keyword'>bool</span> printChunks)</td></tr>
1994<tr><td class="num" id="LN1908">1908</td><td class="line">{</td></tr>
1995<tr><td class="num" id="LN1909">1909</td><td class="line"> kprintf(<span class='string_literal'>"%s:\n"</span>, name);</td></tr>
1996<tr><td class="num" id="LN1910">1910</td><td class="line"> </td></tr>
1997<tr><td class="num" id="LN1911">1911</td><td class="line"> <span class='keyword'>for</span> (MetaChunkList::Iterator it = metaChunkList.GetIterator();</td></tr>
1998<tr><td class="num" id="LN1912">1912</td><td class="line"> MetaChunk* metaChunk = it.Next();) {</td></tr>
1999<tr><td class="num" id="LN1913">1913</td><td class="line"> _DumpMetaChunk(metaChunk, printChunks, <span class='keyword'>false</span>);</td></tr>
2000<tr><td class="num" id="LN1914">1914</td><td class="line"> }</td></tr>
2001<tr><td class="num" id="LN1915">1915</td><td class="line">}</td></tr>
2002<tr><td class="num" id="LN1916">1916</td><td class="line"> </td></tr>
2003<tr><td class="num" id="LN1917">1917</td><td class="line"> </td></tr>
2004<tr><td class="num" id="LN1918">1918</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>int</span></td></tr>
2005<tr><td class="num" id="LN1919">1919</td><td class="line">MemoryManager::_DumpMetaChunks(<span class='keyword'>int</span> argc, <span class='keyword'>char</span>** argv)</td></tr>
2006<tr><td class="num" id="LN1920">1920</td><td class="line">{</td></tr>
2007<tr><td class="num" id="LN1921">1921</td><td class="line"> <span class='keyword'>bool</span> printChunks = argc &gt; 1 &amp;&amp; strcmp(argv[1], <span class='string_literal'>"-c"</span>) == 0;</td></tr>
2008<tr><td class="num" id="LN1922">1922</td><td class="line"> </td></tr>
2009<tr><td class="num" id="LN1923">1923</td><td class="line"> _PrintMetaChunkTableHeader(printChunks);</td></tr>
2010<tr><td class="num" id="LN1924">1924</td><td class="line"> _DumpMetaChunks(<span class='string_literal'>"free complete"</span>, sFreeCompleteMetaChunks, printChunks);</td></tr>
2011<tr><td class="num" id="LN1925">1925</td><td class="line"> _DumpMetaChunks(<span class='string_literal'>"free short"</span>, sFreeShortMetaChunks, printChunks);</td></tr>
2012<tr><td class="num" id="LN1926">1926</td><td class="line"> _DumpMetaChunks(<span class='string_literal'>"partial small"</span>, sPartialMetaChunksSmall, printChunks);</td></tr>
2013<tr><td class="num" id="LN1927">1927</td><td class="line"> _DumpMetaChunks(<span class='string_literal'>"partial medium"</span>, sPartialMetaChunksMedium, printChunks);</td></tr>
2014<tr><td class="num" id="LN1928">1928</td><td class="line"> </td></tr>
2015<tr><td class="num" id="LN1929">1929</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2016<tr><td class="num" id="LN1930">1930</td><td class="line">}</td></tr>
2017<tr><td class="num" id="LN1931">1931</td><td class="line"> </td></tr>
2018<tr><td class="num" id="LN1932">1932</td><td class="line"> </td></tr>
2019<tr><td class="num" id="LN1933">1933</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>int</span></td></tr>
2020<tr><td class="num" id="LN1934">1934</td><td class="line">MemoryManager::_DumpArea(<span class='keyword'>int</span> argc, <span class='keyword'>char</span>** argv)</td></tr>
2021<tr><td class="num" id="LN1935">1935</td><td class="line">{</td></tr>
2022<tr><td class="num" id="LN1936">1936</td><td class="line"> <span class='keyword'>bool</span> printChunks = <span class='keyword'>false</span>;</td></tr>
2023<tr><td class="num" id="LN1937">1937</td><td class="line"> </td></tr>
2024<tr><td class="num" id="LN1938">1938</td><td class="line"> <span class='keyword'>int</span> argi = 1;</td></tr>
2025<tr><td class="num" id="LN1939">1939</td><td class="line"> <span class='keyword'>while</span> (argi &lt; argc) {</td></tr>
2026<tr><td class="num" id="LN1940">1940</td><td class="line"> <span class='keyword'>if</span> (argv[argi][0] != '-')</td></tr>
2027<tr><td class="num" id="LN1941">1941</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
2028<tr><td class="num" id="LN1942">1942</td><td class="line"> <span class='keyword'>const</span> <span class='keyword'>char</span>* arg = argv[argi++];</td></tr>
2029<tr><td class="num" id="LN1943">1943</td><td class="line"> <span class='keyword'>if</span> (strcmp(arg, <span class='string_literal'>"-c"</span>) == 0) {</td></tr>
2030<tr><td class="num" id="LN1944">1944</td><td class="line"> printChunks = <span class='keyword'>true</span>;</td></tr>
2031<tr><td class="num" id="LN1945">1945</td><td class="line"> } <span class='keyword'>else</span> {</td></tr>
2032<tr><td class="num" id="LN1946">1946</td><td class="line"> print_debugger_command_usage(argv[0]);</td></tr>
2033<tr><td class="num" id="LN1947">1947</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2034<tr><td class="num" id="LN1948">1948</td><td class="line"> }</td></tr>
2035<tr><td class="num" id="LN1949">1949</td><td class="line"> }</td></tr>
2036<tr><td class="num" id="LN1950">1950</td><td class="line"> </td></tr>
2037<tr><td class="num" id="LN1951">1951</td><td class="line"> <span class='keyword'>if</span> (argi + 1 != argc) {</td></tr>
2038<tr><td class="num" id="LN1952">1952</td><td class="line"> print_debugger_command_usage(argv[0]);</td></tr>
2039<tr><td class="num" id="LN1953">1953</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2040<tr><td class="num" id="LN1954">1954</td><td class="line"> }</td></tr>
2041<tr><td class="num" id="LN1955">1955</td><td class="line"> </td></tr>
2042<tr><td class="num" id="LN1956">1956</td><td class="line"> uint64 address;</td></tr>
2043<tr><td class="num" id="LN1957">1957</td><td class="line"> <span class='keyword'>if</span> (!evaluate_debug_expression(argv[argi], &amp;address, <span class='keyword'>false</span>))</td></tr>
2044<tr><td class="num" id="LN1958">1958</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2045<tr><td class="num" id="LN1959">1959</td><td class="line"> </td></tr>
2046<tr><td class="num" id="LN1960">1960</td><td class="line"> Area* area = _AreaForAddress((addr_t)address);</td></tr>
2047<tr><td class="num" id="LN1961">1961</td><td class="line"> </td></tr>
2048<tr><td class="num" id="LN1962">1962</td><td class="line"> <span class='keyword'>for</span> (uint32 k = 0; k &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; k++) {</td></tr>
2049<tr><td class="num" id="LN1963">1963</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + k;</td></tr>
2050<tr><td class="num" id="LN1964">1964</td><td class="line"> _DumpMetaChunk(metaChunk, printChunks, k == 0);</td></tr>
2051<tr><td class="num" id="LN1965">1965</td><td class="line"> }</td></tr>
2052<tr><td class="num" id="LN1966">1966</td><td class="line"> </td></tr>
2053<tr><td class="num" id="LN1967">1967</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2054<tr><td class="num" id="LN1968">1968</td><td class="line">}</td></tr>
2055<tr><td class="num" id="LN1969">1969</td><td class="line"> </td></tr>
2056<tr><td class="num" id="LN1970">1970</td><td class="line"> </td></tr>
2057<tr><td class="num" id="LN1971">1971</td><td class="line"><span class='comment'>/*static*/</span> <span class='keyword'>int</span></td></tr>
2058<tr><td class="num" id="LN1972">1972</td><td class="line">MemoryManager::_DumpAreas(<span class='keyword'>int</span> argc, <span class='keyword'>char</span>** argv)</td></tr>
2059<tr><td class="num" id="LN1973">1973</td><td class="line">{</td></tr>
2060<tr><td class="num" id="LN1974">1974</td><td class="line"> kprintf(<span class='string_literal'>" %*s %*s meta small medium large\n"</span>,</td></tr>
2061<tr><td class="num" id="LN1975">1975</td><td class="line"> <span class='macro'>B_PRINTF_POINTER_WIDTH<span class='expansion'>8</span></span>, <span class='string_literal'>"base"</span>, <span class='macro'>B_PRINTF_POINTER_WIDTH<span class='expansion'>8</span></span>, <span class='string_literal'>"area"</span>);</td></tr>
2062<tr><td class="num" id="LN1976">1976</td><td class="line"> </td></tr>
2063<tr><td class="num" id="LN1977">1977</td><td class="line"> size_t totalTotalSmall = 0;</td></tr>
2064<tr><td class="num" id="LN1978">1978</td><td class="line"> size_t totalUsedSmall = 0;</td></tr>
2065<tr><td class="num" id="LN1979">1979</td><td class="line"> size_t totalTotalMedium = 0;</td></tr>
2066<tr><td class="num" id="LN1980">1980</td><td class="line"> size_t totalUsedMedium = 0;</td></tr>
2067<tr><td class="num" id="LN1981">1981</td><td class="line"> size_t totalUsedLarge = 0;</td></tr>
2068<tr><td class="num" id="LN1982">1982</td><td class="line"> uint32 areaCount = 0;</td></tr>
2069<tr><td class="num" id="LN1983">1983</td><td class="line"> </td></tr>
2070<tr><td class="num" id="LN1984">1984</td><td class="line"> <span class='keyword'>for</span> (AreaTable::Iterator it = sAreaTable.GetIterator();</td></tr>
2071<tr><td class="num" id="LN1985">1985</td><td class="line"> Area* area = it.Next();) {</td></tr>
2072<tr><td class="num" id="LN1986">1986</td><td class="line"> areaCount++;</td></tr>
2073<tr><td class="num" id="LN1987">1987</td><td class="line"> </td></tr>
2074<tr><td class="num" id="LN1988">1988</td><td class="line"> <span class='comment'>// sum up the free/used counts for the chunk sizes</span></td></tr>
2075<tr><td class="num" id="LN1989">1989</td><td class="line"> <span class='keyword'>int</span> totalSmall = 0;</td></tr>
2076<tr><td class="num" id="LN1990">1990</td><td class="line"> <span class='keyword'>int</span> usedSmall = 0;</td></tr>
2077<tr><td class="num" id="LN1991">1991</td><td class="line"> <span class='keyword'>int</span> totalMedium = 0;</td></tr>
2078<tr><td class="num" id="LN1992">1992</td><td class="line"> <span class='keyword'>int</span> usedMedium = 0;</td></tr>
2079<tr><td class="num" id="LN1993">1993</td><td class="line"> <span class='keyword'>int</span> usedLarge = 0;</td></tr>
2080<tr><td class="num" id="LN1994">1994</td><td class="line"> </td></tr>
2081<tr><td class="num" id="LN1995">1995</td><td class="line"> <span class='keyword'>for</span> (int32 i = 0; i &lt; <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>; i++) {</td></tr>
2082<tr><td class="num" id="LN1996">1996</td><td class="line"> MetaChunk* metaChunk = area-&gt;metaChunks + i;</td></tr>
2083<tr><td class="num" id="LN1997">1997</td><td class="line"> <span class='keyword'>if</span> (metaChunk-&gt;chunkSize == 0)</td></tr>
2084<tr><td class="num" id="LN1998">1998</td><td class="line"> <span class='keyword'>continue</span>;</td></tr>
2085<tr><td class="num" id="LN1999">1999</td><td class="line"> </td></tr>
2086<tr><td class="num" id="LN2000">2000</td><td class="line"> <span class='keyword'>switch</span> (metaChunk-&gt;chunkSize) {</td></tr>
2087<tr><td class="num" id="LN2001">2001</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span>:</td></tr>
2088<tr><td class="num" id="LN2002">2002</td><td class="line"> totalSmall += metaChunk-&gt;chunkCount;</td></tr>
2089<tr><td class="num" id="LN2003">2003</td><td class="line"> usedSmall += metaChunk-&gt;usedChunkCount;</td></tr>
2090<tr><td class="num" id="LN2004">2004</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
2091<tr><td class="num" id="LN2005">2005</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span>:</td></tr>
2092<tr><td class="num" id="LN2006">2006</td><td class="line"> totalMedium += metaChunk-&gt;chunkCount;</td></tr>
2093<tr><td class="num" id="LN2007">2007</td><td class="line"> usedMedium += metaChunk-&gt;usedChunkCount;</td></tr>
2094<tr><td class="num" id="LN2008">2008</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
2095<tr><td class="num" id="LN2009">2009</td><td class="line"> <span class='keyword'>case</span> <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>:</td></tr>
2096<tr><td class="num" id="LN2010">2010</td><td class="line"> usedLarge += metaChunk-&gt;usedChunkCount;</td></tr>
2097<tr><td class="num" id="LN2011">2011</td><td class="line"> <span class='keyword'>break</span>;</td></tr>
2098<tr><td class="num" id="LN2012">2012</td><td class="line"> }</td></tr>
2099<tr><td class="num" id="LN2013">2013</td><td class="line"> }</td></tr>
2100<tr><td class="num" id="LN2014">2014</td><td class="line"> </td></tr>
2101<tr><td class="num" id="LN2015">2015</td><td class="line"> kprintf(<span class='string_literal'>"%p %p %2u/%2u %4d/%4d %3d/%3d %5d\n"</span>,</td></tr>
2102<tr><td class="num" id="LN2016">2016</td><td class="line"> area, area-&gt;vmArea, area-&gt;usedMetaChunkCount,</td></tr>
2103<tr><td class="num" id="LN2017">2017</td><td class="line"> <span class='macro'>SLAB_META_CHUNKS_PER_AREA<span class='expansion'>((2048 * 4096) / (128 * 4096))</span></span>, usedSmall, totalSmall, usedMedium,</td></tr>
2104<tr><td class="num" id="LN2018">2018</td><td class="line"> totalMedium, usedLarge);</td></tr>
2105<tr><td class="num" id="LN2019">2019</td><td class="line"> </td></tr>
2106<tr><td class="num" id="LN2020">2020</td><td class="line"> totalTotalSmall += totalSmall;</td></tr>
2107<tr><td class="num" id="LN2021">2021</td><td class="line"> totalUsedSmall += usedSmall;</td></tr>
2108<tr><td class="num" id="LN2022">2022</td><td class="line"> totalTotalMedium += totalMedium;</td></tr>
2109<tr><td class="num" id="LN2023">2023</td><td class="line"> totalUsedMedium += usedMedium;</td></tr>
2110<tr><td class="num" id="LN2024">2024</td><td class="line"> totalUsedLarge += usedLarge;</td></tr>
2111<tr><td class="num" id="LN2025">2025</td><td class="line"> }</td></tr>
2112<tr><td class="num" id="LN2026">2026</td><td class="line"> </td></tr>
2113<tr><td class="num" id="LN2027">2027</td><td class="line"> kprintf(<span class='string_literal'>"%d free area%s:\n"</span>, sFreeAreaCount,</td></tr>
2114<tr><td class="num" id="LN2028">2028</td><td class="line"> sFreeAreaCount == 1 ? <span class='string_literal'>""</span> : <span class='string_literal'>"s"</span>);</td></tr>
2115<tr><td class="num" id="LN2029">2029</td><td class="line"> <span class='keyword'>for</span> (Area* area = sFreeAreas; area != <span class='macro'>NULL<span class='expansion'>__null</span></span>; area = area-&gt;next) {</td></tr>
2116<tr><td class="num" id="LN2030">2030</td><td class="line"> areaCount++;</td></tr>
2117<tr><td class="num" id="LN2031">2031</td><td class="line"> kprintf(<span class='string_literal'>"%p %p\n"</span>, area, area-&gt;vmArea);</td></tr>
2118<tr><td class="num" id="LN2032">2032</td><td class="line"> }</td></tr>
2119<tr><td class="num" id="LN2033">2033</td><td class="line"> </td></tr>
2120<tr><td class="num" id="LN2034">2034</td><td class="line"> kprintf(<span class='string_literal'>"total usage:\n"</span>);</td></tr>
2121<tr><td class="num" id="LN2035">2035</td><td class="line"> kprintf(<span class='string_literal'>" small: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"/%"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"\n"</span>, totalUsedSmall,</td></tr>
2122<tr><td class="num" id="LN2036">2036</td><td class="line"> totalTotalSmall);</td></tr>
2123<tr><td class="num" id="LN2037">2037</td><td class="line"> kprintf(<span class='string_literal'>" medium: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"/%"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"\n"</span>, totalUsedMedium,</td></tr>
2124<tr><td class="num" id="LN2038">2038</td><td class="line"> totalTotalMedium);</td></tr>
2125<tr><td class="num" id="LN2039">2039</td><td class="line"> kprintf(<span class='string_literal'>" large: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"\n"</span>, totalUsedLarge);</td></tr>
2126<tr><td class="num" id="LN2040">2040</td><td class="line"> kprintf(<span class='string_literal'>" memory: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>"/%"</span> <span class='macro'>B_PRIu32<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" KB\n"</span>,</td></tr>
2127<tr><td class="num" id="LN2041">2041</td><td class="line"> (totalUsedSmall * <span class='macro'>SLAB_CHUNK_SIZE_SMALL<span class='expansion'>4096</span></span></td></tr>
2128<tr><td class="num" id="LN2042">2042</td><td class="line"> + totalUsedMedium * <span class='macro'>SLAB_CHUNK_SIZE_MEDIUM<span class='expansion'>(16 * 4096)</span></span></td></tr>
2129<tr><td class="num" id="LN2043">2043</td><td class="line"> + totalUsedLarge * <span class='macro'>SLAB_CHUNK_SIZE_LARGE<span class='expansion'>(128 * 4096)</span></span>) / 1024,</td></tr>
2130<tr><td class="num" id="LN2044">2044</td><td class="line"> areaCount * <span class='macro'>SLAB_AREA_SIZE<span class='expansion'>(2048 * 4096)</span></span> / 1024);</td></tr>
2131<tr><td class="num" id="LN2045">2045</td><td class="line"> kprintf(<span class='string_literal'>" overhead: %"</span> <span class='macro'>B_PRIuSIZE<span class='expansion'>"l" "u"</span></span> <span class='string_literal'>" KB\n"</span>,</td></tr>
2132<tr><td class="num" id="LN2046">2046</td><td class="line"> areaCount * kAreaAdminSize / 1024);</td></tr>
2133<tr><td class="num" id="LN2047">2047</td><td class="line"> </td></tr>
2134<tr><td class="num" id="LN2048">2048</td><td class="line"> <span class='keyword'>return</span> 0;</td></tr>
2135<tr><td class="num" id="LN2049">2049</td><td class="line">}</td></tr>
2136<tr><td class="num" id="LN2050">2050</td><td class="line"> </td></tr>
2137<tr><td class="num" id="LN2051">2051</td><td class="line"> </td></tr>
2138<tr><td class="num" id="LN2052">2052</td><td class="line"><span class='directive'>#if <span class='macro'>SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING<span class='expansion'>(0 != 0 &amp;&amp; SLAB_MEMORY_MANAGER_TRACING != 0 &amp;&amp;<br> SLAB_MEMORY_MANAGER_TRACING_STACK_TRACE &gt; 0)</span></span></span></td></tr>
2139<tr><td class="num" id="LN2053">2053</td><td class="line"> </td></tr>
2140<tr><td class="num" id="LN2054">2054</td><td class="line"><span class='keyword'>void</span></td></tr>
2141<tr><td class="num" id="LN2055">2055</td><td class="line">MemoryManager::_AddTrackingInfo(<span class='keyword'>void</span>* allocation, size_t size,</td></tr>
2142<tr><td class="num" id="LN2056">2056</td><td class="line"> AbstractTraceEntryWithStackTrace* traceEntry)</td></tr>
2143<tr><td class="num" id="LN2057">2057</td><td class="line">{</td></tr>
2144<tr><td class="num" id="LN2058">2058</td><td class="line"> _TrackingInfoFor(allocation, size)-&gt;Init(traceEntry);</td></tr>
2145<tr><td class="num" id="LN2059">2059</td><td class="line">}</td></tr>
2146<tr><td class="num" id="LN2060">2060</td><td class="line"> </td></tr>
2147<tr><td class="num" id="LN2061">2061</td><td class="line"><span class='directive'>#endif // SLAB_MEMORY_MANAGER_ALLOCATION_TRACKING</span></td></tr>
2148<tr><td class="num" id="LN2062">2062</td><td class="line"> </td></tr>
2149<tr><td class="num" id="LN2063">2063</td><td class="line"> </td></tr>
2150<tr><td class="num" id="LN2064">2064</td><td class="line"><span class='macro'>RANGE_MARKER_FUNCTION_END(SlabMemoryManager)<span class='expansion'>void SlabMemoryManager_end() {}</span></span></td></tr>
2151</table></body></html>