1 // SPDX-License-Identifier: (GPL-2.0-or-later OR BSD-2-Clause)
3  * libfdt - Flat Device Tree manipulation
14  * Minimal sanity check for a read-only tree. fdt_ro_probe_() checks
29 				return -FDT_ERR_BADVERSION;  in fdt_ro_probe_()
32 				return -FDT_ERR_BADVERSION;  in fdt_ro_probe_()
35 		/* Unfinished sequential-write blob */  in fdt_ro_probe_()
37 			return -FDT_ERR_BADSTATE;  in fdt_ro_probe_()
39 		return -FDT_ERR_BADMAGIC;  in fdt_ro_probe_()
45 		return -FDT_ERR_TRUNCATED;  in fdt_ro_probe_()
90 		return -FDT_ERR_BADMAGIC;  in fdt_check_header()
95 			return -FDT_ERR_BADVERSION;  in fdt_check_header()
97 			return -FDT_ERR_BADVERSION;  in fdt_check_header()
104 			return -FDT_ERR_TRUNCATED;  in fdt_check_header()
109 			return -FDT_ERR_TRUNCATED;  in fdt_check_header()
117 				return -FDT_ERR_TRUNCATED;  in fdt_check_header()
122 				return -FDT_ERR_TRUNCATED;  in fdt_check_header()
129 			return -FDT_ERR_TRUNCATED;  in fdt_check_header()
164 	*nextoffset = -FDT_ERR_TRUNCATED;  in fdt_next_tag()
171 	*nextoffset = -FDT_ERR_BADSTRUCTURE;  in fdt_next_tag()
186 		/* skip-name offset, length and value */  in fdt_next_tag()
187 		offset += sizeof(struct fdt_property) - FDT_TAGSIZE  in fdt_next_tag()
191 		    ((offset - fdt32_to_cpu(*lenp)) % 8) != 0)  in fdt_next_tag()
204 	if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))  in fdt_next_tag()
215 		return -FDT_ERR_BADOFFSET;  in fdt_check_node_offset_()
218 		return -FDT_ERR_BADOFFSET;  in fdt_check_node_offset_()
227 		return -FDT_ERR_BADOFFSET;  in fdt_check_prop_offset_()
230 		return -FDT_ERR_BADOFFSET;  in fdt_check_prop_offset_()
235 int fdt_next_node(const void *fdt, int offset, int *depth)  in fdt_next_node()  argument
254 			if (depth)  in fdt_next_node()
255 				(*depth)++;  in fdt_next_node()
259 			if (depth && ((--(*depth)) < 0))  in fdt_next_node()
265 			    || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))  in fdt_next_node()
266 				return -FDT_ERR_NOTFOUND;  in fdt_next_node()
277 	int depth = 0;  in fdt_first_subnode()  local
279 	offset = fdt_next_node(fdt, offset, &depth);  in fdt_first_subnode()
280 	if (offset < 0 || depth != 1)  in fdt_first_subnode()
281 		return -FDT_ERR_NOTFOUND;  in fdt_first_subnode()
288 	int depth = 1;  in fdt_next_subnode()  local
291 	 * With respect to the parent, the depth of the next subnode will be  in fdt_next_subnode()
295 		offset = fdt_next_node(fdt, offset, &depth);  in fdt_next_subnode()
296 		if (offset < 0 || depth < 1)  in fdt_next_subnode()
297 			return -FDT_ERR_NOTFOUND;  in fdt_next_subnode()
298 	} while (depth > 1);  in fdt_next_subnode()
306 	const char *last = strtab + tabsize - len;  in fdt_find_string_()
318 		return -FDT_ERR_NOSPACE;  in fdt_move()
323 		return -FDT_ERR_NOSPACE;  in fdt_move()