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