214 	pfn_t			lim;  member
342 			khi = lp->lim;  in kcage_next_range()
417 	pfn_t lim;  in kcage_range_add_internal()  local
425 	lim = base + npgs;  in kcage_range_add_internal()
427 	ASSERT(lim > base);  in kcage_range_add_internal()
428 	if (lim <= base)  in kcage_range_add_internal()
437 	new->lim = lim;  in kcage_range_add_internal()
440 		new->curr = new->lim;  in kcage_range_add_internal()
450 		ret = kcage_glist_delete((*lpp)->base, (*lpp)->lim, &new);  in kcage_range_add_internal()
483 	pfn_t lim;  in kcage_range_delete_internal()  local
491 	lim = base + npgs;  in kcage_range_delete_internal()
493 	ASSERT(lim > base);  in kcage_range_delete_internal()
494 	if (lim <= base)  in kcage_range_delete_internal()
508 		    (lp->decr != 0 && lp->curr == lp->lim))  in kcage_range_delete_internal()
513 		if (base >= lp->lim || lim <= lp->base)  in kcage_range_delete_internal()
519 		if (lp->decr == 0 && base < lp->curr && lim >= lp->base) {  in kcage_range_delete_internal()
522 		if (lp->decr != 0 && base < lp->lim && lim >= lp->curr) {  in kcage_range_delete_internal()
526 	return (kcage_glist_delete(base, lim, &kcage_glist));  in kcage_range_delete_internal()
548 	pfn_t lim;  in kcage_range_delete_post_mem_del_internal()  local
556 	lim = base + npgs;  in kcage_range_delete_post_mem_del_internal()
558 	ASSERT(lim > base);  in kcage_range_delete_post_mem_del_internal()
559 	if (lim <= base)  in kcage_range_delete_post_mem_del_internal()
562 	return (kcage_glist_delete(base, lim, &kcage_glist));  in kcage_range_delete_post_mem_del_internal()
612 kcage_glist_delete(pfn_t base, pfn_t lim, struct kcage_glist **lpp)  in kcage_glist_delete()  argument
617 		if (lim > lp->base && base < lp->lim) {  in kcage_glist_delete()
619 			if (base <= lp->base && lim >= lp->lim) {  in kcage_glist_delete()
632 			if (base > lp->base && lim < lp->lim) {  in kcage_glist_delete()
652 					new->lim = base;  in kcage_glist_delete()
655 					lp->base = lim;  in kcage_glist_delete()
657 					new->base = lim;  in kcage_glist_delete()
658 					new->lim = lp->lim;  in kcage_glist_delete()
661 					lp->lim = base;  in kcage_glist_delete()
671 					ASSERT(lim >= lp->lim);  in kcage_glist_delete()
672 					ASSERT(base < lp->lim);  in kcage_glist_delete()
674 					    lp->curr == lp->lim)  in kcage_glist_delete()
676 					lp->lim = base;  in kcage_glist_delete()
679 					ASSERT(lim > lp->base);  in kcage_glist_delete()
682 						lp->curr = lim;  in kcage_glist_delete()
683 					lp->base = lim;  in kcage_glist_delete()
717 			if (lp->curr != lp->lim) {  in kcage_get_pfn()
797 		if (pfn == lp->lim) {  in kcage_walk_cage()
807 		ASSERT(pfn >= lp->curr && pfn < lp->lim);  in kcage_walk_cage()
1041 			if (lp->curr != lp->lim) {  in kcage_kstat_update()
1079 			if (lp->curr != lp->lim) {  in kcage_kstat_snapshot()
1081 				kspmem->size = ptob(lp->lim - lp->curr);  in kcage_kstat_snapshot()