scripts/dtc/dtc.h

82 struct  marker {
86 	struct marker *next;
89 struct data {
92 	struct marker *markers;
96 #define empty_data ((struct data){ 0 /* all .members = 0 or NULL */ })
104 void data_free(struct data d);
106 struct data data_grow_for(struct data d, int xlen);
108 struct data data_copy_mem(const char *mem, int len);
109 struct data data_copy_escape_string(const char *s, int len);
110 struct data data_copy_file(FILE *f, size_t len);
112 struct data data_append_data(struct data d, const void *p, int len);
113 struct data data_insert_at_marker(struct data d, struct marker *m,
115 struct data data_merge(struct data d1, struct data d2);
116 struct data data_append_cell(struct data d, cell_t word);
117 struct data data_append_integer(struct data d, uint64_t word, int bits);
118 struct data data_append_re(struct data d, uint64_t address, uint64_t size);
119 struct data data_append_addr(struct data d, uint64_t addr);
120 struct data data_append_byte(struct data d, uint8_t byte);
121 struct data data_append_zeroes(struct data d, int len);
122 struct data data_append_align(struct data d, int align);
124 struct data data_add_marker(struct data d, enum markertype type, char *ref);
126 bool data_is_one_string(struct data d);
134 struct label {
137 	struct label *next;
140 struct bus_type {
144 struct property {
147 	struct data val;
149 	struct property *next;
151 	struct label *labels;
154 struct node {
157 	struct property *proplist;
158 	struct node *children;
160 	struct node *parent;
161 	struct node *next_sibling;
169 	struct label *labels;
170 	const struct bus_type *bus;
194 void add_label(struct label **labels, char *label);
195 void delete_labels(struct label **labels);
197 struct property *build_property(char *name, struct data val);
198 struct property *build_property_delete(char *name);
199 struct property *chain_property(struct property *first, struct property *list);
200 struct property *reverse_properties(struct property *first);
202 struct node *build_node(struct property *proplist, struct node *children);
203 struct node *build_node_delete(void);
204 struct node *name_node(struct node *node, char *name);
205 struct node *chain_node(struct node *first, struct node *list);
206 struct node *merge_nodes(struct node *old_node, struct node *new_node);
207 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
209 void add_property(struct node *node, struct property *prop);
210 void delete_property_by_name(struct node *node, char *name);
211 void delete_property(struct property *prop);
212 void add_child(struct node *parent, struct node *child);
213 void delete_node_by_name(struct node *parent, char *name);
214 void delete_node(struct node *node);
215 void append_to_property(struct node *node,
218 const char *get_unitname(struct node *node);
219 struct property *get_property(struct node *node, const char *propname);
220 cell_t propval_cell(struct property *prop);
221 cell_t propval_cell_n(struct property *prop, int n);
222 struct property *get_property_by_label(struct node *tree, const char *label,
223 				       struct node **node);
224 struct marker *get_marker_label(struct node *tree, const char *label,
225 				struct node **node, struct property **prop);
226 struct node *get_subnode(struct node *node, const char *nodename);
227 struct node *get_node_by_path(struct node *tree, const char *path);
228 struct node *get_node_by_label(struct node *tree, const char *label);
229 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
230 struct node *get_node_by_ref(struct node *tree, const char *ref);
231 cell_t get_node_phandle(struct node *root, struct node *node);
233 uint32_t guess_boot_cpuid(struct node *tree);
237 struct reserve_info {
240 	struct reserve_info *next;
242 	struct label *labels;
245 struct reserve_info *build_reserve_entry(uint64_t start, uint64_t len);
246 struct reserve_info *chain_reserve_entry(struct reserve_info *first,
247 					 struct reserve_info *list);
248 struct reserve_info *add_reserve_entry(struct reserve_info *list,
249 				       struct reserve_info *new);
252 struct dt_info {
254 	struct reserve_info *reservelist;
256 	struct node *dt;		/* the device tree */
264 struct dt_info *build_dt_info(unsigned int dtsflags,
265 			      struct reserve_info *reservelist,
266 			      struct node *tree, uint32_t boot_cpuid_phys);
267 void sort_tree(struct dt_info *dti);
268 void generate_label_tree(struct dt_info *dti, char *name, bool allocph);
269 void generate_fixups_tree(struct dt_info *dti, char *name);
270 void generate_local_fixups_tree(struct dt_info *dti, char *name);
275 void process_checks(bool force, struct dt_info *dti);
279 void dt_to_blob(FILE *f, struct dt_info *dti, int version);
280 void dt_to_asm(FILE *f, struct dt_info *dti, int version);
282 struct dt_info *dt_from_blob(const char *fname);
286 void dt_to_source(FILE *f, struct dt_info *dti);
287 struct dt_info *dt_from_source(const char *f);
291 struct dt_info *dt_from_fs(const char *dirname);