2  * libfdt - Flat Device Tree manipulation
21  *     MA 02110-1301 USA
63 			return -FDT_ERR_BADVERSION;  in fdt_check_header()
65 			return -FDT_ERR_BADVERSION;  in fdt_check_header()
67 		/* Unfinished sequential-write blob */  in fdt_check_header()
69 			return -FDT_ERR_BADSTATE;  in fdt_check_header()
71 		return -FDT_ERR_BADMAGIC;  in fdt_check_header()
101 	*nextoffset = -FDT_ERR_TRUNCATED;  in fdt_next_tag()
108 	*nextoffset = -FDT_ERR_BADSTRUCTURE;  in fdt_next_tag()
123 		/* skip-name offset, length and value */  in fdt_next_tag()
124 		offset += sizeof(struct fdt_property) - FDT_TAGSIZE  in fdt_next_tag()
137 	if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))  in fdt_next_tag()
148 		return -FDT_ERR_BADOFFSET;  in _fdt_check_node_offset()
157 		return -FDT_ERR_BADOFFSET;  in _fdt_check_prop_offset()
162 int fdt_next_node(const void *fdt, int offset, int *depth)  in fdt_next_node()  argument
181 			if (depth)  in fdt_next_node()
182 				(*depth)++;  in fdt_next_node()
186 			if (depth && ((--(*depth)) < 0))  in fdt_next_node()
192 			    || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))  in fdt_next_node()
193 				return -FDT_ERR_NOTFOUND;  in fdt_next_node()
204 	int depth = 0;  in fdt_first_subnode()  local
206 	offset = fdt_next_node(fdt, offset, &depth);  in fdt_first_subnode()
207 	if (offset < 0 || depth != 1)  in fdt_first_subnode()
208 		return -FDT_ERR_NOTFOUND;  in fdt_first_subnode()
215 	int depth = 1;  in fdt_next_subnode()  local
218 	 * With respect to the parent, the depth of the next subnode will be  in fdt_next_subnode()
222 		offset = fdt_next_node(fdt, offset, &depth);  in fdt_next_subnode()
223 		if (offset < 0 || depth < 1)  in fdt_next_subnode()
224 			return -FDT_ERR_NOTFOUND;  in fdt_next_subnode()
225 	} while (depth > 1);  in fdt_next_subnode()
233 	const char *last = strtab + tabsize - len;  in _fdt_find_string()
247 		return -FDT_ERR_NOSPACE;  in fdt_move()