global to per-domain state. Protect reservations with the free lock from the domain that they belong to. Refactor to make vm domains more of a first class object. Reviewed by: markj, kib, gallatin Tested by: pho Sponsored by: Netflix, Dell/EMC Isilon Differential Revision: https://reviews.freebsd.org/D14000
236 lines
7.4 KiB
C
236 lines
7.4 KiB
C
/*-
|
|
* SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
|
|
*
|
|
* Copyright (c) 1991, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* The Mach Operating System project at Carnegie-Mellon University.
|
|
*
|
|
* 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. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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: @(#)vm_page.h 8.2 (Berkeley) 12/13/93
|
|
*
|
|
*
|
|
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
|
|
* All rights reserved.
|
|
*
|
|
* Authors: Avadis Tevanian, Jr., Michael Wayne Young
|
|
*
|
|
* 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 the
|
|
* rights to redistribute these changes.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _VM_PAGEQUEUE_
|
|
#define _VM_PAGEQUEUE_
|
|
|
|
#ifdef _KERNEL
|
|
struct vm_pagequeue {
|
|
struct mtx pq_mutex;
|
|
struct pglist pq_pl;
|
|
int pq_cnt;
|
|
const char * const pq_name;
|
|
} __aligned(CACHE_LINE_SIZE);
|
|
|
|
|
|
struct vm_domain {
|
|
struct vm_pagequeue vmd_pagequeues[PQ_COUNT];
|
|
struct mtx_padalign vmd_free_mtx;
|
|
struct vmem *vmd_kernel_arena;
|
|
u_int vmd_domain; /* Domain number. */
|
|
u_int vmd_page_count;
|
|
long vmd_segs; /* bitmask of the segments */
|
|
|
|
/* Paging control variables, locked by domain_free_mtx. */
|
|
u_int vmd_free_count;
|
|
boolean_t vmd_oom;
|
|
int vmd_oom_seq;
|
|
int vmd_last_active_scan;
|
|
struct vm_page vmd_laundry_marker;
|
|
struct vm_page vmd_marker; /* marker for pagedaemon private use */
|
|
struct vm_page vmd_inacthead; /* marker for LRU-defeating insertions */
|
|
|
|
int vmd_pageout_pages_needed; /* page daemon waiting for pages? */
|
|
int vmd_pageout_deficit; /* Estimated number of pages deficit */
|
|
int vmd_waiters; /* Pageout waiters. */
|
|
bool vmd_pages_needed; /* Are threads waiting for free pages? */
|
|
bool vmd_pageout_wanted; /* pageout daemon wait channel */
|
|
bool vmd_minset; /* Are we in vm_min_domains? */
|
|
bool vmd_severeset; /* Are we in vm_severe_domains? */
|
|
int vmd_inactq_scans;
|
|
enum {
|
|
VM_LAUNDRY_IDLE = 0,
|
|
VM_LAUNDRY_BACKGROUND,
|
|
VM_LAUNDRY_SHORTFALL
|
|
} vmd_laundry_request;
|
|
|
|
/* Paging thresholds. */
|
|
u_int vmd_background_launder_target;
|
|
u_int vmd_free_reserved; /* (c) pages reserved for deadlock */
|
|
u_int vmd_free_target; /* (c) pages desired free */
|
|
u_int vmd_free_min; /* (c) pages desired free */
|
|
u_int vmd_inactive_target; /* (c) pages desired inactive */
|
|
u_int vmd_pageout_free_min; /* (c) min pages reserved for kernel */
|
|
u_int vmd_pageout_wakeup_thresh;/* (c) min pages to wake pagedaemon */
|
|
u_int vmd_interrupt_free_min; /* (c) reserved pages for int code */
|
|
u_int vmd_free_severe; /* (c) severe page depletion point */
|
|
} __aligned(CACHE_LINE_SIZE);
|
|
|
|
extern struct vm_domain vm_dom[MAXMEMDOM];
|
|
|
|
#define VM_DOMAIN(n) (&vm_dom[(n)])
|
|
|
|
#define vm_pagequeue_assert_locked(pq) mtx_assert(&(pq)->pq_mutex, MA_OWNED)
|
|
#define vm_pagequeue_lock(pq) mtx_lock(&(pq)->pq_mutex)
|
|
#define vm_pagequeue_lockptr(pq) (&(pq)->pq_mutex)
|
|
#define vm_pagequeue_unlock(pq) mtx_unlock(&(pq)->pq_mutex)
|
|
|
|
#define vm_domain_free_assert_locked(n) \
|
|
mtx_assert(vm_domain_free_lockptr((n)), MA_OWNED)
|
|
#define vm_domain_free_assert_unlocked(n) \
|
|
mtx_assert(vm_domain_free_lockptr((n)), MA_NOTOWNED)
|
|
#define vm_domain_free_lock(d) \
|
|
mtx_lock(vm_domain_free_lockptr((d)))
|
|
#define vm_domain_free_lockptr(d) \
|
|
(&(d)->vmd_free_mtx)
|
|
#define vm_domain_free_unlock(d) \
|
|
mtx_unlock(vm_domain_free_lockptr((d)))
|
|
|
|
static __inline void
|
|
vm_pagequeue_cnt_add(struct vm_pagequeue *pq, int addend)
|
|
{
|
|
|
|
#ifdef notyet
|
|
vm_pagequeue_assert_locked(pq);
|
|
#endif
|
|
pq->pq_cnt += addend;
|
|
}
|
|
#define vm_pagequeue_cnt_inc(pq) vm_pagequeue_cnt_add((pq), 1)
|
|
#define vm_pagequeue_cnt_dec(pq) vm_pagequeue_cnt_add((pq), -1)
|
|
|
|
void vm_domain_set(struct vm_domain *vmd);
|
|
int vm_domain_available(struct vm_domain *vmd, int req, int npages);
|
|
|
|
/*
|
|
* vm_pagequeue_domain:
|
|
*
|
|
* Return the memory domain the page belongs to.
|
|
*/
|
|
static inline struct vm_domain *
|
|
vm_pagequeue_domain(vm_page_t m)
|
|
{
|
|
|
|
return (VM_DOMAIN(vm_phys_domain(m)));
|
|
}
|
|
|
|
/*
|
|
* Return the number of pages we need to free-up or cache
|
|
* A positive number indicates that we do not have enough free pages.
|
|
*/
|
|
static inline int
|
|
vm_paging_target(struct vm_domain *vmd)
|
|
{
|
|
|
|
return (vmd->vmd_free_target - vmd->vmd_free_count);
|
|
}
|
|
|
|
/*
|
|
* Returns TRUE if the pagedaemon needs to be woken up.
|
|
*/
|
|
static inline int
|
|
vm_paging_needed(struct vm_domain *vmd, u_int free_count)
|
|
{
|
|
|
|
return (free_count < vmd->vmd_pageout_wakeup_thresh);
|
|
}
|
|
|
|
/*
|
|
* Returns TRUE if the domain is below the min paging target.
|
|
*/
|
|
static inline int
|
|
vm_paging_min(struct vm_domain *vmd)
|
|
{
|
|
|
|
return (vmd->vmd_free_min > vmd->vmd_free_count);
|
|
}
|
|
|
|
/*
|
|
* Returns TRUE if the domain is below the severe paging target.
|
|
*/
|
|
static inline int
|
|
vm_paging_severe(struct vm_domain *vmd)
|
|
{
|
|
|
|
return (vmd->vmd_free_severe > vmd->vmd_free_count);
|
|
}
|
|
|
|
/*
|
|
* Return the number of pages we need to launder.
|
|
* A positive number indicates that we have a shortfall of clean pages.
|
|
*/
|
|
static inline int
|
|
vm_laundry_target(struct vm_domain *vmd)
|
|
{
|
|
|
|
return (vm_paging_target(vmd));
|
|
}
|
|
|
|
static inline u_int
|
|
vm_domain_freecnt_adj(struct vm_domain *vmd, int adj)
|
|
{
|
|
u_int ret;
|
|
|
|
vm_domain_free_assert_locked(vmd);
|
|
ret = vmd->vmd_free_count += adj;
|
|
if ((!vmd->vmd_minset && vm_paging_min(vmd)) ||
|
|
(!vmd->vmd_severeset && vm_paging_severe(vmd)))
|
|
vm_domain_set(vmd);
|
|
|
|
return (ret);
|
|
}
|
|
|
|
|
|
#endif /* _KERNEL */
|
|
#endif /* !_VM_PAGEQUEUE_ */
|