• Home
  • Raw
  • Download

Lines Matching refs:of

16 	  This option allows you to change some of the ways that
27 system in terms of performance and resource consumption
43 more efficient handling of these holes.
46 architectures, it is considered deprecated in favor of
83 # Both the NUMA code and DISCONTIGMEM use arrays of pg_data_t's
84 # to represent different areas of memory. This variable allows
100 # consume vast quantities of .bss, so be careful.
185 # page_table_lock, so that faults on different parts of the user address
215 significantly the number of 2MB contiguous memory blocks that can be
217 with the reduced number of transparent huge pages that could be used
219 pages enlisted as being part of memory balloon devices avoids the
233 the lack of the feature can lead to unexpected OOM killer
247 Allows the migration of the physical location of pages of processes
252 allocation instead of reclaiming.
272 the full range of memory available to the CPU. Enabled
294 of an application's address space that an app has advised may be
295 mergeable. When it finds pages of identical content, it replaces
308 This is the portion of low virtual memory which should be protected
310 can help reduce the impact of kernel NULL pointer bugs.
312 For most ia64, ppc64 and x86 users with lots of address space
313 a value of 65536 is reasonable and should cause no problems.
334 even when some of its memory has uncorrected errors. This requires
348 of memory on which to store mappings, but it can only ask the system
355 if there are a lot of transient processes.
361 (/proc/sys/vm/nr_trim_pages) which specifies the minimum number of
365 This option specifies the initial value of this option. The default
366 of 1 says that all excess pages should be trimmed.
380 allocation, by reducing the number of tlb misses and by speeding
396 memory footprint of applications without a guaranteed
405 memory footprint of applications without a guaranteed
437 Cleancache can be thought of as a page-granularity victim cache
443 addressable by the kernel and is of unknown and possibly
460 Frontswap is so named because it can be thought of as the opposite
461 of a "backing" store for a swap device. The data is stored into
463 addressable by the kernel and is of unknown and possibly
479 subsystems to allocate big physically-contiguous blocks of memory.
480 CMA reserves a region of memory and allows only movable pages to
503 int "Maximum count of the CMA areas"
509 number of CMA area in the system.
532 pages that are in the process of being swapped out and attempts to
538 This is marked experimental because it is a new feature (as of
541 they have not be fully explored on the large set of potential
611 This is the maximum stack size in Megabytes in the VM layout of 32-bit
620 bool "Defer initialisation of struct pages to kthreads"
627 amount of time. If this option is set, large machines will bring up
628 a subset of memmap at boot and then initialise the rest in parallel
631 lifetime of the system until these kthreads finish the
639 This feature allows to estimate the amount of user pages that have
640 not been touched during a given period of time. This information can
661 memmap. This allows pfn_to_page() lookups of otherwise
671 # Helpers to mirror range of the CPU page tables of a process into device page
685 Allows creation of struct pages to represent unaddressable device
687 group of devices). You likely also want to select HMM_MIRROR.
708 performance of get_user_pages_fast().
723 support of file THPs will be developed in the next few release