vm_object.h revision 233100
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 * 4. Neither the name of the University nor the names of its contributors
17 *    may be used to endorse or promote products derived from this software
18 *    without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 *	from: @(#)vm_object.h	8.3 (Berkeley) 1/12/94
33 *
34 *
35 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
36 * All rights reserved.
37 *
38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
39 *
40 * Permission to use, copy, modify and distribute this software and
41 * its documentation is hereby granted, provided that both the copyright
42 * notice and this permission notice appear in all copies of the
43 * software, derivative works or modified versions, and any portions
44 * thereof, and that both notices appear in supporting documentation.
45 *
46 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
47 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
48 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
49 *
50 * Carnegie Mellon requests users of this software to return to
51 *
52 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
53 *  School of Computer Science
54 *  Carnegie Mellon University
55 *  Pittsburgh PA 15213-3890
56 *
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
59 *
60 * $FreeBSD: head/sys/vm/vm_object.h 233100 2012-03-17 23:00:32Z kib $
61 */
62
63/*
64 *	Virtual memory object module definitions.
65 */
66
67#ifndef	_VM_OBJECT_
68#define	_VM_OBJECT_
69
70#include <sys/queue.h>
71#include <sys/_lock.h>
72#include <sys/_mutex.h>
73
74/*
75 *	Types defined:
76 *
77 *	vm_object_t		Virtual memory object.
78 *
79 * List of locks
80 *	(c)	const until freed
81 *
82 */
83
84struct vm_object {
85	struct mtx mtx;
86	TAILQ_ENTRY(vm_object) object_list; /* list of all objects */
87	LIST_HEAD(, vm_object) shadow_head; /* objects that this is a shadow for */
88	LIST_ENTRY(vm_object) shadow_list; /* chain of shadow objects */
89	TAILQ_HEAD(, vm_page) memq;	/* list of resident pages */
90	vm_page_t root;			/* root of the resident page splay tree */
91	vm_pindex_t size;		/* Object size */
92	int generation;			/* generation ID */
93	int ref_count;			/* How many refs?? */
94	int shadow_count;		/* how many objects that this is a shadow for */
95	vm_memattr_t memattr;		/* default memory attribute for pages */
96	objtype_t type;			/* type of pager */
97	u_short flags;			/* see below */
98	u_short pg_color;		/* (c) color of first page in obj */
99	u_int paging_in_progress;	/* Paging (in or out) so don't collapse or destroy */
100	int resident_page_count;	/* number of resident pages */
101	struct vm_object *backing_object; /* object that I'm a shadow of */
102	vm_ooffset_t backing_object_offset;/* Offset in backing object */
103	TAILQ_ENTRY(vm_object) pager_object_list; /* list of all objects of this pager type */
104	LIST_HEAD(, vm_reserv) rvq;	/* list of reservations */
105	vm_page_t cache;		/* root of the cache page splay tree */
106	void *handle;
107	union {
108		/*
109		 * VNode pager
110		 *
111		 *	vnp_size - current size of file
112		 */
113		struct {
114			off_t vnp_size;
115			vm_ooffset_t writemappings;
116		} vnp;
117
118		/*
119		 * Device pager
120		 *
121		 *	devp_pglist - list of allocated pages
122		 */
123		struct {
124			TAILQ_HEAD(, vm_page) devp_pglist;
125			struct cdev_pager_ops *ops;
126		} devp;
127
128		/*
129		 * SG pager
130		 *
131		 *	sgp_pglist - list of allocated pages
132		 */
133		struct {
134			TAILQ_HEAD(, vm_page) sgp_pglist;
135		} sgp;
136
137		/*
138		 * Swap pager
139		 *
140		 *	swp_bcount - number of swap 'swblock' metablocks, each
141		 *		     contains up to 16 swapblk assignments.
142		 *		     see vm/swap_pager.h
143		 */
144		struct {
145			int swp_bcount;
146		} swp;
147	} un_pager;
148	struct ucred *cred;
149	vm_ooffset_t charge;
150};
151
152/*
153 * Flags
154 */
155#define OBJ_ACTIVE	0x0004		/* active objects */
156#define OBJ_DEAD	0x0008		/* dead objects (during rundown) */
157#define	OBJ_NOSPLIT	0x0010		/* dont split this object */
158#define OBJ_PIPWNT	0x0040		/* paging in progress wanted */
159#define OBJ_MIGHTBEDIRTY 0x0100		/* object might be dirty, only for vnode */
160#define	OBJ_COLORED	0x1000		/* pg_color is defined */
161#define	OBJ_ONEMAPPING	0x2000		/* One USE (a single, non-forked) mapping flag */
162#define	OBJ_DISCONNECTWNT 0x4000	/* disconnect from vnode wanted */
163
164#define IDX_TO_OFF(idx) (((vm_ooffset_t)(idx)) << PAGE_SHIFT)
165#define OFF_TO_IDX(off) ((vm_pindex_t)(((vm_ooffset_t)(off)) >> PAGE_SHIFT))
166
167#ifdef	_KERNEL
168
169#define OBJPC_SYNC	0x1			/* sync I/O */
170#define OBJPC_INVAL	0x2			/* invalidate */
171#define OBJPC_NOSYNC	0x4			/* skip if PG_NOSYNC */
172
173/*
174 * The following options are supported by vm_object_page_remove().
175 */
176#define	OBJPR_CLEANONLY	0x1		/* Don't remove dirty pages. */
177#define	OBJPR_NOTMAPPED	0x2		/* Don't unmap pages. */
178
179TAILQ_HEAD(object_q, vm_object);
180
181extern struct object_q vm_object_list;	/* list of allocated objects */
182extern struct mtx vm_object_list_mtx;	/* lock for object list and count */
183
184extern struct vm_object kernel_object_store;
185extern struct vm_object kmem_object_store;
186
187#define	kernel_object	(&kernel_object_store)
188#define	kmem_object	(&kmem_object_store)
189
190#define	VM_OBJECT_LOCK(object)		mtx_lock(&(object)->mtx)
191#define	VM_OBJECT_LOCK_ASSERT(object, type) \
192					mtx_assert(&(object)->mtx, (type))
193#define	VM_OBJECT_LOCK_INIT(object, type) \
194					mtx_init(&(object)->mtx, "vm object", \
195					    (type), MTX_DEF | MTX_DUPOK)
196#define	VM_OBJECT_LOCKED(object)	mtx_owned(&(object)->mtx)
197#define	VM_OBJECT_MTX(object)		(&(object)->mtx)
198#define	VM_OBJECT_TRYLOCK(object)	mtx_trylock(&(object)->mtx)
199#define	VM_OBJECT_UNLOCK(object)	mtx_unlock(&(object)->mtx)
200
201/*
202 *	The object must be locked or thread private.
203 */
204static __inline void
205vm_object_set_flag(vm_object_t object, u_short bits)
206{
207
208	object->flags |= bits;
209}
210
211void vm_object_clear_flag(vm_object_t object, u_short bits);
212void vm_object_pip_add(vm_object_t object, short i);
213void vm_object_pip_subtract(vm_object_t object, short i);
214void vm_object_pip_wakeup(vm_object_t object);
215void vm_object_pip_wakeupn(vm_object_t object, short i);
216void vm_object_pip_wait(vm_object_t object, char *waitid);
217
218vm_object_t vm_object_allocate (objtype_t, vm_pindex_t);
219void _vm_object_allocate (objtype_t, vm_pindex_t, vm_object_t);
220boolean_t vm_object_coalesce(vm_object_t, vm_ooffset_t, vm_size_t, vm_size_t,
221   boolean_t);
222void vm_object_collapse (vm_object_t);
223void vm_object_deallocate (vm_object_t);
224void vm_object_destroy (vm_object_t);
225void vm_object_terminate (vm_object_t);
226void vm_object_set_writeable_dirty (vm_object_t);
227void vm_object_init (void);
228void vm_object_page_cache(vm_object_t object, vm_pindex_t start,
229    vm_pindex_t end);
230boolean_t vm_object_page_clean(vm_object_t object, vm_ooffset_t start,
231    vm_ooffset_t end, int flags);
232void vm_object_page_remove(vm_object_t object, vm_pindex_t start,
233    vm_pindex_t end, int options);
234boolean_t vm_object_populate(vm_object_t, vm_pindex_t, vm_pindex_t);
235void vm_object_print(long addr, boolean_t have_addr, long count, char *modif);
236void vm_object_reference (vm_object_t);
237void vm_object_reference_locked(vm_object_t);
238int  vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr);
239void vm_object_shadow (vm_object_t *, vm_ooffset_t *, vm_size_t);
240void vm_object_split(vm_map_entry_t);
241boolean_t vm_object_sync(vm_object_t, vm_ooffset_t, vm_size_t, boolean_t,
242    boolean_t);
243void vm_object_madvise (vm_object_t, vm_pindex_t, int, int);
244#endif				/* _KERNEL */
245
246#endif				/* _VM_OBJECT_ */
247