[GitHub/mt8127/android_kernel_alcatel_ttab.git] / scripts / dtc / treesource.c

/*
 * (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 "dtc.h"
#include "srcpos.h"

extern FILE *yyin;
extern int yyparse(void);

struct boot_info *the_boot_info;
int treesource_error;

struct boot_info *dt_from_source(const char *fname)
{
	the_boot_info = NULL;
	treesource_error = 0;

	srcfile_push(fname);
	yyin = current_srcfile->f;

	if (yyparse() != 0)
		die("Unable to parse input tree\n");

	if (treesource_error)
		die("Syntax error parsing input tree\n");

	return the_boot_info;
}

static void write_prefix(FILE *f, int level)
{
	int i;

	for (i = 0; i < level; i++)
		fputc('\t', f);
}

static int isstring(char c)
{
	return (isprint(c)
		|| (c == '\0')
		|| strchr("\a\b\t\n\v\f\r", c));
}

static void write_propval_string(FILE *f, struct data val)
{
	const char *str = val.val;
	int i;
	struct marker *m = val.markers;

	assert(str[val.len-1] == '\0');

	while (m && (m->offset == 0)) {
		if (m->type == LABEL)
			fprintf(f, "%s: ", m->ref);
		m = m->next;
	}
	fprintf(f, "\"");

	for (i = 0; i < (val.len-1); i++) {
		char c = str[i];

		switch (c) {
		case '\a':
			fprintf(f, "\\a");
			break;
		case '\b':
			fprintf(f, "\\b");
			break;
		case '\t':
			fprintf(f, "\\t");
			break;
		case '\n':
			fprintf(f, "\\n");
			break;
		case '\v':
			fprintf(f, "\\v");
			break;
		case '\f':
			fprintf(f, "\\f");
			break;
		case '\r':
			fprintf(f, "\\r");
			break;
		case '\\':
			fprintf(f, "\\\\");
			break;
		case '\"':
			fprintf(f, "\\\"");
			break;
		case '\0':
			fprintf(f, "\", ");
			while (m && (m->offset < i)) {
				if (m->type == LABEL) {
					assert(m->offset == (i+1));
					fprintf(f, "%s: ", m->ref);
				}
				m = m->next;
			}
			fprintf(f, "\"");
			break;
		default:
			if (isprint(c))
				fprintf(f, "%c", c);
			else
				fprintf(f, "\\x%02hhx", c);
		}
	}
	fprintf(f, "\"");

	/* Wrap up any labels at the end of the value */
	for_each_marker_of_type(m, LABEL) {
		assert (m->offset == val.len);
		fprintf(f, " %s:", m->ref);
	}
}

static void write_propval_cells(FILE *f, struct data val)
{
	void *propend = val.val + val.len;
	cell_t *cp = (cell_t *)val.val;
	struct marker *m = val.markers;

	fprintf(f, "<");
	for (;;) {
		while (m && (m->offset <= ((char *)cp - val.val))) {
			if (m->type == LABEL) {
				assert(m->offset == ((char *)cp - val.val));
				fprintf(f, "%s: ", m->ref);
			}
			m = m->next;
		}

		fprintf(f, "0x%x", fdt32_to_cpu(*cp++));
		if ((void *)cp >= propend)
			break;
		fprintf(f, " ");
	}

	/* Wrap up any labels at the end of the value */
	for_each_marker_of_type(m, LABEL) {
		assert (m->offset == val.len);
		fprintf(f, " %s:", m->ref);
	}
	fprintf(f, ">");
}

static void write_propval_bytes(FILE *f, struct data val)
{
	void *propend = val.val + val.len;
	const char *bp = val.val;
	struct marker *m = val.markers;

	fprintf(f, "[");
	for (;;) {
		while (m && (m->offset == (bp-val.val))) {
			if (m->type == LABEL)
				fprintf(f, "%s: ", m->ref);
			m = m->next;
		}

		fprintf(f, "%02hhx", *bp++);
		if ((const void *)bp >= propend)
			break;
		fprintf(f, " ");
	}

	/* Wrap up any labels at the end of the value */
	for_each_marker_of_type(m, LABEL) {
		assert (m->offset == val.len);
		fprintf(f, " %s:", m->ref);
	}
	fprintf(f, "]");
}

