| swap_pager.h (107913) | swap_pager.h (108599) |
|---|---|
| 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 107913 2002-12-15 19:17:57Z dillon $ | 39 * $FreeBSD: head/sys/vm/swap_pager.h 108599 2003-01-03 14:22:52Z phk $ |
| 40 */ 41 42/* 43 * Modifications to the block allocation data structure by John S. Dyson 44 * 18 Dec 93. 45 */ 46 | 40 */ 41 42/* 43 * Modifications to the block allocation data structure by John S. Dyson 44 * 18 Dec 93. 45 */ 46 |
| 47#ifndef _SWAP_PAGER_ 48#define _SWAP_PAGER_ 1 | 47#ifndef _VM_SWAP_PAGER_H_ 48#define _VM_SWAP_PAGER_H_ 1 |
| 49 50/* 51 * SWB_NPAGES must be a power of 2. It may be set to 1, 2, 4, 8, or 16 52 * pages per allocation. We recommend you stick with the default of 8. 53 * The 16-page limit is due to the radix code (kern/subr_blist.c). 54 */ 55#if !defined(SWB_NPAGES) 56#define SWB_NPAGES 8 --- 45 unchanged lines hidden (view full) --- 102 103void swap_pager_page_removed(vm_page_t, vm_object_t); 104 105/* choose underlying swap device and queue up I/O */ 106struct buf; 107void swstrategy(struct buf *bp); /* probably needs to move elsewhere */ 108 109#endif /* _KERNEL */ | 49 50/* 51 * SWB_NPAGES must be a power of 2. It may be set to 1, 2, 4, 8, or 16 52 * pages per allocation. We recommend you stick with the default of 8. 53 * The 16-page limit is due to the radix code (kern/subr_blist.c). 54 */ 55#if !defined(SWB_NPAGES) 56#define SWB_NPAGES 8 --- 45 unchanged lines hidden (view full) --- 102 103void swap_pager_page_removed(vm_page_t, vm_object_t); 104 105/* choose underlying swap device and queue up I/O */ 106struct buf; 107void swstrategy(struct buf *bp); /* probably needs to move elsewhere */ 108 109#endif /* _KERNEL */ |
| 110#endif /* _SWAP_PAGER_ */ | 110#endif /* _VM_SWAP_PAGER_H_ */ |