Lines Matching defs:lowest
1276 int lowest, highest;
1386 lowest = jif->jif_maxpri;
1390 while (lowest > 0 && available[lowest] <= 0)
1391 lowest--; /* which is the lowest class that needs less service? */
1393 while (highest != jif->jif_maxpri+1 && lowest != -1) {
1394 /* give the excess service from lowest to highest */
1395 if (available[lowest]+available[highest] > 0) {
1400 n[lowest] += available[highest];
1402 available[lowest] += available[highest];
1409 } else if (available[lowest]+available[highest] == 0) {
1411 n[lowest] += available[highest];
1414 available[lowest] = 0;
1419 while (lowest >= 0 && available[lowest] <= 0)
1420 lowest--; /* which is the lowest class that needs less service? */
1422 } else if (available[lowest]+available[highest] < 0) {
1427 n[lowest] -= available[lowest];
1428 n[highest] += available[lowest];
1429 available[highest] += available[lowest];
1430 available[lowest] = 0;
1432 while ((lowest >= 0)&&(available[lowest] <= 0))
1433 lowest--; /* which is the lowest class that needs less service? */
Indexes created Tue Oct 14 21:09:58 GMT 2025