static void write_propval(FILE *f, struct property *prop)
{
	int len = prop->val.len;
	const char *p = prop->val.val;
	struct marker *m = prop->val.markers;
	int nnotstring = 0, nnul = 0;
	int nnotstringlbl = 0, nnotcelllbl = 0;
	int i;

	if (len == 0) {
		fprintf(f, ";\n");
		return;
	}

	for (i = 0; i < len; i++) {
		if (! isstring(p[i]))
			nnotstring++;
		if (p[i] == '\0')
			nnul++;
	}

	for_each_marker_of_type(m, LABEL) {
		if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
			nnotstringlbl++;
		if ((m->offset % sizeof(cell_t)) != 0)
			nnotcelllbl++;
	}

	fprintf(f, " = ");
	if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
	    && (nnotstringlbl == 0)) {
		write_propval_string(f, prop->val);
	} else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
		write_propval_cells(f, prop->val);
	} else {
		write_propval_bytes(f, prop->val);
	}

	fprintf(f, ";\n");
}

static void write_tree_source_node(FILE *f, struct node *tree, int level)
{
	struct property *prop;
	struct node *child;
	struct label *l;

	write_prefix(f, level);
	for_each_label(tree->labels, l)
		fprintf(f, "%s: ", l->label);
	if (tree->name && (*tree->name))
		fprintf(f, "%s {\n", tree->name);
	else
		fprintf(f, "/ {\n");

	for_each_property(tree, prop) {
		write_prefix(f, level+1);
		for_each_label(prop->labels, l)
			fprintf(f, "%s: ", l->label);
		fprintf(f, "%s", prop->name);
		write_propval(f, prop);
	}
	for_each_child(tree, child) {
		fprintf(f, "\n");
		write_tree_source_node(f, child, level+1);
	}
	write_prefix(f, level);
	fprintf(f, "};\n");
}


void dt_to_source(FILE *f, struct boot_info *bi)
{
	struct reserve_info *re;

	fprintf(f, "/dts-v1/;\n\n");

	for (re = bi->reservelist; re; re = re->next) {
		struct label *l;

		for_each_label(re->labels, l)
			fprintf(f, "%s: ", l->label);
		fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
			(unsigned long long)re->re.address,
			(unsigned long long)re->re.size);
	}

	write_tree_source_node(f, bi->dt, 0);
}
Commit	Line	Data
a4da2e3e DG	1	/*
	2	* (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
	3	*
	4	*
	5	* This program is free software; you can redistribute it and/or
	6	* modify it under the terms of the GNU General Public License as
	7	* published by the Free Software Foundation; either version 2 of the
	8	* License, or (at your option) any later version.
	9	*
	10	* This program is distributed in the hope that it will be useful,
	11	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	* General Public License for more details.
	14	*
	15	* You should have received a copy of the GNU General Public License
	16	* along with this program; if not, write to the Free Software
	17	* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
	18	* USA
	19	*/
	20
	21	#include "dtc.h"
	22	#include "srcpos.h"
	23
	24	extern FILE *yyin;
	25	extern int yyparse(void);
a4da2e3e DG	26
a4da2e3e DG	27	struct boot_info *the_boot_info;
ed95d745	28	int treesource_error;
a4da2e3e DG	29
	30	struct boot_info dt_from_source(const char fname)
	31	{
	32	the_boot_info = NULL;
ed95d745	33	treesource_error = 0;
a4da2e3e	34
658f29a5 JB	35	srcfile_push(fname);
658f29a5 JB	36	yyin = current_srcfile->f;
a4da2e3e DG	37
a4da2e3e DG	38	if (yyparse() != 0)
ed95d745	39	die("Unable to parse input tree\n");
a4da2e3e	40
ed95d745 DG	41	if (treesource_error)
ed95d745 DG	42	die("Syntax error parsing input tree\n");
a4da2e3e DG	43
	44	return the_boot_info;
	45	}
	46
	47	static void write_prefix(FILE *f, int level)
	48	{
	49	int i;
	50
	51	for (i = 0; i < level; i++)
	52	fputc('\t', f);
	53	}
	54
