119 	struct vm_page *pg;  in uvm_pgflcache_fill()  local
140 	pg = LIST_FIRST(head);  in uvm_pgflcache_fill()
141 	while (__predict_true(pg != NULL && count < FILLPGS)) {  in uvm_pgflcache_fill()
142 		KASSERT(pg->flags & PG_FREE);  in uvm_pgflcache_fill()
143 		KASSERT(uvm_page_get_bucket(pg) == b);  in uvm_pgflcache_fill()
144 		pcc->pages[count++] = pg;  in uvm_pgflcache_fill()
145 		pg = LIST_NEXT(pg, pageq.list);  in uvm_pgflcache_fill()
149 	head->lh_first = pg;  in uvm_pgflcache_fill()
150 	if (__predict_true(pg != NULL)) {  in uvm_pgflcache_fill()
151 		pg->pageq.list.le_prev = &head->lh_first;  in uvm_pgflcache_fill()
208 	struct vm_page *pg;  in uvm_pgflcache_alloc()  local
220 	pg = pcc->pages[--(pcc->count)];  in uvm_pgflcache_alloc()
221 	KASSERT(pg != NULL);  in uvm_pgflcache_alloc()
222 	KASSERT(pg->flags == PG_FREE);  in uvm_pgflcache_alloc()
223 	KASSERT(uvm_page_get_freelist(pg) == fl);  in uvm_pgflcache_alloc()
224 	KASSERT(uvm_page_get_bucket(pg) == ucpu->pgflbucket);  in uvm_pgflcache_alloc()
225 	pg->flags = PG_BUSY | PG_CLEAN | PG_FAKE;  in uvm_pgflcache_alloc()
226 	return pg;  in uvm_pgflcache_alloc()
237 uvm_pgflcache_free(struct uvm_cpu *ucpu, struct vm_page *pg)  in uvm_pgflcache_free()  argument
243 	KASSERT(uvm_page_get_bucket(pg) == ucpu->pgflbucket);  in uvm_pgflcache_free()
246  	fl = uvm_page_get_freelist(pg);  in uvm_pgflcache_free()
252 	c = VM_PGCOLOR(pg);  in uvm_pgflcache_free()
254 	KASSERT((pg->flags & PG_FREE) == 0);  in uvm_pgflcache_free()
258 	pg->flags = PG_FREE;  in uvm_pgflcache_free()
259 	pcc->pages[pcc->count] = pg;  in uvm_pgflcache_free()
425 uvm_pgflcache_free(struct uvm_cpu *ucpu, struct vm_page *pg)  in uvm_pgflcache_free()  argument