projects / unix-history / blame
| Commit | Line | Data |
|---|---|---|
| 619edcce KM |
1 | /* |
| 2 | * Copyright (c) 1990 University of Utah. | |
| 3 | * Copyright (c) 1991 The Regents of the University of California. | |
| 4 | * All rights reserved. | |
| 5 | * | |
| 6 | * This code is derived from software contributed to Berkeley by | |
| 7 | * the Systems Programming Group of the University of Utah Computer | |
| 8 | * Science Department. | |
| 9 | * | |
| 10 | * %sccs.include.redist.c% | |
| 11 | * | |
| bb7f0d84 | 12 | * @(#)vm_pager.h 7.3 (Berkeley) %G% |
| 619edcce KM |
13 | */ |
| 14 | ||
| 15 | /* | |
| 16 | * Pager routine interface definition. | |
| 17 | * For BSD we use a cleaner version of the internal pager interface. | |
| 18 | */ | |
| 19 | ||
| 20 | #ifndef _VM_PAGER_ | |
| 21 | #define _VM_PAGER_ | |
| 22 | ||
| 619edcce KM |
23 | struct pager_struct { |
| 24 | queue_head_t pg_list; /* links for list management */ | |
| 25 | caddr_t pg_handle; /* external handle (vp, dev, fp) */ | |
| 26 | int pg_type; /* type of pager */ | |
| 27 | struct pagerops *pg_ops; /* pager operations */ | |
| 28 | caddr_t pg_data; /* private pager data */ | |
| 29 | }; | |
| 619edcce | 30 | |
| 619edcce KM |
31 | /* pager types */ |
| 32 | #define PG_DFLT -1 | |
| 33 | #define PG_SWAP 0 | |
| 34 | #define PG_VNODE 1 | |
| 35 | #define PG_DEVICE 2 | |
| 36 | ||
| 37 | struct pagerops { | |
| bb7f0d84 KB |
38 | void (*pgo_init) /* Initialize pager. */ |
| 39 | __P((void)); | |
| 40 | vm_pager_t (*pgo_alloc) /* Allocate pager. */ | |
| 41 | __P((caddr_t, vm_size_t, vm_prot_t)); | |
| 42 | void (*pgo_dealloc) /* Disassociate. */ | |
| 43 | __P((vm_pager_t)); | |
| 44 | int (*pgo_getpage) /* Get (read) page. */ | |
| 45 | __P((vm_pager_t, vm_page_t, boolean_t)); | |
| 46 | int (*pgo_putpage) /* Put (write) page. */ | |
| 47 | __P((vm_pager_t, vm_page_t, boolean_t)); | |
| 48 | boolean_t (*pgo_haspage) /* Does pager have page? */ | |
| 49 | __P((vm_pager_t, vm_offset_t)); | |
| 619edcce | 50 | }; |
| 619edcce KM |
51 | |
| 52 | /* | |
| 53 | * get/put return values | |
| 54 | * OK operation was successful | |
| 55 | * BAD specified data was out of the accepted range | |
| 56 | * FAIL specified data was in range, but doesn't exist | |
| 57 | * PEND operations was initiated but not completed | |
| 58 | */ | |
| 59 | #define VM_PAGER_OK 0 | |
| 60 | #define VM_PAGER_BAD 1 | |
| 61 | #define VM_PAGER_FAIL 2 | |
| 62 | #define VM_PAGER_PEND 3 | |
| 63 | ||
| 64 | #define VM_PAGER_ALLOC(h, s, p) (*(pg)->pg_ops->pgo_alloc)(h, s, p) | |
| 65 | #define VM_PAGER_DEALLOC(pg) (*(pg)->pg_ops->pgo_dealloc)(pg) | |
| 66 | #define VM_PAGER_GET(pg, m, s) (*(pg)->pg_ops->pgo_getpage)(pg, m, s) | |
| 67 | #define VM_PAGER_PUT(pg, m, s) (*(pg)->pg_ops->pgo_putpage)(pg, m, s) | |
| 68 | #define VM_PAGER_HASPAGE(pg, o) (*(pg)->pg_ops->pgo_haspage)(pg, o) | |
| 69 | ||
| 70 | #ifdef KERNEL | |
| 619edcce | 71 | extern struct pagerops *dfltpagerops; |
| bb7f0d84 KB |
72 | |
| 73 | vm_pager_t vm_pager_allocate __P((int, caddr_t, vm_size_t, vm_prot_t)); | |
| 74 | void vm_pager_deallocate __P((vm_pager_t)); | |
| 75 | int vm_pager_get __P((vm_pager_t, vm_page_t, boolean_t)); | |
| 76 | boolean_t vm_pager_has_page __P((vm_pager_t, vm_offset_t)); | |
| 77 | void vm_pager_init __P((void)); | |
| 78 | vm_pager_t vm_pager_lookup __P((queue_head_t *, caddr_t)); | |
| 79 | vm_offset_t vm_pager_map_page __P((vm_page_t)); | |
| 80 | int vm_pager_put __P((vm_pager_t, vm_page_t, boolean_t)); | |
| 81 | void vm_pager_sync __P((void)); | |
| 82 | void vm_pager_unmap_page __P((vm_offset_t)); | |
| 619edcce KM |
83 | #endif |
| 84 | ||
| 85 | #endif /* _VM_PAGER_ */ |