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
|
<!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 - ccan/heap/heap.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">ccan/heap</a> - heap.c<span style="font-size: 80%;"> (source / <a href="heap.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">61</td>
<td class="headerCovTableEntry">64</td>
<td class="headerCovTableEntryHi">95.3 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2024-08-02 18:20:04</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">8</td>
<td class="headerCovTableEntry">8</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> : : /* Licensed under BSD-MIT - see LICENSE file for details */</a>
<a name="2"><span class="lineNum"> 2 </span> : : #include <ccan/heap/heap.h></a>
<a name="3"><span class="lineNum"> 3 </span> : : </a>
<a name="4"><span class="lineNum"> 4 </span> : : /*</a>
<a name="5"><span class="lineNum"> 5 </span> : : * Allocating memory in chunks greater than needed does not yield measurable</a>
<a name="6"><span class="lineNum"> 6 </span> : : * speedups of the test program when linking against glibc 2.15.</a>
<a name="7"><span class="lineNum"> 7 </span> : : *</a>
<a name="8"><span class="lineNum"> 8 </span> : : * When the data array has to be shrunk though, limiting calls to realloc</a>
<a name="9"><span class="lineNum"> 9 </span> : : * does help a little bit (~7% speedup), hence the following parameter.</a>
<a name="10"><span class="lineNum"> 10 </span> : : */</a>
<a name="11"><span class="lineNum"> 11 </span> : : #define HEAP_MEM_HYSTERESIS 4096</a>
<a name="12"><span class="lineNum"> 12 </span> : : </a>
<a name="13"><span class="lineNum"> 13 </span> :<span class="lineCov"> 140194 : static inline void swap(struct heap *h, size_t i, size_t j)</span></a>
<a name="14"><span class="lineNum"> 14 </span> : : {</a>
<a name="15"><span class="lineNum"> 15 </span> :<span class="lineCov"> 140194 : void *foo = h->data[i];</span></a>
<a name="16"><span class="lineNum"> 16 </span> : : </a>
<a name="17"><span class="lineNum"> 17 </span> :<span class="lineCov"> 140194 : h->data[i] = h->data[j];</span></a>
<a name="18"><span class="lineNum"> 18 </span> :<span class="lineCov"> 140194 : h->data[j] = foo;</span></a>
<a name="19"><span class="lineNum"> 19 </span> :<span class="lineCov"> 140194 : }</span></a>
<a name="20"><span class="lineNum"> 20 </span> : : </a>
<a name="21"><span class="lineNum"> 21 </span> :<span class="lineCov"> 10068 : static void __up(struct heap *h, size_t j)</span></a>
<a name="22"><span class="lineNum"> 22 </span> : : {</a>
<a name="23"><span class="lineNum"> 23 </span> : : size_t i; /* parent */</a>
<a name="24"><span class="lineNum"> 24 </span> : : </a>
<a name="25"><span class="lineNum"> 25 </span> :<span class="lineCov"> 23256 : while (j) {</span></a>
<a name="26"><span class="lineNum"> 26 </span> :<span class="lineCov"> 23224 : i = (j - 1) / 2;</span></a>
<a name="27"><span class="lineNum"> 27 </span> : : </a>
<a name="28"><span class="lineNum"> 28 </span> :<span class="lineCov"> 23224 : if (h->less(h->data[j], h->data[i])) {</span></a>
<a name="29"><span class="lineNum"> 29 </span> :<span class="lineCov"> 13188 : swap(h, i, j);</span></a>
<a name="30"><span class="lineNum"> 30 </span> :<span class="lineCov"> 13188 : j = i;</span></a>
<a name="31"><span class="lineNum"> 31 </span> : : } else {</a>
<a name="32"><span class="lineNum"> 32 </span> :<span class="lineCov"> 10036 : break;</span></a>
<a name="33"><span class="lineNum"> 33 </span> : : }</a>
<a name="34"><span class="lineNum"> 34 </span> : : }</a>
<a name="35"><span class="lineNum"> 35 </span> :<span class="lineCov"> 10068 : }</span></a>
<a name="36"><span class="lineNum"> 36 </span> : : </a>
<a name="37"><span class="lineNum"> 37 </span> :<span class="lineCov"> 10068 : int heap_push(struct heap *h, void *data)</span></a>
<a name="38"><span class="lineNum"> 38 </span> : : {</a>
<a name="39"><span class="lineNum"> 39 </span> :<span class="lineCov"> 10068 : if (h->len == h->cap) {</span></a>
<a name="40"><span class="lineNum"> 40 </span> :<span class="lineCov"> 10068 : void *m = realloc(h->data, (h->cap + 1) * sizeof(void *));</span></a>
<a name="41"><span class="lineNum"> 41 </span> :<span class="lineCov"> 10068 : if (m == NULL)</span></a>
<a name="42"><span class="lineNum"> 42 </span> :<span class="lineNoCov"> 0 : return -1;</span></a>
<a name="43"><span class="lineNum"> 43 </span> :<span class="lineCov"> 10068 : h->data = m;</span></a>
<a name="44"><span class="lineNum"> 44 </span> :<span class="lineCov"> 10068 : h->cap++;</span></a>
<a name="45"><span class="lineNum"> 45 </span> : : }</a>
<a name="46"><span class="lineNum"> 46 </span> :<span class="lineCov"> 10068 : h->data[h->len++] = data;</span></a>
<a name="47"><span class="lineNum"> 47 </span> :<span class="lineCov"> 10068 : __up(h, h->len - 1);</span></a>
<a name="48"><span class="lineNum"> 48 </span> :<span class="lineCov"> 10068 : return 0;</span></a>
<a name="49"><span class="lineNum"> 49 </span> : : }</a>
<a name="50"><span class="lineNum"> 50 </span> : : </a>
<a name="51"><span class="lineNum"> 51 </span> :<span class="lineCov"> 137032 : static void __down(struct heap *h, size_t i)</span></a>
<a name="52"><span class="lineNum"> 52 </span> : : {</a>
<a name="53"><span class="lineNum"> 53 </span> : : size_t l, r, j; /* left, right, min child */</a>
<a name="54"><span class="lineNum"> 54 </span> : : </a>
<a name="55"><span class="lineNum"> 55 </span> : : while (1) {</a>
<a name="56"><span class="lineNum"> 56 </span> :<span class="lineCov"> 137032 : l = 2 * i + 1;</span></a>
<a name="57"><span class="lineNum"> 57 </span> :<span class="lineCov"> 137032 : if (l >= h->len)</span></a>
<a name="58"><span class="lineNum"> 58 </span> :<span class="lineCov"> 18554 : break;</span></a>
<a name="59"><span class="lineNum"> 59 </span> :<span class="lineCov"> 118478 : r = l + 1;</span></a>
<a name="60"><span class="lineNum"> 60 </span> :<span class="lineCov"> 118478 : if (r >= h->len)</span></a>
<a name="61"><span class="lineNum"> 61 </span> :<span class="lineCov"> 50 : j = l;</span></a>
<a name="62"><span class="lineNum"> 62 </span> : : else</a>
<a name="63"><span class="lineNum"> 63 </span> :<span class="lineCov"> 118428 : j = h->less(h->data[l], h->data[r]) ? l : r;</span></a>
<a name="64"><span class="lineNum"> 64 </span> : : </a>
<a name="65"><span class="lineNum"> 65 </span> :<span class="lineCov"> 118478 : if (h->less(h->data[j], h->data[i])) {</span></a>
<a name="66"><span class="lineNum"> 66 </span> :<span class="lineCov"> 116938 : swap(h, i, j);</span></a>
<a name="67"><span class="lineNum"> 67 </span> :<span class="lineCov"> 116938 : i = j;</span></a>
<a name="68"><span class="lineNum"> 68 </span> : : } else {</a>
<a name="69"><span class="lineNum"> 69 </span> :<span class="lineCov"> 1540 : break;</span></a>
<a name="70"><span class="lineNum"> 70 </span> : : }</a>
<a name="71"><span class="lineNum"> 71 </span> : : }</a>
<a name="72"><span class="lineNum"> 72 </span> :<span class="lineCov"> 20094 : }</span></a>
<a name="73"><span class="lineNum"> 73 </span> : : </a>
<a name="74"><span class="lineNum"> 74 </span> :<span class="lineCov"> 10068 : void *heap_pop(struct heap *h)</span></a>
<a name="75"><span class="lineNum"> 75 </span> : : {</a>
<a name="76"><span class="lineNum"> 76 </span> :<span class="lineCov"> 10068 : void *ret = h->data[0];</span></a>
<a name="77"><span class="lineNum"> 77 </span> : : void *m;</a>
<a name="78"><span class="lineNum"> 78 </span> : : </a>
<a name="79"><span class="lineNum"> 79 </span> :<span class="lineCov"> 10068 : swap(h, 0, --h->len);</span></a>
<a name="80"><span class="lineNum"> 80 </span> :<span class="lineCov"> 10068 : if (h->len) {</span></a>
<a name="81"><span class="lineNum"> 81 </span> :<span class="lineCov"> 10062 : __down(h, 0);</span></a>
<a name="82"><span class="lineNum"> 82 </span> :<span class="lineCov"> 10062 : if (h->len == h->cap - HEAP_MEM_HYSTERESIS) {</span></a>
<a name="83"><span class="lineNum"> 83 </span> :<span class="lineCov"> 2 : m = realloc(h->data, h->len * sizeof(void *));</span></a>
<a name="84"><span class="lineNum"> 84 </span> :<span class="lineCov"> 2 : if (m == NULL)</span></a>
<a name="85"><span class="lineNum"> 85 </span> :<span class="lineNoCov"> 0 : return NULL;</span></a>
<a name="86"><span class="lineNum"> 86 </span> :<span class="lineCov"> 2 : h->data = m;</span></a>
<a name="87"><span class="lineNum"> 87 </span> :<span class="lineCov"> 2 : h->cap = h->len;</span></a>
<a name="88"><span class="lineNum"> 88 </span> : : }</a>
<a name="89"><span class="lineNum"> 89 </span> : : }</a>
<a name="90"><span class="lineNum"> 90 </span> : : </a>
<a name="91"><span class="lineNum"> 91 </span> :<span class="lineCov"> 10068 : return ret;</span></a>
<a name="92"><span class="lineNum"> 92 </span> : : }</a>
<a name="93"><span class="lineNum"> 93 </span> : : </a>
<a name="94"><span class="lineNum"> 94 </span> :<span class="lineCov"> 6 : struct heap *heap_init(heap_less_func_t less)</span></a>
<a name="95"><span class="lineNum"> 95 </span> : : {</a>
<a name="96"><span class="lineNum"> 96 </span> :<span class="lineCov"> 6 : struct heap *heap = calloc(1, sizeof(*heap));</span></a>
<a name="97"><span class="lineNum"> 97 </span> : : </a>
<a name="98"><span class="lineNum"> 98 </span> :<span class="lineCov"> 6 : if (heap == NULL)</span></a>
<a name="99"><span class="lineNum"> 99 </span> :<span class="lineNoCov"> 0 : return NULL;</span></a>
<a name="100"><span class="lineNum"> 100 </span> :<span class="lineCov"> 6 : heap->less = less;</span></a>
<a name="101"><span class="lineNum"> 101 </span> :<span class="lineCov"> 6 : return heap;</span></a>
<a name="102"><span class="lineNum"> 102 </span> : : }</a>
<a name="103"><span class="lineNum"> 103 </span> : : </a>
<a name="104"><span class="lineNum"> 104 </span> :<span class="lineCov"> 10 : void heap_ify(struct heap *h, heap_less_func_t less)</span></a>
<a name="105"><span class="lineNum"> 105 </span> : : {</a>
<a name="106"><span class="lineNum"> 106 </span> : : int i;</a>
<a name="107"><span class="lineNum"> 107 </span> : : </a>
<a name="108"><span class="lineNum"> 108 </span> :<span class="lineCov"> 10 : if (less)</span></a>
<a name="109"><span class="lineNum"> 109 </span> :<span class="lineCov"> 8 : h->less = less;</span></a>
<a name="110"><span class="lineNum"> 110 </span> : : </a>
<a name="111"><span class="lineNum"> 111 </span> :<span class="lineCov"> 10042 : for (i = h->len / 2 - 1; i >= 0; i--)</span></a>
<a name="112"><span class="lineNum"> 112 </span> :<span class="lineCov"> 10032 : __down(h, i);</span></a>
<a name="113"><span class="lineNum"> 113 </span> :<span class="lineCov"> 10 : }</span></a>
<a name="114"><span class="lineNum"> 114 </span> : : </a>
<a name="115"><span class="lineNum"> 115 </span> :<span class="lineCov"> 6 : void heap_free(struct heap *heap)</span></a>
<a name="116"><span class="lineNum"> 116 </span> : : {</a>
<a name="117"><span class="lineNum"> 117 </span> :<span class="lineCov"> 6 : free(heap->data);</span></a>
<a name="118"><span class="lineNum"> 118 </span> :<span class="lineCov"> 6 : free(heap);</span></a>
<a name="119"><span class="lineNum"> 119 </span> :<span class="lineCov"> 6 : }</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>
|
