Deleted Added
full compact
vm_object.h (4203) vm_object.h (5455)
1/*
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

--- 25 unchanged lines hidden (view full) ---

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
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

--- 25 unchanged lines hidden (view full) ---

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 *
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.
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
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.
52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
53 *
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 *
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 * $Id: vm_object.h,v 1.2 1994/08/02 07:55:31 davidg Exp $
64 * $Id: vm_object.h,v 1.3 1994/11/06 05:07:52 davidg Exp $
65 */
66
67/*
68 * Virtual memory object module definitions.
69 */
70
71#ifndef _VM_OBJECT_
72#define _VM_OBJECT_
73
74#include <vm/vm_page.h>
75#include <vm/vm_pager.h>
76
77/*
78 * Types defined:
79 *
80 * vm_object_t Virtual memory object.
81 */
82
83struct vm_object {
65 */
66
67/*
68 * Virtual memory object module definitions.
69 */
70
71#ifndef _VM_OBJECT_
72#define _VM_OBJECT_
73
74#include <vm/vm_page.h>
75#include <vm/vm_pager.h>
76
77/*
78 * Types defined:
79 *
80 * vm_object_t Virtual memory object.
81 */
82
83struct vm_object {
84 struct pglist memq; /* Resident memory */
85 TAILQ_ENTRY(vm_object) object_list; /* list of all objects */
86 u_short flags; /* see below */
87 u_short paging_in_progress; /* Paging (in or out) so
88 don't collapse or destroy */
89 simple_lock_data_t Lock; /* Synchronization */
90 int ref_count; /* How many refs?? */
91 vm_size_t size; /* Object size */
92 int resident_page_count;
93 /* number of resident pages */
94 struct vm_object *copy; /* Object that holds copies of
95 my changed pages */
96 vm_pager_t pager; /* Where to get data */
97 vm_offset_t paging_offset; /* Offset into paging space */
98 struct vm_object *shadow; /* My shadow */
99 vm_offset_t shadow_offset; /* Offset in shadow */
100 TAILQ_ENTRY(vm_object) cached_list; /* for persistence */
101 TAILQ_ENTRY(vm_object) reverse_shadow_list; /* chain of objects that are shadowed */
102 TAILQ_HEAD(rslist, vm_object) reverse_shadow_head; /* objects that this is a shadow for */
84 struct pglist memq; /* Resident memory */
85 TAILQ_ENTRY(vm_object) object_list; /* list of all objects */
86 u_short flags; /* see below */
87 u_short paging_in_progress; /* Paging (in or out) so don't collapse or destroy */
88 int ref_count; /* How many refs?? */
89 struct {
90 int recursion; /* object locking */
91 struct proc *proc; /* process owned */
92 } lock;
93 vm_size_t size; /* Object size */
94 int resident_page_count;
95 /* number of resident pages */
96 struct vm_object *copy; /* Object that holds copies of my changed pages */
97 vm_pager_t pager; /* Where to get data */
98 vm_offset_t paging_offset; /* Offset into paging space */
99 struct vm_object *shadow; /* My shadow */
100 vm_offset_t shadow_offset; /* Offset in shadow */
101 TAILQ_ENTRY(vm_object) cached_list; /* for persistence */
102 TAILQ_ENTRY(vm_object) reverse_shadow_list; /* chain of objects that are shadowed */
103 TAILQ_HEAD(rslist, vm_object) reverse_shadow_head; /* objects that this is a shadow for */
103};
104};
105
104/*
105 * Flags
106 */
106/*
107 * Flags
108 */
107#define OBJ_CANPERSIST 0x0001 /* allow to persist */
108#define OBJ_INTERNAL 0x0002 /* internally created object */
109#define OBJ_ACTIVE 0x0004 /* used to mark active objects */
109#define OBJ_CANPERSIST 0x0001 /* allow to persist */
110#define OBJ_INTERNAL 0x0002 /* internally created object */
111#define OBJ_ACTIVE 0x0004 /* used to mark active objects */
112#define OBJ_DEAD 0x0008 /* used to mark dead objects during rundown */
113#define OBJ_ILOCKED 0x0010 /* lock from modification */
114#define OBJ_ILOCKWT 0x0020 /* wait for lock from modification */
110
111TAILQ_HEAD(vm_object_hash_head, vm_object_hash_entry);
112
113struct vm_object_hash_entry {
115
116TAILQ_HEAD(vm_object_hash_head, vm_object_hash_entry);
117
118struct vm_object_hash_entry {
114 TAILQ_ENTRY(vm_object_hash_entry) hash_links; /* hash chain links */
115 vm_object_t object; /* object represened */
119 TAILQ_ENTRY(vm_object_hash_entry) hash_links; /* hash chain links */
120 vm_object_t object; /* object represened */
116};
117
121};
122
118typedef struct vm_object_hash_entry *vm_object_hash_entry_t;
123typedef struct vm_object_hash_entry *vm_object_hash_entry_t;
119
120#ifdef KERNEL
121TAILQ_HEAD(object_q, vm_object);
122
124
125#ifdef KERNEL
126TAILQ_HEAD(object_q, vm_object);
127
123struct object_q vm_object_cached_list; /* list of objects persisting */
124int vm_object_cached; /* size of cached list */
125simple_lock_data_t vm_cache_lock; /* lock for object cache */
128struct object_q vm_object_cached_list; /* list of objects persisting */
129int vm_object_cached; /* size of cached list */
130simple_lock_data_t vm_cache_lock; /* lock for object cache */
126
131
127struct object_q vm_object_list; /* list of allocated objects */
128long vm_object_count; /* count of all objects */
129simple_lock_data_t vm_object_list_lock;
130 /* lock for object list and count */
132struct object_q vm_object_list; /* list of allocated objects */
133long vm_object_count; /* count of all objects */
134simple_lock_data_t vm_object_list_lock;
131
135
132vm_object_t kernel_object; /* the single kernel object */
133vm_object_t kmem_object;
136 /* lock for object list and count */
134
137
138vm_object_t kernel_object; /* the single kernel object */
139vm_object_t kmem_object;
140
135#define vm_object_cache_lock() simple_lock(&vm_cache_lock)
136#define vm_object_cache_unlock() simple_unlock(&vm_cache_lock)
141#define vm_object_cache_lock() simple_lock(&vm_cache_lock)
142#define vm_object_cache_unlock() simple_unlock(&vm_cache_lock)
137#endif /* KERNEL */
143#endif /* KERNEL */
138
144
145#define vm_object_sleep(event, object, interruptible) \
146 thread_sleep((event), &(object)->Lock, (interruptible))
147#if 0
139#define vm_object_lock_init(object) simple_lock_init(&(object)->Lock)
140#define vm_object_lock(object) simple_lock(&(object)->Lock)
141#define vm_object_unlock(object) simple_unlock(&(object)->Lock)
142#define vm_object_lock_try(object) simple_lock_try(&(object)->Lock)
148#define vm_object_lock_init(object) simple_lock_init(&(object)->Lock)
149#define vm_object_lock(object) simple_lock(&(object)->Lock)
150#define vm_object_unlock(object) simple_unlock(&(object)->Lock)
151#define vm_object_lock_try(object) simple_lock_try(&(object)->Lock)
143#define vm_object_sleep(event, object, interruptible) \
144 thread_sleep((event), &(object)->Lock, (interruptible))
152#endif
153#define vm_object_lock_init(object) (object->flags &= ~OBJ_ILOCKED, object->lock.recursion = 0, object->lock.proc = 0)
145
154
155static __inline void
156vm_object_lock(vm_object_t obj)
157{
158 if (obj->flags & OBJ_ILOCKED) {
159 ++obj->lock.recursion;
160 return;
161 }
162 obj->flags |= OBJ_ILOCKED;
163 obj->lock.recursion = 1;
164}
165
166static __inline void
167vm_object_unlock(vm_object_t obj)
168{
169 --obj->lock.recursion;
170 if (obj->lock.recursion != 0)
171 return;
172 obj->flags &= ~OBJ_ILOCKED;
173}
174
175static __inline int
176vm_object_lock_try(vm_object_t obj)
177{
178 if (obj->flags & OBJ_ILOCKED) {
179 ++obj->lock.recursion;
180 return 1;
181 }
182 obj->flags |= OBJ_ILOCKED;
183 obj->lock.recursion = 1;
184 return 1;
185}
186
146#ifdef KERNEL
187#ifdef KERNEL
147vm_object_t vm_object_allocate __P((vm_size_t));
148void vm_object_cache_clear __P((void));
149void vm_object_cache_trim __P((void));
150boolean_t vm_object_coalesce __P((vm_object_t, vm_object_t,
151 vm_offset_t, vm_offset_t, vm_offset_t, vm_size_t));
152void vm_object_collapse __P((vm_object_t));
153void vm_object_copy __P((vm_object_t, vm_offset_t, vm_size_t,
154 vm_object_t *, vm_offset_t *, boolean_t *));
155void vm_object_deactivate_pages __P((vm_object_t));
156void vm_object_deallocate __P((vm_object_t));
157void vm_object_enter __P((vm_object_t, vm_pager_t));
158void vm_object_init __P((vm_size_t));
159vm_object_t vm_object_lookup __P((vm_pager_t));
160boolean_t vm_object_page_clean __P((vm_object_t,
161 vm_offset_t, vm_offset_t, boolean_t, boolean_t));
162void vm_object_page_remove __P((vm_object_t,
163 vm_offset_t, vm_offset_t));
164void vm_object_pmap_copy __P((vm_object_t,
165 vm_offset_t, vm_offset_t));
166void vm_object_pmap_remove __P((vm_object_t,
167 vm_offset_t, vm_offset_t));
168void vm_object_print __P((vm_object_t, boolean_t));
169void vm_object_reference __P((vm_object_t));
170void vm_object_remove __P((vm_pager_t));
171void vm_object_setpager __P((vm_object_t,
172 vm_pager_t, vm_offset_t, boolean_t));
173void vm_object_shadow __P((vm_object_t *,
174 vm_offset_t *, vm_size_t));
175void vm_object_terminate __P((vm_object_t));
188vm_object_t vm_object_allocate __P((vm_size_t));
189void vm_object_cache_clear __P((void));
190void vm_object_cache_trim __P((void));
191boolean_t vm_object_coalesce __P((vm_object_t, vm_object_t, vm_offset_t, vm_offset_t, vm_offset_t, vm_size_t));
192void vm_object_collapse __P((vm_object_t));
193void vm_object_copy __P((vm_object_t, vm_offset_t, vm_size_t, vm_object_t *, vm_offset_t *, boolean_t *));
194void vm_object_deactivate_pages __P((vm_object_t));
195void vm_object_deallocate __P((vm_object_t));
196void vm_object_enter __P((vm_object_t, vm_pager_t));
197void vm_object_init __P((vm_size_t));
198vm_object_t vm_object_lookup __P((vm_pager_t));
199boolean_t vm_object_page_clean __P((vm_object_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t));
200void vm_object_page_remove __P((vm_object_t, vm_offset_t, vm_offset_t));
201void vm_object_pmap_copy __P((vm_object_t, vm_offset_t, vm_offset_t));
202void vm_object_pmap_remove __P((vm_object_t, vm_offset_t, vm_offset_t));
203void vm_object_print __P((vm_object_t, boolean_t));
204void vm_object_reference __P((vm_object_t));
205void vm_object_remove __P((vm_pager_t));
206void vm_object_setpager __P((vm_object_t, vm_pager_t, vm_offset_t, boolean_t));
207void vm_object_shadow __P((vm_object_t *, vm_offset_t *, vm_size_t));
208void vm_object_terminate __P((vm_object_t));
209
176#endif
210#endif
177#endif /* _VM_OBJECT_ */
211#endif /* _VM_OBJECT_ */