PRI_HIGHEST_TS
for (p = 0; p <= PRI_HIGHEST_TS; p++) {
high_pri[p] = (PRI_HIGHEST_TS - PRI_HTS_RANGE) +
for (p = (PRI_HIGHEST_TS + 1); p < PRI_COUNT; p++) {
pri = (n < 0) ? uimin(pri, PRI_HIGHEST_TS) : imax(pri, 0);
if (l->l_priority < PRI_HIGHEST_TS && (l->l_flag & LW_BATCH) == 0) {
l->l_priority = uimin(l->l_priority + n, PRI_HIGHEST_TS);
if (l->l_priority >= PRI_HIGHEST_TS)
KASSERT(l->l_priority > PRI_HIGHEST_TS);
KASSERT(l->l_priority <= PRI_HIGHEST_TS);