1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* Copyright (c) 1995, David Greenman
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by David Greenman.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* The default pager is responsible for supplying backing store to unbacked
* storage. The backing store is usually swap so we just fall through to
* the swap routines. However, since swap metadata has not been assigned,
* the swap routines assign and manage the swap backing store through the
* vm_page->swapblk field. The object is only converted when the page is
* physically freed after having been cleaned and even then vm_page->swapblk
* is maintained whenever a resident page also has swap backing store.
*
* $FreeBSD$
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <vm/vm.h>
#include <vm/vm_object.h>
#include <vm/vm_page.h>
#include <vm/vm_pager.h>
#include <vm/swap_pager.h>
static vm_object_t default_pager_alloc __P((void *, vm_ooffset_t, vm_prot_t,
vm_ooffset_t));
static void default_pager_dealloc __P((vm_object_t));
static int default_pager_getpages __P((vm_object_t, vm_page_t *, int, int));
static void default_pager_putpages __P((vm_object_t, vm_page_t *, int,
boolean_t, int *));
static boolean_t default_pager_haspage __P((vm_object_t, vm_pindex_t, int *,
int *));
/*
* pagerops for OBJT_DEFAULT - "default pager".
*/
struct pagerops defaultpagerops = {
NULL,
default_pager_alloc,
default_pager_dealloc,
default_pager_getpages,
default_pager_putpages,
default_pager_haspage,
NULL
};
/*
* no_pager_alloc just returns an initialized object.
*/
static vm_object_t
default_pager_alloc(void *handle, vm_ooffset_t size, vm_prot_t prot,
vm_ooffset_t offset)
{
if (handle != NULL)
panic("default_pager_alloc: handle specified");
return vm_object_allocate(OBJT_DEFAULT, OFF_TO_IDX(round_page(offset + size)));
}
/*
* deallocate resources associated with default objects. The default objects
* have no special resources allocated to them, but the vm_page's being used
* in this object might. Still, we do not have to do anything - we will free
* the swapblk in the underlying vm_page's when we free the vm_page or
* garbage collect the vm_page cache list.
*/
static void
default_pager_dealloc(object)
vm_object_t object;
{
/*
* OBJT_DEFAULT objects have no special resources allocated to them.
*/
}
/*
* Load pages from backing store. Since OBJT_DEFAULT is converted to
* OBJT_SWAP at the time a swap-backed vm_page_t is freed, we will never
* see a vm_page with assigned swap here.
*/
static int
default_pager_getpages(object, m, count, reqpage)
vm_object_t object;
vm_page_t *m;
int count;
int reqpage;
{
return VM_PAGER_FAIL;
}
/*
* Store pages to backing store. We should assign swap and initiate
* I/O. We do not actually convert the object to OBJT_SWAP here. The
* object will be converted when the written-out vm_page_t is moved from the
* cache to the free list.
*/
static void
default_pager_putpages(object, m, c, sync, rtvals)
vm_object_t object;
vm_page_t *m;
int c;
boolean_t sync;
int *rtvals;
{
swap_pager_putpages(object, m, c, sync, rtvals);
}
/*
* Tell us whether the backing store for the requested (object,index) is
* synchronized. i.e. tell us whether we can throw the page away and
* reload it later. So, for example, if we are in the process of writing
* the page to its backing store, or if no backing store has been assigned,
* it is not yet synchronized.
*
* It is possible to have fully-synchronized swap assigned without the
* object having been converted. We just call swap_pager_haspage() to
* deal with it since it must already deal with it plus deal with swap
* meta-data structures.
*/
static boolean_t
default_pager_haspage(object, pindex, before, after)
vm_object_t object;
vm_pindex_t pindex;
int *before;
int *after;
{
return FALSE;
}
|
