xref: /src/sys/uvm/uvm_page_array.c

/*	$NetBSD: uvm_page_array.c,v 1.1.2.5 2012/04/18 13:40:44 yamt Exp $	*/

/*-
 * Copyright (c)2011 YAMAMOTO Takashi,
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: uvm_page_array.c,v 1.1.2.5 2012/04/18 13:40:44 yamt Exp $");

#include <sys/param.h>
#include <sys/systm.h>

#include <uvm/uvm_extern.h>
#include <uvm/uvm_object.h>
#include <uvm/uvm_page.h>
#include <uvm/uvm_page_array.h>

/*
 * uvm_page_array_init: initialize the array.
 */

void
uvm_page_array_init(struct uvm_page_array *ar)
{

	ar->ar_idx = ar->ar_npages = 0;
}

/*
 * uvm_page_array_fini: clean up the array.
 */

void
uvm_page_array_fini(struct uvm_page_array *ar)
{

	/*
	 * currently nothing to do.
	 */
#if defined(DIAGNOSTIC)
	/*
	 * poison to trigger assertion in uvm_page_array_peek to
	 * detect usage errors.
	 */
	ar->ar_npages = 1;
	ar->ar_idx = 1000;
#endif /* defined(DIAGNOSTIC) */
}

/*
 * uvm_page_array_clear: forget the cached pages and initialize the array.
 */

void
uvm_page_array_clear(struct uvm_page_array *ar)
{

	KASSERT(ar->ar_idx <= ar->ar_npages);
	uvm_page_array_init(ar);
}

/*
 * uvm_page_array_peek: return the next cached page.
 */

struct vm_page *
uvm_page_array_peek(struct uvm_page_array *ar)
{

	KASSERT(ar->ar_idx <= ar->ar_npages);
	if (ar->ar_idx == ar->ar_npages) {
		return NULL;
	}
	return ar->ar_pages[ar->ar_idx];
}

/*
 * uvm_page_array_advance: advance the array to the next cached page
 */

void
uvm_page_array_advance(struct uvm_page_array *ar)
{

	KASSERT(ar->ar_idx <= ar->ar_npages);
	ar->ar_idx++;
	KASSERT(ar->ar_idx <= ar->ar_npages);
}

/*
 * uvm_page_array_fill: lookup pages and keep them cached.
 *
 * return 0 on success.  in that case, cache the result in the array
 * so that they will be picked by later uvm_page_array_peek.
 *
 * nwant is a number of pages to fetch.  a caller should consider it a hint.
 * nwant == 0 means a caller have no specific idea.
 *
 * return ENOENT if no pages are found.
 *
 * called with object lock held.
 */

int
uvm_page_array_fill(struct uvm_page_array *ar, struct uvm_object *uobj,
    voff_t off, unsigned int nwant, unsigned int flags)
{
	unsigned int npages;
#if defined(DEBUG)
	unsigned int i;
#endif /* defined(DEBUG) */
	unsigned int maxpages = __arraycount(ar->ar_pages);
	const bool dense = (flags & UVM_PAGE_ARRAY_FILL_DENSE) != 0;
	const bool backward = (flags & UVM_PAGE_ARRAY_FILL_BACKWARD) != 0;

	if (nwant != 0 && nwant < maxpages) {
		maxpages = nwant;
	}
#if 0 /* called from DDB for "show obj/f" without lock */
	KASSERT(mutex_owned(uobj->vmobjlock));
#endif
	KASSERT(uvm_page_array_peek(ar) == NULL);
	if ((flags & UVM_PAGE_ARRAY_FILL_DIRTYONLY) != 0) {
		npages =
		    (backward ? radix_tree_gang_lookup_tagged_node_reverse :
		    radix_tree_gang_lookup_tagged_node)(
		    &uobj->uo_pages, off >> PAGE_SHIFT, (void **)ar->ar_pages,
		    maxpages, dense, UVM_PAGE_DIRTY_TAG);
	} else {
		npages =
		    (backward ? radix_tree_gang_lookup_node_reverse :
		    radix_tree_gang_lookup_node)(
		    &uobj->uo_pages, off >> PAGE_SHIFT, (void **)ar->ar_pages,
		    maxpages, dense);
	}
	if (npages == 0) {
		uvm_page_array_clear(ar);
		return ENOENT;
	}
	KASSERT(npages <= maxpages);
	ar->ar_npages = npages;
	ar->ar_idx = 0;
#if defined(DEBUG)
	for (i = 0; i < ar->ar_npages; i++) {
		struct vm_page * const pg = ar->ar_pages[i];

		KASSERT(pg != NULL);
		KASSERT(pg->uobject == uobj);
		if (backward) {
			KASSERT(pg->offset <= off);
			KASSERT(i == 0 ||
			    pg->offset < ar->ar_pages[i - 1]->offset);
		} else {
			KASSERT(pg->offset >= off);
			KASSERT(i == 0 ||
			    pg->offset > ar->ar_pages[i - 1]->offset);
		}
	}
#endif /* defined(DEBUG) */
	return 0;
}

/*
 * uvm_page_array_fill_and_peek:
 * same as uvm_page_array_peek except that, if the array is empty, try to fill
 * it first.
 */

struct vm_page *
uvm_page_array_fill_and_peek(struct uvm_page_array *a, struct uvm_object *uobj,
    voff_t off, unsigned int nwant, unsigned int flags)
{
	struct vm_page *pg;
	int error;

	pg = uvm_page_array_peek(a);
	if (pg != NULL) {
		return pg;
	}
	error = uvm_page_array_fill(a, uobj, off, nwant, flags);
	if (error != 0) {
		return NULL;
	}
	pg = uvm_page_array_peek(a);
	KASSERT(pg != NULL);
	return pg;
}