1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>LCOV - skiboot.info - core/buddy.c</title>
<link rel="stylesheet" type="text/css" href="../gcov.css">
</head>
<body>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="title">LCOV - code coverage report</td></tr>
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
<tr>
<td width="100%">
<table cellpadding=1 border=0 width="100%">
<tr>
<td width="10%" class="headerItem">Current view:</td>
<td width="35%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">core</a> - buddy.c<span style="font-size: 80%;"> (source / <a href="buddy.c.func-sort-c.html">functions</a>)</span></td>
<td width="5%"></td>
<td width="15%"></td>
<td width="10%" class="headerCovTableHead">Hit</td>
<td width="10%" class="headerCovTableHead">Total</td>
<td width="15%" class="headerCovTableHead">Coverage</td>
</tr>
<tr>
<td class="headerItem">Test:</td>
<td class="headerValue">skiboot.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">95</td>
<td class="headerCovTableEntry">96</td>
<td class="headerCovTableEntryHi">99.0 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2023-02-27 20:17:50</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntry">12</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr>
<td></td>
<td></td>
<td></td>
<td class="headerItem">Branches:</td>
<td class="headerCovTableEntry">0</td>
<td class="headerCovTableEntry">0</td>
<td class="headerCovTableEntryHi">-</td>
</tr>
<tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr>
</table>
</td>
</tr>
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
</table>
<table cellpadding=0 cellspacing=0 border=0>
<tr>
<td><br></td>
</tr>
<tr>
<td>
<pre class="sourceHeading"> Branch data Line data Source code</pre>
<pre class="source">
<a name="1"><span class="lineNum"> 1 </span> : : // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later</a>
<a name="2"><span class="lineNum"> 2 </span> : : /* Copyright 2016-2017 IBM Corp. */</a>
<a name="3"><span class="lineNum"> 3 </span> : : </a>
<a name="4"><span class="lineNum"> 4 </span> : : #include <assert.h></a>
<a name="5"><span class="lineNum"> 5 </span> : : #include <stdlib.h></a>
<a name="6"><span class="lineNum"> 6 </span> : : #include <string.h></a>
<a name="7"><span class="lineNum"> 7 </span> : : #include <stdio.h></a>
<a name="8"><span class="lineNum"> 8 </span> : : </a>
<a name="9"><span class="lineNum"> 9 </span> : : #include "buddy.h"</a>
<a name="10"><span class="lineNum"> 10 </span> : : </a>
<a name="11"><span class="lineNum"> 11 </span> : : #define BUDDY_DEBUG</a>
<a name="12"><span class="lineNum"> 12 </span> : : #undef BUDDY_VERBOSE</a>
<a name="13"><span class="lineNum"> 13 </span> : : </a>
<a name="14"><span class="lineNum"> 14 </span> : : #ifdef BUDDY_VERBOSE</a>
<a name="15"><span class="lineNum"> 15 </span> : : #define BUDDY_NOISE(fmt...) printf(fmt)</a>
<a name="16"><span class="lineNum"> 16 </span> : : #else</a>
<a name="17"><span class="lineNum"> 17 </span> : : #define BUDDY_NOISE(fmt...) do { } while(0)</a>
<a name="18"><span class="lineNum"> 18 </span> : : #endif</a>
<a name="19"><span class="lineNum"> 19 </span> : : </a>
<a name="20"><span class="lineNum"> 20 </span> :<span class="lineCov"> 632 : static inline unsigned int buddy_map_size(struct buddy *b)</span></a>
<a name="21"><span class="lineNum"> 21 </span> : : {</a>
<a name="22"><span class="lineNum"> 22 </span> :<span class="lineCov"> 632 : return 1u << (b->max_order + 1);</span></a>
<a name="23"><span class="lineNum"> 23 </span> : : }</a>
<a name="24"><span class="lineNum"> 24 </span> : : </a>
<a name="25"><span class="lineNum"> 25 </span> :<span class="lineCov"> 33 : static inline unsigned int buddy_order_start(struct buddy *b,</span></a>
<a name="26"><span class="lineNum"> 26 </span> : : unsigned int order)</a>
<a name="27"><span class="lineNum"> 27 </span> : : {</a>
<a name="28"><span class="lineNum"> 28 </span> :<span class="lineCov"> 33 : unsigned int level = b->max_order - order;</span></a>
<a name="29"><span class="lineNum"> 29 </span> : : </a>
<a name="30"><span class="lineNum"> 30 </span> : : /* Starting bit of index for order */</a>
<a name="31"><span class="lineNum"> 31 </span> :<span class="lineCov"> 33 : return 1u << level;</span></a>
<a name="32"><span class="lineNum"> 32 </span> : : }</a>
<a name="33"><span class="lineNum"> 33 </span> : : </a>
<a name="34"><span class="lineNum"> 34 </span> :<span class="lineCov"> 15 : static inline unsigned int buddy_index_to_node(struct buddy *b,</span></a>
<a name="35"><span class="lineNum"> 35 </span> : : unsigned int index,</a>
<a name="36"><span class="lineNum"> 36 </span> : : unsigned int order)</a>
<a name="37"><span class="lineNum"> 37 </span> : : {</a>
<a name="38"><span class="lineNum"> 38 </span> : : /* Ensure the index is a multiple of the order */</a>
<a name="39"><span class="lineNum"> 39 </span> :<span class="lineCov"> 15 : assert((index & ((1u << order) - 1)) == 0);</span></a>
<a name="40"><span class="lineNum"> 40 </span> : : </a>
<a name="41"><span class="lineNum"> 41 </span> :<span class="lineCov"> 15 : return buddy_order_start(b, order) + (index >> order);</span></a>
<a name="42"><span class="lineNum"> 42 </span> : : }</a>
<a name="43"><span class="lineNum"> 43 </span> : : </a>
<a name="44"><span class="lineNum"> 44 </span> :<span class="lineCov"> 9 : static inline unsigned int buddy_node_to_index(struct buddy *b,</span></a>
<a name="45"><span class="lineNum"> 45 </span> : : unsigned int node,</a>
<a name="46"><span class="lineNum"> 46 </span> : : unsigned int order)</a>
<a name="47"><span class="lineNum"> 47 </span> : : {</a>
<a name="48"><span class="lineNum"> 48 </span> :<span class="lineCov"> 9 : unsigned int start = buddy_order_start(b, order);</span></a>
<a name="49"><span class="lineNum"> 49 </span> : : </a>
<a name="50"><span class="lineNum"> 50 </span> :<span class="lineCov"> 9 : return (node - start) << order;</span></a>
<a name="51"><span class="lineNum"> 51 </span> : : }</a>
<a name="52"><span class="lineNum"> 52 </span> : : </a>
<a name="53"><span class="lineNum"> 53 </span> : : #ifdef BUDDY_DEBUG</a>
<a name="54"><span class="lineNum"> 54 </span> :<span class="lineCov"> 1592 : static void buddy_check_alloc(struct buddy *b, unsigned int node)</span></a>
<a name="55"><span class="lineNum"> 55 </span> : : {</a>
<a name="56"><span class="lineNum"> 56 </span> :<span class="lineCov"> 1592 : assert(bitmap_tst_bit(b->map, node));</span></a>
<a name="57"><span class="lineNum"> 57 </span> :<span class="lineCov"> 1592 : }</span></a>
<a name="58"><span class="lineNum"> 58 </span> : : </a>
<a name="59"><span class="lineNum"> 59 </span> :<span class="lineCov"> 23 : static void buddy_check_alloc_down(struct buddy *b, unsigned int node)</span></a>
<a name="60"><span class="lineNum"> 60 </span> : : {</a>
<a name="61"><span class="lineNum"> 61 </span> :<span class="lineCov"> 23 : unsigned int i, count = 1;</span></a>
<a name="62"><span class="lineNum"> 62 </span> : : </a>
<a name="63"><span class="lineNum"> 63 </span> :<span class="lineCov"> 121 : while (node < buddy_map_size(b)) {</span></a>
<a name="64"><span class="lineNum"> 64 </span> :<span class="lineCov"> 1675 : for (i = 0; i < count; i++)</span></a>
<a name="65"><span class="lineNum"> 65 </span> :<span class="lineCov"> 1577 : buddy_check_alloc(b, node + i);</span></a>
<a name="66"><span class="lineNum"> 66 </span> : : </a>
<a name="67"><span class="lineNum"> 67 </span> : : /* Down one level */</a>
<a name="68"><span class="lineNum"> 68 </span> :<span class="lineCov"> 98 : node <<= 1;</span></a>
<a name="69"><span class="lineNum"> 69 </span> :<span class="lineCov"> 98 : count <<= 1;</span></a>
<a name="70"><span class="lineNum"> 70 </span> : : }</a>
<a name="71"><span class="lineNum"> 71 </span> :<span class="lineCov"> 23 : }</span></a>
<a name="72"><span class="lineNum"> 72 </span> : : #else</a>
<a name="73"><span class="lineNum"> 73 </span> : : static inline void buddy_check_alloc(struct buddy *b __unused, unsigned int node __unused) {}</a>
<a name="74"><span class="lineNum"> 74 </span> : : static inline void buddy_check_alloc_down(struct buddy *b __unused, unsigned int node __unused) {}</a>
<a name="75"><span class="lineNum"> 75 </span> : : #endif</a>
<a name="76"><span class="lineNum"> 76 </span> : : </a>
<a name="77"><span class="lineNum"> 77 </span> :<span class="lineCov"> 10 : int buddy_alloc(struct buddy *b, unsigned int order)</span></a>
<a name="78"><span class="lineNum"> 78 </span> : : {</a>
<a name="79"><span class="lineNum"> 79 </span> : : unsigned int o;</a>
<a name="80"><span class="lineNum"> 80 </span> : : int node, index;</a>
<a name="81"><span class="lineNum"> 81 </span> : : </a>
<a name="82"><span class="lineNum"> 82 </span> : : BUDDY_NOISE("buddy_alloc(%d)\n", order);</a>
<a name="83"><span class="lineNum"> 83 </span> : : /*</a>
<a name="84"><span class="lineNum"> 84 </span> : : * Find the first order up the tree from our requested order that</a>
<a name="85"><span class="lineNum"> 85 </span> : : * has at least one free node.</a>
<a name="86"><span class="lineNum"> 86 </span> : : */</a>
<a name="87"><span class="lineNum"> 87 </span> :<span class="lineCov"> 16 : for (o = order; o <= b->max_order; o++) {</span></a>
<a name="88"><span class="lineNum"> 88 </span> :<span class="lineCov"> 15 : if (b->freecounts[o] > 0)</span></a>
<a name="89"><span class="lineNum"> 89 </span> :<span class="lineCov"> 9 : break;</span></a>
<a name="90"><span class="lineNum"> 90 </span> : : }</a>
<a name="91"><span class="lineNum"> 91 </span> : : </a>
<a name="92"><span class="lineNum"> 92 </span> : : /* Nothing found ? fail */</a>
<a name="93"><span class="lineNum"> 93 </span> :<span class="lineCov"> 10 : if (o > b->max_order) {</span></a>
<a name="94"><span class="lineNum"> 94 </span> : : BUDDY_NOISE(" no free nodes !\n");</a>
<a name="95"><span class="lineNum"> 95 </span> :<span class="lineCov"> 1 : return -1;</span></a>
<a name="96"><span class="lineNum"> 96 </span> : : }</a>
<a name="97"><span class="lineNum"> 97 </span> : : </a>
<a name="98"><span class="lineNum"> 98 </span> : : BUDDY_NOISE(" %d free node(s) at order %d, bits %d(%d)\n",</a>
<a name="99"><span class="lineNum"> 99 </span> : : b->freecounts[o], o,</a>
<a name="100"><span class="lineNum"> 100 </span> : : buddy_order_start(b, o),</a>
<a name="101"><span class="lineNum"> 101 </span> : : 1u << (b->max_order - o));</a>
<a name="102"><span class="lineNum"> 102 </span> : : </a>
<a name="103"><span class="lineNum"> 103 </span> : : /* Now find a free node */</a>
<a name="104"><span class="lineNum"> 104 </span> :<span class="lineCov"> 9 : node = bitmap_find_zero_bit(b->map, buddy_order_start(b, o),</span></a>
<a name="105"><span class="lineNum"> 105 </span> :<span class="lineCov"> 9 : 1u << (b->max_order - o));</span></a>
<a name="106"><span class="lineNum"> 106 </span> : : </a>
<a name="107"><span class="lineNum"> 107 </span> : : /* There should always be one */</a>
<a name="108"><span class="lineNum"> 108 </span> :<span class="lineCov"> 9 : assert(node >= 0);</span></a>
<a name="109"><span class="lineNum"> 109 </span> : : </a>
<a name="110"><span class="lineNum"> 110 </span> : : /* Mark it allocated and decrease free count */</a>
<a name="111"><span class="lineNum"> 111 </span> :<span class="lineCov"> 9 : bitmap_set_bit(b->map, node);</span></a>
<a name="112"><span class="lineNum"> 112 </span> :<span class="lineCov"> 9 : b->freecounts[o]--;</span></a>
<a name="113"><span class="lineNum"> 113 </span> : : </a>
<a name="114"><span class="lineNum"> 114 </span> : : /* We know that node was free which means all its children must have</a>
<a name="115"><span class="lineNum"> 115 </span> : : * been marked "allocated". Double check.</a>
<a name="116"><span class="lineNum"> 116 </span> : : */</a>
<a name="117"><span class="lineNum"> 117 </span> :<span class="lineCov"> 9 : buddy_check_alloc_down(b, node);</span></a>
<a name="118"><span class="lineNum"> 118 </span> : : </a>
<a name="119"><span class="lineNum"> 119 </span> : : /* We have a node, we've marked it allocated, now we need to go down</a>
<a name="120"><span class="lineNum"> 120 </span> : : * the tree until we reach "order" which is the order we need. For</a>
<a name="121"><span class="lineNum"> 121 </span> : : * each level along the way, we mark the buddy free and leave the</a>
<a name="122"><span class="lineNum"> 122 </span> : : * first child allocated.</a>
<a name="123"><span class="lineNum"> 123 </span> : : */</a>
<a name="124"><span class="lineNum"> 124 </span> :<span class="lineCov"> 14 : while (o > order) {</span></a>
<a name="125"><span class="lineNum"> 125 </span> : : /* Next level down */</a>
<a name="126"><span class="lineNum"> 126 </span> :<span class="lineCov"> 5 : o--;</span></a>
<a name="127"><span class="lineNum"> 127 </span> :<span class="lineCov"> 5 : node <<= 1;</span></a>
<a name="128"><span class="lineNum"> 128 </span> : : </a>
<a name="129"><span class="lineNum"> 129 </span> : : BUDDY_NOISE(" order %d, using %d marking %d free\n",</a>
<a name="130"><span class="lineNum"> 130 </span> : : o, node, node ^ 1);</a>
<a name="131"><span class="lineNum"> 131 </span> :<span class="lineCov"> 5 : bitmap_clr_bit(b->map, node ^ 1);</span></a>
<a name="132"><span class="lineNum"> 132 </span> :<span class="lineCov"> 5 : b->freecounts[o]++;</span></a>
<a name="133"><span class="lineNum"> 133 </span> :<span class="lineCov"> 5 : assert(bitmap_tst_bit(b->map, node));</span></a>
<a name="134"><span class="lineNum"> 134 </span> : : }</a>
<a name="135"><span class="lineNum"> 135 </span> : : </a>
<a name="136"><span class="lineNum"> 136 </span> :<span class="lineCov"> 9 : index = buddy_node_to_index(b, node, order);</span></a>
<a name="137"><span class="lineNum"> 137 </span> : : </a>
<a name="138"><span class="lineNum"> 138 </span> : : BUDDY_NOISE(" result is index %d (node %d)\n", index, node);</a>
<a name="139"><span class="lineNum"> 139 </span> : : </a>
<a name="140"><span class="lineNum"> 140 </span> : : /* We have a node, convert it to an element number */</a>
<a name="141"><span class="lineNum"> 141 </span> :<span class="lineCov"> 9 : return index;</span></a>
<a name="142"><span class="lineNum"> 142 </span> : : }</a>
<a name="143"><span class="lineNum"> 143 </span> : : </a>
<a name="144"><span class="lineNum"> 144 </span> :<span class="lineCov"> 3 : bool buddy_reserve(struct buddy *b, unsigned int index, unsigned int order)</span></a>
<a name="145"><span class="lineNum"> 145 </span> : : {</a>
<a name="146"><span class="lineNum"> 146 </span> : : unsigned int node, freenode, o;</a>
<a name="147"><span class="lineNum"> 147 </span> : : </a>
<a name="148"><span class="lineNum"> 148 </span> :<span class="lineCov"> 3 : assert(index < (1u << b->max_order));</span></a>
<a name="149"><span class="lineNum"> 149 </span> : : </a>
<a name="150"><span class="lineNum"> 150 </span> : : BUDDY_NOISE("buddy_reserve(%d,%d)\n", index, order);</a>
<a name="151"><span class="lineNum"> 151 </span> : : </a>
<a name="152"><span class="lineNum"> 152 </span> : : /* Get bit number for node */</a>
<a name="153"><span class="lineNum"> 153 </span> :<span class="lineCov"> 3 : node = buddy_index_to_node(b, index, order);</span></a>
<a name="154"><span class="lineNum"> 154 </span> : : </a>
<a name="155"><span class="lineNum"> 155 </span> : : BUDDY_NOISE(" node=%d\n", node);</a>
<a name="156"><span class="lineNum"> 156 </span> : : </a>
<a name="157"><span class="lineNum"> 157 </span> : : /* Find something free */</a>
<a name="158"><span class="lineNum"> 158 </span> :<span class="lineCov"> 18 : for (freenode = node, o = order; freenode > 0; freenode >>= 1, o++)</span></a>
<a name="159"><span class="lineNum"> 159 </span> :<span class="lineCov"> 17 : if (!bitmap_tst_bit(b->map, freenode))</span></a>
<a name="160"><span class="lineNum"> 160 </span> :<span class="lineCov"> 2 : break;</span></a>
<a name="161"><span class="lineNum"> 161 </span> : : </a>
<a name="162"><span class="lineNum"> 162 </span> : : BUDDY_NOISE(" freenode=%d order %d\n", freenode, o);</a>
<a name="163"><span class="lineNum"> 163 </span> : : </a>
<a name="164"><span class="lineNum"> 164 </span> : : /* Nothing free, error out */</a>
<a name="165"><span class="lineNum"> 165 </span> :<span class="lineCov"> 3 : if (!freenode)</span></a>
<a name="166"><span class="lineNum"> 166 </span> :<span class="lineCov"> 1 : return false;</span></a>
<a name="167"><span class="lineNum"> 167 </span> : : </a>
<a name="168"><span class="lineNum"> 168 </span> : : /* We sit on a free node, mark it busy */</a>
<a name="169"><span class="lineNum"> 169 </span> :<span class="lineCov"> 2 : bitmap_set_bit(b->map, freenode);</span></a>
<a name="170"><span class="lineNum"> 170 </span> :<span class="lineCov"> 2 : assert(b->freecounts[o]);</span></a>
<a name="171"><span class="lineNum"> 171 </span> :<span class="lineCov"> 2 : b->freecounts[o]--;</span></a>
<a name="172"><span class="lineNum"> 172 </span> : : </a>
<a name="173"><span class="lineNum"> 173 </span> : : /* We know that node was free which means all its children must have</a>
<a name="174"><span class="lineNum"> 174 </span> : : * been marked "allocated". Double check.</a>
<a name="175"><span class="lineNum"> 175 </span> : : */</a>
<a name="176"><span class="lineNum"> 176 </span> :<span class="lineCov"> 2 : buddy_check_alloc_down(b, freenode);</span></a>
<a name="177"><span class="lineNum"> 177 </span> : : </a>
<a name="178"><span class="lineNum"> 178 </span> : : /* Reverse-walk the path and break down nodes */</a>
<a name="179"><span class="lineNum"> 179 </span> :<span class="lineCov"> 12 : while (o > order) {</span></a>
<a name="180"><span class="lineNum"> 180 </span> : : /* Next level down */</a>
<a name="181"><span class="lineNum"> 181 </span> :<span class="lineCov"> 10 : o--;</span></a>
<a name="182"><span class="lineNum"> 182 </span> :<span class="lineCov"> 10 : freenode <<= 1;</span></a>
<a name="183"><span class="lineNum"> 183 </span> : : </a>
<a name="184"><span class="lineNum"> 184 </span> : : /* Find the right one on the path to node */</a>
<a name="185"><span class="lineNum"> 185 </span> :<span class="lineCov"> 10 : if (node & (1u << (o - order)))</span></a>
<a name="186"><span class="lineNum"> 186 </span> :<span class="lineCov"> 7 : freenode++;</span></a>
<a name="187"><span class="lineNum"> 187 </span> : : </a>
<a name="188"><span class="lineNum"> 188 </span> : : BUDDY_NOISE(" order %d, using %d marking %d free\n",</a>
<a name="189"><span class="lineNum"> 189 </span> : : o, freenode, freenode ^ 1);</a>
<a name="190"><span class="lineNum"> 190 </span> :<span class="lineCov"> 10 : bitmap_clr_bit(b->map, freenode ^ 1);</span></a>
<a name="191"><span class="lineNum"> 191 </span> :<span class="lineCov"> 10 : b->freecounts[o]++;</span></a>
<a name="192"><span class="lineNum"> 192 </span> :<span class="lineCov"> 10 : assert(bitmap_tst_bit(b->map, node));</span></a>
<a name="193"><span class="lineNum"> 193 </span> : : }</a>
<a name="194"><span class="lineNum"> 194 </span> :<span class="lineCov"> 2 : assert(node == freenode);</span></a>
<a name="195"><span class="lineNum"> 195 </span> : : </a>
<a name="196"><span class="lineNum"> 196 </span> :<span class="lineCov"> 2 : return true;</span></a>
<a name="197"><span class="lineNum"> 197 </span> : : }</a>
<a name="198"><span class="lineNum"> 198 </span> : : </a>
<a name="199"><span class="lineNum"> 199 </span> :<span class="lineCov"> 12 : void buddy_free(struct buddy *b, unsigned int index, unsigned int order)</span></a>
<a name="200"><span class="lineNum"> 200 </span> : : {</a>
<a name="201"><span class="lineNum"> 201 </span> : : unsigned int node;</a>
<a name="202"><span class="lineNum"> 202 </span> : : </a>
<a name="203"><span class="lineNum"> 203 </span> :<span class="lineCov"> 12 : assert(index < (1u << b->max_order));</span></a>
<a name="204"><span class="lineNum"> 204 </span> : : </a>
<a name="205"><span class="lineNum"> 205 </span> : : BUDDY_NOISE("buddy_free(%d,%d)\n", index, order);</a>
<a name="206"><span class="lineNum"> 206 </span> : : </a>
<a name="207"><span class="lineNum"> 207 </span> : : /* Get bit number for node */</a>
<a name="208"><span class="lineNum"> 208 </span> :<span class="lineCov"> 12 : node = buddy_index_to_node(b, index, order);</span></a>
<a name="209"><span class="lineNum"> 209 </span> : : </a>
<a name="210"><span class="lineNum"> 210 </span> : : BUDDY_NOISE(" node=%d\n", node);</a>
<a name="211"><span class="lineNum"> 211 </span> : : </a>
<a name="212"><span class="lineNum"> 212 </span> : : /* We assume that anything freed was fully allocated, ie,</a>
<a name="213"><span class="lineNum"> 213 </span> : : * there is no child node of that allocation index/order</a>
<a name="214"><span class="lineNum"> 214 </span> : : * that is already free.</a>
<a name="215"><span class="lineNum"> 215 </span> : : *</a>
<a name="216"><span class="lineNum"> 216 </span> : : * BUDDY_DEBUG will verify it at the cost of performances</a>
<a name="217"><span class="lineNum"> 217 </span> : : */</a>
<a name="218"><span class="lineNum"> 218 </span> :<span class="lineCov"> 12 : buddy_check_alloc_down(b, node);</span></a>
<a name="219"><span class="lineNum"> 219 </span> : : </a>
<a name="220"><span class="lineNum"> 220 </span> : : /* Propagate if buddy is free */</a>
<a name="221"><span class="lineNum"> 221 </span> :<span class="lineCov"> 27 : while (order < b->max_order && !bitmap_tst_bit(b->map, node ^ 1)) {</span></a>
<a name="222"><span class="lineNum"> 222 </span> : : BUDDY_NOISE(" order %d node %d buddy %d free, propagating\n",</a>
<a name="223"><span class="lineNum"> 223 </span> : : order, node, node ^ 1);</a>
<a name="224"><span class="lineNum"> 224 </span> : : </a>
<a name="225"><span class="lineNum"> 225 </span> : : /* Mark buddy busy (we are already marked busy) */</a>
<a name="226"><span class="lineNum"> 226 </span> :<span class="lineCov"> 15 : bitmap_set_bit(b->map, node ^ 1);</span></a>
<a name="227"><span class="lineNum"> 227 </span> : : </a>
<a name="228"><span class="lineNum"> 228 </span> : : /* Reduce free count */</a>
<a name="229"><span class="lineNum"> 229 </span> :<span class="lineCov"> 15 : assert(b->freecounts[order] > 0);</span></a>
<a name="230"><span class="lineNum"> 230 </span> :<span class="lineCov"> 15 : b->freecounts[order]--;</span></a>
<a name="231"><span class="lineNum"> 231 </span> : : </a>
<a name="232"><span class="lineNum"> 232 </span> : : /* Get parent */</a>
<a name="233"><span class="lineNum"> 233 </span> :<span class="lineCov"> 15 : node >>= 1;</span></a>
<a name="234"><span class="lineNum"> 234 </span> :<span class="lineCov"> 15 : order++;</span></a>
<a name="235"><span class="lineNum"> 235 </span> : : </a>
<a name="236"><span class="lineNum"> 236 </span> : : /* It must be busy already ! */</a>
<a name="237"><span class="lineNum"> 237 </span> :<span class="lineCov"> 15 : buddy_check_alloc(b, node);</span></a>
<a name="238"><span class="lineNum"> 238 </span> : : </a>
<a name="239"><span class="lineNum"> 239 </span> : : BUDDY_NOISE(" testing order %d node %d\n", order, node ^ 1);</a>
<a name="240"><span class="lineNum"> 240 </span> : : }</a>
<a name="241"><span class="lineNum"> 241 </span> : : </a>
<a name="242"><span class="lineNum"> 242 </span> : : /* No more coalescing, mark it free */</a>
<a name="243"><span class="lineNum"> 243 </span> :<span class="lineCov"> 12 : bitmap_clr_bit(b->map, node);</span></a>
<a name="244"><span class="lineNum"> 244 </span> : : </a>
<a name="245"><span class="lineNum"> 245 </span> : : /* Increase the freelist count for that level */</a>
<a name="246"><span class="lineNum"> 246 </span> :<span class="lineCov"> 12 : b->freecounts[order]++;</span></a>
<a name="247"><span class="lineNum"> 247 </span> : : </a>
<a name="248"><span class="lineNum"> 248 </span> : : BUDDY_NOISE(" free count at order %d is %d\n",</a>
<a name="249"><span class="lineNum"> 249 </span> : : order, b->freecounts[order]);</a>
<a name="250"><span class="lineNum"> 250 </span> :<span class="lineCov"> 12 : }</span></a>
<a name="251"><span class="lineNum"> 251 </span> : : </a>
<a name="252"><span class="lineNum"> 252 </span> :<span class="lineCov"> 1 : void buddy_reset(struct buddy *b)</span></a>
<a name="253"><span class="lineNum"> 253 </span> : : {</a>
<a name="254"><span class="lineNum"> 254 </span> :<span class="lineCov"> 1 : unsigned int bsize = BITMAP_BYTES(1u << (b->max_order + 1));</span></a>
<a name="255"><span class="lineNum"> 255 </span> : : </a>
<a name="256"><span class="lineNum"> 256 </span> : : BUDDY_NOISE("buddy_reset()\n");</a>
<a name="257"><span class="lineNum"> 257 </span> : : /* We fill the bitmap with 1's to make it completely "busy" */</a>
<a name="258"><span class="lineNum"> 258 </span> :<span class="lineCov"> 1 : memset(b->map, 0xff, bsize);</span></a>
<a name="259"><span class="lineNum"> 259 </span> :<span class="lineCov"> 1 : memset(b->freecounts, 0, sizeof(b->freecounts));</span></a>
<a name="260"><span class="lineNum"> 260 </span> : : </a>
<a name="261"><span class="lineNum"> 261 </span> : : /* We mark the root of the tree free, this is entry 1 as entry 0</a>
<a name="262"><span class="lineNum"> 262 </span> : : * is unused.</a>
<a name="263"><span class="lineNum"> 263 </span> : : */</a>
<a name="264"><span class="lineNum"> 264 </span> :<span class="lineCov"> 1 : buddy_free(b, 0, b->max_order);</span></a>
<a name="265"><span class="lineNum"> 265 </span> :<span class="lineCov"> 1 : }</span></a>
<a name="266"><span class="lineNum"> 266 </span> : : </a>
<a name="267"><span class="lineNum"> 267 </span> :<span class="lineCov"> 1 : struct buddy *buddy_create(unsigned int max_order)</span></a>
<a name="268"><span class="lineNum"> 268 </span> : : {</a>
<a name="269"><span class="lineNum"> 269 </span> : : struct buddy *b;</a>
<a name="270"><span class="lineNum"> 270 </span> : : unsigned int bsize;</a>
<a name="271"><span class="lineNum"> 271 </span> : : </a>
<a name="272"><span class="lineNum"> 272 </span> :<span class="lineCov"> 1 : assert(max_order <= BUDDY_MAX_ORDER);</span></a>
<a name="273"><span class="lineNum"> 273 </span> : : </a>
<a name="274"><span class="lineNum"> 274 </span> :<span class="lineCov"> 1 : bsize = BITMAP_BYTES(1u << (max_order + 1));</span></a>
<a name="275"><span class="lineNum"> 275 </span> : : </a>
<a name="276"><span class="lineNum"> 276 </span> :<span class="lineCov"> 1 : b = zalloc(sizeof(struct buddy) + bsize);</span></a>
<a name="277"><span class="lineNum"> 277 </span> :<span class="lineCov"> 1 : if (!b)</span></a>
<a name="278"><span class="lineNum"> 278 </span> :<span class="lineNoCov"> 0 : return NULL;</span></a>
<a name="279"><span class="lineNum"> 279 </span> :<span class="lineCov"> 1 : b->max_order = max_order;</span></a>
<a name="280"><span class="lineNum"> 280 </span> : : </a>
<a name="281"><span class="lineNum"> 281 </span> : : BUDDY_NOISE("Map @%p, size: %d bytes\n", b->map, bsize);</a>
<a name="282"><span class="lineNum"> 282 </span> : : </a>
<a name="283"><span class="lineNum"> 283 </span> :<span class="lineCov"> 1 : buddy_reset(b);</span></a>
<a name="284"><span class="lineNum"> 284 </span> : : </a>
<a name="285"><span class="lineNum"> 285 </span> :<span class="lineCov"> 1 : return b;</span></a>
<a name="286"><span class="lineNum"> 286 </span> : : }</a>
<a name="287"><span class="lineNum"> 287 </span> : : </a>
<a name="288"><span class="lineNum"> 288 </span> :<span class="lineCov"> 1 : void buddy_destroy(struct buddy *b)</span></a>
<a name="289"><span class="lineNum"> 289 </span> : : {</a>
<a name="290"><span class="lineNum"> 290 </span> :<span class="lineCov"> 1 : free(b);</span></a>
<a name="291"><span class="lineNum"> 291 </span> :<span class="lineCov"> 1 : }</span></a>
<a name="292"><span class="lineNum"> 292 </span> : : </a>
</pre>
</td>
</tr>
</table>
<br>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr>
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.14</a></td></tr>
</table>
<br>
</body>
</html>
|
