sort
sort();
sort();
sort();
static void sort(void);
sort();
sort();
sort();
sort();
sort();
sort();
sort();
sort();
static void sort(struct line *, int);
sort(sfile[0], slen[0]);
sort(sfile[1], slen[1]);
Collections.sort(tuples);
Collections.sort(list);
const char *sort = NULL;
sort = databaselist[i].sortattr;
sort = databaselist[i].sortattr;
sort, merge_SSD_filter, (const char **)ldapattribute, NULL,
sort(ap);
static void sort(char **list);
sort(ap);
Arrays.sort(scoresArray,
extern int endpush, sort, labels, keywant, bare;
int sort = 0;
if (sort && !labels) {
if (sort && !labels)
sort++;
if (sort)
if (sort)
if (sort)
if (sort) {
goto sort;
sort: splitp = off;
static Sym_desc **sort;
if ((sort = libld_malloc(nsize)) == NULL)
(void) memcpy((void *)sort, &ifl->ifl_oldndx[local], nsize);
qsort(sort, (total - local), sizeof (Sym_desc *), compare);
Sym_desc *wsdp = sort[ndx];
Sym_desc *ssdp = sort[sndx];
if (sort->s_queue == NULL) {
lmp = sort->s_lmp;
if (aplist_append(&sort->s_queue, lmp, sort->s_num) == NULL)
for (APLIST_TRAVERSE(sort->s_queue, idx1, lmp2)) {
if (aplist_append(&sort->s_queue, lmp3,
sort->s_num) == NULL)
qsort(&(sort->s_lmpa[fndx]), sort->s_lndx - fndx, sizeof (Rt_map *),
for (ndx = fndx; ndx < sort->s_lndx; ndx++) {
lmp = sort->s_lmpa[ndx];
for (ndx = sort->s_lndx - 1; ndx >= fndx; ndx--) {
lmp = sort->s_lmpa[ndx];
for (ndx = fndx; ndx < sort->s_lndx; ndx++) {
lmp = sort->s_lmpa[ndx];
for (ndx = fndx; ndx < sort->s_lndx; ndx++) {
lmp = sort->s_lmpa[ndx];
visit(Lm_list *lml, Rt_map *lmp, Sort *sort, int flag)
int num = sort->s_lndx;
tlmp = sort->s_stack[--(sort->s_sndx)];
SORTVAL(tlmp) = sort->s_num;
DBG_CALL(Dbg_util_collect(tlmp, sort->s_lndx, flag));
sort->s_lmpa[(sort->s_lndx)++] = tlmp;
if (sort->s_lndx > (num + 1)) {
if (sort_scc(sort, num, flag) == 0)
if (tracing && (aplist_append(&sort->s_scc, alp,
Sort *sort, int flag)
sort, flag)) == -1)
DBG_CALL(Dbg_util_edge_out(clmp, sort->s_stack[_min]));
dep_visit(Lm_list *lml, Rt_map *clmp, uint_t cbflags, Rt_map *lmp, Sort *sort,
min = SORTVAL(lmp) = sort->s_sndx;
sort->s_stack[(sort->s_sndx)++] = lmp;
sort->s_initfirst++;
bdp->b_flags, sort, flag)) == -1)
sort, flag)) == -1)
if (visit(lml, lmp, sort, flag) == 0)
trace_find_scc(Sort *sort, Rt_map *lmp)
for (APLIST_TRAVERSE(sort->s_scc, idx1, alp)) {
trace_sort(Sort *sort)
while ((lmp1 = sort->s_lmpa[ndx++]) != NULL) {
if ((alp = trace_find_scc(sort, lmp1)) == NULL) {
r_initfirst(Sort * sort, int end)
for (bgn = 0; bgn < sort->s_initfirst; bgn++) {
tlmp = sort->s_lmpa[ifst];
(void) memmove(&sort->s_lmpa[bgn + 1],
&sort->s_lmpa[bgn],
sort->s_lmpa[bgn] = tlmp;
f_initfirst(Sort *sort, int end)
for (bgn = 0; bgn < sort->s_initfirst; bgn++) {
tlmp = sort->s_lmpa[ifst];
(void) memmove(&sort->s_lmpa[ifst],
&sort->s_lmpa[ifst + 1],
sort->s_lmpa[end--] = tlmp;
initorfini(Lm_list *lml, Rt_map *lmp, int flag, Sort *sort)
if (dep_visit(lml, 0, 0, lmp, sort, flag) == -1)
if (dep_visit(lml, 0, 0, lmp, sort, flag) == -1)
Sort sort = { 0 };
sort.s_lmp = lmp;
sort.s_num = num + 1;
size = sort.s_num * sizeof (Rt_map *);
if ((sort.s_lmpa = calloc(2, size)) == NULL)
sort.s_stack = (Rt_map **)((uintptr_t)sort.s_lmpa + size);
&sort) != 0)
if (initorfini(lml, _lmp, flag, &sort) != 0)
int bgn = 0, end = sort.s_lndx - 1;
Rt_map *tlmp = sort.s_lmpa[end];
sort.s_lmpa[end] = sort.s_lmpa[bgn];
sort.s_lmpa[bgn] = tlmp;
if (sort.s_initfirst) {
r_initfirst(&sort, sort.s_lndx - 1);
f_initfirst(&sort, sort.s_lndx - 1);
trace_sort(&sort);
if (sort.s_queue) {
for (APLIST_TRAVERSE(sort.s_queue, idx, lmp2))
free(sort.s_queue);
if (sort.s_scc) {
for (APLIST_TRAVERSE(sort.s_scc, idx, alp))
free(sort.s_scc);
return (sort.s_lmpa);
sort_scc(Sort *sort, int fndx, int flag)
Lm_list *lml = LIST(sort->s_lmp);
Collections.sort(list, new Comparator <AggregationRecord> () {
Collections.sort(a, new Comparator <Aggregation> () {
Collections.sort(recordList, new Comparator <AggregationRecord> () {
{"sort", sort},
extern void zap_leaf_init(zap_leaf_t *l, boolean_t sort);
extern void zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort);
zap_leaf_init(zap_leaf_t *l, boolean_t sort)
if (sort)
zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort)
if (sort)
int16_t sort[ATH9K_NF_CAL_HIST_MAX];
sort[i] = nfCalBuffer[i];
if (sort[j] > sort[j - 1]) {
nfval = sort[j];
sort[j] = sort[j - 1];
sort[j - 1] = nfval;
nfval = sort[(ATH9K_NF_CAL_HIST_MAX - 1) >> 1];