Lines Matching refs:sort
40 -x columns (horizontal sort) -ll long with nanoseconds (--full-time)
248 // Horizontal sort is easy
254 // vertical sort
309 struct dirtree *dt, **sort;
344 // Copy linked list to array and sort it. Directories go in array because
347 for (sort = 0;;sort = xmalloc(dtlen*sizeof(void *))) {
349 if (sort) sort[dtlen] = dt;
350 if (sort || !dtlen) break;
367 qsort(sort, dtlen, sizeof(void *), (void *)compare);
369 entrylen(sort[ul], len);
372 blocks += sort[ul]->st.st_blocks;
395 entrylen(sort[next_column(ul, dtlen, columns, &c)], len);
417 struct stat *st = &(sort[next]->st);
429 entrylen(sort[next], len);
480 printf(" %-*s "+!FLAG(l), -(int)totals[7], (char *)sort[next]->extra);
511 ss = sort[next]->name;
520 if (fstatat(dirfd, sort[next]->symlink, &st2, 0)) color = 256+31;
526 zprint(zap, "s", 0, (unsigned long)sort[next]->symlink);
543 for (ul = 0; ul<dtlen; free(sort[ul++])) {
544 if ((flags & FLAG_d) || !S_ISDIR(sort[ul]->st.st_mode)) continue;
547 if (!indir->parent || ((flags&FLAG_R) && dirtree_notdotdot(sort[ul])))
548 listfiles(openat(dirfd, sort[ul]->name, 0), sort[ul]);
549 free((void *)sort[ul]->extra);
551 free(sort);