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
|
<!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 - include/device.h</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">include</a> - device.h<span style="font-size: 80%;"> (source / <a href="device.h.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">9</td>
<td class="headerCovTableEntry">9</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2023-06-06 19:00:36</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">4</td>
<td class="headerCovTableEntry">4</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 2013-2018 IBM Corp. */</a>
<a name="3"><span class="lineNum"> 3 </span> : : </a>
<a name="4"><span class="lineNum"> 4 </span> : : #ifndef __DEVICE_H</a>
<a name="5"><span class="lineNum"> 5 </span> : : #define __DEVICE_H</a>
<a name="6"><span class="lineNum"> 6 </span> : : #include <ccan/list/list.h></a>
<a name="7"><span class="lineNum"> 7 </span> : : #include <ccan/short_types/short_types.h></a>
<a name="8"><span class="lineNum"> 8 </span> : : #include <compiler.h></a>
<a name="9"><span class="lineNum"> 9 </span> : : </a>
<a name="10"><span class="lineNum"> 10 </span> : : /* Any property or node with this prefix will not be passed to the kernel. */</a>
<a name="11"><span class="lineNum"> 11 </span> : : #define DT_PRIVATE "skiboot,"</a>
<a name="12"><span class="lineNum"> 12 </span> : : </a>
<a name="13"><span class="lineNum"> 13 </span> : : /*</a>
<a name="14"><span class="lineNum"> 14 </span> : : * An in-memory representation of a node in the device tree.</a>
<a name="15"><span class="lineNum"> 15 </span> : : *</a>
<a name="16"><span class="lineNum"> 16 </span> : : * This is trivially flattened into an fdt.</a>
<a name="17"><span class="lineNum"> 17 </span> : : *</a>
<a name="18"><span class="lineNum"> 18 </span> : : * Note that the add_* routines will make a copy of the name if it's not</a>
<a name="19"><span class="lineNum"> 19 </span> : : * a read-only string (ie. usually a string literal).</a>
<a name="20"><span class="lineNum"> 20 </span> : : */</a>
<a name="21"><span class="lineNum"> 21 </span> : : struct dt_property {</a>
<a name="22"><span class="lineNum"> 22 </span> : : struct list_node list;</a>
<a name="23"><span class="lineNum"> 23 </span> : : const char *name;</a>
<a name="24"><span class="lineNum"> 24 </span> : : size_t len;</a>
<a name="25"><span class="lineNum"> 25 </span> : : char prop[/* len */];</a>
<a name="26"><span class="lineNum"> 26 </span> : : };</a>
<a name="27"><span class="lineNum"> 27 </span> : : </a>
<a name="28"><span class="lineNum"> 28 </span> : : struct dt_node {</a>
<a name="29"><span class="lineNum"> 29 </span> : : const char *name;</a>
<a name="30"><span class="lineNum"> 30 </span> : : struct list_node list;</a>
<a name="31"><span class="lineNum"> 31 </span> : : struct list_head properties;</a>
<a name="32"><span class="lineNum"> 32 </span> : : struct list_head children;</a>
<a name="33"><span class="lineNum"> 33 </span> : : struct dt_node *parent;</a>
<a name="34"><span class="lineNum"> 34 </span> : : u32 phandle;</a>
<a name="35"><span class="lineNum"> 35 </span> : : };</a>
<a name="36"><span class="lineNum"> 36 </span> : : </a>
<a name="37"><span class="lineNum"> 37 </span> : : /* This is shared with device_tree.c .. make it static when</a>
<a name="38"><span class="lineNum"> 38 </span> : : * the latter is gone (hopefully soon)</a>
<a name="39"><span class="lineNum"> 39 </span> : : */</a>
<a name="40"><span class="lineNum"> 40 </span> : : extern u32 last_phandle;</a>
<a name="41"><span class="lineNum"> 41 </span> : : </a>
<a name="42"><span class="lineNum"> 42 </span> : : extern struct dt_node *dt_root;</a>
<a name="43"><span class="lineNum"> 43 </span> : : extern struct dt_node *dt_chosen;</a>
<a name="44"><span class="lineNum"> 44 </span> : : </a>
<a name="45"><span class="lineNum"> 45 </span> : : /* Create a root node: ie. a parentless one. */</a>
<a name="46"><span class="lineNum"> 46 </span> : : struct dt_node *dt_new_root(const char *name);</a>
<a name="47"><span class="lineNum"> 47 </span> : : </a>
<a name="48"><span class="lineNum"> 48 </span> : : /* Graft a root node into this tree. */</a>
<a name="49"><span class="lineNum"> 49 </span> : : bool dt_attach_root(struct dt_node *parent, struct dt_node *root);</a>
<a name="50"><span class="lineNum"> 50 </span> : : </a>
<a name="51"><span class="lineNum"> 51 </span> : : /* Wrappers for last_phandle operations */</a>
<a name="52"><span class="lineNum"> 52 </span> :<span class="lineCov"> 2 : static inline u32 get_last_phandle(void)</span></a>
<a name="53"><span class="lineNum"> 53 </span> : : {</a>
<a name="54"><span class="lineNum"> 54 </span> :<span class="lineCov"> 2 : return last_phandle;</span></a>
<a name="55"><span class="lineNum"> 55 </span> : : }</a>
<a name="56"><span class="lineNum"> 56 </span> : : </a>
<a name="57"><span class="lineNum"> 57 </span> :<span class="lineCov"> 7 : static inline void set_last_phandle(u32 phandle)</span></a>
<a name="58"><span class="lineNum"> 58 </span> : : {</a>
<a name="59"><span class="lineNum"> 59 </span> :<span class="lineCov"> 7 : last_phandle = phandle;</span></a>
<a name="60"><span class="lineNum"> 60 </span> :<span class="lineCov"> 7 : }</span></a>
<a name="61"><span class="lineNum"> 61 </span> : : </a>
<a name="62"><span class="lineNum"> 62 </span> :<span class="lineCov"> 891 : static inline u32 new_phandle(void)</span></a>
<a name="63"><span class="lineNum"> 63 </span> : : {</a>
<a name="64"><span class="lineNum"> 64 </span> :<span class="lineCov"> 891 : return ++last_phandle;</span></a>
<a name="65"><span class="lineNum"> 65 </span> : : }</a>
<a name="66"><span class="lineNum"> 66 </span> : : </a>
<a name="67"><span class="lineNum"> 67 </span> : : /* Add a child node. */</a>
<a name="68"><span class="lineNum"> 68 </span> : : struct dt_node *dt_new(struct dt_node *parent, const char *name);</a>
<a name="69"><span class="lineNum"> 69 </span> : : struct dt_node *dt_new_addr(struct dt_node *parent, const char *name,</a>
<a name="70"><span class="lineNum"> 70 </span> : : uint64_t unit_addr);</a>
<a name="71"><span class="lineNum"> 71 </span> : : struct dt_node *dt_new_2addr(struct dt_node *parent, const char *name,</a>
<a name="72"><span class="lineNum"> 72 </span> : : uint64_t unit_addr0, uint64_t unit_addr1);</a>
<a name="73"><span class="lineNum"> 73 </span> : : struct dt_node *dt_new_check(struct dt_node *parent, const char *name);</a>
<a name="74"><span class="lineNum"> 74 </span> : : </a>
<a name="75"><span class="lineNum"> 75 </span> : : /* Copy node to new parent, including properties and subnodes */</a>
<a name="76"><span class="lineNum"> 76 </span> : : struct dt_node *dt_copy(struct dt_node *node, struct dt_node *parent);</a>
<a name="77"><span class="lineNum"> 77 </span> : : </a>
<a name="78"><span class="lineNum"> 78 </span> : : /* Add a property node, various forms. */</a>
<a name="79"><span class="lineNum"> 79 </span> : : struct dt_property *dt_add_property(struct dt_node *node,</a>
<a name="80"><span class="lineNum"> 80 </span> : : const char *name,</a>
<a name="81"><span class="lineNum"> 81 </span> : : const void *val, size_t size);</a>
<a name="82"><span class="lineNum"> 82 </span> : : struct dt_property *dt_add_property_string(struct dt_node *node,</a>
<a name="83"><span class="lineNum"> 83 </span> : : const char *name,</a>
<a name="84"><span class="lineNum"> 84 </span> : : const char *value);</a>
<a name="85"><span class="lineNum"> 85 </span> : : struct dt_property *dt_add_property_nstr(struct dt_node *node,</a>
<a name="86"><span class="lineNum"> 86 </span> : : const char *name,</a>
<a name="87"><span class="lineNum"> 87 </span> : : const char *value, unsigned int vlen);</a>
<a name="88"><span class="lineNum"> 88 </span> : : </a>
<a name="89"><span class="lineNum"> 89 </span> : : /* Given out enough GCC extensions, we will achieve enlightenment! */</a>
<a name="90"><span class="lineNum"> 90 </span> : : #define dt_add_property_strings(node, name, ...) \</a>
<a name="91"><span class="lineNum"> 91 </span> : : __dt_add_property_strings((node), ((name)), \</a>
<a name="92"><span class="lineNum"> 92 </span> : : sizeof((const char *[]) { __VA_ARGS__ })/sizeof(const char *), \</a>
<a name="93"><span class="lineNum"> 93 </span> : : __VA_ARGS__)</a>
<a name="94"><span class="lineNum"> 94 </span> : : </a>
<a name="95"><span class="lineNum"> 95 </span> : : struct dt_property *__dt_add_property_strings(struct dt_node *node,</a>
<a name="96"><span class="lineNum"> 96 </span> : : const char *name,</a>
<a name="97"><span class="lineNum"> 97 </span> : : int count, ...);</a>
<a name="98"><span class="lineNum"> 98 </span> : : </a>
<a name="99"><span class="lineNum"> 99 </span> : : /* Given out enough GCC extensions, we will achieve enlightenment! */</a>
<a name="100"><span class="lineNum"> 100 </span> : : #define dt_add_property_cells(node, name, ...) \</a>
<a name="101"><span class="lineNum"> 101 </span> : : __dt_add_property_cells((node), ((name)), \</a>
<a name="102"><span class="lineNum"> 102 </span> : : sizeof((u32[]) { __VA_ARGS__ })/sizeof(u32), \</a>
<a name="103"><span class="lineNum"> 103 </span> : : __VA_ARGS__)</a>
<a name="104"><span class="lineNum"> 104 </span> : : </a>
<a name="105"><span class="lineNum"> 105 </span> : : struct dt_property *__dt_add_property_cells(struct dt_node *node,</a>
<a name="106"><span class="lineNum"> 106 </span> : : const char *name,</a>
<a name="107"><span class="lineNum"> 107 </span> : : int count, ...);</a>
<a name="108"><span class="lineNum"> 108 </span> : : </a>
<a name="109"><span class="lineNum"> 109 </span> : : #define dt_add_property_u64s(node, name, ...) \</a>
<a name="110"><span class="lineNum"> 110 </span> : : __dt_add_property_u64s((node), ((name)), \</a>
<a name="111"><span class="lineNum"> 111 </span> : : sizeof((u64[]) { __VA_ARGS__ })/sizeof(u64), \</a>
<a name="112"><span class="lineNum"> 112 </span> : : __VA_ARGS__)</a>
<a name="113"><span class="lineNum"> 113 </span> : : </a>
<a name="114"><span class="lineNum"> 114 </span> : : struct dt_property *__dt_add_property_u64s(struct dt_node *node,</a>
<a name="115"><span class="lineNum"> 115 </span> : : const char *name,</a>
<a name="116"><span class="lineNum"> 116 </span> : : int count, ...);</a>
<a name="117"><span class="lineNum"> 117 </span> : : </a>
<a name="118"><span class="lineNum"> 118 </span> :<span class="lineCov"> 46 : static inline struct dt_property *dt_add_property_u64(struct dt_node *node,</span></a>
<a name="119"><span class="lineNum"> 119 </span> : : const char *name, u64 val)</a>
<a name="120"><span class="lineNum"> 120 </span> : : {</a>
<a name="121"><span class="lineNum"> 121 </span> :<span class="lineCov"> 46 : return dt_add_property_cells(node, name, (u32)(val >> 32),</span></a>
<a name="122"><span class="lineNum"> 122 </span> : : (u32)(val & 0xffffffffUL));</a>
<a name="123"><span class="lineNum"> 123 </span> : : }</a>
<a name="124"><span class="lineNum"> 124 </span> : : </a>
<a name="125"><span class="lineNum"> 125 </span> : : void dt_del_property(struct dt_node *node, struct dt_property *prop);</a>
<a name="126"><span class="lineNum"> 126 </span> : : </a>
<a name="127"><span class="lineNum"> 127 </span> : : void dt_check_del_prop(struct dt_node *node, const char *name);</a>
<a name="128"><span class="lineNum"> 128 </span> : : </a>
<a name="129"><span class="lineNum"> 129 </span> : : /* Warning: moves *prop! */</a>
<a name="130"><span class="lineNum"> 130 </span> : : void dt_resize_property(struct dt_property **prop, size_t len);</a>
<a name="131"><span class="lineNum"> 131 </span> : : </a>
<a name="132"><span class="lineNum"> 132 </span> : : void dt_property_set_cell(struct dt_property *prop, u32 index, u32 val);</a>
<a name="133"><span class="lineNum"> 133 </span> : : u32 dt_property_get_cell(const struct dt_property *prop, u32 index);</a>
<a name="134"><span class="lineNum"> 134 </span> : : u64 dt_property_get_u64(const struct dt_property *prop, u32 index);</a>
<a name="135"><span class="lineNum"> 135 </span> : : </a>
<a name="136"><span class="lineNum"> 136 </span> : : /* First child of this node. */</a>
<a name="137"><span class="lineNum"> 137 </span> : : struct dt_node *dt_first(const struct dt_node *root);</a>
<a name="138"><span class="lineNum"> 138 </span> : : </a>
<a name="139"><span class="lineNum"> 139 </span> : : /* Return next node, or NULL. */</a>
<a name="140"><span class="lineNum"> 140 </span> : : struct dt_node *dt_next(const struct dt_node *root, const struct dt_node *prev);</a>
<a name="141"><span class="lineNum"> 141 </span> : : </a>
<a name="142"><span class="lineNum"> 142 </span> : : /* Iterate nodes */</a>
<a name="143"><span class="lineNum"> 143 </span> : : #define dt_for_each_node(root, node) \</a>
<a name="144"><span class="lineNum"> 144 </span> : : for (node = dt_first(root); node; node = dt_next(root, node))</a>
<a name="145"><span class="lineNum"> 145 </span> : : </a>
<a name="146"><span class="lineNum"> 146 </span> : : #define dt_for_each_child(parent, node) \</a>
<a name="147"><span class="lineNum"> 147 </span> : : list_for_each(&parent->children, node, list)</a>
<a name="148"><span class="lineNum"> 148 </span> : : </a>
<a name="149"><span class="lineNum"> 149 </span> : : /* Find a string in a string list */</a>
<a name="150"><span class="lineNum"> 150 </span> : : bool dt_prop_find_string(const struct dt_property *p, const char *s);</a>
<a name="151"><span class="lineNum"> 151 </span> : : </a>
<a name="152"><span class="lineNum"> 152 </span> : : /* Check a compatible property */</a>
<a name="153"><span class="lineNum"> 153 </span> : : bool dt_node_is_compatible(const struct dt_node *node, const char *compat);</a>
<a name="154"><span class="lineNum"> 154 </span> : : </a>
<a name="155"><span class="lineNum"> 155 </span> : : /* Find a node based on compatible property */</a>
<a name="156"><span class="lineNum"> 156 </span> : : struct dt_node *dt_find_compatible_node(struct dt_node *root,</a>
<a name="157"><span class="lineNum"> 157 </span> : : struct dt_node *prev,</a>
<a name="158"><span class="lineNum"> 158 </span> : : const char *compat);</a>
<a name="159"><span class="lineNum"> 159 </span> : : </a>
<a name="160"><span class="lineNum"> 160 </span> : : #define dt_for_each_compatible(root, node, compat) \</a>
<a name="161"><span class="lineNum"> 161 </span> : : for (node = NULL; \</a>
<a name="162"><span class="lineNum"> 162 </span> : : (node = dt_find_compatible_node(root, node, compat)) != NULL;)</a>
<a name="163"><span class="lineNum"> 163 </span> : : </a>
<a name="164"><span class="lineNum"> 164 </span> : : struct dt_node *dt_find_compatible_node_on_chip(struct dt_node *root,</a>
<a name="165"><span class="lineNum"> 165 </span> : : struct dt_node *prev,</a>
<a name="166"><span class="lineNum"> 166 </span> : : const char *compat,</a>
<a name="167"><span class="lineNum"> 167 </span> : : uint32_t chip_id);</a>
<a name="168"><span class="lineNum"> 168 </span> : : </a>
<a name="169"><span class="lineNum"> 169 </span> : : #define dt_for_each_compatible_on_chip(root, node, compat, chip_id) \</a>
<a name="170"><span class="lineNum"> 170 </span> : : for (node = NULL; \</a>
<a name="171"><span class="lineNum"> 171 </span> : : (node = dt_find_compatible_node_on_chip(root, node,\</a>
<a name="172"><span class="lineNum"> 172 </span> : : compat, chip_id)) != NULL;)</a>
<a name="173"><span class="lineNum"> 173 </span> : : /* Check status property */</a>
<a name="174"><span class="lineNum"> 174 </span> : : bool dt_node_is_enabled(struct dt_node *node);</a>
<a name="175"><span class="lineNum"> 175 </span> : : </a>
<a name="176"><span class="lineNum"> 176 </span> : : /* Build the full path for a node. Return a new block of memory, caller</a>
<a name="177"><span class="lineNum"> 177 </span> : : * shall free() it</a>
<a name="178"><span class="lineNum"> 178 </span> : : */</a>
<a name="179"><span class="lineNum"> 179 </span> : : char *dt_get_path(const struct dt_node *node);</a>
<a name="180"><span class="lineNum"> 180 </span> : : </a>
<a name="181"><span class="lineNum"> 181 </span> : : /* Find a node by path */</a>
<a name="182"><span class="lineNum"> 182 </span> : : struct dt_node *dt_find_by_path(struct dt_node *root, const char *path);</a>
<a name="183"><span class="lineNum"> 183 </span> : : </a>
<a name="184"><span class="lineNum"> 184 </span> : : /* Find a child node by name */</a>
<a name="185"><span class="lineNum"> 185 </span> : : struct dt_node *dt_find_by_name(struct dt_node *root, const char *name);</a>
<a name="186"><span class="lineNum"> 186 </span> : : </a>
<a name="187"><span class="lineNum"> 187 </span> : : /* Find a node by phandle */</a>
<a name="188"><span class="lineNum"> 188 </span> : : struct dt_node *dt_find_by_phandle(struct dt_node *root, u32 phandle);</a>
<a name="189"><span class="lineNum"> 189 </span> : : </a>
<a name="190"><span class="lineNum"> 190 </span> : : /* Find a property by name. */</a>
<a name="191"><span class="lineNum"> 191 </span> : : const struct dt_property *dt_find_property(const struct dt_node *node,\</a>
<a name="192"><span class="lineNum"> 192 </span> : : const char *name);</a>
<a name="193"><span class="lineNum"> 193 </span> : : const struct dt_property *dt_require_property(const struct dt_node *node,</a>
<a name="194"><span class="lineNum"> 194 </span> : : const char *name, int wanted_len);</a>
<a name="195"><span class="lineNum"> 195 </span> : : </a>
<a name="196"><span class="lineNum"> 196 </span> : : /* non-const variant */</a>
<a name="197"><span class="lineNum"> 197 </span> : : struct dt_property *__dt_find_property(struct dt_node *node, const char *name);</a>
<a name="198"><span class="lineNum"> 198 </span> : : </a>
<a name="199"><span class="lineNum"> 199 </span> : : /* Find a property by name, check if it's the same as val. */</a>
<a name="200"><span class="lineNum"> 200 </span> : : bool dt_has_node_property(const struct dt_node *node,</a>
<a name="201"><span class="lineNum"> 201 </span> : : const char *name, const char *val);</a>
<a name="202"><span class="lineNum"> 202 </span> : : </a>
<a name="203"><span class="lineNum"> 203 </span> : : /* Free a node (and any children). */</a>
<a name="204"><span class="lineNum"> 204 </span> : : void dt_free(struct dt_node *node);</a>
<a name="205"><span class="lineNum"> 205 </span> : : </a>
<a name="206"><span class="lineNum"> 206 </span> : : /* Parse an initial fdt */</a>
<a name="207"><span class="lineNum"> 207 </span> : : void dt_expand(const void *fdt);</a>
<a name="208"><span class="lineNum"> 208 </span> : : int dt_expand_node(struct dt_node *node, const void *fdt, int fdt_node) __warn_unused_result;</a>
<a name="209"><span class="lineNum"> 209 </span> : : </a>
<a name="210"><span class="lineNum"> 210 </span> : : /* Simplified accessors */</a>
<a name="211"><span class="lineNum"> 211 </span> : : u64 dt_prop_get_u64(const struct dt_node *node, const char *prop);</a>
<a name="212"><span class="lineNum"> 212 </span> : : u64 dt_prop_get_u64_def(const struct dt_node *node, const char *prop, u64 def);</a>
<a name="213"><span class="lineNum"> 213 </span> : : u32 dt_prop_get_u32(const struct dt_node *node, const char *prop);</a>
<a name="214"><span class="lineNum"> 214 </span> : : u32 dt_prop_get_u32_def(const struct dt_node *node, const char *prop, u32 def);</a>
<a name="215"><span class="lineNum"> 215 </span> : : const void *dt_prop_get(const struct dt_node *node, const char *prop);</a>
<a name="216"><span class="lineNum"> 216 </span> : : const void *dt_prop_get_def(const struct dt_node *node, const char *prop,</a>
<a name="217"><span class="lineNum"> 217 </span> : : void *def);</a>
<a name="218"><span class="lineNum"> 218 </span> : : const void *dt_prop_get_def_size(const struct dt_node *node, const char *prop,</a>
<a name="219"><span class="lineNum"> 219 </span> : : void *def, size_t *len);</a>
<a name="220"><span class="lineNum"> 220 </span> : : u32 dt_prop_get_cell(const struct dt_node *node, const char *prop, u32 cell);</a>
<a name="221"><span class="lineNum"> 221 </span> : : u32 dt_prop_get_cell_def(const struct dt_node *node, const char *prop, u32 cell, u32 def);</a>
<a name="222"><span class="lineNum"> 222 </span> : : </a>
<a name="223"><span class="lineNum"> 223 </span> : : /* Parsing helpers */</a>
<a name="224"><span class="lineNum"> 224 </span> : : u32 dt_n_address_cells(const struct dt_node *node);</a>
<a name="225"><span class="lineNum"> 225 </span> : : u32 dt_n_size_cells(const struct dt_node *node);</a>
<a name="226"><span class="lineNum"> 226 </span> : : u64 dt_get_number(const void *pdata, unsigned int cells);</a>
<a name="227"><span class="lineNum"> 227 </span> : : </a>
<a name="228"><span class="lineNum"> 228 </span> : : /* Find an ibm,chip-id property in this node; if not found, walk up the parent</a>
<a name="229"><span class="lineNum"> 229 </span> : : * nodes. */</a>
<a name="230"><span class="lineNum"> 230 </span> : : u32 dt_get_chip_id(const struct dt_node *node);</a>
<a name="231"><span class="lineNum"> 231 </span> : : </a>
<a name="232"><span class="lineNum"> 232 </span> : : /* Same as dt_get_chip_id except Returns -1 if no chip-id property exists. */</a>
<a name="233"><span class="lineNum"> 233 </span> : : u32 __dt_get_chip_id(const struct dt_node *node);</a>
<a name="234"><span class="lineNum"> 234 </span> : : </a>
<a name="235"><span class="lineNum"> 235 </span> : : /* Address accessors ("reg" properties parsing). No translation,</a>
<a name="236"><span class="lineNum"> 236 </span> : : * only support "simple" address forms (1 or 2 cells). Asserts</a>
<a name="237"><span class="lineNum"> 237 </span> : : * if address doesn't exist</a>
<a name="238"><span class="lineNum"> 238 </span> : : */</a>
<a name="239"><span class="lineNum"> 239 </span> : : u64 dt_get_address(const struct dt_node *node, unsigned int index,</a>
<a name="240"><span class="lineNum"> 240 </span> : : u64 *out_size);</a>
<a name="241"><span class="lineNum"> 241 </span> : : </a>
<a name="242"><span class="lineNum"> 242 </span> : : /* Count "reg" property entries */</a>
<a name="243"><span class="lineNum"> 243 </span> : : unsigned int dt_count_addresses(const struct dt_node *node);</a>
<a name="244"><span class="lineNum"> 244 </span> : : </a>
<a name="245"><span class="lineNum"> 245 </span> : : /* Address translation</a>
<a name="246"><span class="lineNum"> 246 </span> : : *</a>
<a name="247"><span class="lineNum"> 247 </span> : : * WARNING: Current implementation is simplified and will not</a>
<a name="248"><span class="lineNum"> 248 </span> : : * handle complex address formats with address space indicators</a>
<a name="249"><span class="lineNum"> 249 </span> : : * nor will it handle "ranges" translations yet... (XX TODO)</a>
<a name="250"><span class="lineNum"> 250 </span> : : */</a>
<a name="251"><span class="lineNum"> 251 </span> : : u64 dt_translate_address(const struct dt_node *node, unsigned int index,</a>
<a name="252"><span class="lineNum"> 252 </span> : : u64 *out_size);</a>
<a name="253"><span class="lineNum"> 253 </span> : : </a>
<a name="254"><span class="lineNum"> 254 </span> : : /* compare function used to sort child nodes by name when added to the</a>
<a name="255"><span class="lineNum"> 255 </span> : : * tree. This is mainly here for testing.</a>
<a name="256"><span class="lineNum"> 256 </span> : : */</a>
<a name="257"><span class="lineNum"> 257 </span> : : int dt_cmp_subnodes(const struct dt_node *a, const struct dt_node *b);</a>
<a name="258"><span class="lineNum"> 258 </span> : : </a>
<a name="259"><span class="lineNum"> 259 </span> : : struct dt_node *__dt_find_by_name_addr(struct dt_node *parent, const char *name,</a>
<a name="260"><span class="lineNum"> 260 </span> : : const char *addr);</a>
<a name="261"><span class="lineNum"> 261 </span> : : struct dt_node *dt_find_by_name_addr(struct dt_node *parent, const char *name,</a>
<a name="262"><span class="lineNum"> 262 </span> : : uint64_t addr);</a>
<a name="263"><span class="lineNum"> 263 </span> : : </a>
<a name="264"><span class="lineNum"> 264 </span> : : /* phandle fixup helper */</a>
<a name="265"><span class="lineNum"> 265 </span> : : void dt_adjust_subtree_phandle(struct dt_node *subtree,</a>
<a name="266"><span class="lineNum"> 266 </span> : : const char** (get_properties_to_fix)(struct dt_node *n));</a>
<a name="267"><span class="lineNum"> 267 </span> : : </a>
<a name="268"><span class="lineNum"> 268 </span> : : #endif /* __DEVICE_H */</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>
|
