usr.sbin/pmcstat/pmcpl_callgraph.c

94 	struct pmcstat_cgnode *cg;
96 	if ((cg = malloc(sizeof(*cg))) == NULL)
99 	cg->pcg_image = image;
100 	cg->pcg_func = pc;
102 	cg->pcg_count = 0;
103 	cg->pcg_nchildren = 0;
104 	LIST_INIT(&cg->pcg_children);
106 	return (cg);
113 pmcstat_cgnode_free(struct pmcstat_cgnode *cg)
117 	LIST_FOREACH_SAFE(cgc, &cg->pcg_children, pcg_sibling, cgtmp)
119 	free(cg);
134 	struct pmcstat_cgnode *cg;
162 	cg = NULL;
168 		cg = h->pch_cgnode;
170 		assert(cg != NULL);
172 		if (cg->pcg_image == image && cg->pcg_func == pc)
173 			return (cg);
180 	cg = pmcstat_cgnode_allocate(image, pc);
185 	h->pch_cgnode = cg;
190 	return (cg);
252 pmcstat_cgnode_print(struct pmcstat_cgnode *cg, int depth, uint32_t total)
264 	if (cg->pcg_count == total)
268 		    100.0 * cg->pcg_count / total);
270 	n = fprintf(args.pa_graphfile, " [%u] ", cg->pcg_count);
279 	sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
285 		    (void *) (cg->pcg_image->pi_vaddr + cg->pcg_func));
288 	    cg->pcg_image->pi_fullpath) {
289 		pmcstat_previous_filename_printed = cg->pcg_image->pi_fullpath;
296 	if (cg->pcg_nchildren == 0)
301 		    cg->pcg_nchildren)) == NULL)
305 	LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)
308 	assert(cgn - sortbuffer == (int) cg->pcg_nchildren);
310 	qsort(sortbuffer, cg->pcg_nchildren, sizeof(struct pmcstat_cgnode *),
313 	for (cgn = sortbuffer, n = 0; n < cg->pcg_nchildren; n++, cgn++)
314 		pmcstat_cgnode_print(*cgn, depth+1, cg->pcg_count);
472 pmcstat_cgnode_topprint(struct pmcstat_cgnode *cg,
484 	v = PMCPL_CG_COUNTP(cg);
489 	sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
495 		    (void *)cg->pcg_func);
501 	    pmcstat_string_unintern(cg->pcg_image->pi_name),
504 	nchildren = cg->pcg_nchildren;
518 	LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)