5 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of the
11 * License, or (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
34 #include <libfdt_env.h>
40 #define debug(fmt,args...) printf(fmt, ##args)
42 #define debug(fmt,args...)
46 #define DEFAULT_FDT_VERSION 17
49 * Command line options
51 extern int quiet; /* Level of quietness */
52 extern int reservenum; /* Number of memory reservation slots */
53 extern int minsize; /* Minimum blob size */
54 extern int padsize; /* Additional padding to blob */
55 extern int phandle_format; /* Use linux,phandle or phandle properties */
57 #define PHANDLE_LEGACY 0x1
58 #define PHANDLE_EPAPR 0x2
59 #define PHANDLE_BOTH 0x3
61 typedef uint32_t cell_t;
64 #define streq(a, b) (strcmp((a), (b)) == 0)
65 #define strneq(a, b, n) (strncmp((a), (b), (n)) == 0)
67 #define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
68 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
87 struct marker *markers;
91 #define empty_data ((struct data){ /* all .members = 0 or NULL */ })
93 #define for_each_marker(m) \
94 for (; (m); (m) = (m)->next)
95 #define for_each_marker_of_type(m, t) \
99 void data_free(struct data d);
101 struct data data_grow_for(struct data d, int xlen);
103 struct data data_copy_mem(const char *mem, int len);
104 struct data data_copy_escape_string(const char *s, int len);
105 struct data data_copy_file(FILE *f, size_t len);
107 struct data data_append_data(struct data d, const void *p, int len);
108 struct data data_insert_at_marker(struct data d, struct marker *m,
109 const void *p, int len);
110 struct data data_merge(struct data d1, struct data d2);
111 struct data data_append_cell(struct data d, cell_t word);
112 struct data data_append_re(struct data d, const struct fdt_reserve_entry *re);
113 struct data data_append_addr(struct data d, uint64_t addr);
114 struct data data_append_byte(struct data d, uint8_t byte);
115 struct data data_append_zeroes(struct data d, int len);
116 struct data data_append_align(struct data d, int align);
118 struct data data_add_marker(struct data d, enum markertype type, char *ref);
120 int data_is_one_string(struct data d);
124 #define MAX_PROPNAME_LEN 31
125 #define MAX_NODENAME_LEN 31
132 struct property *next;
139 struct property *proplist;
140 struct node *children;
143 struct node *next_sibling;
149 int addr_cells, size_cells;
154 #define for_each_property(n, p) \
155 for ((p) = (n)->proplist; (p); (p) = (p)->next)
157 #define for_each_child(n, c) \
158 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
160 struct property *build_property(char *name, struct data val, char *label);
161 struct property *chain_property(struct property *first, struct property *list);
162 struct property *reverse_properties(struct property *first);
164 struct node *build_node(struct property *proplist, struct node *children);
165 struct node *name_node(struct node *node, char *name, char *label);
166 struct node *chain_node(struct node *first, struct node *list);
168 void add_property(struct node *node, struct property *prop);
169 void add_child(struct node *parent, struct node *child);
171 const char *get_unitname(struct node *node);
172 struct property *get_property(struct node *node, const char *propname);
173 cell_t propval_cell(struct property *prop);
174 struct node *get_subnode(struct node *node, const char *nodename);
175 struct node *get_node_by_path(struct node *tree, const char *path);
176 struct node *get_node_by_label(struct node *tree, const char *label);
177 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
178 struct node *get_node_by_ref(struct node *tree, const char *ref);
179 cell_t get_node_phandle(struct node *root, struct node *node);
181 /* Boot info (tree plus memreserve information */
183 struct reserve_info {
184 struct fdt_reserve_entry re;
186 struct reserve_info *next;
191 struct reserve_info *build_reserve_entry(uint64_t start, uint64_t len, char *label);
192 struct reserve_info *chain_reserve_entry(struct reserve_info *first,
193 struct reserve_info *list);
194 struct reserve_info *add_reserve_entry(struct reserve_info *list,
195 struct reserve_info *new);
199 struct reserve_info *reservelist;
200 struct node *dt; /* the device tree */
201 uint32_t boot_cpuid_phys;
204 struct boot_info *build_boot_info(struct reserve_info *reservelist,
205 struct node *tree, uint32_t boot_cpuid_phys);
209 void process_checks(int force, struct boot_info *bi);
211 /* Flattened trees */
213 void dt_to_blob(FILE *f, struct boot_info *bi, int version);
214 void dt_to_asm(FILE *f, struct boot_info *bi, int version);
216 struct boot_info *dt_from_blob(const char *fname);
220 void dt_to_source(FILE *f, struct boot_info *bi);
221 struct boot_info *dt_from_source(const char *f);
225 struct boot_info *dt_from_fs(const char *dirname);
229 char *join_path(const char *path, const char *name);