Lines Matching defs:lim
214 pfn_t lim;
342 khi = lp->lim;
417 pfn_t lim;
425 lim = base + npgs;
427 ASSERT(lim > base);
428 if (lim <= base)
437 new->lim = lim;
440 new->curr = new->lim;
450 ret = kcage_glist_delete((*lpp)->base, (*lpp)->lim, &new);
483 pfn_t lim;
491 lim = base + npgs;
493 ASSERT(lim > base);
494 if (lim <= base)
508 (lp->decr != 0 && lp->curr == lp->lim))
513 if (base >= lp->lim || lim <= lp->base)
519 if (lp->decr == 0 && base < lp->curr && lim >= lp->base) {
522 if (lp->decr != 0 && base < lp->lim && lim >= lp->curr) {
526 return (kcage_glist_delete(base, lim, &kcage_glist));
548 pfn_t lim;
556 lim = base + npgs;
558 ASSERT(lim > base);
559 if (lim <= base)
562 return (kcage_glist_delete(base, lim, &kcage_glist));
612 kcage_glist_delete(pfn_t base, pfn_t lim, struct kcage_glist **lpp)
617 if (lim > lp->base && base < lp->lim) {
619 if (base <= lp->base && lim >= lp->lim) {
632 if (base > lp->base && lim < lp->lim) {
652 new->lim = base;
655 lp->base = lim;
657 new->base = lim;
658 new->lim = lp->lim;
661 lp->lim = base;
671 ASSERT(lim >= lp->lim);
672 ASSERT(base < lp->lim);
674 lp->curr == lp->lim)
676 lp->lim = base;
679 ASSERT(lim > lp->base);
682 lp->curr = lim;
683 lp->base = lim;
717 if (lp->curr != lp->lim) {
779 * Arrange to return pfns from curr to lim-1,
797 if (pfn == lp->lim) {
807 ASSERT(pfn >= lp->curr && pfn < lp->lim);
1041 if (lp->curr != lp->lim) {
1079 if (lp->curr != lp->lim) {
1081 kspmem->size = ptob(lp->lim - lp->curr);