Lines Matching defs:highest
1276 int lowest, highest;
1385 highest = 0;
1388 while (highest < jif->jif_maxpri+1 && available[highest] >= 0)
1389 highest++; /* which is the highest class that needs more 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) {
1398 * give all that is needed by "highest"
1400 n[lowest] += available[highest];
1401 n[highest] -= available[highest];
1402 available[lowest] += available[highest];
1403 available[highest] = 0;
1405 while (highest < jif->jif_maxpri+1
1406 && available[highest] >= 0)
1407 highest++; /* which is the highest class that needs more service now? */
1409 } else if (available[lowest]+available[highest] == 0) {
1411 n[lowest] += available[highest];
1412 n[highest] -= available[highest];
1413 available[highest] = 0;
1416 while (highest < jif->jif_maxpri+1
1417 && available[highest] >= 0)
1418 highest++; /* which is the highest class that needs more service? */
1422 } else if (available[lowest]+available[highest] < 0) {
1428 n[highest] += available[lowest];
1429 available[highest] += available[lowest];
1453 if (highest != jif->jif_maxpri+1) {
Indexes created Mon Oct 20 11:09:49 GMT 2025