dtc.h 8.53 KB
Newer Older
1 2
#ifndef DTC_H
#define DTC_H
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

/*
 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation.  2005.
 *
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307
 *                                                                   USA
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
28
#include <stdbool.h>
29 30 31 32 33
#include <stdarg.h>
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <unistd.h>
34
#include <inttypes.h>
35

36
#include <libfdt_env.h>
37 38
#include <fdt.h>

39 40 41
#include "util.h"

#ifdef DEBUG
42
#define debug(...)	printf(__VA_ARGS__)
43
#else
44
#define debug(...)
45 46
#endif

47
#define DEFAULT_FDT_VERSION	17
48

49 50 51 52 53 54 55
/*
 * Command line options
 */
extern int quiet;		/* Level of quietness */
extern int reservenum;		/* Number of memory reservation slots */
extern int minsize;		/* Minimum blob size */
extern int padsize;		/* Additional padding to blob */
56
extern int alignsize;		/* Additional padding to blob accroding to the alignsize */
57
extern int phandle_format;	/* Use linux,phandle or phandle properties */
58 59 60
extern int generate_symbols;	/* generate symbols for nodes with labels */
extern int generate_fixups;	/* generate fixups */
extern int auto_label_aliases;	/* auto generate labels -> aliases */
61

62 63 64
#define PHANDLE_LEGACY	0x1
#define PHANDLE_EPAPR	0x2
#define PHANDLE_BOTH	0x3
65

66
typedef uint32_t cell_t;
67 68 69


#define streq(a, b)	(strcmp((a), (b)) == 0)
70 71
#define strstarts(s, prefix)	(strncmp((s), (prefix), strlen(prefix)) == 0)
#define strprefixeq(a, n, b)	(strlen(b) == (n) && (memcmp(a, b, n) == 0))
72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95

#define ALIGN(x, a)	(((x) + (a) - 1) & ~((a) - 1))

/* Data blobs */
enum markertype {
	REF_PHANDLE,
	REF_PATH,
	LABEL,
};

struct  marker {
	enum markertype type;
	int offset;
	char *ref;
	struct marker *next;
};

struct data {
	int len;
	char *val;
	struct marker *markers;
};


96
#define empty_data ((struct data){ 0 /* all .members = 0 or NULL */ })
97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116

#define for_each_marker(m) \
	for (; (m); (m) = (m)->next)
#define for_each_marker_of_type(m, t) \
	for_each_marker(m) \
		if ((m)->type == (t))

void data_free(struct data d);

struct data data_grow_for(struct data d, int xlen);

struct data data_copy_mem(const char *mem, int len);
struct data data_copy_escape_string(const char *s, int len);
struct data data_copy_file(FILE *f, size_t len);

struct data data_append_data(struct data d, const void *p, int len);
struct data data_insert_at_marker(struct data d, struct marker *m,
				  const void *p, int len);
struct data data_merge(struct data d1, struct data d2);
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 121 122 123 124 125
struct data data_append_byte(struct data d, uint8_t byte);
struct data data_append_zeroes(struct data d, int len);
struct data data_append_align(struct data d, int align);

struct data data_add_marker(struct data d, enum markertype type, char *ref);

126
bool data_is_one_string(struct data d);
127 128 129 130 131 132 133

/* DT constraints */

#define MAX_PROPNAME_LEN	31
#define MAX_NODENAME_LEN	31

/* Live trees */
134
struct label {
135
	bool deleted;
136 137 138 139
	char *label;
	struct label *next;
};

140 141 142 143
struct bus_type {
	const char *name;
};

144
struct property {
145
	bool deleted;
146 147 148 149 150
	char *name;
	struct data val;

	struct property *next;

151
	struct label *labels;
152 153 154
};

struct node {
155
	bool deleted;
156 157 158 159 160 161 162 163 164 165 166 167 168
	char *name;
	struct property *proplist;
	struct node *children;

	struct node *parent;
	struct node *next_sibling;

	char *fullpath;
	int basenamelen;

	cell_t phandle;
	int addr_cells, size_cells;

169
	struct label *labels;
170
	const struct bus_type *bus;
171 172

	bool omit_if_unused, is_referenced;
173 174
};

175
#define for_each_label_withdel(l0, l) \
176 177
	for ((l) = (l0); (l); (l) = (l)->next)

178 179 180
#define for_each_label(l0, l) \
	for_each_label_withdel(l0, l) \
		if (!(l)->deleted)
181 182

#define for_each_property_withdel(n, p) \
183 184
	for ((p) = (n)->proplist; (p); (p) = (p)->next)

