/* $OpenBSD: uvm.h,v 1.39 2010/06/09 08:26:21 thib Exp $ */ /* $NetBSD: uvm.h,v 1.24 2000/11/27 08:40:02 chs Exp $ */ /* * * Copyright (c) 1997 Charles D. Cranor and Washington University. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by Charles D. Cranor and * Washington University. * 4. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * from: Id: uvm.h,v 1.1.2.14 1998/02/02 20:07:19 chuck Exp */ #ifndef _UVM_UVM_H_ #define _UVM_UVM_H_ #include #include /* * pull in prototypes */ #include #include #include #include #include #include #include #include #include #include #include #include #ifdef UVM_SWAP_ENCRYPT #include #endif /* * pull in VM_NFREELIST */ #include /* * UVM_IO_RANGES: paddr_t pairs, describing the lowest and highest address * that should be reserved. These ranges (which may overlap) will have their * use counter increased, causing them to be avoided if an allocation can be * satisfied from another range of memory. * * UVM_IO_RANGES actually results into a call to uvm_pmr_use_inc() per range * at uvm initialization. uvm_pmr_use_inc() can also be called after uvm_init() * has completed. * * Note: the upper bound is specified in the same way as to uvm_pglistalloc. * Ex: a memory range of 16 bit is specified as: { 0, 0xffff }. * Default: no special ranges in use. */ #ifndef UVM_IO_RANGES #define UVM_IO_RANGES \ { \ { 0, 0x00ffffffUL }, /* ISA memory */ \ { 0, 0xffffffffUL }, /* 32-bit PCI memory */ \ } #endif /* UVM IO ranges are described in an array of struct uvm_io_ranges. */ struct uvm_io_ranges { paddr_t low; paddr_t high; }; /* * uvm structure (vm global state: collected in one structure for ease * of reference...) */ struct uvm { /* vm_page related parameters */ /* vm_page queues */ struct pglist page_active; /* allocated pages, in use */ struct pglist page_inactive_swp;/* pages inactive (reclaim or free) */ struct pglist page_inactive_obj;/* pages inactive (reclaim or free) */ /* Lock order: object lock, pageqlock, then fpageqlock. */ simple_lock_data_t pageqlock; /* lock for active/inactive page q */ struct mutex fpageqlock; /* lock for free page q + pdaemon */ boolean_t page_init_done; /* TRUE if uvm_page_init() finished */ boolean_t page_idle_zero; /* TRUE if we should try to zero pages in the idle loop */ struct uvm_pmr_control pmr_control; /* pmemrange data */ /* page daemon trigger */ int pagedaemon; /* daemon sleeps on this */ struct proc *pagedaemon_proc; /* daemon's pid */ /* aiodone daemon trigger */ int aiodoned; /* daemon sleeps on this */ struct proc *aiodoned_proc; /* daemon's pid */ struct mutex aiodoned_lock; /* page hash */ struct pglist *page_hash; /* page hash table (vp/off->page) */ int page_nhash; /* number of buckets */ int page_hashmask; /* hash mask */ struct mutex hashlock; /* lock on page_hash array */ /* static kernel map entry pool */ vm_map_entry_t kentry_free; /* free page pool */ simple_lock_data_t kentry_lock; /* aio_done is locked by uvm.aiodoned_lock. */ TAILQ_HEAD(, buf) aio_done; /* done async i/o reqs */ /* swap-related items */ simple_lock_data_t swap_data_lock; /* kernel object: to support anonymous pageable kernel memory */ struct uvm_object *kernel_object; }; /* * vm_map_entry etype bits: */ #define UVM_ET_OBJ 0x01 /* it is a uvm_object */ #define UVM_ET_SUBMAP 0x02 /* it is a vm_map submap */ #define UVM_ET_COPYONWRITE 0x04 /* copy_on_write */ #define UVM_ET_NEEDSCOPY 0x08 /* needs_copy */ #define UVM_ET_HOLE 0x10 /* no backend */ #define UVM_ET_ISOBJ(E) (((E)->etype & UVM_ET_OBJ) != 0) #define UVM_ET_ISSUBMAP(E) (((E)->etype & UVM_ET_SUBMAP) != 0) #define UVM_ET_ISCOPYONWRITE(E) (((E)->etype & UVM_ET_COPYONWRITE) != 0) #define UVM_ET_ISNEEDSCOPY(E) (((E)->etype & UVM_ET_NEEDSCOPY) != 0) #define UVM_ET_ISHOLE(E) (((E)->etype & UVM_ET_HOLE) != 0) #ifdef _KERNEL /* * holds all the internal UVM data */ extern struct uvm uvm; /* * historys */ #ifdef UVMHIST extern UVMHIST_DECL(maphist); extern UVMHIST_DECL(pdhist); extern UVMHIST_DECL(pghist); #endif /* * UVM_UNLOCK_AND_WAIT: atomic unlock+wait... wrapper around the * interlocked tsleep() function. */ #define UVM_UNLOCK_AND_WAIT(event, slock, intr, msg, timo) \ do { \ tsleep(event, PVM|PNORELOCK|(intr ? PCATCH : 0), msg, timo); \ } while (0) /* * UVM_PAGE_OWN: track page ownership (only if UVM_PAGE_TRKOWN) */ #if defined(UVM_PAGE_TRKOWN) #define UVM_PAGE_OWN(PG, TAG) uvm_page_own(PG, TAG) #else #define UVM_PAGE_OWN(PG, TAG) /* nothing */ #endif /* UVM_PAGE_TRKOWN */ #endif /* _KERNEL */ #endif /* _UVM_UVM_H_ */