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
|
<!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/test/run-mem_range_is_reserved.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/test</a> - run-mem_range_is_reserved.c<span style="font-size: 80%;"> (source / <a href="run-mem_range_is_reserved.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">51</td>
<td class="headerCovTableEntry">57</td>
<td class="headerCovTableEntryMed">89.5 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2023-10-11 21:12:14</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">9</td>
<td class="headerCovTableEntry">9</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> : : /*</a>
<a name="3"><span class="lineNum"> 3 </span> : : * Copyright 2015-2019 IBM Corp.</a>
<a name="4"><span class="lineNum"> 4 </span> : : */</a>
<a name="5"><span class="lineNum"> 5 </span> : : </a>
<a name="6"><span class="lineNum"> 6 </span> : : #include <config.h></a>
<a name="7"><span class="lineNum"> 7 </span> : : </a>
<a name="8"><span class="lineNum"> 8 </span> : : /* The lock backtrace structures consume too much room on the skiboot heap */</a>
<a name="9"><span class="lineNum"> 9 </span> : : #undef DEBUG_LOCKS_BACKTRACE</a>
<a name="10"><span class="lineNum"> 10 </span> : : </a>
<a name="11"><span class="lineNum"> 11 </span> : : #define BITS_PER_LONG (sizeof(long) * 8)</a>
<a name="12"><span class="lineNum"> 12 </span> : : </a>
<a name="13"><span class="lineNum"> 13 </span> : : #include "dummy-cpu.h"</a>
<a name="14"><span class="lineNum"> 14 </span> : : </a>
<a name="15"><span class="lineNum"> 15 </span> : : #include <stdlib.h></a>
<a name="16"><span class="lineNum"> 16 </span> : : </a>
<a name="17"><span class="lineNum"> 17 </span> :<span class="lineCov"> 2 : static void *real_malloc(size_t size)</span></a>
<a name="18"><span class="lineNum"> 18 </span> : : {</a>
<a name="19"><span class="lineNum"> 19 </span> :<span class="lineCov"> 2 : return malloc(size);</span></a>
<a name="20"><span class="lineNum"> 20 </span> : : }</a>
<a name="21"><span class="lineNum"> 21 </span> : : </a>
<a name="22"><span class="lineNum"> 22 </span> :<span class="lineCov"> 2 : static void real_free(void *p)</span></a>
<a name="23"><span class="lineNum"> 23 </span> : : {</a>
<a name="24"><span class="lineNum"> 24 </span> :<span class="lineCov"> 2 : return free(p);</span></a>
<a name="25"><span class="lineNum"> 25 </span> : : }</a>
<a name="26"><span class="lineNum"> 26 </span> : : </a>
<a name="27"><span class="lineNum"> 27 </span> : : #undef malloc</a>
<a name="28"><span class="lineNum"> 28 </span> : : #undef free</a>
<a name="29"><span class="lineNum"> 29 </span> : : #undef realloc</a>
<a name="30"><span class="lineNum"> 30 </span> : : </a>
<a name="31"><span class="lineNum"> 31 </span> : : #include <skiboot.h></a>
<a name="32"><span class="lineNum"> 32 </span> : : #include <mem_region-malloc.h></a>
<a name="33"><span class="lineNum"> 33 </span> : : </a>
<a name="34"><span class="lineNum"> 34 </span> : : /* We need mem_region to accept __location__ */</a>
<a name="35"><span class="lineNum"> 35 </span> : : #define is_rodata(p) true</a>
<a name="36"><span class="lineNum"> 36 </span> : : #include "../mem_region.c"</a>
<a name="37"><span class="lineNum"> 37 </span> : : #include "../malloc.c"</a>
<a name="38"><span class="lineNum"> 38 </span> : : </a>
<a name="39"><span class="lineNum"> 39 </span> : : /* But we need device tree to make copies of names. */</a>
<a name="40"><span class="lineNum"> 40 </span> : : #undef is_rodata</a>
<a name="41"><span class="lineNum"> 41 </span> : : #define is_rodata(p) false</a>
<a name="42"><span class="lineNum"> 42 </span> : : #include "../../libc/string/strdup.c"</a>
<a name="43"><span class="lineNum"> 43 </span> : : </a>
<a name="44"><span class="lineNum"> 44 </span> : : #include "../device.c"</a>
<a name="45"><span class="lineNum"> 45 </span> : : #include <assert.h></a>
<a name="46"><span class="lineNum"> 46 </span> : : #include <stdio.h></a>
<a name="47"><span class="lineNum"> 47 </span> : : </a>
<a name="48"><span class="lineNum"> 48 </span> : : enum proc_chip_quirks proc_chip_quirks;</a>
<a name="49"><span class="lineNum"> 49 </span> : : </a>
<a name="50"><span class="lineNum"> 50 </span> :<span class="lineCov"> 124 : void lock_caller(struct lock *l, const char *caller)</span></a>
<a name="51"><span class="lineNum"> 51 </span> : : {</a>
<a name="52"><span class="lineNum"> 52 </span> : : (void)caller;</a>
<a name="53"><span class="lineNum"> 53 </span> :<span class="lineCov"> 124 : assert(!l->lock_val);</span></a>
<a name="54"><span class="lineNum"> 54 </span> :<span class="lineCov"> 124 : l->lock_val++;</span></a>
<a name="55"><span class="lineNum"> 55 </span> :<span class="lineCov"> 124 : }</span></a>
<a name="56"><span class="lineNum"> 56 </span> : : </a>
<a name="57"><span class="lineNum"> 57 </span> :<span class="lineCov"> 124 : void unlock(struct lock *l)</span></a>
<a name="58"><span class="lineNum"> 58 </span> : : {</a>
<a name="59"><span class="lineNum"> 59 </span> :<span class="lineCov"> 124 : assert(l->lock_val);</span></a>
<a name="60"><span class="lineNum"> 60 </span> :<span class="lineCov"> 124 : l->lock_val--;</span></a>
<a name="61"><span class="lineNum"> 61 </span> :<span class="lineCov"> 124 : }</span></a>
<a name="62"><span class="lineNum"> 62 </span> : : </a>
<a name="63"><span class="lineNum"> 63 </span> :<span class="lineCov"> 75 : bool lock_held_by_me(struct lock *l)</span></a>
<a name="64"><span class="lineNum"> 64 </span> : : {</a>
<a name="65"><span class="lineNum"> 65 </span> :<span class="lineCov"> 75 : return l->lock_val;</span></a>
<a name="66"><span class="lineNum"> 66 </span> : : }</a>
<a name="67"><span class="lineNum"> 67 </span> : : </a>
<a name="68"><span class="lineNum"> 68 </span> : : #define TEST_HEAP_ORDER 16</a>
<a name="69"><span class="lineNum"> 69 </span> : : #define TEST_HEAP_SIZE (1ULL << TEST_HEAP_ORDER)</a>
<a name="70"><span class="lineNum"> 70 </span> : : </a>
<a name="71"><span class="lineNum"> 71 </span> :<span class="lineCov"> 1 : static void add_mem_node(uint64_t start, uint64_t len)</span></a>
<a name="72"><span class="lineNum"> 72 </span> : : {</a>
<a name="73"><span class="lineNum"> 73 </span> : : struct dt_node *mem;</a>
<a name="74"><span class="lineNum"> 74 </span> : : u64 reg[2];</a>
<a name="75"><span class="lineNum"> 75 </span> : : char *name;</a>
<a name="76"><span class="lineNum"> 76 </span> : : </a>
<a name="77"><span class="lineNum"> 77 </span> :<span class="lineCov"> 1 : name = (char*)malloc(sizeof("memory@") + STR_MAX_CHARS(reg[0]));</span></a>
<a name="78"><span class="lineNum"> 78 </span> :<span class="lineCov"> 1 : assert(name);</span></a>
<a name="79"><span class="lineNum"> 79 </span> : : </a>
<a name="80"><span class="lineNum"> 80 </span> : : /* reg contains start and length */</a>
<a name="81"><span class="lineNum"> 81 </span> :<span class="lineCov"> 1 : reg[0] = cpu_to_be64(start);</span></a>
<a name="82"><span class="lineNum"> 82 </span> :<span class="lineCov"> 1 : reg[1] = cpu_to_be64(len);</span></a>
<a name="83"><span class="lineNum"> 83 </span> : : </a>
<a name="84"><span class="lineNum"> 84 </span> :<span class="lineCov"> 1 : sprintf(name, "memory@%llx", (long long)start);</span></a>
<a name="85"><span class="lineNum"> 85 </span> : : </a>
<a name="86"><span class="lineNum"> 86 </span> :<span class="lineCov"> 1 : mem = dt_new(dt_root, name);</span></a>
<a name="87"><span class="lineNum"> 87 </span> :<span class="lineCov"> 1 : dt_add_property_string(mem, "device_type", "memory");</span></a>
<a name="88"><span class="lineNum"> 88 </span> :<span class="lineCov"> 1 : dt_add_property(mem, "reg", reg, sizeof(reg));</span></a>
<a name="89"><span class="lineNum"> 89 </span> :<span class="lineCov"> 1 : free(name);</span></a>
<a name="90"><span class="lineNum"> 90 </span> :<span class="lineCov"> 1 : }</span></a>
<a name="91"><span class="lineNum"> 91 </span> : : </a>
<a name="92"><span class="lineNum"> 92 </span> :<span class="lineCov"> 14 : void add_chip_dev_associativity(struct dt_node *dev __attribute__((unused)))</span></a>
<a name="93"><span class="lineNum"> 93 </span> : : {</a>
<a name="94"><span class="lineNum"> 94 </span> :<span class="lineCov"> 14 : }</span></a>
<a name="95"><span class="lineNum"> 95 </span> : : </a>
<a name="96"><span class="lineNum"> 96 </span> : : struct test_region {</a>
<a name="97"><span class="lineNum"> 97 </span> : : uint64_t start;</a>
<a name="98"><span class="lineNum"> 98 </span> : : uint64_t end;</a>
<a name="99"><span class="lineNum"> 99 </span> : : };</a>
<a name="100"><span class="lineNum"> 100 </span> : : </a>
<a name="101"><span class="lineNum"> 101 </span> : : static struct test {</a>
<a name="102"><span class="lineNum"> 102 </span> : : struct test_region regions[3];</a>
<a name="103"><span class="lineNum"> 103 </span> : : bool reserved;</a>
<a name="104"><span class="lineNum"> 104 </span> : : } tests[] = {</a>
<a name="105"><span class="lineNum"> 105 </span> : : /* empty region set */</a>
<a name="106"><span class="lineNum"> 106 </span> : : { { { 0 } }, false },</a>
<a name="107"><span class="lineNum"> 107 </span> : : </a>
<a name="108"><span class="lineNum"> 108 </span> : : /* single exact match */</a>
<a name="109"><span class="lineNum"> 109 </span> : : { { { 0x1000, 0x2000 }, }, true },</a>
<a name="110"><span class="lineNum"> 110 </span> : : </a>
<a name="111"><span class="lineNum"> 111 </span> : : /* overlap downwards */</a>
<a name="112"><span class="lineNum"> 112 </span> : : { { { 0x0fff, 0x2000 }, }, true },</a>
<a name="113"><span class="lineNum"> 113 </span> : : </a>
<a name="114"><span class="lineNum"> 114 </span> : : /* overlap upwards */</a>
<a name="115"><span class="lineNum"> 115 </span> : : { { { 0x1000, 0x2001 }, }, true },</a>
<a name="116"><span class="lineNum"> 116 </span> : : </a>
<a name="117"><span class="lineNum"> 117 </span> : : /* missing first byte */</a>
<a name="118"><span class="lineNum"> 118 </span> : : { { { 0x1001, 0x2000 }, }, false },</a>
<a name="119"><span class="lineNum"> 119 </span> : : </a>
<a name="120"><span class="lineNum"> 120 </span> : : /* missing last byte */</a>
<a name="121"><span class="lineNum"> 121 </span> : : { { { 0x1000, 0x1fff }, }, false },</a>
<a name="122"><span class="lineNum"> 122 </span> : : </a>
<a name="123"><span class="lineNum"> 123 </span> : : /* two regions, full coverage, split before start of range */</a>
<a name="124"><span class="lineNum"> 124 </span> : : { { { 0x0500, 0x1000 }, { 0x1000, 0x2500 } }, true },</a>
<a name="125"><span class="lineNum"> 125 </span> : : </a>
<a name="126"><span class="lineNum"> 126 </span> : : /* two regions, full coverage, split after start of range */</a>
<a name="127"><span class="lineNum"> 127 </span> : : { { { 0x0500, 0x1001 }, { 0x1001, 0x2500 } }, true },</a>
<a name="128"><span class="lineNum"> 128 </span> : : </a>
<a name="129"><span class="lineNum"> 129 </span> : : /* two regions, full coverage, split at middle of range */</a>
<a name="130"><span class="lineNum"> 130 </span> : : { { { 0x0500, 0x1500 }, { 0x1500, 0x2500 } }, true },</a>
<a name="131"><span class="lineNum"> 131 </span> : : </a>
<a name="132"><span class="lineNum"> 132 </span> : : /* two regions, full coverage, split before end of range */</a>
<a name="133"><span class="lineNum"> 133 </span> : : { { { 0x0500, 0x1fff }, { 0x1fff, 0x2500 } }, true },</a>
<a name="134"><span class="lineNum"> 134 </span> : : </a>
<a name="135"><span class="lineNum"> 135 </span> : : /* two regions, full coverage, split after end of range */</a>
<a name="136"><span class="lineNum"> 136 </span> : : { { { 0x0500, 0x2000 }, { 0x2000, 0x2500 } }, true },</a>
<a name="137"><span class="lineNum"> 137 </span> : : </a>
<a name="138"><span class="lineNum"> 138 </span> : : /* two regions, missing byte in middle of range */</a>
<a name="139"><span class="lineNum"> 139 </span> : : { { { 0x0500, 0x14ff }, { 0x1500, 0x2500 } }, false },</a>
<a name="140"><span class="lineNum"> 140 </span> : : </a>
<a name="141"><span class="lineNum"> 141 </span> : : /* two regions, missing byte after start of range */</a>
<a name="142"><span class="lineNum"> 142 </span> : : { { { 0x0500, 0x1000 }, { 0x1001, 0x2500 } }, false },</a>
<a name="143"><span class="lineNum"> 143 </span> : : </a>
<a name="144"><span class="lineNum"> 144 </span> : : /* two regions, missing byte before end of range */</a>
<a name="145"><span class="lineNum"> 145 </span> : : { { { 0x0500, 0x1fff }, { 0x2000, 0x2500 } }, false },</a>
<a name="146"><span class="lineNum"> 146 </span> : : };</a>
<a name="147"><span class="lineNum"> 147 </span> : : </a>
<a name="148"><span class="lineNum"> 148 </span> :<span class="lineCov"> 14 : static void run_test(struct test *test)</span></a>
<a name="149"><span class="lineNum"> 149 </span> : : {</a>
<a name="150"><span class="lineNum"> 150 </span> : : struct test_region *r;</a>
<a name="151"><span class="lineNum"> 151 </span> : : bool reserved;</a>
<a name="152"><span class="lineNum"> 152 </span> : : </a>
<a name="153"><span class="lineNum"> 153 </span> :<span class="lineCov"> 14 : list_head_init(&regions);</span></a>
<a name="154"><span class="lineNum"> 154 </span> : : </a>
<a name="155"><span class="lineNum"> 155 </span> :<span class="lineCov"> 14 : mem_region_init();</span></a>
<a name="156"><span class="lineNum"> 156 </span> : : </a>
<a name="157"><span class="lineNum"> 157 </span> : : /* create our reservations */</a>
<a name="158"><span class="lineNum"> 158 </span> :<span class="lineCov"> 35 : for (r = test->regions; r->start; r++)</span></a>
<a name="159"><span class="lineNum"> 159 </span> :<span class="lineCov"> 21 : mem_reserve_fw("r", r->start, r->end - r->start);</span></a>
<a name="160"><span class="lineNum"> 160 </span> : : </a>
<a name="161"><span class="lineNum"> 161 </span> :<span class="lineCov"> 14 : reserved = mem_range_is_reserved(0x1000, 0x1000);</span></a>
<a name="162"><span class="lineNum"> 162 </span> : : </a>
<a name="163"><span class="lineNum"> 163 </span> :<span class="lineCov"> 14 : if (reserved != test->reserved) {</span></a>
<a name="164"><span class="lineNum"> 164 </span> : : struct mem_region *r;</a>
<a name="165"><span class="lineNum"> 165 </span> :<span class="lineNoCov"> 0 : fprintf(stderr, "test failed; got %s, expected %s\n",</span></a>
<a name="166"><span class="lineNum"> 166 </span> : : reserved ? "reserved" : "unreserved",</a>
<a name="167"><span class="lineNum"> 167 </span> :<span class="lineNoCov"> 0 : test->reserved ? "reserved" : "unreserved");</span></a>
<a name="168"><span class="lineNum"> 168 </span> : : </a>
<a name="169"><span class="lineNum"> 169 </span> :<span class="lineNoCov"> 0 : fprintf(stderr, "reserved regions:\n");</span></a>
<a name="170"><span class="lineNum"> 170 </span> : : </a>
<a name="171"><span class="lineNum"> 171 </span> :<span class="lineNoCov"> 0 : list_for_each(&regions, r, list) {</span></a>
<a name="172"><span class="lineNum"> 172 </span> :<span class="lineNoCov"> 0 : fprintf(stderr, "\t: %08"PRIx64"[%08"PRIx64"] %s\n",</span></a>
<a name="173"><span class="lineNum"> 173 </span> : : r->start, r->len, r->name);</a>
<a name="174"><span class="lineNum"> 174 </span> : : }</a>
<a name="175"><span class="lineNum"> 175 </span> :<span class="lineNoCov"> 0 : exit(EXIT_FAILURE);</span></a>
<a name="176"><span class="lineNum"> 176 </span> : : }</a>
<a name="177"><span class="lineNum"> 177 </span> :<span class="lineCov"> 14 : }</span></a>
<a name="178"><span class="lineNum"> 178 </span> : : </a>
<a name="179"><span class="lineNum"> 179 </span> : : </a>
<a name="180"><span class="lineNum"> 180 </span> :<span class="lineCov"> 1 : int main(void)</span></a>
<a name="181"><span class="lineNum"> 181 </span> : : {</a>
<a name="182"><span class="lineNum"> 182 </span> : : unsigned int i;</a>
<a name="183"><span class="lineNum"> 183 </span> : : void *buf;</a>
<a name="184"><span class="lineNum"> 184 </span> : : </a>
<a name="185"><span class="lineNum"> 185 </span> : : /* Use malloc for the heap, so valgrind can find issues. */</a>
<a name="186"><span class="lineNum"> 186 </span> :<span class="lineCov"> 1 : skiboot_heap.start = (long)real_malloc(TEST_HEAP_SIZE);</span></a>
<a name="187"><span class="lineNum"> 187 </span> :<span class="lineCov"> 1 : skiboot_heap.len = TEST_HEAP_SIZE;</span></a>
<a name="188"><span class="lineNum"> 188 </span> : : </a>
<a name="189"><span class="lineNum"> 189 </span> : : /* shift the OS reserve area out of the way of our playground */</a>
<a name="190"><span class="lineNum"> 190 </span> :<span class="lineCov"> 1 : skiboot_os_reserve.start = 0x100000;</span></a>
<a name="191"><span class="lineNum"> 191 </span> :<span class="lineCov"> 1 : skiboot_os_reserve.len = 0x1000;</span></a>
<a name="192"><span class="lineNum"> 192 </span> : : </a>
<a name="193"><span class="lineNum"> 193 </span> :<span class="lineCov"> 1 : dt_root = dt_new_root("");</span></a>
<a name="194"><span class="lineNum"> 194 </span> :<span class="lineCov"> 1 : dt_add_property_cells(dt_root, "#address-cells", 2);</span></a>
<a name="195"><span class="lineNum"> 195 </span> :<span class="lineCov"> 1 : dt_add_property_cells(dt_root, "#size-cells", 2);</span></a>
<a name="196"><span class="lineNum"> 196 </span> : : </a>
<a name="197"><span class="lineNum"> 197 </span> :<span class="lineCov"> 1 : buf = real_malloc(1024*1024);</span></a>
<a name="198"><span class="lineNum"> 198 </span> :<span class="lineCov"> 1 : add_mem_node((unsigned long)buf, 1024*1024);</span></a>
<a name="199"><span class="lineNum"> 199 </span> : : </a>
<a name="200"><span class="lineNum"> 200 </span> :<span class="lineCov"> 15 : for (i = 0; i < ARRAY_SIZE(tests); i++)</span></a>
<a name="201"><span class="lineNum"> 201 </span> :<span class="lineCov"> 14 : run_test(&tests[i]);</span></a>
<a name="202"><span class="lineNum"> 202 </span> : : </a>
<a name="203"><span class="lineNum"> 203 </span> :<span class="lineCov"> 1 : dt_free(dt_root);</span></a>
<a name="204"><span class="lineNum"> 204 </span> :<span class="lineCov"> 1 : real_free(buf);</span></a>
<a name="205"><span class="lineNum"> 205 </span> :<span class="lineCov"> 1 : real_free((void *)(long)skiboot_heap.start);</span></a>
<a name="206"><span class="lineNum"> 206 </span> :<span class="lineCov"> 1 : return 0;</span></a>
<a name="207"><span class="lineNum"> 207 </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>
|
