Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 | /* * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * The contents of this file constitute Original Code as defined in and * are subject to the Apple Public Source License Version 1.1 (the * "License"). You may not use this file except in compliance with the * License. Please obtain a copy of the License at * http://www.apple.com/publicsource and read it before using this file. * * This Original Code and all software distributed under the License are * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the * License for the specific language governing rights and limitations * under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * @OSF_COPYRIGHT@ */ /* * Mach Operating System * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University * All Rights Reserved. * * Permission to use, copy, modify and distribute this software and its * documentation is hereby granted, provided that both the copyright * notice and this permission notice appear in all copies of the * software, derivative works or modified versions, and any portions * thereof, and that both notices appear in supporting documentation. * * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. * * Carnegie Mellon requests users of this software to return to * * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU * School of Computer Science * Carnegie Mellon University * Pittsburgh PA 15213-3890 * * any improvements or extensions that they make and grant Carnegie Mellon * the rights to redistribute these changes. */ /* */ /* * File: vm_object.h * Author: Avadis Tevanian, Jr., Michael Wayne Young * Date: 1985 * * Virtual memory object module definitions. */ #ifndef _VM_VM_OBJECT_H_ #define _VM_VM_OBJECT_H_ #include <mach_pagemap.h> #include <task_swapper.h> #include <mach/kern_return.h> #include <mach/boolean.h> #include <mach/memory_object_types.h> #include <mach/port.h> #include <mach/vm_prot.h> #include <mach/machine/vm_types.h> #include <kern/queue.h> #include <kern/lock.h> #include <kern/assert.h> #include <kern/ipc_mig.h> #include <kern/misc_protos.h> #include <kern/macro_help.h> #include <ipc/ipc_types.h> #include <vm/pmap.h> #if MACH_PAGEMAP #include <vm/vm_external.h> #endif /* MACH_PAGEMAP */ typedef memory_object_control_t pager_request_t; #define PAGER_REQUEST_NULL ((pager_request_t) 0) /* * Types defined: * * vm_object_t Virtual memory object. */ typedef unsigned long long vm_object_size_t; struct vm_object { queue_head_t memq; /* Resident memory */ decl_mutex_data(, Lock) /* Synchronization */ vm_object_size_t size; /* Object size (only valid * if internal) */ vm_object_size_t frozen_size; /* How much has been marked * copy-on-write (only * valid if copy_symmetric) */ int ref_count; /* Number of references */ #if TASK_SWAPPER int res_count; /* Residency references (swap)*/ #endif /* TASK_SWAPPER */ unsigned int resident_page_count; /* number of resident pages */ struct vm_object *copy; /* Object that should receive * a copy of my changed pages, * for copy_delay, or just the * temporary object that * shadows this object, for * copy_call. */ struct vm_object *shadow; /* My shadow */ vm_object_offset_t shadow_offset; /* Offset into shadow */ memory_object_t pager; /* Where to get data */ vm_object_offset_t paging_offset; /* Offset into memory object */ pager_request_t pager_request; /* Where data comes back */ memory_object_copy_strategy_t copy_strategy; /* How to handle data copy */ unsigned int absent_count; /* The number of pages that * have been requested but * not filled. That is, the * number of pages for which * the "absent" attribute is * asserted. */ unsigned int paging_in_progress; /* The memory object ports are * being used (e.g., for pagein * or pageout) -- don't change * any of these fields (i.e., * don't collapse, destroy or * terminate) */ unsigned int /* boolean_t array */ all_wanted:11, /* Bit array of "want to be * awakened" notations. See * VM_OBJECT_EVENT_* items * below */ /* boolean_t */ pager_created:1, /* Has pager been created? */ /* boolean_t */ pager_initialized:1, /* Are fields ready to use? */ /* boolean_t */ pager_ready:1, /* Will pager take requests? */ /* boolean_t */ pager_trusted:1,/* The pager for this object * is trusted. This is true for * all internal objects (backed * by the default pager) */ /* boolean_t */ can_persist:1, /* The kernel may keep the data * for this object (and rights * to the memory object) after * all address map references * are deallocated? */ /* boolean_t */ internal:1, /* Created by the kernel (and * therefore, managed by the * default memory manger) */ /* boolean_t */ temporary:1, /* Permanent objects may be * changed externally by the * memory manager, and changes * made in memory must be * reflected back to the memory * manager. Temporary objects * lack both of these * characteristics. */ /* boolean_t */ private:1, /* magic device_pager object, * holds private pages only */ /* boolean_t */ pageout:1, /* pageout object. contains * private pages that refer to * a real memory object. */ /* boolean_t */ alive:1, /* Not yet terminated */ /* boolean_t */ lock_in_progress:1, /* Is a multi-page lock * request in progress? */ /* boolean_t */ lock_restart:1, /* Should lock request in * progress restart search? */ /* boolean_t */ shadowed:1, /* Shadow may exist */ /* boolean_t */ silent_overwrite:1, /* Allow full page overwrite * without data_request if * page is absent */ /* boolean_t */ advisory_pageout:1, /* Instead of sending page * via OOL, just notify * pager that the kernel * wants to discard it, page * remains in object */ /* boolean_t */ true_share:1, /* This object is mapped * in more than one place * and hence cannot be * coalesced */ /* boolean_t */ terminating:1, /* Allows vm_object_lookup * and vm_object_deallocate * to special case their * behavior when they are * called as a result of * page cleaning during * object termination */ /* boolean_t */ named:1, /* An enforces an internal * naming convention, by * calling the right routines * for allocation and * destruction, UBC references * against the vm_object are * checked. */ /* boolean_t */ shadow_severed:1, /* When a permanent object * backing a COW goes away * unexpectedly. This bit * allows vm_fault to return * an error rather than a * zero filled page. */ /* boolean_t */ phys_contiguous:1, /* Memory is wired and * guaranteed physically * contiguous. However * it is not device memory * and obeys normal virtual * memory rules w.r.t pmap * access bits. */ /* boolean_t */ nophyscache:1; /* When mapped at the * pmap level, don't allow * primary caching. (for * I/O) */ queue_chain_t cached_list; /* Attachment point for the * list of objects cached as a * result of their can_persist * value */ queue_head_t msr_q; /* memory object synchronise request queue */ vm_object_offset_t last_alloc; /* last allocation offset */ vm_size_t cluster_size; /* size of paging cluster */ #if MACH_PAGEMAP vm_external_map_t existence_map; /* bitmap of pages written to * backing storage */ #endif /* MACH_PAGEMAP */ int cow_hint; /* last page present in */ /* shadow but not in object */ #if MACH_ASSERT struct vm_object *paging_object; /* object which pages to be * swapped out are temporary * put in current object */ #endif #ifdef UBC_DEBUG queue_head_t uplq; /* List of outstanding upls */ #endif /* UBC_DEBUG */ }; __private_extern__ vm_object_t kernel_object; /* the single kernel object */ __private_extern__ int vm_object_absent_max; /* maximum number of absent pages at a time for each object */ # define VM_MSYNC_INITIALIZED 0 # define VM_MSYNC_SYNCHRONIZING 1 # define VM_MSYNC_DONE 2 struct msync_req { queue_chain_t msr_q; /* object request queue */ queue_chain_t req_q; /* vm_msync request queue */ unsigned int flag; vm_object_offset_t offset; vm_object_size_t length; vm_object_t object; /* back pointer */ decl_mutex_data(, msync_req_lock) /* Lock for this structure */ }; typedef struct msync_req *msync_req_t; #define MSYNC_REQ_NULL ((msync_req_t) 0) /* * Macros to allocate and free msync_reqs */ #define msync_req_alloc(msr) \ MACRO_BEGIN \ (msr) = (msync_req_t)kalloc(sizeof(struct msync_req)); \ mutex_init(&(msr)->msync_req_lock, ETAP_VM_MSYNC); \ msr->flag = VM_MSYNC_INITIALIZED; \ MACRO_END #define msync_req_free(msr) \ (kfree((vm_offset_t)(msr), sizeof(struct msync_req))) #define msr_lock(msr) mutex_lock(&(msr)->msync_req_lock) #define msr_unlock(msr) mutex_unlock(&(msr)->msync_req_lock) /* * Declare procedures that operate on VM objects. */ __private_extern__ void vm_object_bootstrap(void); __private_extern__ void vm_object_init(void); __private_extern__ vm_object_t vm_object_allocate( vm_object_size_t size); #if TASK_SWAPPER __private_extern__ void vm_object_res_reference( vm_object_t object); __private_extern__ void vm_object_res_deallocate( vm_object_t object); #define VM_OBJ_RES_INCR(object) (object)->res_count++ #define VM_OBJ_RES_DECR(object) (object)->res_count-- #else /* TASK_SWAPPER */ #define VM_OBJ_RES_INCR(object) #define VM_OBJ_RES_DECR(object) #define vm_object_res_reference(object) #define vm_object_res_deallocate(object) #endif /* TASK_SWAPPER */ #define vm_object_reference_locked(object) \ MACRO_BEGIN \ vm_object_t RLObject = (object); \ assert((RLObject)->ref_count > 0); \ (RLObject)->ref_count++; \ vm_object_res_reference(RLObject); \ MACRO_END #if MACH_ASSERT __private_extern__ void vm_object_reference( vm_object_t object); #else /* MACH_ASSERT */ #define vm_object_reference(object) \ MACRO_BEGIN \ vm_object_t RObject = (object); \ if (RObject) { \ vm_object_lock(RObject); \ vm_object_reference_locked(RObject); \ vm_object_unlock(RObject); \ } \ MACRO_END #endif /* MACH_ASSERT */ __private_extern__ void vm_object_deallocate( vm_object_t object); __private_extern__ kern_return_t vm_object_release_name( vm_object_t object, int flags); __private_extern__ void vm_object_pmap_protect( vm_object_t object, vm_object_offset_t offset, vm_size_t size, pmap_t pmap, vm_offset_t pmap_start, vm_prot_t prot); __private_extern__ void vm_object_page_remove( vm_object_t object, vm_object_offset_t start, vm_object_offset_t end); __private_extern__ void vm_object_deactivate_pages( vm_object_t object, vm_object_offset_t offset, vm_object_size_t size, boolean_t kill_page); __private_extern__ boolean_t vm_object_coalesce( vm_object_t prev_object, vm_object_t next_object, vm_object_offset_t prev_offset, vm_object_offset_t next_offset, vm_object_size_t prev_size, vm_object_size_t next_size); __private_extern__ boolean_t vm_object_shadow( vm_object_t *object, vm_object_offset_t *offset, vm_object_size_t length); __private_extern__ void vm_object_collapse( vm_object_t object); __private_extern__ boolean_t vm_object_copy_quickly( vm_object_t *_object, vm_object_offset_t src_offset, vm_object_size_t size, boolean_t *_src_needs_copy, boolean_t *_dst_needs_copy); __private_extern__ kern_return_t vm_object_copy_strategically( vm_object_t src_object, vm_object_offset_t src_offset, vm_object_size_t size, vm_object_t *dst_object, vm_object_offset_t *dst_offset, boolean_t *dst_needs_copy); __private_extern__ kern_return_t vm_object_copy_slowly( vm_object_t src_object, vm_object_offset_t src_offset, vm_object_size_t size, int interruptible, vm_object_t *_result_object); __private_extern__ vm_object_t vm_object_copy_delayed( vm_object_t src_object, vm_object_offset_t src_offset, vm_object_size_t size); __private_extern__ kern_return_t vm_object_destroy( vm_object_t object, kern_return_t reason); __private_extern__ void vm_object_pager_create( vm_object_t object); __private_extern__ void vm_object_page_map( vm_object_t object, vm_object_offset_t offset, vm_object_size_t size, vm_object_offset_t (*map_fn) (void *, vm_object_offset_t), void *map_fn_data); __private_extern__ kern_return_t vm_object_upl_request( vm_object_t object, vm_object_offset_t offset, vm_size_t size, upl_t *upl, upl_page_info_t *page_info, unsigned int *count, int flags); __private_extern__ boolean_t vm_object_sync( vm_object_t object, vm_object_offset_t offset, vm_size_t size, boolean_t should_flush, boolean_t should_return); __private_extern__ kern_return_t vm_object_update( vm_object_t object, vm_object_offset_t offset, vm_size_t size, /* should be 64 */ memory_object_return_t should_return, int flags, vm_prot_t prot); __private_extern__ kern_return_t vm_object_lock_request( vm_object_t object, vm_object_offset_t offset, vm_object_size_t size, memory_object_return_t should_return, int flags, vm_prot_t prot); __private_extern__ vm_object_t vm_object_enter( memory_object_t pager, vm_object_size_t size, boolean_t internal, boolean_t init, boolean_t check_named); /* * Event waiting handling */ #define VM_OBJECT_EVENT_INITIALIZED 0 #define VM_OBJECT_EVENT_PAGER_READY 1 #define VM_OBJECT_EVENT_PAGING_IN_PROGRESS 2 #define VM_OBJECT_EVENT_ABSENT_COUNT 3 #define VM_OBJECT_EVENT_LOCK_IN_PROGRESS 4 #define VM_OBJECT_EVENT_UNCACHING 5 #define VM_OBJECT_EVENT_COPY_CALL 6 #define VM_OBJECT_EVENT_CACHING 7 #define vm_object_assert_wait(object, event, interruptible) \ MACRO_BEGIN \ (object)->all_wanted |= 1 << (event); \ assert_wait((event_t)((vm_offset_t)(object)+(event)),(interruptible)); \ MACRO_END #define vm_object_wait(object, event, interruptible) \ MACRO_BEGIN \ vm_object_assert_wait((object),(event),(interruptible)); \ vm_object_unlock(object); \ thread_block((void (*)(void)) 0); \ MACRO_END #define vm_object_wakeup(object, event) \ MACRO_BEGIN \ if ((object)->all_wanted & (1 << (event))) \ thread_wakeup((event_t)((vm_offset_t)(object) + (event))); \ (object)->all_wanted &= ~(1 << (event)); \ MACRO_END #define vm_object_set_wanted(object, event) \ MACRO_BEGIN \ ((object)->all_wanted |= (1 << (event))); \ MACRO_END #define vm_object_wanted(object, event) \ ((object)->all_wanted & (1 << (event))) /* * Routines implemented as macros */ #define vm_object_paging_begin(object) \ MACRO_BEGIN \ (object)->paging_in_progress++; \ MACRO_END #define vm_object_paging_end(object) \ MACRO_BEGIN \ assert((object)->paging_in_progress != 0); \ if (--(object)->paging_in_progress == 0) { \ vm_object_wakeup(object, \ VM_OBJECT_EVENT_PAGING_IN_PROGRESS); \ } \ MACRO_END #define vm_object_paging_wait(object, interruptible) \ MACRO_BEGIN \ while ((object)->paging_in_progress != 0) { \ vm_object_wait( (object), \ VM_OBJECT_EVENT_PAGING_IN_PROGRESS, \ (interruptible)); \ vm_object_lock(object); \ \ /*XXX if ((interruptible) && */ \ /*XXX (current_thread()->wait_result != THREAD_AWAKENED))*/ \ /*XXX break; */ \ } \ MACRO_END #define vm_object_absent_assert_wait(object, interruptible) \ MACRO_BEGIN \ vm_object_assert_wait( (object), \ VM_OBJECT_EVENT_ABSENT_COUNT, \ (interruptible)); \ MACRO_END #define vm_object_absent_release(object) \ MACRO_BEGIN \ (object)->absent_count--; \ vm_object_wakeup((object), \ VM_OBJECT_EVENT_ABSENT_COUNT); \ MACRO_END /* * Object locking macros */ #define vm_object_lock_init(object) mutex_init(&(object)->Lock, ETAP_VM_OBJ) #define vm_object_lock(object) mutex_lock(&(object)->Lock) #define vm_object_unlock(object) mutex_unlock(&(object)->Lock) #define vm_object_lock_try(object) mutex_try(&(object)->Lock) #endif /* _VM_VM_OBJECT_H_ */ |