185 186 187
#define for_each_property(n, p) \
	for_each_property_withdel(n, p) \
		if (!(p)->deleted)
188 189

#define for_each_child_withdel(n, c) \
190 191
	for ((c) = (n)->children; (c); (c) = (c)->next_sibling)

192 193 194 195
#define for_each_child(n, c) \
	for_each_child_withdel(n, c) \
		if (!(c)->deleted)

196
void add_label(struct label **labels, char *label);
197
void delete_labels(struct label **labels);
198 199

struct property *build_property(char *name, struct data val);
200
struct property *build_property_delete(char *name);
201 202 203 204
struct property *chain_property(struct property *first, struct property *list);
struct property *reverse_properties(struct property *first);

struct node *build_node(struct property *proplist, struct node *children);
205
struct node *build_node_delete(void);
206
struct node *name_node(struct node *node, char *name);
207 208
struct node *omit_node_if_unused(struct node *node);
struct node *reference_node(struct node *node);
209
struct node *chain_node(struct node *first, struct node *list);
210
struct node *merge_nodes(struct node *old_node, struct node *new_node);
211
struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
212 213

void add_property(struct node *node, struct property *prop);
214 215
void delete_property_by_name(struct node *node, char *name);
void delete_property(struct property *prop);
216
void add_child(struct node *parent, struct node *child);
217 218
void delete_node_by_name(struct node *parent, char *name);
void delete_node(struct node *node);
219 220
void append_to_property(struct node *node,
			char *name, const void *data, int len);
221 222 223 224

const char *get_unitname(struct node *node);
struct property *get_property(struct node *node, const char *propname);
cell_t propval_cell(struct property *prop);
225
cell_t propval_cell_n(struct property *prop, int n);
226 227 228 229
struct property *get_property_by_label(struct node *tree, const char *label,
				       struct node **node);
struct marker *get_marker_label(struct node *tree, const char *label,
				struct node **node, struct property **prop);
230 231 232 233 234 235 236
struct node *get_subnode(struct node *node, const char *nodename);
struct node *get_node_by_path(struct node *tree, const char *path);
struct node *get_node_by_label(struct node *tree, const char *label);
struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
struct node *get_node_by_ref(struct node *tree, const char *ref);
cell_t get_node_phandle(struct node *root, struct node *node);

237 238
uint32_t guess_boot_cpuid(struct node *tree);

239 240 241
/* Boot info (tree plus memreserve information */

struct reserve_info {
242
	uint64_t address, size;
243 244 245

	struct reserve_info *next;

246
	struct label *labels;
247 248
};

249
struct reserve_info *build_reserve_entry(uint64_t start, uint64_t len);
250 251 252 253 254 255
struct reserve_info *chain_reserve_entry(struct reserve_info *first,
					 struct reserve_info *list);
struct reserve_info *add_reserve_entry(struct reserve_info *list,
				       struct reserve_info *new);


256 257
struct dt_info {
	unsigned int dtsflags;
258
	struct reserve_info *reservelist;
259
	uint32_t boot_cpuid_phys;
260
	struct node *dt;		/* the device tree */
261
	const char *outname;		/* filename being written to, "-" for stdout */
262 263
};

264 265 266 267 268 269 270 271 272 273 274
/* DTS version flags definitions */
#define DTSF_V1		0x0001	/* /dts-v1/ */
#define DTSF_PLUGIN	0x0002	/* /plugin/ */

struct dt_info *build_dt_info(unsigned int dtsflags,
			      struct reserve_info *reservelist,
			      struct node *tree, uint32_t boot_cpuid_phys);
void sort_tree(struct dt_info *dti);
void generate_label_tree(struct dt_info *dti, char *name, bool allocph);
void generate_fixups_tree(struct dt_info *dti, char *name);
void generate_local_fixups_tree(struct dt_info *dti, char *name);
275 276 277

/* Checks */

278
void parse_checks_option(bool warn, bool error, const char *arg);
279
void process_checks(bool force, struct dt_info *dti);
280 281 282

/* Flattened trees */

283 284
void dt_to_blob(FILE *f, struct dt_info *dti, int version);
void dt_to_asm(FILE *f, struct dt_info *dti, int version);
285

286
struct dt_info *dt_from_blob(const char *fname);
287 288 289

/* Tree source */

290 291
void dt_to_source(FILE *f, struct dt_info *dti);
struct dt_info *dt_from_source(const char *f);
292 293 294

/* FS trees */

295
struct dt_info *dt_from_fs(const char *dirname);
296

297
#endif /* DTC_H */