License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifndef __LINUX_GFP_H
|
|
|
|
#define __LINUX_GFP_H
|
|
|
|
|
2014-01-23 23:52:54 +00:00
|
|
|
#include <linux/mmdebug.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/mmzone.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/linkage.h>
|
2009-03-13 13:13:37 +00:00
|
|
|
#include <linux/topology.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-02-24 20:06:35 +00:00
|
|
|
/* The typedef is in types.h but we want the documentation here */
|
|
|
|
#if 0
|
|
|
|
/**
|
|
|
|
* typedef gfp_t - Memory allocation flags.
|
|
|
|
*
|
|
|
|
* GFP flags are commonly used throughout Linux to indicate how memory
|
|
|
|
* should be allocated. The GFP acronym stands for get_free_pages(),
|
|
|
|
* the underlying memory allocation function. Not every GFP flag is
|
|
|
|
* supported by every function which may allocate memory. Most users
|
|
|
|
* will want to use a plain ``GFP_KERNEL``.
|
|
|
|
*/
|
|
|
|
typedef unsigned int __bitwise gfp_t;
|
|
|
|
#endif
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
struct vm_area_struct;
|
|
|
|
|
2016-03-15 21:55:45 +00:00
|
|
|
/*
|
|
|
|
* In case of changes, please don't forget to update
|
mm, tracing: unify mm flags handling in tracepoints and printk
In tracepoints, it's possible to print gfp flags in a human-friendly
format through a macro show_gfp_flags(), which defines a translation
array and passes is to __print_flags(). Since the following patch will
introduce support for gfp flags printing in printk(), it would be nice
to reuse the array. This is not straightforward, since __print_flags()
can't simply reference an array defined in a .c file such as mm/debug.c
- it has to be a macro to allow the macro magic to communicate the
format to userspace tools such as trace-cmd.
The solution is to create a macro __def_gfpflag_names which is used both
in show_gfp_flags(), and to define the gfpflag_names[] array in
mm/debug.c.
On the other hand, mm/debug.c also defines translation tables for page
flags and vma flags, and desire was expressed (but not implemented in
this series) to use these also from tracepoints. Thus, this patch also
renames the events/gfpflags.h file to events/mmflags.h and moves the
table definitions there, using the same macro approach as for gfpflags.
This allows translating all three kinds of mm-specific flags both in
tracepoints and printk.
Signed-off-by: Vlastimil Babka <vbabka@suse.cz>
Reviewed-by: Michal Hocko <mhocko@suse.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Arnaldo Carvalho de Melo <acme@kernel.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Rasmus Villemoes <linux@rasmusvillemoes.dk>
Cc: Joonsoo Kim <iamjoonsoo.kim@lge.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Sasha Levin <sasha.levin@oracle.com>
Cc: "Kirill A. Shutemov" <kirill.shutemov@linux.intel.com>
Cc: Mel Gorman <mgorman@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-03-15 21:55:52 +00:00
|
|
|
* include/trace/events/mmflags.h and tools/perf/builtin-kmem.c
|
2016-03-15 21:55:45 +00:00
|
|
|
*/
|
|
|
|
|
2010-10-26 21:22:04 +00:00
|
|
|
/* Plain integer GFP bitmasks. Do not use this directly. */
|
|
|
|
#define ___GFP_DMA 0x01u
|
|
|
|
#define ___GFP_HIGHMEM 0x02u
|
|
|
|
#define ___GFP_DMA32 0x04u
|
|
|
|
#define ___GFP_MOVABLE 0x08u
|
2015-11-07 00:28:18 +00:00
|
|
|
#define ___GFP_RECLAIMABLE 0x10u
|
2010-10-26 21:22:04 +00:00
|
|
|
#define ___GFP_HIGH 0x20u
|
|
|
|
#define ___GFP_IO 0x40u
|
|
|
|
#define ___GFP_FS 0x80u
|
2019-03-05 23:44:18 +00:00
|
|
|
#define ___GFP_ZERO 0x100u
|
|
|
|
#define ___GFP_ATOMIC 0x200u
|
|
|
|
#define ___GFP_DIRECT_RECLAIM 0x400u
|
|
|
|
#define ___GFP_KSWAPD_RECLAIM 0x800u
|
|
|
|
#define ___GFP_WRITE 0x1000u
|
|
|
|
#define ___GFP_NOWARN 0x2000u
|
|
|
|
#define ___GFP_RETRY_MAYFAIL 0x4000u
|
|
|
|
#define ___GFP_NOFAIL 0x8000u
|
|
|
|
#define ___GFP_NORETRY 0x10000u
|
|
|
|
#define ___GFP_MEMALLOC 0x20000u
|
|
|
|
#define ___GFP_COMP 0x40000u
|
|
|
|
#define ___GFP_NOMEMALLOC 0x80000u
|
|
|
|
#define ___GFP_HARDWALL 0x100000u
|
|
|
|
#define ___GFP_THISNODE 0x200000u
|
|
|
|
#define ___GFP_ACCOUNT 0x400000u
|
2017-05-03 21:53:09 +00:00
|
|
|
#ifdef CONFIG_LOCKDEP
|
2018-06-08 00:08:11 +00:00
|
|
|
#define ___GFP_NOLOCKDEP 0x800000u
|
2017-05-03 21:53:09 +00:00
|
|
|
#else
|
|
|
|
#define ___GFP_NOLOCKDEP 0
|
|
|
|
#endif
|
2012-12-12 21:51:56 +00:00
|
|
|
/* If the above are modified, __GFP_BITS_SHIFT may need updating */
|
2010-10-26 21:22:04 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Physical address zone modifiers (see linux/mmzone.h - low four bits)
|
2006-09-26 06:31:14 +00:00
|
|
|
*
|
|
|
|
* Do not put any conditional on these. If necessary modify the definitions
|
2010-05-24 21:32:44 +00:00
|
|
|
* without the underscores and use them consistently. The definitions here may
|
2006-09-26 06:31:14 +00:00
|
|
|
* be used in bit comparisons.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2010-10-26 21:22:04 +00:00
|
|
|
#define __GFP_DMA ((__force gfp_t)___GFP_DMA)
|
|
|
|
#define __GFP_HIGHMEM ((__force gfp_t)___GFP_HIGHMEM)
|
|
|
|
#define __GFP_DMA32 ((__force gfp_t)___GFP_DMA32)
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_MOVABLE ((__force gfp_t)___GFP_MOVABLE) /* ZONE_MOVABLE allowed */
|
2009-06-16 22:32:46 +00:00
|
|
|
#define GFP_ZONEMASK (__GFP_DMA|__GFP_HIGHMEM|__GFP_DMA32|__GFP_MOVABLE)
|
2015-11-07 00:28:43 +00:00
|
|
|
|
2018-08-24 00:01:15 +00:00
|
|
|
/**
|
|
|
|
* DOC: Page mobility and placement hints
|
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Page mobility and placement hints
|
2018-08-24 00:01:15 +00:00
|
|
|
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* These flags provide hints about how mobile the page is. Pages with similar
|
|
|
|
* mobility are placed within the same pageblocks to minimise problems due
|
|
|
|
* to external fragmentation.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_MOVABLE (also a zone modifier) indicates that the page can be
|
|
|
|
* moved by page migration during memory compaction or can be reclaimed.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_RECLAIMABLE is used for slab allocations that specify
|
|
|
|
* SLAB_RECLAIM_ACCOUNT and whose pages can be freed via shrinkers.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_WRITE indicates the caller intends to dirty the page. Where possible,
|
|
|
|
* these pages will be spread between local zones to avoid all the dirty
|
|
|
|
* pages being in one zone (fair zone allocation policy).
|
2007-07-17 11:03:05 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_HARDWALL enforces the cpuset memory allocation policy.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-12-28 08:39:49 +00:00
|
|
|
* %__GFP_THISNODE forces the allocation to be satisfied from the requested
|
2018-08-24 00:01:15 +00:00
|
|
|
* node with no fallbacks or placement policy enforcements.
|
2016-01-14 23:18:12 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_ACCOUNT causes the allocation to be accounted to kmemcg.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_RECLAIMABLE ((__force gfp_t)___GFP_RECLAIMABLE)
|
|
|
|
#define __GFP_WRITE ((__force gfp_t)___GFP_WRITE)
|
|
|
|
#define __GFP_HARDWALL ((__force gfp_t)___GFP_HARDWALL)
|
|
|
|
#define __GFP_THISNODE ((__force gfp_t)___GFP_THISNODE)
|
2016-01-14 23:18:12 +00:00
|
|
|
#define __GFP_ACCOUNT ((__force gfp_t)___GFP_ACCOUNT)
|
2011-01-13 23:46:49 +00:00
|
|
|
|
2018-08-24 00:01:15 +00:00
|
|
|
/**
|
|
|
|
* DOC: Watermark modifiers
|
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Watermark modifiers -- controls access to emergency reserves
|
2018-08-24 00:01:15 +00:00
|
|
|
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_HIGH indicates that the caller is high-priority and that granting
|
|
|
|
* the request is necessary before the system can make forward progress.
|
|
|
|
* For example, creating an IO context to clean pages.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_ATOMIC indicates that the caller cannot reclaim or sleep and is
|
|
|
|
* high priority. Users are typically interrupt handlers. This may be
|
|
|
|
* used in conjunction with %__GFP_HIGH
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_MEMALLOC allows access to all memory. This should only be used when
|
|
|
|
* the caller guarantees the allocation will allow more memory to be freed
|
|
|
|
* very shortly e.g. process exiting or swapping. Users either should
|
|
|
|
* be the MM or co-ordinating closely with the VM (e.g. swap over NFS).
|
2020-06-03 22:56:49 +00:00
|
|
|
* Users of this flag have to be extremely careful to not deplete the reserve
|
|
|
|
* completely and implement a throttling mechanism which controls the
|
|
|
|
* consumption of the reserve based on the amount of freed memory.
|
|
|
|
* Usage of a pre-allocated pool (e.g. mempool) should be always considered
|
|
|
|
* before using this flag.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_NOMEMALLOC is used to explicitly forbid access to emergency reserves.
|
|
|
|
* This takes precedence over the %__GFP_MEMALLOC flag if both are set.
|
2015-11-07 00:28:21 +00:00
|
|
|
*/
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_ATOMIC ((__force gfp_t)___GFP_ATOMIC)
|
|
|
|
#define __GFP_HIGH ((__force gfp_t)___GFP_HIGH)
|
|
|
|
#define __GFP_MEMALLOC ((__force gfp_t)___GFP_MEMALLOC)
|
|
|
|
#define __GFP_NOMEMALLOC ((__force gfp_t)___GFP_NOMEMALLOC)
|
|
|
|
|
2018-08-24 00:01:15 +00:00
|
|
|
/**
|
|
|
|
* DOC: Reclaim modifiers
|
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Reclaim modifiers
|
2018-08-24 00:01:15 +00:00
|
|
|
* ~~~~~~~~~~~~~~~~~
|
2020-04-07 03:04:06 +00:00
|
|
|
* Please note that all the following flags are only applicable to sleepable
|
|
|
|
* allocations (e.g. %GFP_NOWAIT and %GFP_ATOMIC will ignore them).
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_IO can start physical IO.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_FS can call down to the low-level FS. Clearing the flag avoids the
|
|
|
|
* allocator recursing into the filesystem which might already be holding
|
|
|
|
* locks.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_DIRECT_RECLAIM indicates that the caller may enter direct reclaim.
|
|
|
|
* This flag can be cleared to avoid unnecessary delays when a fallback
|
|
|
|
* option is available.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_KSWAPD_RECLAIM indicates that the caller wants to wake kswapd when
|
|
|
|
* the low watermark is reached and have it reclaim pages until the high
|
|
|
|
* watermark is reached. A caller may wish to clear this flag when fallback
|
|
|
|
* options are available and the reclaim is likely to disrupt the system. The
|
|
|
|
* canonical example is THP allocation where a fallback is cheap but
|
|
|
|
* reclaim/compaction may cause indirect stalls.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_RECLAIM is shorthand to allow/forbid both direct and kswapd reclaim.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2017-07-12 21:36:45 +00:00
|
|
|
* The default allocator behavior depends on the request size. We have a concept
|
2018-08-24 00:01:15 +00:00
|
|
|
* of so called costly allocations (with order > %PAGE_ALLOC_COSTLY_ORDER).
|
2017-07-12 21:36:45 +00:00
|
|
|
* !costly allocations are too essential to fail so they are implicitly
|
|
|
|
* non-failing by default (with some exceptions like OOM victims might fail so
|
|
|
|
* the caller still has to check for failures) while costly requests try to be
|
|
|
|
* not disruptive and back off even without invoking the OOM killer.
|
|
|
|
* The following three modifiers might be used to override some of these
|
|
|
|
* implicit rules
|
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_NORETRY: The VM implementation will try only very lightweight
|
|
|
|
* memory direct reclaim to get some memory under memory pressure (thus
|
|
|
|
* it can sleep). It will avoid disruptive actions like OOM killer. The
|
|
|
|
* caller must handle the failure which is quite likely to happen under
|
|
|
|
* heavy memory pressure. The flag is suitable when failure can easily be
|
|
|
|
* handled at small cost, such as reduced throughput
|
|
|
|
*
|
|
|
|
* %__GFP_RETRY_MAYFAIL: The VM implementation will retry memory reclaim
|
|
|
|
* procedures that have previously failed if there is some indication
|
|
|
|
* that progress has been made else where. It can wait for other
|
|
|
|
* tasks to attempt high level approaches to freeing memory such as
|
|
|
|
* compaction (which removes fragmentation) and page-out.
|
|
|
|
* There is still a definite limit to the number of retries, but it is
|
|
|
|
* a larger limit than with %__GFP_NORETRY.
|
|
|
|
* Allocations with this flag may fail, but only when there is
|
|
|
|
* genuinely little unused memory. While these allocations do not
|
|
|
|
* directly trigger the OOM killer, their failure indicates that
|
|
|
|
* the system is likely to need to use the OOM killer soon. The
|
|
|
|
* caller must handle failure, but can reasonably do so by failing
|
|
|
|
* a higher-level request, or completing it only in a much less
|
|
|
|
* efficient manner.
|
|
|
|
* If the allocation does fail, and the caller is in a position to
|
|
|
|
* free some non-essential memory, doing so could benefit the system
|
|
|
|
* as a whole.
|
|
|
|
*
|
|
|
|
* %__GFP_NOFAIL: The VM implementation _must_ retry infinitely: the caller
|
|
|
|
* cannot handle allocation failures. The allocation could block
|
|
|
|
* indefinitely but will never return with failure. Testing for
|
|
|
|
* failure is pointless.
|
|
|
|
* New users should be evaluated carefully (and the flag should be
|
|
|
|
* used only when there is no reasonable failure policy) but it is
|
|
|
|
* definitely preferable to use the flag rather than opencode endless
|
|
|
|
* loop around allocator.
|
|
|
|
* Using this flag for costly allocations is _highly_ discouraged.
|
2015-11-07 00:28:43 +00:00
|
|
|
*/
|
|
|
|
#define __GFP_IO ((__force gfp_t)___GFP_IO)
|
|
|
|
#define __GFP_FS ((__force gfp_t)___GFP_FS)
|
2015-11-07 00:28:21 +00:00
|
|
|
#define __GFP_DIRECT_RECLAIM ((__force gfp_t)___GFP_DIRECT_RECLAIM) /* Caller can reclaim */
|
|
|
|
#define __GFP_KSWAPD_RECLAIM ((__force gfp_t)___GFP_KSWAPD_RECLAIM) /* kswapd can wake */
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_RECLAIM ((__force gfp_t)(___GFP_DIRECT_RECLAIM|___GFP_KSWAPD_RECLAIM))
|
2017-07-12 21:36:45 +00:00
|
|
|
#define __GFP_RETRY_MAYFAIL ((__force gfp_t)___GFP_RETRY_MAYFAIL)
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_NOFAIL ((__force gfp_t)___GFP_NOFAIL)
|
|
|
|
#define __GFP_NORETRY ((__force gfp_t)___GFP_NORETRY)
|
2015-11-07 00:28:21 +00:00
|
|
|
|
2018-08-24 00:01:15 +00:00
|
|
|
/**
|
|
|
|
* DOC: Action modifiers
|
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Action modifiers
|
2018-08-24 00:01:15 +00:00
|
|
|
* ~~~~~~~~~~~~~~~~
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_NOWARN suppresses allocation failure reports.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_COMP address compound page metadata.
|
2015-11-07 00:28:43 +00:00
|
|
|
*
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_ZERO returns a zeroed page on success.
|
kmemcheck: add mm functions
With kmemcheck enabled, the slab allocator needs to do this:
1. Tell kmemcheck to allocate the shadow memory which stores the status of
each byte in the allocation proper, e.g. whether it is initialized or
uninitialized.
2. Tell kmemcheck which parts of memory that should be marked uninitialized.
There are actually a few more states, such as "not yet allocated" and
"recently freed".
If a slab cache is set up using the SLAB_NOTRACK flag, it will never return
memory that can take page faults because of kmemcheck.
If a slab cache is NOT set up using the SLAB_NOTRACK flag, callers can still
request memory with the __GFP_NOTRACK flag. This does not prevent the page
faults from occuring, however, but marks the object in question as being
initialized so that no warnings will ever be produced for this object.
In addition to (and in contrast to) __GFP_NOTRACK, the
__GFP_NOTRACK_FALSE_POSITIVE flag indicates that the allocation should
not be tracked _because_ it would produce a false positive. Their values
are identical, but need not be so in the future (for example, we could now
enable/disable false positives with a config option).
Parts of this patch were contributed by Pekka Enberg but merged for
atomicity.
Signed-off-by: Vegard Nossum <vegard.nossum@gmail.com>
Signed-off-by: Pekka Enberg <penberg@cs.helsinki.fi>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
[rebased for mainline inclusion]
Signed-off-by: Vegard Nossum <vegard.nossum@gmail.com>
2008-05-31 13:56:17 +00:00
|
|
|
*/
|
2015-11-07 00:28:43 +00:00
|
|
|
#define __GFP_NOWARN ((__force gfp_t)___GFP_NOWARN)
|
|
|
|
#define __GFP_COMP ((__force gfp_t)___GFP_COMP)
|
|
|
|
#define __GFP_ZERO ((__force gfp_t)___GFP_ZERO)
|
kmemcheck: add mm functions
With kmemcheck enabled, the slab allocator needs to do this:
1. Tell kmemcheck to allocate the shadow memory which stores the status of
each byte in the allocation proper, e.g. whether it is initialized or
uninitialized.
2. Tell kmemcheck which parts of memory that should be marked uninitialized.
There are actually a few more states, such as "not yet allocated" and
"recently freed".
If a slab cache is set up using the SLAB_NOTRACK flag, it will never return
memory that can take page faults because of kmemcheck.
If a slab cache is NOT set up using the SLAB_NOTRACK flag, callers can still
request memory with the __GFP_NOTRACK flag. This does not prevent the page
faults from occuring, however, but marks the object in question as being
initialized so that no warnings will ever be produced for this object.
In addition to (and in contrast to) __GFP_NOTRACK, the
__GFP_NOTRACK_FALSE_POSITIVE flag indicates that the allocation should
not be tracked _because_ it would produce a false positive. Their values
are identical, but need not be so in the future (for example, we could now
enable/disable false positives with a config option).
Parts of this patch were contributed by Pekka Enberg but merged for
atomicity.
Signed-off-by: Vegard Nossum <vegard.nossum@gmail.com>
Signed-off-by: Pekka Enberg <penberg@cs.helsinki.fi>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
[rebased for mainline inclusion]
Signed-off-by: Vegard Nossum <vegard.nossum@gmail.com>
2008-05-31 13:56:17 +00:00
|
|
|
|
2017-05-03 21:53:09 +00:00
|
|
|
/* Disable lockdep for GFP context tracking */
|
|
|
|
#define __GFP_NOLOCKDEP ((__force gfp_t)___GFP_NOLOCKDEP)
|
|
|
|
|
2015-11-07 00:28:43 +00:00
|
|
|
/* Room for N __GFP_FOO bits */
|
2018-06-08 00:08:11 +00:00
|
|
|
#define __GFP_BITS_SHIFT (23 + IS_ENABLED(CONFIG_LOCKDEP))
|
2005-10-21 06:55:38 +00:00
|
|
|
#define __GFP_BITS_MASK ((__force gfp_t)((1 << __GFP_BITS_SHIFT) - 1))
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2018-08-24 00:01:15 +00:00
|
|
|
/**
|
|
|
|
* DOC: Useful GFP flag combinations
|
|
|
|
*
|
|
|
|
* Useful GFP flag combinations
|
|
|
|
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
|
|
|
*
|
2015-11-07 00:28:43 +00:00
|
|
|
* Useful GFP flag combinations that are commonly used. It is recommended
|
|
|
|
* that subsystems start with one of these combinations and then set/clear
|
2018-08-24 00:01:15 +00:00
|
|
|
* %__GFP_FOO flags as necessary.
|
|
|
|
*
|
|
|
|
* %GFP_ATOMIC users can not sleep and need the allocation to succeed. A lower
|
2020-10-13 23:56:07 +00:00
|
|
|
* watermark is applied to allow access to "atomic reserves".
|
|
|
|
* The current implementation doesn't support NMI and few other strict
|
|
|
|
* non-preemptive contexts (e.g. raw_spin_lock). The same applies to %GFP_NOWAIT.
|
2018-08-24 00:01:15 +00:00
|
|
|
*
|
|
|
|
* %GFP_KERNEL is typical for kernel-internal allocations. The caller requires
|
|
|
|
* %ZONE_NORMAL or a lower zone for direct access but can direct reclaim.
|
|
|
|
*
|
|
|
|
* %GFP_KERNEL_ACCOUNT is the same as GFP_KERNEL, except the allocation is
|
|
|
|
* accounted to kmemcg.
|
|
|
|
*
|
|
|
|
* %GFP_NOWAIT is for kernel allocations that should not stall for direct
|
|
|
|
* reclaim, start physical IO or use any filesystem callback.
|
|
|
|
*
|
|
|
|
* %GFP_NOIO will use direct reclaim to discard clean pages or slab pages
|
|
|
|
* that do not require the starting of any physical IO.
|
|
|
|
* Please try to avoid using this flag directly and instead use
|
|
|
|
* memalloc_noio_{save,restore} to mark the whole scope which cannot
|
|
|
|
* perform any IO with a short explanation why. All allocation requests
|
|
|
|
* will inherit GFP_NOIO implicitly.
|
|
|
|
*
|
|
|
|
* %GFP_NOFS will use direct reclaim but will not use any filesystem interfaces.
|
|
|
|
* Please try to avoid using this flag directly and instead use
|
|
|
|
* memalloc_nofs_{save,restore} to mark the whole scope which cannot/shouldn't
|
|
|
|
* recurse into the FS layer with a short explanation why. All allocation
|
|
|
|
* requests will inherit GFP_NOFS implicitly.
|
|
|
|
*
|
|
|
|
* %GFP_USER is for userspace allocations that also need to be directly
|
|
|
|
* accessibly by the kernel or hardware. It is typically used by hardware
|
|
|
|
* for buffers that are mapped to userspace (e.g. graphics) that hardware
|
|
|
|
* still must DMA to. cpuset limits are enforced for these allocations.
|
|
|
|
*
|
|
|
|
* %GFP_DMA exists for historical reasons and should be avoided where possible.
|
|
|
|
* The flags indicates that the caller requires that the lowest zone be
|
|
|
|
* used (%ZONE_DMA or 16M on x86-64). Ideally, this would be removed but
|
|
|
|
* it would require careful auditing as some users really require it and
|
|
|
|
* others use the flag to avoid lowmem reserves in %ZONE_DMA and treat the
|
|
|
|
* lowest zone as a type of emergency reserve.
|
|
|
|
*
|
|
|
|
* %GFP_DMA32 is similar to %GFP_DMA except that the caller requires a 32-bit
|
|
|
|
* address.
|
|
|
|
*
|
|
|
|
* %GFP_HIGHUSER is for userspace allocations that may be mapped to userspace,
|
|
|
|
* do not need to be directly accessible by the kernel but that cannot
|
|
|
|
* move once in use. An example may be a hardware allocation that maps
|
|
|
|
* data directly into userspace but has no addressing limitations.
|
|
|
|
*
|
|
|
|
* %GFP_HIGHUSER_MOVABLE is for userspace allocations that the kernel does not
|
|
|
|
* need direct access to but can use kmap() when access is required. They
|
|
|
|
* are expected to be movable via page reclaim or page migration. Typically,
|
|
|
|
* pages on the LRU would also be allocated with %GFP_HIGHUSER_MOVABLE.
|
|
|
|
*
|
|
|
|
* %GFP_TRANSHUGE and %GFP_TRANSHUGE_LIGHT are used for THP allocations. They
|
|
|
|
* are compound allocations that will generally fail quickly if memory is not
|
|
|
|
* available and will not wake kswapd/kcompactd on failure. The _LIGHT
|
|
|
|
* version does not attempt reclaim/compaction at all and is by default used
|
|
|
|
* in page fault path, while the non-light is used by khugepaged.
|
2015-11-07 00:28:21 +00:00
|
|
|
*/
|
|
|
|
#define GFP_ATOMIC (__GFP_HIGH|__GFP_ATOMIC|__GFP_KSWAPD_RECLAIM)
|
2015-11-07 00:28:43 +00:00
|
|
|
#define GFP_KERNEL (__GFP_RECLAIM | __GFP_IO | __GFP_FS)
|
2016-01-14 23:18:12 +00:00
|
|
|
#define GFP_KERNEL_ACCOUNT (GFP_KERNEL | __GFP_ACCOUNT)
|
2015-11-07 00:28:21 +00:00
|
|
|
#define GFP_NOWAIT (__GFP_KSWAPD_RECLAIM)
|
2015-11-07 00:28:28 +00:00
|
|
|
#define GFP_NOIO (__GFP_RECLAIM)
|
|
|
|
#define GFP_NOFS (__GFP_RECLAIM | __GFP_IO)
|
|
|
|
#define GFP_USER (__GFP_RECLAIM | __GFP_IO | __GFP_FS | __GFP_HARDWALL)
|
2015-11-07 00:28:43 +00:00
|
|
|
#define GFP_DMA __GFP_DMA
|
|
|
|
#define GFP_DMA32 __GFP_DMA32
|
2014-12-13 00:55:43 +00:00
|
|
|
#define GFP_HIGHUSER (GFP_USER | __GFP_HIGHMEM)
|
|
|
|
#define GFP_HIGHUSER_MOVABLE (GFP_HIGHUSER | __GFP_MOVABLE)
|
mm, thp: remove __GFP_NORETRY from khugepaged and madvised allocations
After the previous patch, we can distinguish costly allocations that
should be really lightweight, such as THP page faults, with
__GFP_NORETRY. This means we don't need to recognize khugepaged
allocations via PF_KTHREAD anymore. We can also change THP page faults
in areas where madvise(MADV_HUGEPAGE) was used to try as hard as
khugepaged, as the process has indicated that it benefits from THP's and
is willing to pay some initial latency costs.
We can also make the flags handling less cryptic by distinguishing
GFP_TRANSHUGE_LIGHT (no reclaim at all, default mode in page fault) from
GFP_TRANSHUGE (only direct reclaim, khugepaged default). Adding
__GFP_NORETRY or __GFP_KSWAPD_RECLAIM is done where needed.
The patch effectively changes the current GFP_TRANSHUGE users as
follows:
* get_huge_zero_page() - the zero page lifetime should be relatively
long and it's shared by multiple users, so it's worth spending some
effort on it. We use GFP_TRANSHUGE, and __GFP_NORETRY is not added.
This also restores direct reclaim to this allocation, which was
unintentionally removed by commit e4a49efe4e7e ("mm: thp: set THP defrag
by default to madvise and add a stall-free defrag option")
* alloc_hugepage_khugepaged_gfpmask() - this is khugepaged, so latency
is not an issue. So if khugepaged "defrag" is enabled (the default), do
reclaim via GFP_TRANSHUGE without __GFP_NORETRY. We can remove the
PF_KTHREAD check from page alloc.
As a side-effect, khugepaged will now no longer check if the initial
compaction was deferred or contended. This is OK, as khugepaged sleep
times between collapsion attempts are long enough to prevent noticeable
disruption, so we should allow it to spend some effort.
* migrate_misplaced_transhuge_page() - already was masking out
__GFP_RECLAIM, so just convert to GFP_TRANSHUGE_LIGHT which is
equivalent.
* alloc_hugepage_direct_gfpmask() - vma's with VM_HUGEPAGE (via madvise)
are now allocating without __GFP_NORETRY. Other vma's keep using
__GFP_NORETRY if direct reclaim/compaction is at all allowed (by default
it's allowed only for madvised vma's). The rest is conversion to
GFP_TRANSHUGE(_LIGHT).
[mhocko@suse.com: suggested GFP_TRANSHUGE_LIGHT]
Link: http://lkml.kernel.org/r/20160721073614.24395-7-vbabka@suse.cz
Signed-off-by: Vlastimil Babka <vbabka@suse.cz>
Acked-by: Michal Hocko <mhocko@suse.com>
Acked-by: Mel Gorman <mgorman@techsingularity.net>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2016-07-28 22:49:25 +00:00
|
|
|
#define GFP_TRANSHUGE_LIGHT ((GFP_HIGHUSER_MOVABLE | __GFP_COMP | \
|
|
|
|
__GFP_NOMEMALLOC | __GFP_NOWARN) & ~__GFP_RECLAIM)
|
|
|
|
#define GFP_TRANSHUGE (GFP_TRANSHUGE_LIGHT | __GFP_DIRECT_RECLAIM)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-11-07 00:28:43 +00:00
|
|
|
/* Convert GFP flags to their corresponding migrate type */
|
2007-10-16 08:25:52 +00:00
|
|
|
#define GFP_MOVABLE_MASK (__GFP_RECLAIMABLE|__GFP_MOVABLE)
|
2015-11-07 00:28:18 +00:00
|
|
|
#define GFP_MOVABLE_SHIFT 3
|
2007-10-16 08:25:41 +00:00
|
|
|
|
2020-06-03 22:59:08 +00:00
|
|
|
static inline int gfp_migratetype(const gfp_t gfp_flags)
|
Print out statistics in relation to fragmentation avoidance to /proc/pagetypeinfo
This patch provides fragmentation avoidance statistics via /proc/pagetypeinfo.
The information is collected only on request so there is no runtime overhead.
The statistics are in three parts:
The first part prints information on the size of blocks that pages are
being grouped on and looks like
Page block order: 10
Pages per block: 1024
The second part is a more detailed version of /proc/buddyinfo and looks like
Free pages count per migrate type at order 0 1 2 3 4 5 6 7 8 9 10
Node 0, zone DMA, type Unmovable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reclaimable 1 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Movable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reserve 0 4 4 0 0 0 0 1 0 1 0
Node 0, zone Normal, type Unmovable 111 8 4 4 2 3 1 0 0 0 0
Node 0, zone Normal, type Reclaimable 293 89 8 0 0 0 0 0 0 0 0
Node 0, zone Normal, type Movable 1 6 13 9 7 6 3 0 0 0 0
Node 0, zone Normal, type Reserve 0 0 0 0 0 0 0 0 0 0 4
The third part looks like
Number of blocks type Unmovable Reclaimable Movable Reserve
Node 0, zone DMA 0 1 2 1
Node 0, zone Normal 3 17 94 4
To walk the zones within a node with interrupts disabled, walk_zones_in_node()
is introduced and shared between /proc/buddyinfo, /proc/zoneinfo and
/proc/pagetypeinfo to reduce code duplication. It seems specific to what
vmstat.c requires but could be broken out as a general utility function in
mmzone.c if there were other other potential users.
Signed-off-by: Mel Gorman <mel@csn.ul.ie>
Acked-by: Andy Whitcroft <apw@shadowen.org>
Acked-by: Christoph Lameter <clameter@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 08:26:02 +00:00
|
|
|
{
|
2015-11-07 00:28:18 +00:00
|
|
|
VM_WARN_ON((gfp_flags & GFP_MOVABLE_MASK) == GFP_MOVABLE_MASK);
|
|
|
|
BUILD_BUG_ON((1UL << GFP_MOVABLE_SHIFT) != ___GFP_MOVABLE);
|
|
|
|
BUILD_BUG_ON((___GFP_MOVABLE >> GFP_MOVABLE_SHIFT) != MIGRATE_MOVABLE);
|
Print out statistics in relation to fragmentation avoidance to /proc/pagetypeinfo
This patch provides fragmentation avoidance statistics via /proc/pagetypeinfo.
The information is collected only on request so there is no runtime overhead.
The statistics are in three parts:
The first part prints information on the size of blocks that pages are
being grouped on and looks like
Page block order: 10
Pages per block: 1024
The second part is a more detailed version of /proc/buddyinfo and looks like
Free pages count per migrate type at order 0 1 2 3 4 5 6 7 8 9 10
Node 0, zone DMA, type Unmovable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reclaimable 1 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Movable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reserve 0 4 4 0 0 0 0 1 0 1 0
Node 0, zone Normal, type Unmovable 111 8 4 4 2 3 1 0 0 0 0
Node 0, zone Normal, type Reclaimable 293 89 8 0 0 0 0 0 0 0 0
Node 0, zone Normal, type Movable 1 6 13 9 7 6 3 0 0 0 0
Node 0, zone Normal, type Reserve 0 0 0 0 0 0 0 0 0 0 4
The third part looks like
Number of blocks type Unmovable Reclaimable Movable Reserve
Node 0, zone DMA 0 1 2 1
Node 0, zone Normal 3 17 94 4
To walk the zones within a node with interrupts disabled, walk_zones_in_node()
is introduced and shared between /proc/buddyinfo, /proc/zoneinfo and
/proc/pagetypeinfo to reduce code duplication. It seems specific to what
vmstat.c requires but could be broken out as a general utility function in
mmzone.c if there were other other potential users.
Signed-off-by: Mel Gorman <mel@csn.ul.ie>
Acked-by: Andy Whitcroft <apw@shadowen.org>
Acked-by: Christoph Lameter <clameter@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 08:26:02 +00:00
|
|
|
|
|
|
|
if (unlikely(page_group_by_mobility_disabled))
|
|
|
|
return MIGRATE_UNMOVABLE;
|
|
|
|
|
|
|
|
/* Group based on mobility */
|
2015-11-07 00:28:18 +00:00
|
|
|
return (gfp_flags & GFP_MOVABLE_MASK) >> GFP_MOVABLE_SHIFT;
|
Print out statistics in relation to fragmentation avoidance to /proc/pagetypeinfo
This patch provides fragmentation avoidance statistics via /proc/pagetypeinfo.
The information is collected only on request so there is no runtime overhead.
The statistics are in three parts:
The first part prints information on the size of blocks that pages are
being grouped on and looks like
Page block order: 10
Pages per block: 1024
The second part is a more detailed version of /proc/buddyinfo and looks like
Free pages count per migrate type at order 0 1 2 3 4 5 6 7 8 9 10
Node 0, zone DMA, type Unmovable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reclaimable 1 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Movable 0 0 0 0 0 0 0 0 0 0 0
Node 0, zone DMA, type Reserve 0 4 4 0 0 0 0 1 0 1 0
Node 0, zone Normal, type Unmovable 111 8 4 4 2 3 1 0 0 0 0
Node 0, zone Normal, type Reclaimable 293 89 8 0 0 0 0 0 0 0 0
Node 0, zone Normal, type Movable 1 6 13 9 7 6 3 0 0 0 0
Node 0, zone Normal, type Reserve 0 0 0 0 0 0 0 0 0 0 4
The third part looks like
Number of blocks type Unmovable Reclaimable Movable Reserve
Node 0, zone DMA 0 1 2 1
Node 0, zone Normal 3 17 94 4
To walk the zones within a node with interrupts disabled, walk_zones_in_node()
is introduced and shared between /proc/buddyinfo, /proc/zoneinfo and
/proc/pagetypeinfo to reduce code duplication. It seems specific to what
vmstat.c requires but could be broken out as a general utility function in
mmzone.c if there were other other potential users.
Signed-off-by: Mel Gorman <mel@csn.ul.ie>
Acked-by: Andy Whitcroft <apw@shadowen.org>
Acked-by: Christoph Lameter <clameter@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 08:26:02 +00:00
|
|
|
}
|
2015-11-07 00:28:43 +00:00
|
|
|
#undef GFP_MOVABLE_MASK
|
|
|
|
#undef GFP_MOVABLE_SHIFT
|
2005-11-05 16:25:53 +00:00
|
|
|
|
2015-11-07 00:28:21 +00:00
|
|
|
static inline bool gfpflags_allow_blocking(const gfp_t gfp_flags)
|
|
|
|
{
|
2016-01-14 23:22:10 +00:00
|
|
|
return !!(gfp_flags & __GFP_DIRECT_RECLAIM);
|
2015-11-07 00:28:21 +00:00
|
|
|
}
|
|
|
|
|
net: fix sk_page_frag() recursion from memory reclaim
sk_page_frag() optimizes skb_frag allocations by using per-task
skb_frag cache when it knows it's the only user. The condition is
determined by seeing whether the socket allocation mask allows
blocking - if the allocation may block, it obviously owns the task's
context and ergo exclusively owns current->task_frag.
Unfortunately, this misses recursion through memory reclaim path.
Please take a look at the following backtrace.
[2] RIP: 0010:tcp_sendmsg_locked+0xccf/0xe10
...
tcp_sendmsg+0x27/0x40
sock_sendmsg+0x30/0x40
sock_xmit.isra.24+0xa1/0x170 [nbd]
nbd_send_cmd+0x1d2/0x690 [nbd]
nbd_queue_rq+0x1b5/0x3b0 [nbd]
__blk_mq_try_issue_directly+0x108/0x1b0
blk_mq_request_issue_directly+0xbd/0xe0
blk_mq_try_issue_list_directly+0x41/0xb0
blk_mq_sched_insert_requests+0xa2/0xe0
blk_mq_flush_plug_list+0x205/0x2a0
blk_flush_plug_list+0xc3/0xf0
[1] blk_finish_plug+0x21/0x2e
_xfs_buf_ioapply+0x313/0x460
__xfs_buf_submit+0x67/0x220
xfs_buf_read_map+0x113/0x1a0
xfs_trans_read_buf_map+0xbf/0x330
xfs_btree_read_buf_block.constprop.42+0x95/0xd0
xfs_btree_lookup_get_block+0x95/0x170
xfs_btree_lookup+0xcc/0x470
xfs_bmap_del_extent_real+0x254/0x9a0
__xfs_bunmapi+0x45c/0xab0
xfs_bunmapi+0x15/0x30
xfs_itruncate_extents_flags+0xca/0x250
xfs_free_eofblocks+0x181/0x1e0
xfs_fs_destroy_inode+0xa8/0x1b0
destroy_inode+0x38/0x70
dispose_list+0x35/0x50
prune_icache_sb+0x52/0x70
super_cache_scan+0x120/0x1a0
do_shrink_slab+0x120/0x290
shrink_slab+0x216/0x2b0
shrink_node+0x1b6/0x4a0
do_try_to_free_pages+0xc6/0x370
try_to_free_mem_cgroup_pages+0xe3/0x1e0
try_charge+0x29e/0x790
mem_cgroup_charge_skmem+0x6a/0x100
__sk_mem_raise_allocated+0x18e/0x390
__sk_mem_schedule+0x2a/0x40
[0] tcp_sendmsg_locked+0x8eb/0xe10
tcp_sendmsg+0x27/0x40
sock_sendmsg+0x30/0x40
___sys_sendmsg+0x26d/0x2b0
__sys_sendmsg+0x57/0xa0
do_syscall_64+0x42/0x100
entry_SYSCALL_64_after_hwframe+0x44/0xa9
In [0], tcp_send_msg_locked() was using current->page_frag when it
called sk_wmem_schedule(). It already calculated how many bytes can
be fit into current->page_frag. Due to memory pressure,
sk_wmem_schedule() called into memory reclaim path which called into
xfs and then IO issue path. Because the filesystem in question is
backed by nbd, the control goes back into the tcp layer - back into
tcp_sendmsg_locked().
nbd sets sk_allocation to (GFP_NOIO | __GFP_MEMALLOC) which makes
sense - it's in the process of freeing memory and wants to be able to,
e.g., drop clean pages to make forward progress. However, this
confused sk_page_frag() called from [2]. Because it only tests
whether the allocation allows blocking which it does, it now thinks
current->page_frag can be used again although it already was being
used in [0].
After [2] used current->page_frag, the offset would be increased by
the used amount. When the control returns to [0],
current->page_frag's offset is increased and the previously calculated
number of bytes now may overrun the end of allocated memory leading to
silent memory corruptions.
Fix it by adding gfpflags_normal_context() which tests sleepable &&
!reclaim and use it to determine whether to use current->task_frag.
v2: Eric didn't like gfp flags being tested twice. Introduce a new
helper gfpflags_normal_context() and combine the two tests.
Signed-off-by: Tejun Heo <tj@kernel.org>
Cc: Josef Bacik <josef@toxicpanda.com>
Cc: Eric Dumazet <eric.dumazet@gmail.com>
Cc: stable@vger.kernel.org
Signed-off-by: David S. Miller <davem@davemloft.net>
2019-10-24 20:50:27 +00:00
|
|
|
/**
|
|
|
|
* gfpflags_normal_context - is gfp_flags a normal sleepable context?
|
|
|
|
* @gfp_flags: gfp_flags to test
|
|
|
|
*
|
|
|
|
* Test whether @gfp_flags indicates that the allocation is from the
|
|
|
|
* %current context and allowed to sleep.
|
|
|
|
*
|
|
|
|
* An allocation being allowed to block doesn't mean it owns the %current
|
|
|
|
* context. When direct reclaim path tries to allocate memory, the
|
|
|
|
* allocation context is nested inside whatever %current was doing at the
|
|
|
|
* time of the original allocation. The nested allocation may be allowed
|
|
|
|
* to block but modifying anything %current owns can corrupt the outer
|
|
|
|
* context's expectations.
|
|
|
|
*
|
|
|
|
* %true result from this function indicates that the allocation context
|
|
|
|
* can sleep and use anything that's associated with %current.
|
|
|
|
*/
|
|
|
|
static inline bool gfpflags_normal_context(const gfp_t gfp_flags)
|
|
|
|
{
|
|
|
|
return (gfp_flags & (__GFP_DIRECT_RECLAIM | __GFP_MEMALLOC)) ==
|
|
|
|
__GFP_DIRECT_RECLAIM;
|
|
|
|
}
|
|
|
|
|
2009-06-16 22:32:46 +00:00
|
|
|
#ifdef CONFIG_HIGHMEM
|
|
|
|
#define OPT_ZONE_HIGHMEM ZONE_HIGHMEM
|
|
|
|
#else
|
|
|
|
#define OPT_ZONE_HIGHMEM ZONE_NORMAL
|
|
|
|
#endif
|
|
|
|
|
2007-02-10 09:43:10 +00:00
|
|
|
#ifdef CONFIG_ZONE_DMA
|
2009-06-16 22:32:46 +00:00
|
|
|
#define OPT_ZONE_DMA ZONE_DMA
|
|
|
|
#else
|
|
|
|
#define OPT_ZONE_DMA ZONE_NORMAL
|
2007-02-10 09:43:10 +00:00
|
|
|
#endif
|
2009-06-16 22:32:46 +00:00
|
|
|
|
2006-09-26 06:31:17 +00:00
|
|
|
#ifdef CONFIG_ZONE_DMA32
|
2009-06-16 22:32:46 +00:00
|
|
|
#define OPT_ZONE_DMA32 ZONE_DMA32
|
|
|
|
#else
|
|
|
|
#define OPT_ZONE_DMA32 ZONE_NORMAL
|
2006-09-26 06:31:17 +00:00
|
|
|
#endif
|
2009-06-16 22:32:46 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* GFP_ZONE_TABLE is a word size bitstring that is used for looking up the
|
2017-05-03 21:54:51 +00:00
|
|
|
* zone to use given the lowest 4 bits of gfp_t. Entries are GFP_ZONES_SHIFT
|
|
|
|
* bits long and there are 16 of them to cover all possible combinations of
|
2010-05-24 21:32:44 +00:00
|
|
|
* __GFP_DMA, __GFP_DMA32, __GFP_MOVABLE and __GFP_HIGHMEM.
|
2009-06-16 22:32:46 +00:00
|
|
|
*
|
|
|
|
* The zone fallback order is MOVABLE=>HIGHMEM=>NORMAL=>DMA32=>DMA.
|
|
|
|
* But GFP_MOVABLE is not only a zone specifier but also an allocation
|
|
|
|
* policy. Therefore __GFP_MOVABLE plus another zone selector is valid.
|
2010-05-24 21:32:44 +00:00
|
|
|
* Only 1 bit of the lowest 3 bits (DMA,DMA32,HIGHMEM) can be set to "1".
|
2009-06-16 22:32:46 +00:00
|
|
|
*
|
|
|
|
* bit result
|
|
|
|
* =================
|
|
|
|
* 0x0 => NORMAL
|
|
|
|
* 0x1 => DMA or NORMAL
|
|
|
|
* 0x2 => HIGHMEM or NORMAL
|
|
|
|
* 0x3 => BAD (DMA+HIGHMEM)
|
2018-06-08 00:09:36 +00:00
|
|
|
* 0x4 => DMA32 or NORMAL
|
2009-06-16 22:32:46 +00:00
|
|
|
* 0x5 => BAD (DMA+DMA32)
|
|
|
|
* 0x6 => BAD (HIGHMEM+DMA32)
|
|
|
|
* 0x7 => BAD (HIGHMEM+DMA32+DMA)
|
|
|
|
* 0x8 => NORMAL (MOVABLE+0)
|
|
|
|
* 0x9 => DMA or NORMAL (MOVABLE+DMA)
|
|
|
|
* 0xa => MOVABLE (Movable is valid only if HIGHMEM is set too)
|
|
|
|
* 0xb => BAD (MOVABLE+HIGHMEM+DMA)
|
2018-06-08 00:09:36 +00:00
|
|
|
* 0xc => DMA32 or NORMAL (MOVABLE+DMA32)
|
2009-06-16 22:32:46 +00:00
|
|
|
* 0xd => BAD (MOVABLE+DMA32+DMA)
|
|
|
|
* 0xe => BAD (MOVABLE+DMA32+HIGHMEM)
|
|
|
|
* 0xf => BAD (MOVABLE+DMA32+HIGHMEM+DMA)
|
|
|
|
*
|
2016-03-17 21:19:41 +00:00
|
|
|
* GFP_ZONES_SHIFT must be <= 2 on 32 bit platforms.
|
2009-06-16 22:32:46 +00:00
|
|
|
*/
|
|
|
|
|
2016-03-17 21:19:41 +00:00
|
|
|
#if defined(CONFIG_ZONE_DEVICE) && (MAX_NR_ZONES-1) <= 4
|
|
|
|
/* ZONE_DEVICE is not a valid GFP zone specifier */
|
|
|
|
#define GFP_ZONES_SHIFT 2
|
|
|
|
#else
|
|
|
|
#define GFP_ZONES_SHIFT ZONES_SHIFT
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if 16 * GFP_ZONES_SHIFT > BITS_PER_LONG
|
|
|
|
#error GFP_ZONES_SHIFT too large to create GFP_ZONE_TABLE integer
|
2009-06-16 22:32:46 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#define GFP_ZONE_TABLE ( \
|
2016-03-17 21:19:41 +00:00
|
|
|
(ZONE_NORMAL << 0 * GFP_ZONES_SHIFT) \
|
|
|
|
| (OPT_ZONE_DMA << ___GFP_DMA * GFP_ZONES_SHIFT) \
|
|
|
|
| (OPT_ZONE_HIGHMEM << ___GFP_HIGHMEM * GFP_ZONES_SHIFT) \
|
|
|
|
| (OPT_ZONE_DMA32 << ___GFP_DMA32 * GFP_ZONES_SHIFT) \
|
|
|
|
| (ZONE_NORMAL << ___GFP_MOVABLE * GFP_ZONES_SHIFT) \
|
|
|
|
| (OPT_ZONE_DMA << (___GFP_MOVABLE | ___GFP_DMA) * GFP_ZONES_SHIFT) \
|
|
|
|
| (ZONE_MOVABLE << (___GFP_MOVABLE | ___GFP_HIGHMEM) * GFP_ZONES_SHIFT)\
|
|
|
|
| (OPT_ZONE_DMA32 << (___GFP_MOVABLE | ___GFP_DMA32) * GFP_ZONES_SHIFT)\
|
2009-06-16 22:32:46 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
/*
|
2010-05-24 21:32:44 +00:00
|
|
|
* GFP_ZONE_BAD is a bitmap for all combinations of __GFP_DMA, __GFP_DMA32
|
2009-06-16 22:32:46 +00:00
|
|
|
* __GFP_HIGHMEM and __GFP_MOVABLE that are not permitted. One flag per
|
|
|
|
* entry starting with bit 0. Bit is set if the combination is not
|
|
|
|
* allowed.
|
|
|
|
*/
|
|
|
|
#define GFP_ZONE_BAD ( \
|
2010-10-26 21:22:04 +00:00
|
|
|
1 << (___GFP_DMA | ___GFP_HIGHMEM) \
|
|
|
|
| 1 << (___GFP_DMA | ___GFP_DMA32) \
|
|
|
|
| 1 << (___GFP_DMA32 | ___GFP_HIGHMEM) \
|
|
|
|
| 1 << (___GFP_DMA | ___GFP_DMA32 | ___GFP_HIGHMEM) \
|
|
|
|
| 1 << (___GFP_MOVABLE | ___GFP_HIGHMEM | ___GFP_DMA) \
|
|
|
|
| 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_DMA) \
|
|
|
|
| 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_HIGHMEM) \
|
|
|
|
| 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_DMA | ___GFP_HIGHMEM) \
|
2009-06-16 22:32:46 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
static inline enum zone_type gfp_zone(gfp_t flags)
|
|
|
|
{
|
|
|
|
enum zone_type z;
|
2010-10-26 21:22:04 +00:00
|
|
|
int bit = (__force int) (flags & GFP_ZONEMASK);
|
2009-06-16 22:32:46 +00:00
|
|
|
|
2016-03-17 21:19:41 +00:00
|
|
|
z = (GFP_ZONE_TABLE >> (bit * GFP_ZONES_SHIFT)) &
|
|
|
|
((1 << GFP_ZONES_SHIFT) - 1);
|
2011-05-25 00:11:42 +00:00
|
|
|
VM_BUG_ON((GFP_ZONE_BAD >> bit) & 1);
|
2009-06-16 22:32:46 +00:00
|
|
|
return z;
|
2006-09-26 06:31:17 +00:00
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* There is only one page-allocator function, and two main namespaces to
|
|
|
|
* it. The alloc_page*() variants return 'struct page *' and as such
|
|
|
|
* can allocate highmem pages, the *get*page*() variants return
|
|
|
|
* virtual kernel addresses to the allocated page(s).
|
|
|
|
*/
|
|
|
|
|
2008-04-28 09:12:16 +00:00
|
|
|
static inline int gfp_zonelist(gfp_t flags)
|
|
|
|
{
|
2016-01-14 23:19:00 +00:00
|
|
|
#ifdef CONFIG_NUMA
|
|
|
|
if (unlikely(flags & __GFP_THISNODE))
|
|
|
|
return ZONELIST_NOFALLBACK;
|
|
|
|
#endif
|
|
|
|
return ZONELIST_FALLBACK;
|
2008-04-28 09:12:16 +00:00
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* We get the zone list from the current node and the gfp_mask.
|
|
|
|
* This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones.
|
2008-04-28 09:12:16 +00:00
|
|
|
* There are two zonelists per node, one for all zones with memory and
|
|
|
|
* one containing just zones from the node the zonelist belongs to.
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* For the normal case of non-DISCONTIGMEM systems the NODE_DATA() gets
|
|
|
|
* optimized to &contig_page_data at compile-time.
|
|
|
|
*/
|
2008-04-28 09:12:14 +00:00
|
|
|
static inline struct zonelist *node_zonelist(int nid, gfp_t flags)
|
|
|
|
{
|
2008-04-28 09:12:16 +00:00
|
|
|
return NODE_DATA(nid)->node_zonelists + gfp_zonelist(flags);
|
2008-04-28 09:12:14 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#ifndef HAVE_ARCH_FREE_PAGE
|
|
|
|
static inline void arch_free_page(struct page *page, int order) { }
|
|
|
|
#endif
|
2006-12-07 04:32:00 +00:00
|
|
|
#ifndef HAVE_ARCH_ALLOC_PAGE
|
|
|
|
static inline void arch_alloc_page(struct page *page, int order) { }
|
|
|
|
#endif
|
2020-04-02 04:05:56 +00:00
|
|
|
#ifndef HAVE_ARCH_MAKE_PAGE_ACCESSIBLE
|
|
|
|
static inline int arch_make_page_accessible(struct page *page)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-07-24 04:27:01 +00:00
|
|
|
struct page *
|
2017-07-06 22:40:03 +00:00
|
|
|
__alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, int preferred_nid,
|
|
|
|
nodemask_t *nodemask);
|
2008-07-24 04:27:01 +00:00
|
|
|
|
|
|
|
static inline struct page *
|
2017-07-06 22:40:03 +00:00
|
|
|
__alloc_pages(gfp_t gfp_mask, unsigned int order, int preferred_nid)
|
2008-07-24 04:27:01 +00:00
|
|
|
{
|
2017-07-06 22:40:03 +00:00
|
|
|
return __alloc_pages_nodemask(gfp_mask, order, preferred_nid, NULL);
|
2008-07-24 04:27:01 +00:00
|
|
|
}
|
|
|
|
|
mm: rename alloc_pages_exact_node() to __alloc_pages_node()
alloc_pages_exact_node() was introduced in commit 6484eb3e2a81 ("page
allocator: do not check NUMA node ID when the caller knows the node is
valid") as an optimized variant of alloc_pages_node(), that doesn't
fallback to current node for nid == NUMA_NO_NODE. Unfortunately the
name of the function can easily suggest that the allocation is
restricted to the given node and fails otherwise. In truth, the node is
only preferred, unless __GFP_THISNODE is passed among the gfp flags.
The misleading name has lead to mistakes in the past, see for example
commits 5265047ac301 ("mm, thp: really limit transparent hugepage
allocation to local node") and b360edb43f8e ("mm, mempolicy:
migrate_to_node should only migrate to node").
Another issue with the name is that there's a family of
alloc_pages_exact*() functions where 'exact' means exact size (instead
of page order), which leads to more confusion.
To prevent further mistakes, this patch effectively renames
alloc_pages_exact_node() to __alloc_pages_node() to better convey that
it's an optimized variant of alloc_pages_node() not intended for general
usage. Both functions get described in comments.
It has been also considered to really provide a convenience function for
allocations restricted to a node, but the major opinion seems to be that
__GFP_THISNODE already provides that functionality and we shouldn't
duplicate the API needlessly. The number of users would be small
anyway.
Existing callers of alloc_pages_exact_node() are simply converted to
call __alloc_pages_node(), with the exception of sba_alloc_coherent()
which open-codes the check for NUMA_NO_NODE, so it is converted to use
alloc_pages_node() instead. This means it no longer performs some
VM_BUG_ON checks, and since the current check for nid in
alloc_pages_node() uses a 'nid < 0' comparison (which includes
NUMA_NO_NODE), it may hide wrong values which would be previously
exposed.
Both differences will be rectified by the next patch.
To sum up, this patch makes no functional changes, except temporarily
hiding potentially buggy callers. Restricting the checks in
alloc_pages_node() is left for the next patch which can in turn expose
more existing buggy callers.
Signed-off-by: Vlastimil Babka <vbabka@suse.cz>
Acked-by: Johannes Weiner <hannes@cmpxchg.org>
Acked-by: Robin Holt <robinmholt@gmail.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Acked-by: Christoph Lameter <cl@linux.com>
Acked-by: Michael Ellerman <mpe@ellerman.id.au>
Cc: Mel Gorman <mgorman@suse.de>
Cc: David Rientjes <rientjes@google.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Joonsoo Kim <iamjoonsoo.kim@lge.com>
Cc: Naoya Horiguchi <n-horiguchi@ah.jp.nec.com>
Cc: Tony Luck <tony.luck@intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Gleb Natapov <gleb@kernel.org>
Cc: Paolo Bonzini <pbonzini@redhat.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Cliff Whickman <cpw@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2015-09-08 22:03:50 +00:00
|
|
|
/*
|
|
|
|
* Allocate pages, preferring the node given as nid. The node must be valid and
|
|
|
|
* online. For more general interface, see alloc_pages_node().
|
|
|
|
*/
|
|
|
|
static inline struct page *
|
|
|
|
__alloc_pages_node(int nid, gfp_t gfp_mask, unsigned int order)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-09-08 22:03:53 +00:00
|
|
|
VM_BUG_ON(nid < 0 || nid >= MAX_NUMNODES);
|
2018-05-25 21:47:46 +00:00
|
|
|
VM_WARN_ON((gfp_mask & __GFP_THISNODE) && !node_online(nid));
|
2006-01-11 21:43:45 +00:00
|
|
|
|
2017-07-06 22:40:03 +00:00
|
|
|
return __alloc_pages(gfp_mask, order, nid);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
mm: rename alloc_pages_exact_node() to __alloc_pages_node()
alloc_pages_exact_node() was introduced in commit 6484eb3e2a81 ("page
allocator: do not check NUMA node ID when the caller knows the node is
valid") as an optimized variant of alloc_pages_node(), that doesn't
fallback to current node for nid == NUMA_NO_NODE. Unfortunately the
name of the function can easily suggest that the allocation is
restricted to the given node and fails otherwise. In truth, the node is
only preferred, unless __GFP_THISNODE is passed among the gfp flags.
The misleading name has lead to mistakes in the past, see for example
commits 5265047ac301 ("mm, thp: really limit transparent hugepage
allocation to local node") and b360edb43f8e ("mm, mempolicy:
migrate_to_node should only migrate to node").
Another issue with the name is that there's a family of
alloc_pages_exact*() functions where 'exact' means exact size (instead
of page order), which leads to more confusion.
To prevent further mistakes, this patch effectively renames
alloc_pages_exact_node() to __alloc_pages_node() to better convey that
it's an optimized variant of alloc_pages_node() not intended for general
usage. Both functions get described in comments.
It has been also considered to really provide a convenience function for
allocations restricted to a node, but the major opinion seems to be that
__GFP_THISNODE already provides that functionality and we shouldn't
duplicate the API needlessly. The number of users would be small
anyway.
Existing callers of alloc_pages_exact_node() are simply converted to
call __alloc_pages_node(), with the exception of sba_alloc_coherent()
which open-codes the check for NUMA_NO_NODE, so it is converted to use
alloc_pages_node() instead. This means it no longer performs some
VM_BUG_ON checks, and since the current check for nid in
alloc_pages_node() uses a 'nid < 0' comparison (which includes
NUMA_NO_NODE), it may hide wrong values which would be previously
exposed.
Both differences will be rectified by the next patch.
To sum up, this patch makes no functional changes, except temporarily
hiding potentially buggy callers. Restricting the checks in
alloc_pages_node() is left for the next patch which can in turn expose
more existing buggy callers.
Signed-off-by: Vlastimil Babka <vbabka@suse.cz>
Acked-by: Johannes Weiner <hannes@cmpxchg.org>
Acked-by: Robin Holt <robinmholt@gmail.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Acked-by: Christoph Lameter <cl@linux.com>
Acked-by: Michael Ellerman <mpe@ellerman.id.au>
Cc: Mel Gorman <mgorman@suse.de>
Cc: David Rientjes <rientjes@google.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Joonsoo Kim <iamjoonsoo.kim@lge.com>
Cc: Naoya Horiguchi <n-horiguchi@ah.jp.nec.com>
Cc: Tony Luck <tony.luck@intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Gleb Natapov <gleb@kernel.org>
Cc: Paolo Bonzini <pbonzini@redhat.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Cliff Whickman <cpw@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2015-09-08 22:03:50 +00:00
|
|
|
/*
|
|
|
|
* Allocate pages, preferring the node given as nid. When nid == NUMA_NO_NODE,
|
2015-09-08 22:03:56 +00:00
|
|
|
* prefer the current CPU's closest node. Otherwise node must be valid and
|
|
|
|
* online.
|
mm: rename alloc_pages_exact_node() to __alloc_pages_node()
alloc_pages_exact_node() was introduced in commit 6484eb3e2a81 ("page
allocator: do not check NUMA node ID when the caller knows the node is
valid") as an optimized variant of alloc_pages_node(), that doesn't
fallback to current node for nid == NUMA_NO_NODE. Unfortunately the
name of the function can easily suggest that the allocation is
restricted to the given node and fails otherwise. In truth, the node is
only preferred, unless __GFP_THISNODE is passed among the gfp flags.
The misleading name has lead to mistakes in the past, see for example
commits 5265047ac301 ("mm, thp: really limit transparent hugepage
allocation to local node") and b360edb43f8e ("mm, mempolicy:
migrate_to_node should only migrate to node").
Another issue with the name is that there's a family of
alloc_pages_exact*() functions where 'exact' means exact size (instead
of page order), which leads to more confusion.
To prevent further mistakes, this patch effectively renames
alloc_pages_exact_node() to __alloc_pages_node() to better convey that
it's an optimized variant of alloc_pages_node() not intended for general
usage. Both functions get described in comments.
It has been also considered to really provide a convenience function for
allocations restricted to a node, but the major opinion seems to be that
__GFP_THISNODE already provides that functionality and we shouldn't
duplicate the API needlessly. The number of users would be small
anyway.
Existing callers of alloc_pages_exact_node() are simply converted to
call __alloc_pages_node(), with the exception of sba_alloc_coherent()
which open-codes the check for NUMA_NO_NODE, so it is converted to use
alloc_pages_node() instead. This means it no longer performs some
VM_BUG_ON checks, and since the current check for nid in
alloc_pages_node() uses a 'nid < 0' comparison (which includes
NUMA_NO_NODE), it may hide wrong values which would be previously
exposed.
Both differences will be rectified by the next patch.
To sum up, this patch makes no functional changes, except temporarily
hiding potentially buggy callers. Restricting the checks in
alloc_pages_node() is left for the next patch which can in turn expose
more existing buggy callers.
Signed-off-by: Vlastimil Babka <vbabka@suse.cz>
Acked-by: Johannes Weiner <hannes@cmpxchg.org>
Acked-by: Robin Holt <robinmholt@gmail.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Acked-by: Christoph Lameter <cl@linux.com>
Acked-by: Michael Ellerman <mpe@ellerman.id.au>
Cc: Mel Gorman <mgorman@suse.de>
Cc: David Rientjes <rientjes@google.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
Cc: Pekka Enberg <penberg@kernel.org>
Cc: Joonsoo Kim <iamjoonsoo.kim@lge.com>
Cc: Naoya Horiguchi <n-horiguchi@ah.jp.nec.com>
Cc: Tony Luck <tony.luck@intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: Arnd Bergmann <arnd@arndb.de>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Gleb Natapov <gleb@kernel.org>
Cc: Paolo Bonzini <pbonzini@redhat.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Cliff Whickman <cpw@sgi.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2015-09-08 22:03:50 +00:00
|
|
|
*/
|
|
|
|
static inline struct page *alloc_pages_node(int nid, gfp_t gfp_mask,
|
2009-06-16 22:31:54 +00:00
|
|
|
unsigned int order)
|
|
|
|
{
|
2015-09-08 22:03:53 +00:00
|
|
|
if (nid == NUMA_NO_NODE)
|
2015-09-08 22:03:56 +00:00
|
|
|
nid = numa_mem_id();
|
2009-06-16 22:31:54 +00:00
|
|
|
|
2015-09-08 22:03:53 +00:00
|
|
|
return __alloc_pages_node(nid, gfp_mask, order);
|
2009-06-16 22:31:54 +00:00
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifdef CONFIG_NUMA
|
2005-10-07 06:46:04 +00:00
|
|
|
extern struct page *alloc_pages_current(gfp_t gfp_mask, unsigned order);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static inline struct page *
|
2005-10-07 06:46:04 +00:00
|
|
|
alloc_pages(gfp_t gfp_mask, unsigned int order)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
return alloc_pages_current(gfp_mask, order);
|
|
|
|
}
|
2011-01-13 23:47:05 +00:00
|
|
|
extern struct page *alloc_pages_vma(gfp_t gfp_mask, int order,
|
2011-03-05 01:36:29 +00:00
|
|
|
struct vm_area_struct *vma, unsigned long addr,
|
2019-09-04 19:54:20 +00:00
|
|
|
int node, bool hugepage);
|
|
|
|
#define alloc_hugepage_vma(gfp_mask, vma, addr, order) \
|
|
|
|
alloc_pages_vma(gfp_mask, order, vma, addr, numa_node_id(), true)
|
2005-04-16 22:20:36 +00:00
|
|
|
#else
|
2020-08-17 17:17:20 +00:00
|
|
|
static inline struct page *alloc_pages(gfp_t gfp_mask, unsigned int order)
|
|
|
|
{
|
|
|
|
return alloc_pages_node(numa_node_id(), gfp_mask, order);
|
|
|
|
}
|
2019-09-04 19:54:20 +00:00
|
|
|
#define alloc_pages_vma(gfp_mask, order, vma, addr, node, false)\
|
|
|
|
alloc_pages(gfp_mask, order)
|
|
|
|
#define alloc_hugepage_vma(gfp_mask, vma, addr, order) \
|
2015-02-11 23:27:12 +00:00
|
|
|
alloc_pages(gfp_mask, order)
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif
|
|
|
|
#define alloc_page(gfp_mask) alloc_pages(gfp_mask, 0)
|
2011-03-05 01:36:29 +00:00
|
|
|
#define alloc_page_vma(gfp_mask, vma, addr) \
|
2019-09-04 19:54:20 +00:00
|
|
|
alloc_pages_vma(gfp_mask, 0, vma, addr, numa_node_id(), false)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-02-13 23:03:15 +00:00
|
|
|
extern unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order);
|
|
|
|
extern unsigned long get_zeroed_page(gfp_t gfp_mask);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-07-24 04:28:11 +00:00
|
|
|
void *alloc_pages_exact(size_t size, gfp_t gfp_mask);
|
|
|
|
void free_pages_exact(void *virt, size_t size);
|
2014-08-06 23:04:59 +00:00
|
|
|
void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask);
|
2008-07-24 04:28:11 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#define __get_free_page(gfp_mask) \
|
2010-05-24 21:32:45 +00:00
|
|
|
__get_free_pages((gfp_mask), 0)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#define __get_dma_pages(gfp_mask, order) \
|
2010-05-24 21:32:45 +00:00
|
|
|
__get_free_pages((gfp_mask) | GFP_DMA, (order))
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-02-13 23:03:15 +00:00
|
|
|
extern void __free_pages(struct page *page, unsigned int order);
|
|
|
|
extern void free_pages(unsigned long addr, unsigned int order);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-05-07 04:11:57 +00:00
|
|
|
struct page_frag_cache;
|
2017-01-11 00:58:09 +00:00
|
|
|
extern void __page_frag_cache_drain(struct page *page, unsigned int count);
|
2021-02-04 10:56:35 +00:00
|
|
|
extern void *page_frag_alloc_align(struct page_frag_cache *nc,
|
|
|
|
unsigned int fragsz, gfp_t gfp_mask,
|
|
|
|
unsigned int align_mask);
|
|
|
|
|
|
|
|
static inline void *page_frag_alloc(struct page_frag_cache *nc,
|
|
|
|
unsigned int fragsz, gfp_t gfp_mask)
|
|
|
|
{
|
|
|
|
return page_frag_alloc_align(nc, fragsz, gfp_mask, ~0u);
|
|
|
|
}
|
|
|
|
|
2017-01-11 00:58:06 +00:00
|
|
|
extern void page_frag_free(void *addr);
|
2015-05-07 04:11:57 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#define __free_page(page) __free_pages((page), 0)
|
2010-05-24 21:32:45 +00:00
|
|
|
#define free_page(addr) free_pages((addr), 0)
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
void page_alloc_init(void);
|
2007-05-09 09:35:14 +00:00
|
|
|
void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp);
|
2014-12-10 23:43:01 +00:00
|
|
|
void drain_all_pages(struct zone *zone);
|
|
|
|
void drain_local_pages(struct zone *zone);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-06-30 21:57:27 +00:00
|
|
|
void page_alloc_init_late(void);
|
|
|
|
|
2012-01-10 23:07:15 +00:00
|
|
|
/*
|
|
|
|
* gfp_allowed_mask is set to GFP_BOOT_MASK during early boot to restrict what
|
|
|
|
* GFP flags are used before interrupts are enabled. Once interrupts are
|
|
|
|
* enabled, it is set to __GFP_BITS_MASK while the system is running. During
|
|
|
|
* hibernation, it is used by PM to avoid I/O during memory allocation while
|
|
|
|
* devices are suspended.
|
|
|
|
*/
|
2009-06-18 03:24:12 +00:00
|
|
|
extern gfp_t gfp_allowed_mask;
|
|
|
|
|
2012-07-31 23:44:19 +00:00
|
|
|
/* Returns true if the gfp_mask allows use of ALLOC_NO_WATERMARK */
|
|
|
|
bool gfp_pfmemalloc_allowed(gfp_t gfp_mask);
|
|
|
|
|
2010-12-03 21:57:45 +00:00
|
|
|
extern void pm_restrict_gfp_mask(void);
|
|
|
|
extern void pm_restore_gfp_mask(void);
|
2009-06-18 03:24:12 +00:00
|
|
|
|
mm,thp,shmem: limit shmem THP alloc gfp_mask
Patch series "mm,thp,shm: limit shmem THP alloc gfp_mask", v6.
The allocation flags of anonymous transparent huge pages can be controlled
through the files in /sys/kernel/mm/transparent_hugepage/defrag, which can
help the system from getting bogged down in the page reclaim and
compaction code when many THPs are getting allocated simultaneously.
However, the gfp_mask for shmem THP allocations were not limited by those
configuration settings, and some workloads ended up with all CPUs stuck on
the LRU lock in the page reclaim code, trying to allocate dozens of THPs
simultaneously.
This patch applies the same configurated limitation of THPs to shmem
hugepage allocations, to prevent that from happening.
This way a THP defrag setting of "never" or "defer+madvise" will result in
quick allocation failures without direct reclaim when no 2MB free pages
are available.
With this patch applied, THP allocations for tmpfs will be a little more
aggressive than today for files mmapped with MADV_HUGEPAGE, and a little
less aggressive for files that are not mmapped or mapped without that
flag.
This patch (of 4):
The allocation flags of anonymous transparent huge pages can be controlled
through the files in /sys/kernel/mm/transparent_hugepage/defrag, which can
help the system from getting bogged down in the page reclaim and
compaction code when many THPs are getting allocated simultaneously.
However, the gfp_mask for shmem THP allocations were not limited by those
configuration settings, and some workloads ended up with all CPUs stuck on
the LRU lock in the page reclaim code, trying to allocate dozens of THPs
simultaneously.
This patch applies the same configurated limitation of THPs to shmem
hugepage allocations, to prevent that from happening.
Controlling the gfp_mask of THP allocations through the knobs in sysfs
allows users to determine the balance between how aggressively the system
tries to allocate THPs at fault time, and how much the application may end
up stalling attempting those allocations.
This way a THP defrag setting of "never" or "defer+madvise" will result in
quick allocation failures without direct reclaim when no 2MB free pages
are available.
With this patch applied, THP allocations for tmpfs will be a little more
aggressive than today for files mmapped with MADV_HUGEPAGE, and a little
less aggressive for files that are not mmapped or mapped without that
flag.
Link: https://lkml.kernel.org/r/20201124194925.623931-1-riel@surriel.com
Link: https://lkml.kernel.org/r/20201124194925.623931-2-riel@surriel.com
Signed-off-by: Rik van Riel <riel@surriel.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Acked-by: Vlastimil Babka <vbabka@suse.cz>
Cc: Xu Yu <xuyu@linux.alibaba.com>
Cc: Mel Gorman <mgorman@suse.de>
Cc: Andrea Arcangeli <aarcange@redhat.com>
Cc: Matthew Wilcox (Oracle) <willy@infradead.org>
Cc: Hugh Dickins <hughd@google.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2021-02-26 01:16:18 +00:00
|
|
|
extern gfp_t vma_thp_gfp_mask(struct vm_area_struct *vma);
|
|
|
|
|
2012-01-10 23:07:15 +00:00
|
|
|
#ifdef CONFIG_PM_SLEEP
|
|
|
|
extern bool pm_suspended_storage(void);
|
|
|
|
#else
|
|
|
|
static inline bool pm_suspended_storage(void)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_PM_SLEEP */
|
|
|
|
|
2019-05-14 00:19:00 +00:00
|
|
|
#ifdef CONFIG_CONTIG_ALLOC
|
2011-12-29 12:09:50 +00:00
|
|
|
/* The below functions must be run on a range from a single zone. */
|
2012-04-03 13:06:15 +00:00
|
|
|
extern int alloc_contig_range(unsigned long start, unsigned long end,
|
2017-02-24 22:58:37 +00:00
|
|
|
unsigned migratetype, gfp_t gfp_mask);
|
2019-12-01 01:55:06 +00:00
|
|
|
extern struct page *alloc_contig_pages(unsigned long nr_pages, gfp_t gfp_mask,
|
|
|
|
int nid, nodemask_t *nodemask);
|
2016-02-05 23:36:41 +00:00
|
|
|
#endif
|
2019-05-14 00:19:04 +00:00
|
|
|
void free_contig_range(unsigned long pfn, unsigned int nr_pages);
|
2011-12-29 12:09:50 +00:00
|
|
|
|
2016-02-05 23:36:41 +00:00
|
|
|
#ifdef CONFIG_CMA
|
2011-12-29 12:09:50 +00:00
|
|
|
/* CMA stuff */
|
|
|
|
extern void init_cma_reserved_pageblock(struct page *page);
|
2011-12-29 12:09:50 +00:00
|
|
|
#endif
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* __LINUX_GFP_H */
|