2 Copyright (C) 2019-2020 Free Software Foundation, Inc.
4 This file is part of libctf.
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
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.
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/>. */
21 #include <sys/param.h>
28 #define roundup(x, y) ((((x) + ((y) - 1)) / (y)) * (y))
31 /* Make sure the ptrtab has enough space for at least one more type.
33 We start with 4KiB of ptrtab, enough for a thousand types, then grow it 25%
37 ctf_grow_ptrtab (ctf_file_t
*fp
)
39 size_t new_ptrtab_len
= fp
->ctf_ptrtab_len
;
41 /* We allocate one more ptrtab entry than we need, for the initial zero,
42 plus one because the caller will probably allocate a new type. */
44 if (fp
->ctf_ptrtab
== NULL
)
45 new_ptrtab_len
= 1024;
46 else if ((fp
->ctf_typemax
+ 2) > fp
->ctf_ptrtab_len
)
47 new_ptrtab_len
= fp
->ctf_ptrtab_len
* 1.25;
49 if (new_ptrtab_len
!= fp
->ctf_ptrtab_len
)
53 if ((new_ptrtab
= realloc (fp
->ctf_ptrtab
,
54 new_ptrtab_len
* sizeof (uint32_t))) == NULL
)
55 return (ctf_set_errno (fp
, ENOMEM
));
57 fp
->ctf_ptrtab
= new_ptrtab
;
58 memset (fp
->ctf_ptrtab
+ fp
->ctf_ptrtab_len
, 0,
59 (new_ptrtab_len
- fp
->ctf_ptrtab_len
) * sizeof (uint32_t));
60 fp
->ctf_ptrtab_len
= new_ptrtab_len
;
65 /* To create an empty CTF container, we just declare a zeroed header and call
66 ctf_bufopen() on it. If ctf_bufopen succeeds, we mark the new container r/w
67 and initialize the dynamic members. We start assigning type IDs at 1 because
68 type ID 0 is used as a sentinel and a not-found indicator. */
71 ctf_create (int *errp
)
73 static const ctf_header_t hdr
= { .cth_preamble
= { CTF_MAGIC
, CTF_VERSION
, 0 } };
75 ctf_dynhash_t
*dthash
;
76 ctf_dynhash_t
*dvhash
;
77 ctf_dynhash_t
*structs
= NULL
, *unions
= NULL
, *enums
= NULL
, *names
= NULL
;
82 dthash
= ctf_dynhash_create (ctf_hash_integer
, ctf_hash_eq_integer
,
86 ctf_set_open_errno (errp
, EAGAIN
);
90 dvhash
= ctf_dynhash_create (ctf_hash_string
, ctf_hash_eq_string
,
94 ctf_set_open_errno (errp
, EAGAIN
);
98 structs
= ctf_dynhash_create (ctf_hash_string
, ctf_hash_eq_string
,
100 unions
= ctf_dynhash_create (ctf_hash_string
, ctf_hash_eq_string
,
102 enums
= ctf_dynhash_create (ctf_hash_string
, ctf_hash_eq_string
,
104 names
= ctf_dynhash_create (ctf_hash_string
, ctf_hash_eq_string
,
106 if (!structs
|| !unions
|| !enums
|| !names
)
108 ctf_set_open_errno (errp
, EAGAIN
);
112 cts
.cts_name
= _CTF_SECTION
;
114 cts
.cts_size
= sizeof (hdr
);
117 if ((fp
= ctf_bufopen_internal (&cts
, NULL
, NULL
, NULL
, 1, errp
)) == NULL
)
120 fp
->ctf_structs
.ctn_writable
= structs
;
121 fp
->ctf_unions
.ctn_writable
= unions
;
122 fp
->ctf_enums
.ctn_writable
= enums
;
123 fp
->ctf_names
.ctn_writable
= names
;
124 fp
->ctf_dthash
= dthash
;
125 fp
->ctf_dvhash
= dvhash
;
127 fp
->ctf_snapshots
= 1;
128 fp
->ctf_snapshot_lu
= 0;
130 ctf_set_ctl_hashes (fp
);
131 ctf_setmodel (fp
, CTF_MODEL_NATIVE
);
132 if (ctf_grow_ptrtab (fp
) < 0)
134 ctf_set_open_errno (errp
, ctf_errno (fp
));
142 ctf_dynhash_destroy (structs
);
143 ctf_dynhash_destroy (unions
);
144 ctf_dynhash_destroy (enums
);
145 ctf_dynhash_destroy (names
);
146 ctf_dynhash_destroy (dvhash
);
148 ctf_dynhash_destroy (dthash
);
153 static unsigned char *
154 ctf_copy_smembers (ctf_file_t
*fp
, ctf_dtdef_t
*dtd
, unsigned char *t
)
156 ctf_dmdef_t
*dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
159 for (; dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
161 ctf_member_t
*copied
;
164 ctm
.ctm_type
= (uint32_t) dmd
->dmd_type
;
165 ctm
.ctm_offset
= (uint32_t) dmd
->dmd_offset
;
167 memcpy (t
, &ctm
, sizeof (ctm
));
168 copied
= (ctf_member_t
*) t
;
170 ctf_str_add_ref (fp
, dmd
->dmd_name
, &copied
->ctm_name
);
178 static unsigned char *
179 ctf_copy_lmembers (ctf_file_t
*fp
, ctf_dtdef_t
*dtd
, unsigned char *t
)
181 ctf_dmdef_t
*dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
184 for (; dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
186 ctf_lmember_t
*copied
;
189 ctlm
.ctlm_type
= (uint32_t) dmd
->dmd_type
;
190 ctlm
.ctlm_offsethi
= CTF_OFFSET_TO_LMEMHI (dmd
->dmd_offset
);
191 ctlm
.ctlm_offsetlo
= CTF_OFFSET_TO_LMEMLO (dmd
->dmd_offset
);
193 memcpy (t
, &ctlm
, sizeof (ctlm
));
194 copied
= (ctf_lmember_t
*) t
;
196 ctf_str_add_ref (fp
, dmd
->dmd_name
, &copied
->ctlm_name
);
204 static unsigned char *
205 ctf_copy_emembers (ctf_file_t
*fp
, ctf_dtdef_t
*dtd
, unsigned char *t
)
207 ctf_dmdef_t
*dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
210 for (; dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
214 cte
.cte_value
= dmd
->dmd_value
;
215 memcpy (t
, &cte
, sizeof (cte
));
216 copied
= (ctf_enum_t
*) t
;
217 ctf_str_add_ref (fp
, dmd
->dmd_name
, &copied
->cte_name
);
224 /* Sort a newly-constructed static variable array. */
226 typedef struct ctf_sort_var_arg_cb
230 } ctf_sort_var_arg_cb_t
;
233 ctf_sort_var (const void *one_
, const void *two_
, void *arg_
)
235 const ctf_varent_t
*one
= one_
;
236 const ctf_varent_t
*two
= two_
;
237 ctf_sort_var_arg_cb_t
*arg
= arg_
;
239 return (strcmp (ctf_strraw_explicit (arg
->fp
, one
->ctv_name
, arg
->strtab
),
240 ctf_strraw_explicit (arg
->fp
, two
->ctv_name
, arg
->strtab
)));
243 /* Compatibility: just update the threshold for ctf_discard. */
245 ctf_update (ctf_file_t
*fp
)
247 if (!(fp
->ctf_flags
& LCTF_RDWR
))
248 return (ctf_set_errno (fp
, ECTF_RDONLY
));
250 fp
->ctf_dtoldid
= fp
->ctf_typemax
;
254 /* If the specified CTF container is writable and has been modified, reload this
255 container with the updated type definitions, ready for serialization. In
256 order to make this code and the rest of libctf as simple as possible, we
257 perform updates by taking the dynamic type definitions and creating an
258 in-memory CTF file containing the definitions, and then call
259 ctf_simple_open_internal() on it. We perform one extra trick here for the
260 benefit of callers and to keep our code simple: ctf_simple_open_internal()
261 will return a new ctf_file_t, but we want to keep the fp constant for the
262 caller, so after ctf_simple_open_internal() returns, we use memcpy to swap
263 the interior of the old and new ctf_file_t's, and then free the old. */
265 ctf_serialize (ctf_file_t
*fp
)
267 ctf_file_t ofp
, *nfp
;
268 ctf_header_t hdr
, *hdrp
;
271 ctf_varent_t
*dvarents
;
272 ctf_strs_writable_t strtab
;
276 size_t buf_size
, type_size
, nvars
;
277 unsigned char *buf
, *newbuf
;
280 if (!(fp
->ctf_flags
& LCTF_RDWR
))
281 return (ctf_set_errno (fp
, ECTF_RDONLY
));
283 /* Update required? */
284 if (!(fp
->ctf_flags
& LCTF_DIRTY
))
287 /* Fill in an initial CTF header. We will leave the label, object,
288 and function sections empty and only output a header, type section,
289 and string table. The type section begins at a 4-byte aligned
290 boundary past the CTF header itself (at relative offset zero). */
292 memset (&hdr
, 0, sizeof (hdr
));
293 hdr
.cth_magic
= CTF_MAGIC
;
294 hdr
.cth_version
= CTF_VERSION
;
296 /* Iterate through the dynamic type definition list and compute the
297 size of the CTF type section we will need to generate. */
299 for (type_size
= 0, dtd
= ctf_list_next (&fp
->ctf_dtdefs
);
300 dtd
!= NULL
; dtd
= ctf_list_next (dtd
))
302 uint32_t kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
303 uint32_t vlen
= LCTF_INFO_VLEN (fp
, dtd
->dtd_data
.ctt_info
);
305 if (dtd
->dtd_data
.ctt_size
!= CTF_LSIZE_SENT
)
306 type_size
+= sizeof (ctf_stype_t
);
308 type_size
+= sizeof (ctf_type_t
);
314 type_size
+= sizeof (uint32_t);
317 type_size
+= sizeof (ctf_array_t
);
320 type_size
+= sizeof (ctf_slice_t
);
323 type_size
+= sizeof (uint32_t) * (vlen
+ (vlen
& 1));
327 if (dtd
->dtd_data
.ctt_size
< CTF_LSTRUCT_THRESH
)
328 type_size
+= sizeof (ctf_member_t
) * vlen
;
330 type_size
+= sizeof (ctf_lmember_t
) * vlen
;
333 type_size
+= sizeof (ctf_enum_t
) * vlen
;
338 /* Computing the number of entries in the CTF variable section is much
341 for (nvars
= 0, dvd
= ctf_list_next (&fp
->ctf_dvdefs
);
342 dvd
!= NULL
; dvd
= ctf_list_next (dvd
), nvars
++);
344 /* Compute the size of the CTF buffer we need, sans only the string table,
345 then allocate a new buffer and memcpy the finished header to the start of
346 the buffer. (We will adjust this later with strtab length info.) */
348 hdr
.cth_typeoff
= hdr
.cth_varoff
+ (nvars
* sizeof (ctf_varent_t
));
349 hdr
.cth_stroff
= hdr
.cth_typeoff
+ type_size
;
352 buf_size
= sizeof (ctf_header_t
) + hdr
.cth_stroff
+ hdr
.cth_strlen
;
354 if ((buf
= malloc (buf_size
)) == NULL
)
355 return (ctf_set_errno (fp
, EAGAIN
));
357 memcpy (buf
, &hdr
, sizeof (ctf_header_t
));
358 t
= (unsigned char *) buf
+ sizeof (ctf_header_t
) + hdr
.cth_varoff
;
360 hdrp
= (ctf_header_t
*) buf
;
361 if ((fp
->ctf_flags
& LCTF_CHILD
) && (fp
->ctf_parname
!= NULL
))
362 ctf_str_add_ref (fp
, fp
->ctf_parname
, &hdrp
->cth_parname
);
363 if (fp
->ctf_cuname
!= NULL
)
364 ctf_str_add_ref (fp
, fp
->ctf_cuname
, &hdrp
->cth_cuname
);
366 /* Work over the variable list, translating everything into ctf_varent_t's and
367 prepping the string table. */
369 dvarents
= (ctf_varent_t
*) t
;
370 for (i
= 0, dvd
= ctf_list_next (&fp
->ctf_dvdefs
); dvd
!= NULL
;
371 dvd
= ctf_list_next (dvd
), i
++)
373 ctf_varent_t
*var
= &dvarents
[i
];
375 ctf_str_add_ref (fp
, dvd
->dvd_name
, &var
->ctv_name
);
376 var
->ctv_type
= dvd
->dvd_type
;
380 t
+= sizeof (ctf_varent_t
) * nvars
;
382 assert (t
== (unsigned char *) buf
+ sizeof (ctf_header_t
) + hdr
.cth_typeoff
);
384 /* We now take a final lap through the dynamic type definition list and copy
385 the appropriate type records to the output buffer, noting down the
388 for (dtd
= ctf_list_next (&fp
->ctf_dtdefs
);
389 dtd
!= NULL
; dtd
= ctf_list_next (dtd
))
391 uint32_t kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
392 uint32_t vlen
= LCTF_INFO_VLEN (fp
, dtd
->dtd_data
.ctt_info
);
400 if (dtd
->dtd_data
.ctt_size
!= CTF_LSIZE_SENT
)
401 len
= sizeof (ctf_stype_t
);
403 len
= sizeof (ctf_type_t
);
405 memcpy (t
, &dtd
->dtd_data
, len
);
406 copied
= (ctf_stype_t
*) t
; /* name is at the start: constant offset. */
408 && (name
= ctf_strraw (fp
, copied
->ctt_name
)) != NULL
)
409 ctf_str_add_ref (fp
, name
, &copied
->ctt_name
);
416 if (kind
== CTF_K_INTEGER
)
418 encoding
= CTF_INT_DATA (dtd
->dtd_u
.dtu_enc
.cte_format
,
419 dtd
->dtd_u
.dtu_enc
.cte_offset
,
420 dtd
->dtd_u
.dtu_enc
.cte_bits
);
424 encoding
= CTF_FP_DATA (dtd
->dtd_u
.dtu_enc
.cte_format
,
425 dtd
->dtd_u
.dtu_enc
.cte_offset
,
426 dtd
->dtd_u
.dtu_enc
.cte_bits
);
428 memcpy (t
, &encoding
, sizeof (encoding
));
429 t
+= sizeof (encoding
);
433 memcpy (t
, &dtd
->dtd_u
.dtu_slice
, sizeof (struct ctf_slice
));
434 t
+= sizeof (struct ctf_slice
);
438 cta
.cta_contents
= (uint32_t) dtd
->dtd_u
.dtu_arr
.ctr_contents
;
439 cta
.cta_index
= (uint32_t) dtd
->dtd_u
.dtu_arr
.ctr_index
;
440 cta
.cta_nelems
= dtd
->dtd_u
.dtu_arr
.ctr_nelems
;
441 memcpy (t
, &cta
, sizeof (cta
));
447 uint32_t *argv
= (uint32_t *) (uintptr_t) t
;
450 for (argc
= 0; argc
< vlen
; argc
++)
451 *argv
++ = (uint32_t) dtd
->dtd_u
.dtu_argv
[argc
];
454 *argv
++ = 0; /* Pad to 4-byte boundary. */
456 t
= (unsigned char *) argv
;
462 if (dtd
->dtd_data
.ctt_size
< CTF_LSTRUCT_THRESH
)
463 t
= ctf_copy_smembers (fp
, dtd
, t
);
465 t
= ctf_copy_lmembers (fp
, dtd
, t
);
469 t
= ctf_copy_emembers (fp
, dtd
, t
);
473 assert (t
== (unsigned char *) buf
+ sizeof (ctf_header_t
) + hdr
.cth_stroff
);
475 /* Construct the final string table and fill out all the string refs with the
476 final offsets. Then purge the refs list, because we're about to move this
477 strtab onto the end of the buf, invalidating all the offsets. */
478 strtab
= ctf_str_write_strtab (fp
);
479 ctf_str_purge_refs (fp
);
481 if (strtab
.cts_strs
== NULL
)
484 return (ctf_set_errno (fp
, EAGAIN
));
487 /* Now the string table is constructed, we can sort the buffer of
489 ctf_sort_var_arg_cb_t sort_var_arg
= { fp
, (ctf_strs_t
*) &strtab
};
490 ctf_qsort_r (dvarents
, nvars
, sizeof (ctf_varent_t
), ctf_sort_var
,
493 if ((newbuf
= ctf_realloc (fp
, buf
, buf_size
+ strtab
.cts_len
)) == NULL
)
496 free (strtab
.cts_strs
);
497 return (ctf_set_errno (fp
, EAGAIN
));
500 memcpy (buf
+ buf_size
, strtab
.cts_strs
, strtab
.cts_len
);
501 hdrp
= (ctf_header_t
*) buf
;
502 hdrp
->cth_strlen
= strtab
.cts_len
;
503 buf_size
+= hdrp
->cth_strlen
;
504 free (strtab
.cts_strs
);
506 /* Finally, we are ready to ctf_simple_open() the new container. If this
507 is successful, we then switch nfp and fp and free the old container. */
509 if ((nfp
= ctf_simple_open_internal ((char *) buf
, buf_size
, NULL
, 0,
510 0, NULL
, 0, fp
->ctf_syn_ext_strtab
,
514 return (ctf_set_errno (fp
, err
));
517 (void) ctf_setmodel (nfp
, ctf_getmodel (fp
));
518 (void) ctf_import (nfp
, fp
->ctf_parent
);
520 nfp
->ctf_refcnt
= fp
->ctf_refcnt
;
521 nfp
->ctf_flags
|= fp
->ctf_flags
& ~LCTF_DIRTY
;
522 if (nfp
->ctf_dynbase
== NULL
)
523 nfp
->ctf_dynbase
= buf
; /* Make sure buf is freed on close. */
524 nfp
->ctf_dthash
= fp
->ctf_dthash
;
525 nfp
->ctf_dtdefs
= fp
->ctf_dtdefs
;
526 nfp
->ctf_dvhash
= fp
->ctf_dvhash
;
527 nfp
->ctf_dvdefs
= fp
->ctf_dvdefs
;
528 nfp
->ctf_dtoldid
= fp
->ctf_dtoldid
;
529 nfp
->ctf_add_processing
= fp
->ctf_add_processing
;
530 nfp
->ctf_snapshots
= fp
->ctf_snapshots
+ 1;
531 nfp
->ctf_specific
= fp
->ctf_specific
;
532 nfp
->ctf_ptrtab
= fp
->ctf_ptrtab
;
533 nfp
->ctf_ptrtab_len
= fp
->ctf_ptrtab_len
;
534 nfp
->ctf_link_inputs
= fp
->ctf_link_inputs
;
535 nfp
->ctf_link_outputs
= fp
->ctf_link_outputs
;
536 nfp
->ctf_str_prov_offset
= fp
->ctf_str_prov_offset
;
537 nfp
->ctf_syn_ext_strtab
= fp
->ctf_syn_ext_strtab
;
538 nfp
->ctf_link_cu_mapping
= fp
->ctf_link_cu_mapping
;
539 nfp
->ctf_link_type_mapping
= fp
->ctf_link_type_mapping
;
540 nfp
->ctf_link_memb_name_changer
= fp
->ctf_link_memb_name_changer
;
541 nfp
->ctf_link_memb_name_changer_arg
= fp
->ctf_link_memb_name_changer_arg
;
543 nfp
->ctf_snapshot_lu
= fp
->ctf_snapshots
;
545 memcpy (&nfp
->ctf_lookups
, fp
->ctf_lookups
, sizeof (fp
->ctf_lookups
));
546 nfp
->ctf_structs
= fp
->ctf_structs
;
547 nfp
->ctf_unions
= fp
->ctf_unions
;
548 nfp
->ctf_enums
= fp
->ctf_enums
;
549 nfp
->ctf_names
= fp
->ctf_names
;
551 fp
->ctf_dthash
= NULL
;
552 ctf_str_free_atoms (nfp
);
553 nfp
->ctf_str_atoms
= fp
->ctf_str_atoms
;
554 nfp
->ctf_prov_strtab
= fp
->ctf_prov_strtab
;
555 fp
->ctf_str_atoms
= NULL
;
556 fp
->ctf_prov_strtab
= NULL
;
557 memset (&fp
->ctf_dtdefs
, 0, sizeof (ctf_list_t
));
558 fp
->ctf_add_processing
= NULL
;
559 fp
->ctf_ptrtab
= NULL
;
560 fp
->ctf_link_inputs
= NULL
;
561 fp
->ctf_link_outputs
= NULL
;
562 fp
->ctf_syn_ext_strtab
= NULL
;
563 fp
->ctf_link_cu_mapping
= NULL
;
564 fp
->ctf_link_type_mapping
= NULL
;
566 fp
->ctf_dvhash
= NULL
;
567 memset (&fp
->ctf_dvdefs
, 0, sizeof (ctf_list_t
));
568 memset (fp
->ctf_lookups
, 0, sizeof (fp
->ctf_lookups
));
569 fp
->ctf_structs
.ctn_writable
= NULL
;
570 fp
->ctf_unions
.ctn_writable
= NULL
;
571 fp
->ctf_enums
.ctn_writable
= NULL
;
572 fp
->ctf_names
.ctn_writable
= NULL
;
574 memcpy (&ofp
, fp
, sizeof (ctf_file_t
));
575 memcpy (fp
, nfp
, sizeof (ctf_file_t
));
576 memcpy (nfp
, &ofp
, sizeof (ctf_file_t
));
578 nfp
->ctf_refcnt
= 1; /* Force nfp to be freed. */
579 ctf_file_close (nfp
);
585 ctf_name_table (ctf_file_t
*fp
, int kind
)
590 return &fp
->ctf_structs
;
592 return &fp
->ctf_unions
;
594 return &fp
->ctf_enums
;
596 return &fp
->ctf_names
;
601 ctf_dtd_insert (ctf_file_t
*fp
, ctf_dtdef_t
*dtd
, int flag
, int kind
)
604 if (ctf_dynhash_insert (fp
->ctf_dthash
, (void *) dtd
->dtd_type
, dtd
) < 0)
607 if (flag
== CTF_ADD_ROOT
&& dtd
->dtd_data
.ctt_name
608 && (name
= ctf_strraw (fp
, dtd
->dtd_data
.ctt_name
)) != NULL
)
610 if (ctf_dynhash_insert (ctf_name_table (fp
, kind
)->ctn_writable
,
611 (char *) name
, (void *) dtd
->dtd_type
) < 0)
613 ctf_dynhash_remove (fp
->ctf_dthash
, (void *) dtd
->dtd_type
);
617 ctf_list_append (&fp
->ctf_dtdefs
, dtd
);
622 ctf_dtd_delete (ctf_file_t
*fp
, ctf_dtdef_t
*dtd
)
624 ctf_dmdef_t
*dmd
, *nmd
;
625 int kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
626 int name_kind
= kind
;
629 ctf_dynhash_remove (fp
->ctf_dthash
, (void *) dtd
->dtd_type
);
636 for (dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
637 dmd
!= NULL
; dmd
= nmd
)
639 if (dmd
->dmd_name
!= NULL
)
640 free (dmd
->dmd_name
);
641 nmd
= ctf_list_next (dmd
);
646 free (dtd
->dtd_u
.dtu_argv
);
649 name_kind
= dtd
->dtd_data
.ctt_type
;
653 if (dtd
->dtd_data
.ctt_name
654 && (name
= ctf_strraw (fp
, dtd
->dtd_data
.ctt_name
)) != NULL
655 && LCTF_INFO_ISROOT (fp
, dtd
->dtd_data
.ctt_info
))
657 ctf_dynhash_remove (ctf_name_table (fp
, name_kind
)->ctn_writable
,
659 ctf_str_remove_ref (fp
, name
, &dtd
->dtd_data
.ctt_name
);
662 ctf_list_delete (&fp
->ctf_dtdefs
, dtd
);
667 ctf_dtd_lookup (const ctf_file_t
*fp
, ctf_id_t type
)
669 return (ctf_dtdef_t
*) ctf_dynhash_lookup (fp
->ctf_dthash
, (void *) type
);
673 ctf_dynamic_type (const ctf_file_t
*fp
, ctf_id_t id
)
677 if (!(fp
->ctf_flags
& LCTF_RDWR
))
680 if ((fp
->ctf_flags
& LCTF_CHILD
) && LCTF_TYPE_ISPARENT (fp
, id
))
683 idx
= LCTF_TYPE_TO_INDEX(fp
, id
);
685 if ((unsigned long) idx
<= fp
->ctf_typemax
)
686 return ctf_dtd_lookup (fp
, id
);
691 ctf_dvd_insert (ctf_file_t
*fp
, ctf_dvdef_t
*dvd
)
693 if (ctf_dynhash_insert (fp
->ctf_dvhash
, dvd
->dvd_name
, dvd
) < 0)
695 ctf_list_append (&fp
->ctf_dvdefs
, dvd
);
700 ctf_dvd_delete (ctf_file_t
*fp
, ctf_dvdef_t
*dvd
)
702 ctf_dynhash_remove (fp
->ctf_dvhash
, dvd
->dvd_name
);
703 free (dvd
->dvd_name
);
705 ctf_list_delete (&fp
->ctf_dvdefs
, dvd
);
710 ctf_dvd_lookup (const ctf_file_t
*fp
, const char *name
)
712 return (ctf_dvdef_t
*) ctf_dynhash_lookup (fp
->ctf_dvhash
, name
);
715 /* Discard all of the dynamic type definitions and variable definitions that
716 have been added to the container since the last call to ctf_update(). We
717 locate such types by scanning the dtd list and deleting elements that have
718 type IDs greater than ctf_dtoldid, which is set by ctf_update(), above, and
719 by scanning the variable list and deleting elements that have update IDs
720 equal to the current value of the last-update snapshot count (indicating that
721 they were added after the most recent call to ctf_update()). */
723 ctf_discard (ctf_file_t
*fp
)
725 ctf_snapshot_id_t last_update
=
727 fp
->ctf_snapshot_lu
+ 1 };
729 /* Update required? */
730 if (!(fp
->ctf_flags
& LCTF_DIRTY
))
733 return (ctf_rollback (fp
, last_update
));
737 ctf_snapshot (ctf_file_t
*fp
)
739 ctf_snapshot_id_t snapid
;
740 snapid
.dtd_id
= fp
->ctf_typemax
;
741 snapid
.snapshot_id
= fp
->ctf_snapshots
++;
745 /* Like ctf_discard(), only discards everything after a particular ID. */
747 ctf_rollback (ctf_file_t
*fp
, ctf_snapshot_id_t id
)
749 ctf_dtdef_t
*dtd
, *ntd
;
750 ctf_dvdef_t
*dvd
, *nvd
;
752 if (!(fp
->ctf_flags
& LCTF_RDWR
))
753 return (ctf_set_errno (fp
, ECTF_RDONLY
));
755 if (fp
->ctf_snapshot_lu
>= id
.snapshot_id
)
756 return (ctf_set_errno (fp
, ECTF_OVERROLLBACK
));
758 for (dtd
= ctf_list_next (&fp
->ctf_dtdefs
); dtd
!= NULL
; dtd
= ntd
)
763 ntd
= ctf_list_next (dtd
);
765 if (LCTF_TYPE_TO_INDEX (fp
, dtd
->dtd_type
) <= id
.dtd_id
)
768 kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
769 if (kind
== CTF_K_FORWARD
)
770 kind
= dtd
->dtd_data
.ctt_type
;
772 if (dtd
->dtd_data
.ctt_name
773 && (name
= ctf_strraw (fp
, dtd
->dtd_data
.ctt_name
)) != NULL
774 && LCTF_INFO_ISROOT (fp
, dtd
->dtd_data
.ctt_info
))
776 ctf_dynhash_remove (ctf_name_table (fp
, kind
)->ctn_writable
,
778 ctf_str_remove_ref (fp
, name
, &dtd
->dtd_data
.ctt_name
);
781 ctf_dynhash_remove (fp
->ctf_dthash
, (void *) dtd
->dtd_type
);
782 ctf_dtd_delete (fp
, dtd
);
785 for (dvd
= ctf_list_next (&fp
->ctf_dvdefs
); dvd
!= NULL
; dvd
= nvd
)
787 nvd
= ctf_list_next (dvd
);
789 if (dvd
->dvd_snapshots
<= id
.snapshot_id
)
792 ctf_dvd_delete (fp
, dvd
);
795 fp
->ctf_typemax
= id
.dtd_id
;
796 fp
->ctf_snapshots
= id
.snapshot_id
;
798 if (fp
->ctf_snapshots
== fp
->ctf_snapshot_lu
)
799 fp
->ctf_flags
&= ~LCTF_DIRTY
;
805 ctf_add_generic (ctf_file_t
*fp
, uint32_t flag
, const char *name
, int kind
,
811 if (flag
!= CTF_ADD_NONROOT
&& flag
!= CTF_ADD_ROOT
)
812 return (ctf_set_errno (fp
, EINVAL
));
814 if (!(fp
->ctf_flags
& LCTF_RDWR
))
815 return (ctf_set_errno (fp
, ECTF_RDONLY
));
817 if (LCTF_INDEX_TO_TYPE (fp
, fp
->ctf_typemax
, 1) >= CTF_MAX_TYPE
)
818 return (ctf_set_errno (fp
, ECTF_FULL
));
820 if (LCTF_INDEX_TO_TYPE (fp
, fp
->ctf_typemax
, 1) == (CTF_MAX_PTYPE
- 1))
821 return (ctf_set_errno (fp
, ECTF_FULL
));
823 /* Make sure ptrtab always grows to be big enough for all types. */
824 if (ctf_grow_ptrtab (fp
) < 0)
825 return CTF_ERR
; /* errno is set for us. */
827 if ((dtd
= malloc (sizeof (ctf_dtdef_t
))) == NULL
)
828 return (ctf_set_errno (fp
, EAGAIN
));
830 type
= ++fp
->ctf_typemax
;
831 type
= LCTF_INDEX_TO_TYPE (fp
, type
, (fp
->ctf_flags
& LCTF_CHILD
));
833 memset (dtd
, 0, sizeof (ctf_dtdef_t
));
834 dtd
->dtd_data
.ctt_name
= ctf_str_add_ref (fp
, name
, &dtd
->dtd_data
.ctt_name
);
835 dtd
->dtd_type
= type
;
837 if (dtd
->dtd_data
.ctt_name
== 0 && name
!= NULL
&& name
[0] != '\0')
840 return (ctf_set_errno (fp
, EAGAIN
));
843 if (ctf_dtd_insert (fp
, dtd
, flag
, kind
) < 0)
846 return CTF_ERR
; /* errno is set for us. */
848 fp
->ctf_flags
|= LCTF_DIRTY
;
854 /* When encoding integer sizes, we want to convert a byte count in the range
855 1-8 to the closest power of 2 (e.g. 3->4, 5->8, etc). The clp2() function
856 is a clever implementation from "Hacker's Delight" by Henry Warren, Jr. */
872 ctf_add_encoded (ctf_file_t
*fp
, uint32_t flag
,
873 const char *name
, const ctf_encoding_t
*ep
, uint32_t kind
)
879 return (ctf_set_errno (fp
, EINVAL
));
881 if ((type
= ctf_add_generic (fp
, flag
, name
, kind
, &dtd
)) == CTF_ERR
)
882 return CTF_ERR
; /* errno is set for us. */
884 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (kind
, flag
, 0);
885 dtd
->dtd_data
.ctt_size
= clp2 (P2ROUNDUP (ep
->cte_bits
, CHAR_BIT
)
887 dtd
->dtd_u
.dtu_enc
= *ep
;
893 ctf_add_reftype (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
, uint32_t kind
)
897 ctf_file_t
*tmp
= fp
;
898 int child
= fp
->ctf_flags
& LCTF_CHILD
;
900 if (ref
== CTF_ERR
|| ref
> CTF_MAX_TYPE
)
901 return (ctf_set_errno (fp
, EINVAL
));
903 if (ctf_lookup_by_id (&tmp
, ref
) == NULL
)
904 return CTF_ERR
; /* errno is set for us. */
906 if ((type
= ctf_add_generic (fp
, flag
, NULL
, kind
, &dtd
)) == CTF_ERR
)
907 return CTF_ERR
; /* errno is set for us. */
909 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (kind
, flag
, 0);
910 dtd
->dtd_data
.ctt_type
= (uint32_t) ref
;
912 if (kind
!= CTF_K_POINTER
)
915 /* If we are adding a pointer, update the ptrtab, both the directly pointed-to
916 type and (if an anonymous typedef node is being pointed at) the type that
917 points at too. Note that ctf_typemax is at this point one higher than we
918 want to check against, because it's just been incremented for the addition
921 uint32_t type_idx
= LCTF_TYPE_TO_INDEX (fp
, type
);
922 uint32_t ref_idx
= LCTF_TYPE_TO_INDEX (fp
, ref
);
924 if (LCTF_TYPE_ISCHILD (fp
, ref
) == child
925 && ref_idx
< fp
->ctf_typemax
)
927 fp
->ctf_ptrtab
[ref_idx
] = type_idx
;
929 ctf_id_t refref_idx
= LCTF_TYPE_TO_INDEX (fp
, dtd
->dtd_data
.ctt_type
);
932 && (LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
) == CTF_K_TYPEDEF
)
933 && strcmp (ctf_strptr (fp
, dtd
->dtd_data
.ctt_name
), "") == 0
934 && refref_idx
< fp
->ctf_typemax
)
935 fp
->ctf_ptrtab
[refref_idx
] = type_idx
;
942 ctf_add_slice (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
,
943 const ctf_encoding_t
*ep
)
948 const ctf_type_t
*tp
;
949 ctf_file_t
*tmp
= fp
;
952 return (ctf_set_errno (fp
, EINVAL
));
954 if ((ep
->cte_bits
> 255) || (ep
->cte_offset
> 255))
955 return (ctf_set_errno (fp
, ECTF_SLICEOVERFLOW
));
957 if (ref
== CTF_ERR
|| ref
> CTF_MAX_TYPE
)
958 return (ctf_set_errno (fp
, EINVAL
));
960 if ((tp
= ctf_lookup_by_id (&tmp
, ref
)) == NULL
)
961 return CTF_ERR
; /* errno is set for us. */
963 kind
= ctf_type_kind_unsliced (tmp
, ref
);
964 if ((kind
!= CTF_K_INTEGER
) && (kind
!= CTF_K_FLOAT
) &&
965 (kind
!= CTF_K_ENUM
))
966 return (ctf_set_errno (fp
, ECTF_NOTINTFP
));
968 if ((type
= ctf_add_generic (fp
, flag
, NULL
, CTF_K_SLICE
, &dtd
)) == CTF_ERR
)
969 return CTF_ERR
; /* errno is set for us. */
971 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_SLICE
, flag
, 0);
972 dtd
->dtd_data
.ctt_size
= clp2 (P2ROUNDUP (ep
->cte_bits
, CHAR_BIT
)
974 dtd
->dtd_u
.dtu_slice
.cts_type
= ref
;
975 dtd
->dtd_u
.dtu_slice
.cts_bits
= ep
->cte_bits
;
976 dtd
->dtd_u
.dtu_slice
.cts_offset
= ep
->cte_offset
;
982 ctf_add_integer (ctf_file_t
*fp
, uint32_t flag
,
983 const char *name
, const ctf_encoding_t
*ep
)
985 return (ctf_add_encoded (fp
, flag
, name
, ep
, CTF_K_INTEGER
));
989 ctf_add_float (ctf_file_t
*fp
, uint32_t flag
,
990 const char *name
, const ctf_encoding_t
*ep
)
992 return (ctf_add_encoded (fp
, flag
, name
, ep
, CTF_K_FLOAT
));
996 ctf_add_pointer (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
)
998 return (ctf_add_reftype (fp
, flag
, ref
, CTF_K_POINTER
));
1002 ctf_add_array (ctf_file_t
*fp
, uint32_t flag
, const ctf_arinfo_t
*arp
)
1006 ctf_file_t
*tmp
= fp
;
1009 return (ctf_set_errno (fp
, EINVAL
));
1011 if (ctf_lookup_by_id (&tmp
, arp
->ctr_contents
) == NULL
)
1012 return CTF_ERR
; /* errno is set for us. */
1015 if (ctf_lookup_by_id (&tmp
, arp
->ctr_index
) == NULL
)
1016 return CTF_ERR
; /* errno is set for us. */
1018 if ((type
= ctf_add_generic (fp
, flag
, NULL
, CTF_K_ARRAY
, &dtd
)) == CTF_ERR
)
1019 return CTF_ERR
; /* errno is set for us. */
1021 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_ARRAY
, flag
, 0);
1022 dtd
->dtd_data
.ctt_size
= 0;
1023 dtd
->dtd_u
.dtu_arr
= *arp
;
1029 ctf_set_array (ctf_file_t
*fp
, ctf_id_t type
, const ctf_arinfo_t
*arp
)
1031 ctf_dtdef_t
*dtd
= ctf_dtd_lookup (fp
, type
);
1033 if (!(fp
->ctf_flags
& LCTF_RDWR
))
1034 return (ctf_set_errno (fp
, ECTF_RDONLY
));
1037 || LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
) != CTF_K_ARRAY
)
1038 return (ctf_set_errno (fp
, ECTF_BADID
));
1040 fp
->ctf_flags
|= LCTF_DIRTY
;
1041 dtd
->dtd_u
.dtu_arr
= *arp
;
1047 ctf_add_function (ctf_file_t
*fp
, uint32_t flag
,
1048 const ctf_funcinfo_t
*ctc
, const ctf_id_t
*argv
)
1053 ctf_id_t
*vdat
= NULL
;
1054 ctf_file_t
*tmp
= fp
;
1057 if (ctc
== NULL
|| (ctc
->ctc_flags
& ~CTF_FUNC_VARARG
) != 0
1058 || (ctc
->ctc_argc
!= 0 && argv
== NULL
))
1059 return (ctf_set_errno (fp
, EINVAL
));
1061 vlen
= ctc
->ctc_argc
;
1062 if (ctc
->ctc_flags
& CTF_FUNC_VARARG
)
1063 vlen
++; /* Add trailing zero to indicate varargs (see below). */
1065 if (ctf_lookup_by_id (&tmp
, ctc
->ctc_return
) == NULL
)
1066 return CTF_ERR
; /* errno is set for us. */
1068 for (i
= 0; i
< ctc
->ctc_argc
; i
++)
1071 if (ctf_lookup_by_id (&tmp
, argv
[i
]) == NULL
)
1072 return CTF_ERR
; /* errno is set for us. */
1075 if (vlen
> CTF_MAX_VLEN
)
1076 return (ctf_set_errno (fp
, EOVERFLOW
));
1078 if (vlen
!= 0 && (vdat
= malloc (sizeof (ctf_id_t
) * vlen
)) == NULL
)
1079 return (ctf_set_errno (fp
, EAGAIN
));
1081 if ((type
= ctf_add_generic (fp
, flag
, NULL
, CTF_K_FUNCTION
,
1085 return CTF_ERR
; /* errno is set for us. */
1088 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_FUNCTION
, flag
, vlen
);
1089 dtd
->dtd_data
.ctt_type
= (uint32_t) ctc
->ctc_return
;
1091 memcpy (vdat
, argv
, sizeof (ctf_id_t
) * ctc
->ctc_argc
);
1092 if (ctc
->ctc_flags
& CTF_FUNC_VARARG
)
1093 vdat
[vlen
- 1] = 0; /* Add trailing zero to indicate varargs. */
1094 dtd
->dtd_u
.dtu_argv
= vdat
;
1100 ctf_add_struct_sized (ctf_file_t
*fp
, uint32_t flag
, const char *name
,
1106 /* Promote root-visible forwards to structs. */
1108 type
= ctf_lookup_by_rawname (fp
, CTF_K_STRUCT
, name
);
1110 if (type
!= 0 && ctf_type_kind (fp
, type
) == CTF_K_FORWARD
)
1111 dtd
= ctf_dtd_lookup (fp
, type
);
1112 else if ((type
= ctf_add_generic (fp
, flag
, name
, CTF_K_STRUCT
,
1114 return CTF_ERR
; /* errno is set for us. */
1116 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_STRUCT
, flag
, 0);
1118 if (size
> CTF_MAX_SIZE
)
1120 dtd
->dtd_data
.ctt_size
= CTF_LSIZE_SENT
;
1121 dtd
->dtd_data
.ctt_lsizehi
= CTF_SIZE_TO_LSIZE_HI (size
);
1122 dtd
->dtd_data
.ctt_lsizelo
= CTF_SIZE_TO_LSIZE_LO (size
);
1125 dtd
->dtd_data
.ctt_size
= (uint32_t) size
;
1131 ctf_add_struct (ctf_file_t
*fp
, uint32_t flag
, const char *name
)
1133 return (ctf_add_struct_sized (fp
, flag
, name
, 0));
1137 ctf_add_union_sized (ctf_file_t
*fp
, uint32_t flag
, const char *name
,
1143 /* Promote root-visible forwards to unions. */
1145 type
= ctf_lookup_by_rawname (fp
, CTF_K_UNION
, name
);
1147 if (type
!= 0 && ctf_type_kind (fp
, type
) == CTF_K_FORWARD
)
1148 dtd
= ctf_dtd_lookup (fp
, type
);
1149 else if ((type
= ctf_add_generic (fp
, flag
, name
, CTF_K_UNION
,
1151 return CTF_ERR
; /* errno is set for us */
1153 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_UNION
, flag
, 0);
1155 if (size
> CTF_MAX_SIZE
)
1157 dtd
->dtd_data
.ctt_size
= CTF_LSIZE_SENT
;
1158 dtd
->dtd_data
.ctt_lsizehi
= CTF_SIZE_TO_LSIZE_HI (size
);
1159 dtd
->dtd_data
.ctt_lsizelo
= CTF_SIZE_TO_LSIZE_LO (size
);
1162 dtd
->dtd_data
.ctt_size
= (uint32_t) size
;
1168 ctf_add_union (ctf_file_t
*fp
, uint32_t flag
, const char *name
)
1170 return (ctf_add_union_sized (fp
, flag
, name
, 0));
1174 ctf_add_enum (ctf_file_t
*fp
, uint32_t flag
, const char *name
)
1179 /* Promote root-visible forwards to enums. */
1181 type
= ctf_lookup_by_rawname (fp
, CTF_K_ENUM
, name
);
1183 if (type
!= 0 && ctf_type_kind (fp
, type
) == CTF_K_FORWARD
)
1184 dtd
= ctf_dtd_lookup (fp
, type
);
1185 else if ((type
= ctf_add_generic (fp
, flag
, name
, CTF_K_ENUM
,
1187 return CTF_ERR
; /* errno is set for us. */
1189 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_ENUM
, flag
, 0);
1190 dtd
->dtd_data
.ctt_size
= fp
->ctf_dmodel
->ctd_int
;
1196 ctf_add_enum_encoded (ctf_file_t
*fp
, uint32_t flag
, const char *name
,
1197 const ctf_encoding_t
*ep
)
1201 /* First, create the enum if need be, using most of the same machinery as
1202 ctf_add_enum(), to ensure that we do not allow things past that are not
1203 enums or forwards to them. (This includes other slices: you cannot slice a
1204 slice, which would be a useless thing to do anyway.) */
1207 type
= ctf_lookup_by_rawname (fp
, CTF_K_ENUM
, name
);
1211 if ((ctf_type_kind (fp
, type
) != CTF_K_FORWARD
) &&
1212 (ctf_type_kind_unsliced (fp
, type
) != CTF_K_ENUM
))
1213 return (ctf_set_errno (fp
, ECTF_NOTINTFP
));
1215 else if ((type
= ctf_add_enum (fp
, flag
, name
)) == CTF_ERR
)
1216 return CTF_ERR
; /* errno is set for us. */
1218 /* Now attach a suitable slice to it. */
1220 return ctf_add_slice (fp
, flag
, type
, ep
);
1224 ctf_add_forward (ctf_file_t
*fp
, uint32_t flag
, const char *name
,
1230 if (kind
!= CTF_K_STRUCT
&& kind
!= CTF_K_UNION
&& kind
!= CTF_K_ENUM
)
1231 return (ctf_set_errno (fp
, ECTF_NOTSUE
));
1233 /* If the type is already defined or exists as a forward tag, just
1234 return the ctf_id_t of the existing definition. */
1237 type
= ctf_lookup_by_rawname (fp
, kind
, name
);
1242 if ((type
= ctf_add_generic (fp
, flag
, name
, kind
, &dtd
)) == CTF_ERR
)
1243 return CTF_ERR
; /* errno is set for us. */
1245 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_FORWARD
, flag
, 0);
1246 dtd
->dtd_data
.ctt_type
= kind
;
1252 ctf_add_typedef (ctf_file_t
*fp
, uint32_t flag
, const char *name
,
1257 ctf_file_t
*tmp
= fp
;
1259 if (ref
== CTF_ERR
|| ref
> CTF_MAX_TYPE
)
1260 return (ctf_set_errno (fp
, EINVAL
));
1262 if (ctf_lookup_by_id (&tmp
, ref
) == NULL
)
1263 return CTF_ERR
; /* errno is set for us. */
1265 if ((type
= ctf_add_generic (fp
, flag
, name
, CTF_K_TYPEDEF
,
1267 return CTF_ERR
; /* errno is set for us. */
1269 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (CTF_K_TYPEDEF
, flag
, 0);
1270 dtd
->dtd_data
.ctt_type
= (uint32_t) ref
;
1276 ctf_add_volatile (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
)
1278 return (ctf_add_reftype (fp
, flag
, ref
, CTF_K_VOLATILE
));
1282 ctf_add_const (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
)
1284 return (ctf_add_reftype (fp
, flag
, ref
, CTF_K_CONST
));
1288 ctf_add_restrict (ctf_file_t
*fp
, uint32_t flag
, ctf_id_t ref
)
1290 return (ctf_add_reftype (fp
, flag
, ref
, CTF_K_RESTRICT
));
1294 ctf_add_enumerator (ctf_file_t
*fp
, ctf_id_t enid
, const char *name
,
1297 ctf_dtdef_t
*dtd
= ctf_dtd_lookup (fp
, enid
);
1300 uint32_t kind
, vlen
, root
;
1304 return (ctf_set_errno (fp
, EINVAL
));
1306 if (!(fp
->ctf_flags
& LCTF_RDWR
))
1307 return (ctf_set_errno (fp
, ECTF_RDONLY
));
1310 return (ctf_set_errno (fp
, ECTF_BADID
));
1312 kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
1313 root
= LCTF_INFO_ISROOT (fp
, dtd
->dtd_data
.ctt_info
);
1314 vlen
= LCTF_INFO_VLEN (fp
, dtd
->dtd_data
.ctt_info
);
1316 if (kind
!= CTF_K_ENUM
)
1317 return (ctf_set_errno (fp
, ECTF_NOTENUM
));
1319 if (vlen
== CTF_MAX_VLEN
)
1320 return (ctf_set_errno (fp
, ECTF_DTFULL
));
1322 for (dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
1323 dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
1325 if (strcmp (dmd
->dmd_name
, name
) == 0)
1326 return (ctf_set_errno (fp
, ECTF_DUPLICATE
));
1329 if ((dmd
= malloc (sizeof (ctf_dmdef_t
))) == NULL
)
1330 return (ctf_set_errno (fp
, EAGAIN
));
1332 if ((s
= strdup (name
)) == NULL
)
1335 return (ctf_set_errno (fp
, EAGAIN
));
1339 dmd
->dmd_type
= CTF_ERR
;
1340 dmd
->dmd_offset
= 0;
1341 dmd
->dmd_value
= value
;
1343 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (kind
, root
, vlen
+ 1);
1344 ctf_list_append (&dtd
->dtd_u
.dtu_members
, dmd
);
1346 fp
->ctf_flags
|= LCTF_DIRTY
;
1352 ctf_add_member_offset (ctf_file_t
*fp
, ctf_id_t souid
, const char *name
,
1353 ctf_id_t type
, unsigned long bit_offset
)
1355 ctf_dtdef_t
*dtd
= ctf_dtd_lookup (fp
, souid
);
1358 ssize_t msize
, malign
, ssize
;
1359 uint32_t kind
, vlen
, root
;
1362 if (!(fp
->ctf_flags
& LCTF_RDWR
))
1363 return (ctf_set_errno (fp
, ECTF_RDONLY
));
1366 return (ctf_set_errno (fp
, ECTF_BADID
));
1368 kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
1369 root
= LCTF_INFO_ISROOT (fp
, dtd
->dtd_data
.ctt_info
);
1370 vlen
= LCTF_INFO_VLEN (fp
, dtd
->dtd_data
.ctt_info
);
1372 if (kind
!= CTF_K_STRUCT
&& kind
!= CTF_K_UNION
)
1373 return (ctf_set_errno (fp
, ECTF_NOTSOU
));
1375 if (vlen
== CTF_MAX_VLEN
)
1376 return (ctf_set_errno (fp
, ECTF_DTFULL
));
1380 for (dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
1381 dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
1383 if (dmd
->dmd_name
!= NULL
&& strcmp (dmd
->dmd_name
, name
) == 0)
1384 return (ctf_set_errno (fp
, ECTF_DUPLICATE
));
1388 if ((msize
= ctf_type_size (fp
, type
)) < 0 ||
1389 (malign
= ctf_type_align (fp
, type
)) < 0)
1390 return -1; /* errno is set for us. */
1392 if ((dmd
= malloc (sizeof (ctf_dmdef_t
))) == NULL
)
1393 return (ctf_set_errno (fp
, EAGAIN
));
1395 if (name
!= NULL
&& (s
= strdup (name
)) == NULL
)
1398 return (ctf_set_errno (fp
, EAGAIN
));
1402 dmd
->dmd_type
= type
;
1403 dmd
->dmd_value
= -1;
1405 if (kind
== CTF_K_STRUCT
&& vlen
!= 0)
1407 if (bit_offset
== (unsigned long) - 1)
1409 /* Natural alignment. */
1411 ctf_dmdef_t
*lmd
= ctf_list_prev (&dtd
->dtd_u
.dtu_members
);
1412 ctf_id_t ltype
= ctf_type_resolve (fp
, lmd
->dmd_type
);
1413 size_t off
= lmd
->dmd_offset
;
1415 ctf_encoding_t linfo
;
1418 if (ctf_type_encoding (fp
, ltype
, &linfo
) == 0)
1419 off
+= linfo
.cte_bits
;
1420 else if ((lsize
= ctf_type_size (fp
, ltype
)) > 0)
1421 off
+= lsize
* CHAR_BIT
;
1423 /* Round up the offset of the end of the last member to
1424 the next byte boundary, convert 'off' to bytes, and
1425 then round it up again to the next multiple of the
1426 alignment required by the new member. Finally,
1427 convert back to bits and store the result in
1428 dmd_offset. Technically we could do more efficient
1429 packing if the new member is a bit-field, but we're
1430 the "compiler" and ANSI says we can do as we choose. */
1432 off
= roundup (off
, CHAR_BIT
) / CHAR_BIT
;
1433 off
= roundup (off
, MAX (malign
, 1));
1434 dmd
->dmd_offset
= off
* CHAR_BIT
;
1435 ssize
= off
+ msize
;
1439 /* Specified offset in bits. */
1441 dmd
->dmd_offset
= bit_offset
;
1442 ssize
= ctf_get_ctt_size (fp
, &dtd
->dtd_data
, NULL
, NULL
);
1443 ssize
= MAX (ssize
, ((signed) bit_offset
/ CHAR_BIT
) + msize
);
1448 dmd
->dmd_offset
= 0;
1449 ssize
= ctf_get_ctt_size (fp
, &dtd
->dtd_data
, NULL
, NULL
);
1450 ssize
= MAX (ssize
, msize
);
1453 if ((size_t) ssize
> CTF_MAX_SIZE
)
1455 dtd
->dtd_data
.ctt_size
= CTF_LSIZE_SENT
;
1456 dtd
->dtd_data
.ctt_lsizehi
= CTF_SIZE_TO_LSIZE_HI (ssize
);
1457 dtd
->dtd_data
.ctt_lsizelo
= CTF_SIZE_TO_LSIZE_LO (ssize
);
1460 dtd
->dtd_data
.ctt_size
= (uint32_t) ssize
;
1462 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (kind
, root
, vlen
+ 1);
1463 ctf_list_append (&dtd
->dtd_u
.dtu_members
, dmd
);
1465 fp
->ctf_flags
|= LCTF_DIRTY
;
1470 ctf_add_member_encoded (ctf_file_t
*fp
, ctf_id_t souid
, const char *name
,
1471 ctf_id_t type
, unsigned long bit_offset
,
1472 const ctf_encoding_t encoding
)
1474 ctf_dtdef_t
*dtd
= ctf_dtd_lookup (fp
, type
);
1475 int kind
= LCTF_INFO_KIND (fp
, dtd
->dtd_data
.ctt_info
);
1478 if ((kind
!= CTF_K_INTEGER
) && (kind
!= CTF_K_FLOAT
) && (kind
!= CTF_K_ENUM
))
1479 return (ctf_set_errno (fp
, ECTF_NOTINTFP
));
1481 if ((type
= ctf_add_slice (fp
, CTF_ADD_NONROOT
, otype
, &encoding
)) == CTF_ERR
)
1482 return -1; /* errno is set for us. */
1484 return ctf_add_member_offset (fp
, souid
, name
, type
, bit_offset
);
1488 ctf_add_member (ctf_file_t
*fp
, ctf_id_t souid
, const char *name
,
1491 return ctf_add_member_offset (fp
, souid
, name
, type
, (unsigned long) - 1);
1495 ctf_add_variable (ctf_file_t
*fp
, const char *name
, ctf_id_t ref
)
1498 ctf_file_t
*tmp
= fp
;
1500 if (!(fp
->ctf_flags
& LCTF_RDWR
))
1501 return (ctf_set_errno (fp
, ECTF_RDONLY
));
1503 if (ctf_dvd_lookup (fp
, name
) != NULL
)
1504 return (ctf_set_errno (fp
, ECTF_DUPLICATE
));
1506 if (ctf_lookup_by_id (&tmp
, ref
) == NULL
)
1507 return -1; /* errno is set for us. */
1509 /* Make sure this type is representable. */
1510 if ((ctf_type_resolve (fp
, ref
) == CTF_ERR
)
1511 && (ctf_errno (fp
) == ECTF_NONREPRESENTABLE
))
1514 if ((dvd
= malloc (sizeof (ctf_dvdef_t
))) == NULL
)
1515 return (ctf_set_errno (fp
, EAGAIN
));
1517 if (name
!= NULL
&& (dvd
->dvd_name
= strdup (name
)) == NULL
)
1520 return (ctf_set_errno (fp
, EAGAIN
));
1522 dvd
->dvd_type
= ref
;
1523 dvd
->dvd_snapshots
= fp
->ctf_snapshots
;
1525 if (ctf_dvd_insert (fp
, dvd
) < 0)
1527 free (dvd
->dvd_name
);
1529 return -1; /* errno is set for us. */
1532 fp
->ctf_flags
|= LCTF_DIRTY
;
1537 enumcmp (const char *name
, int value
, void *arg
)
1539 ctf_bundle_t
*ctb
= arg
;
1542 if (ctf_enum_value (ctb
->ctb_file
, ctb
->ctb_type
, name
, &bvalue
) < 0)
1544 ctf_dprintf ("Conflict due to member %s iteration error: %s.\n", name
,
1545 ctf_errmsg (ctf_errno (ctb
->ctb_file
)));
1548 if (value
!= bvalue
)
1550 ctf_dprintf ("Conflict due to value change: %i versus %i\n",
1558 enumadd (const char *name
, int value
, void *arg
)
1560 ctf_bundle_t
*ctb
= arg
;
1562 return (ctf_add_enumerator (ctb
->ctb_file
, ctb
->ctb_type
,
1567 membcmp (const char *name
, ctf_id_t type _libctf_unused_
, unsigned long offset
,
1570 ctf_bundle_t
*ctb
= arg
;
1573 if (ctf_member_info (ctb
->ctb_file
, ctb
->ctb_type
, name
, &ctm
) < 0)
1575 ctf_dprintf ("Conflict due to member %s iteration error: %s.\n", name
,
1576 ctf_errmsg (ctf_errno (ctb
->ctb_file
)));
1579 if (ctm
.ctm_offset
!= offset
)
1581 ctf_dprintf ("Conflict due to member %s offset change: "
1582 "%lx versus %lx\n", name
, ctm
.ctm_offset
, offset
);
1589 membadd (const char *name
, ctf_id_t type
, unsigned long offset
, void *arg
)
1591 ctf_bundle_t
*ctb
= arg
;
1595 if ((dmd
= malloc (sizeof (ctf_dmdef_t
))) == NULL
)
1596 return (ctf_set_errno (ctb
->ctb_file
, EAGAIN
));
1598 if (name
!= NULL
&& (s
= strdup (name
)) == NULL
)
1601 return (ctf_set_errno (ctb
->ctb_file
, EAGAIN
));
1604 /* For now, dmd_type is copied as the src_fp's type; it is reset to an
1605 equivalent dst_fp type by a final loop in ctf_add_type(), below. */
1607 dmd
->dmd_type
= type
;
1608 dmd
->dmd_offset
= offset
;
1609 dmd
->dmd_value
= -1;
1611 ctf_list_append (&ctb
->ctb_dtd
->dtd_u
.dtu_members
, dmd
);
1613 ctb
->ctb_file
->ctf_flags
|= LCTF_DIRTY
;
1617 /* The ctf_add_type routine is used to copy a type from a source CTF container
1618 to a dynamic destination container. This routine operates recursively by
1619 following the source type's links and embedded member types. If the
1620 destination container already contains a named type which has the same
1621 attributes, then we succeed and return this type but no changes occur. */
1623 ctf_add_type_internal (ctf_file_t
*dst_fp
, ctf_file_t
*src_fp
, ctf_id_t src_type
,
1624 ctf_file_t
*proc_tracking_fp
)
1626 ctf_id_t dst_type
= CTF_ERR
;
1627 uint32_t dst_kind
= CTF_K_UNKNOWN
;
1628 ctf_file_t
*tmp_fp
= dst_fp
;
1632 uint32_t kind
, forward_kind
, flag
, vlen
;
1634 const ctf_type_t
*src_tp
, *dst_tp
;
1635 ctf_bundle_t src
, dst
;
1636 ctf_encoding_t src_en
, dst_en
;
1637 ctf_arinfo_t src_ar
, dst_ar
;
1641 ctf_id_t orig_src_type
= src_type
;
1643 if (!(dst_fp
->ctf_flags
& LCTF_RDWR
))
1644 return (ctf_set_errno (dst_fp
, ECTF_RDONLY
));
1646 if ((src_tp
= ctf_lookup_by_id (&src_fp
, src_type
)) == NULL
)
1647 return (ctf_set_errno (dst_fp
, ctf_errno (src_fp
)));
1649 if ((ctf_type_resolve (src_fp
, src_type
) == CTF_ERR
)
1650 && (ctf_errno (src_fp
) == ECTF_NONREPRESENTABLE
))
1651 return (ctf_set_errno (dst_fp
, ECTF_NONREPRESENTABLE
));
1653 name
= ctf_strptr (src_fp
, src_tp
->ctt_name
);
1654 kind
= LCTF_INFO_KIND (src_fp
, src_tp
->ctt_info
);
1655 flag
= LCTF_INFO_ISROOT (src_fp
, src_tp
->ctt_info
);
1656 vlen
= LCTF_INFO_VLEN (src_fp
, src_tp
->ctt_info
);
1658 /* If this is a type we are currently in the middle of adding, hand it
1659 straight back. (This lets us handle self-referential structures without
1660 considering forwards and empty structures the same as their completed
1663 tmp
= ctf_type_mapping (src_fp
, src_type
, &tmp_fp
);
1667 if (ctf_dynhash_lookup (proc_tracking_fp
->ctf_add_processing
,
1668 (void *) (uintptr_t) src_type
))
1671 /* If this type has already been added from this container, and is the same
1672 kind and (if a struct or union) has the same number of members, hand it
1675 if (ctf_type_kind_unsliced (tmp_fp
, tmp
) == (int) kind
)
1677 if (kind
== CTF_K_STRUCT
|| kind
== CTF_K_UNION
1678 || kind
== CTF_K_ENUM
)
1680 if ((dst_tp
= ctf_lookup_by_id (&tmp_fp
, dst_type
)) != NULL
)
1681 if (vlen
== LCTF_INFO_VLEN (tmp_fp
, dst_tp
->ctt_info
))
1689 forward_kind
= kind
;
1690 if (kind
== CTF_K_FORWARD
)
1691 forward_kind
= src_tp
->ctt_type
;
1693 /* If the source type has a name and is a root type (visible at the
1694 top-level scope), lookup the name in the destination container and
1695 verify that it is of the same kind before we do anything else. */
1697 if ((flag
& CTF_ADD_ROOT
) && name
[0] != '\0'
1698 && (tmp
= ctf_lookup_by_rawname (dst_fp
, forward_kind
, name
)) != 0)
1701 dst_kind
= ctf_type_kind_unsliced (dst_fp
, dst_type
);
1704 /* If an identically named dst_type exists, fail with ECTF_CONFLICT
1705 unless dst_type is a forward declaration and src_type is a struct,
1706 union, or enum (i.e. the definition of the previous forward decl).
1708 We also allow addition in the opposite order (addition of a forward when a
1709 struct, union, or enum already exists), which is a NOP and returns the
1710 already-present struct, union, or enum. */
1712 if (dst_type
!= CTF_ERR
&& dst_kind
!= kind
)
1714 if (kind
== CTF_K_FORWARD
1715 && (dst_kind
== CTF_K_ENUM
|| dst_kind
== CTF_K_STRUCT
1716 || dst_kind
== CTF_K_UNION
))
1718 ctf_add_type_mapping (src_fp
, src_type
, dst_fp
, dst_type
);
1722 if (dst_kind
!= CTF_K_FORWARD
1723 || (kind
!= CTF_K_ENUM
&& kind
!= CTF_K_STRUCT
1724 && kind
!= CTF_K_UNION
))
1726 ctf_dprintf ("Conflict for type %s: kinds differ, new: %i; "
1727 "old (ID %lx): %i\n", name
, kind
, dst_type
, dst_kind
);
1728 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
1732 /* We take special action for an integer, float, or slice since it is
1733 described not only by its name but also its encoding. For integers,
1734 bit-fields exploit this degeneracy. */
1736 if (kind
== CTF_K_INTEGER
|| kind
== CTF_K_FLOAT
|| kind
== CTF_K_SLICE
)
1738 if (ctf_type_encoding (src_fp
, src_type
, &src_en
) != 0)
1739 return (ctf_set_errno (dst_fp
, ctf_errno (src_fp
)));
1741 if (dst_type
!= CTF_ERR
)
1743 ctf_file_t
*fp
= dst_fp
;
1745 if ((dst_tp
= ctf_lookup_by_id (&fp
, dst_type
)) == NULL
)
1748 if (ctf_type_encoding (dst_fp
, dst_type
, &dst_en
) != 0)
1749 return CTF_ERR
; /* errno set for us. */
1751 if (LCTF_INFO_ISROOT (fp
, dst_tp
->ctt_info
) & CTF_ADD_ROOT
)
1753 /* The type that we found in the hash is also root-visible. If
1754 the two types match then use the existing one; otherwise,
1755 declare a conflict. Note: slices are not certain to match
1756 even if there is no conflict: we must check the contained type
1759 if (memcmp (&src_en
, &dst_en
, sizeof (ctf_encoding_t
)) == 0)
1761 if (kind
!= CTF_K_SLICE
)
1763 ctf_add_type_mapping (src_fp
, src_type
, dst_fp
, dst_type
);
1769 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
1774 /* We found a non-root-visible type in the hash. If its encoding
1775 is the same, we can reuse it, unless it is a slice. */
1777 if (memcmp (&src_en
, &dst_en
, sizeof (ctf_encoding_t
)) == 0)
1779 if (kind
!= CTF_K_SLICE
)
1781 ctf_add_type_mapping (src_fp
, src_type
, dst_fp
, dst_type
);
1789 src
.ctb_file
= src_fp
;
1790 src
.ctb_type
= src_type
;
1793 dst
.ctb_file
= dst_fp
;
1794 dst
.ctb_type
= dst_type
;
1797 /* Now perform kind-specific processing. If dst_type is CTF_ERR, then we add
1798 a new type with the same properties as src_type to dst_fp. If dst_type is
1799 not CTF_ERR, then we verify that dst_type has the same attributes as
1800 src_type. We recurse for embedded references. Before we start, we note
1801 that we are processing this type, to prevent infinite recursion: we do not
1802 re-process any type that appears in this list. The list is emptied
1803 wholesale at the end of processing everything in this recursive stack. */
1805 if (ctf_dynhash_insert (proc_tracking_fp
->ctf_add_processing
,
1806 (void *) (uintptr_t) src_type
, (void *) 1) < 0)
1807 return ctf_set_errno (dst_fp
, ENOMEM
);
1812 /* If we found a match we will have either returned it or declared a
1814 dst_type
= ctf_add_integer (dst_fp
, flag
, name
, &src_en
);
1818 /* If we found a match we will have either returned it or declared a
1820 dst_type
= ctf_add_float (dst_fp
, flag
, name
, &src_en
);
1824 /* We have checked for conflicting encodings: now try to add the
1826 src_type
= ctf_type_reference (src_fp
, src_type
);
1827 src_type
= ctf_add_type_internal (dst_fp
, src_fp
, src_type
,
1830 if (src_type
== CTF_ERR
)
1831 return CTF_ERR
; /* errno is set for us. */
1833 dst_type
= ctf_add_slice (dst_fp
, flag
, src_type
, &src_en
);
1837 case CTF_K_VOLATILE
:
1839 case CTF_K_RESTRICT
:
1840 src_type
= ctf_type_reference (src_fp
, src_type
);
1841 src_type
= ctf_add_type_internal (dst_fp
, src_fp
, src_type
,
1844 if (src_type
== CTF_ERR
)
1845 return CTF_ERR
; /* errno is set for us. */
1847 dst_type
= ctf_add_reftype (dst_fp
, flag
, src_type
, kind
);
1851 if (ctf_array_info (src_fp
, src_type
, &src_ar
) != 0)
1852 return (ctf_set_errno (dst_fp
, ctf_errno (src_fp
)));
1854 src_ar
.ctr_contents
=
1855 ctf_add_type_internal (dst_fp
, src_fp
, src_ar
.ctr_contents
,
1857 src_ar
.ctr_index
= ctf_add_type_internal (dst_fp
, src_fp
,
1860 src_ar
.ctr_nelems
= src_ar
.ctr_nelems
;
1862 if (src_ar
.ctr_contents
== CTF_ERR
|| src_ar
.ctr_index
== CTF_ERR
)
1863 return CTF_ERR
; /* errno is set for us. */
1865 if (dst_type
!= CTF_ERR
)
1867 if (ctf_array_info (dst_fp
, dst_type
, &dst_ar
) != 0)
1868 return CTF_ERR
; /* errno is set for us. */
1870 if (memcmp (&src_ar
, &dst_ar
, sizeof (ctf_arinfo_t
)))
1872 ctf_dprintf ("Conflict for type %s against ID %lx: "
1873 "array info differs, old %lx/%lx/%x; "
1874 "new: %lx/%lx/%x\n", name
, dst_type
,
1875 src_ar
.ctr_contents
, src_ar
.ctr_index
,
1876 src_ar
.ctr_nelems
, dst_ar
.ctr_contents
,
1877 dst_ar
.ctr_index
, dst_ar
.ctr_nelems
);
1878 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
1882 dst_type
= ctf_add_array (dst_fp
, flag
, &src_ar
);
1885 case CTF_K_FUNCTION
:
1886 ctc
.ctc_return
= ctf_add_type_internal (dst_fp
, src_fp
,
1892 if (ctc
.ctc_return
== CTF_ERR
)
1893 return CTF_ERR
; /* errno is set for us. */
1895 dst_type
= ctf_add_function (dst_fp
, flag
, &ctc
, NULL
);
1907 /* Technically to match a struct or union we need to check both
1908 ways (src members vs. dst, dst members vs. src) but we make
1909 this more optimal by only checking src vs. dst and comparing
1910 the total size of the structure (which we must do anyway)
1911 which covers the possibility of dst members not in src.
1912 This optimization can be defeated for unions, but is so
1913 pathological as to render it irrelevant for our purposes. */
1915 if (dst_type
!= CTF_ERR
&& kind
!= CTF_K_FORWARD
1916 && dst_kind
!= CTF_K_FORWARD
)
1918 if (ctf_type_size (src_fp
, src_type
) !=
1919 ctf_type_size (dst_fp
, dst_type
))
1921 ctf_dprintf ("Conflict for type %s against ID %lx: "
1922 "union size differs, old %li, new %li\n",
1924 (long) ctf_type_size (src_fp
, src_type
),
1925 (long) ctf_type_size (dst_fp
, dst_type
));
1926 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
1929 if (ctf_member_iter (src_fp
, src_type
, membcmp
, &dst
))
1931 ctf_dprintf ("Conflict for type %s against ID %lx: "
1932 "members differ, see above\n", name
, dst_type
);
1933 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
1939 /* Unlike the other cases, copying structs and unions is done
1940 manually so as to avoid repeated lookups in ctf_add_member
1941 and to ensure the exact same member offsets as in src_type. */
1943 dst_type
= ctf_add_generic (dst_fp
, flag
, name
, kind
, &dtd
);
1944 if (dst_type
== CTF_ERR
)
1945 return CTF_ERR
; /* errno is set for us. */
1947 dst
.ctb_type
= dst_type
;
1950 /* Pre-emptively add this struct to the type mapping so that
1951 structures that refer to themselves work. */
1952 ctf_add_type_mapping (src_fp
, src_type
, dst_fp
, dst_type
);
1954 if (ctf_member_iter (src_fp
, src_type
, membadd
, &dst
) != 0)
1955 errs
++; /* Increment errs and fail at bottom of case. */
1957 if ((ssize
= ctf_type_size (src_fp
, src_type
)) < 0)
1958 return CTF_ERR
; /* errno is set for us. */
1960 size
= (size_t) ssize
;
1961 if (size
> CTF_MAX_SIZE
)
1963 dtd
->dtd_data
.ctt_size
= CTF_LSIZE_SENT
;
1964 dtd
->dtd_data
.ctt_lsizehi
= CTF_SIZE_TO_LSIZE_HI (size
);
1965 dtd
->dtd_data
.ctt_lsizelo
= CTF_SIZE_TO_LSIZE_LO (size
);
1968 dtd
->dtd_data
.ctt_size
= (uint32_t) size
;
1970 dtd
->dtd_data
.ctt_info
= CTF_TYPE_INFO (kind
, flag
, vlen
);
1972 /* Make a final pass through the members changing each dmd_type (a
1973 src_fp type) to an equivalent type in dst_fp. We pass through all
1974 members, leaving any that fail set to CTF_ERR, unless they fail
1975 because they are marking a member of type not representable in this
1976 version of CTF, in which case we just want to silently omit them:
1977 no consumer can do anything with them anyway. */
1978 for (dmd
= ctf_list_next (&dtd
->dtd_u
.dtu_members
);
1979 dmd
!= NULL
; dmd
= ctf_list_next (dmd
))
1981 ctf_file_t
*dst
= dst_fp
;
1984 memb_type
= ctf_type_mapping (src_fp
, dmd
->dmd_type
, &dst
);
1987 if ((dmd
->dmd_type
=
1988 ctf_add_type_internal (dst_fp
, src_fp
, dmd
->dmd_type
,
1989 proc_tracking_fp
)) == CTF_ERR
)
1991 if (ctf_errno (dst_fp
) != ECTF_NONREPRESENTABLE
)
1996 dmd
->dmd_type
= memb_type
;
2000 return CTF_ERR
; /* errno is set for us. */
2005 if (dst_type
!= CTF_ERR
&& kind
!= CTF_K_FORWARD
2006 && dst_kind
!= CTF_K_FORWARD
)
2008 if (ctf_enum_iter (src_fp
, src_type
, enumcmp
, &dst
)
2009 || ctf_enum_iter (dst_fp
, dst_type
, enumcmp
, &src
))
2011 ctf_dprintf ("Conflict for enum %s against ID %lx: "
2012 "members differ, see above\n", name
, dst_type
);
2013 return (ctf_set_errno (dst_fp
, ECTF_CONFLICT
));
2018 dst_type
= ctf_add_enum (dst_fp
, flag
, name
);
2019 if ((dst
.ctb_type
= dst_type
) == CTF_ERR
2020 || ctf_enum_iter (src_fp
, src_type
, enumadd
, &dst
))
2021 return CTF_ERR
; /* errno is set for us */
2026 if (dst_type
== CTF_ERR
)
2027 dst_type
= ctf_add_forward (dst_fp
, flag
, name
, forward_kind
);
2031 src_type
= ctf_type_reference (src_fp
, src_type
);
2032 src_type
= ctf_add_type_internal (dst_fp
, src_fp
, src_type
,
2035 if (src_type
== CTF_ERR
)
2036 return CTF_ERR
; /* errno is set for us. */
2038 /* If dst_type is not CTF_ERR at this point, we should check if
2039 ctf_type_reference(dst_fp, dst_type) != src_type and if so fail with
2040 ECTF_CONFLICT. However, this causes problems with bitness typedefs
2041 that vary based on things like if 32-bit then pid_t is int otherwise
2042 long. We therefore omit this check and assume that if the identically
2043 named typedef already exists in dst_fp, it is correct or
2046 if (dst_type
== CTF_ERR
)
2047 dst_type
= ctf_add_typedef (dst_fp
, flag
, name
, src_type
);
2052 return (ctf_set_errno (dst_fp
, ECTF_CORRUPT
));
2055 if (dst_type
!= CTF_ERR
)
2056 ctf_add_type_mapping (src_fp
, orig_src_type
, dst_fp
, dst_type
);
2061 ctf_add_type (ctf_file_t
*dst_fp
, ctf_file_t
*src_fp
, ctf_id_t src_type
)
2065 if (!src_fp
->ctf_add_processing
)
2066 src_fp
->ctf_add_processing
= ctf_dynhash_create (ctf_hash_integer
,
2067 ctf_hash_eq_integer
,
2070 /* We store the hash on the source, because it contains only source type IDs:
2071 but callers will invariably expect errors to appear on the dest. */
2072 if (!src_fp
->ctf_add_processing
)
2073 return (ctf_set_errno (dst_fp
, ENOMEM
));
2075 id
= ctf_add_type_internal (dst_fp
, src_fp
, src_type
, src_fp
);
2076 ctf_dynhash_empty (src_fp
->ctf_add_processing
);
2081 /* Write the compressed CTF data stream to the specified gzFile descriptor. */
2083 ctf_gzwrite (ctf_file_t
*fp
, gzFile fd
)
2085 const unsigned char *buf
;
2089 resid
= sizeof (ctf_header_t
);
2090 buf
= (unsigned char *) fp
->ctf_header
;
2093 if ((len
= gzwrite (fd
, buf
, resid
)) <= 0)
2094 return (ctf_set_errno (fp
, errno
));
2099 resid
= fp
->ctf_size
;
2103 if ((len
= gzwrite (fd
, buf
, resid
)) <= 0)
2104 return (ctf_set_errno (fp
, errno
));
2112 /* Compress the specified CTF data stream and write it to the specified file
2115 ctf_compress_write (ctf_file_t
*fp
, int fd
)
2120 ctf_header_t
*hp
= &h
;
2121 ssize_t header_len
= sizeof (ctf_header_t
);
2122 ssize_t compress_len
;
2127 if (ctf_serialize (fp
) < 0)
2128 return -1; /* errno is set for us. */
2130 memcpy (hp
, fp
->ctf_header
, header_len
);
2131 hp
->cth_flags
|= CTF_F_COMPRESS
;
2132 compress_len
= compressBound (fp
->ctf_size
);
2134 if ((buf
= malloc (compress_len
)) == NULL
)
2135 return (ctf_set_errno (fp
, ECTF_ZALLOC
));
2137 if ((rc
= compress (buf
, (uLongf
*) &compress_len
,
2138 fp
->ctf_buf
, fp
->ctf_size
)) != Z_OK
)
2140 ctf_dprintf ("zlib deflate err: %s\n", zError (rc
));
2141 err
= ctf_set_errno (fp
, ECTF_COMPRESS
);
2145 while (header_len
> 0)
2147 if ((len
= write (fd
, hp
, header_len
)) < 0)
2149 err
= ctf_set_errno (fp
, errno
);
2157 while (compress_len
> 0)
2159 if ((len
= write (fd
, bp
, compress_len
)) < 0)
2161 err
= ctf_set_errno (fp
, errno
);
2164 compress_len
-= len
;
2173 /* Optionally compress the specified CTF data stream and return it as a new
2174 dynamically-allocated string. */
2176 ctf_write_mem (ctf_file_t
*fp
, size_t *size
, size_t threshold
)
2181 ssize_t header_len
= sizeof (ctf_header_t
);
2182 ssize_t compress_len
;
2185 if (ctf_serialize (fp
) < 0)
2186 return NULL
; /* errno is set for us. */
2188 compress_len
= compressBound (fp
->ctf_size
);
2189 if (fp
->ctf_size
< threshold
)
2190 compress_len
= fp
->ctf_size
;
2191 if ((buf
= malloc (compress_len
2192 + sizeof (struct ctf_header
))) == NULL
)
2194 ctf_set_errno (fp
, ENOMEM
);
2198 hp
= (ctf_header_t
*) buf
;
2199 memcpy (hp
, fp
->ctf_header
, header_len
);
2200 bp
= buf
+ sizeof (struct ctf_header
);
2201 *size
= sizeof (struct ctf_header
);
2203 if (fp
->ctf_size
< threshold
)
2205 hp
->cth_flags
&= ~CTF_F_COMPRESS
;
2206 memcpy (bp
, fp
->ctf_buf
, fp
->ctf_size
);
2207 *size
+= fp
->ctf_size
;
2211 hp
->cth_flags
|= CTF_F_COMPRESS
;
2212 if ((rc
= compress (bp
, (uLongf
*) &compress_len
,
2213 fp
->ctf_buf
, fp
->ctf_size
)) != Z_OK
)
2215 ctf_dprintf ("zlib deflate err: %s\n", zError (rc
));
2216 ctf_set_errno (fp
, ECTF_COMPRESS
);
2220 *size
+= compress_len
;
2225 /* Write the uncompressed CTF data stream to the specified file descriptor. */
2227 ctf_write (ctf_file_t
*fp
, int fd
)
2229 const unsigned char *buf
;
2233 if (ctf_serialize (fp
) < 0)
2234 return -1; /* errno is set for us. */
2236 resid
= sizeof (ctf_header_t
);
2237 buf
= (unsigned char *) fp
->ctf_header
;
2240 if ((len
= write (fd
, buf
, resid
)) <= 0)
2241 return (ctf_set_errno (fp
, errno
));
2246 resid
= fp
->ctf_size
;
2250 if ((len
= write (fd
, buf
, resid
)) <= 0)
2251 return (ctf_set_errno (fp
, errno
));