Lines Matching defs:sorted
1326 dt_ahashent_t *h, **sorted;
1333 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1335 if (sorted == NULL)
1339 sorted[i++] = h;
1344 dt_aggregate_qsort(dtp, sorted, nentries,
1352 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1358 h = sorted[i];
1361 dt_free(dtp, sorted);
1366 dt_free(dtp, sorted);
1446 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle;
1725 * allocate our sorted array, and take another pass over the data to
1728 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1730 if (sorted == NULL)
1739 sorted[i++] = h;
1752 qsort(sorted, nentries, sizeof (dt_ahashent_t *),
1757 * of bundles is bounded by the size of the sorted array, we're going
1764 bundle = (dt_ahashent_t ***)sorted;
1768 dt_aggregate_keycmp(&sorted[i], &sorted[i - 1]) == 0)
1784 dtrace_aggvarid_t id = dt_aggregate_aggvarid(sorted[j]);
1790 nbundle[map[id] - 1] = sorted[j];
1793 nbundle[naggvars] = sorted[j];
1832 * We're done! Now we just need to go back over the sorted bundles,
1877 dt_free(dtp, sorted);