| vm_pager.h (3c4dd3568f411b4f00f795929afb77ca972c2325) | vm_pager.h (05f0fdd26aa1789c04ae89358880922a54d197c3) |
|---|---|
| 1 2/* 3 * Copyright (c) 1990 University of Utah. 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * the Systems Programming Group of the University of Utah Computer --- 23 unchanged lines hidden (view full) --- 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * @(#)vm_pager.h 8.4 (Berkeley) 1/12/94 | 1 2/* 3 * Copyright (c) 1990 University of Utah. 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * the Systems Programming Group of the University of Utah Computer --- 23 unchanged lines hidden (view full) --- 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * @(#)vm_pager.h 8.4 (Berkeley) 1/12/94 |
| 40 * $Id$ | 40 * $Id: vm_pager.h,v 1.3 1994/08/02 07:55:36 davidg Exp $ |
| 41 */ 42 43/* 44 * Pager routine interface definition. 45 * For BSD we use a cleaner version of the internal pager interface. 46 */ 47 48#ifndef _VM_PAGER_ --- 71 unchanged lines hidden (view full) --- 120vm_page_t vm_pager_atop __P((vm_offset_t)); 121void vm_pager_deallocate __P((vm_pager_t)); 122int vm_pager_get_pages 123 __P((vm_pager_t, vm_page_t *, int, int, boolean_t)); 124boolean_t vm_pager_has_page __P((vm_pager_t, vm_offset_t)); 125void vm_pager_init __P((void)); 126vm_pager_t vm_pager_lookup __P((struct pagerlst *, caddr_t)); 127vm_offset_t vm_pager_map_pages __P((vm_page_t *, int, boolean_t)); | 41 */ 42 43/* 44 * Pager routine interface definition. 45 * For BSD we use a cleaner version of the internal pager interface. 46 */ 47 48#ifndef _VM_PAGER_ --- 71 unchanged lines hidden (view full) --- 120vm_page_t vm_pager_atop __P((vm_offset_t)); 121void vm_pager_deallocate __P((vm_pager_t)); 122int vm_pager_get_pages 123 __P((vm_pager_t, vm_page_t *, int, int, boolean_t)); 124boolean_t vm_pager_has_page __P((vm_pager_t, vm_offset_t)); 125void vm_pager_init __P((void)); 126vm_pager_t vm_pager_lookup __P((struct pagerlst *, caddr_t)); 127vm_offset_t vm_pager_map_pages __P((vm_page_t *, int, boolean_t)); |
| 128vm_offset_t vm_pager_map_page __P((vm_page_t)); |
|
| 128int vm_pager_put_pages 129 __P((vm_pager_t, vm_page_t *, int, boolean_t, int *)); 130void vm_pager_sync __P((void)); 131void vm_pager_unmap_pages __P((vm_offset_t, int)); | 129int vm_pager_put_pages 130 __P((vm_pager_t, vm_page_t *, int, boolean_t, int *)); 131void vm_pager_sync __P((void)); 132void vm_pager_unmap_pages __P((vm_offset_t, int)); |
| 133void vm_pager_unmap_page __P((vm_offset_t)); |
|
| 132 133#define vm_pager_cancluster(p, b) ((p)->pg_flags & (b)) 134 135/* 136 * XXX compat with old interface 137 */ 138#define vm_pager_get(p, m, s) \ 139({ \ --- 16 unchanged lines hidden --- | 134 135#define vm_pager_cancluster(p, b) ((p)->pg_flags & (b)) 136 137/* 138 * XXX compat with old interface 139 */ 140#define vm_pager_get(p, m, s) \ 141({ \ --- 16 unchanged lines hidden --- |