uvm_anon.h 3.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. /* $OpenBSD: uvm_anon.h,v 1.18 2014/07/11 16:35:40 jsg Exp $ */
  2. /* $NetBSD: uvm_anon.h,v 1.13 2000/12/27 09:17:04 chs Exp $ */
  3. /*
  4. * Copyright (c) 1997 Charles D. Cranor and Washington University.
  5. * All rights reserved.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions
  9. * are met:
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  17. * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  18. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  19. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  20. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  21. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  22. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  23. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  24. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  25. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. #ifndef _UVM_UVM_ANON_H_
  28. #define _UVM_UVM_ANON_H_
  29. /*
  30. * anonymous memory management
  31. *
  32. * anonymous virtual memory is short term virtual memory that goes away
  33. * when the processes referencing it go away. an anonymous page of
  34. * virtual memory is described by the following data structure:
  35. */
  36. struct vm_anon {
  37. struct vm_page *an_page; /* if in RAM */
  38. int an_ref; /* reference count */
  39. /*
  40. * Drum swap slot # (if != 0) [if we hold an_page, PG_BUSY]
  41. */
  42. int an_swslot;
  43. };
  44. /*
  45. * for active vm_anon's the data can be in one of the following state:
  46. * [1] in a vm_page with no backing store allocated yet, [2] in a vm_page
  47. * with backing store allocated, or [3] paged out to backing store
  48. * (no vm_page).
  49. *
  50. * for pageout in case [2]: if the page has been modified then we must
  51. * flush it out to backing store, otherwise we can just dump the
  52. * vm_page.
  53. */
  54. /*
  55. * anons are grouped together in anonymous memory maps, or amaps.
  56. * amaps are defined in uvm_amap.h.
  57. */
  58. /*
  59. * processes reference anonymous virtual memory maps with an anonymous
  60. * reference structure:
  61. * Note that the offset field indicates which part of the amap we are
  62. * referencing.
  63. * Locked by vm_map lock.
  64. */
  65. struct vm_aref {
  66. int ar_pageoff; /* page offset into amap we start */
  67. struct vm_amap *ar_amap; /* pointer to amap */
  68. };
  69. #ifdef _KERNEL
  70. struct vm_anon *uvm_analloc(void);
  71. void uvm_anfree(struct vm_anon *);
  72. void uvm_anon_init(void);
  73. struct vm_page *uvm_anon_lockloanpg(struct vm_anon *);
  74. void uvm_anon_dropswap(struct vm_anon *);
  75. boolean_t uvm_anon_pagein(struct vm_anon *);
  76. #endif /* _KERNEL */
  77. #endif /* _UVM_UVM_ANON_H_ */