1 | /* SPDX-License-Identifier: BSD-2-Clause */ |
---|
2 | |
---|
3 | /* |
---|
4 | * COPYRIGHT (c) 2013-2017 Chris Johns <chrisj@rtems.org> |
---|
5 | * |
---|
6 | * Redistribution and use in source and binary forms, with or without |
---|
7 | * modification, are permitted provided that the following conditions |
---|
8 | * are met: |
---|
9 | * 1. Redistributions of source code must retain the above copyright |
---|
10 | * notice, this list of conditions and the following disclaimer. |
---|
11 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
12 | * notice, this list of conditions and the following disclaimer in the |
---|
13 | * documentation and/or other materials provided with the distribution. |
---|
14 | * |
---|
15 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
16 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
18 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
---|
19 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
20 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
21 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
22 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
23 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
24 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
25 | * POSSIBILITY OF SUCH DAMAGE. |
---|
26 | */ |
---|
27 | |
---|
28 | #include <fcntl.h> |
---|
29 | #include <stdio.h> |
---|
30 | #include <sys/stat.h> |
---|
31 | #include <sys/types.h> |
---|
32 | |
---|
33 | #include <libfdt.h> |
---|
34 | #include <zlib.h> |
---|
35 | |
---|
36 | #include <rtems/malloc.h> |
---|
37 | #include <rtems/rtems-fdt.h> |
---|
38 | #include <rtems/thread.h> |
---|
39 | |
---|
40 | /** |
---|
41 | * An index for quick access to the FDT by name or offset. |
---|
42 | */ |
---|
43 | |
---|
44 | typedef struct |
---|
45 | { |
---|
46 | const char * name; /**< The full path of the FDT item. */ |
---|
47 | int offset; /**< The offset of the item in the FDT blob. */ |
---|
48 | } rtems_fdt_index_entry; |
---|
49 | |
---|
50 | typedef struct |
---|
51 | { |
---|
52 | int num_entries; /**< The number of entries in this index. */ |
---|
53 | rtems_fdt_index_entry* entries; /**< An ordered set of entries which we |
---|
54 | * can binary search. */ |
---|
55 | char* names; /**< Storage allocated for all the path names. */ |
---|
56 | } rtems_fdt_index; |
---|
57 | |
---|
58 | |
---|
59 | /** |
---|
60 | * A blob descriptor. |
---|
61 | */ |
---|
62 | struct rtems_fdt_blob |
---|
63 | { |
---|
64 | rtems_chain_node node; /**< The node's link in the chain. */ |
---|
65 | const void* blob; /**< The FDT blob. */ |
---|
66 | const char* name; /**< The name of the blob. */ |
---|
67 | int refs; /**< The number of active references of the blob. */ |
---|
68 | rtems_fdt_index index; /**< The index used for quick access to items in the blob. */ |
---|
69 | }; |
---|
70 | |
---|
71 | /** |
---|
72 | * The global FDT data. This structure is allocated on the heap when the first |
---|
73 | * call to load a FDT blob is made and released when all blobs have been |
---|
74 | * unloaded.. |
---|
75 | */ |
---|
76 | typedef struct |
---|
77 | { |
---|
78 | rtems_mutex lock; /**< The FDT lock id */ |
---|
79 | rtems_chain_control blobs; /**< List if loaded blobs. */ |
---|
80 | const char* paths; /**< Search paths for blobs. */ |
---|
81 | } rtems_fdt_data; |
---|
82 | |
---|
83 | static void |
---|
84 | rtems_fdt_unlock (rtems_fdt_data *fdt) |
---|
85 | { |
---|
86 | rtems_mutex_unlock (&fdt->lock); |
---|
87 | } |
---|
88 | |
---|
89 | static rtems_fdt_data* |
---|
90 | rtems_fdt_lock (void) |
---|
91 | { |
---|
92 | static rtems_fdt_data fdt_instance = { |
---|
93 | .lock = RTEMS_MUTEX_INITIALIZER ("FDT"), |
---|
94 | .blobs = RTEMS_CHAIN_INITIALIZER_EMPTY (fdt_instance.blobs) |
---|
95 | }; |
---|
96 | rtems_fdt_data *fdt = &fdt_instance; |
---|
97 | |
---|
98 | rtems_mutex_lock (&fdt->lock); |
---|
99 | return fdt; |
---|
100 | } |
---|
101 | |
---|
102 | /** |
---|
103 | * Create an index based on the contents of an FDT blob. |
---|
104 | */ |
---|
105 | static int |
---|
106 | rtems_fdt_init_index (rtems_fdt_handle* fdt, rtems_fdt_blob* blob) |
---|
107 | { |
---|
108 | rtems_fdt_index_entry* entries = NULL; |
---|
109 | int num_entries = 0; |
---|
110 | int entry = 0; |
---|
111 | size_t total_name_memory = 0; |
---|
112 | char node_path[256]; |
---|
113 | int depth_path[32]; |
---|
114 | int start_offset = 0; |
---|
115 | int start_depth = 0; |
---|
116 | int offset = 0; |
---|
117 | int depth = 0; |
---|
118 | char* names = NULL; |
---|
119 | char* names_pos = NULL; |
---|
120 | |
---|
121 | /* |
---|
122 | * Count the number of entries in the blob first. |
---|
123 | */ |
---|
124 | memset(&node_path, 0, sizeof(node_path)); |
---|
125 | strcpy(node_path, "/"); |
---|
126 | depth_path[0] = strlen(node_path); |
---|
127 | |
---|
128 | start_offset = fdt_path_offset(fdt->blob->blob, node_path); |
---|
129 | if (start_offset < 0) |
---|
130 | { |
---|
131 | return start_offset; |
---|
132 | } |
---|
133 | |
---|
134 | start_offset = fdt_next_node(fdt->blob->blob, start_offset, &start_depth); |
---|
135 | if (start_offset < 0) |
---|
136 | { |
---|
137 | return start_offset; |
---|
138 | } |
---|
139 | |
---|
140 | offset = start_offset; |
---|
141 | depth = start_depth; |
---|
142 | |
---|
143 | while (depth > 0) |
---|
144 | { |
---|
145 | /* |
---|
146 | * Construct the node path name. |
---|
147 | */ |
---|
148 | int namelen = 0; |
---|
149 | const char* name = fdt_get_name(blob->blob, offset, &namelen); |
---|
150 | strncpy(&node_path[depth_path[depth-1]], |
---|
151 | name, |
---|
152 | sizeof(node_path) - depth_path[depth-1] - 1); |
---|
153 | |
---|
154 | total_name_memory += strlen(node_path) + 1; |
---|
155 | num_entries++; |
---|
156 | |
---|
157 | if (depth_path[depth-1] + namelen + 2 <= (int)sizeof(node_path)) |
---|
158 | { |
---|
159 | strcpy(&node_path[depth_path[depth-1] + namelen], "/"); |
---|
160 | } |
---|
161 | |
---|
162 | depth_path[depth] = depth_path[depth-1] + namelen + 1; |
---|
163 | |
---|
164 | /* |
---|
165 | * Get the next node. |
---|
166 | */ |
---|
167 | offset = fdt_next_node(fdt->blob->blob, offset, &depth); |
---|
168 | if (offset < 0) |
---|
169 | { |
---|
170 | return offset; |
---|
171 | } |
---|
172 | } |
---|
173 | |
---|
174 | /* |
---|
175 | * Create the index. |
---|
176 | */ |
---|
177 | entries = rtems_calloc(num_entries, sizeof(rtems_fdt_index_entry)); |
---|
178 | if (!entries) |
---|
179 | { |
---|
180 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
181 | } |
---|
182 | |
---|
183 | names = rtems_calloc(1, total_name_memory); |
---|
184 | if (!names) |
---|
185 | { |
---|
186 | free(entries); |
---|
187 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
188 | } |
---|
189 | |
---|
190 | /* |
---|
191 | * Populate the index. |
---|
192 | */ |
---|
193 | offset = start_offset; |
---|
194 | depth = start_depth; |
---|
195 | entry = 0; |
---|
196 | names_pos = names; |
---|
197 | |
---|
198 | while (depth > 0) |
---|
199 | { |
---|
200 | /* |
---|
201 | * Record this node in an entry. |
---|
202 | */ |
---|
203 | int namelen = 0; |
---|
204 | const char* name = fdt_get_name(blob->blob, offset, &namelen); |
---|
205 | strncpy(&node_path[depth_path[depth-1]], |
---|
206 | name, |
---|
207 | sizeof(node_path) - depth_path[depth-1] - 1); |
---|
208 | strcpy(names_pos, node_path); |
---|
209 | |
---|
210 | entries[entry].name = names_pos; |
---|
211 | entries[entry].offset = offset; |
---|
212 | |
---|
213 | names_pos += strlen(node_path) + 1; |
---|
214 | entry++; |
---|
215 | |
---|
216 | if (depth_path[depth-1] + namelen + 2 <= (int)sizeof(node_path)) |
---|
217 | { |
---|
218 | strcpy(&node_path[depth_path[depth-1] + namelen], "/"); |
---|
219 | } |
---|
220 | |
---|
221 | depth_path[depth] = depth_path[depth-1] + namelen + 1; |
---|
222 | |
---|
223 | /* |
---|
224 | * Get the next node. |
---|
225 | */ |
---|
226 | offset = fdt_next_node(fdt->blob->blob, offset, &depth); |
---|
227 | if (offset < 0) |
---|
228 | { |
---|
229 | free(entries); |
---|
230 | free(names); |
---|
231 | return offset; |
---|
232 | } |
---|
233 | } |
---|
234 | |
---|
235 | fdt->blob->index.entries = entries; |
---|
236 | fdt->blob->index.num_entries = num_entries; |
---|
237 | fdt->blob->index.names = names; |
---|
238 | |
---|
239 | return 0; |
---|
240 | } |
---|
241 | |
---|
242 | /** |
---|
243 | * Release the contents of the index, freeing memory. |
---|
244 | */ |
---|
245 | static void |
---|
246 | rtems_fdt_release_index (rtems_fdt_index* index) |
---|
247 | { |
---|
248 | if (index->entries) |
---|
249 | { |
---|
250 | free(index->entries); |
---|
251 | free(index->names); |
---|
252 | |
---|
253 | index->num_entries = 0; |
---|
254 | index->entries = NULL; |
---|
255 | index->names = NULL; |
---|
256 | } |
---|
257 | } |
---|
258 | |
---|
259 | /** |
---|
260 | * For a given FDT path, find the corresponding offset. |
---|
261 | * Returns -1 if not found; |
---|
262 | */ |
---|
263 | static int |
---|
264 | rtems_fdt_index_find_by_name(rtems_fdt_index* index, |
---|
265 | const char* name) |
---|
266 | { |
---|
267 | int min = 0; |
---|
268 | int max = index->num_entries; |
---|
269 | /* |
---|
270 | * Handle trailing slash case. |
---|
271 | */ |
---|
272 | size_t namelen = strlen(name); |
---|
273 | if (namelen > 0 && name[namelen-1] == '/') |
---|
274 | { |
---|
275 | namelen--; |
---|
276 | } |
---|
277 | |
---|
278 | /* Binary search for the name. */ |
---|
279 | while (min < max) |
---|
280 | { |
---|
281 | int middle = (min + max) / 2; |
---|
282 | int cmp = strncmp(name, index->entries[middle].name, namelen); |
---|
283 | if (cmp == 0) |
---|
284 | { |
---|
285 | /* 'namelen' characters are equal but 'index->entries[middle].name' */ |
---|
286 | /* could have additional characters. */ |
---|
287 | if (index->entries[middle].name[namelen] == '\0') |
---|
288 | { |
---|
289 | /* Found it. */ |
---|
290 | return index->entries[middle].offset; |
---|
291 | } |
---|
292 | else |
---|
293 | { |
---|
294 | /* 'index->entries[middle].name' is longer than 'name'. */ |
---|
295 | cmp = -1; |
---|
296 | } |
---|
297 | } |
---|
298 | if (cmp < 0) |
---|
299 | { |
---|
300 | /* Look lower than here. */ |
---|
301 | max = middle; |
---|
302 | } |
---|
303 | else |
---|
304 | { |
---|
305 | /* Look higher than here. */ |
---|
306 | min = middle + 1; |
---|
307 | } |
---|
308 | } |
---|
309 | |
---|
310 | /* Didn't find it. */ |
---|
311 | return -FDT_ERR_NOTFOUND; |
---|
312 | } |
---|
313 | |
---|
314 | /** |
---|
315 | * For a given FDT offset, find the corresponding path name. |
---|
316 | */ |
---|
317 | static const char * |
---|
318 | rtems_fdt_index_find_name_by_offset(rtems_fdt_index* index, |
---|
319 | int offset) |
---|
320 | { |
---|
321 | int min = 0; |
---|
322 | int max = index->num_entries; |
---|
323 | |
---|
324 | /* |
---|
325 | * Binary search for the offset. |
---|
326 | */ |
---|
327 | while (min < max) |
---|
328 | { |
---|
329 | int middle = (min + max) / 2; |
---|
330 | if (offset < index->entries[middle].offset) |
---|
331 | { |
---|
332 | /* Look lower than here. */ |
---|
333 | max = middle; |
---|
334 | } |
---|
335 | else if (offset > index->entries[middle].offset) |
---|
336 | { |
---|
337 | /* Look higher than here. */ |
---|
338 | min = middle + 1; |
---|
339 | } |
---|
340 | else |
---|
341 | { |
---|
342 | /* Found it. */ |
---|
343 | return index->entries[middle].name; |
---|
344 | } |
---|
345 | } |
---|
346 | |
---|
347 | /* Didn't find it. */ |
---|
348 | return NULL; |
---|
349 | } |
---|
350 | |
---|
351 | void |
---|
352 | rtems_fdt_init_handle (rtems_fdt_handle* handle) |
---|
353 | { |
---|
354 | if (handle) |
---|
355 | handle->blob = NULL; |
---|
356 | } |
---|
357 | |
---|
358 | void |
---|
359 | rtems_fdt_dup_handle (rtems_fdt_handle* from, rtems_fdt_handle* to) |
---|
360 | { |
---|
361 | if (from && to) |
---|
362 | { |
---|
363 | rtems_fdt_data* fdt; |
---|
364 | |
---|
365 | fdt = rtems_fdt_lock (); |
---|
366 | to->blob = from->blob; |
---|
367 | ++to->blob->refs; |
---|
368 | rtems_fdt_unlock (fdt); |
---|
369 | } |
---|
370 | } |
---|
371 | |
---|
372 | void |
---|
373 | rtems_fdt_release_handle (rtems_fdt_handle* handle) |
---|
374 | { |
---|
375 | if (handle && handle->blob) |
---|
376 | { |
---|
377 | rtems_fdt_data* fdt; |
---|
378 | rtems_chain_node* node; |
---|
379 | |
---|
380 | fdt = rtems_fdt_lock (); |
---|
381 | |
---|
382 | node = rtems_chain_first (&fdt->blobs); |
---|
383 | |
---|
384 | while (!rtems_chain_is_tail (&fdt->blobs, node)) |
---|
385 | { |
---|
386 | rtems_fdt_blob* blob = (rtems_fdt_blob*) node; |
---|
387 | if (handle->blob == blob) |
---|
388 | { |
---|
389 | if (blob->refs) |
---|
390 | --blob->refs; |
---|
391 | break; |
---|
392 | } |
---|
393 | node = rtems_chain_next (node); |
---|
394 | } |
---|
395 | |
---|
396 | rtems_fdt_unlock (fdt); |
---|
397 | |
---|
398 | handle->blob = NULL; |
---|
399 | } |
---|
400 | } |
---|
401 | |
---|
402 | bool |
---|
403 | rtems_fdt_valid_handle (const rtems_fdt_handle* handle) |
---|
404 | { |
---|
405 | if (handle && handle->blob) |
---|
406 | { |
---|
407 | rtems_fdt_data* fdt; |
---|
408 | rtems_chain_node* node; |
---|
409 | |
---|
410 | fdt = rtems_fdt_lock (); |
---|
411 | |
---|
412 | node = rtems_chain_first (&fdt->blobs); |
---|
413 | |
---|
414 | while (!rtems_chain_is_tail (&fdt->blobs, node)) |
---|
415 | { |
---|
416 | rtems_fdt_blob* blob = (rtems_fdt_blob*) node; |
---|
417 | if (handle->blob == blob) |
---|
418 | { |
---|
419 | rtems_fdt_unlock (fdt); |
---|
420 | return true; |
---|
421 | } |
---|
422 | node = rtems_chain_next (node); |
---|
423 | } |
---|
424 | |
---|
425 | rtems_fdt_unlock (fdt); |
---|
426 | } |
---|
427 | |
---|
428 | return false; |
---|
429 | } |
---|
430 | |
---|
431 | int |
---|
432 | rtems_fdt_find_path_offset (rtems_fdt_handle* handle, const char* path) |
---|
433 | { |
---|
434 | rtems_fdt_data* fdt; |
---|
435 | rtems_chain_node* node; |
---|
436 | |
---|
437 | rtems_fdt_release_handle (handle); |
---|
438 | |
---|
439 | fdt = rtems_fdt_lock (); |
---|
440 | |
---|
441 | node = rtems_chain_first (&fdt->blobs); |
---|
442 | |
---|
443 | while (!rtems_chain_is_tail (&fdt->blobs, node)) |
---|
444 | { |
---|
445 | rtems_fdt_handle temp_handle; |
---|
446 | int offset; |
---|
447 | |
---|
448 | temp_handle.blob = (rtems_fdt_blob*) node; |
---|
449 | |
---|
450 | offset = rtems_fdt_path_offset (&temp_handle, path); |
---|
451 | |
---|
452 | if (offset >= 0) |
---|
453 | { |
---|
454 | ++temp_handle.blob->refs; |
---|
455 | handle->blob = temp_handle.blob; |
---|
456 | rtems_fdt_unlock (fdt); |
---|
457 | return offset; |
---|
458 | } |
---|
459 | |
---|
460 | node = rtems_chain_next (node); |
---|
461 | } |
---|
462 | |
---|
463 | rtems_fdt_unlock (fdt); |
---|
464 | |
---|
465 | return -FDT_ERR_NOTFOUND; |
---|
466 | } |
---|
467 | |
---|
468 | int |
---|
469 | rtems_fdt_load (const char* filename, rtems_fdt_handle* handle) |
---|
470 | { |
---|
471 | rtems_fdt_data* fdt; |
---|
472 | rtems_fdt_blob* blob; |
---|
473 | size_t bsize; |
---|
474 | int bf; |
---|
475 | ssize_t r; |
---|
476 | size_t name_len; |
---|
477 | int fe; |
---|
478 | struct stat sb; |
---|
479 | uint8_t gzip_id[2]; |
---|
480 | uint8_t* cdata; |
---|
481 | size_t size; |
---|
482 | |
---|
483 | rtems_fdt_release_handle (handle); |
---|
484 | |
---|
485 | if (stat (filename, &sb) < 0) |
---|
486 | { |
---|
487 | return -RTEMS_FDT_ERR_NOT_FOUND; |
---|
488 | } |
---|
489 | |
---|
490 | bf = open(filename, O_RDONLY); |
---|
491 | if (bf < 0) |
---|
492 | { |
---|
493 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
494 | } |
---|
495 | |
---|
496 | r = read(bf, &gzip_id, sizeof(gzip_id)); |
---|
497 | if (r < 0) |
---|
498 | { |
---|
499 | close(bf); |
---|
500 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
501 | } |
---|
502 | |
---|
503 | if ((gzip_id[0] == 0x1f) && (gzip_id[1] == 0x8b)) |
---|
504 | { |
---|
505 | size_t offset; |
---|
506 | |
---|
507 | cdata = rtems_malloc(sb.st_size); |
---|
508 | if (!cdata) |
---|
509 | { |
---|
510 | close (bf); |
---|
511 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
512 | } |
---|
513 | |
---|
514 | if (lseek(bf, 0, SEEK_SET) < 0) |
---|
515 | { |
---|
516 | free(cdata); |
---|
517 | close(bf); |
---|
518 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
519 | } |
---|
520 | |
---|
521 | size = sb.st_size; |
---|
522 | offset = 0; |
---|
523 | while (size) |
---|
524 | { |
---|
525 | r = read(bf, cdata + offset, size); |
---|
526 | if (r < 0) |
---|
527 | { |
---|
528 | free(cdata); |
---|
529 | close(bf); |
---|
530 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
531 | } |
---|
532 | size -= r; |
---|
533 | offset += r; |
---|
534 | } |
---|
535 | |
---|
536 | offset = sb.st_size - 4; |
---|
537 | bsize = ((cdata[offset + 3] << 24) | (cdata[offset + 2] << 16) | |
---|
538 | (cdata[offset + 1] << 8) | cdata[offset + 0]); |
---|
539 | } |
---|
540 | else |
---|
541 | { |
---|
542 | cdata = NULL; |
---|
543 | bsize = sb.st_size; |
---|
544 | } |
---|
545 | |
---|
546 | name_len = strlen (filename) + 1; |
---|
547 | |
---|
548 | blob = rtems_malloc(sizeof (rtems_fdt_blob) + name_len + bsize); |
---|
549 | if (!blob) |
---|
550 | { |
---|
551 | free(cdata); |
---|
552 | close (bf); |
---|
553 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
554 | } |
---|
555 | |
---|
556 | blob->name = (const char*) (blob + 1); |
---|
557 | blob->blob = blob->name + name_len + 1; |
---|
558 | |
---|
559 | strcpy ((char*) blob->name, filename); |
---|
560 | |
---|
561 | if ((gzip_id[0] == 0x1f) && (gzip_id[1] == 0x8b)) |
---|
562 | { |
---|
563 | z_stream stream; |
---|
564 | int err; |
---|
565 | stream.next_in = (Bytef*) cdata; |
---|
566 | stream.avail_in = (uInt) sb.st_size; |
---|
567 | stream.next_out = (void*) (blob->name + name_len + 1); |
---|
568 | stream.avail_out = (uInt) bsize; |
---|
569 | stream.zalloc = (alloc_func) 0; |
---|
570 | stream.zfree = (free_func) 0; |
---|
571 | err = inflateInit(&stream); |
---|
572 | if (err == Z_OK) |
---|
573 | err = inflateReset2(&stream, 31); |
---|
574 | if (err == Z_OK) |
---|
575 | err = inflate(&stream, Z_FINISH); |
---|
576 | if ((err == Z_OK) || (err == Z_STREAM_END)) |
---|
577 | err = inflateEnd(&stream); |
---|
578 | if ((err != Z_OK) || (bsize != stream.total_out)) |
---|
579 | { |
---|
580 | free (blob); |
---|
581 | free(cdata); |
---|
582 | close (bf); |
---|
583 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
584 | } |
---|
585 | free(cdata); |
---|
586 | cdata = NULL; |
---|
587 | } |
---|
588 | else |
---|
589 | { |
---|
590 | char* buf = (char*) blob->name + name_len + 1; |
---|
591 | size = bsize; |
---|
592 | while (size) |
---|
593 | { |
---|
594 | r = read (bf, buf, size); |
---|
595 | if (r < 0) |
---|
596 | { |
---|
597 | free (blob); |
---|
598 | close (bf); |
---|
599 | return -RTEMS_FDT_ERR_READ_FAIL; |
---|
600 | } |
---|
601 | size -= r; |
---|
602 | buf += r; |
---|
603 | } |
---|
604 | } |
---|
605 | |
---|
606 | fe = fdt_check_header(blob->blob); |
---|
607 | if (fe < 0) |
---|
608 | { |
---|
609 | free (blob); |
---|
610 | close (bf); |
---|
611 | return fe; |
---|
612 | } |
---|
613 | |
---|
614 | fdt = rtems_fdt_lock (); |
---|
615 | |
---|
616 | rtems_chain_append_unprotected (&fdt->blobs, &blob->node); |
---|
617 | |
---|
618 | blob->refs = 1; |
---|
619 | |
---|
620 | rtems_fdt_unlock (fdt); |
---|
621 | |
---|
622 | handle->blob = blob; |
---|
623 | |
---|
624 | fe = rtems_fdt_init_index(handle, blob); |
---|
625 | if (fe < 0) |
---|
626 | { |
---|
627 | free (blob); |
---|
628 | close (bf); |
---|
629 | return fe; |
---|
630 | } |
---|
631 | |
---|
632 | close (bf); |
---|
633 | return 0; |
---|
634 | } |
---|
635 | |
---|
636 | int |
---|
637 | rtems_fdt_register (const void* dtb, rtems_fdt_handle* handle) |
---|
638 | { |
---|
639 | rtems_fdt_data* fdt; |
---|
640 | rtems_fdt_blob* blob; |
---|
641 | int fe; |
---|
642 | |
---|
643 | rtems_fdt_release_handle (handle); |
---|
644 | |
---|
645 | fe = fdt_check_header(dtb); |
---|
646 | if (fe < 0) |
---|
647 | { |
---|
648 | return fe; |
---|
649 | } |
---|
650 | |
---|
651 | blob = rtems_malloc(sizeof (rtems_fdt_blob)); |
---|
652 | if (!blob) |
---|
653 | { |
---|
654 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
655 | } |
---|
656 | |
---|
657 | blob->blob = dtb; |
---|
658 | blob->name = NULL; |
---|
659 | rtems_chain_initialize_node(&blob->node); |
---|
660 | |
---|
661 | fdt = rtems_fdt_lock (); |
---|
662 | |
---|
663 | rtems_chain_append_unprotected (&fdt->blobs, &blob->node); |
---|
664 | |
---|
665 | blob->refs = 1; |
---|
666 | |
---|
667 | rtems_fdt_unlock (fdt); |
---|
668 | |
---|
669 | handle->blob = blob; |
---|
670 | |
---|
671 | fe = rtems_fdt_init_index(handle, blob); |
---|
672 | if (fe < 0) |
---|
673 | { |
---|
674 | free(blob); |
---|
675 | return -RTEMS_FDT_ERR_NO_MEMORY; |
---|
676 | } |
---|
677 | |
---|
678 | return 0; |
---|
679 | } |
---|
680 | |
---|
681 | int |
---|
682 | rtems_fdt_unload (rtems_fdt_handle* handle) |
---|
683 | { |
---|
684 | rtems_fdt_data* fdt; |
---|
685 | |
---|
686 | fdt = rtems_fdt_lock (); |
---|
687 | |
---|
688 | if (!rtems_fdt_valid_handle (handle)) |
---|
689 | { |
---|
690 | rtems_fdt_unlock (fdt); |
---|
691 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
692 | } |
---|
693 | |
---|
694 | if (handle->blob->refs > 1) |
---|
695 | { |
---|
696 | rtems_fdt_unlock (fdt); |
---|
697 | return -RTEMS_FDT_ERR_REFERENCED; |
---|
698 | } |
---|
699 | |
---|
700 | rtems_chain_extract_unprotected (&handle->blob->node); |
---|
701 | |
---|
702 | rtems_fdt_release_index(&handle->blob->index); |
---|
703 | |
---|
704 | free (handle->blob); |
---|
705 | |
---|
706 | handle->blob = NULL; |
---|
707 | |
---|
708 | rtems_fdt_unlock (fdt); |
---|
709 | |
---|
710 | return 0; |
---|
711 | } |
---|
712 | |
---|
713 | int |
---|
714 | rtems_fdt_num_mem_rsv (rtems_fdt_handle* handle) |
---|
715 | { |
---|
716 | if (!handle->blob) |
---|
717 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
718 | return fdt_num_mem_rsv (handle->blob->blob); |
---|
719 | } |
---|
720 | |
---|
721 | int |
---|
722 | rtems_fdt_get_mem_rsv (rtems_fdt_handle* handle, |
---|
723 | int n, |
---|
724 | uint64_t* address, |
---|
725 | uint64_t* size) |
---|
726 | { |
---|
727 | if (!handle->blob) |
---|
728 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
729 | return fdt_get_mem_rsv (handle->blob->blob, n, address, size); |
---|
730 | } |
---|
731 | |
---|
732 | int |
---|
733 | rtems_fdt_subnode_offset_namelen (rtems_fdt_handle* handle, |
---|
734 | int parentoffset, |
---|
735 | const char* name, |
---|
736 | int namelen) |
---|
737 | { |
---|
738 | if (!handle->blob) |
---|
739 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
740 | return fdt_subnode_offset_namelen (handle->blob->blob, |
---|
741 | parentoffset, |
---|
742 | name, |
---|
743 | namelen); |
---|
744 | } |
---|
745 | |
---|
746 | int |
---|
747 | rtems_fdt_subnode_offset (rtems_fdt_handle* handle, |
---|
748 | int parentoffset, |
---|
749 | const char* name) |
---|
750 | { |
---|
751 | char full_name[256]; |
---|
752 | const char *path; |
---|
753 | |
---|
754 | if (!handle->blob) |
---|
755 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
756 | |
---|
757 | path = rtems_fdt_index_find_name_by_offset(&handle->blob->index, parentoffset); |
---|
758 | snprintf(full_name, sizeof(full_name), "%s/%s", path, name); |
---|
759 | |
---|
760 | return rtems_fdt_index_find_by_name(&handle->blob->index, full_name); |
---|
761 | } |
---|
762 | |
---|
763 | int |
---|
764 | rtems_fdt_path_offset (rtems_fdt_handle* handle, const char* path) |
---|
765 | { |
---|
766 | return rtems_fdt_index_find_by_name(&handle->blob->index, path); |
---|
767 | } |
---|
768 | |
---|
769 | const char* |
---|
770 | rtems_fdt_get_name (rtems_fdt_handle* handle, int nodeoffset, int* length) |
---|
771 | { |
---|
772 | if (!handle->blob) |
---|
773 | return NULL; |
---|
774 | |
---|
775 | const char *name = rtems_fdt_index_find_name_by_offset(&handle->blob->index, nodeoffset); |
---|
776 | if (name && length) |
---|
777 | { |
---|
778 | *length = strlen(name); |
---|
779 | } |
---|
780 | |
---|
781 | return name; |
---|
782 | } |
---|
783 | |
---|
784 | int |
---|
785 | rtems_fdt_first_prop_offset(rtems_fdt_handle* handle, int nodeoffset) |
---|
786 | { |
---|
787 | return fdt_first_property_offset(handle->blob->blob, nodeoffset); |
---|
788 | } |
---|
789 | |
---|
790 | int |
---|
791 | rtems_fdt_next_prop_offset(rtems_fdt_handle* handle, int propoffset) |
---|
792 | { |
---|
793 | return fdt_next_property_offset(handle->blob->blob, propoffset); |
---|
794 | } |
---|
795 | |
---|
796 | const void* |
---|
797 | rtems_fdt_getprop_by_offset(rtems_fdt_handle* handle, |
---|
798 | int propoffset, |
---|
799 | const char** name, |
---|
800 | int* length) |
---|
801 | { |
---|
802 | return fdt_getprop_by_offset(handle->blob->blob, propoffset, name, length); |
---|
803 | } |
---|
804 | |
---|
805 | const void* |
---|
806 | rtems_fdt_getprop_namelen (rtems_fdt_handle* handle, |
---|
807 | int nodeoffset, |
---|
808 | const char* name, |
---|
809 | int namelen, |
---|
810 | int* length) |
---|
811 | { |
---|
812 | if (!handle->blob) |
---|
813 | return NULL; |
---|
814 | return fdt_getprop_namelen (handle->blob->blob, |
---|
815 | nodeoffset, |
---|
816 | name, |
---|
817 | namelen, |
---|
818 | length); |
---|
819 | } |
---|
820 | |
---|
821 | const void* |
---|
822 | rtems_fdt_getprop (rtems_fdt_handle* handle, |
---|
823 | int nodeoffset, |
---|
824 | const char* name, |
---|
825 | int* length) |
---|
826 | { |
---|
827 | if (!handle->blob) |
---|
828 | return NULL; |
---|
829 | return fdt_getprop (handle->blob->blob, |
---|
830 | nodeoffset, |
---|
831 | name, |
---|
832 | length); |
---|
833 | } |
---|
834 | |
---|
835 | uint32_t |
---|
836 | rtems_fdt_get_phandle (rtems_fdt_handle* handle, int nodeoffset) |
---|
837 | { |
---|
838 | if (!handle->blob) |
---|
839 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
840 | return fdt_get_phandle (handle->blob->blob, nodeoffset); |
---|
841 | } |
---|
842 | |
---|
843 | const char* |
---|
844 | rtems_fdt_get_alias_namelen (rtems_fdt_handle* handle, |
---|
845 | const char* name, |
---|
846 | int namelen) |
---|
847 | { |
---|
848 | if (!handle->blob) |
---|
849 | return NULL; |
---|
850 | return fdt_get_alias_namelen (handle->blob->blob, name, namelen); |
---|
851 | } |
---|
852 | |
---|
853 | const char* |
---|
854 | rtems_fdt_get_alias (rtems_fdt_handle* handle, const char* name) |
---|
855 | { |
---|
856 | if (!handle->blob) |
---|
857 | return NULL; |
---|
858 | return fdt_get_alias (handle->blob->blob, name); |
---|
859 | } |
---|
860 | |
---|
861 | int |
---|
862 | rtems_fdt_get_path (rtems_fdt_handle* handle, |
---|
863 | int nodeoffset, |
---|
864 | char* buf, |
---|
865 | int buflen) |
---|
866 | { |
---|
867 | if (!handle->blob) |
---|
868 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
869 | return fdt_get_path (handle->blob->blob, nodeoffset, buf, buflen); |
---|
870 | } |
---|
871 | |
---|
872 | int |
---|
873 | rtems_fdt_supernode_atdepth_offset (rtems_fdt_handle* handle, |
---|
874 | int nodeoffset, |
---|
875 | int supernodedepth, |
---|
876 | int* nodedepth) |
---|
877 | { |
---|
878 | if (!handle->blob) |
---|
879 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
880 | return fdt_supernode_atdepth_offset(handle, |
---|
881 | nodeoffset, |
---|
882 | supernodedepth, |
---|
883 | nodedepth); |
---|
884 | } |
---|
885 | |
---|
886 | int |
---|
887 | rtems_fdt_node_depth (rtems_fdt_handle* handle, int nodeoffset) |
---|
888 | { |
---|
889 | if (!handle->blob) |
---|
890 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
891 | return fdt_node_depth (handle->blob->blob, nodeoffset); |
---|
892 | } |
---|
893 | |
---|
894 | int |
---|
895 | rtems_fdt_parent_offset (rtems_fdt_handle* handle, int nodeoffset) |
---|
896 | { |
---|
897 | if (!handle->blob) |
---|
898 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
899 | return fdt_parent_offset (handle->blob->blob, nodeoffset); |
---|
900 | } |
---|
901 | |
---|
902 | int |
---|
903 | rtems_fdt_node_offset_by_prop_value (rtems_fdt_handle* handle, |
---|
904 | int startoffset, |
---|
905 | const char* propname, |
---|
906 | const void* propval, |
---|
907 | int proplen) |
---|
908 | { |
---|
909 | if (!handle->blob) |
---|
910 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
911 | return fdt_node_offset_by_prop_value (handle, |
---|
912 | startoffset, |
---|
913 | propname, |
---|
914 | propval, |
---|
915 | proplen); |
---|
916 | } |
---|
917 | |
---|
918 | int |
---|
919 | rtems_fdt_node_offset_by_phandle (rtems_fdt_handle* handle, uint32_t phandle) |
---|
920 | { |
---|
921 | if (!handle->blob) |
---|
922 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
923 | return fdt_node_offset_by_phandle (handle->blob->blob, phandle); |
---|
924 | } |
---|
925 | |
---|
926 | int |
---|
927 | rtems_fdt_node_check_compatible (rtems_fdt_handle* handle, |
---|
928 | int nodeoffset, |
---|
929 | const char* compatible) |
---|
930 | { |
---|
931 | if (!handle->blob) |
---|
932 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
933 | return fdt_node_check_compatible (handle, nodeoffset, compatible); |
---|
934 | } |
---|
935 | |
---|
936 | int |
---|
937 | rtems_fdt_node_offset_by_compatible (rtems_fdt_handle* handle, |
---|
938 | int startoffset, |
---|
939 | const char* compatible) |
---|
940 | { |
---|
941 | if (!handle->blob) |
---|
942 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
943 | return fdt_node_offset_by_compatible (handle->blob->blob, |
---|
944 | startoffset, |
---|
945 | compatible); |
---|
946 | } |
---|
947 | |
---|
948 | int |
---|
949 | rtems_fdt_next_node (rtems_fdt_handle* handle, int offset, int* depth) |
---|
950 | { |
---|
951 | if (!handle->blob) |
---|
952 | return -RTEMS_FDT_ERR_INVALID_HANDLE; |
---|
953 | return fdt_next_node (handle->blob->blob, offset, depth); |
---|
954 | } |
---|
955 | |
---|
956 | const char* |
---|
957 | rtems_fdt_strerror (int errval) |
---|
958 | { |
---|
959 | const char* errors[] = { |
---|
960 | "invalid handle", |
---|
961 | "no memory", |
---|
962 | "file not found", |
---|
963 | "DTB read fail", |
---|
964 | "blob has references", |
---|
965 | "bad length" |
---|
966 | }; |
---|
967 | if (errval > -RTEMS_FDT_ERR_RTEMS_MIN) |
---|
968 | return fdt_strerror (errval); |
---|
969 | if (errval < -RTEMS_FDT_ERR_MAX) |
---|
970 | return "invalid error code"; |
---|
971 | return errors[(-errval) - RTEMS_FDT_ERR_RTEMS_MIN]; |
---|
972 | } |
---|
973 | |
---|
974 | int |
---|
975 | rtems_fdt_prop_value(const char* const path, |
---|
976 | const char* const propname, |
---|
977 | void* value, |
---|
978 | size_t* size) |
---|
979 | { |
---|
980 | rtems_fdt_handle fdt; |
---|
981 | int node; |
---|
982 | const void* prop; |
---|
983 | int length; |
---|
984 | |
---|
985 | rtems_fdt_init_handle (&fdt); |
---|
986 | |
---|
987 | node = rtems_fdt_find_path_offset (&fdt, path); |
---|
988 | if (node < 0) |
---|
989 | return node; |
---|
990 | |
---|
991 | prop = rtems_fdt_getprop(&fdt, node, propname, &length); |
---|
992 | if (length < 0) |
---|
993 | { |
---|
994 | rtems_fdt_release_handle (&fdt); |
---|
995 | return length; |
---|
996 | } |
---|
997 | |
---|
998 | if (length > (int) *size) |
---|
999 | { |
---|
1000 | rtems_fdt_release_handle (&fdt); |
---|
1001 | return -RTEMS_FDT_ERR_BADPATH; |
---|
1002 | } |
---|
1003 | |
---|
1004 | *size = length; |
---|
1005 | |
---|
1006 | memcpy (value, prop, length); |
---|
1007 | |
---|
1008 | return 0; |
---|
1009 | } |
---|
1010 | |
---|
1011 | bool |
---|
1012 | rtems_fdt_get_parent_prop_value(rtems_fdt_handle* handle, |
---|
1013 | int nodeoffset, |
---|
1014 | const char* name, |
---|
1015 | uint32_t* value) |
---|
1016 | { |
---|
1017 | const void* prop; |
---|
1018 | int plen = 0; |
---|
1019 | int node = rtems_fdt_parent_offset(handle, nodeoffset); |
---|
1020 | if (node < 0) |
---|
1021 | return false; |
---|
1022 | prop = rtems_fdt_getprop(handle, node, name, &plen); |
---|
1023 | if (plen < 0) |
---|
1024 | return false; |
---|
1025 | *value = rtems_fdt_get_uint32(prop); |
---|
1026 | return true; |
---|
1027 | } |
---|
1028 | |
---|
1029 | int |
---|
1030 | rtems_fdt_prop_map(const char* const path, |
---|
1031 | const char* const propname, |
---|
1032 | const char* const names[], |
---|
1033 | uintptr_t* values, |
---|
1034 | size_t count) |
---|
1035 | { |
---|
1036 | rtems_fdt_handle fdt; |
---|
1037 | int node; |
---|
1038 | size_t item; |
---|
1039 | |
---|
1040 | rtems_fdt_init_handle (&fdt); |
---|
1041 | |
---|
1042 | node = rtems_fdt_find_path_offset (&fdt, path); |
---|
1043 | if (node < 0) |
---|
1044 | return node; |
---|
1045 | |
---|
1046 | for (item = 0; item < count; item++) |
---|
1047 | { |
---|
1048 | const void* prop; |
---|
1049 | int length; |
---|
1050 | int subnode; |
---|
1051 | |
---|
1052 | subnode = rtems_fdt_subnode_offset (&fdt, node, names[item]); |
---|
1053 | if (subnode < 0) |
---|
1054 | { |
---|
1055 | rtems_fdt_release_handle (&fdt); |
---|
1056 | return subnode; |
---|
1057 | } |
---|
1058 | |
---|
1059 | prop = rtems_fdt_getprop(&fdt, subnode, propname, &length); |
---|
1060 | if (length < 0) |
---|
1061 | { |
---|
1062 | rtems_fdt_release_handle (&fdt); |
---|
1063 | return length; |
---|
1064 | } |
---|
1065 | |
---|
1066 | if (length > sizeof (uintptr_t)) |
---|
1067 | { |
---|
1068 | rtems_fdt_release_handle (&fdt); |
---|
1069 | return -RTEMS_FDT_ERR_BADPATH; |
---|
1070 | } |
---|
1071 | |
---|
1072 | values[item] = rtems_fdt_get_offset_len_uintptr(prop, 0, length); |
---|
1073 | } |
---|
1074 | |
---|
1075 | return 0; |
---|
1076 | } |
---|
1077 | |
---|
1078 | uintptr_t |
---|
1079 | rtems_fdt_get_offset_len_uintptr (const void* prop, int offset, int len) |
---|
1080 | { |
---|
1081 | const uint8_t* p = prop; |
---|
1082 | uintptr_t value = 0; |
---|
1083 | int b; |
---|
1084 | if (len <= sizeof(uintptr_t)) { |
---|
1085 | for (b = 0; b < len; ++b) { |
---|
1086 | value = (value << 8) | (uintptr_t) p[offset++]; |
---|
1087 | } |
---|
1088 | } |
---|
1089 | return value; |
---|
1090 | } |
---|
1091 | |
---|
1092 | |
---|
1093 | uint32_t |
---|
1094 | rtems_fdt_get_offset_uint32 (const void* prop, int offset) |
---|
1095 | { |
---|
1096 | const uint8_t* p = prop; |
---|
1097 | uint32_t value; |
---|
1098 | offset *= sizeof(uint32_t); |
---|
1099 | value = ((((uint32_t) p[offset + 0]) << 24) | |
---|
1100 | (((uint32_t) p[offset + 1]) << 16) | |
---|
1101 | (((uint32_t) p[offset + 2]) << 8) | |
---|
1102 | (uint32_t) p[offset + 3]); |
---|
1103 | return value; |
---|
1104 | } |
---|
1105 | |
---|
1106 | uint32_t |
---|
1107 | rtems_fdt_get_uint32 (const void* prop) |
---|
1108 | { |
---|
1109 | return rtems_fdt_get_offset_uint32(prop, 0); |
---|
1110 | } |
---|
1111 | |
---|
1112 | uint64_t |
---|
1113 | rtems_fdt_get_offset_uint64 (const void* prop, int offset) |
---|
1114 | { |
---|
1115 | uint64_t value = rtems_fdt_get_offset_uint32(prop, offset); |
---|
1116 | value = (value << 16) << 16; |
---|
1117 | return value | rtems_fdt_get_offset_uint32(prop, offset + 1); |
---|
1118 | } |
---|
1119 | |
---|
1120 | uint64_t |
---|
1121 | rtems_fdt_get_uint64 (const void* prop) |
---|
1122 | { |
---|
1123 | return rtems_fdt_get_offset_uint64(prop, 0); |
---|
1124 | } |
---|
1125 | |
---|
1126 | uintptr_t |
---|
1127 | rtems_fdt_get_uintptr (const void* prop) |
---|
1128 | { |
---|
1129 | return rtems_fdt_get_offset_uintptr(prop, 0); |
---|
1130 | } |
---|
1131 | |
---|
1132 | uintptr_t |
---|
1133 | rtems_fdt_get_offset_uintptr (const void* prop, int offset) |
---|
1134 | { |
---|
1135 | if (sizeof(intptr_t) == sizeof(uint32_t)) |
---|
1136 | return rtems_fdt_get_offset_uint32(prop, offset); |
---|
1137 | return rtems_fdt_get_offset_uint64(prop, offset); |
---|
1138 | } |
---|
1139 | |
---|
1140 | int |
---|
1141 | rtems_fdt_get_value (const char* path, |
---|
1142 | const char* property, |
---|
1143 | size_t size, |
---|
1144 | uintptr_t* value) |
---|
1145 | { |
---|
1146 | rtems_fdt_handle fdt; |
---|
1147 | const void* prop; |
---|
1148 | int node; |
---|
1149 | int length; |
---|
1150 | |
---|
1151 | rtems_fdt_init_handle (&fdt); |
---|
1152 | |
---|
1153 | node = rtems_fdt_find_path_offset (&fdt, path); |
---|
1154 | if (node < 0) |
---|
1155 | { |
---|
1156 | rtems_fdt_release_handle (&fdt); |
---|
1157 | return node; |
---|
1158 | } |
---|
1159 | |
---|
1160 | prop = rtems_fdt_getprop(&fdt, node, property, &length); |
---|
1161 | if (length < 0) |
---|
1162 | { |
---|
1163 | rtems_fdt_release_handle (&fdt); |
---|
1164 | return length; |
---|
1165 | } |
---|
1166 | |
---|
1167 | if (length == sizeof (uintptr_t)) |
---|
1168 | *value = rtems_fdt_get_uintptr (prop); |
---|
1169 | else |
---|
1170 | *value = 0; |
---|
1171 | |
---|
1172 | rtems_fdt_release_handle (&fdt); |
---|
1173 | |
---|
1174 | return 0; |
---|
1175 | } |
---|
1176 | |
---|
1177 | /** |
---|
1178 | * Get the number of entries in an FDT handle. |
---|
1179 | */ |
---|
1180 | int |
---|
1181 | rtems_fdt_num_entries(rtems_fdt_handle* handle) |
---|
1182 | { |
---|
1183 | return handle->blob->index.num_entries; |
---|
1184 | } |
---|
1185 | |
---|
1186 | /** |
---|
1187 | * Get the numbered entry name. Note that the id isn't the same as |
---|
1188 | * the offset - it's numbered 0, 1, 2 ... num_entries-1 |
---|
1189 | */ |
---|
1190 | const char * |
---|
1191 | rtems_fdt_entry_name(rtems_fdt_handle* handle, int id) |
---|
1192 | { |
---|
1193 | return handle->blob->index.entries[id].name; |
---|
1194 | } |
---|
1195 | |
---|
1196 | /** |
---|
1197 | * Get the numbered entry offset. Note that the id isn't the same as |
---|
1198 | * the offset - it's numbered 0, 1, 2 ... num_entries-1 |
---|
1199 | */ |
---|
1200 | int |
---|
1201 | rtems_fdt_entry_offset(rtems_fdt_handle* handle, int id) |
---|
1202 | { |
---|
1203 | return handle->blob->index.entries[id].offset; |
---|
1204 | } |
---|
1205 | |
---|
1206 | int |
---|
1207 | rtems_fdt_getprop_address_cells(rtems_fdt_handle* handle, int nodeoffset) |
---|
1208 | { |
---|
1209 | uint32_t value = 0; |
---|
1210 | if (!rtems_fdt_get_parent_prop_value(handle, nodeoffset, "#address-cells", &value)) |
---|
1211 | return -1; |
---|
1212 | return value; |
---|
1213 | } |
---|
1214 | |
---|
1215 | int |
---|
1216 | rtems_fdt_getprop_size_cells(rtems_fdt_handle* handle, int nodeoffset) |
---|
1217 | { |
---|
1218 | uint32_t value = 0; |
---|
1219 | if (!rtems_fdt_get_parent_prop_value(handle, nodeoffset, "#size-cells", &value)) |
---|
1220 | return -1; |
---|
1221 | return value; |
---|
1222 | } |
---|
1223 | |
---|
1224 | int rtems_fdt_getprop_address_map(rtems_fdt_handle* handle, |
---|
1225 | const char* path, |
---|
1226 | const char* name, |
---|
1227 | rtems_fdt_address_map* addr_map) |
---|
1228 | { |
---|
1229 | const void* prop; |
---|
1230 | int plen = 0; |
---|
1231 | int poff = 0; |
---|
1232 | int len; |
---|
1233 | |
---|
1234 | memset(addr_map, 0, sizeof(*addr_map)); |
---|
1235 | |
---|
1236 | addr_map->node = rtems_fdt_path_offset(handle, path); |
---|
1237 | if (addr_map->node < 0) |
---|
1238 | return -RTEMS_FDT_ERR_NOTFOUND; |
---|
1239 | |
---|
1240 | addr_map->address_cells = rtems_fdt_getprop_address_cells(handle, addr_map->node); |
---|
1241 | addr_map->size_cells = rtems_fdt_getprop_size_cells(handle, addr_map->node); |
---|
1242 | |
---|
1243 | prop = rtems_fdt_getprop(handle, addr_map->node, name, &plen); |
---|
1244 | if (plen < 0) |
---|
1245 | return -RTEMS_FDT_ERR_NOTFOUND; |
---|
1246 | |
---|
1247 | if (addr_map->address_cells == 0) |
---|
1248 | return -RTEMS_FDT_ERR_BADOFFSET; |
---|
1249 | |
---|
1250 | if (addr_map->address_cells < 0) |
---|
1251 | { |
---|
1252 | if (addr_map->size_cells > 0) |
---|
1253 | return -RTEMS_FDT_ERR_BADOFFSET; |
---|
1254 | addr_map->address_cells = 1; |
---|
1255 | } |
---|
1256 | |
---|
1257 | if (addr_map->size_cells < 0) |
---|
1258 | { |
---|
1259 | addr_map->size = sizeof(uint32_t); |
---|
1260 | addr_map->size_cells = 0; |
---|
1261 | } |
---|
1262 | |
---|
1263 | len = (addr_map->address_cells + addr_map->size_cells) * sizeof(uint32_t); |
---|
1264 | |
---|
1265 | if (len != plen) |
---|
1266 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1267 | |
---|
1268 | switch (addr_map->address_cells) |
---|
1269 | { |
---|
1270 | case 1: |
---|
1271 | if (plen < sizeof(uint32_t)) |
---|
1272 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1273 | addr_map->address = rtems_fdt_get_offset_uint32(prop, poff); |
---|
1274 | poff += 1; |
---|
1275 | plen -= sizeof(uint32_t); |
---|
1276 | break; |
---|
1277 | case 2: |
---|
1278 | if (plen < sizeof(uint64_t)) |
---|
1279 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1280 | addr_map->address = rtems_fdt_get_offset_uint64(prop, poff); |
---|
1281 | poff += 2; |
---|
1282 | plen -= sizeof(uint64_t); |
---|
1283 | break; |
---|
1284 | default: |
---|
1285 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1286 | } |
---|
1287 | |
---|
1288 | switch (addr_map->size_cells) |
---|
1289 | { |
---|
1290 | case 0: |
---|
1291 | addr_map->size = sizeof(uint32_t); |
---|
1292 | break; |
---|
1293 | case 1: |
---|
1294 | if (plen < sizeof(uint32_t)) |
---|
1295 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1296 | addr_map->size = rtems_fdt_get_offset_uint32(prop, poff); |
---|
1297 | poff += 1; |
---|
1298 | plen -= sizeof(uint32_t); |
---|
1299 | break; |
---|
1300 | case 2: |
---|
1301 | if (plen < sizeof(uint64_t)) |
---|
1302 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1303 | addr_map->size = rtems_fdt_get_offset_uint64(prop, poff); |
---|
1304 | poff += 2; |
---|
1305 | plen -= sizeof(uint64_t); |
---|
1306 | break; |
---|
1307 | default: |
---|
1308 | return -RTEMS_FDT_ERR_BADLENGTH; |
---|
1309 | } |
---|
1310 | |
---|
1311 | return 0; |
---|
1312 | } |
---|