Lines Matching defs:sorted
1534 dt_ahashent_t *h, **sorted;
1558 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1560 if (sorted == NULL)
1564 sorted[i++] = h;
1569 dt_aggregate_qsort(dtp, sorted, nentries,
1577 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1583 h = sorted[i];
1597 dt_free(dtp, sorted);
1677 dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle;
1956 * allocate our sorted array, and take another pass over the data to
1959 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1961 if (sorted == NULL)
1970 sorted[i++] = h;
1983 qsort(sorted, nentries, sizeof (dt_ahashent_t *),
1988 * of bundles is bounded by the size of the sorted array, we're going
1995 bundle = (dt_ahashent_t ***)sorted;
1999 dt_aggregate_keycmp(&sorted[i], &sorted[i - 1]) == 0)
2015 dtrace_aggvarid_t id = dt_aggregate_aggvarid(sorted[j]);
2021 nbundle[map[id] - 1] = sorted[j];
2024 nbundle[naggvars] = sorted[j];
2063 * We're done! Now we just need to go back over the sorted bundles,
2108 dt_free(dtp, sorted);