uvm.h revision 1.5 1 /* $NetBSD: uvm.h,v 1.5 1998/02/10 14:12:01 mrg Exp $ */
2
3 /*
4 * XXXCDC: "ROUGH DRAFT" QUALITY UVM PRE-RELEASE FILE!
5 * >>>USE AT YOUR OWN RISK, WORK IS NOT FINISHED<<<
6 */
7
8 /*
9 *
10 * Copyright (c) 1997 Charles D. Cranor and Washington University.
11 * All rights reserved.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by Charles D. Cranor and
24 * Washington University.
25 * 4. The name of the author may not be used to endorse or promote products
26 * derived from this software without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
29 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
30 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
31 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
32 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
33 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
34 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
35 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
36 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
37 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 *
39 * from: Id: uvm.h,v 1.1.2.14 1998/02/02 20:07:19 chuck Exp
40 */
41
42 #ifndef _UVM_UVM_H_
43 #define _UVM_UVM_H_
44
45 #include "opt_uvmhist.h"
46
47 #include <uvm/uvm_extern.h>
48
49 #include <uvm/uvm_stat.h>
50
51 /*
52 * pull in prototypes
53 */
54
55 #include <uvm/uvm_amap.h>
56 #include <uvm/uvm_aobj.h>
57 #include <uvm/uvm_fault.h>
58 #include <uvm/uvm_glue.h>
59 #include <uvm/uvm_km.h>
60 #include <uvm/uvm_loan.h>
61 #include <uvm/uvm_map.h>
62 #include <uvm/uvm_object.h>
63 #include <uvm/uvm_page.h>
64 #include <uvm/uvm_pager.h>
65 #include <uvm/uvm_pdaemon.h>
66 #include <uvm/uvm_swap.h>
67
68 /*
69 * uvm structure (vm global state: collected in one structure for ease
70 * of reference...)
71 */
72
73 struct uvm {
74 /* vm_page related parameters */
75 /* vm_page queues */
76 struct pglist page_free; /* unallocated pages */
77 struct pglist page_active; /* allocated pages, in use */
78 struct pglist page_inactive_swp;/* pages inactive (reclaim or free) */
79 struct pglist page_inactive_obj;/* pages inactive (reclaim or free) */
80 #if NCPU > 1
81 simple_lock_data_t pageqlock; /* lock for active/inactive page q */
82 simple_lock_data_t fpageqlock; /* lock for free page q */
83 #endif /* NCPU > 1 */
84 /* page daemon trigger */
85 int pagedaemon; /* daemon sleeps on this */
86 struct proc *pagedaemon_proc; /* daemon's pid */
87 simple_lock_data_t pagedaemon_lock;
88 /* page hash */
89 struct pglist *page_hash; /* page hash table (vp/off->page) */
90 int page_nhash; /* number of buckets */
91 int page_hashmask; /* hash mask */
92 #if NCPU > 1
93 simple_lock_data_t hashlock; /* lock on page_hash array */
94 #endif
95 /* anon stuff */
96 struct vm_anon *afree; /* anon free list */
97 #if NCPU > 1
98 simple_lock_data_t afreelock; /* lock on anon free list */
99 #endif /* NCPU > 1 */
100
101 /* static kernel map entry pool */
102 vm_map_entry_t kentry_free; /* free page pool */
103 #if NCPU > 1
104 simple_lock_data_t kentry_lock;
105 #endif
106
107 /* aio_done is locked by uvm.pagedaemon_lock and splbio! */
108 struct uvm_aiohead aio_done; /* done async i/o reqs */
109
110 /* pager VM area bounds */
111 vm_offset_t pager_sva; /* start of pager VA area */
112 vm_offset_t pager_eva; /* end of pager VA area */
113
114 /* kernel object: to support anonymous pageable kernel memory */
115 struct uvm_object *kernel_object;
116 };
117
118 extern struct uvm uvm;
119
120 /*
121 * historys
122 */
123
124 UVMHIST_DECL(maphist);
125 UVMHIST_DECL(pdhist);
126
127 /*
128 * vm_map_entry etype bits:
129 */
130
131 #define UVM_ET_OBJ 0x01 /* it is a uvm_object */
132 #define UVM_ET_MAP 0x02 /* it is a vm_map */
133 #define UVM_ET_SUBMAP 0x04 /* it is a submap (MAP must be 1 too) */
134 #define UVM_ET_COPYONWRITE 0x08 /* copy_on_write */
135 #define UVM_ET_NEEDSCOPY 0x10 /* needs_copy */
136
137 #define UVM_ET_ISOBJ(E) (((E)->etype & UVM_ET_OBJ) != 0)
138 #define UVM_ET_ISMAP(E) (((E)->etype & UVM_ET_MAP) != 0)
139 #define UVM_ET_ISSUBMAP(E) (((E)->etype & UVM_ET_SUBMAP) != 0)
140 #define UVM_ET_ISCOPYONWRITE(E) (((E)->etype & UVM_ET_COPYONWRITE) != 0)
141 #define UVM_ET_ISNEEDSCOPY(E) (((E)->etype & UVM_ET_NEEDSCOPY) != 0)
142
143 /*
144 * macros
145 */
146
147 /*
148 * UVM_UNLOCK_AND_WAIT: atomic unlock+wait... front end for the
149 * (poorly named) thread_sleep_msg function.
150 */
151
152 #if NCPU > 1
153
154 #define UVM_UNLOCK_AND_WAIT(event,lock,intr,msg, timo) \
155 thread_sleep_msg(event,lock,intr,msg, timo)
156
157 #else
158
159 #define UVM_UNLOCK_AND_WAIT(event,lock,intr,msg, timo) \
160 thread_sleep_msg(event,NULL,intr,msg, timo)
161
162 #endif
163
164 /*
165 * UVM_PAGE_OWN: track page ownership (only if UVM_PAGE_TRKOWN)
166 */
167
168 #if defined(UVM_PAGE_TRKOWN)
169
170 #define UVM_PAGE_OWN(PG, TAG) uvm_page_own(PG, TAG)
171
172 #else /* UVM_PAGE_TRKOWN */
173
174 #define UVM_PAGE_OWN(PG, TAG) /* nothing */
175
176 #endif /* UVM_PAGE_TRKOWN */
177
178 /*
179 * pull in inlines
180 */
181
182 #include <uvm/uvm_amap_i.h>
183 #include <uvm/uvm_fault_i.h>
184 #include <uvm/uvm_map_i.h>
185 #include <uvm/uvm_page_i.h>
186 #include <uvm/uvm_pager_i.h>
187
188 #endif /* _UVM_UVM_H_ */
189