Searched refs:iidesc_t (Results 1 - 11 of 11) sorted by relevance
/freebsd-12-stable/cddl/contrib/opensolaris/tools/ctf/cvt/ |
H A D | iidesc.c | 29 * Routines for manipulating iidesc_t structures 42 iidesc_t *iif_tgt; 43 iidesc_t *iif_ret; 46 iidesc_t * 49 iidesc_t *ii; 51 ii = xcalloc(sizeof (iidesc_t)); 61 iidesc_t *ii = arg; 73 iidesc_t *src = arg1; 75 iidesc_t *tgt = find->iif_tgt; 87 iidesc_add(hash_t *hash, iidesc_t *ne [all...] |
H A D | traverse.h | 59 int iitraverse(iidesc_t *, int *, tdtrav_cb_f *, tdtrav_cb_f *, tdtrav_cb_f *,
|
H A D | ctftools.h | 251 #define TDESC_F_ISROOT 0x1 /* Has an iidesc_t (see below) */ 256 * iidesc_t (Interesting Item DESCription) nodes point to tdesc_t nodes that 282 } iidesc_t; typedef in typeref:struct:iidesc 304 hash_t *td_iihash; /* The iidesc_t nodes for this file */ 328 iidesc_t **iib_funcs; 332 iidesc_t **iib_objts; 354 iidesc_t *iidesc_new(char *); 358 iidesc_t *iidesc_dup(iidesc_t *); 359 iidesc_t *iidesc_dup_renam [all...] |
H A D | stabs.c | 149 fnarg_add(iidesc_t *curfun, iidesc_t *arg) 165 fnarg_free(iidesc_t *ii) 183 iidesc_t *iidescp; 184 iidesc_t *curfun = NULL;
|
H A D | output.c | 49 iidesc_t *iim_ret; 58 iidesc_t *ii = data; 120 iiburst->iib_funcs = xcalloc(sizeof (iidesc_t *) * max); 122 iiburst->iib_objts = xcalloc(sizeof (iidesc_t *) * max); 162 iidesc_t *iidesc = arg1; 194 static iidesc_t * 308 static iidesc_t * 309 copy_from_strong(tdata_t *td, GElf_Sym *sym, iidesc_t *strongdesc, 312 iidesc_t *new = iidesc_dup_rename(strongdesc, weakname, weakfile); 365 iidesc_t **tolis [all...] |
H A D | merge.c | 34 * tdata_t structures contain two main elements - a hash of iidesc_t nodes, and 35 * a directed graph of tdesc_t nodes, pointed to by the iidesc_t nodes. Simply 36 * put, we merge the tdesc_t graphs, followed by the iidesc_t nodes, and then we 41 * 1. Mapping iidesc_t nodes 43 * For each child iidesc_t node, we first try to map its tdesc_t subgraph 52 * If all of the nodes in the subgraph for an iidesc_t in the child can be 54 * iidesc_t onto an iidesc_t in the parent. If we cannot find an equivalent 55 * iidesc_t, or if we were not able to completely map the tdesc_t subgraph(s), 56 * then we add this iidesc_t t [all...] |
H A D | traverse.c | 190 iidesc_t *ii = arg1; 207 iitraverse(iidesc_t *ii, int *vgenp, tdtrav_cb_f *firstops, tdtrav_cb_f *preops,
|
H A D | st_parse.c | 187 parse_fun(char *cp, iidesc_t *ii) 250 parse_sym(char *cp, iidesc_t *ii) 290 parse_type(char *cp, iidesc_t *ii) 347 parse_sou(char *cp, iidesc_t *idp) 406 parse_stab(stab_t *stab, char *cp, iidesc_t **iidescp) 408 iidesc_t *ii = NULL; 409 iitype_t (*parse)(char *, iidesc_t *);
|
H A D | dwarf.c | 862 iidesc_t *ii = xcalloc(sizeof (iidesc_t)); 941 iidesc_t *ii; 1077 ii = xcalloc(sizeof (iidesc_t)); 1511 iidesc_t *ii = xcalloc(sizeof (iidesc_t)); 1556 iidesc_t *ii; 1582 ii = xcalloc(sizeof (iidesc_t)); 1647 iidesc_t *ii; 1655 ii = xcalloc(sizeof (iidesc_t)); [all...] |
H A D | fixup_tdescs.c | 168 iidesc_t *iidesc = arg1;
|
H A D | ctf.c | 166 write_objects(iidesc_t *idp, ctf_buf_t *b) 180 write_functions(iidesc_t *idp, ctf_buf_t *b) 903 iidesc_t *ii; 941 iidesc_t *ii; 1242 iidesc_t *ii = iidesc_new(tdp->t_name);
|
Completed in 123 milliseconds