Lines Matching refs:inuse
38 * available (by finding the biggest gap). The minimum can be an inuse
44 __db_idspace(inuse, n, minp, maxp)
45 u_int32_t *inuse;
60 if (inuse[0] != *maxp)
61 *minp = inuse[0];
62 *maxp = inuse[0] - 1;
68 qsort(inuse, (size_t)n, sizeof(u_int32_t), __db_idcmp);
70 if ((t = (inuse[i + 1] - inuse[i])) > gap) {
76 if ((*maxp - inuse[n - 1]) + (inuse[0] - *minp) > gap) {
78 if (inuse[n - 1] != *maxp)
79 *minp = inuse[n - 1];
80 *maxp = inuse[0] - 1;
82 *minp = inuse[low];
83 *maxp = inuse[low + 1] - 1;