| 214 | } |
| 215 | |
| 216 | int fdt_next_subnode(const void *fdt, int offset) |
| 217 | { |
| 218 | int depth = 1; |
| 219 | |
| 220 | /* |
| 221 | * With respect to the parent, the depth of the next subnode will be |
| 222 | * the same as the last. |
| 223 | */ |
| 224 | do { |
| 225 | offset = fdt_next_node(fdt, offset, &depth); |
| 226 | if (offset < 0 || depth < 1) |
| 227 | return -FDT_ERR_NOTFOUND; |
| 228 | } while (depth > 1); |
| 229 | |
| 230 | return offset; |
| 231 | } |
| 232 | |
| 233 | const char *fdt_find_string_(const char *strtab, int tabsize, const char *s) |
| 234 | { |
nothing calls this directly
no test coverage detected