Lines Matching defs:available
1077 int64_t credit, available, lower_bound, upper_bound;
1242 available = result[i]
1244 if (available >= -credit) {
1248 result[i] -= available;
1249 credit += available;
1274 int64_t *available;
1299 available = malloc((jif->jif_maxpri+1)*sizeof(int64_t), M_DEVBUF, M_WAITOK);
1300 if (available == NULL)
1336 available[i] = n[i]-k[i]/c[i];
1345 available[i] = -((int64_t)bps_to_internal((u_int64_t)jif->jif_bandwidth));
1352 if (n[i] - cl->cl_arc < available[i])
1353 available[i] = n[i]
1362 available[i] = n[i] - cl->cl_arc;
1369 available[i] = n[i];
1377 available[i] = cl->service_rate;
1379 available[i] = 0;
1388 while (highest < jif->jif_maxpri+1 && available[highest] >= 0)
1390 while (lowest > 0 && available[lowest] <= 0)
1395 if (available[lowest]+available[highest] > 0) {
1400 n[lowest] += available[highest];
1401 n[highest] -= available[highest];
1402 available[lowest] += available[highest];
1403 available[highest] = 0;
1406 && available[highest] >= 0)
1409 } else if (available[lowest]+available[highest] == 0) {
1411 n[lowest] += available[highest];
1412 n[highest] -= available[highest];
1413 available[highest] = 0;
1414 available[lowest] = 0;
1417 && available[highest] >= 0)
1419 while (lowest >= 0 && available[lowest] <= 0)
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))
1460 if (is_backlogged && available[i] < 0) {
1527 free(available, M_DEVBUF);
1532 free(available, M_DEVBUF);
1823 printf("jobs: no CPU clock available!\n");