| 296 | } |
| 297 | |
| 298 | int fdt_next_subnode(const void *fdt, int offset) |
| 299 | { |
| 300 | int depth = 1; |
| 301 | |
| 302 | /* |
| 303 | * With respect to the parent, the depth of the next subnode will be |
| 304 | * the same as the last. |
| 305 | */ |
| 306 | do { |
| 307 | offset = fdt_next_node(fdt, offset, &depth); |
| 308 | if (offset < 0 || depth < 1) |
| 309 | return -FDT_ERR_NOTFOUND; |
| 310 | } while (depth > 1); |
| 311 | |
| 312 | return offset; |
| 313 | } |
| 314 | |
| 315 | const char *fdt_find_string_(const char *strtab, int tabsize, const char *s) |
| 316 | { |
no test coverage detected