pv_list
KASSERT(SLIST_NEXT(pv0, pv_list) == NULL || pv0->pv_pa < SLIST_NEXT(pv0, pv_list)->pv_pa);
pv = SLIST_NEXT(pv0, pv_list);
SLIST_REMOVE_AFTER(pv0, pv_list);
SLIST_INSERT_HEAD(&bmi->bmi_freechunks, pv, pv_list);
pvp = &SLIST_NEXT(*pvp, pv_list);
SLIST_REMOVE_HEAD(&bmi->bmi_freechunks, pv_list);
SLIST_NEXT(new_pv, pv_list) = *pvp;
if (SLIST_NEXT(new_pv, pv_list)) {
VPRINTF("before pa %#lx\n", SLIST_NEXT(new_pv, pv_list)->pv_pa);
SLIST_INSERT_HEAD(&bmi->bmi_freechunks, &chunks[i], pv_list);
SLIST_FOREACH(lpv, &bmi->bmi_chunks, pv_list) {
pv = SLIST_NEXT(pv, pv_list);
pv = SLIST_NEXT(pv, pv_list);
pv = SLIST_NEXT(pv, pv_list);
SLIST_FOREACH(pv, &kernel_pt_list, pv_list) {
SLIST_INSERT_HEAD(&kernel_pt_list, l2pv, pv_list);
SLIST_REMOVE_HEAD(&pmap_boot_freeq, pv_list);
for (; (npv = SLIST_NEXT(pv, pv_list)) != NULL;
SLIST_INSERT_AFTER(pv, newpv, pv_list);
SLIST_REMOVE_AFTER(newpv, pv_list);
SLIST_INSERT_AFTER(pv, newpv, pv_list);
SLIST_INSERT_HEAD(&pmap_boot_freeq, newpv, pv_list);
pvp = &SLIST_NEXT(pv, pv_list)) {
*pvp = SLIST_NEXT(pv, pv_list);
SLIST_NEXT(pv, pv_list) = newpv;
pvp = &SLIST_NEXT(pv, pv_list)) {
if (SLIST_NEXT(pv, pv_list) == NULL)
SLIST_ENTRY(pv_addr) pv_list;
TAILQ_FOREACH(pv, &m->mdpage.pv_list, pv_list) {
TAILQ_REMOVE(&m->mdpage.pv_list, pv, pv_list);
TAILQ_INSERT_TAIL(&m->mdpage.pv_list, pv, pv_list);
TAILQ_FOREACH(pv, &pg->mdpage.pv_list, pv_list) {
TAILQ_FOREACH(pv, &pg->mdpage.pv_list, pv_list) {
TAILQ_FOREACH(pv, &pg->mdpage.pv_list, pv_list) {
TAILQ_FOREACH(pv, &pg->mdpage.pv_list, pv_list) {
TAILQ_FOREACH(pv, &pg->mdpage.pv_list, pv_list) {
while ((pv = TAILQ_FIRST(&m->mdpage.pv_list)) != NULL) {
TAILQ_REMOVE(&m->mdpage.pv_list, pv, pv_list);
TAILQ_INSERT_TAIL(&m->mdpage.pv_list, pv, pv_list);
TAILQ_ENTRY(pv_entry) pv_list;
TAILQ_HEAD(,pv_entry) pv_list;
TAILQ_INIT(&(pg)->mdpage.pv_list); \
void pv_list(paddr_t, int);
struct pv_entry *pv_list;
tmp = pv_list;
pv_list = tmp->pv_next;
pv->pv_next = pv_list;
pv_list = pv;
pv[count - 1].pv_next = pv_list;
pv_list = pv;