]> git.saurik.com Git - apple/xnu.git/blame - osfmk/default_pager/default_pager_internal.h
xnu-344.tar.gz
[apple/xnu.git] / osfmk / default_pager / default_pager_internal.h
CommitLineData
1c79356b
A
1/*
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
11 *
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
18 * under the License.
19 *
20 * @APPLE_LICENSE_HEADER_END@
21 */
22/*
23 * @OSF_COPYRIGHT@
24 */
25/*
26 * Mach Operating System
27 * Copyright (c) 1991,1990,1989 Carnegie Mellon University
28 * All Rights Reserved.
29 *
30 * Permission to use, copy, modify and distribute this software and its
31 * documentation is hereby granted, provided that both the copyright
32 * notice and this permission notice appear in all copies of the
33 * software, derivative works or modified versions, and any portions
34 * thereof, and that both notices appear in supporting documentation.
35 *
36 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
37 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
38 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
39 *
40 * Carnegie Mellon requests users of this software to return to
41 *
42 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
43 * School of Computer Science
44 * Carnegie Mellon University
45 * Pittsburgh PA 15213-3890
46 *
47 * any improvements or extensions that they make and grant Carnegie Mellon
48 * the rights to redistribute these changes.
49 */
50
51/*
52 * Default pager.
53 * General definitions.
54 */
55
56#ifndef _DEFAULT_PAGER_INTERNAL_H_
57#define _DEFAULT_PAGER_INTERNAL_H_
58
59#include <default_pager/diag.h>
60#include <default_pager/default_pager_types.h>
61#include <mach/mach_types.h>
62#include <ipc/ipc_port.h>
63#include <ipc/ipc_types.h>
64#include <ipc/ipc_space.h>
65#include <kern/lock.h>
66#include <kern/kalloc.h>
67#include <kern/thread.h>
68#include <vm/vm_kern.h>
69#include <device/device_types.h>
70
71/*
72 * Default option settings.
73 */
74#ifndef PARALLEL
75#define PARALLEL 1
76#endif
77
78#ifndef CHECKSUM
79#define CHECKSUM 0
80#endif
81
82#define MACH_PORT_FACE mach_port_t
83
0b4e3aa0 84#if 0
1c79356b
A
85#ifndef USE_PRECIOUS
86#define USE_PRECIOUS TRUE
87#endif
0b4e3aa0 88#endif
1c79356b
A
89
90#ifdef USER_PAGER
91#define UP(stuff) stuff
92#else /* USER_PAGER */
93#define UP(stuff)
94#endif /* USER_PAGER */
95
1c79356b
A
96#ifndef MACH_KERNEL
97extern struct mutex dprintf_lock;
98#define PRINTF_LOCK_INIT() mutex_init(&dprintf_lock)
99#define PRINTF_LOCK() mutex_lock(&dprintf_lock)
100#define PRINTF_UNLOCK() mutex_unlock(&dprintf_lock)
101#endif
102
103#ifndef MACH_KERNEL
104#define dprintf(args) \
105 do { \
106 PRINTF_LOCK(); \
0b4e3aa0 107 printf("%s[%d]: ", my_name, dp_thread_id()); \
1c79356b
A
108 printf args; \
109 PRINTF_UNLOCK(); \
110 } while (0)
111#else
112#define dprintf(args) \
113 do { \
0b4e3aa0 114 printf("%s[KERNEL]: ", my_name); \
1c79356b
A
115 printf args; \
116 } while (0)
117#endif
118
119/*
120 * Debug.
121 */
0b4e3aa0 122__private_extern__ char my_name[];
1c79356b
A
123
124#define DEFAULT_PAGER_DEBUG 0
125
126#if DEFAULT_PAGER_DEBUG
127
128extern int debug_mask;
129#define DEBUG_MSG_EXTERNAL 0x00000001
130#define DEBUG_MSG_INTERNAL 0x00000002
131#define DEBUG_MO_EXTERNAL 0x00000100
132#define DEBUG_MO_INTERNAL 0x00000200
133#define DEBUG_VS_EXTERNAL 0x00010000
134#define DEBUG_VS_INTERNAL 0x00020000
135#define DEBUG_BS_EXTERNAL 0x01000000
136#define DEBUG_BS_INTERNAL 0x02000000
137
138#define DEBUG(level, args) \
139 do { \
140 if (debug_mask & (level)) \
141 dprintf(args); \
142 } while (0)
143
144#define ASSERT(expr) \
145 do { \
146 if (!(expr)) \
147#ifndef MACH_KERNEL
148 panic("%s[%d]%s: assertion failed in %s line %d: %s",\
149 my_name, dp_thread_id(), here, \
150 __FILE__, __LINE__, # expr); \
151#else
0b4e3aa0
A
152 panic("%s[KERNEL]: assertion failed in %s line %d: %s",\
153 my_name, __FILE__, __LINE__, # expr); \
1c79356b
A
154#endif
155 } while (0)
156
157#else /* DEFAULT_PAGER_DEBUG */
158
0b4e3aa0
A
159#define DEBUG(level, args)
160#define ASSERT(clause)
1c79356b
A
161
162#endif /* DEFAULT_PAGER_DEBUG */
163
164#ifndef MACH_KERNEL
165extern char *mach_error_string(kern_return_t);
166#endif
167
168#define MIN(a,b) (((a) < (b)) ? (a) : (b))
169
170#define PAGER_SUCCESS 0
171#define PAGER_FULL 1
172#define PAGER_ERROR 2
173
174/*
175 * VM and IPC globals.
176 */
177#ifdef MACH_KERNEL
178#define vm_page_size page_size
179extern vm_size_t page_size;
180#else
181extern vm_object_size_t vm_page_size;
182#endif
183extern unsigned long long vm_page_mask;
184extern int vm_page_shift;
185
186#ifndef MACH_KERNEL
187#define ptoa(p) ((p)*vm_page_size)
188#define atop(a) ((a)/vm_page_size)
189#endif
190#define howmany(a,b) (((a) + (b) - 1)/(b))
191
0b4e3aa0
A
192extern memory_object_default_t default_pager_object;
193
1c79356b
A
194#ifdef MACH_KERNEL
195extern mutex_t dpt_lock; /* Lock for the dpt array */
196extern unsigned int default_pager_internal_count;
197extern MACH_PORT_FACE default_pager_host_port;
198/* extern task_t default_pager_self; */ /* dont need or want */
199extern MACH_PORT_FACE default_pager_internal_set;
200extern MACH_PORT_FACE default_pager_external_set;
1c79356b
A
201extern MACH_PORT_FACE default_pager_default_set;
202#else
203extern mach_port_t default_pager_host_port;
204extern task_port_t default_pager_self;
205extern mach_port_t default_pager_internal_set;
206extern mach_port_t default_pager_external_set;
1c79356b
A
207extern mach_port_t default_pager_default_set;
208#endif
209
210typedef struct default_pager_thread {
211#ifndef MACH_KERNEL
212 cthread_t dpt_thread; /* Server thread. */
213#endif
214 vm_offset_t dpt_buffer; /* Read buffer. */
215 boolean_t dpt_internal; /* Do we handle internal objects? */
216#ifndef MACH_KERNEL
217 int dpt_id; /* thread id for printf */
218#else
219 int checked_out;
220#endif
221 boolean_t dpt_initialized_p; /* Thread is ready for requests. */
222} default_pager_thread_t;
223
224#ifdef MACH_KERNEL
225extern default_pager_thread_t **dpt_array;
226#endif
227
228/*
229 * Global statistics.
230 */
231struct {
232 unsigned int gs_pageout_calls; /* # pageout calls */
233 unsigned int gs_pagein_calls; /* # pagein calls */
234 unsigned int gs_pages_in; /* # pages paged in (total) */
235 unsigned int gs_pages_out; /* # pages paged out (total) */
236 unsigned int gs_pages_unavail; /* # zero-fill pages */
237 unsigned int gs_pages_init; /* # page init requests */
238 unsigned int gs_pages_init_writes; /* # page init writes */
239 VSTATS_LOCK_DECL(gs_lock)
240} global_stats;
241#define GSTAT(clause) VSTATS_ACTION(&global_stats.gs_lock, (clause))
242
243/*
244 * Cluster related definitions.
245 * Clusters are sized in number of pages per cluster.
246 * Cluster sizes must be powers of two.
247 *
248 * These numbers are related to the struct vs_map,
249 * defined below.
250 */
251#define MAX_CLUSTER_SIZE 8
252#define MAX_CLUSTER_SHIFT 3
253#define NO_CLSIZE 0
254
255/*
256 * bit map related macros
257 */
258#define NBBY 8 /* bits per byte XXX */
259#define BYTEMASK 0xff
260#define setbit(a,i) (*(((char *)(a)) + ((i)/NBBY)) |= 1<<((i)%NBBY))
261#define clrbit(a,i) (*(((char *)(a)) + ((i)/NBBY)) &= ~(1<<((i)%NBBY)))
262#define isset(a,i) (*(((char *)(a)) + ((i)/NBBY)) & (1<<((i)%NBBY)))
263#define isclr(a,i) ((*(((char *)(a)) + ((i)/NBBY)) & (1<<((i)%NBBY))) == 0)
264
265/*
266 * Default Pager.
267 * Backing Store Management.
268 */
269
270#define BS_MAXPRI 4
271#define BS_MINPRI 0
272#define BS_NOPRI -1
273#define BS_FULLPRI -2
274
275/*
276 * Mapping between backing store port and backing store object.
277 */
278struct backing_store {
279 queue_chain_t bs_links; /* link in backing_store_list */
280#ifdef MACH_KERNEL
281 mutex_t bs_lock; /* lock for the structure */
282#else
283 struct mutex bs_lock; /* lock for the structure */
284#endif
285 MACH_PORT_FACE bs_port; /* backing store port */
286 int bs_priority;
287 int bs_clsize; /* cluster size in pages */
288
289 /* statistics */
290 unsigned int bs_pages_free; /* # unallocated pages */
291 unsigned int bs_pages_total; /* # pages (total) */
292 unsigned int bs_pages_in; /* # page read requests */
293 unsigned int bs_pages_in_fail; /* # page read errors */
294 unsigned int bs_pages_out; /* # page write requests */
295 unsigned int bs_pages_out_fail; /* # page write errors */
296};
297typedef struct backing_store *backing_store_t;
298#define BACKING_STORE_NULL ((backing_store_t) 0)
299#define BS_STAT(bs, clause) VSTATS_ACTION(&(bs)->bs_lock, (clause))
300
301#ifdef MACH_KERNEL
302#define BS_LOCK_INIT(bs) mutex_init(&(bs)->bs_lock, ETAP_DPAGE_BS)
303#else
304#define BS_LOCK_INIT(bs) mutex_init(&(bs)->bs_lock)
305#endif
306#define BS_LOCK(bs) mutex_lock(&(bs)->bs_lock)
307#define BS_UNLOCK(bs) mutex_unlock(&(bs)->bs_lock)
308
309struct backing_store_list_head {
310 queue_head_t bsl_queue;
311#ifdef MACH_KERNEL
312 mutex_t bsl_lock;
313#else
314 struct mutex bsl_lock;
315#endif
316};
317extern struct backing_store_list_head backing_store_list;
0b4e3aa0 318extern int backing_store_release_trigger_disable;
1c79356b
A
319
320#ifdef MACH_KERNEL
321#define BSL_LOCK_INIT() mutex_init(&backing_store_list.bsl_lock, ETAP_DPAGE_BSL)
322#else
323#define BSL_LOCK_INIT() mutex_init(&backing_store_list.bsl_lock)
324#endif
325#define BSL_LOCK() mutex_lock(&backing_store_list.bsl_lock)
326#define BSL_UNLOCK() mutex_unlock(&backing_store_list.bsl_lock)
327
328/*
329 * Paging segment management.
330 * Controls allocation of blocks within paging area.
331 */
332struct paging_segment {
333 /* device management */
334 union {
335 MACH_PORT_FACE dev; /* Port to device */
336 struct vnode *vnode; /* vnode for bs file */
337 } storage_type;
338 unsigned int ps_segtype; /* file type or partition */
339 MACH_PORT_FACE ps_device; /* Port to device */
340 vm_offset_t ps_offset; /* Offset of segment within device */
341 vm_offset_t ps_recnum; /* Number of device records in segment*/
342 unsigned int ps_pgnum; /* Number of pages in segment */
343 unsigned int ps_record_shift;/* Bit shift: pages to device records */
344
345 /* clusters and pages */
346 unsigned int ps_clshift; /* Bit shift: clusters to pages */
347 unsigned int ps_ncls; /* Number of clusters in segment */
348 unsigned int ps_clcount; /* Number of free clusters */
349 unsigned int ps_pgcount; /* Number of free pages */
350 long ps_hint; /* Hint of where to look next. */
351
352 /* bitmap */
353#ifdef MACH_KERNEL
354 mutex_t ps_lock; /* Lock for contents of struct */
355#else
356 struct mutex ps_lock; /* Lock for contents of struct */
357#endif
358 unsigned char *ps_bmap; /* Map of used clusters */
359
360 /* backing store */
361 backing_store_t ps_bs; /* Backing store segment belongs to */
362
363 boolean_t ps_going_away; /* Destroy attempt in progress */
364};
365
366#define ps_vnode storage_type.vnode
367#define ps_device storage_type.dev
368#define PS_PARTITION 1
369#define PS_FILE 2
370
371typedef struct paging_segment *paging_segment_t;
372
373#define PAGING_SEGMENT_NULL ((paging_segment_t) 0)
374
375#ifdef MACH_KERNEL
376#define PS_LOCK_INIT(ps) mutex_init(&(ps)->ps_lock, ETAP_DPAGE_SEGMENT)
377#else
378#define PS_LOCK_INIT(ps) mutex_init(&(ps)->ps_lock)
379#endif
380#define PS_LOCK(ps) mutex_lock(&(ps)->ps_lock)
381#define PS_UNLOCK(ps) mutex_unlock(&(ps)->ps_lock)
382
383typedef unsigned int pseg_index_t;
384
385#define INVALID_PSEG_INDEX ((pseg_index_t)-1)
386#define NULL_PSEG_INDEX ((pseg_index_t) 0)
387/*
388 * MAX_PSEG_INDEX value is related to struct vs_map below.
389 * "0" is reserved for empty map entries (no segment).
390 */
391#define MAX_PSEG_INDEX 63 /* 0 is reserved for empty map */
392#define MAX_NUM_PAGING_SEGMENTS MAX_PSEG_INDEX
393
394/* paging segments array */
395extern paging_segment_t paging_segments[MAX_NUM_PAGING_SEGMENTS];
396#ifdef MACH_KERNEL
397extern mutex_t paging_segments_lock;
398#else
399extern struct mutex paging_segments_lock;
400#endif
401extern int paging_segment_count; /* number of active paging segments */
402extern int paging_segment_max; /* highest used paging segment index */
403extern int ps_select_array[DEFAULT_PAGER_BACKING_STORE_MAXPRI+1];
404
405#ifdef MACH_KERNEL
406#define PSL_LOCK_INIT() mutex_init(&paging_segments_lock, ETAP_DPAGE_SEGLIST)
407#else
408#define PSL_LOCK_INIT() mutex_init(&paging_segments_lock)
409#endif
410#define PSL_LOCK() mutex_lock(&paging_segments_lock)
411#define PSL_UNLOCK() mutex_unlock(&paging_segments_lock)
412
413/*
414 * Vstruct manipulation. The vstruct is the pager's internal
415 * representation of vm objects it manages. There is one vstruct allocated
416 * per vm object.
417 *
418 * The following data structures are defined for vstruct and vm object
419 * management.
420 */
421
422/*
423 * vs_map
424 * A structure used only for temporary objects. It is the element
425 * contained in the vs_clmap structure, which contains information
426 * about which clusters and pages in an object are present on backing
427 * store (a paging file).
428 * Note that this structure and its associated constants may change
429 * with minimal impact on code. The only function which knows the
430 * internals of this structure is ps_clmap().
431 *
432 * If it is necessary to change the maximum number of paging segments
433 * or pages in a cluster, then this structure is the one most
434 * affected. The constants and structures which *may* change are:
435 * MAX_CLUSTER_SIZE
436 * MAX_CLUSTER_SHIFT
437 * MAX_NUM_PAGING_SEGMENTS
438 * VSTRUCT_DEF_CLSHIFT
439 * struct vs_map and associated macros and constants (VSM_*)
440 * (only the macro definitions need change, the exported (inside the
441 * pager only) interfaces remain the same; the constants are for
442 * internal vs_map manipulation only).
443 * struct clbmap (below).
444 */
445struct vs_map {
446 unsigned int vsmap_entry:23, /* offset in paging segment */
447 vsmap_psindex:8, /* paging segment */
448 vsmap_error:1,
449 vsmap_bmap:16,
450 vsmap_alloc:16;
451};
452
453typedef struct vs_map *vs_map_t;
454
455
456#define VSM_ENTRY_NULL 0x7fffff
457
458/*
459 * Exported macros for manipulating the vs_map structure --
460 * checking status, getting and setting bits.
461 */
462#define VSCLSIZE(vs) (1 << (vs)->vs_clshift)
463#define VSM_ISCLR(vsm) (((vsm).vsmap_entry == VSM_ENTRY_NULL) && \
464 ((vsm).vsmap_error == 0))
465#define VSM_ISERR(vsm) ((vsm).vsmap_error)
466#define VSM_SETCLOFF(vsm, val) ((vsm).vsmap_entry = (val))
467#define VSM_SETERR(vsm, err) ((vsm).vsmap_error = 1, \
468 (vsm).vsmap_entry = (err))
469#define VSM_GETERR(vsm) ((vsm).vsmap_entry)
470#define VSM_SETPG(vsm, page) ((vsm).vsmap_bmap |= (1 << (page)))
471#define VSM_CLRPG(vsm, page) ((vsm).vsmap_bmap &= ~(1 << (page)))
472#define VSM_SETPS(vsm, psindx) ((vsm).vsmap_psindex = (psindx))
473#define VSM_PSINDEX(vsm) ((vsm).vsmap_psindex)
474#define VSM_PS(vsm) paging_segments[(vsm).vsmap_psindex]
475#define VSM_BMAP(vsm) ((vsm).vsmap_bmap)
476#define VSM_CLOFF(vsm) ((vsm).vsmap_entry)
477#define VSM_CLR(vsm) ((vsm).vsmap_entry = VSM_ENTRY_NULL, \
478 (vsm).vsmap_psindex = 0, \
479 (vsm).vsmap_error = 0, \
480 (vsm).vsmap_bmap = 0, \
481 (vsm).vsmap_alloc = 0)
482#define VSM_ALLOC(vsm) ((vsm).vsmap_alloc)
483#define VSM_SETALLOC(vsm, page) ((vsm).vsmap_alloc |= (1 << (page)))
484#define VSM_CLRALLOC(vsm, page) ((vsm).vsmap_alloc &= ~(1 << (page)))
485
486/*
487 * Constants and macros for dealing with vstruct maps,
488 * which comprise vs_map structures, which
489 * map vm objects to backing storage (paging files and clusters).
490 */
491#define CLMAP_THRESHOLD 512 /* bytes */
492#define CLMAP_ENTRIES (CLMAP_THRESHOLD/sizeof(struct vs_map))
493#define CLMAP_SIZE(ncls) (ncls*sizeof(struct vs_map))
494
495#define INDIRECT_CLMAP_ENTRIES(ncls) (((ncls-1)/CLMAP_ENTRIES) + 1)
496#define INDIRECT_CLMAP_SIZE(ncls) (INDIRECT_CLMAP_ENTRIES(ncls) * sizeof(struct vs_map *))
497#define INDIRECT_CLMAP(size) (CLMAP_SIZE(size) > CLMAP_THRESHOLD)
498
499#define RMAPSIZE(blocks) (howmany(blocks,NBBY))
500
501#define CL_FIND 1
502#define CL_ALLOC 2
503
504/*
505 * clmap
506 *
507 * A cluster map returned by ps_clmap. It is an abstracted cluster of
508 * pages. It gives the caller information about the cluster
509 * desired. On read it tells the caller if a cluster is mapped, and if so,
510 * which of its pages are valid. It should not be referenced directly,
511 * except by ps_clmap; macros should be used. If the number of pages
512 * in a cluster needs to be more than 32, then the struct clbmap must
513 * become larger.
514 */
515struct clbmap {
516 unsigned int clb_map;
517};
518
519struct clmap {
520 paging_segment_t cl_ps; /* paging segment backing cluster */
521 int cl_numpages; /* number of valid pages */
522 struct clbmap cl_bmap; /* map of pages in cluster */
523 int cl_error; /* cluster error value */
524 struct clbmap cl_alloc; /* map of allocated pages in cluster */
525};
526
527#define CLMAP_ERROR(clm) (clm).cl_error
528#define CLMAP_PS(clm) (clm).cl_ps
529#define CLMAP_NPGS(clm) (clm).cl_numpages
530#define CLMAP_ISSET(clm,i) ((1<<(i))&((clm).cl_bmap.clb_map))
531#define CLMAP_ALLOC(clm) (clm).cl_alloc.clb_map
532/*
533 * Shift off unused bits in a partial cluster
534 */
535#define CLMAP_SHIFT(clm,vs) \
536 (clm)->cl_bmap.clb_map >>= (VSCLSIZE(vs) - (clm)->cl_numpages)
537#define CLMAP_SHIFTALLOC(clm,vs) \
538 (clm)->cl_alloc.clb_map >>= (VSCLSIZE(vs) - (clm)->cl_numpages)
539
540typedef struct vstruct_alias {
0b4e3aa0 541 int *name;
1c79356b
A
542 struct vstruct *vs;
543} vstruct_alias_t;
544
1c79356b 545#ifdef MACH_KERNEL
0b4e3aa0
A
546#define DPT_LOCK_INIT(lock) mutex_init(&(lock), ETAP_DPAGE_VSTRUCT)
547#define DPT_LOCK(lock) mutex_lock(&(lock))
548#define DPT_UNLOCK(lock) mutex_unlock(&(lock))
9bccf70c 549#define DPT_SLEEP(lock, e, i) thread_sleep_mutex(&(lock), (event_t)(e), i)
0b4e3aa0
A
550#define VS_LOCK_TYPE hw_lock_data_t
551#define VS_LOCK_INIT(vs) hw_lock_init(&(vs)->vs_lock)
552#define VS_TRY_LOCK(vs) (VS_LOCK(vs),TRUE)
553#define VS_LOCK(vs) hw_lock_lock(&(vs)->vs_lock)
554#define VS_UNLOCK(vs) hw_lock_unlock(&(vs)->vs_lock)
555#define VS_MAP_LOCK_TYPE mutex_t
556#define VS_MAP_LOCK_INIT(vs) mutex_init(&(vs)->vs_map_lock, ETAP_DPAGE_VSMAP)
557#define VS_MAP_LOCK(vs) mutex_lock(&(vs)->vs_map_lock)
558#define VS_MAP_TRY_LOCK(vs) mutex_try(&(vs)->vs_map_lock)
559#define VS_MAP_UNLOCK(vs) mutex_unlock(&(vs)->vs_map_lock)
1c79356b 560#else
0b4e3aa0
A
561#define VS_LOCK_TYPE struct mutex
562#define VS_LOCK_INIT(vs) mutex_init(&(vs)->vs_lock, ETAP_DPAGE_VSTRUCT)
563#define VS_TRY_LOCK(vs) mutex_try(&(vs)->vs_lock)
564#define VS_LOCK(vs) mutex_lock(&(vs)->vs_lock)
565#define VS_UNLOCK(vs) mutex_unlock(&(vs)->vs_lock)
566#define VS_MAP_LOCK_TYPE struct mutex
567#define VS_MAP_LOCK_INIT(vs) mutex_init(&(vs)->vs_map_lock)
568#define VS_MAP_LOCK(vs) mutex_lock(&(vs)->vs_map_lock)
569#define VS_MAP_TRY_LOCK(vs) mutex_try(&(vs)->vs_map_lock)
570#define VS_MAP_UNLOCK(vs) mutex_unlock(&(vs)->vs_map_lock)
1c79356b 571#endif
0b4e3aa0
A
572
573
574/*
575 * VM Object Structure: This is the structure used to manage
576 * default pager object associations with their control counter-
577 * parts (VM objects).
578 */
579typedef struct vstruct {
580 int *vs_mem_obj; /* our memory obj - temp */
581 int vs_mem_obj_ikot;/* JMM:fake ip_kotype() */
582 memory_object_control_t vs_control; /* our mem obj control ref */
583 VS_LOCK_TYPE vs_lock; /* data for the lock */
584
585 /* JMM - Could combine these first two in a single pending count now */
586 unsigned int vs_next_seqno; /* next sequence num to issue */
587 unsigned int vs_seqno; /* Pager port sequence number */
588 unsigned int vs_readers; /* Reads in progress */
589 unsigned int vs_writers; /* Writes in progress */
1c79356b
A
590
591#ifdef MACH_KERNEL
0b4e3aa0
A
592 int
593 /* boolean_t */ vs_waiting_seqno:1, /* to wait on seqno */
594 /* boolean_t */ vs_waiting_read:1, /* waiting on reader? */
595 /* boolean_t */ vs_waiting_write:1, /* waiting on writer? */
596 /* boolean_t */ vs_waiting_async:1, /* waiting on async? */
597 /* boolean_t */ vs_indirect:1, /* map indirect? */
598 /* boolean_t */ vs_xfer_pending:1; /* xfer out of seg? */
1c79356b 599#else
0b4e3aa0
A
600 event_t vs_waiting_seqno;/* to wait on seqno */
601 event_t vs_waiting_read; /* to wait on readers */
602 event_t vs_waiting_write;/* to wait on writers */
603 event_t vs_waiting_async;/* to wait on async_pending */
604 int vs_indirect:1, /* Is the map indirect ? */
605 vs_xfer_pending:1; /* xfering out of a seg ? */
1c79356b 606#endif
1c79356b 607
0b4e3aa0
A
608 unsigned int vs_async_pending;/* pending async write count */
609 unsigned int vs_errors; /* Pageout error count */
610 unsigned int vs_references; /* references */
1c79356b 611
0b4e3aa0
A
612 queue_chain_t vs_links; /* Link in pager-wide list */
613
614 int vs_clshift; /* Bit shift: clusters->pages */
615 int vs_size; /* Object size in clusters */
1c79356b
A
616#ifdef MACH_KERNEL
617 mutex_t vs_map_lock; /* to protect map below */
618#else
619 struct mutex vs_map_lock; /* to protect map below */
620#endif
621 union {
622 struct vs_map *vsu_dmap; /* Direct map of clusters */
623 struct vs_map **vsu_imap; /* Indirect map of clusters */
624 } vs_un;
625} *vstruct_t;
626
627#define vs_dmap vs_un.vsu_dmap
628#define vs_imap vs_un.vsu_imap
1c79356b
A
629
630#define VSTRUCT_NULL ((vstruct_t) 0)
631
0b4e3aa0
A
632__private_extern__ void vs_async_wait(vstruct_t);
633
634#if PARALLEL
635__private_extern__ void vs_lock(vstruct_t);
636__private_extern__ void vs_unlock(vstruct_t);
637__private_extern__ void vs_start_read(vstruct_t);
638__private_extern__ void vs_finish_read(vstruct_t);
639__private_extern__ void vs_wait_for_readers(vstruct_t);
640__private_extern__ void vs_start_write(vstruct_t);
641__private_extern__ void vs_finish_write(vstruct_t);
642__private_extern__ void vs_wait_for_writers(vstruct_t);
643#else /* PARALLEL */
644#define vs_lock(vs)
645#define vs_unlock(vs)
646#define vs_start_read(vs)
647#define vs_wait_for_readers(vs)
648#define vs_finish_read(vs)
649#define vs_start_write(vs)
650#define vs_wait_for_writers(vs)
651#define vs_wait_for_sync_writers(vs)
652#define vs_finish_write(vs)
653#endif /* PARALLEL */
1c79356b
A
654
655/*
656 * Data structures and variables dealing with asynchronous
657 * completion of paging operations.
658 */
659/*
660 * vs_async
661 * A structure passed to ps_write_device for asynchronous completions.
662 * It contains enough information to complete the write and
663 * inform the VM of its completion.
664 */
665struct vs_async {
666 struct vs_async *vsa_next; /* pointer to next structure */
667 vstruct_t vsa_vs; /* the vstruct for the object */
668 vm_offset_t vsa_addr; /* the vaddr of the data moved */
669 vm_offset_t vsa_offset; /* the object offset of the data */
670 vm_size_t vsa_size; /* the number of bytes moved */
671 paging_segment_t vsa_ps; /* the paging segment used */
672 int vsa_flags; /* flags */
673 int vsa_error; /* error, if there is one */
674 mutex_t vsa_lock;
675 MACH_PORT_FACE reply_port; /* associated reply port */
676};
677
678/*
679 * flags values.
680 */
681#define VSA_READ 0x0001
682#define VSA_WRITE 0x0002
683#define VSA_TRANSFER 0x0004
684
685/*
686 * List of all vstructs. A specific vstruct is
687 * found directly via its port, this list is
688 * only used for monitoring purposes by the
689 * default_pager_object* calls
690 */
691struct vstruct_list_head {
692 queue_head_t vsl_queue;
693#ifdef MACH_KERNEL
694 mutex_t vsl_lock;
695#else
696 struct mutex vsl_lock;
697#endif
698 int vsl_count; /* saves code */
1c79356b 699};
0b4e3aa0
A
700
701__private_extern__ struct vstruct_list_head vstruct_list;
702
703__private_extern__ void vstruct_list_insert(vstruct_t vs);
704__private_extern__ void vstruct_list_delete(vstruct_t vs);
705
1c79356b
A
706
707#ifdef MACH_KERNEL
708#define VSL_LOCK_INIT() mutex_init(&vstruct_list.vsl_lock, ETAP_DPAGE_VSLIST)
709#else
710#define VSL_LOCK_INIT() mutex_init(&vstruct_list.vsl_lock)
711#endif
712#define VSL_LOCK() mutex_lock(&vstruct_list.vsl_lock)
713#define VSL_LOCK_TRY() mutex_try(&vstruct_list.vsl_lock)
714#define VSL_UNLOCK() mutex_unlock(&vstruct_list.vsl_lock)
9bccf70c 715#define VSL_SLEEP(e,i) thread_sleep_mutex((e), &vstruct_list.vsl_lock, (i))
1c79356b 716
0b4e3aa0
A
717#ifdef MACH_KERNEL
718__private_extern__ zone_t vstruct_zone;
719#endif
720
1c79356b
A
721/*
722 * Create port alias for vstruct address.
723 *
724 * We assume that the last two bits of a vstruct address will be zero due to
725 * memory allocation restrictions, hence are available for use as a sanity
726 * check.
727 */
728#ifdef MACH_KERNEL
0b4e3aa0
A
729
730#define ISVS ((int *)123456)
731#define mem_obj_is_vs(_mem_obj_) \
732 (((_mem_obj_) != NULL) && ((_mem_obj_)->pager == ISVS))
733#define mem_obj_to_vs(_mem_obj_) \
734 ((vstruct_t)(_mem_obj_))
735#define vs_to_mem_obj(_vs_) ((memory_object_t)(_vs_))
736#define vs_lookup(_mem_obj_, _vs_) \
737 do { \
738 if (!mem_obj_is_vs(_mem_obj_)) \
739 panic("bad dp memory object"); \
740 _vs_ = mem_obj_to_vs(_mem_obj_); \
741 } while (0)
742#define vs_lookup_safe(_mem_obj_, _vs_) \
1c79356b 743 do { \
0b4e3aa0
A
744 if (!mem_obj_is_vs(_mem_obj_)) \
745 _vs_ = VSTRUCT_NULL; \
746 else \
747 _vs_ = mem_obj_to_vs(_mem_obj_); \
1c79356b
A
748 } while (0)
749#else
0b4e3aa0 750
1c79356b
A
751#define vs_to_port(_vs_) (((vm_offset_t)(_vs_))+1)
752#define port_to_vs(_port_) ((vstruct_t)(((vm_offset_t)(_port_))&~3))
753#define port_is_vs(_port_) ((((vm_offset_t)(_port_))&3) == 1)
754
755#define vs_lookup(_port_, _vs_) \
756 do { \
757 if (!MACH_PORT_VALID(_port_) || !port_is_vs(_port_) \
0b4e3aa0 758 || port_to_vs(_port_)->vs_mem_obj != (_port_)) \
1c79356b
A
759 Panic("bad pager port"); \
760 _vs_ = port_to_vs(_port_); \
761 } while (0)
762#endif
763
764/*
765 * Cross-module routines declaration.
766 */
767#ifndef MACH_KERNEL
768extern int dp_thread_id(void);
769#endif
770extern boolean_t device_reply_server(mach_msg_header_t *,
771 mach_msg_header_t *);
772#ifdef MACH_KERNEL
0b4e3aa0 773extern boolean_t default_pager_no_senders(memory_object_t,
1c79356b
A
774 mach_port_mscount_t);
775#else
776extern void default_pager_no_senders(memory_object_t,
777 mach_port_seqno_t,
778 mach_port_mscount_t);
779#endif
0b4e3aa0 780
1c79356b
A
781extern int local_log2(unsigned int);
782extern void bs_initialize(void);
783extern void bs_global_info(vm_size_t *,
784 vm_size_t *);
785extern boolean_t bs_add_device(char *,
786 MACH_PORT_FACE);
787extern vstruct_t ps_vstruct_create(vm_size_t);
788extern void ps_vstruct_dealloc(vstruct_t);
789extern kern_return_t pvs_cluster_read(vstruct_t,
790 vm_offset_t,
791 vm_size_t);
792extern kern_return_t vs_cluster_write(vstruct_t,
793 upl_t,
794 vm_offset_t,
795 vm_size_t,
796 boolean_t,
797 int);
798extern vm_offset_t ps_clmap(vstruct_t,
799 vm_offset_t,
800 struct clmap *,
801 int,
802 vm_size_t,
803 int);
804extern vm_size_t ps_vstruct_allocated_size(vstruct_t);
805extern size_t ps_vstruct_allocated_pages(vstruct_t,
806 default_pager_page_t *,
807 size_t);
808extern boolean_t bs_set_default_clsize(unsigned int);
809
810extern boolean_t verbose;
811
812#endif /* _DEFAULT_PAGER_INTERNAL_H_ */