Deleted Added
full compact
swap_pager.h (3449) swap_pager.h (5455)
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 * $Id: swap_pager.h,v 1.2 1994/05/25 09:18:39 rgrimes Exp $
39 * $Id: swap_pager.h,v 1.3 1994/10/09 01:52:06 phk Exp $
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
49
50/*
51 * SWB_NPAGES can be set to any value from 1 to 16 pages per allocation,
52 * however, due to the allocation spilling into non-swap pager backed memory,
53 * suggest keeping SWB_NPAGES small (1-4). If high performance is manditory
54 * perhaps up to 8 pages might be in order????
55 * Above problem has been fixed, now we support 16 pages per block. Unused
56 * space is recovered by the swap pager now...
57 */
58#define SWB_NPAGES 8
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
49
50/*
51 * SWB_NPAGES can be set to any value from 1 to 16 pages per allocation,
52 * however, due to the allocation spilling into non-swap pager backed memory,
53 * suggest keeping SWB_NPAGES small (1-4). If high performance is manditory
54 * perhaps up to 8 pages might be in order????
55 * Above problem has been fixed, now we support 16 pages per block. Unused
56 * space is recovered by the swap pager now...
57 */
58#define SWB_NPAGES 8
59struct swblock {
59struct swblock {
60 unsigned short swb_valid; /* bitmask for valid pages */
61 unsigned short swb_locked; /* block locked */
60 unsigned short swb_valid; /* bitmask for valid pages */
61 unsigned short swb_locked; /* block locked */
62 int swb_block[SWB_NPAGES]; /* unfortunately int instead of daddr_t */
62 int swb_block[SWB_NPAGES]; /* unfortunately int instead of daddr_t */
63};
63};
64typedef struct swblock *sw_blk_t;
64typedef struct swblock *sw_blk_t;
65
66/*
67 * Swap pager private data.
68 */
69struct swpager {
65
66/*
67 * Swap pager private data.
68 */
69struct swpager {
70 vm_size_t sw_osize; /* size of object we are backing (bytes) */
71 int sw_nblocks;/* number of blocks in list (sw_blk_t units) */
72 sw_blk_t sw_blocks; /* pointer to list of swap blocks */
73 short sw_flags; /* flags */
74 short sw_poip; /* pageouts in progress */
75 short sw_piip; /* pageins in progress */
70 vm_size_t sw_osize; /* size of object we are backing (bytes) */
71 int sw_nblocks; /* number of blocks in list (sw_blk_t units) */
72 sw_blk_t sw_blocks; /* pointer to list of swap blocks */
73 short sw_flags; /* flags */
74 short sw_poip; /* pageouts in progress */
75 short sw_piip; /* pageins in progress */
76};
76};
77typedef struct swpager *sw_pager_t;
77typedef struct swpager *sw_pager_t;
78
79#define SW_WANTED 0x01
80#define SW_NAMED 0x02
81
82#ifdef KERNEL
83
78
79#define SW_WANTED 0x01
80#define SW_NAMED 0x02
81
82#ifdef KERNEL
83
84void swap_pager_init(void);
85vm_pager_t swap_pager_alloc(caddr_t, vm_size_t, vm_prot_t, vm_offset_t);
86void swap_pager_dealloc(vm_pager_t);
87boolean_t swap_pager_getpage(vm_pager_t, vm_page_t, boolean_t);
88boolean_t swap_pager_putpage(vm_pager_t, vm_page_t, boolean_t);
89boolean_t swap_pager_getmulti(vm_pager_t, vm_page_t *, int, int, boolean_t);
90boolean_t swap_pager_haspage(vm_pager_t, vm_offset_t);
91int swap_pager_io(sw_pager_t, vm_page_t *, int, int, int);
92void swap_pager_iodone(struct buf *);
93boolean_t swap_pager_clean();
94void swap_pager_copy __P((vm_pager_t, vm_offset_t, vm_pager_t, vm_offset_t, vm_offset_t));
95void swap_pager_freespace __P((vm_pager_t, vm_offset_t, vm_offset_t));
84void swap_pager_init(void);
85vm_pager_t swap_pager_alloc(caddr_t, vm_size_t, vm_prot_t, vm_offset_t);
86void swap_pager_dealloc(vm_pager_t);
87boolean_t swap_pager_getpage(vm_pager_t, vm_page_t, boolean_t);
88boolean_t swap_pager_putpage(vm_pager_t, vm_page_t, boolean_t);
89boolean_t swap_pager_getmulti(vm_pager_t, vm_page_t *, int, int, boolean_t);
90boolean_t swap_pager_haspage(vm_pager_t, vm_offset_t);
91int swap_pager_io(sw_pager_t, vm_page_t *, int, int, int);
92void swap_pager_iodone(struct buf *);
93boolean_t swap_pager_clean();
94void swap_pager_copy __P((vm_pager_t, vm_offset_t, vm_pager_t, vm_offset_t, vm_offset_t));
95void swap_pager_freespace __P((vm_pager_t, vm_offset_t, vm_offset_t));
96
97extern struct pagerops swappagerops;
98
99#endif
100
96
97extern struct pagerops swappagerops;
98
99#endif
100
101#endif /* _SWAP_PAGER_ */
101#endif /* _SWAP_PAGER_ */