vm_object.h revision 48059
1133808Spjd/* 2133808Spjd * Copyright (c) 1991, 1993 3133808Spjd * The Regents of the University of California. All rights reserved. 4133808Spjd * 5133808Spjd * This code is derived from software contributed to Berkeley by 6133808Spjd * The Mach Operating System project at Carnegie-Mellon University. 7133808Spjd * 8133808Spjd * Redistribution and use in source and binary forms, with or without 9133808Spjd * modification, are permitted provided that the following conditions 10133808Spjd * are met: 11133808Spjd * 1. Redistributions of source code must retain the above copyright 12133808Spjd * notice, this list of conditions and the following disclaimer. 13133808Spjd * 2. Redistributions in binary form must reproduce the above copyright 14133808Spjd * notice, this list of conditions and the following disclaimer in the 15133808Spjd * documentation and/or other materials provided with the distribution. 16133808Spjd * 3. All advertising materials mentioning features or use of this software 17133808Spjd * must display the following acknowledgement: 18133808Spjd * This product includes software developed by the University of 19133808Spjd * California, Berkeley and its contributors. 20133808Spjd * 4. Neither the name of the University nor the names of its contributors 21133808Spjd * may be used to endorse or promote products derived from this software 22133808Spjd * without specific prior written permission. 23133808Spjd * 24133808Spjd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25133808Spjd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26133808Spjd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27133808Spjd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28133808Spjd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29133808Spjd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30133808Spjd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31133808Spjd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32133808Spjd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33133808Spjd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34133808Spjd * SUCH DAMAGE. 35133808Spjd * 36133808Spjd * from: @(#)vm_object.h 8.3 (Berkeley) 1/12/94 37133808Spjd * 38133808Spjd * 39133808Spjd * Copyright (c) 1987, 1990 Carnegie-Mellon University. 40133808Spjd * All rights reserved. 41133808Spjd * 42133808Spjd * Authors: Avadis Tevanian, Jr., Michael Wayne Young 43133808Spjd * 44133808Spjd * Permission to use, copy, modify and distribute this software and 45133808Spjd * its documentation is hereby granted, provided that both the copyright 46133808Spjd * notice and this permission notice appear in all copies of the 47133808Spjd * software, derivative works or modified versions, and any portions 48133808Spjd * thereof, and that both notices appear in supporting documentation. 49133808Spjd * 50133808Spjd * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 51133808Spjd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 52133808Spjd * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 53133808Spjd * 54133808Spjd * Carnegie Mellon requests users of this software to return to 55133808Spjd * 56133808Spjd * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 57133808Spjd * School of Computer Science 58133808Spjd * Carnegie Mellon University 59133808Spjd * Pittsburgh PA 15213-3890 60133808Spjd * 61134124Spjd * any improvements or extensions that they make and grant Carnegie the 62134124Spjd * rights to redistribute these changes. 63133808Spjd * 64133808Spjd * $Id: vm_object.h,v 1.55 1999/06/19 18:42:52 alc Exp $ 65133808Spjd */ 66133808Spjd 67133808Spjd/* 68133808Spjd * Virtual memory object module definitions. 69133808Spjd */ 70133808Spjd 71133808Spjd#ifndef _VM_OBJECT_ 72133808Spjd#define _VM_OBJECT_ 73133808Spjd 74133808Spjd#include <sys/queue.h> 75133808Spjd#include <machine/atomic.h> 76133808Spjd 77133808Spjdenum obj_type { OBJT_DEFAULT, OBJT_SWAP, OBJT_VNODE, OBJT_DEVICE, OBJT_DEAD }; 78134124Spjdtypedef enum obj_type objtype_t; 79133808Spjd 80133808Spjd/* 81133808Spjd * Types defined: 82133808Spjd * 83133808Spjd * vm_object_t Virtual memory object. 84133808Spjd * 85133808Spjd */ 86133808Spjd 87133808Spjdstruct vm_object { 88133808Spjd TAILQ_ENTRY(vm_object) object_list; /* list of all objects */ 89133808Spjd TAILQ_HEAD(, vm_object) shadow_head; /* objects that this is a shadow for */ 90133808Spjd TAILQ_ENTRY(vm_object) shadow_list; /* chain of shadow objects */ 91133808Spjd TAILQ_HEAD(, vm_page) memq; /* list of resident pages */ 92133808Spjd int generation; /* generation ID */ 93133808Spjd objtype_t type; /* type of pager */ 94133808Spjd vm_size_t size; /* Object size */ 95133808Spjd int ref_count; /* How many refs?? */ 96133808Spjd int shadow_count; /* how many objects that this is a shadow for */ 97133808Spjd int pg_color; /* color of first page in obj */ 98133808Spjd int hash_rand; /* vm hash table randomizer */ 99133808Spjd u_short flags; /* see below */ 100133808Spjd u_short paging_in_progress; /* Paging (in or out) so don't collapse or destroy */ 101133808Spjd u_short behavior; /* see below */ 102133808Spjd int resident_page_count; /* number of resident pages */ 103133808Spjd struct vm_object *backing_object; /* object that I'm a shadow of */ 104133808Spjd vm_ooffset_t backing_object_offset;/* Offset in backing object */ 105134124Spjd vm_offset_t last_read; /* last read in object -- detect seq behavior */ 106133808Spjd TAILQ_ENTRY(vm_object) pager_object_list; /* list of all objects of this pager type */ 107133808Spjd void *handle; 108134124Spjd union { 109133808Spjd /* 110133808Spjd * VNode pager 111133808Spjd * 112133960Spjd * vnp_size - current size of file 113133808Spjd */ 114133808Spjd struct { 115133808Spjd off_t vnp_size; 116133808Spjd } vnp; 117133808Spjd 118133808Spjd /* 119133808Spjd * Device pager 120133808Spjd * 121133808Spjd * devp_pglist - list of allocated pages 122133808Spjd */ 123133808Spjd struct { 124133808Spjd TAILQ_HEAD(, vm_page) devp_pglist; 125133808Spjd } devp; 126133808Spjd 127133808Spjd /* 128133808Spjd * Swap pager 129133808Spjd * 130133808Spjd * swp_bcount - number of swap 'swblock' metablocks, each 131133808Spjd * contains up to 16 swapblk assignments. 132133808Spjd * see vm/swap_pager.h 133133808Spjd */ 134133808Spjd struct { 135133808Spjd int swp_bcount; 136133808Spjd } swp; 137133808Spjd } un_pager; 138133808Spjd}; 139133808Spjd 140133808Spjd/* 141133808Spjd * Flags 142133808Spjd */ 143133808Spjd#define OBJ_ACTIVE 0x0004 /* active objects */ 144133808Spjd#define OBJ_DEAD 0x0008 /* dead objects (during rundown) */ 145133808Spjd#define OBJ_NOSPLIT 0x0010 /* dont split this object */ 146133808Spjd#define OBJ_PIPWNT 0x0040 /* paging in progress wanted */ 147134124Spjd#define OBJ_WRITEABLE 0x0080 /* object has been made writable */ 148134124Spjd#define OBJ_MIGHTBEDIRTY 0x0100 /* object might be dirty */ 149133808Spjd#define OBJ_CLEANING 0x0200 150133808Spjd#define OBJ_OPT 0x1000 /* I/O optimization */ 151133808Spjd#define OBJ_ONEMAPPING 0x2000 /* One USE (a single, non-forked) mapping flag */ 152133808Spjd 153133808Spjd#define OBJ_NORMAL 0x0 /* default behavior */ 154133808Spjd#define OBJ_SEQUENTIAL 0x1 /* expect sequential accesses */ 155133808Spjd#define OBJ_RANDOM 0x2 /* expect random accesses */ 156133808Spjd 157133808Spjd#define IDX_TO_OFF(idx) (((vm_ooffset_t)(idx)) << PAGE_SHIFT) 158133808Spjd#define OFF_TO_IDX(off) ((vm_pindex_t)(((vm_ooffset_t)(off)) >> PAGE_SHIFT)) 159133808Spjd 160133808Spjd#ifdef KERNEL 161133808Spjd 162133808Spjd#define OBJPC_SYNC 0x1 /* sync I/O */ 163133808Spjd#define OBJPC_INVAL 0x2 /* invalidate */ 164133808Spjd 165133808SpjdTAILQ_HEAD(object_q, vm_object); 166133808Spjd 167133808Spjdextern struct object_q vm_object_list; /* list of allocated objects */ 168133808Spjd 169133808Spjd /* lock for object list and count */ 170133808Spjd 171133808Spjdextern vm_object_t kernel_object; /* the single kernel object */ 172133808Spjdextern vm_object_t kmem_object; 173133808Spjd 174133808Spjd#endif /* KERNEL */ 175133808Spjd 176133808Spjd#ifdef KERNEL 177133808Spjd 178133808Spjdstatic __inline void 179133808Spjdvm_object_set_flag(vm_object_t object, u_int bits) 180133808Spjd{ 181133808Spjd atomic_set_short(&object->flags, bits); 182133808Spjd} 183133808Spjd 184133808Spjdstatic __inline void 185133808Spjdvm_object_clear_flag(vm_object_t object, u_int bits) 186133808Spjd{ 187133808Spjd atomic_clear_short(&object->flags, bits); 188133808Spjd} 189133808Spjd 190133808Spjdstatic __inline void 191134124Spjdvm_object_pip_add(vm_object_t object, int i) 192134124Spjd{ 193134124Spjd atomic_add_short(&object->paging_in_progress, i); 194134124Spjd} 195134124Spjd 196134124Spjdstatic __inline void 197134124Spjdvm_object_pip_subtract(vm_object_t object, int i) 198133808Spjd{ 199133808Spjd atomic_subtract_short(&object->paging_in_progress, i); 200133808Spjd} 201133808Spjd 202133808Spjdstatic __inline void 203133808Spjdvm_object_pip_wakeup(vm_object_t object) 204133808Spjd{ 205133808Spjd atomic_subtract_short(&object->paging_in_progress, 1); 206133808Spjd if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) { 207133808Spjd vm_object_clear_flag(object, OBJ_PIPWNT); 208133808Spjd wakeup(object); 209133808Spjd } 210133808Spjd} 211133808Spjd 212133808Spjdstatic __inline void 213133808Spjdvm_object_pip_wakeupn(vm_object_t object, int i) 214133808Spjd{ 215133808Spjd if (i) 216133808Spjd atomic_subtract_short(&object->paging_in_progress, i); 217133808Spjd if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) { 218133808Spjd vm_object_clear_flag(object, OBJ_PIPWNT); 219133808Spjd wakeup(object); 220133808Spjd } 221133808Spjd} 222133808Spjd 223133808Spjdstatic __inline void 224133808Spjdvm_object_pip_sleep(vm_object_t object, char *waitid) 225133808Spjd{ 226133808Spjd if (object->paging_in_progress) { 227133808Spjd int s = splvm(); 228133808Spjd if (object->paging_in_progress) { 229133808Spjd vm_object_set_flag(object, OBJ_PIPWNT); 230133808Spjd tsleep(object, PVM, waitid, 0); 231133808Spjd } 232133808Spjd splx(s); 233133808Spjd } 234133808Spjd} 235133808Spjd 236133808Spjdstatic __inline void 237133808Spjdvm_object_pip_wait(vm_object_t object, char *waitid) 238133808Spjd{ 239133808Spjd while (object->paging_in_progress) 240133808Spjd vm_object_pip_sleep(object, waitid); 241133808Spjd} 242133808Spjd 243133808Spjdvm_object_t vm_object_allocate __P((objtype_t, vm_size_t)); 244133808Spjdvoid _vm_object_allocate __P((objtype_t, vm_size_t, vm_object_t)); 245133808Spjdboolean_t vm_object_coalesce __P((vm_object_t, vm_pindex_t, vm_size_t, vm_size_t)); 246133808Spjdvoid vm_object_collapse __P((vm_object_t)); 247133808Spjdvoid vm_object_deallocate __P((vm_object_t)); 248133808Spjdvoid vm_object_terminate __P((vm_object_t)); 249133808Spjdvoid vm_object_vndeallocate __P((vm_object_t)); 250133808Spjdvoid vm_object_init __P((void)); 251133808Spjdvoid vm_object_page_clean __P((vm_object_t, vm_pindex_t, vm_pindex_t, boolean_t)); 252133808Spjdvoid vm_object_page_remove __P((vm_object_t, vm_pindex_t, vm_pindex_t, boolean_t)); 253133808Spjdvoid vm_object_pmap_copy __P((vm_object_t, vm_pindex_t, vm_pindex_t)); 254133808Spjdvoid vm_object_pmap_copy_1 __P((vm_object_t, vm_pindex_t, vm_pindex_t)); 255133808Spjdvoid vm_object_pmap_remove __P((vm_object_t, vm_pindex_t, vm_pindex_t)); 256133808Spjdvoid vm_object_reference __P((vm_object_t)); 257133808Spjdvoid vm_object_shadow __P((vm_object_t *, vm_ooffset_t *, vm_size_t)); 258133808Spjdvoid vm_object_madvise __P((vm_object_t, vm_pindex_t, int, int)); 259133808Spjdvoid vm_object_init2 __P((void)); 260133808Spjd#endif /* KERNEL */ 261133808Spjd 262133808Spjd#endif /* _VM_OBJECT_ */ 263133808Spjd