1 /* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * from: @(#)vm_object.h 8.3 (Berkeley) 1/12/94 37 * 38 * 39 * Copyright (c) 1987, 1990 Carnegie-Mellon University. 40 * All rights reserved. 41 * 42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young 43 * 44 * Permission to use, copy, modify and distribute this software and 45 * its documentation is hereby granted, provided that both the copyright 46 * notice and this permission notice appear in all copies of the 47 * software, derivative works or modified versions, and any portions 48 * thereof, and that both notices appear in supporting documentation. 49 * 50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 53 * 54 * Carnegie Mellon requests users of this software to return to 55 * 56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 57 * School of Computer Science 58 * Carnegie Mellon University 59 * Pittsburgh PA 15213-3890 60 * 61 * any improvements or extensions that they make and grant Carnegie the 62 * rights to redistribute these changes. 63 * 64 * $FreeBSD: src/sys/vm/vm_object.h,v 1.63.2.3 2003/05/26 19:17:56 alc Exp $ 65 * $DragonFly: src/sys/vm/vm_object.h,v 1.5 2005/06/02 20:57:21 swildner Exp $ 66 */ 67 68 /* 69 * Virtual memory object module definitions. 70 */ 71 72 #ifndef _VM_OBJECT_ 73 #define _VM_OBJECT_ 74 75 #include <sys/queue.h> 76 #include <sys/thread2.h> 77 #include <machine/atomic.h> 78 79 enum obj_type { OBJT_DEFAULT, OBJT_SWAP, OBJT_VNODE, OBJT_DEVICE, OBJT_PHYS, 80 OBJT_DEAD }; 81 typedef u_char objtype_t; 82 83 /* 84 * vm_object_lock A lock covering byte ranges within a VM object 85 * 86 */ 87 struct vm_object_lock { 88 struct vm_object_lock *next; 89 int type; /* type of lock */ 90 int waiting; /* someone is waiting on the lock */ 91 off_t base; /* byte offset into object */ 92 off_t bytes; /* extent in bytes */ 93 }; 94 95 #define VMOBJ_LOCK_SHARED 1 96 #define VMOBJ_LOCK_EXCL 2 97 98 /* 99 * vm_object A VM object which represents an arbitrarily sized 100 * data store. 101 */ 102 struct vm_object { 103 TAILQ_ENTRY(vm_object) object_list; /* list of all objects */ 104 LIST_HEAD(, vm_object) shadow_head; /* objects that this is a shadow for */ 105 LIST_ENTRY(vm_object) shadow_list; /* chain of shadow objects */ 106 TAILQ_HEAD(, vm_page) memq; /* list of resident pages */ 107 int generation; /* generation ID */ 108 vm_size_t size; /* Object size */ 109 int ref_count; /* How many refs?? */ 110 int shadow_count; /* how many objects that this is a shadow for */ 111 int hash_rand; /* vm hash table randomizer */ 112 objtype_t type; /* type of pager */ 113 u_short flags; /* see below */ 114 u_short pg_color; /* color of first page in obj */ 115 u_short paging_in_progress; /* Paging (in or out) so don't collapse or destroy */ 116 int resident_page_count; /* number of resident pages */ 117 struct vm_object *backing_object; /* object that I'm a shadow of */ 118 vm_ooffset_t backing_object_offset;/* Offset in backing object */ 119 TAILQ_ENTRY(vm_object) pager_object_list; /* list of all objects of this pager type */ 120 void *handle; 121 vm_object_lock_t range_locks; 122 union { 123 /* 124 * VNode pager 125 * 126 * vnp_size - current size of file 127 */ 128 struct { 129 off_t vnp_size; 130 } vnp; 131 132 /* 133 * Device pager 134 * 135 * devp_pglist - list of allocated pages 136 */ 137 struct { 138 TAILQ_HEAD(, vm_page) devp_pglist; 139 } devp; 140 141 /* 142 * Swap pager 143 * 144 * swp_bcount - number of swap 'swblock' metablocks, each 145 * contains up to 16 swapblk assignments. 146 * see vm/swap_pager.h 147 */ 148 struct { 149 int swp_bcount; 150 } swp; 151 } un_pager; 152 }; 153 154 /* 155 * Flags 156 */ 157 #define OBJ_ACTIVE 0x0004 /* active objects */ 158 #define OBJ_DEAD 0x0008 /* dead objects (during rundown) */ 159 #define OBJ_NOSPLIT 0x0010 /* dont split this object */ 160 #define OBJ_PIPWNT 0x0040 /* paging in progress wanted */ 161 #define OBJ_WRITEABLE 0x0080 /* object has been made writable */ 162 #define OBJ_MIGHTBEDIRTY 0x0100 /* object might be dirty */ 163 #define OBJ_CLEANING 0x0200 164 #define OBJ_OPT 0x1000 /* I/O optimization */ 165 #define OBJ_ONEMAPPING 0x2000 /* One USE (a single, non-forked) mapping flag */ 166 167 #define IDX_TO_OFF(idx) (((vm_ooffset_t)(idx)) << PAGE_SHIFT) 168 #define OFF_TO_IDX(off) ((vm_pindex_t)(((vm_ooffset_t)(off)) >> PAGE_SHIFT)) 169 170 #ifdef _KERNEL 171 172 #define OBJPC_SYNC 0x1 /* sync I/O */ 173 #define OBJPC_INVAL 0x2 /* invalidate */ 174 #define OBJPC_NOSYNC 0x4 /* skip if PG_NOSYNC */ 175 176 TAILQ_HEAD(object_q, vm_object); 177 178 extern struct object_q vm_object_list; /* list of allocated objects */ 179 180 /* lock for object list and count */ 181 182 extern vm_object_t kernel_object; /* the single kernel object */ 183 extern vm_object_t kmem_object; 184 185 #endif /* _KERNEL */ 186 187 #ifdef _KERNEL 188 189 static __inline void 190 vm_object_set_flag(vm_object_t object, u_int bits) 191 { 192 atomic_set_short(&object->flags, bits); 193 } 194 195 static __inline void 196 vm_object_clear_flag(vm_object_t object, u_int bits) 197 { 198 atomic_clear_short(&object->flags, bits); 199 } 200 201 static __inline void 202 vm_object_pip_add(vm_object_t object, int i) 203 { 204 atomic_add_short(&object->paging_in_progress, i); 205 } 206 207 static __inline void 208 vm_object_pip_subtract(vm_object_t object, int i) 209 { 210 atomic_subtract_short(&object->paging_in_progress, i); 211 } 212 213 static __inline void 214 vm_object_pip_wakeup(vm_object_t object) 215 { 216 atomic_subtract_short(&object->paging_in_progress, 1); 217 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) { 218 vm_object_clear_flag(object, OBJ_PIPWNT); 219 wakeup(object); 220 } 221 } 222 223 static __inline void 224 vm_object_pip_wakeupn(vm_object_t object, int i) 225 { 226 if (i) 227 atomic_subtract_short(&object->paging_in_progress, i); 228 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) { 229 vm_object_clear_flag(object, OBJ_PIPWNT); 230 wakeup(object); 231 } 232 } 233 234 static __inline void 235 vm_object_pip_sleep(vm_object_t object, char *waitid) 236 { 237 if (object->paging_in_progress) { 238 crit_enter(); 239 if (object->paging_in_progress) { 240 vm_object_set_flag(object, OBJ_PIPWNT); 241 tsleep(object, 0, waitid, 0); 242 } 243 crit_exit(); 244 } 245 } 246 247 static __inline void 248 vm_object_pip_wait(vm_object_t object, char *waitid) 249 { 250 while (object->paging_in_progress) 251 vm_object_pip_sleep(object, waitid); 252 } 253 254 vm_object_t vm_object_allocate (objtype_t, vm_size_t); 255 void _vm_object_allocate (objtype_t, vm_size_t, vm_object_t); 256 boolean_t vm_object_coalesce (vm_object_t, vm_pindex_t, vm_size_t, vm_size_t); 257 void vm_object_collapse (vm_object_t); 258 void vm_object_deallocate (vm_object_t); 259 void vm_object_terminate (vm_object_t); 260 void vm_object_vndeallocate (vm_object_t); 261 void vm_object_set_writeable_dirty (vm_object_t); 262 void vm_object_init (void); 263 void vm_object_page_clean (vm_object_t, vm_pindex_t, vm_pindex_t, boolean_t); 264 void vm_object_page_remove (vm_object_t, vm_pindex_t, vm_pindex_t, boolean_t); 265 void vm_object_pmap_copy (vm_object_t, vm_pindex_t, vm_pindex_t); 266 void vm_object_pmap_copy_1 (vm_object_t, vm_pindex_t, vm_pindex_t); 267 void vm_object_pmap_remove (vm_object_t, vm_pindex_t, vm_pindex_t); 268 void vm_object_reference (vm_object_t); 269 void vm_object_shadow (vm_object_t *, vm_ooffset_t *, vm_size_t); 270 void vm_object_madvise (vm_object_t, vm_pindex_t, int, int); 271 void vm_object_init2 (void); 272 #endif /* _KERNEL */ 273 274 #endif /* _VM_OBJECT_ */ 275