5ccd9915	55	static int isstring(char c)
a4da2e3e DG	56	{
	57	return (isprint(c)
	58	\|\| (c == '\0')
	59	\|\| strchr("\a\b\t\n\v\f\r", c));
	60	}
	61
	62	static void write_propval_string(FILE *f, struct data val)
	63	{
	64	const char *str = val.val;
	65	int i;
a4da2e3e DG	66	struct marker *m = val.markers;
	67
	68	assert(str[val.len-1] == '\0');
	69
658f29a5 JB	70	while (m && (m->offset == 0)) {
	71	if (m->type == LABEL)
	72	fprintf(f, "%s: ", m->ref);
	73	m = m->next;
	74	}
	75	fprintf(f, "\"");
	76
a4da2e3e DG	77	for (i = 0; i < (val.len-1); i++) {
	78	char c = str[i];
	79
a4da2e3e DG	80	switch (c) {
	81	case '\a':
	82	fprintf(f, "\\a");
	83	break;
	84	case '\b':
	85	fprintf(f, "\\b");
	86	break;
	87	case '\t':
	88	fprintf(f, "\\t");
	89	break;
	90	case '\n':
	91	fprintf(f, "\\n");
	92	break;
	93	case '\v':
	94	fprintf(f, "\\v");
	95	break;
	96	case '\f':
	97	fprintf(f, "\\f");
	98	break;
	99	case '\r':
	100	fprintf(f, "\\r");
	101	break;
	102	case '\\':
	103	fprintf(f, "\\\\");
	104	break;
	105	case '\"':
	106	fprintf(f, "\\\"");
	107	break;
	108	case '\0':
	109	fprintf(f, "\", ");
658f29a5 JB	110	while (m && (m->offset < i)) {
	111	if (m->type == LABEL) {
	112	assert(m->offset == (i+1));
	113	fprintf(f, "%s: ", m->ref);
	114	}
	115	m = m->next;
	116	}
	117	fprintf(f, "\"");
a4da2e3e DG	118	break;
	119	default:
	120	if (isprint(c))
	121	fprintf(f, "%c", c);
	122	else
	123	fprintf(f, "\\x%02hhx", c);
	124	}
	125	}
	126	fprintf(f, "\"");
	127
	128	/* Wrap up any labels at the end of the value */
	129	for_each_marker_of_type(m, LABEL) {
	130	assert (m->offset == val.len);
	131	fprintf(f, " %s:", m->ref);
	132	}
	133	}
	134
	135	static void write_propval_cells(FILE *f, struct data val)
	136	{
	137	void *propend = val.val + val.len;
	138	cell_t cp = (cell_t )val.val;
	139	struct marker *m = val.markers;
	140
	141	fprintf(f, "<");
	142	for (;;) {
	143	while (m && (m->offset <= ((char *)cp - val.val))) {
	144	if (m->type == LABEL) {
	145	assert(m->offset == ((char *)cp - val.val));
	146	fprintf(f, "%s: ", m->ref);
	147	}
	148	m = m->next;
	149	}
	150
ed95d745	151	fprintf(f, "0x%x", fdt32_to_cpu(*cp++));
a4da2e3e DG	152	if ((void *)cp >= propend)
	153	break;
	154	fprintf(f, " ");
	155	}
	156
	157	/* Wrap up any labels at the end of the value */
	158	for_each_marker_of_type(m, LABEL) {
	159	assert (m->offset == val.len);
	160	fprintf(f, " %s:", m->ref);
	161	}
	162	fprintf(f, ">");
	163	}
	164
	165	static void write_propval_bytes(FILE *f, struct data val)
	166	{
	167	void *propend = val.val + val.len;
	168	const char *bp = val.val;
	169	struct marker *m = val.markers;
	170
	171	fprintf(f, "[");
	172	for (;;) {
	173	while (m && (m->offset == (bp-val.val))) {
	174	if (m->type == LABEL)
	175	fprintf(f, "%s: ", m->ref);
	176	m = m->next;
	177	}
	178
	179	fprintf(f, "%02hhx", *bp++);
ed95d745	180	if ((const void *)bp >= propend)
a4da2e3e DG	181	break;
	182	fprintf(f, " ");
	183	}
	184
	185	/* Wrap up any labels at the end of the value */
	186	for_each_marker_of_type(m, LABEL) {
	187	assert (m->offset == val.len);
	188	fprintf(f, " %s:", m->ref);
	189	}
	190	fprintf(f, "]");
	191	}
	192
	193	static void write_propval(FILE f, struct property prop)
	194	{
	195	int len = prop->val.len;
	196	const char *p = prop->val.val;
	197	struct marker *m = prop->val.markers;
	198	int nnotstring = 0, nnul = 0;
	199	int nnotstringlbl = 0, nnotcelllbl = 0;
	200	int i;
	201
	202	if (len == 0) {
	203	fprintf(f, ";\n");
	204	return;
	205	}
	206
	207	for (i = 0; i < len; i++) {
	208	if (! isstring(p[i]))
	209	nnotstring++;
	210	if (p[i] == '\0')
	211	nnul++;
	212	}
	213
	214	for_each_marker_of_type(m, LABEL) {
	215	if ((m->offset > 0) && (prop->val.val[m->offset - 1] != '\0'))
	216	nnotstringlbl++;
	217	if ((m->offset % sizeof(cell_t)) != 0)
	218	nnotcelllbl++;
	219	}
	220
	221	fprintf(f, " = ");
	222	if ((p[len-1] == '\0') && (nnotstring == 0) && (nnul < (len-nnul))
	223	&& (nnotstringlbl == 0)) {
	224	write_propval_string(f, prop->val);
	225	} else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {
	226	write_propval_cells(f, prop->val);
	227	} else {
	228	write_propval_bytes(f, prop->val);
	229	}
	230
	231	fprintf(f, ";\n");
	232	}
	233
	234	static void write_tree_source_node(FILE f, struct node tree, int level)
	235	{
	236	struct property *prop;
	237	struct node *child;
658f29a5	238	struct label *l;
a4da2e3e DG	239
a4da2e3e DG	240	write_prefix(f, level);
658f29a5 JB	241	for_each_label(tree->labels, l)
658f29a5 JB	242	fprintf(f, "%s: ", l->label);
a4da2e3e DG	243	if (tree->name && (*tree->name))
	244	fprintf(f, "%s {\n", tree->name);
	245	else
	246	fprintf(f, "/ {\n");
	247
	248	for_each_property(tree, prop) {
	249	write_prefix(f, level+1);
658f29a5 JB	250	for_each_label(prop->labels, l)
658f29a5 JB	251	fprintf(f, "%s: ", l->label);
a4da2e3e DG	252	fprintf(f, "%s", prop->name);
	253	write_propval(f, prop);
	254	}
	255	for_each_child(tree, child) {
	256	fprintf(f, "\n");
	257	write_tree_source_node(f, child, level+1);
	258	}
	259	write_prefix(f, level);
	260	fprintf(f, "};\n");
	261	}
	262
	263
	264	void dt_to_source(FILE f, struct boot_info bi)
	265	{
	266	struct reserve_info *re;
	267
	268	fprintf(f, "/dts-v1/;\n\n");
	269
	270	for (re = bi->reservelist; re; re = re->next) {
658f29a5 JB	271	struct label *l;
	272
	273	for_each_label(re->labels, l)
	274	fprintf(f, "%s: ", l->label);
a4da2e3e DG	275	fprintf(f, "/memreserve/\t0x%016llx 0x%016llx;\n",
	276	(unsigned long long)re->re.address,
	277	(unsigned long long)re->re.size);
	278	}
	279
	280	write_tree_source_node(f, bi->dt, 0);
	281	}
	282