blob: 14734233ad8b7ebd38c3e62442b81aae66601806 [file] [log] [blame]
Rob Herringacfe84f2019-06-20 15:19:38 -06001// SPDX-License-Identifier: GPL-2.0-or-later
David Gibsonfc14dad2005-06-08 17:18:34 +10002/*
3 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
David Gibsonfc14dad2005-06-08 17:18:34 +10004 */
5
6#include "dtc.h"
7
David Gibsonfc14dad2005-06-08 17:18:34 +10008void data_free(struct data d)
9{
David Gibsondc941772007-11-22 14:39:23 +110010 struct marker *m, *nm;
David Gibson81f2e892005-06-16 17:04:00 +100011
David Gibsondc941772007-11-22 14:39:23 +110012 m = d.markers;
13 while (m) {
14 nm = m->next;
15 free(m->ref);
16 free(m);
17 m = nm;
David Gibson81f2e892005-06-16 17:04:00 +100018 }
19
David Gibsonfc14dad2005-06-08 17:18:34 +100020 if (d.val)
21 free(d.val);
22}
23
Andre Przywarae1147b12020-10-12 17:19:43 +010024struct data data_grow_for(struct data d, unsigned int xlen)
David Gibsonfc14dad2005-06-08 17:18:34 +100025{
26 struct data nd;
Andre Przywarae1147b12020-10-12 17:19:43 +010027 unsigned int newsize;
David Gibsonfc14dad2005-06-08 17:18:34 +100028
David Gibsonfc14dad2005-06-08 17:18:34 +100029 if (xlen == 0)
30 return d;
31
Milton Miller46779e82007-07-07 01:18:49 -050032 nd = d;
33
David Gibsonfc14dad2005-06-08 17:18:34 +100034 newsize = xlen;
35
36 while ((d.len + xlen) > newsize)
37 newsize *= 2;
38
David Gibsonfc14dad2005-06-08 17:18:34 +100039 nd.val = xrealloc(d.val, newsize);
David Gibsonfc14dad2005-06-08 17:18:34 +100040
David Gibsonfc14dad2005-06-08 17:18:34 +100041 return nd;
42}
43
David Gibson92cb9a22007-12-04 14:26:15 +110044struct data data_copy_mem(const char *mem, int len)
David Gibsonfc14dad2005-06-08 17:18:34 +100045{
46 struct data d;
47
48 d = data_grow_for(empty_data, len);
49
50 d.len = len;
51 memcpy(d.val, mem, len);
52
53 return d;
54}
55
David Gibson92cb9a22007-12-04 14:26:15 +110056struct data data_copy_escape_string(const char *s, int len)
David Gibsonfc14dad2005-06-08 17:18:34 +100057{
58 int i = 0;
59 struct data d;
60 char *q;
61
Grant Likely44d3efe2018-05-15 17:42:54 -050062 d = data_add_marker(empty_data, TYPE_STRING, NULL);
63 d = data_grow_for(d, len + 1);
David Gibsonfc14dad2005-06-08 17:18:34 +100064
65 q = d.val;
66 while (i < len) {
67 char c = s[i++];
68
Anton Staafb43335a2011-09-09 12:16:29 -070069 if (c == '\\')
70 c = get_escape_char(s, &i);
David Gibsonfc14dad2005-06-08 17:18:34 +100071
Anton Staafb43335a2011-09-09 12:16:29 -070072 q[d.len++] = c;
David Gibsonfc14dad2005-06-08 17:18:34 +100073 }
74
75 q[d.len++] = '\0';
76 return d;
77}
78
David Gibsone37ec7d2008-06-11 11:58:39 +100079struct data data_copy_file(FILE *f, size_t maxlen)
David Gibsonfc14dad2005-06-08 17:18:34 +100080{
David Gibsone37ec7d2008-06-11 11:58:39 +100081 struct data d = empty_data;
David Gibsonfc14dad2005-06-08 17:18:34 +100082
Greg Kurz9619c862018-08-30 12:01:59 +020083 d = data_add_marker(d, TYPE_NONE, NULL);
David Gibsone37ec7d2008-06-11 11:58:39 +100084 while (!feof(f) && (d.len < maxlen)) {
85 size_t chunksize, ret;
David Gibsonfc14dad2005-06-08 17:18:34 +100086
Andre Przywara3bc3a6b2020-10-12 17:19:45 +010087 if (maxlen == (size_t)-1)
David Gibsone37ec7d2008-06-11 11:58:39 +100088 chunksize = 4096;
89 else
90 chunksize = maxlen - d.len;
91
92 d = data_grow_for(d, chunksize);
93 ret = fread(d.val + d.len, 1, chunksize, f);
94
95 if (ferror(f))
96 die("Error reading file into data: %s", strerror(errno));
97
98 if (d.len + ret < d.len)
99 die("Overflow reading file into data\n");
100
101 d.len += ret;
102 }
David Gibsonfc14dad2005-06-08 17:18:34 +1000103
104 return d;
105}
106
David Gibson92cb9a22007-12-04 14:26:15 +1100107struct data data_append_data(struct data d, const void *p, int len)
David Gibsonfc14dad2005-06-08 17:18:34 +1000108{
109 d = data_grow_for(d, len);
110 memcpy(d.val + d.len, p, len);
111 d.len += len;
112 return d;
113}
114
David Gibsonefbbef82007-12-05 10:43:50 +1100115struct data data_insert_at_marker(struct data d, struct marker *m,
116 const void *p, int len)
117{
118 d = data_grow_for(d, len);
119 memmove(d.val + m->offset + len, d.val + m->offset, d.len - m->offset);
120 memcpy(d.val + m->offset, p, len);
121 d.len += len;
122
123 /* Adjust all markers after the one we're inserting at */
124 m = m->next;
125 for_each_marker(m)
126 m->offset += len;
127 return d;
128}
129
David Gibson01a2d8a2008-08-04 15:30:13 +1000130static struct data data_append_markers(struct data d, struct marker *m)
David Gibson32da4752007-02-07 16:37:50 +1100131{
David Gibsondc941772007-11-22 14:39:23 +1100132 struct marker **mp = &d.markers;
David Gibson32da4752007-02-07 16:37:50 +1100133
David Gibsondc941772007-11-22 14:39:23 +1100134 /* Find the end of the markerlist */
135 while (*mp)
136 mp = &((*mp)->next);
137 *mp = m;
138 return d;
Milton Miller6a99b132007-07-07 01:18:51 -0500139}
140
141struct data data_merge(struct data d1, struct data d2)
142{
143 struct data d;
David Gibsondc941772007-11-22 14:39:23 +1100144 struct marker *m2 = d2.markers;
Milton Miller6a99b132007-07-07 01:18:51 -0500145
David Gibsondc941772007-11-22 14:39:23 +1100146 d = data_append_markers(data_append_data(d1, d2.val, d2.len), m2);
Milton Miller6a99b132007-07-07 01:18:51 -0500147
David Gibsondc941772007-11-22 14:39:23 +1100148 /* Adjust for the length of d1 */
149 for_each_marker(m2)
150 m2->offset += d1.len;
David Gibson32da4752007-02-07 16:37:50 +1100151
David Gibsondc941772007-11-22 14:39:23 +1100152 d2.markers = NULL; /* So data_free() doesn't clobber them */
David Gibson32da4752007-02-07 16:37:50 +1100153 data_free(d2);
154
155 return d;
156}
157
Anton Staafa4b515c2011-10-11 10:22:28 -0700158struct data data_append_integer(struct data d, uint64_t value, int bits)
David Gibsonfc14dad2005-06-08 17:18:34 +1000159{
Anton Staafa4b515c2011-10-11 10:22:28 -0700160 uint8_t value_8;
David Gibsonbad5b282017-03-06 12:08:53 +1100161 fdt16_t value_16;
162 fdt32_t value_32;
163 fdt64_t value_64;
David Gibsonfc14dad2005-06-08 17:18:34 +1000164
Anton Staafa4b515c2011-10-11 10:22:28 -0700165 switch (bits) {
166 case 8:
167 value_8 = value;
168 return data_append_data(d, &value_8, 1);
169
170 case 16:
171 value_16 = cpu_to_fdt16(value);
172 return data_append_data(d, &value_16, 2);
173
174 case 32:
175 value_32 = cpu_to_fdt32(value);
176 return data_append_data(d, &value_32, 4);
177
178 case 64:
179 value_64 = cpu_to_fdt64(value);
180 return data_append_data(d, &value_64, 8);
181
182 default:
183 die("Invalid literal size (%d)\n", bits);
184 }
David Gibsonfc14dad2005-06-08 17:18:34 +1000185}
186
David Gibson49300f22017-03-06 12:04:45 +1100187struct data data_append_re(struct data d, uint64_t address, uint64_t size)
David Gibsonf040d952005-10-24 18:18:38 +1000188{
David Gibson49300f22017-03-06 12:04:45 +1100189 struct fdt_reserve_entry re;
David Gibsonf040d952005-10-24 18:18:38 +1000190
David Gibson49300f22017-03-06 12:04:45 +1100191 re.address = cpu_to_fdt64(address);
192 re.size = cpu_to_fdt64(size);
David Gibsonf040d952005-10-24 18:18:38 +1000193
David Gibson49300f22017-03-06 12:04:45 +1100194 return data_append_data(d, &re, sizeof(re));
David Gibsonf040d952005-10-24 18:18:38 +1000195}
196
Anton Staafa4b515c2011-10-11 10:22:28 -0700197struct data data_append_cell(struct data d, cell_t word)
198{
199 return data_append_integer(d, word, sizeof(word) * 8);
200}
201
David Gibson53359012008-06-25 13:53:07 +1000202struct data data_append_addr(struct data d, uint64_t addr)
David Gibsonf0517db2005-07-15 17:14:24 +1000203{
Anton Staafa4b515c2011-10-11 10:22:28 -0700204 return data_append_integer(d, addr, sizeof(addr) * 8);
David Gibsonf0517db2005-07-15 17:14:24 +1000205}
206
David Gibsonfc14dad2005-06-08 17:18:34 +1000207struct data data_append_byte(struct data d, uint8_t byte)
208{
209 return data_append_data(d, &byte, 1);
210}
211
212struct data data_append_zeroes(struct data d, int len)
213{
214 d = data_grow_for(d, len);
215
216 memset(d.val + d.len, 0, len);
217 d.len += len;
218 return d;
219}
220
221struct data data_append_align(struct data d, int align)
222{
223 int newlen = ALIGN(d.len, align);
224 return data_append_zeroes(d, newlen - d.len);
225}
226
David Gibsondc941772007-11-22 14:39:23 +1100227struct data data_add_marker(struct data d, enum markertype type, char *ref)
David Gibson81f2e892005-06-16 17:04:00 +1000228{
David Gibsondc941772007-11-22 14:39:23 +1100229 struct marker *m;
David Gibson81f2e892005-06-16 17:04:00 +1000230
David Gibsondc941772007-11-22 14:39:23 +1100231 m = xmalloc(sizeof(*m));
232 m->offset = d.len;
233 m->type = type;
234 m->ref = ref;
235 m->next = NULL;
David Gibson81f2e892005-06-16 17:04:00 +1000236
David Gibsondc941772007-11-22 14:39:23 +1100237 return data_append_markers(d, m);
Milton Miller6a99b132007-07-07 01:18:51 -0500238}
239
David Gibson17625372013-10-28 21:06:53 +1100240bool data_is_one_string(struct data d)
David Gibsonfc14dad2005-06-08 17:18:34 +1000241{
242 int i;
243 int len = d.len;
244
245 if (len == 0)
David Gibson17625372013-10-28 21:06:53 +1100246 return false;
David Gibsonfc14dad2005-06-08 17:18:34 +1000247
248 for (i = 0; i < len-1; i++)
249 if (d.val[i] == '\0')
David Gibson17625372013-10-28 21:06:53 +1100250 return false;
David Gibsonfc14dad2005-06-08 17:18:34 +1000251
252 if (d.val[len-1] != '\0')
David Gibson17625372013-10-28 21:06:53 +1100253 return false;
David Gibsonfc14dad2005-06-08 17:18:34 +1000254
David Gibson17625372013-10-28 21:06:53 +1100255 return true;
David Gibsonfc14dad2005-06-08 17:18:34 +1000256}