Lines Matching defs:lowest
1274 int lowest, highest;
1384 lowest = jif->jif_maxpri;
1388 while (lowest > 0 && available[lowest] <= 0)
1389 lowest--; /* which is the lowest class that needs less service? */
1391 while (highest != jif->jif_maxpri+1 && lowest != -1) {
1392 /* give the excess service from lowest to highest */
1393 if (available[lowest]+available[highest] > 0) {
1398 n[lowest] += available[highest];
1400 available[lowest] += available[highest];
1407 } else if (available[lowest]+available[highest] == 0) {
1409 n[lowest] += available[highest];
1412 available[lowest] = 0;
1417 while (lowest >= 0 && available[lowest] <= 0)
1418 lowest--; /* which is the lowest class that needs less service? */
1420 } else if (available[lowest]+available[highest] < 0) {
1425 n[lowest] -= available[lowest];
1426 n[highest] += available[lowest];
1427 available[highest] += available[lowest];
1428 available[lowest] = 0;
1430 while ((lowest >= 0)&&(available[lowest] <= 0))
1431 lowest--; /* which is the lowest class that needs less service? */