(program_id + 1) * sizeof (program_metrics_t));
for (i = ctx->num_program_metrics; i < program_id + 1; i++) {
ctx->program_metrics[i].id = i;
(program_id + 1) * sizeof (program_metrics_t));
for (i = ctx->num_program_metrics; i < program_id + 1; i++) {
ctx->program_metrics[i].id = i;
sorted = calloc(ctx->num_program_metrics, sizeof(*sorted));
for (i = 0; i < ctx->num_program_metrics; i++) {
sorted[i] = i;
sorted = calloc(ctx->num_program_metrics, sizeof(*sorted));
for (i = 0; i < ctx->num_program_metrics; i++) {
sorted[i] = i;
}
qsort_r(sorted, ctx->num_program_metrics, sizeof(*sorted),
time_compare, ctx->program_metrics);
}
qsort_r(sorted, ctx->num_program_metrics, sizeof(*sorted),
time_compare, ctx->program_metrics);
/* Since we sparsely fill the array based on program
* id, many "programs" have no time.
*/
/* Since we sparsely fill the array based on program
* id, many "programs" have no time.
*/
- metric->id, metric->ticks / 1e6,
- metric->ticks / total * 100);
+ metric->id, metric->time_ns / 1e6,
+ metric->time_ns / total * 100);