1579                  unsigned int ihdlr, unsigned int il[], unsigned int n_ready) {  in reorder()  argument
1585    unsigned long sl[n_ready], pl[n_ready], ll[n_ready];  in reorder()
1601    if (n_ready <= 1) return FALSE;  in reorder()
1603    for (n = 0; n < n_ready; n++) {  in reorder()
1638    if (!((rev && r) || (!rev && s))) sort(sl, il, n_ready, rev);  in reorder()
1640    if (!input_only) for (n = 0; n < n_ready; n++) {  in reorder()
1650    if (overlap) sort(pl, il, n_ready, FALSE);  in reorder()
1654       batchcount++; readycount += n_ready; seeknosort += seek / 1024;  in reorder()
1658       if (rev && !r)     {  revcount++; readysorted += n_ready; }  in reorder()
1659       if (!rev && !s)    { sortcount++; readysorted += n_ready; }  in reorder()
1664       for (n = 0; n < n_ready; n++) {  in reorder()
1669                 (u8)SCpnt->lun, k, flushcount, n_ready,  in reorder()
1682    unsigned int k, n, n_ready = 0, il[MAX_MAILBOXES];  in flush_dev()  local
1694       il[n_ready++] = k;  in flush_dev()
1697    if (reorder(j, cursec, ihdlr, il, n_ready)) n_ready = 1;  in flush_dev()
1699    for (n = 0; n < n_ready; n++) {  in flush_dev()