/src/binutils-gdb/libctf/ctf-dump.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Textual dumping of CTF data. |
2 | | Copyright (C) 2019-2025 Free Software Foundation, Inc. |
3 | | |
4 | | This file is part of libctf. |
5 | | |
6 | | libctf is free software; you can redistribute it and/or modify it under |
7 | | the terms of the GNU General Public License as published by the Free |
8 | | Software Foundation; either version 3, or (at your option) any later |
9 | | version. |
10 | | |
11 | | This program is distributed in the hope that it will be useful, but |
12 | | WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. |
14 | | See the GNU General Public License for more details. |
15 | | |
16 | | You should have received a copy of the GNU General Public License |
17 | | along with this program; see the file COPYING. If not see |
18 | | <http://www.gnu.org/licenses/>. */ |
19 | | |
20 | | #include <ctf-impl.h> |
21 | | #include <string.h> |
22 | | |
23 | 0 | #define str_append(s, a) ctf_str_append_noerr (s, a) |
24 | | |
25 | | /* One item to be dumped, in string form. */ |
26 | | |
27 | | typedef struct ctf_dump_item |
28 | | { |
29 | | ctf_list_t cdi_list; |
30 | | char *cdi_item; |
31 | | } ctf_dump_item_t; |
32 | | |
33 | | /* Cross-call state for dumping. Basically just enough to track the section in |
34 | | use and a list of return strings. */ |
35 | | |
36 | | struct ctf_dump_state |
37 | | { |
38 | | ctf_sect_names_t cds_sect; |
39 | | ctf_dict_t *cds_fp; |
40 | | ctf_dump_item_t *cds_current; |
41 | | ctf_list_t cds_items; |
42 | | }; |
43 | | |
44 | | /* Cross-call state for ctf_dump_member. */ |
45 | | |
46 | | typedef struct ctf_dump_membstate |
47 | | { |
48 | | char **cdm_str; |
49 | | ctf_dict_t *cdm_fp; |
50 | | const char *cdm_toplevel_indent; |
51 | | } ctf_dump_membstate_t; |
52 | | |
53 | | static int |
54 | | ctf_dump_append (ctf_dump_state_t *state, char *str) |
55 | 0 | { |
56 | 0 | ctf_dump_item_t *cdi; |
57 | |
|
58 | 0 | if ((cdi = malloc (sizeof (struct ctf_dump_item))) == NULL) |
59 | 0 | return (ctf_set_errno (state->cds_fp, ENOMEM)); |
60 | | |
61 | 0 | cdi->cdi_item = str; |
62 | 0 | ctf_list_append (&state->cds_items, cdi); |
63 | 0 | return 0; |
64 | 0 | } |
65 | | |
66 | | static void |
67 | | ctf_dump_free (ctf_dump_state_t *state) |
68 | 0 | { |
69 | 0 | ctf_dump_item_t *cdi, *next_cdi; |
70 | |
|
71 | 0 | if (state == NULL) |
72 | 0 | return; |
73 | | |
74 | 0 | for (cdi = ctf_list_next (&state->cds_items); cdi != NULL; |
75 | 0 | cdi = next_cdi) |
76 | 0 | { |
77 | 0 | free (cdi->cdi_item); |
78 | 0 | next_cdi = ctf_list_next (cdi); |
79 | 0 | free (cdi); |
80 | 0 | } |
81 | 0 | } |
82 | | |
83 | | /* Return a dump for a single type, without member info: but do optionally show |
84 | | the type's references. */ |
85 | | |
86 | 0 | #define CTF_FT_REFS 0x2 /* Print referenced types. */ |
87 | 0 | #define CTF_FT_BITFIELD 0x4 /* Print :BITS if a bitfield. */ |
88 | 0 | #define CTF_FT_ID 0x8 /* Print "ID: " in front of type IDs. */ |
89 | | |
90 | | static char * |
91 | | ctf_dump_format_type (ctf_dict_t *fp, ctf_id_t id, int flag) |
92 | 0 | { |
93 | 0 | ctf_id_t new_id; |
94 | 0 | char *str = NULL, *bit = NULL, *buf = NULL; |
95 | |
|
96 | 0 | ctf_set_errno (fp, 0); |
97 | 0 | new_id = id; |
98 | 0 | do |
99 | 0 | { |
100 | 0 | ctf_encoding_t ep; |
101 | 0 | ctf_arinfo_t ar; |
102 | 0 | int kind, unsliced_kind; |
103 | 0 | ssize_t size, align; |
104 | 0 | const char *nonroot_leader = ""; |
105 | 0 | const char *nonroot_trailer = ""; |
106 | 0 | const char *idstr = ""; |
107 | |
|
108 | 0 | id = new_id; |
109 | 0 | if (!(flag & CTF_ADD_ROOT)) |
110 | 0 | { |
111 | 0 | nonroot_leader = "{"; |
112 | 0 | nonroot_trailer = "}"; |
113 | 0 | } |
114 | |
|
115 | 0 | buf = ctf_type_aname (fp, id); |
116 | 0 | if (!buf) |
117 | 0 | { |
118 | 0 | if (id == 0 || ctf_errno (fp) == ECTF_NONREPRESENTABLE) |
119 | 0 | { |
120 | 0 | ctf_set_errno (fp, ECTF_NONREPRESENTABLE); |
121 | 0 | str = str_append (str, " (type not represented in CTF)"); |
122 | 0 | return str; |
123 | 0 | } |
124 | | |
125 | 0 | goto err; |
126 | 0 | } |
127 | | |
128 | 0 | if (flag & CTF_FT_ID) |
129 | 0 | idstr = "ID "; |
130 | 0 | if (asprintf (&bit, "%s%s0x%lx: (kind %i) ", nonroot_leader, idstr, |
131 | 0 | id, ctf_type_kind (fp, id)) < 0) |
132 | 0 | goto oom; |
133 | 0 | str = str_append (str, bit); |
134 | 0 | free (bit); |
135 | 0 | bit = NULL; |
136 | |
|
137 | 0 | if (buf[0] != '\0') |
138 | 0 | str = str_append (str, buf); |
139 | |
|
140 | 0 | free (buf); |
141 | 0 | buf = NULL; |
142 | |
|
143 | 0 | unsliced_kind = ctf_type_kind_unsliced (fp, id); |
144 | 0 | kind = ctf_type_kind (fp, id); |
145 | | |
146 | | /* Report encodings of everything with an encoding other than enums: |
147 | | base-type enums cannot have a nonzero cte_offset or cte_bits value. |
148 | | (Slices of them can, but they are of kind CTF_K_SLICE.) */ |
149 | 0 | if (unsliced_kind != CTF_K_ENUM && ctf_type_encoding (fp, id, &ep) == 0) |
150 | 0 | { |
151 | 0 | if ((ssize_t) ep.cte_bits != ctf_type_size (fp, id) * CHAR_BIT |
152 | 0 | && flag & CTF_FT_BITFIELD) |
153 | 0 | { |
154 | 0 | if (asprintf (&bit, ":%i", ep.cte_bits) < 0) |
155 | 0 | goto oom; |
156 | 0 | str = str_append (str, bit); |
157 | 0 | free (bit); |
158 | 0 | bit = NULL; |
159 | 0 | } |
160 | | |
161 | 0 | if ((ssize_t) ep.cte_bits != ctf_type_size (fp, id) * CHAR_BIT |
162 | 0 | || ep.cte_offset != 0) |
163 | 0 | { |
164 | 0 | const char *slice = ""; |
165 | |
|
166 | 0 | if (unsliced_kind == CTF_K_SLICE) |
167 | 0 | slice = "slice "; |
168 | |
|
169 | 0 | if (asprintf (&bit, " [%s0x%x:0x%x]", |
170 | 0 | slice, ep.cte_offset, ep.cte_bits) < 0) |
171 | 0 | goto oom; |
172 | 0 | str = str_append (str, bit); |
173 | 0 | free (bit); |
174 | 0 | bit = NULL; |
175 | 0 | } |
176 | | |
177 | 0 | if (asprintf (&bit, " (format 0x%x)", ep.cte_format) < 0) |
178 | 0 | goto oom; |
179 | 0 | str = str_append (str, bit); |
180 | 0 | free (bit); |
181 | 0 | bit = NULL; |
182 | 0 | } |
183 | | |
184 | 0 | size = ctf_type_size (fp, id); |
185 | 0 | if (kind != CTF_K_FUNCTION && size >= 0) |
186 | 0 | { |
187 | 0 | if (asprintf (&bit, " (size 0x%lx)", (unsigned long int) size) < 0) |
188 | 0 | goto oom; |
189 | | |
190 | 0 | str = str_append (str, bit); |
191 | 0 | free (bit); |
192 | 0 | bit = NULL; |
193 | 0 | } |
194 | | |
195 | 0 | align = ctf_type_align (fp, id); |
196 | 0 | if (align >= 0) |
197 | 0 | { |
198 | 0 | if (asprintf (&bit, " (aligned at 0x%lx)", |
199 | 0 | (unsigned long int) align) < 0) |
200 | 0 | goto oom; |
201 | | |
202 | 0 | str = str_append (str, bit); |
203 | 0 | free (bit); |
204 | 0 | bit = NULL; |
205 | 0 | } |
206 | | |
207 | 0 | if (nonroot_trailer[0] != 0) |
208 | 0 | str = str_append (str, nonroot_trailer); |
209 | | |
210 | | /* Just exit after one iteration if we are not showing the types this type |
211 | | references. */ |
212 | 0 | if (!(flag & CTF_FT_REFS)) |
213 | 0 | return str; |
214 | | |
215 | | /* Keep going as long as this type references another. We consider arrays |
216 | | to "reference" their element type. */ |
217 | | |
218 | 0 | if (kind == CTF_K_ARRAY) |
219 | 0 | { |
220 | 0 | if (ctf_array_info (fp, id, &ar) < 0) |
221 | 0 | goto err; |
222 | 0 | new_id = ar.ctr_contents; |
223 | 0 | } |
224 | 0 | else |
225 | 0 | new_id = ctf_type_reference (fp, id); |
226 | 0 | if (new_id != CTF_ERR) |
227 | 0 | str = str_append (str, " -> "); |
228 | 0 | } |
229 | 0 | while (new_id != CTF_ERR); |
230 | | |
231 | 0 | if (ctf_errno (fp) != ECTF_NOTREF) |
232 | 0 | { |
233 | 0 | free (str); |
234 | 0 | return NULL; |
235 | 0 | } |
236 | | |
237 | 0 | return str; |
238 | | |
239 | 0 | oom: |
240 | 0 | ctf_set_errno (fp, errno); |
241 | 0 | err: |
242 | 0 | ctf_err_warn (fp, 1, ctf_errno (fp), _("cannot format name dumping type 0x%lx"), |
243 | 0 | id); |
244 | 0 | free (buf); |
245 | 0 | free (str); |
246 | 0 | free (bit); |
247 | 0 | return NULL; |
248 | 0 | } |
249 | | |
250 | | /* Dump one string field from the file header into the cds_items. */ |
251 | | static int |
252 | | ctf_dump_header_strfield (ctf_dict_t *fp, ctf_dump_state_t *state, |
253 | | const char *name, uint32_t value) |
254 | 0 | { |
255 | 0 | char *str; |
256 | 0 | if (value) |
257 | 0 | { |
258 | 0 | if (asprintf (&str, "%s: %s\n", name, ctf_strptr (fp, value)) < 0) |
259 | 0 | goto err; |
260 | 0 | ctf_dump_append (state, str); |
261 | 0 | } |
262 | 0 | return 0; |
263 | | |
264 | 0 | err: |
265 | 0 | return (ctf_set_errno (fp, errno)); |
266 | 0 | } |
267 | | |
268 | | /* Dump one section-offset field from the file header into the cds_items. */ |
269 | | static int |
270 | | ctf_dump_header_sectfield (ctf_dict_t *fp, ctf_dump_state_t *state, |
271 | | const char *sect, uint32_t off, uint32_t nextoff) |
272 | 0 | { |
273 | 0 | char *str; |
274 | 0 | if (nextoff - off) |
275 | 0 | { |
276 | 0 | if (asprintf (&str, "%s:\t0x%lx -- 0x%lx (0x%lx bytes)\n", sect, |
277 | 0 | (unsigned long) off, (unsigned long) (nextoff - 1), |
278 | 0 | (unsigned long) (nextoff - off)) < 0) |
279 | 0 | goto err; |
280 | 0 | ctf_dump_append (state, str); |
281 | 0 | } |
282 | 0 | return 0; |
283 | | |
284 | 0 | err: |
285 | 0 | return (ctf_set_errno (fp, errno)); |
286 | 0 | } |
287 | | |
288 | | /* Dump the file header into the cds_items. */ |
289 | | static int |
290 | | ctf_dump_header (ctf_dict_t *fp, ctf_dump_state_t *state) |
291 | 0 | { |
292 | 0 | char *str; |
293 | 0 | char *flagstr = NULL; |
294 | 0 | const ctf_header_t *hp = fp->ctf_header; |
295 | 0 | const char *vertab[] = |
296 | 0 | { |
297 | 0 | NULL, "CTF_VERSION_1", |
298 | 0 | "CTF_VERSION_1_UPGRADED_3 (latest format, version 1 type " |
299 | 0 | "boundaries)", |
300 | 0 | "CTF_VERSION_2", |
301 | 0 | "CTF_VERSION_3", NULL |
302 | 0 | }; |
303 | 0 | const char *verstr = NULL; |
304 | |
|
305 | 0 | if (asprintf (&str, "Magic number: 0x%x\n", hp->cth_magic) < 0) |
306 | 0 | goto err; |
307 | 0 | ctf_dump_append (state, str); |
308 | |
|
309 | 0 | if (hp->cth_version <= CTF_VERSION) |
310 | 0 | verstr = vertab[hp->cth_version]; |
311 | |
|
312 | 0 | if (verstr == NULL) |
313 | 0 | verstr = "(not a valid version)"; |
314 | |
|
315 | 0 | if (asprintf (&str, "Version: %i (%s)\n", hp->cth_version, |
316 | 0 | verstr) < 0) |
317 | 0 | goto err; |
318 | 0 | ctf_dump_append (state, str); |
319 | | |
320 | | /* Everything else is only printed if present. */ |
321 | | |
322 | | /* The flags are unusual in that they represent the ctf_dict_t *in memory*: |
323 | | flags representing compression, etc, are turned off as the file is |
324 | | decompressed. So we store a copy of the flags before they are changed, for |
325 | | the dumper. */ |
326 | |
|
327 | 0 | if (fp->ctf_openflags > 0) |
328 | 0 | { |
329 | 0 | if (asprintf (&flagstr, "%s%s%s%s%s%s%s", |
330 | 0 | fp->ctf_openflags & CTF_F_COMPRESS |
331 | 0 | ? "CTF_F_COMPRESS": "", |
332 | 0 | (fp->ctf_openflags & CTF_F_COMPRESS) |
333 | 0 | && (fp->ctf_openflags & ~CTF_F_COMPRESS) |
334 | 0 | ? ", " : "", |
335 | 0 | fp->ctf_openflags & CTF_F_NEWFUNCINFO |
336 | 0 | ? "CTF_F_NEWFUNCINFO" : "", |
337 | 0 | (fp->ctf_openflags & (CTF_F_NEWFUNCINFO)) |
338 | 0 | && (fp->ctf_openflags & ~(CTF_F_COMPRESS | CTF_F_NEWFUNCINFO)) |
339 | 0 | ? ", " : "", |
340 | 0 | fp->ctf_openflags & CTF_F_IDXSORTED |
341 | 0 | ? "CTF_F_IDXSORTED" : "", |
342 | 0 | fp->ctf_openflags & (CTF_F_IDXSORTED) |
343 | 0 | && (fp->ctf_openflags & ~(CTF_F_COMPRESS | CTF_F_NEWFUNCINFO |
344 | 0 | | CTF_F_IDXSORTED)) |
345 | 0 | ? ", " : "", |
346 | 0 | fp->ctf_openflags & CTF_F_DYNSTR |
347 | 0 | ? "CTF_F_DYNSTR" : "") < 0) |
348 | 0 | goto err; |
349 | | |
350 | 0 | if (asprintf (&str, "Flags: 0x%x (%s)", fp->ctf_openflags, flagstr) < 0) |
351 | 0 | goto err; |
352 | 0 | free (flagstr); |
353 | 0 | ctf_dump_append (state, str); |
354 | 0 | } |
355 | | |
356 | 0 | if (ctf_dump_header_strfield (fp, state, "Parent label", |
357 | 0 | hp->cth_parlabel) < 0) |
358 | 0 | goto err; |
359 | | |
360 | 0 | if (ctf_dump_header_strfield (fp, state, "Parent name", hp->cth_parname) < 0) |
361 | 0 | goto err; |
362 | | |
363 | 0 | if (ctf_dump_header_strfield (fp, state, "Compilation unit name", |
364 | 0 | hp->cth_cuname) < 0) |
365 | 0 | goto err; |
366 | | |
367 | 0 | if (ctf_dump_header_sectfield (fp, state, "Label section", hp->cth_lbloff, |
368 | 0 | hp->cth_objtoff) < 0) |
369 | 0 | goto err; |
370 | | |
371 | 0 | if (ctf_dump_header_sectfield (fp, state, "Data object section", |
372 | 0 | hp->cth_objtoff, hp->cth_funcoff) < 0) |
373 | 0 | goto err; |
374 | | |
375 | 0 | if (ctf_dump_header_sectfield (fp, state, "Function info section", |
376 | 0 | hp->cth_funcoff, hp->cth_objtidxoff) < 0) |
377 | 0 | goto err; |
378 | | |
379 | 0 | if (ctf_dump_header_sectfield (fp, state, "Object index section", |
380 | 0 | hp->cth_objtidxoff, hp->cth_funcidxoff) < 0) |
381 | 0 | goto err; |
382 | | |
383 | 0 | if (ctf_dump_header_sectfield (fp, state, "Function index section", |
384 | 0 | hp->cth_funcidxoff, hp->cth_varoff) < 0) |
385 | 0 | goto err; |
386 | | |
387 | 0 | if (ctf_dump_header_sectfield (fp, state, "Variable section", |
388 | 0 | hp->cth_varoff, hp->cth_typeoff) < 0) |
389 | 0 | goto err; |
390 | | |
391 | 0 | if (ctf_dump_header_sectfield (fp, state, "Type section", |
392 | 0 | hp->cth_typeoff, hp->cth_stroff) < 0) |
393 | 0 | goto err; |
394 | | |
395 | 0 | if (ctf_dump_header_sectfield (fp, state, "String section", hp->cth_stroff, |
396 | 0 | hp->cth_stroff + hp->cth_strlen + 1) < 0) |
397 | 0 | goto err; |
398 | | |
399 | 0 | return 0; |
400 | 0 | err: |
401 | 0 | free (flagstr); |
402 | 0 | return (ctf_set_errno (fp, errno)); |
403 | 0 | } |
404 | | |
405 | | /* Dump a single label into the cds_items. */ |
406 | | |
407 | | static int |
408 | | ctf_dump_label (const char *name, const ctf_lblinfo_t *info, |
409 | | void *arg) |
410 | 0 | { |
411 | 0 | char *str; |
412 | 0 | char *typestr; |
413 | 0 | ctf_dump_state_t *state = arg; |
414 | |
|
415 | 0 | if (asprintf (&str, "%s -> ", name) < 0) |
416 | 0 | return (ctf_set_errno (state->cds_fp, errno)); |
417 | | |
418 | 0 | if ((typestr = ctf_dump_format_type (state->cds_fp, info->ctb_type, |
419 | 0 | CTF_ADD_ROOT | CTF_FT_REFS)) == NULL) |
420 | 0 | { |
421 | 0 | free (str); |
422 | 0 | return 0; /* Swallow the error. */ |
423 | 0 | } |
424 | | |
425 | 0 | str = str_append (str, typestr); |
426 | 0 | free (typestr); |
427 | |
|
428 | 0 | ctf_dump_append (state, str); |
429 | 0 | return 0; |
430 | 0 | } |
431 | | |
432 | | /* Dump all the object or function entries into the cds_items. */ |
433 | | |
434 | | static int |
435 | | ctf_dump_objts (ctf_dict_t *fp, ctf_dump_state_t *state, int functions) |
436 | 0 | { |
437 | 0 | const char *name; |
438 | 0 | ctf_id_t id; |
439 | 0 | ctf_next_t *i = NULL; |
440 | 0 | char *str = NULL; |
441 | |
|
442 | 0 | if ((functions && fp->ctf_funcidx_names) |
443 | 0 | || (!functions && fp->ctf_objtidx_names)) |
444 | 0 | str = str_append (str, _("Section is indexed.\n")); |
445 | 0 | else if (fp->ctf_ext_symtab.cts_data == NULL) |
446 | 0 | str = str_append (str, _("No symbol table.\n")); |
447 | |
|
448 | 0 | while ((id = ctf_symbol_next (fp, &i, &name, functions)) != CTF_ERR) |
449 | 0 | { |
450 | 0 | char *typestr = NULL; |
451 | | |
452 | | /* Emit the name, if we know it. No trailing space: ctf_dump_format_type |
453 | | has a leading one. */ |
454 | 0 | if (name) |
455 | 0 | { |
456 | 0 | if (asprintf (&str, "%s -> ", name) < 0) |
457 | 0 | goto oom; |
458 | 0 | } |
459 | 0 | else |
460 | 0 | str = xstrdup (""); |
461 | | |
462 | 0 | if ((typestr = ctf_dump_format_type (state->cds_fp, id, |
463 | 0 | CTF_ADD_ROOT | CTF_FT_REFS)) == NULL) |
464 | 0 | { |
465 | 0 | ctf_dump_append (state, str); |
466 | 0 | continue; /* Swallow the error. */ |
467 | 0 | } |
468 | | |
469 | 0 | str = str_append (str, typestr); |
470 | 0 | free (typestr); |
471 | 0 | ctf_dump_append (state, str); |
472 | 0 | continue; |
473 | | |
474 | 0 | oom: |
475 | 0 | ctf_set_errno (fp, ENOMEM); |
476 | 0 | ctf_next_destroy (i); |
477 | 0 | return -1; |
478 | 0 | } |
479 | 0 | return 0; |
480 | 0 | } |
481 | | |
482 | | /* Dump a single variable into the cds_items. */ |
483 | | static int |
484 | | ctf_dump_var (const char *name, ctf_id_t type, void *arg) |
485 | 0 | { |
486 | 0 | char *str; |
487 | 0 | char *typestr; |
488 | 0 | ctf_dump_state_t *state = arg; |
489 | |
|
490 | 0 | if (asprintf (&str, "%s -> ", name) < 0) |
491 | 0 | return (ctf_set_errno (state->cds_fp, errno)); |
492 | | |
493 | 0 | if ((typestr = ctf_dump_format_type (state->cds_fp, type, |
494 | 0 | CTF_ADD_ROOT | CTF_FT_REFS)) == NULL) |
495 | 0 | { |
496 | 0 | free (str); |
497 | 0 | return 0; /* Swallow the error. */ |
498 | 0 | } |
499 | | |
500 | 0 | str = str_append (str, typestr); |
501 | 0 | free (typestr); |
502 | |
|
503 | 0 | ctf_dump_append (state, str); |
504 | 0 | return 0; |
505 | 0 | } |
506 | | |
507 | | /* Dump a single struct/union member into the string in the membstate. */ |
508 | | static int |
509 | | ctf_dump_member (const char *name, ctf_id_t id, unsigned long offset, |
510 | | int depth, void *arg) |
511 | 0 | { |
512 | 0 | ctf_dump_membstate_t *state = arg; |
513 | 0 | char *typestr = NULL; |
514 | 0 | char *bit = NULL; |
515 | | |
516 | | /* The struct/union itself has already been printed. */ |
517 | 0 | if (depth == 0) |
518 | 0 | return 0; |
519 | | |
520 | 0 | if (asprintf (&bit, "%s%*s", state->cdm_toplevel_indent, (depth-1)*4, "") < 0) |
521 | 0 | goto oom; |
522 | 0 | *state->cdm_str = str_append (*state->cdm_str, bit); |
523 | 0 | free (bit); |
524 | |
|
525 | 0 | if ((typestr = ctf_dump_format_type (state->cdm_fp, id, |
526 | 0 | CTF_ADD_ROOT | CTF_FT_BITFIELD |
527 | 0 | | CTF_FT_ID)) == NULL) |
528 | 0 | return -1; /* errno is set for us. */ |
529 | | |
530 | 0 | if (asprintf (&bit, "[0x%lx] %s: %s\n", offset, name, typestr) < 0) |
531 | 0 | goto oom; |
532 | | |
533 | 0 | *state->cdm_str = str_append (*state->cdm_str, bit); |
534 | 0 | free (typestr); |
535 | 0 | free (bit); |
536 | 0 | typestr = NULL; |
537 | 0 | bit = NULL; |
538 | |
|
539 | 0 | return 0; |
540 | | |
541 | 0 | oom: |
542 | 0 | free (typestr); |
543 | 0 | free (bit); |
544 | 0 | return (ctf_set_errno (state->cdm_fp, errno)); |
545 | 0 | } |
546 | | |
547 | | /* Report the number of digits in the hexadecimal representation of a type |
548 | | ID. */ |
549 | | |
550 | | static int |
551 | | type_hex_digits (ctf_id_t id) |
552 | 0 | { |
553 | 0 | int i = 0; |
554 | |
|
555 | 0 | if (id == 0) |
556 | 0 | return 1; |
557 | | |
558 | 0 | for (; id > 0; id >>= 4, i++); |
559 | 0 | return i; |
560 | 0 | } |
561 | | |
562 | | /* Dump a single type into the cds_items. */ |
563 | | static int |
564 | | ctf_dump_type (ctf_id_t id, int flag, void *arg) |
565 | 0 | { |
566 | 0 | char *str; |
567 | 0 | char *indent; |
568 | 0 | ctf_dump_state_t *state = arg; |
569 | 0 | ctf_dump_membstate_t membstate = { &str, state->cds_fp, NULL }; |
570 | | |
571 | | /* Indent neatly. */ |
572 | 0 | if (asprintf (&indent, " %*s", type_hex_digits (id), "") < 0) |
573 | 0 | return (ctf_set_errno (state->cds_fp, ENOMEM)); |
574 | | |
575 | | /* Dump the type itself. */ |
576 | 0 | if ((str = ctf_dump_format_type (state->cds_fp, id, |
577 | 0 | flag | CTF_FT_REFS)) == NULL) |
578 | 0 | goto err; |
579 | 0 | str = str_append (str, "\n"); |
580 | |
|
581 | 0 | membstate.cdm_toplevel_indent = indent; |
582 | | |
583 | | /* Member dumping for structs, unions... */ |
584 | 0 | if (ctf_type_kind (state->cds_fp, id) == CTF_K_STRUCT |
585 | 0 | || ctf_type_kind (state->cds_fp, id) == CTF_K_UNION) |
586 | 0 | { |
587 | 0 | if ((ctf_type_visit (state->cds_fp, id, ctf_dump_member, &membstate)) < 0) |
588 | 0 | { |
589 | 0 | if (id == 0 || ctf_errno (state->cds_fp) == ECTF_NONREPRESENTABLE) |
590 | 0 | { |
591 | 0 | ctf_dump_append (state, str); |
592 | 0 | return 0; |
593 | 0 | } |
594 | 0 | ctf_err_warn (state->cds_fp, 1, ctf_errno (state->cds_fp), |
595 | 0 | _("cannot visit members dumping type 0x%lx"), id); |
596 | 0 | goto err; |
597 | 0 | } |
598 | 0 | } |
599 | | |
600 | | /* ... and enums, for which we dump the first and last few members and skip |
601 | | the ones in the middle. */ |
602 | 0 | if (ctf_type_kind (state->cds_fp, id) == CTF_K_ENUM) |
603 | 0 | { |
604 | 0 | int enum_count = ctf_member_count (state->cds_fp, id); |
605 | 0 | ctf_next_t *it = NULL; |
606 | 0 | int i = 0; |
607 | 0 | const char *enumerand; |
608 | 0 | char *bit; |
609 | 0 | int value; |
610 | |
|
611 | 0 | while ((enumerand = ctf_enum_next (state->cds_fp, id, |
612 | 0 | &it, &value)) != NULL) |
613 | 0 | { |
614 | 0 | i++; |
615 | 0 | if ((i > 5) && (i < enum_count - 4)) |
616 | 0 | continue; |
617 | | |
618 | 0 | str = str_append (str, indent); |
619 | |
|
620 | 0 | if (asprintf (&bit, "%s: %i\n", enumerand, value) < 0) |
621 | 0 | { |
622 | 0 | ctf_next_destroy (it); |
623 | 0 | goto oom; |
624 | 0 | } |
625 | 0 | str = str_append (str, bit); |
626 | 0 | free (bit); |
627 | |
|
628 | 0 | if ((i == 5) && (enum_count > 10)) |
629 | 0 | { |
630 | 0 | str = str_append (str, indent); |
631 | 0 | str = str_append (str, "...\n"); |
632 | 0 | } |
633 | 0 | } |
634 | 0 | if (ctf_errno (state->cds_fp) != ECTF_NEXT_END) |
635 | 0 | { |
636 | 0 | ctf_err_warn (state->cds_fp, 1, ctf_errno (state->cds_fp), |
637 | 0 | _("cannot visit enumerands dumping type 0x%lx"), id); |
638 | 0 | goto err; |
639 | 0 | } |
640 | 0 | } |
641 | | |
642 | 0 | ctf_dump_append (state, str); |
643 | 0 | free (indent); |
644 | |
|
645 | 0 | return 0; |
646 | | |
647 | 0 | err: |
648 | 0 | free (indent); |
649 | 0 | free (str); |
650 | | |
651 | | /* Swallow the error: don't cause an error in one type to abort all |
652 | | type dumping. */ |
653 | 0 | return 0; |
654 | | |
655 | 0 | oom: |
656 | 0 | free (indent); |
657 | 0 | free (str); |
658 | 0 | return ctf_set_errno (state->cds_fp, ENOMEM); |
659 | 0 | } |
660 | | |
661 | | /* Dump the string table into the cds_items. */ |
662 | | |
663 | | static int |
664 | | ctf_dump_str (ctf_dict_t *fp, ctf_dump_state_t *state) |
665 | 0 | { |
666 | 0 | const char *s = fp->ctf_str[CTF_STRTAB_0].cts_strs; |
667 | |
|
668 | 0 | for (; s < fp->ctf_str[CTF_STRTAB_0].cts_strs + |
669 | 0 | fp->ctf_str[CTF_STRTAB_0].cts_len;) |
670 | 0 | { |
671 | 0 | char *str; |
672 | 0 | if (asprintf (&str, "0x%lx: %s", |
673 | 0 | (unsigned long) (s - fp->ctf_str[CTF_STRTAB_0].cts_strs), |
674 | 0 | s) < 0) |
675 | 0 | return (ctf_set_errno (fp, errno)); |
676 | 0 | ctf_dump_append (state, str); |
677 | 0 | s += strlen (s) + 1; |
678 | 0 | } |
679 | | |
680 | 0 | return 0; |
681 | 0 | } |
682 | | |
683 | | /* Dump a particular section of a CTF file, in textual form. Call with a |
684 | | pointer to a NULL STATE: each call emits a dynamically allocated string |
685 | | containing a description of one entity in the specified section, in order. |
686 | | Only the first call (with a NULL state) may vary SECT. Once the CTF section |
687 | | has been entirely dumped, the call returns NULL and frees and annuls the |
688 | | STATE, ready for another section to be dumped. The returned textual content |
689 | | may span multiple lines: between each call the FUNC is called with one |
690 | | textual line at a time, and should return a suitably decorated line (it can |
691 | | allocate a new one and return it if it likes). */ |
692 | | |
693 | | char * |
694 | | ctf_dump (ctf_dict_t *fp, ctf_dump_state_t **statep, ctf_sect_names_t sect, |
695 | | ctf_dump_decorate_f *func, void *arg) |
696 | 0 | { |
697 | 0 | char *str; |
698 | 0 | char *line; |
699 | 0 | ctf_dump_state_t *state = NULL; |
700 | |
|
701 | 0 | if (*statep == NULL) |
702 | 0 | { |
703 | | /* Data collection. Transforming a call-at-a-time iterator into a |
704 | | return-at-a-time iterator in a language without call/cc is annoying. It |
705 | | is easiest to simply collect everything at once and then return it bit |
706 | | by bit. The first call will take (much) longer than otherwise, but the |
707 | | amortized time needed is the same. */ |
708 | |
|
709 | 0 | if ((*statep = malloc (sizeof (struct ctf_dump_state))) == NULL) |
710 | 0 | { |
711 | 0 | ctf_set_errno (fp, ENOMEM); |
712 | 0 | goto end; |
713 | 0 | } |
714 | 0 | state = *statep; |
715 | |
|
716 | 0 | memset (state, 0, sizeof (struct ctf_dump_state)); |
717 | 0 | state->cds_fp = fp; |
718 | 0 | state->cds_sect = sect; |
719 | |
|
720 | 0 | switch (sect) |
721 | 0 | { |
722 | 0 | case CTF_SECT_HEADER: |
723 | 0 | ctf_dump_header (fp, state); |
724 | 0 | break; |
725 | 0 | case CTF_SECT_LABEL: |
726 | 0 | if (ctf_label_iter (fp, ctf_dump_label, state) < 0) |
727 | 0 | { |
728 | 0 | if (ctf_errno (fp) != ECTF_NOLABELDATA) |
729 | 0 | goto end; /* errno is set for us. */ |
730 | 0 | ctf_set_errno (fp, 0); |
731 | 0 | } |
732 | 0 | break; |
733 | 0 | case CTF_SECT_OBJT: |
734 | 0 | if (ctf_dump_objts (fp, state, 0) < 0) |
735 | 0 | goto end; /* errno is set for us. */ |
736 | 0 | break; |
737 | 0 | case CTF_SECT_FUNC: |
738 | 0 | if (ctf_dump_objts (fp, state, 1) < 0) |
739 | 0 | goto end; /* errno is set for us. */ |
740 | 0 | break; |
741 | 0 | case CTF_SECT_VAR: |
742 | 0 | if (ctf_variable_iter (fp, ctf_dump_var, state) < 0) |
743 | 0 | goto end; /* errno is set for us. */ |
744 | 0 | break; |
745 | 0 | case CTF_SECT_TYPE: |
746 | 0 | if (ctf_type_iter_all (fp, ctf_dump_type, state) < 0) |
747 | 0 | goto end; /* errno is set for us. */ |
748 | 0 | break; |
749 | 0 | case CTF_SECT_STR: |
750 | 0 | ctf_dump_str (fp, state); |
751 | 0 | break; |
752 | 0 | default: |
753 | 0 | ctf_set_errno (fp, ECTF_DUMPSECTUNKNOWN); |
754 | 0 | goto end; |
755 | 0 | } |
756 | 0 | } |
757 | 0 | else |
758 | 0 | { |
759 | 0 | state = *statep; |
760 | |
|
761 | 0 | if (state->cds_sect != sect) |
762 | 0 | { |
763 | 0 | ctf_set_errno (fp, ECTF_DUMPSECTCHANGED); |
764 | 0 | goto end; |
765 | 0 | } |
766 | 0 | } |
767 | | |
768 | 0 | if (state->cds_current == NULL) |
769 | 0 | state->cds_current = ctf_list_next (&state->cds_items); |
770 | 0 | else |
771 | 0 | state->cds_current = ctf_list_next (state->cds_current); |
772 | |
|
773 | 0 | if (state->cds_current == NULL) |
774 | 0 | goto end; |
775 | | |
776 | | /* Hookery. There is some extra complexity to preserve linefeeds within each |
777 | | item while removing linefeeds at the end. */ |
778 | 0 | if (func) |
779 | 0 | { |
780 | 0 | size_t len; |
781 | |
|
782 | 0 | str = NULL; |
783 | 0 | for (line = state->cds_current->cdi_item; line && *line; ) |
784 | 0 | { |
785 | 0 | char *nline = line; |
786 | 0 | char *ret; |
787 | |
|
788 | 0 | nline = strchr (line, '\n'); |
789 | 0 | if (nline) |
790 | 0 | nline[0] = '\0'; |
791 | |
|
792 | 0 | ret = func (sect, line, arg); |
793 | 0 | str = str_append (str, ret); |
794 | 0 | str = str_append (str, "\n"); |
795 | 0 | if (ret != line) |
796 | 0 | free (ret); |
797 | |
|
798 | 0 | if (nline) |
799 | 0 | { |
800 | 0 | nline[0] = '\n'; |
801 | 0 | nline++; |
802 | 0 | } |
803 | |
|
804 | 0 | line = nline; |
805 | 0 | } |
806 | |
|
807 | 0 | len = strlen (str); |
808 | |
|
809 | 0 | if (str[len-1] == '\n') |
810 | 0 | str[len-1] = '\0'; |
811 | 0 | } |
812 | 0 | else |
813 | 0 | { |
814 | 0 | str = strdup (state->cds_current->cdi_item); |
815 | 0 | if (!str) |
816 | 0 | { |
817 | 0 | ctf_set_errno (fp, ENOMEM); |
818 | 0 | return NULL; |
819 | 0 | } |
820 | 0 | } |
821 | | |
822 | 0 | ctf_set_errno (fp, 0); |
823 | 0 | return str; |
824 | | |
825 | 0 | end: |
826 | 0 | ctf_dump_free (state); |
827 | 0 | free (state); |
828 | 0 | ctf_set_errno (fp, 0); |
829 | 0 | *statep = NULL; |
830 | 0 | return NULL; |
831 | 0 | } |