swap_pager.h (117722) | swap_pager.h (117723) |
---|---|
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. --- 22 unchanged lines hidden (view full) --- 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: @(#)swap_pager.h 7.1 (Berkeley) 12/5/90 | 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. --- 22 unchanged lines hidden (view full) --- 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: @(#)swap_pager.h 7.1 (Berkeley) 12/5/90 |
39 * $FreeBSD: head/sys/vm/swap_pager.h 117722 2003-07-18 10:02:44Z phk $ | 39 * $FreeBSD: head/sys/vm/swap_pager.h 117723 2003-07-18 10:26:09Z phk $ |
40 */ 41 42/* 43 * Modifications to the block allocation data structure by John S. Dyson 44 * 18 Dec 93. 45 */ 46 47#ifndef _VM_SWAP_PAGER_H_ --- 40 unchanged lines hidden (view full) --- 88 * 89 * Overall memory utilization is about the same as the old swap structure. 90 */ 91#define SWCORRECT(n) (sizeof(void *) * (n) / sizeof(daddr_t)) 92#define SWAP_META_PAGES (SWB_NPAGES * 2) 93#define SWAP_META_MASK (SWAP_META_PAGES - 1) 94 95extern int swap_pager_full; | 40 */ 41 42/* 43 * Modifications to the block allocation data structure by John S. Dyson 44 * 18 Dec 93. 45 */ 46 47#ifndef _VM_SWAP_PAGER_H_ --- 40 unchanged lines hidden (view full) --- 88 * 89 * Overall memory utilization is about the same as the old swap structure. 90 */ 91#define SWCORRECT(n) (sizeof(void *) * (n) / sizeof(daddr_t)) 92#define SWAP_META_PAGES (SWB_NPAGES * 2) 93#define SWAP_META_MASK (SWAP_META_PAGES - 1) 94 95extern int swap_pager_full; |
96extern struct blist *swapblist; | |
97extern int vm_swap_size; 98 99void swap_pager_putpages(vm_object_t, vm_page_t *, int, boolean_t, int *); 100void swap_pager_copy(vm_object_t, vm_object_t, vm_pindex_t, int); 101void swap_pager_freespace(vm_object_t, vm_pindex_t, vm_size_t); 102void swap_pager_swap_init(void); 103int swap_pager_isswapped(vm_object_t, int); 104int swap_pager_reserve(vm_object_t, vm_pindex_t, vm_size_t); | 96extern int vm_swap_size; 97 98void swap_pager_putpages(vm_object_t, vm_page_t *, int, boolean_t, int *); 99void swap_pager_copy(vm_object_t, vm_object_t, vm_pindex_t, int); 100void swap_pager_freespace(vm_object_t, vm_pindex_t, vm_size_t); 101void swap_pager_swap_init(void); 102int swap_pager_isswapped(vm_object_t, int); 103int swap_pager_reserve(vm_object_t, vm_pindex_t, vm_size_t); |
104void swap_pager_status(int *total, int *used); |
|
105 106#endif /* _KERNEL */ 107#endif /* _VM_SWAP_PAGER_H_ */ | 105 106#endif /* _KERNEL */ 107#endif /* _VM_SWAP_PAGER_H_ */ |