Lines Matching refs:next
754 * next time, page_lock() will be called,
1663 * next time.
2395 * Get lgroup to allocate next page of shared memory
2717 * next time. Also, since only one page
3659 *ppp = pp->p_next; /* go to next page */
3739 * return the next page in the page list
3784 *ppp = pp->p_vpnext; /* go to next page */
5432 * skip to next page
5446 * Get page size, and round up and skip to next page boundary
5505 * unlock pages locked so far and skip to next page.
5589 goto next;
5620 * If so, clear the migrate bit and skip to next
5626 goto next;
5632 * unlock pages locked so far and skip to next page.
5638 goto next;
5650 goto next;
5681 next:
5803 for (seg = memsegs; seg != NULL; seg = seg->next) {
5843 for (seg = memsegs; seg != NULL; seg = seg->next) {
5891 for (seg = memsegs; seg; seg = seg->next) {
5907 seg = seg->next;
5929 * Return the next page in a scan of page_t's, assuming we want
5962 * just move to the next segment with pages.
5966 seg = seg->next;
5979 * Returns next page in list. Note: this function wraps
6031 for (pseg = memsegs; pseg != NULL; pseg = pseg->next) {
6191 struct page_capture_hash_bucket *next;
6283 bp1 = page_capture_hash[i].lists[j].next;
6288 bp1 = bp2->next;
6290 bp2->prev->next = bp1;
6291 bp2->next = head;
6302 bp1 = bp1->next;
6310 head = head->next;
6333 bp = page_capture_hash[index].lists[0].next;
6337 bp->next->prev = bp->prev;
6338 bp->prev->next = bp->next;
6341 bp->next = page_capture_hash[index].lists[1].next;
6343 page_capture_hash[index].lists[1].next = bp;
6344 bp->next->prev = bp;
6361 bp = bp->next;
6435 tp1 = page_capture_hash[index].lists[l].next;
6442 tp1 = tp1->next;
6450 bp1->next = page_capture_hash[index].lists[0].next;
6452 bp1->next->prev = bp1;
6453 page_capture_hash[index].lists[0].next = bp1;
6477 bp2 = page_capture_hash[index].lists[i].next;
6501 bp2 = bp2->next;
6619 * but that does not mean that some of the next steps will not
6777 bp1 = page_capture_hash[index].lists[i].next;
6780 bp1->next->prev = bp1->prev;
6781 bp1->prev->next = bp1->next;
6788 bp1 = bp1->next;
6861 bp1->next = page_capture_hash[index].lists[1].next;
6863 bp1->next->prev = bp1;
6865 page_capture_hash[index].lists[1].next = bp1;
6877 bp2 = page_capture_hash[index].lists[i].next;
6904 bp2 = bp2->next;
7073 bp = page_capture_hash[index].lists[i].next;
7083 bp = bp->next;
7099 page_capture_hash[i].lists[0].next =
7103 page_capture_hash[i].lists[1].next =
7120 * prevent a latent error trap from occurring on the next boot.
7143 bp = page_capture_hash[i].lists[j].next;
7153 bp = bp->next;
7188 bp2 = bp1->next;
7190 bp1->prev->next = page_capture_hash[i].lists[0].next;
7192 page_capture_hash[i].lists[0].next->prev = bp1->prev;
7193 page_capture_hash[i].lists[0].next = bp2;
7194 bp1->next = bp1;
7200 bp1 = page_capture_hash[i].lists[0].next;
7206 page_capture_hash[i].lists[0].next = bp1->next;
7207 bp1->next->prev =
7222 bp1 = page_capture_hash[i].lists[0].next;
7242 bp1 = page_capture_hash[i].lists[0].next;