Searched refs:rank (Results 1 - 4 of 4) sorted by relevance

/ast/src/cmd/coshell/
H A Dschedule.c37 #define H_RANK 85 /* rank hysterisis % */
38 #define X_RANK RANK /* maximum rank w/o toss */
240 if (!ap->home && (!xp || ap->temp < PCT(xp->temp, H_TEMP) || (ap->mode & SHELL_DENIED) || matched && xm && PCT(ap->temp, H_TEMP) < xp->temp && ap->rank > xp->rank))
287 else if (!ap->fd && (!mp || ap->rank < mp->rank) && (IDLE(ap->stat.idle, ap->idle) || ap->home || ap->bypass && miscmatch(ap, ap->bypass) || ((a->set | op) & (SETMISC|DEF|NEW|SET)) == SETMISC)) mp = ap;
295 if (!xp->running && (nopen - xp->cpu >= state.pool + noverride || state.open - xp->cpu >= state.fdtotal / 2 || xp == dp && cs.time > dt && (!xm || !mp || mp->rank < PCT(xp->rank, H_RANK))))
516 sp->rank = n * 100 + (TOSS>>7) % 100;
525 message((-4, "%s: %s=%s idle=%s load=%s users=%d rank
[all...]
H A Dservice.h57 unsigned long rank; /* scheduling rank */ \
109 #define RANK 30000 /* worst rank w/o toss */
H A Dshell.c166 sp->rank = RANK * 100;
/ast/src/lib/libz/
H A Dtrees.c842 int rank; /* index in bl_order */ local
851 for (rank = 0; rank < blcodes; rank++) {
852 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
853 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);

Completed in 23 milliseconds