1/*
2 * libfdt - Flat Device Tree manipulation
3 * Copyright (C) 2006 David Gibson, IBM Corporation.
4 *
5 * libfdt is dual licensed: you can use it either under the terms of
6 * the GPL, or the BSD license, at your option.
7 *
8 * a) This library is free software; you can redistribute it and/or

--- 60 unchanged lines hidden (view full) ---

69 return -FDT_ERR_BADSTATE;
70 } else {
71 return -FDT_ERR_BADMAGIC;
72 }
73
74 return 0;
75}
76
77const void *fdt_offset_ptr(const void *fdt, int offset, unsigned int len)
78{
79 const char *p;
80
81 if (fdt_version(fdt) >= 0x11)
82 if (((offset + len) < offset)
83 || ((offset + len) > fdt_size_dt_struct(fdt)))
84 return NULL;
85
86 p = _fdt_offset_ptr(fdt, offset);
87
88 if (p + len < p)
89 return NULL;
90 return p;
91}
92
93uint32_t fdt_next_tag(const void *fdt, int startoffset, int *nextoffset)
94{
95 const uint32_t *tagp, *lenp;
96 uint32_t tag;
97 int offset = startoffset;
98 const char *p;
99
100 *nextoffset = -FDT_ERR_TRUNCATED;
101 tagp = fdt_offset_ptr(fdt, offset, FDT_TAGSIZE);
102 if (!tagp)
103 return FDT_END; /* premature end */
104 tag = fdt32_to_cpu(*tagp);
105 offset += FDT_TAGSIZE;
106
107 *nextoffset = -FDT_ERR_BADSTRUCTURE;
108 switch (tag) {
109 case FDT_BEGIN_NODE:
110 /* skip name */
111 do {
112 p = fdt_offset_ptr(fdt, offset++, 1);
113 } while (p && (*p != '\0'));
114 if (!p)
115 return FDT_END; /* premature end */
116 break;
117
118 case FDT_PROP:
119 lenp = fdt_offset_ptr(fdt, offset, sizeof(*lenp));
120 if (!lenp)
121 return FDT_END; /* premature end */
122 /* skip-name offset, length and value */
123 offset += sizeof(struct fdt_property) - FDT_TAGSIZE
124 + fdt32_to_cpu(*lenp);
125 break;
126
127 case FDT_END:
128 case FDT_END_NODE:
129 case FDT_NOP:
130 break;
131
132 default:
133 return FDT_END;
134 }
135
136 if (!fdt_offset_ptr(fdt, startoffset, offset - startoffset))
137 return FDT_END; /* premature end */
138
139 *nextoffset = FDT_TAGALIGN(offset);
140 return tag;
141}
142
143int _fdt_check_node_offset(const void *fdt, int offset)
144{
145 if ((offset < 0) || (offset % FDT_TAGSIZE)
146 || (fdt_next_tag(fdt, offset, &offset) != FDT_BEGIN_NODE))
147 return -FDT_ERR_BADOFFSET;

--- 20 unchanged lines hidden (view full) ---

168 break;
169
170 case FDT_BEGIN_NODE:
171 if (depth)
172 (*depth)++;
173 break;
174
175 case FDT_END_NODE:
176 if (depth && ((--(*depth)) < 0))
177 return nextoffset;
178 break;
179
180 case FDT_END:
181 if ((nextoffset >= 0)
182 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
183 return -FDT_ERR_NOTFOUND;
184 else
185 return nextoffset;
186 }
187 } while (tag != FDT_BEGIN_NODE);
188
189 return offset;
190}
191
192const char *_fdt_find_string(const char *strtab, int tabsize, const char *s)
193{

--- 20 unchanged lines hidden ---