vm_object.h revision 6618
155714Skris/* 255714Skris * Copyright (c) 1991, 1993 355714Skris * The Regents of the University of California. All rights reserved. 455714Skris * 555714Skris * This code is derived from software contributed to Berkeley by 655714Skris * The Mach Operating System project at Carnegie-Mellon University. 755714Skris * 855714Skris * Redistribution and use in source and binary forms, with or without 955714Skris * modification, are permitted provided that the following conditions 1055714Skris * are met: 1155714Skris * 1. Redistributions of source code must retain the above copyright 1255714Skris * notice, this list of conditions and the following disclaimer. 1355714Skris * 2. Redistributions in binary form must reproduce the above copyright 1455714Skris * notice, this list of conditions and the following disclaimer in the 1555714Skris * documentation and/or other materials provided with the distribution. 1655714Skris * 3. All advertising materials mentioning features or use of this software 1755714Skris * must display the following acknowledgement: 1855714Skris * This product includes software developed by the University of 1955714Skris * California, Berkeley and its contributors. 2055714Skris * 4. Neither the name of the University nor the names of its contributors 2155714Skris * may be used to endorse or promote products derived from this software 2255714Skris * without specific prior written permission. 2355714Skris * 2455714Skris * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2555714Skris * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2655714Skris * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2755714Skris * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2855714Skris * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2955714Skris * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 3055714Skris * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 3155714Skris * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 3255714Skris * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3355714Skris * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3455714Skris * SUCH DAMAGE. 3555714Skris * 3655714Skris * from: @(#)vm_object.h 8.3 (Berkeley) 1/12/94 3755714Skris * 3855714Skris * 3955714Skris * Copyright (c) 1987, 1990 Carnegie-Mellon University. 4055714Skris * All rights reserved. 4155714Skris * 4255714Skris * Authors: Avadis Tevanian, Jr., Michael Wayne Young 4355714Skris * 4455714Skris * Permission to use, copy, modify and distribute this software and 4555714Skris * its documentation is hereby granted, provided that both the copyright 4655714Skris * notice and this permission notice appear in all copies of the 4755714Skris * software, derivative works or modified versions, and any portions 4855714Skris * thereof, and that both notices appear in supporting documentation. 4955714Skris * 5055714Skris * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 5155714Skris * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 5255714Skris * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 5355714Skris * 5455714Skris * Carnegie Mellon requests users of this software to return to 5555714Skris * 5655714Skris * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 5755714Skris * School of Computer Science 5855714Skris * Carnegie Mellon University 5955714Skris * Pittsburgh PA 15213-3890 6055714Skris * 6155714Skris * any improvements or extensions that they make and grant Carnegie the 62109998Smarkm * rights to redistribute these changes. 6355714Skris * 6455714Skris * $Id: vm_object.h,v 1.6 1995/02/02 09:08:56 davidg Exp $ 6555714Skris */ 6655714Skris 6755714Skris/* 6855714Skris * Virtual memory object module definitions. 6955714Skris */ 7055714Skris 7155714Skris#ifndef _VM_OBJECT_ 7255714Skris#define _VM_OBJECT_ 7355714Skris 7455714Skris#include <vm/vm_page.h> 7555714Skris#include <vm/vm_pager.h> 7655714Skris 7755714Skris/* 7855714Skris * Types defined: 7955714Skris * 8055714Skris * vm_object_t Virtual memory object. 8155714Skris */ 8255714Skris 8355714Skrisstruct vm_object { 8455714Skris struct pglist memq; /* Resident memory */ 8555714Skris TAILQ_HEAD(rslist, vm_object) reverse_shadow_head; /* objects that this is a shadow for */ 8655714Skris TAILQ_ENTRY(vm_object) object_list; /* list of all objects */ 8755714Skris TAILQ_ENTRY(vm_object) reverse_shadow_list; /* chain of objects that are shadowed */ 8855714Skris TAILQ_ENTRY(vm_object) cached_list; /* for persistence */ 8955714Skris vm_size_t size; /* Object size */ 9055714Skris int ref_count; /* How many refs?? */ 9155714Skris struct { 9259191Skris int recursion; /* object locking */ 9355714Skris struct proc *proc; /* process owned */ 9455714Skris } lock; 9555714Skris u_short flags; /* see below */ 9655714Skris u_short paging_in_progress; /* Paging (in or out) so don't collapse or destroy */ 9755714Skris int resident_page_count; /* number of resident pages */ 9855714Skris vm_pager_t pager; /* Where to get data */ 9955714Skris vm_offset_t paging_offset; /* Offset into paging space */ 10055714Skris struct vm_object *shadow; /* My shadow */ 10155714Skris vm_offset_t shadow_offset; /* Offset in shadow */ 10255714Skris struct vm_object *copy; /* Object that holds copies of my changed pages */ 10355714Skris vm_offset_t last_read; /* last read in object -- detect seq behavior */ 10455714Skris}; 10555714Skris 10655714Skris/* 10755714Skris * Flags 10855714Skris */ 10955714Skris#define OBJ_CANPERSIST 0x0001 /* allow to persist */ 11055714Skris#define OBJ_INTERNAL 0x0002 /* internally created object */ 11155714Skris#define OBJ_ACTIVE 0x0004 /* used to mark active objects */ 11255714Skris#define OBJ_DEAD 0x0008 /* used to mark dead objects during rundown */ 11355714Skris#define OBJ_ILOCKED 0x0010 /* lock from modification */ 11455714Skris#define OBJ_ILOCKWT 0x0020 /* wait for lock from modification */ 11555714Skris#define OBJ_PIPWNT 0x0040 /* paging in progress wanted */ 11655714Skris 11755714SkrisTAILQ_HEAD(vm_object_hash_head, vm_object_hash_entry); 118 119struct vm_object_hash_entry { 120 TAILQ_ENTRY(vm_object_hash_entry) hash_links; /* hash chain links */ 121 vm_object_t object; /* object represened */ 122}; 123 124typedef struct vm_object_hash_entry *vm_object_hash_entry_t; 125 126#ifdef KERNEL 127TAILQ_HEAD(object_q, vm_object); 128 129struct object_q vm_object_cached_list; /* list of objects persisting */ 130int vm_object_cached; /* size of cached list */ 131simple_lock_data_t vm_cache_lock; /* lock for object cache */ 132 133struct object_q vm_object_list; /* list of allocated objects */ 134long vm_object_count; /* count of all objects */ 135simple_lock_data_t vm_object_list_lock; 136 137 /* lock for object list and count */ 138 139vm_object_t kernel_object; /* the single kernel object */ 140vm_object_t kmem_object; 141 142#define vm_object_cache_lock() simple_lock(&vm_cache_lock) 143#define vm_object_cache_unlock() simple_unlock(&vm_cache_lock) 144#endif /* KERNEL */ 145 146#define vm_object_sleep(event, object, interruptible) \ 147 thread_sleep((event), &(object)->Lock, (interruptible)) 148#if 0 149#define vm_object_lock_init(object) simple_lock_init(&(object)->Lock) 150#define vm_object_lock(object) simple_lock(&(object)->Lock) 151#define vm_object_unlock(object) simple_unlock(&(object)->Lock) 152#define vm_object_lock_try(object) simple_lock_try(&(object)->Lock) 153#endif 154#define vm_object_lock_init(object) (object->flags &= ~OBJ_ILOCKED, object->lock.recursion = 0, object->lock.proc = 0) 155 156static __inline void 157vm_object_lock(vm_object_t obj) 158{ 159 if (obj->flags & OBJ_ILOCKED) { 160 ++obj->lock.recursion; 161 return; 162 } 163 obj->flags |= OBJ_ILOCKED; 164 obj->lock.recursion = 1; 165} 166 167static __inline void 168vm_object_unlock(vm_object_t obj) 169{ 170 --obj->lock.recursion; 171 if (obj->lock.recursion != 0) 172 return; 173 obj->flags &= ~OBJ_ILOCKED; 174} 175 176static __inline int 177vm_object_lock_try(vm_object_t obj) 178{ 179 if (obj->flags & OBJ_ILOCKED) { 180 ++obj->lock.recursion; 181 return 1; 182 } 183 obj->flags |= OBJ_ILOCKED; 184 obj->lock.recursion = 1; 185 return 1; 186} 187 188#ifdef KERNEL 189vm_object_t vm_object_allocate __P((vm_size_t)); 190void vm_object_cache_clear __P((void)); 191void vm_object_cache_trim __P((void)); 192boolean_t vm_object_coalesce __P((vm_object_t, vm_object_t, vm_offset_t, vm_offset_t, vm_offset_t, vm_size_t)); 193void vm_object_collapse __P((vm_object_t)); 194void vm_object_copy __P((vm_object_t, vm_offset_t, vm_size_t, vm_object_t *, vm_offset_t *, boolean_t *)); 195void vm_object_deactivate_pages __P((vm_object_t)); 196void vm_object_deallocate __P((vm_object_t)); 197void vm_object_enter __P((vm_object_t, vm_pager_t)); 198void vm_object_init __P((vm_size_t)); 199vm_object_t vm_object_lookup __P((vm_pager_t)); 200boolean_t vm_object_page_clean __P((vm_object_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t)); 201void vm_object_page_remove __P((vm_object_t, vm_offset_t, vm_offset_t)); 202void vm_object_pmap_copy __P((vm_object_t, vm_offset_t, vm_offset_t)); 203void vm_object_pmap_remove __P((vm_object_t, vm_offset_t, vm_offset_t)); 204void vm_object_print __P((vm_object_t, boolean_t)); 205void vm_object_reference __P((vm_object_t)); 206void vm_object_remove __P((vm_pager_t)); 207void vm_object_setpager __P((vm_object_t, vm_pager_t, vm_offset_t, boolean_t)); 208void vm_object_shadow __P((vm_object_t *, vm_offset_t *, vm_size_t)); 209void vm_object_terminate __P((vm_object_t)); 210 211#endif 212#endif /* _VM_OBJECT_ */ 213