Lines Matching defs:cg
95 struct pmcstat_cgnode *cg;
97 if ((cg = malloc(sizeof(*cg))) == NULL)
100 cg->pcg_image = image;
101 cg->pcg_func = pc;
103 cg->pcg_count = 0;
104 cg->pcg_nchildren = 0;
105 LIST_INIT(&cg->pcg_children);
107 return (cg);
114 pmcstat_cgnode_free(struct pmcstat_cgnode *cg)
118 LIST_FOREACH_SAFE(cgc, &cg->pcg_children, pcg_sibling, cgtmp)
120 free(cg);
135 struct pmcstat_cgnode *cg;
165 cg = NULL;
171 cg = h->pch_cgnode;
173 assert(cg != NULL);
175 if (cg->pcg_image == image && cg->pcg_func == pc)
176 return (cg);
183 cg = pmcstat_cgnode_allocate(image, pc);
188 h->pch_cgnode = cg;
193 return (cg);
255 pmcstat_cgnode_print(struct pmcstat_cgnode *cg, int depth, uint32_t total)
267 if (cg->pcg_count == total)
271 100.0 * cg->pcg_count / total);
273 n = fprintf(args.pa_graphfile, " [%u] ", cg->pcg_count);
282 sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
288 (void *) (cg->pcg_image->pi_vaddr + cg->pcg_func));
291 cg->pcg_image->pi_fullpath) {
292 pmcstat_previous_filename_printed = cg->pcg_image->pi_fullpath;
299 if (cg->pcg_nchildren == 0)
304 cg->pcg_nchildren)) == NULL)
308 LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)
311 assert(cgn - sortbuffer == (int) cg->pcg_nchildren);
313 qsort(sortbuffer, cg->pcg_nchildren, sizeof(struct pmcstat_cgnode *),
316 for (cgn = sortbuffer, n = 0; n < cg->pcg_nchildren; n++, cgn++)
317 pmcstat_cgnode_print(*cgn, depth+1, cg->pcg_count);
475 pmcstat_cgnode_topprint(struct pmcstat_cgnode *cg,
485 v = PMCPL_CG_COUNTP(cg);
490 sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
493 (void *)(cg->pcg_image->pi_vaddr + cg->pcg_func));
499 (void *)(cg->pcg_image->pi_vaddr + cg->pcg_func));
504 cg->pcg_func - sym->ps_start);
517 pmcstat_string_unintern(cg->pcg_image->pi_name),
520 nchildren = cg->pcg_nchildren;
534 LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)