xref: /OK3568_Linux_fs/kernel/scripts/dtc/data.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-or-later
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun  * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation.  2005.
4*4882a593Smuzhiyun  */
5*4882a593Smuzhiyun 
6*4882a593Smuzhiyun #include "dtc.h"
7*4882a593Smuzhiyun 
data_free(struct data d)8*4882a593Smuzhiyun void data_free(struct data d)
9*4882a593Smuzhiyun {
10*4882a593Smuzhiyun 	struct marker *m, *nm;
11*4882a593Smuzhiyun 
12*4882a593Smuzhiyun 	m = d.markers;
13*4882a593Smuzhiyun 	while (m) {
14*4882a593Smuzhiyun 		nm = m->next;
15*4882a593Smuzhiyun 		free(m->ref);
16*4882a593Smuzhiyun 		free(m);
17*4882a593Smuzhiyun 		m = nm;
18*4882a593Smuzhiyun 	}
19*4882a593Smuzhiyun 
20*4882a593Smuzhiyun 	if (d.val)
21*4882a593Smuzhiyun 		free(d.val);
22*4882a593Smuzhiyun }
23*4882a593Smuzhiyun 
data_grow_for(struct data d,int xlen)24*4882a593Smuzhiyun struct data data_grow_for(struct data d, int xlen)
25*4882a593Smuzhiyun {
26*4882a593Smuzhiyun 	struct data nd;
27*4882a593Smuzhiyun 	int newsize;
28*4882a593Smuzhiyun 
29*4882a593Smuzhiyun 	if (xlen == 0)
30*4882a593Smuzhiyun 		return d;
31*4882a593Smuzhiyun 
32*4882a593Smuzhiyun 	nd = d;
33*4882a593Smuzhiyun 
34*4882a593Smuzhiyun 	newsize = xlen;
35*4882a593Smuzhiyun 
36*4882a593Smuzhiyun 	while ((d.len + xlen) > newsize)
37*4882a593Smuzhiyun 		newsize *= 2;
38*4882a593Smuzhiyun 
39*4882a593Smuzhiyun 	nd.val = xrealloc(d.val, newsize);
40*4882a593Smuzhiyun 
41*4882a593Smuzhiyun 	return nd;
42*4882a593Smuzhiyun }
43*4882a593Smuzhiyun 
data_copy_mem(const char * mem,int len)44*4882a593Smuzhiyun struct data data_copy_mem(const char *mem, int len)
45*4882a593Smuzhiyun {
46*4882a593Smuzhiyun 	struct data d;
47*4882a593Smuzhiyun 
48*4882a593Smuzhiyun 	d = data_grow_for(empty_data, len);
49*4882a593Smuzhiyun 
50*4882a593Smuzhiyun 	d.len = len;
51*4882a593Smuzhiyun 	memcpy(d.val, mem, len);
52*4882a593Smuzhiyun 
53*4882a593Smuzhiyun 	return d;
54*4882a593Smuzhiyun }
55*4882a593Smuzhiyun 
data_copy_escape_string(const char * s,int len)56*4882a593Smuzhiyun struct data data_copy_escape_string(const char *s, int len)
57*4882a593Smuzhiyun {
58*4882a593Smuzhiyun 	int i = 0;
59*4882a593Smuzhiyun 	struct data d;
60*4882a593Smuzhiyun 	char *q;
61*4882a593Smuzhiyun 
62*4882a593Smuzhiyun 	d = data_add_marker(empty_data, TYPE_STRING, NULL);
63*4882a593Smuzhiyun 	d = data_grow_for(d, len + 1);
64*4882a593Smuzhiyun 
65*4882a593Smuzhiyun 	q = d.val;
66*4882a593Smuzhiyun 	while (i < len) {
67*4882a593Smuzhiyun 		char c = s[i++];
68*4882a593Smuzhiyun 
69*4882a593Smuzhiyun 		if (c == '\\')
70*4882a593Smuzhiyun 			c = get_escape_char(s, &i);
71*4882a593Smuzhiyun 
72*4882a593Smuzhiyun 		q[d.len++] = c;
73*4882a593Smuzhiyun 	}
74*4882a593Smuzhiyun 
75*4882a593Smuzhiyun 	q[d.len++] = '\0';
76*4882a593Smuzhiyun 	return d;
77*4882a593Smuzhiyun }
78*4882a593Smuzhiyun 
data_copy_file(FILE * f,size_t maxlen)79*4882a593Smuzhiyun struct data data_copy_file(FILE *f, size_t maxlen)
80*4882a593Smuzhiyun {
81*4882a593Smuzhiyun 	struct data d = empty_data;
82*4882a593Smuzhiyun 
83*4882a593Smuzhiyun 	d = data_add_marker(d, TYPE_NONE, NULL);
84*4882a593Smuzhiyun 	while (!feof(f) && (d.len < maxlen)) {
85*4882a593Smuzhiyun 		size_t chunksize, ret;
86*4882a593Smuzhiyun 
87*4882a593Smuzhiyun 		if (maxlen == -1)
88*4882a593Smuzhiyun 			chunksize = 4096;
89*4882a593Smuzhiyun 		else
90*4882a593Smuzhiyun 			chunksize = maxlen - d.len;
91*4882a593Smuzhiyun 
92*4882a593Smuzhiyun 		d = data_grow_for(d, chunksize);
93*4882a593Smuzhiyun 		ret = fread(d.val + d.len, 1, chunksize, f);
94*4882a593Smuzhiyun 
95*4882a593Smuzhiyun 		if (ferror(f))
96*4882a593Smuzhiyun 			die("Error reading file into data: %s", strerror(errno));
97*4882a593Smuzhiyun 
98*4882a593Smuzhiyun 		if (d.len + ret < d.len)
99*4882a593Smuzhiyun 			die("Overflow reading file into data\n");
100*4882a593Smuzhiyun 
101*4882a593Smuzhiyun 		d.len += ret;
102*4882a593Smuzhiyun 	}
103*4882a593Smuzhiyun 
104*4882a593Smuzhiyun 	return d;
105*4882a593Smuzhiyun }
106*4882a593Smuzhiyun 
data_append_data(struct data d,const void * p,int len)107*4882a593Smuzhiyun struct data data_append_data(struct data d, const void *p, int len)
108*4882a593Smuzhiyun {
109*4882a593Smuzhiyun 	d = data_grow_for(d, len);
110*4882a593Smuzhiyun 	memcpy(d.val + d.len, p, len);
111*4882a593Smuzhiyun 	d.len += len;
112*4882a593Smuzhiyun 	return d;
113*4882a593Smuzhiyun }
114*4882a593Smuzhiyun 
data_insert_at_marker(struct data d,struct marker * m,const void * p,int len)115*4882a593Smuzhiyun struct data data_insert_at_marker(struct data d, struct marker *m,
116*4882a593Smuzhiyun 				  const void *p, int len)
117*4882a593Smuzhiyun {
118*4882a593Smuzhiyun 	d = data_grow_for(d, len);
119*4882a593Smuzhiyun 	memmove(d.val + m->offset + len, d.val + m->offset, d.len - m->offset);
120*4882a593Smuzhiyun 	memcpy(d.val + m->offset, p, len);
121*4882a593Smuzhiyun 	d.len += len;
122*4882a593Smuzhiyun 
123*4882a593Smuzhiyun 	/* Adjust all markers after the one we're inserting at */
124*4882a593Smuzhiyun 	m = m->next;
125*4882a593Smuzhiyun 	for_each_marker(m)
126*4882a593Smuzhiyun 		m->offset += len;
127*4882a593Smuzhiyun 	return d;
128*4882a593Smuzhiyun }
129*4882a593Smuzhiyun 
data_append_markers(struct data d,struct marker * m)130*4882a593Smuzhiyun static struct data data_append_markers(struct data d, struct marker *m)
131*4882a593Smuzhiyun {
132*4882a593Smuzhiyun 	struct marker **mp = &d.markers;
133*4882a593Smuzhiyun 
134*4882a593Smuzhiyun 	/* Find the end of the markerlist */
135*4882a593Smuzhiyun 	while (*mp)
136*4882a593Smuzhiyun 		mp = &((*mp)->next);
137*4882a593Smuzhiyun 	*mp = m;
138*4882a593Smuzhiyun 	return d;
139*4882a593Smuzhiyun }
140*4882a593Smuzhiyun 
data_merge(struct data d1,struct data d2)141*4882a593Smuzhiyun struct data data_merge(struct data d1, struct data d2)
142*4882a593Smuzhiyun {
143*4882a593Smuzhiyun 	struct data d;
144*4882a593Smuzhiyun 	struct marker *m2 = d2.markers;
145*4882a593Smuzhiyun 
146*4882a593Smuzhiyun 	d = data_append_markers(data_append_data(d1, d2.val, d2.len), m2);
147*4882a593Smuzhiyun 
148*4882a593Smuzhiyun 	/* Adjust for the length of d1 */
149*4882a593Smuzhiyun 	for_each_marker(m2)
150*4882a593Smuzhiyun 		m2->offset += d1.len;
151*4882a593Smuzhiyun 
152*4882a593Smuzhiyun 	d2.markers = NULL; /* So data_free() doesn't clobber them */
153*4882a593Smuzhiyun 	data_free(d2);
154*4882a593Smuzhiyun 
155*4882a593Smuzhiyun 	return d;
156*4882a593Smuzhiyun }
157*4882a593Smuzhiyun 
data_append_integer(struct data d,uint64_t value,int bits)158*4882a593Smuzhiyun struct data data_append_integer(struct data d, uint64_t value, int bits)
159*4882a593Smuzhiyun {
160*4882a593Smuzhiyun 	uint8_t value_8;
161*4882a593Smuzhiyun 	fdt16_t value_16;
162*4882a593Smuzhiyun 	fdt32_t value_32;
163*4882a593Smuzhiyun 	fdt64_t value_64;
164*4882a593Smuzhiyun 
165*4882a593Smuzhiyun 	switch (bits) {
166*4882a593Smuzhiyun 	case 8:
167*4882a593Smuzhiyun 		value_8 = value;
168*4882a593Smuzhiyun 		return data_append_data(d, &value_8, 1);
169*4882a593Smuzhiyun 
170*4882a593Smuzhiyun 	case 16:
171*4882a593Smuzhiyun 		value_16 = cpu_to_fdt16(value);
172*4882a593Smuzhiyun 		return data_append_data(d, &value_16, 2);
173*4882a593Smuzhiyun 
174*4882a593Smuzhiyun 	case 32:
175*4882a593Smuzhiyun 		value_32 = cpu_to_fdt32(value);
176*4882a593Smuzhiyun 		return data_append_data(d, &value_32, 4);
177*4882a593Smuzhiyun 
178*4882a593Smuzhiyun 	case 64:
179*4882a593Smuzhiyun 		value_64 = cpu_to_fdt64(value);
180*4882a593Smuzhiyun 		return data_append_data(d, &value_64, 8);
181*4882a593Smuzhiyun 
182*4882a593Smuzhiyun 	default:
183*4882a593Smuzhiyun 		die("Invalid literal size (%d)\n", bits);
184*4882a593Smuzhiyun 	}
185*4882a593Smuzhiyun }
186*4882a593Smuzhiyun 
data_append_re(struct data d,uint64_t address,uint64_t size)187*4882a593Smuzhiyun struct data data_append_re(struct data d, uint64_t address, uint64_t size)
188*4882a593Smuzhiyun {
189*4882a593Smuzhiyun 	struct fdt_reserve_entry re;
190*4882a593Smuzhiyun 
191*4882a593Smuzhiyun 	re.address = cpu_to_fdt64(address);
192*4882a593Smuzhiyun 	re.size = cpu_to_fdt64(size);
193*4882a593Smuzhiyun 
194*4882a593Smuzhiyun 	return data_append_data(d, &re, sizeof(re));
195*4882a593Smuzhiyun }
196*4882a593Smuzhiyun 
data_append_cell(struct data d,cell_t word)197*4882a593Smuzhiyun struct data data_append_cell(struct data d, cell_t word)
198*4882a593Smuzhiyun {
199*4882a593Smuzhiyun 	return data_append_integer(d, word, sizeof(word) * 8);
200*4882a593Smuzhiyun }
201*4882a593Smuzhiyun 
data_append_addr(struct data d,uint64_t addr)202*4882a593Smuzhiyun struct data data_append_addr(struct data d, uint64_t addr)
203*4882a593Smuzhiyun {
204*4882a593Smuzhiyun 	return data_append_integer(d, addr, sizeof(addr) * 8);
205*4882a593Smuzhiyun }
206*4882a593Smuzhiyun 
data_append_byte(struct data d,uint8_t byte)207*4882a593Smuzhiyun struct data data_append_byte(struct data d, uint8_t byte)
208*4882a593Smuzhiyun {
209*4882a593Smuzhiyun 	return data_append_data(d, &byte, 1);
210*4882a593Smuzhiyun }
211*4882a593Smuzhiyun 
data_append_zeroes(struct data d,int len)212*4882a593Smuzhiyun struct data data_append_zeroes(struct data d, int len)
213*4882a593Smuzhiyun {
214*4882a593Smuzhiyun 	d = data_grow_for(d, len);
215*4882a593Smuzhiyun 
216*4882a593Smuzhiyun 	memset(d.val + d.len, 0, len);
217*4882a593Smuzhiyun 	d.len += len;
218*4882a593Smuzhiyun 	return d;
219*4882a593Smuzhiyun }
220*4882a593Smuzhiyun 
data_append_align(struct data d,int align)221*4882a593Smuzhiyun struct data data_append_align(struct data d, int align)
222*4882a593Smuzhiyun {
223*4882a593Smuzhiyun 	int newlen = ALIGN(d.len, align);
224*4882a593Smuzhiyun 	return data_append_zeroes(d, newlen - d.len);
225*4882a593Smuzhiyun }
226*4882a593Smuzhiyun 
data_add_marker(struct data d,enum markertype type,char * ref)227*4882a593Smuzhiyun struct data data_add_marker(struct data d, enum markertype type, char *ref)
228*4882a593Smuzhiyun {
229*4882a593Smuzhiyun 	struct marker *m;
230*4882a593Smuzhiyun 
231*4882a593Smuzhiyun 	m = xmalloc(sizeof(*m));
232*4882a593Smuzhiyun 	m->offset = d.len;
233*4882a593Smuzhiyun 	m->type = type;
234*4882a593Smuzhiyun 	m->ref = ref;
235*4882a593Smuzhiyun 	m->next = NULL;
236*4882a593Smuzhiyun 
237*4882a593Smuzhiyun 	return data_append_markers(d, m);
238*4882a593Smuzhiyun }
239*4882a593Smuzhiyun 
data_is_one_string(struct data d)240*4882a593Smuzhiyun bool data_is_one_string(struct data d)
241*4882a593Smuzhiyun {
242*4882a593Smuzhiyun 	int i;
243*4882a593Smuzhiyun 	int len = d.len;
244*4882a593Smuzhiyun 
245*4882a593Smuzhiyun 	if (len == 0)
246*4882a593Smuzhiyun 		return false;
247*4882a593Smuzhiyun 
248*4882a593Smuzhiyun 	for (i = 0; i < len-1; i++)
249*4882a593Smuzhiyun 		if (d.val[i] == '\0')
250*4882a593Smuzhiyun 			return false;
251*4882a593Smuzhiyun 
252*4882a593Smuzhiyun 	if (d.val[len-1] != '\0')
253*4882a593Smuzhiyun 		return false;
254*4882a593Smuzhiyun 
255*4882a593Smuzhiyun 	return true;
256*4882a593Smuzhiyun }
257