2011-03-21 09:58:24 +00:00
|
|
|
/*-
|
|
|
|
|
* Copyright (c) 2010 Isilon Systems, Inc.
|
|
|
|
|
* Copyright (c) 2010 iX Systems, Inc.
|
|
|
|
|
* Copyright (c) 2010 Panasas, Inc.
|
2016-05-13 12:41:21 +00:00
|
|
|
* Copyright (c) 2013-2016 Mellanox Technologies, Ltd.
|
2011-03-21 09:58:24 +00:00
|
|
|
* 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 unmodified, 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.
|
|
|
|
|
*
|
|
|
|
|
* 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.
|
2015-10-20 19:08:26 +00:00
|
|
|
*
|
|
|
|
|
* $FreeBSD$
|
2011-03-21 09:58:24 +00:00
|
|
|
*/
|
|
|
|
|
#ifndef _LINUX_PAGE_H_
|
|
|
|
|
#define _LINUX_PAGE_H_
|
|
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
|
|
Split the pagequeues per NUMA domains, and split pageademon process
into threads each processing queue in a single domain. The structure
of the pagedaemons and queues is kept intact, most of the changes come
from the need for code to find an owning page queue for given page,
calculated from the segment containing the page.
The tie between NUMA domain and pagedaemon thread/pagequeue split is
rather arbitrary, the multithreaded daemon could be allowed for the
single-domain machines, or one domain might be split into several page
domains, to further increase concurrency.
Right now, each pagedaemon thread tries to reach the global target,
precalculated at the start of the pass. This is not optimal, since it
could cause excessive page deactivation and freeing. The code should
be changed to re-check the global page deficit state in the loop after
some number of iterations.
The pagedaemons reach the quorum before starting the OOM, since one
thread inability to meet the target is normal for split queues. Only
when all pagedaemons fail to produce enough reusable pages, OOM is
started by single selected thread.
Launder is modified to take into account the segments layout with
regard to the region for which cleaning is performed.
Based on the preliminary patch by jeff, sponsored by EMC / Isilon
Storage Division.
Reviewed by: alc
Tested by: pho
Sponsored by: The FreeBSD Foundation
2013-08-07 16:36:38 +00:00
|
|
|
#include <machine/atomic.h>
|
2011-03-21 09:58:24 +00:00
|
|
|
#include <vm/vm.h>
|
|
|
|
|
#include <vm/vm_page.h>
|
2016-05-13 12:41:21 +00:00
|
|
|
#include <vm/pmap.h>
|
|
|
|
|
|
2017-03-27 17:04:11 +00:00
|
|
|
typedef unsigned long pte_t;
|
|
|
|
|
typedef unsigned long pmd_t;
|
|
|
|
|
typedef unsigned long pgd_t;
|
2016-05-13 12:41:21 +00:00
|
|
|
typedef unsigned long pgprot_t;
|
2011-03-21 09:58:24 +00:00
|
|
|
|
|
|
|
|
#define page vm_page
|
|
|
|
|
|
2016-05-13 12:41:21 +00:00
|
|
|
#define virt_to_page(x) PHYS_TO_VM_PAGE(vtophys((x)))
|
|
|
|
|
#define page_to_pfn(pp) (VM_PAGE_TO_PHYS((pp)) >> PAGE_SHIFT)
|
|
|
|
|
#define pfn_to_page(pfn) (PHYS_TO_VM_PAGE((pfn) << PAGE_SHIFT))
|
|
|
|
|
#define nth_page(page,n) pfn_to_page(page_to_pfn((page)) + (n))
|
2011-03-21 09:58:24 +00:00
|
|
|
|
|
|
|
|
#define clear_page(page) memset((page), 0, PAGE_SIZE)
|
2016-05-13 12:41:21 +00:00
|
|
|
#define pgprot_noncached(prot) ((pgprot_t)VM_MEMATTR_UNCACHEABLE)
|
|
|
|
|
#define pgprot_writecombine(prot) ((pgprot_t)VM_MEMATTR_WRITE_COMBINING)
|
2011-03-21 09:58:24 +00:00
|
|
|
|
|
|
|
|
#undef PAGE_MASK
|
|
|
|
|
#define PAGE_MASK (~(PAGE_SIZE-1))
|
2016-05-13 12:41:21 +00:00
|
|
|
/*
|
|
|
|
|
* Modifying PAGE_MASK in the above way breaks trunc_page, round_page,
|
|
|
|
|
* and btoc macros. Therefore, redefine them in a way that makes sense
|
|
|
|
|
* so the LinuxKPI consumers don't get totally broken behavior.
|
|
|
|
|
*/
|
|
|
|
|
#undef btoc
|
|
|
|
|
#define btoc(x) (((vm_offset_t)(x) + PAGE_SIZE - 1) >> PAGE_SHIFT)
|
|
|
|
|
#undef round_page
|
|
|
|
|
#define round_page(x) ((((uintptr_t)(x)) + PAGE_SIZE - 1) & ~(PAGE_SIZE - 1))
|
|
|
|
|
#undef trunc_page
|
|
|
|
|
#define trunc_page(x) ((uintptr_t)(x) & ~(PAGE_SIZE - 1))
|
2011-03-21 09:58:24 +00:00
|
|
|
|
|
|
|
|
#endif /* _LINUX_PAGE_H_ */
|
