xref: /linux/Documentation/admin-guide/cgroup-v2.rst (revision e7d759f31ca295d589f7420719c311870bb3166f)
1.. _cgroup-v2:
2
3================
4Control Group v2
5================
6
7:Date: October, 2015
8:Author: Tejun Heo <tj@kernel.org>
9
10This is the authoritative documentation on the design, interface and
11conventions of cgroup v2.  It describes all userland-visible aspects
12of cgroup including core and specific controller behaviors.  All
13future changes must be reflected in this document.  Documentation for
14v1 is available under :ref:`Documentation/admin-guide/cgroup-v1/index.rst <cgroup-v1>`.
15
16.. CONTENTS
17
18   1. Introduction
19     1-1. Terminology
20     1-2. What is cgroup?
21   2. Basic Operations
22     2-1. Mounting
23     2-2. Organizing Processes and Threads
24       2-2-1. Processes
25       2-2-2. Threads
26     2-3. [Un]populated Notification
27     2-4. Controlling Controllers
28       2-4-1. Enabling and Disabling
29       2-4-2. Top-down Constraint
30       2-4-3. No Internal Process Constraint
31     2-5. Delegation
32       2-5-1. Model of Delegation
33       2-5-2. Delegation Containment
34     2-6. Guidelines
35       2-6-1. Organize Once and Control
36       2-6-2. Avoid Name Collisions
37   3. Resource Distribution Models
38     3-1. Weights
39     3-2. Limits
40     3-3. Protections
41     3-4. Allocations
42   4. Interface Files
43     4-1. Format
44     4-2. Conventions
45     4-3. Core Interface Files
46   5. Controllers
47     5-1. CPU
48       5-1-1. CPU Interface Files
49     5-2. Memory
50       5-2-1. Memory Interface Files
51       5-2-2. Usage Guidelines
52       5-2-3. Memory Ownership
53     5-3. IO
54       5-3-1. IO Interface Files
55       5-3-2. Writeback
56       5-3-3. IO Latency
57         5-3-3-1. How IO Latency Throttling Works
58         5-3-3-2. IO Latency Interface Files
59       5-3-4. IO Priority
60     5-4. PID
61       5-4-1. PID Interface Files
62     5-5. Cpuset
63       5.5-1. Cpuset Interface Files
64     5-6. Device
65     5-7. RDMA
66       5-7-1. RDMA Interface Files
67     5-8. HugeTLB
68       5.8-1. HugeTLB Interface Files
69     5-9. Misc
70       5.9-1 Miscellaneous cgroup Interface Files
71       5.9-2 Migration and Ownership
72     5-10. Others
73       5-10-1. perf_event
74     5-N. Non-normative information
75       5-N-1. CPU controller root cgroup process behaviour
76       5-N-2. IO controller root cgroup process behaviour
77   6. Namespace
78     6-1. Basics
79     6-2. The Root and Views
80     6-3. Migration and setns(2)
81     6-4. Interaction with Other Namespaces
82   P. Information on Kernel Programming
83     P-1. Filesystem Support for Writeback
84   D. Deprecated v1 Core Features
85   R. Issues with v1 and Rationales for v2
86     R-1. Multiple Hierarchies
87     R-2. Thread Granularity
88     R-3. Competition Between Inner Nodes and Threads
89     R-4. Other Interface Issues
90     R-5. Controller Issues and Remedies
91       R-5-1. Memory
92
93
94Introduction
95============
96
97Terminology
98-----------
99
100"cgroup" stands for "control group" and is never capitalized.  The
101singular form is used to designate the whole feature and also as a
102qualifier as in "cgroup controllers".  When explicitly referring to
103multiple individual control groups, the plural form "cgroups" is used.
104
105
106What is cgroup?
107---------------
108
109cgroup is a mechanism to organize processes hierarchically and
110distribute system resources along the hierarchy in a controlled and
111configurable manner.
112
113cgroup is largely composed of two parts - the core and controllers.
114cgroup core is primarily responsible for hierarchically organizing
115processes.  A cgroup controller is usually responsible for
116distributing a specific type of system resource along the hierarchy
117although there are utility controllers which serve purposes other than
118resource distribution.
119
120cgroups form a tree structure and every process in the system belongs
121to one and only one cgroup.  All threads of a process belong to the
122same cgroup.  On creation, all processes are put in the cgroup that
123the parent process belongs to at the time.  A process can be migrated
124to another cgroup.  Migration of a process doesn't affect already
125existing descendant processes.
126
127Following certain structural constraints, controllers may be enabled or
128disabled selectively on a cgroup.  All controller behaviors are
129hierarchical - if a controller is enabled on a cgroup, it affects all
130processes which belong to the cgroups consisting the inclusive
131sub-hierarchy of the cgroup.  When a controller is enabled on a nested
132cgroup, it always restricts the resource distribution further.  The
133restrictions set closer to the root in the hierarchy can not be
134overridden from further away.
135
136
137Basic Operations
138================
139
140Mounting
141--------
142
143Unlike v1, cgroup v2 has only single hierarchy.  The cgroup v2
144hierarchy can be mounted with the following mount command::
145
146  # mount -t cgroup2 none $MOUNT_POINT
147
148cgroup2 filesystem has the magic number 0x63677270 ("cgrp").  All
149controllers which support v2 and are not bound to a v1 hierarchy are
150automatically bound to the v2 hierarchy and show up at the root.
151Controllers which are not in active use in the v2 hierarchy can be
152bound to other hierarchies.  This allows mixing v2 hierarchy with the
153legacy v1 multiple hierarchies in a fully backward compatible way.
154
155A controller can be moved across hierarchies only after the controller
156is no longer referenced in its current hierarchy.  Because per-cgroup
157controller states are destroyed asynchronously and controllers may
158have lingering references, a controller may not show up immediately on
159the v2 hierarchy after the final umount of the previous hierarchy.
160Similarly, a controller should be fully disabled to be moved out of
161the unified hierarchy and it may take some time for the disabled
162controller to become available for other hierarchies; furthermore, due
163to inter-controller dependencies, other controllers may need to be
164disabled too.
165
166While useful for development and manual configurations, moving
167controllers dynamically between the v2 and other hierarchies is
168strongly discouraged for production use.  It is recommended to decide
169the hierarchies and controller associations before starting using the
170controllers after system boot.
171
172During transition to v2, system management software might still
173automount the v1 cgroup filesystem and so hijack all controllers
174during boot, before manual intervention is possible. To make testing
175and experimenting easier, the kernel parameter cgroup_no_v1= allows
176disabling controllers in v1 and make them always available in v2.
177
178cgroup v2 currently supports the following mount options.
179
180  nsdelegate
181	Consider cgroup namespaces as delegation boundaries.  This
182	option is system wide and can only be set on mount or modified
183	through remount from the init namespace.  The mount option is
184	ignored on non-init namespace mounts.  Please refer to the
185	Delegation section for details.
186
187  favordynmods
188        Reduce the latencies of dynamic cgroup modifications such as
189        task migrations and controller on/offs at the cost of making
190        hot path operations such as forks and exits more expensive.
191        The static usage pattern of creating a cgroup, enabling
192        controllers, and then seeding it with CLONE_INTO_CGROUP is
193        not affected by this option.
194
195  memory_localevents
196        Only populate memory.events with data for the current cgroup,
197        and not any subtrees. This is legacy behaviour, the default
198        behaviour without this option is to include subtree counts.
199        This option is system wide and can only be set on mount or
200        modified through remount from the init namespace. The mount
201        option is ignored on non-init namespace mounts.
202
203  memory_recursiveprot
204        Recursively apply memory.min and memory.low protection to
205        entire subtrees, without requiring explicit downward
206        propagation into leaf cgroups.  This allows protecting entire
207        subtrees from one another, while retaining free competition
208        within those subtrees.  This should have been the default
209        behavior but is a mount-option to avoid regressing setups
210        relying on the original semantics (e.g. specifying bogusly
211        high 'bypass' protection values at higher tree levels).
212
213  memory_hugetlb_accounting
214        Count HugeTLB memory usage towards the cgroup's overall
215        memory usage for the memory controller (for the purpose of
216        statistics reporting and memory protetion). This is a new
217        behavior that could regress existing setups, so it must be
218        explicitly opted in with this mount option.
219
220        A few caveats to keep in mind:
221
222        * There is no HugeTLB pool management involved in the memory
223          controller. The pre-allocated pool does not belong to anyone.
224          Specifically, when a new HugeTLB folio is allocated to
225          the pool, it is not accounted for from the perspective of the
226          memory controller. It is only charged to a cgroup when it is
227          actually used (for e.g at page fault time). Host memory
228          overcommit management has to consider this when configuring
229          hard limits. In general, HugeTLB pool management should be
230          done via other mechanisms (such as the HugeTLB controller).
231        * Failure to charge a HugeTLB folio to the memory controller
232          results in SIGBUS. This could happen even if the HugeTLB pool
233          still has pages available (but the cgroup limit is hit and
234          reclaim attempt fails).
235        * Charging HugeTLB memory towards the memory controller affects
236          memory protection and reclaim dynamics. Any userspace tuning
237          (of low, min limits for e.g) needs to take this into account.
238        * HugeTLB pages utilized while this option is not selected
239          will not be tracked by the memory controller (even if cgroup
240          v2 is remounted later on).
241
242
243Organizing Processes and Threads
244--------------------------------
245
246Processes
247~~~~~~~~~
248
249Initially, only the root cgroup exists to which all processes belong.
250A child cgroup can be created by creating a sub-directory::
251
252  # mkdir $CGROUP_NAME
253
254A given cgroup may have multiple child cgroups forming a tree
255structure.  Each cgroup has a read-writable interface file
256"cgroup.procs".  When read, it lists the PIDs of all processes which
257belong to the cgroup one-per-line.  The PIDs are not ordered and the
258same PID may show up more than once if the process got moved to
259another cgroup and then back or the PID got recycled while reading.
260
261A process can be migrated into a cgroup by writing its PID to the
262target cgroup's "cgroup.procs" file.  Only one process can be migrated
263on a single write(2) call.  If a process is composed of multiple
264threads, writing the PID of any thread migrates all threads of the
265process.
266
267When a process forks a child process, the new process is born into the
268cgroup that the forking process belongs to at the time of the
269operation.  After exit, a process stays associated with the cgroup
270that it belonged to at the time of exit until it's reaped; however, a
271zombie process does not appear in "cgroup.procs" and thus can't be
272moved to another cgroup.
273
274A cgroup which doesn't have any children or live processes can be
275destroyed by removing the directory.  Note that a cgroup which doesn't
276have any children and is associated only with zombie processes is
277considered empty and can be removed::
278
279  # rmdir $CGROUP_NAME
280
281"/proc/$PID/cgroup" lists a process's cgroup membership.  If legacy
282cgroup is in use in the system, this file may contain multiple lines,
283one for each hierarchy.  The entry for cgroup v2 is always in the
284format "0::$PATH"::
285
286  # cat /proc/842/cgroup
287  ...
288  0::/test-cgroup/test-cgroup-nested
289
290If the process becomes a zombie and the cgroup it was associated with
291is removed subsequently, " (deleted)" is appended to the path::
292
293  # cat /proc/842/cgroup
294  ...
295  0::/test-cgroup/test-cgroup-nested (deleted)
296
297
298Threads
299~~~~~~~
300
301cgroup v2 supports thread granularity for a subset of controllers to
302support use cases requiring hierarchical resource distribution across
303the threads of a group of processes.  By default, all threads of a
304process belong to the same cgroup, which also serves as the resource
305domain to host resource consumptions which are not specific to a
306process or thread.  The thread mode allows threads to be spread across
307a subtree while still maintaining the common resource domain for them.
308
309Controllers which support thread mode are called threaded controllers.
310The ones which don't are called domain controllers.
311
312Marking a cgroup threaded makes it join the resource domain of its
313parent as a threaded cgroup.  The parent may be another threaded
314cgroup whose resource domain is further up in the hierarchy.  The root
315of a threaded subtree, that is, the nearest ancestor which is not
316threaded, is called threaded domain or thread root interchangeably and
317serves as the resource domain for the entire subtree.
318
319Inside a threaded subtree, threads of a process can be put in
320different cgroups and are not subject to the no internal process
321constraint - threaded controllers can be enabled on non-leaf cgroups
322whether they have threads in them or not.
323
324As the threaded domain cgroup hosts all the domain resource
325consumptions of the subtree, it is considered to have internal
326resource consumptions whether there are processes in it or not and
327can't have populated child cgroups which aren't threaded.  Because the
328root cgroup is not subject to no internal process constraint, it can
329serve both as a threaded domain and a parent to domain cgroups.
330
331The current operation mode or type of the cgroup is shown in the
332"cgroup.type" file which indicates whether the cgroup is a normal
333domain, a domain which is serving as the domain of a threaded subtree,
334or a threaded cgroup.
335
336On creation, a cgroup is always a domain cgroup and can be made
337threaded by writing "threaded" to the "cgroup.type" file.  The
338operation is single direction::
339
340  # echo threaded > cgroup.type
341
342Once threaded, the cgroup can't be made a domain again.  To enable the
343thread mode, the following conditions must be met.
344
345- As the cgroup will join the parent's resource domain.  The parent
346  must either be a valid (threaded) domain or a threaded cgroup.
347
348- When the parent is an unthreaded domain, it must not have any domain
349  controllers enabled or populated domain children.  The root is
350  exempt from this requirement.
351
352Topology-wise, a cgroup can be in an invalid state.  Please consider
353the following topology::
354
355  A (threaded domain) - B (threaded) - C (domain, just created)
356
357C is created as a domain but isn't connected to a parent which can
358host child domains.  C can't be used until it is turned into a
359threaded cgroup.  "cgroup.type" file will report "domain (invalid)" in
360these cases.  Operations which fail due to invalid topology use
361EOPNOTSUPP as the errno.
362
363A domain cgroup is turned into a threaded domain when one of its child
364cgroup becomes threaded or threaded controllers are enabled in the
365"cgroup.subtree_control" file while there are processes in the cgroup.
366A threaded domain reverts to a normal domain when the conditions
367clear.
368
369When read, "cgroup.threads" contains the list of the thread IDs of all
370threads in the cgroup.  Except that the operations are per-thread
371instead of per-process, "cgroup.threads" has the same format and
372behaves the same way as "cgroup.procs".  While "cgroup.threads" can be
373written to in any cgroup, as it can only move threads inside the same
374threaded domain, its operations are confined inside each threaded
375subtree.
376
377The threaded domain cgroup serves as the resource domain for the whole
378subtree, and, while the threads can be scattered across the subtree,
379all the processes are considered to be in the threaded domain cgroup.
380"cgroup.procs" in a threaded domain cgroup contains the PIDs of all
381processes in the subtree and is not readable in the subtree proper.
382However, "cgroup.procs" can be written to from anywhere in the subtree
383to migrate all threads of the matching process to the cgroup.
384
385Only threaded controllers can be enabled in a threaded subtree.  When
386a threaded controller is enabled inside a threaded subtree, it only
387accounts for and controls resource consumptions associated with the
388threads in the cgroup and its descendants.  All consumptions which
389aren't tied to a specific thread belong to the threaded domain cgroup.
390
391Because a threaded subtree is exempt from no internal process
392constraint, a threaded controller must be able to handle competition
393between threads in a non-leaf cgroup and its child cgroups.  Each
394threaded controller defines how such competitions are handled.
395
396Currently, the following controllers are threaded and can be enabled
397in a threaded cgroup::
398
399- cpu
400- cpuset
401- perf_event
402- pids
403
404[Un]populated Notification
405--------------------------
406
407Each non-root cgroup has a "cgroup.events" file which contains
408"populated" field indicating whether the cgroup's sub-hierarchy has
409live processes in it.  Its value is 0 if there is no live process in
410the cgroup and its descendants; otherwise, 1.  poll and [id]notify
411events are triggered when the value changes.  This can be used, for
412example, to start a clean-up operation after all processes of a given
413sub-hierarchy have exited.  The populated state updates and
414notifications are recursive.  Consider the following sub-hierarchy
415where the numbers in the parentheses represent the numbers of processes
416in each cgroup::
417
418  A(4) - B(0) - C(1)
419              \ D(0)
420
421A, B and C's "populated" fields would be 1 while D's 0.  After the one
422process in C exits, B and C's "populated" fields would flip to "0" and
423file modified events will be generated on the "cgroup.events" files of
424both cgroups.
425
426
427Controlling Controllers
428-----------------------
429
430Enabling and Disabling
431~~~~~~~~~~~~~~~~~~~~~~
432
433Each cgroup has a "cgroup.controllers" file which lists all
434controllers available for the cgroup to enable::
435
436  # cat cgroup.controllers
437  cpu io memory
438
439No controller is enabled by default.  Controllers can be enabled and
440disabled by writing to the "cgroup.subtree_control" file::
441
442  # echo "+cpu +memory -io" > cgroup.subtree_control
443
444Only controllers which are listed in "cgroup.controllers" can be
445enabled.  When multiple operations are specified as above, either they
446all succeed or fail.  If multiple operations on the same controller
447are specified, the last one is effective.
448
449Enabling a controller in a cgroup indicates that the distribution of
450the target resource across its immediate children will be controlled.
451Consider the following sub-hierarchy.  The enabled controllers are
452listed in parentheses::
453
454  A(cpu,memory) - B(memory) - C()
455                            \ D()
456
457As A has "cpu" and "memory" enabled, A will control the distribution
458of CPU cycles and memory to its children, in this case, B.  As B has
459"memory" enabled but not "CPU", C and D will compete freely on CPU
460cycles but their division of memory available to B will be controlled.
461
462As a controller regulates the distribution of the target resource to
463the cgroup's children, enabling it creates the controller's interface
464files in the child cgroups.  In the above example, enabling "cpu" on B
465would create the "cpu." prefixed controller interface files in C and
466D.  Likewise, disabling "memory" from B would remove the "memory."
467prefixed controller interface files from C and D.  This means that the
468controller interface files - anything which doesn't start with
469"cgroup." are owned by the parent rather than the cgroup itself.
470
471
472Top-down Constraint
473~~~~~~~~~~~~~~~~~~~
474
475Resources are distributed top-down and a cgroup can further distribute
476a resource only if the resource has been distributed to it from the
477parent.  This means that all non-root "cgroup.subtree_control" files
478can only contain controllers which are enabled in the parent's
479"cgroup.subtree_control" file.  A controller can be enabled only if
480the parent has the controller enabled and a controller can't be
481disabled if one or more children have it enabled.
482
483
484No Internal Process Constraint
485~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
486
487Non-root cgroups can distribute domain resources to their children
488only when they don't have any processes of their own.  In other words,
489only domain cgroups which don't contain any processes can have domain
490controllers enabled in their "cgroup.subtree_control" files.
491
492This guarantees that, when a domain controller is looking at the part
493of the hierarchy which has it enabled, processes are always only on
494the leaves.  This rules out situations where child cgroups compete
495against internal processes of the parent.
496
497The root cgroup is exempt from this restriction.  Root contains
498processes and anonymous resource consumption which can't be associated
499with any other cgroups and requires special treatment from most
500controllers.  How resource consumption in the root cgroup is governed
501is up to each controller (for more information on this topic please
502refer to the Non-normative information section in the Controllers
503chapter).
504
505Note that the restriction doesn't get in the way if there is no
506enabled controller in the cgroup's "cgroup.subtree_control".  This is
507important as otherwise it wouldn't be possible to create children of a
508populated cgroup.  To control resource distribution of a cgroup, the
509cgroup must create children and transfer all its processes to the
510children before enabling controllers in its "cgroup.subtree_control"
511file.
512
513
514Delegation
515----------
516
517Model of Delegation
518~~~~~~~~~~~~~~~~~~~
519
520A cgroup can be delegated in two ways.  First, to a less privileged
521user by granting write access of the directory and its "cgroup.procs",
522"cgroup.threads" and "cgroup.subtree_control" files to the user.
523Second, if the "nsdelegate" mount option is set, automatically to a
524cgroup namespace on namespace creation.
525
526Because the resource control interface files in a given directory
527control the distribution of the parent's resources, the delegatee
528shouldn't be allowed to write to them.  For the first method, this is
529achieved by not granting access to these files.  For the second, the
530kernel rejects writes to all files other than "cgroup.procs" and
531"cgroup.subtree_control" on a namespace root from inside the
532namespace.
533
534The end results are equivalent for both delegation types.  Once
535delegated, the user can build sub-hierarchy under the directory,
536organize processes inside it as it sees fit and further distribute the
537resources it received from the parent.  The limits and other settings
538of all resource controllers are hierarchical and regardless of what
539happens in the delegated sub-hierarchy, nothing can escape the
540resource restrictions imposed by the parent.
541
542Currently, cgroup doesn't impose any restrictions on the number of
543cgroups in or nesting depth of a delegated sub-hierarchy; however,
544this may be limited explicitly in the future.
545
546
547Delegation Containment
548~~~~~~~~~~~~~~~~~~~~~~
549
550A delegated sub-hierarchy is contained in the sense that processes
551can't be moved into or out of the sub-hierarchy by the delegatee.
552
553For delegations to a less privileged user, this is achieved by
554requiring the following conditions for a process with a non-root euid
555to migrate a target process into a cgroup by writing its PID to the
556"cgroup.procs" file.
557
558- The writer must have write access to the "cgroup.procs" file.
559
560- The writer must have write access to the "cgroup.procs" file of the
561  common ancestor of the source and destination cgroups.
562
563The above two constraints ensure that while a delegatee may migrate
564processes around freely in the delegated sub-hierarchy it can't pull
565in from or push out to outside the sub-hierarchy.
566
567For an example, let's assume cgroups C0 and C1 have been delegated to
568user U0 who created C00, C01 under C0 and C10 under C1 as follows and
569all processes under C0 and C1 belong to U0::
570
571  ~~~~~~~~~~~~~ - C0 - C00
572  ~ cgroup    ~      \ C01
573  ~ hierarchy ~
574  ~~~~~~~~~~~~~ - C1 - C10
575
576Let's also say U0 wants to write the PID of a process which is
577currently in C10 into "C00/cgroup.procs".  U0 has write access to the
578file; however, the common ancestor of the source cgroup C10 and the
579destination cgroup C00 is above the points of delegation and U0 would
580not have write access to its "cgroup.procs" files and thus the write
581will be denied with -EACCES.
582
583For delegations to namespaces, containment is achieved by requiring
584that both the source and destination cgroups are reachable from the
585namespace of the process which is attempting the migration.  If either
586is not reachable, the migration is rejected with -ENOENT.
587
588
589Guidelines
590----------
591
592Organize Once and Control
593~~~~~~~~~~~~~~~~~~~~~~~~~
594
595Migrating a process across cgroups is a relatively expensive operation
596and stateful resources such as memory are not moved together with the
597process.  This is an explicit design decision as there often exist
598inherent trade-offs between migration and various hot paths in terms
599of synchronization cost.
600
601As such, migrating processes across cgroups frequently as a means to
602apply different resource restrictions is discouraged.  A workload
603should be assigned to a cgroup according to the system's logical and
604resource structure once on start-up.  Dynamic adjustments to resource
605distribution can be made by changing controller configuration through
606the interface files.
607
608
609Avoid Name Collisions
610~~~~~~~~~~~~~~~~~~~~~
611
612Interface files for a cgroup and its children cgroups occupy the same
613directory and it is possible to create children cgroups which collide
614with interface files.
615
616All cgroup core interface files are prefixed with "cgroup." and each
617controller's interface files are prefixed with the controller name and
618a dot.  A controller's name is composed of lower case alphabets and
619'_'s but never begins with an '_' so it can be used as the prefix
620character for collision avoidance.  Also, interface file names won't
621start or end with terms which are often used in categorizing workloads
622such as job, service, slice, unit or workload.
623
624cgroup doesn't do anything to prevent name collisions and it's the
625user's responsibility to avoid them.
626
627
628Resource Distribution Models
629============================
630
631cgroup controllers implement several resource distribution schemes
632depending on the resource type and expected use cases.  This section
633describes major schemes in use along with their expected behaviors.
634
635
636Weights
637-------
638
639A parent's resource is distributed by adding up the weights of all
640active children and giving each the fraction matching the ratio of its
641weight against the sum.  As only children which can make use of the
642resource at the moment participate in the distribution, this is
643work-conserving.  Due to the dynamic nature, this model is usually
644used for stateless resources.
645
646All weights are in the range [1, 10000] with the default at 100.  This
647allows symmetric multiplicative biases in both directions at fine
648enough granularity while staying in the intuitive range.
649
650As long as the weight is in range, all configuration combinations are
651valid and there is no reason to reject configuration changes or
652process migrations.
653
654"cpu.weight" proportionally distributes CPU cycles to active children
655and is an example of this type.
656
657
658.. _cgroupv2-limits-distributor:
659
660Limits
661------
662
663A child can only consume up to the configured amount of the resource.
664Limits can be over-committed - the sum of the limits of children can
665exceed the amount of resource available to the parent.
666
667Limits are in the range [0, max] and defaults to "max", which is noop.
668
669As limits can be over-committed, all configuration combinations are
670valid and there is no reason to reject configuration changes or
671process migrations.
672
673"io.max" limits the maximum BPS and/or IOPS that a cgroup can consume
674on an IO device and is an example of this type.
675
676.. _cgroupv2-protections-distributor:
677
678Protections
679-----------
680
681A cgroup is protected up to the configured amount of the resource
682as long as the usages of all its ancestors are under their
683protected levels.  Protections can be hard guarantees or best effort
684soft boundaries.  Protections can also be over-committed in which case
685only up to the amount available to the parent is protected among
686children.
687
688Protections are in the range [0, max] and defaults to 0, which is
689noop.
690
691As protections can be over-committed, all configuration combinations
692are valid and there is no reason to reject configuration changes or
693process migrations.
694
695"memory.low" implements best-effort memory protection and is an
696example of this type.
697
698
699Allocations
700-----------
701
702A cgroup is exclusively allocated a certain amount of a finite
703resource.  Allocations can't be over-committed - the sum of the
704allocations of children can not exceed the amount of resource
705available to the parent.
706
707Allocations are in the range [0, max] and defaults to 0, which is no
708resource.
709
710As allocations can't be over-committed, some configuration
711combinations are invalid and should be rejected.  Also, if the
712resource is mandatory for execution of processes, process migrations
713may be rejected.
714
715"cpu.rt.max" hard-allocates realtime slices and is an example of this
716type.
717
718
719Interface Files
720===============
721
722Format
723------
724
725All interface files should be in one of the following formats whenever
726possible::
727
728  New-line separated values
729  (when only one value can be written at once)
730
731	VAL0\n
732	VAL1\n
733	...
734
735  Space separated values
736  (when read-only or multiple values can be written at once)
737
738	VAL0 VAL1 ...\n
739
740  Flat keyed
741
742	KEY0 VAL0\n
743	KEY1 VAL1\n
744	...
745
746  Nested keyed
747
748	KEY0 SUB_KEY0=VAL00 SUB_KEY1=VAL01...
749	KEY1 SUB_KEY0=VAL10 SUB_KEY1=VAL11...
750	...
751
752For a writable file, the format for writing should generally match
753reading; however, controllers may allow omitting later fields or
754implement restricted shortcuts for most common use cases.
755
756For both flat and nested keyed files, only the values for a single key
757can be written at a time.  For nested keyed files, the sub key pairs
758may be specified in any order and not all pairs have to be specified.
759
760
761Conventions
762-----------
763
764- Settings for a single feature should be contained in a single file.
765
766- The root cgroup should be exempt from resource control and thus
767  shouldn't have resource control interface files.
768
769- The default time unit is microseconds.  If a different unit is ever
770  used, an explicit unit suffix must be present.
771
772- A parts-per quantity should use a percentage decimal with at least
773  two digit fractional part - e.g. 13.40.
774
775- If a controller implements weight based resource distribution, its
776  interface file should be named "weight" and have the range [1,
777  10000] with 100 as the default.  The values are chosen to allow
778  enough and symmetric bias in both directions while keeping it
779  intuitive (the default is 100%).
780
781- If a controller implements an absolute resource guarantee and/or
782  limit, the interface files should be named "min" and "max"
783  respectively.  If a controller implements best effort resource
784  guarantee and/or limit, the interface files should be named "low"
785  and "high" respectively.
786
787  In the above four control files, the special token "max" should be
788  used to represent upward infinity for both reading and writing.
789
790- If a setting has a configurable default value and keyed specific
791  overrides, the default entry should be keyed with "default" and
792  appear as the first entry in the file.
793
794  The default value can be updated by writing either "default $VAL" or
795  "$VAL".
796
797  When writing to update a specific override, "default" can be used as
798  the value to indicate removal of the override.  Override entries
799  with "default" as the value must not appear when read.
800
801  For example, a setting which is keyed by major:minor device numbers
802  with integer values may look like the following::
803
804    # cat cgroup-example-interface-file
805    default 150
806    8:0 300
807
808  The default value can be updated by::
809
810    # echo 125 > cgroup-example-interface-file
811
812  or::
813
814    # echo "default 125" > cgroup-example-interface-file
815
816  An override can be set by::
817
818    # echo "8:16 170" > cgroup-example-interface-file
819
820  and cleared by::
821
822    # echo "8:0 default" > cgroup-example-interface-file
823    # cat cgroup-example-interface-file
824    default 125
825    8:16 170
826
827- For events which are not very high frequency, an interface file
828  "events" should be created which lists event key value pairs.
829  Whenever a notifiable event happens, file modified event should be
830  generated on the file.
831
832
833Core Interface Files
834--------------------
835
836All cgroup core files are prefixed with "cgroup."
837
838  cgroup.type
839	A read-write single value file which exists on non-root
840	cgroups.
841
842	When read, it indicates the current type of the cgroup, which
843	can be one of the following values.
844
845	- "domain" : A normal valid domain cgroup.
846
847	- "domain threaded" : A threaded domain cgroup which is
848          serving as the root of a threaded subtree.
849
850	- "domain invalid" : A cgroup which is in an invalid state.
851	  It can't be populated or have controllers enabled.  It may
852	  be allowed to become a threaded cgroup.
853
854	- "threaded" : A threaded cgroup which is a member of a
855          threaded subtree.
856
857	A cgroup can be turned into a threaded cgroup by writing
858	"threaded" to this file.
859
860  cgroup.procs
861	A read-write new-line separated values file which exists on
862	all cgroups.
863
864	When read, it lists the PIDs of all processes which belong to
865	the cgroup one-per-line.  The PIDs are not ordered and the
866	same PID may show up more than once if the process got moved
867	to another cgroup and then back or the PID got recycled while
868	reading.
869
870	A PID can be written to migrate the process associated with
871	the PID to the cgroup.  The writer should match all of the
872	following conditions.
873
874	- It must have write access to the "cgroup.procs" file.
875
876	- It must have write access to the "cgroup.procs" file of the
877	  common ancestor of the source and destination cgroups.
878
879	When delegating a sub-hierarchy, write access to this file
880	should be granted along with the containing directory.
881
882	In a threaded cgroup, reading this file fails with EOPNOTSUPP
883	as all the processes belong to the thread root.  Writing is
884	supported and moves every thread of the process to the cgroup.
885
886  cgroup.threads
887	A read-write new-line separated values file which exists on
888	all cgroups.
889
890	When read, it lists the TIDs of all threads which belong to
891	the cgroup one-per-line.  The TIDs are not ordered and the
892	same TID may show up more than once if the thread got moved to
893	another cgroup and then back or the TID got recycled while
894	reading.
895
896	A TID can be written to migrate the thread associated with the
897	TID to the cgroup.  The writer should match all of the
898	following conditions.
899
900	- It must have write access to the "cgroup.threads" file.
901
902	- The cgroup that the thread is currently in must be in the
903          same resource domain as the destination cgroup.
904
905	- It must have write access to the "cgroup.procs" file of the
906	  common ancestor of the source and destination cgroups.
907
908	When delegating a sub-hierarchy, write access to this file
909	should be granted along with the containing directory.
910
911  cgroup.controllers
912	A read-only space separated values file which exists on all
913	cgroups.
914
915	It shows space separated list of all controllers available to
916	the cgroup.  The controllers are not ordered.
917
918  cgroup.subtree_control
919	A read-write space separated values file which exists on all
920	cgroups.  Starts out empty.
921
922	When read, it shows space separated list of the controllers
923	which are enabled to control resource distribution from the
924	cgroup to its children.
925
926	Space separated list of controllers prefixed with '+' or '-'
927	can be written to enable or disable controllers.  A controller
928	name prefixed with '+' enables the controller and '-'
929	disables.  If a controller appears more than once on the list,
930	the last one is effective.  When multiple enable and disable
931	operations are specified, either all succeed or all fail.
932
933  cgroup.events
934	A read-only flat-keyed file which exists on non-root cgroups.
935	The following entries are defined.  Unless specified
936	otherwise, a value change in this file generates a file
937	modified event.
938
939	  populated
940		1 if the cgroup or its descendants contains any live
941		processes; otherwise, 0.
942	  frozen
943		1 if the cgroup is frozen; otherwise, 0.
944
945  cgroup.max.descendants
946	A read-write single value files.  The default is "max".
947
948	Maximum allowed number of descent cgroups.
949	If the actual number of descendants is equal or larger,
950	an attempt to create a new cgroup in the hierarchy will fail.
951
952  cgroup.max.depth
953	A read-write single value files.  The default is "max".
954
955	Maximum allowed descent depth below the current cgroup.
956	If the actual descent depth is equal or larger,
957	an attempt to create a new child cgroup will fail.
958
959  cgroup.stat
960	A read-only flat-keyed file with the following entries:
961
962	  nr_descendants
963		Total number of visible descendant cgroups.
964
965	  nr_dying_descendants
966		Total number of dying descendant cgroups. A cgroup becomes
967		dying after being deleted by a user. The cgroup will remain
968		in dying state for some time undefined time (which can depend
969		on system load) before being completely destroyed.
970
971		A process can't enter a dying cgroup under any circumstances,
972		a dying cgroup can't revive.
973
974		A dying cgroup can consume system resources not exceeding
975		limits, which were active at the moment of cgroup deletion.
976
977  cgroup.freeze
978	A read-write single value file which exists on non-root cgroups.
979	Allowed values are "0" and "1". The default is "0".
980
981	Writing "1" to the file causes freezing of the cgroup and all
982	descendant cgroups. This means that all belonging processes will
983	be stopped and will not run until the cgroup will be explicitly
984	unfrozen. Freezing of the cgroup may take some time; when this action
985	is completed, the "frozen" value in the cgroup.events control file
986	will be updated to "1" and the corresponding notification will be
987	issued.
988
989	A cgroup can be frozen either by its own settings, or by settings
990	of any ancestor cgroups. If any of ancestor cgroups is frozen, the
991	cgroup will remain frozen.
992
993	Processes in the frozen cgroup can be killed by a fatal signal.
994	They also can enter and leave a frozen cgroup: either by an explicit
995	move by a user, or if freezing of the cgroup races with fork().
996	If a process is moved to a frozen cgroup, it stops. If a process is
997	moved out of a frozen cgroup, it becomes running.
998
999	Frozen status of a cgroup doesn't affect any cgroup tree operations:
1000	it's possible to delete a frozen (and empty) cgroup, as well as
1001	create new sub-cgroups.
1002
1003  cgroup.kill
1004	A write-only single value file which exists in non-root cgroups.
1005	The only allowed value is "1".
1006
1007	Writing "1" to the file causes the cgroup and all descendant cgroups to
1008	be killed. This means that all processes located in the affected cgroup
1009	tree will be killed via SIGKILL.
1010
1011	Killing a cgroup tree will deal with concurrent forks appropriately and
1012	is protected against migrations.
1013
1014	In a threaded cgroup, writing this file fails with EOPNOTSUPP as
1015	killing cgroups is a process directed operation, i.e. it affects
1016	the whole thread-group.
1017
1018  cgroup.pressure
1019	A read-write single value file that allowed values are "0" and "1".
1020	The default is "1".
1021
1022	Writing "0" to the file will disable the cgroup PSI accounting.
1023	Writing "1" to the file will re-enable the cgroup PSI accounting.
1024
1025	This control attribute is not hierarchical, so disable or enable PSI
1026	accounting in a cgroup does not affect PSI accounting in descendants
1027	and doesn't need pass enablement via ancestors from root.
1028
1029	The reason this control attribute exists is that PSI accounts stalls for
1030	each cgroup separately and aggregates it at each level of the hierarchy.
1031	This may cause non-negligible overhead for some workloads when under
1032	deep level of the hierarchy, in which case this control attribute can
1033	be used to disable PSI accounting in the non-leaf cgroups.
1034
1035  irq.pressure
1036	A read-write nested-keyed file.
1037
1038	Shows pressure stall information for IRQ/SOFTIRQ. See
1039	:ref:`Documentation/accounting/psi.rst <psi>` for details.
1040
1041Controllers
1042===========
1043
1044.. _cgroup-v2-cpu:
1045
1046CPU
1047---
1048
1049The "cpu" controllers regulates distribution of CPU cycles.  This
1050controller implements weight and absolute bandwidth limit models for
1051normal scheduling policy and absolute bandwidth allocation model for
1052realtime scheduling policy.
1053
1054In all the above models, cycles distribution is defined only on a temporal
1055base and it does not account for the frequency at which tasks are executed.
1056The (optional) utilization clamping support allows to hint the schedutil
1057cpufreq governor about the minimum desired frequency which should always be
1058provided by a CPU, as well as the maximum desired frequency, which should not
1059be exceeded by a CPU.
1060
1061WARNING: cgroup2 doesn't yet support control of realtime processes and
1062the cpu controller can only be enabled when all RT processes are in
1063the root cgroup.  Be aware that system management software may already
1064have placed RT processes into nonroot cgroups during the system boot
1065process, and these processes may need to be moved to the root cgroup
1066before the cpu controller can be enabled.
1067
1068
1069CPU Interface Files
1070~~~~~~~~~~~~~~~~~~~
1071
1072All time durations are in microseconds.
1073
1074  cpu.stat
1075	A read-only flat-keyed file.
1076	This file exists whether the controller is enabled or not.
1077
1078	It always reports the following three stats:
1079
1080	- usage_usec
1081	- user_usec
1082	- system_usec
1083
1084	and the following five when the controller is enabled:
1085
1086	- nr_periods
1087	- nr_throttled
1088	- throttled_usec
1089	- nr_bursts
1090	- burst_usec
1091
1092  cpu.weight
1093	A read-write single value file which exists on non-root
1094	cgroups.  The default is "100".
1095
1096	For non idle groups (cpu.idle = 0), the weight is in the
1097	range [1, 10000].
1098
1099	If the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1),
1100	then the weight will show as a 0.
1101
1102  cpu.weight.nice
1103	A read-write single value file which exists on non-root
1104	cgroups.  The default is "0".
1105
1106	The nice value is in the range [-20, 19].
1107
1108	This interface file is an alternative interface for
1109	"cpu.weight" and allows reading and setting weight using the
1110	same values used by nice(2).  Because the range is smaller and
1111	granularity is coarser for the nice values, the read value is
1112	the closest approximation of the current weight.
1113
1114  cpu.max
1115	A read-write two value file which exists on non-root cgroups.
1116	The default is "max 100000".
1117
1118	The maximum bandwidth limit.  It's in the following format::
1119
1120	  $MAX $PERIOD
1121
1122	which indicates that the group may consume up to $MAX in each
1123	$PERIOD duration.  "max" for $MAX indicates no limit.  If only
1124	one number is written, $MAX is updated.
1125
1126  cpu.max.burst
1127	A read-write single value file which exists on non-root
1128	cgroups.  The default is "0".
1129
1130	The burst in the range [0, $MAX].
1131
1132  cpu.pressure
1133	A read-write nested-keyed file.
1134
1135	Shows pressure stall information for CPU. See
1136	:ref:`Documentation/accounting/psi.rst <psi>` for details.
1137
1138  cpu.uclamp.min
1139        A read-write single value file which exists on non-root cgroups.
1140        The default is "0", i.e. no utilization boosting.
1141
1142        The requested minimum utilization (protection) as a percentage
1143        rational number, e.g. 12.34 for 12.34%.
1144
1145        This interface allows reading and setting minimum utilization clamp
1146        values similar to the sched_setattr(2). This minimum utilization
1147        value is used to clamp the task specific minimum utilization clamp.
1148
1149        The requested minimum utilization (protection) is always capped by
1150        the current value for the maximum utilization (limit), i.e.
1151        `cpu.uclamp.max`.
1152
1153  cpu.uclamp.max
1154        A read-write single value file which exists on non-root cgroups.
1155        The default is "max". i.e. no utilization capping
1156
1157        The requested maximum utilization (limit) as a percentage rational
1158        number, e.g. 98.76 for 98.76%.
1159
1160        This interface allows reading and setting maximum utilization clamp
1161        values similar to the sched_setattr(2). This maximum utilization
1162        value is used to clamp the task specific maximum utilization clamp.
1163
1164  cpu.idle
1165	A read-write single value file which exists on non-root cgroups.
1166	The default is 0.
1167
1168	This is the cgroup analog of the per-task SCHED_IDLE sched policy.
1169	Setting this value to a 1 will make the scheduling policy of the
1170	cgroup SCHED_IDLE. The threads inside the cgroup will retain their
1171	own relative priorities, but the cgroup itself will be treated as
1172	very low priority relative to its peers.
1173
1174
1175
1176Memory
1177------
1178
1179The "memory" controller regulates distribution of memory.  Memory is
1180stateful and implements both limit and protection models.  Due to the
1181intertwining between memory usage and reclaim pressure and the
1182stateful nature of memory, the distribution model is relatively
1183complex.
1184
1185While not completely water-tight, all major memory usages by a given
1186cgroup are tracked so that the total memory consumption can be
1187accounted and controlled to a reasonable extent.  Currently, the
1188following types of memory usages are tracked.
1189
1190- Userland memory - page cache and anonymous memory.
1191
1192- Kernel data structures such as dentries and inodes.
1193
1194- TCP socket buffers.
1195
1196The above list may expand in the future for better coverage.
1197
1198
1199Memory Interface Files
1200~~~~~~~~~~~~~~~~~~~~~~
1201
1202All memory amounts are in bytes.  If a value which is not aligned to
1203PAGE_SIZE is written, the value may be rounded up to the closest
1204PAGE_SIZE multiple when read back.
1205
1206  memory.current
1207	A read-only single value file which exists on non-root
1208	cgroups.
1209
1210	The total amount of memory currently being used by the cgroup
1211	and its descendants.
1212
1213  memory.min
1214	A read-write single value file which exists on non-root
1215	cgroups.  The default is "0".
1216
1217	Hard memory protection.  If the memory usage of a cgroup
1218	is within its effective min boundary, the cgroup's memory
1219	won't be reclaimed under any conditions. If there is no
1220	unprotected reclaimable memory available, OOM killer
1221	is invoked. Above the effective min boundary (or
1222	effective low boundary if it is higher), pages are reclaimed
1223	proportionally to the overage, reducing reclaim pressure for
1224	smaller overages.
1225
1226	Effective min boundary is limited by memory.min values of
1227	all ancestor cgroups. If there is memory.min overcommitment
1228	(child cgroup or cgroups are requiring more protected memory
1229	than parent will allow), then each child cgroup will get
1230	the part of parent's protection proportional to its
1231	actual memory usage below memory.min.
1232
1233	Putting more memory than generally available under this
1234	protection is discouraged and may lead to constant OOMs.
1235
1236	If a memory cgroup is not populated with processes,
1237	its memory.min is ignored.
1238
1239  memory.low
1240	A read-write single value file which exists on non-root
1241	cgroups.  The default is "0".
1242
1243	Best-effort memory protection.  If the memory usage of a
1244	cgroup is within its effective low boundary, the cgroup's
1245	memory won't be reclaimed unless there is no reclaimable
1246	memory available in unprotected cgroups.
1247	Above the effective low	boundary (or
1248	effective min boundary if it is higher), pages are reclaimed
1249	proportionally to the overage, reducing reclaim pressure for
1250	smaller overages.
1251
1252	Effective low boundary is limited by memory.low values of
1253	all ancestor cgroups. If there is memory.low overcommitment
1254	(child cgroup or cgroups are requiring more protected memory
1255	than parent will allow), then each child cgroup will get
1256	the part of parent's protection proportional to its
1257	actual memory usage below memory.low.
1258
1259	Putting more memory than generally available under this
1260	protection is discouraged.
1261
1262  memory.high
1263	A read-write single value file which exists on non-root
1264	cgroups.  The default is "max".
1265
1266	Memory usage throttle limit.  If a cgroup's usage goes
1267	over the high boundary, the processes of the cgroup are
1268	throttled and put under heavy reclaim pressure.
1269
1270	Going over the high limit never invokes the OOM killer and
1271	under extreme conditions the limit may be breached. The high
1272	limit should be used in scenarios where an external process
1273	monitors the limited cgroup to alleviate heavy reclaim
1274	pressure.
1275
1276  memory.max
1277	A read-write single value file which exists on non-root
1278	cgroups.  The default is "max".
1279
1280	Memory usage hard limit.  This is the main mechanism to limit
1281	memory usage of a cgroup.  If a cgroup's memory usage reaches
1282	this limit and can't be reduced, the OOM killer is invoked in
1283	the cgroup. Under certain circumstances, the usage may go
1284	over the limit temporarily.
1285
1286	In default configuration regular 0-order allocations always
1287	succeed unless OOM killer chooses current task as a victim.
1288
1289	Some kinds of allocations don't invoke the OOM killer.
1290	Caller could retry them differently, return into userspace
1291	as -ENOMEM or silently ignore in cases like disk readahead.
1292
1293  memory.reclaim
1294	A write-only nested-keyed file which exists for all cgroups.
1295
1296	This is a simple interface to trigger memory reclaim in the
1297	target cgroup.
1298
1299	This file accepts a single key, the number of bytes to reclaim.
1300	No nested keys are currently supported.
1301
1302	Example::
1303
1304	  echo "1G" > memory.reclaim
1305
1306	The interface can be later extended with nested keys to
1307	configure the reclaim behavior. For example, specify the
1308	type of memory to reclaim from (anon, file, ..).
1309
1310	Please note that the kernel can over or under reclaim from
1311	the target cgroup. If less bytes are reclaimed than the
1312	specified amount, -EAGAIN is returned.
1313
1314	Please note that the proactive reclaim (triggered by this
1315	interface) is not meant to indicate memory pressure on the
1316	memory cgroup. Therefore socket memory balancing triggered by
1317	the memory reclaim normally is not exercised in this case.
1318	This means that the networking layer will not adapt based on
1319	reclaim induced by memory.reclaim.
1320
1321  memory.peak
1322	A read-only single value file which exists on non-root
1323	cgroups.
1324
1325	The max memory usage recorded for the cgroup and its
1326	descendants since the creation of the cgroup.
1327
1328  memory.oom.group
1329	A read-write single value file which exists on non-root
1330	cgroups.  The default value is "0".
1331
1332	Determines whether the cgroup should be treated as
1333	an indivisible workload by the OOM killer. If set,
1334	all tasks belonging to the cgroup or to its descendants
1335	(if the memory cgroup is not a leaf cgroup) are killed
1336	together or not at all. This can be used to avoid
1337	partial kills to guarantee workload integrity.
1338
1339	Tasks with the OOM protection (oom_score_adj set to -1000)
1340	are treated as an exception and are never killed.
1341
1342	If the OOM killer is invoked in a cgroup, it's not going
1343	to kill any tasks outside of this cgroup, regardless
1344	memory.oom.group values of ancestor cgroups.
1345
1346  memory.events
1347	A read-only flat-keyed file which exists on non-root cgroups.
1348	The following entries are defined.  Unless specified
1349	otherwise, a value change in this file generates a file
1350	modified event.
1351
1352	Note that all fields in this file are hierarchical and the
1353	file modified event can be generated due to an event down the
1354	hierarchy. For the local events at the cgroup level see
1355	memory.events.local.
1356
1357	  low
1358		The number of times the cgroup is reclaimed due to
1359		high memory pressure even though its usage is under
1360		the low boundary.  This usually indicates that the low
1361		boundary is over-committed.
1362
1363	  high
1364		The number of times processes of the cgroup are
1365		throttled and routed to perform direct memory reclaim
1366		because the high memory boundary was exceeded.  For a
1367		cgroup whose memory usage is capped by the high limit
1368		rather than global memory pressure, this event's
1369		occurrences are expected.
1370
1371	  max
1372		The number of times the cgroup's memory usage was
1373		about to go over the max boundary.  If direct reclaim
1374		fails to bring it down, the cgroup goes to OOM state.
1375
1376	  oom
1377		The number of time the cgroup's memory usage was
1378		reached the limit and allocation was about to fail.
1379
1380		This event is not raised if the OOM killer is not
1381		considered as an option, e.g. for failed high-order
1382		allocations or if caller asked to not retry attempts.
1383
1384	  oom_kill
1385		The number of processes belonging to this cgroup
1386		killed by any kind of OOM killer.
1387
1388          oom_group_kill
1389                The number of times a group OOM has occurred.
1390
1391  memory.events.local
1392	Similar to memory.events but the fields in the file are local
1393	to the cgroup i.e. not hierarchical. The file modified event
1394	generated on this file reflects only the local events.
1395
1396  memory.stat
1397	A read-only flat-keyed file which exists on non-root cgroups.
1398
1399	This breaks down the cgroup's memory footprint into different
1400	types of memory, type-specific details, and other information
1401	on the state and past events of the memory management system.
1402
1403	All memory amounts are in bytes.
1404
1405	The entries are ordered to be human readable, and new entries
1406	can show up in the middle. Don't rely on items remaining in a
1407	fixed position; use the keys to look up specific values!
1408
1409	If the entry has no per-node counter (or not show in the
1410	memory.numa_stat). We use 'npn' (non-per-node) as the tag
1411	to indicate that it will not show in the memory.numa_stat.
1412
1413	  anon
1414		Amount of memory used in anonymous mappings such as
1415		brk(), sbrk(), and mmap(MAP_ANONYMOUS)
1416
1417	  file
1418		Amount of memory used to cache filesystem data,
1419		including tmpfs and shared memory.
1420
1421	  kernel (npn)
1422		Amount of total kernel memory, including
1423		(kernel_stack, pagetables, percpu, vmalloc, slab) in
1424		addition to other kernel memory use cases.
1425
1426	  kernel_stack
1427		Amount of memory allocated to kernel stacks.
1428
1429	  pagetables
1430                Amount of memory allocated for page tables.
1431
1432	  sec_pagetables
1433		Amount of memory allocated for secondary page tables,
1434		this currently includes KVM mmu allocations on x86
1435		and arm64.
1436
1437	  percpu (npn)
1438		Amount of memory used for storing per-cpu kernel
1439		data structures.
1440
1441	  sock (npn)
1442		Amount of memory used in network transmission buffers
1443
1444	  vmalloc (npn)
1445		Amount of memory used for vmap backed memory.
1446
1447	  shmem
1448		Amount of cached filesystem data that is swap-backed,
1449		such as tmpfs, shm segments, shared anonymous mmap()s
1450
1451	  zswap
1452		Amount of memory consumed by the zswap compression backend.
1453
1454	  zswapped
1455		Amount of application memory swapped out to zswap.
1456
1457	  file_mapped
1458		Amount of cached filesystem data mapped with mmap()
1459
1460	  file_dirty
1461		Amount of cached filesystem data that was modified but
1462		not yet written back to disk
1463
1464	  file_writeback
1465		Amount of cached filesystem data that was modified and
1466		is currently being written back to disk
1467
1468	  swapcached
1469		Amount of swap cached in memory. The swapcache is accounted
1470		against both memory and swap usage.
1471
1472	  anon_thp
1473		Amount of memory used in anonymous mappings backed by
1474		transparent hugepages
1475
1476	  file_thp
1477		Amount of cached filesystem data backed by transparent
1478		hugepages
1479
1480	  shmem_thp
1481		Amount of shm, tmpfs, shared anonymous mmap()s backed by
1482		transparent hugepages
1483
1484	  inactive_anon, active_anon, inactive_file, active_file, unevictable
1485		Amount of memory, swap-backed and filesystem-backed,
1486		on the internal memory management lists used by the
1487		page reclaim algorithm.
1488
1489		As these represent internal list state (eg. shmem pages are on anon
1490		memory management lists), inactive_foo + active_foo may not be equal to
1491		the value for the foo counter, since the foo counter is type-based, not
1492		list-based.
1493
1494	  slab_reclaimable
1495		Part of "slab" that might be reclaimed, such as
1496		dentries and inodes.
1497
1498	  slab_unreclaimable
1499		Part of "slab" that cannot be reclaimed on memory
1500		pressure.
1501
1502	  slab (npn)
1503		Amount of memory used for storing in-kernel data
1504		structures.
1505
1506	  workingset_refault_anon
1507		Number of refaults of previously evicted anonymous pages.
1508
1509	  workingset_refault_file
1510		Number of refaults of previously evicted file pages.
1511
1512	  workingset_activate_anon
1513		Number of refaulted anonymous pages that were immediately
1514		activated.
1515
1516	  workingset_activate_file
1517		Number of refaulted file pages that were immediately activated.
1518
1519	  workingset_restore_anon
1520		Number of restored anonymous pages which have been detected as
1521		an active workingset before they got reclaimed.
1522
1523	  workingset_restore_file
1524		Number of restored file pages which have been detected as an
1525		active workingset before they got reclaimed.
1526
1527	  workingset_nodereclaim
1528		Number of times a shadow node has been reclaimed
1529
1530	  pgscan (npn)
1531		Amount of scanned pages (in an inactive LRU list)
1532
1533	  pgsteal (npn)
1534		Amount of reclaimed pages
1535
1536	  pgscan_kswapd (npn)
1537		Amount of scanned pages by kswapd (in an inactive LRU list)
1538
1539	  pgscan_direct (npn)
1540		Amount of scanned pages directly  (in an inactive LRU list)
1541
1542	  pgscan_khugepaged (npn)
1543		Amount of scanned pages by khugepaged  (in an inactive LRU list)
1544
1545	  pgsteal_kswapd (npn)
1546		Amount of reclaimed pages by kswapd
1547
1548	  pgsteal_direct (npn)
1549		Amount of reclaimed pages directly
1550
1551	  pgsteal_khugepaged (npn)
1552		Amount of reclaimed pages by khugepaged
1553
1554	  pgfault (npn)
1555		Total number of page faults incurred
1556
1557	  pgmajfault (npn)
1558		Number of major page faults incurred
1559
1560	  pgrefill (npn)
1561		Amount of scanned pages (in an active LRU list)
1562
1563	  pgactivate (npn)
1564		Amount of pages moved to the active LRU list
1565
1566	  pgdeactivate (npn)
1567		Amount of pages moved to the inactive LRU list
1568
1569	  pglazyfree (npn)
1570		Amount of pages postponed to be freed under memory pressure
1571
1572	  pglazyfreed (npn)
1573		Amount of reclaimed lazyfree pages
1574
1575	  thp_fault_alloc (npn)
1576		Number of transparent hugepages which were allocated to satisfy
1577		a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE
1578                is not set.
1579
1580	  thp_collapse_alloc (npn)
1581		Number of transparent hugepages which were allocated to allow
1582		collapsing an existing range of pages. This counter is not
1583		present when CONFIG_TRANSPARENT_HUGEPAGE is not set.
1584
1585	  thp_swpout (npn)
1586		Number of transparent hugepages which are swapout in one piece
1587		without splitting.
1588
1589	  thp_swpout_fallback (npn)
1590		Number of transparent hugepages which were split before swapout.
1591		Usually because failed to allocate some continuous swap space
1592		for the huge page.
1593
1594  memory.numa_stat
1595	A read-only nested-keyed file which exists on non-root cgroups.
1596
1597	This breaks down the cgroup's memory footprint into different
1598	types of memory, type-specific details, and other information
1599	per node on the state of the memory management system.
1600
1601	This is useful for providing visibility into the NUMA locality
1602	information within an memcg since the pages are allowed to be
1603	allocated from any physical node. One of the use case is evaluating
1604	application performance by combining this information with the
1605	application's CPU allocation.
1606
1607	All memory amounts are in bytes.
1608
1609	The output format of memory.numa_stat is::
1610
1611	  type N0=<bytes in node 0> N1=<bytes in node 1> ...
1612
1613	The entries are ordered to be human readable, and new entries
1614	can show up in the middle. Don't rely on items remaining in a
1615	fixed position; use the keys to look up specific values!
1616
1617	The entries can refer to the memory.stat.
1618
1619  memory.swap.current
1620	A read-only single value file which exists on non-root
1621	cgroups.
1622
1623	The total amount of swap currently being used by the cgroup
1624	and its descendants.
1625
1626  memory.swap.high
1627	A read-write single value file which exists on non-root
1628	cgroups.  The default is "max".
1629
1630	Swap usage throttle limit.  If a cgroup's swap usage exceeds
1631	this limit, all its further allocations will be throttled to
1632	allow userspace to implement custom out-of-memory procedures.
1633
1634	This limit marks a point of no return for the cgroup. It is NOT
1635	designed to manage the amount of swapping a workload does
1636	during regular operation. Compare to memory.swap.max, which
1637	prohibits swapping past a set amount, but lets the cgroup
1638	continue unimpeded as long as other memory can be reclaimed.
1639
1640	Healthy workloads are not expected to reach this limit.
1641
1642  memory.swap.peak
1643	A read-only single value file which exists on non-root
1644	cgroups.
1645
1646	The max swap usage recorded for the cgroup and its
1647	descendants since the creation of the cgroup.
1648
1649  memory.swap.max
1650	A read-write single value file which exists on non-root
1651	cgroups.  The default is "max".
1652
1653	Swap usage hard limit.  If a cgroup's swap usage reaches this
1654	limit, anonymous memory of the cgroup will not be swapped out.
1655
1656  memory.swap.events
1657	A read-only flat-keyed file which exists on non-root cgroups.
1658	The following entries are defined.  Unless specified
1659	otherwise, a value change in this file generates a file
1660	modified event.
1661
1662	  high
1663		The number of times the cgroup's swap usage was over
1664		the high threshold.
1665
1666	  max
1667		The number of times the cgroup's swap usage was about
1668		to go over the max boundary and swap allocation
1669		failed.
1670
1671	  fail
1672		The number of times swap allocation failed either
1673		because of running out of swap system-wide or max
1674		limit.
1675
1676	When reduced under the current usage, the existing swap
1677	entries are reclaimed gradually and the swap usage may stay
1678	higher than the limit for an extended period of time.  This
1679	reduces the impact on the workload and memory management.
1680
1681  memory.zswap.current
1682	A read-only single value file which exists on non-root
1683	cgroups.
1684
1685	The total amount of memory consumed by the zswap compression
1686	backend.
1687
1688  memory.zswap.max
1689	A read-write single value file which exists on non-root
1690	cgroups.  The default is "max".
1691
1692	Zswap usage hard limit. If a cgroup's zswap pool reaches this
1693	limit, it will refuse to take any more stores before existing
1694	entries fault back in or are written out to disk.
1695
1696  memory.zswap.writeback
1697	A read-write single value file. The default value is "1". The
1698	initial value of the root cgroup is 1, and when a new cgroup is
1699	created, it inherits the current value of its parent.
1700
1701	When this is set to 0, all swapping attempts to swapping devices
1702	are disabled. This included both zswap writebacks, and swapping due
1703	to zswap store failures. If the zswap store failures are recurring
1704	(for e.g if the pages are incompressible), users can observe
1705	reclaim inefficiency after disabling writeback (because the same
1706	pages might be rejected again and again).
1707
1708	Note that this is subtly different from setting memory.swap.max to
1709	0, as it still allows for pages to be written to the zswap pool.
1710
1711  memory.pressure
1712	A read-only nested-keyed file.
1713
1714	Shows pressure stall information for memory. See
1715	:ref:`Documentation/accounting/psi.rst <psi>` for details.
1716
1717
1718Usage Guidelines
1719~~~~~~~~~~~~~~~~
1720
1721"memory.high" is the main mechanism to control memory usage.
1722Over-committing on high limit (sum of high limits > available memory)
1723and letting global memory pressure to distribute memory according to
1724usage is a viable strategy.
1725
1726Because breach of the high limit doesn't trigger the OOM killer but
1727throttles the offending cgroup, a management agent has ample
1728opportunities to monitor and take appropriate actions such as granting
1729more memory or terminating the workload.
1730
1731Determining whether a cgroup has enough memory is not trivial as
1732memory usage doesn't indicate whether the workload can benefit from
1733more memory.  For example, a workload which writes data received from
1734network to a file can use all available memory but can also operate as
1735performant with a small amount of memory.  A measure of memory
1736pressure - how much the workload is being impacted due to lack of
1737memory - is necessary to determine whether a workload needs more
1738memory; unfortunately, memory pressure monitoring mechanism isn't
1739implemented yet.
1740
1741
1742Memory Ownership
1743~~~~~~~~~~~~~~~~
1744
1745A memory area is charged to the cgroup which instantiated it and stays
1746charged to the cgroup until the area is released.  Migrating a process
1747to a different cgroup doesn't move the memory usages that it
1748instantiated while in the previous cgroup to the new cgroup.
1749
1750A memory area may be used by processes belonging to different cgroups.
1751To which cgroup the area will be charged is in-deterministic; however,
1752over time, the memory area is likely to end up in a cgroup which has
1753enough memory allowance to avoid high reclaim pressure.
1754
1755If a cgroup sweeps a considerable amount of memory which is expected
1756to be accessed repeatedly by other cgroups, it may make sense to use
1757POSIX_FADV_DONTNEED to relinquish the ownership of memory areas
1758belonging to the affected files to ensure correct memory ownership.
1759
1760
1761IO
1762--
1763
1764The "io" controller regulates the distribution of IO resources.  This
1765controller implements both weight based and absolute bandwidth or IOPS
1766limit distribution; however, weight based distribution is available
1767only if cfq-iosched is in use and neither scheme is available for
1768blk-mq devices.
1769
1770
1771IO Interface Files
1772~~~~~~~~~~~~~~~~~~
1773
1774  io.stat
1775	A read-only nested-keyed file.
1776
1777	Lines are keyed by $MAJ:$MIN device numbers and not ordered.
1778	The following nested keys are defined.
1779
1780	  ======	=====================
1781	  rbytes	Bytes read
1782	  wbytes	Bytes written
1783	  rios		Number of read IOs
1784	  wios		Number of write IOs
1785	  dbytes	Bytes discarded
1786	  dios		Number of discard IOs
1787	  ======	=====================
1788
1789	An example read output follows::
1790
1791	  8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0
1792	  8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021
1793
1794  io.cost.qos
1795	A read-write nested-keyed file which exists only on the root
1796	cgroup.
1797
1798	This file configures the Quality of Service of the IO cost
1799	model based controller (CONFIG_BLK_CGROUP_IOCOST) which
1800	currently implements "io.weight" proportional control.  Lines
1801	are keyed by $MAJ:$MIN device numbers and not ordered.  The
1802	line for a given device is populated on the first write for
1803	the device on "io.cost.qos" or "io.cost.model".  The following
1804	nested keys are defined.
1805
1806	  ======	=====================================
1807	  enable	Weight-based control enable
1808	  ctrl		"auto" or "user"
1809	  rpct		Read latency percentile    [0, 100]
1810	  rlat		Read latency threshold
1811	  wpct		Write latency percentile   [0, 100]
1812	  wlat		Write latency threshold
1813	  min		Minimum scaling percentage [1, 10000]
1814	  max		Maximum scaling percentage [1, 10000]
1815	  ======	=====================================
1816
1817	The controller is disabled by default and can be enabled by
1818	setting "enable" to 1.  "rpct" and "wpct" parameters default
1819	to zero and the controller uses internal device saturation
1820	state to adjust the overall IO rate between "min" and "max".
1821
1822	When a better control quality is needed, latency QoS
1823	parameters can be configured.  For example::
1824
1825	  8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0
1826
1827	shows that on sdb, the controller is enabled, will consider
1828	the device saturated if the 95th percentile of read completion
1829	latencies is above 75ms or write 150ms, and adjust the overall
1830	IO issue rate between 50% and 150% accordingly.
1831
1832	The lower the saturation point, the better the latency QoS at
1833	the cost of aggregate bandwidth.  The narrower the allowed
1834	adjustment range between "min" and "max", the more conformant
1835	to the cost model the IO behavior.  Note that the IO issue
1836	base rate may be far off from 100% and setting "min" and "max"
1837	blindly can lead to a significant loss of device capacity or
1838	control quality.  "min" and "max" are useful for regulating
1839	devices which show wide temporary behavior changes - e.g. a
1840	ssd which accepts writes at the line speed for a while and
1841	then completely stalls for multiple seconds.
1842
1843	When "ctrl" is "auto", the parameters are controlled by the
1844	kernel and may change automatically.  Setting "ctrl" to "user"
1845	or setting any of the percentile and latency parameters puts
1846	it into "user" mode and disables the automatic changes.  The
1847	automatic mode can be restored by setting "ctrl" to "auto".
1848
1849  io.cost.model
1850	A read-write nested-keyed file which exists only on the root
1851	cgroup.
1852
1853	This file configures the cost model of the IO cost model based
1854	controller (CONFIG_BLK_CGROUP_IOCOST) which currently
1855	implements "io.weight" proportional control.  Lines are keyed
1856	by $MAJ:$MIN device numbers and not ordered.  The line for a
1857	given device is populated on the first write for the device on
1858	"io.cost.qos" or "io.cost.model".  The following nested keys
1859	are defined.
1860
1861	  =====		================================
1862	  ctrl		"auto" or "user"
1863	  model		The cost model in use - "linear"
1864	  =====		================================
1865
1866	When "ctrl" is "auto", the kernel may change all parameters
1867	dynamically.  When "ctrl" is set to "user" or any other
1868	parameters are written to, "ctrl" become "user" and the
1869	automatic changes are disabled.
1870
1871	When "model" is "linear", the following model parameters are
1872	defined.
1873
1874	  =============	========================================
1875	  [r|w]bps	The maximum sequential IO throughput
1876	  [r|w]seqiops	The maximum 4k sequential IOs per second
1877	  [r|w]randiops	The maximum 4k random IOs per second
1878	  =============	========================================
1879
1880	From the above, the builtin linear model determines the base
1881	costs of a sequential and random IO and the cost coefficient
1882	for the IO size.  While simple, this model can cover most
1883	common device classes acceptably.
1884
1885	The IO cost model isn't expected to be accurate in absolute
1886	sense and is scaled to the device behavior dynamically.
1887
1888	If needed, tools/cgroup/iocost_coef_gen.py can be used to
1889	generate device-specific coefficients.
1890
1891  io.weight
1892	A read-write flat-keyed file which exists on non-root cgroups.
1893	The default is "default 100".
1894
1895	The first line is the default weight applied to devices
1896	without specific override.  The rest are overrides keyed by
1897	$MAJ:$MIN device numbers and not ordered.  The weights are in
1898	the range [1, 10000] and specifies the relative amount IO time
1899	the cgroup can use in relation to its siblings.
1900
1901	The default weight can be updated by writing either "default
1902	$WEIGHT" or simply "$WEIGHT".  Overrides can be set by writing
1903	"$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default".
1904
1905	An example read output follows::
1906
1907	  default 100
1908	  8:16 200
1909	  8:0 50
1910
1911  io.max
1912	A read-write nested-keyed file which exists on non-root
1913	cgroups.
1914
1915	BPS and IOPS based IO limit.  Lines are keyed by $MAJ:$MIN
1916	device numbers and not ordered.  The following nested keys are
1917	defined.
1918
1919	  =====		==================================
1920	  rbps		Max read bytes per second
1921	  wbps		Max write bytes per second
1922	  riops		Max read IO operations per second
1923	  wiops		Max write IO operations per second
1924	  =====		==================================
1925
1926	When writing, any number of nested key-value pairs can be
1927	specified in any order.  "max" can be specified as the value
1928	to remove a specific limit.  If the same key is specified
1929	multiple times, the outcome is undefined.
1930
1931	BPS and IOPS are measured in each IO direction and IOs are
1932	delayed if limit is reached.  Temporary bursts are allowed.
1933
1934	Setting read limit at 2M BPS and write at 120 IOPS for 8:16::
1935
1936	  echo "8:16 rbps=2097152 wiops=120" > io.max
1937
1938	Reading returns the following::
1939
1940	  8:16 rbps=2097152 wbps=max riops=max wiops=120
1941
1942	Write IOPS limit can be removed by writing the following::
1943
1944	  echo "8:16 wiops=max" > io.max
1945
1946	Reading now returns the following::
1947
1948	  8:16 rbps=2097152 wbps=max riops=max wiops=max
1949
1950  io.pressure
1951	A read-only nested-keyed file.
1952
1953	Shows pressure stall information for IO. See
1954	:ref:`Documentation/accounting/psi.rst <psi>` for details.
1955
1956
1957Writeback
1958~~~~~~~~~
1959
1960Page cache is dirtied through buffered writes and shared mmaps and
1961written asynchronously to the backing filesystem by the writeback
1962mechanism.  Writeback sits between the memory and IO domains and
1963regulates the proportion of dirty memory by balancing dirtying and
1964write IOs.
1965
1966The io controller, in conjunction with the memory controller,
1967implements control of page cache writeback IOs.  The memory controller
1968defines the memory domain that dirty memory ratio is calculated and
1969maintained for and the io controller defines the io domain which
1970writes out dirty pages for the memory domain.  Both system-wide and
1971per-cgroup dirty memory states are examined and the more restrictive
1972of the two is enforced.
1973
1974cgroup writeback requires explicit support from the underlying
1975filesystem.  Currently, cgroup writeback is implemented on ext2, ext4,
1976btrfs, f2fs, and xfs.  On other filesystems, all writeback IOs are
1977attributed to the root cgroup.
1978
1979There are inherent differences in memory and writeback management
1980which affects how cgroup ownership is tracked.  Memory is tracked per
1981page while writeback per inode.  For the purpose of writeback, an
1982inode is assigned to a cgroup and all IO requests to write dirty pages
1983from the inode are attributed to that cgroup.
1984
1985As cgroup ownership for memory is tracked per page, there can be pages
1986which are associated with different cgroups than the one the inode is
1987associated with.  These are called foreign pages.  The writeback
1988constantly keeps track of foreign pages and, if a particular foreign
1989cgroup becomes the majority over a certain period of time, switches
1990the ownership of the inode to that cgroup.
1991
1992While this model is enough for most use cases where a given inode is
1993mostly dirtied by a single cgroup even when the main writing cgroup
1994changes over time, use cases where multiple cgroups write to a single
1995inode simultaneously are not supported well.  In such circumstances, a
1996significant portion of IOs are likely to be attributed incorrectly.
1997As memory controller assigns page ownership on the first use and
1998doesn't update it until the page is released, even if writeback
1999strictly follows page ownership, multiple cgroups dirtying overlapping
2000areas wouldn't work as expected.  It's recommended to avoid such usage
2001patterns.
2002
2003The sysctl knobs which affect writeback behavior are applied to cgroup
2004writeback as follows.
2005
2006  vm.dirty_background_ratio, vm.dirty_ratio
2007	These ratios apply the same to cgroup writeback with the
2008	amount of available memory capped by limits imposed by the
2009	memory controller and system-wide clean memory.
2010
2011  vm.dirty_background_bytes, vm.dirty_bytes
2012	For cgroup writeback, this is calculated into ratio against
2013	total available memory and applied the same way as
2014	vm.dirty[_background]_ratio.
2015
2016
2017IO Latency
2018~~~~~~~~~~
2019
2020This is a cgroup v2 controller for IO workload protection.  You provide a group
2021with a latency target, and if the average latency exceeds that target the
2022controller will throttle any peers that have a lower latency target than the
2023protected workload.
2024
2025The limits are only applied at the peer level in the hierarchy.  This means that
2026in the diagram below, only groups A, B, and C will influence each other, and
2027groups D and F will influence each other.  Group G will influence nobody::
2028
2029			[root]
2030		/	   |		\
2031		A	   B		C
2032	       /  \        |
2033	      D    F	   G
2034
2035
2036So the ideal way to configure this is to set io.latency in groups A, B, and C.
2037Generally you do not want to set a value lower than the latency your device
2038supports.  Experiment to find the value that works best for your workload.
2039Start at higher than the expected latency for your device and watch the
2040avg_lat value in io.stat for your workload group to get an idea of the
2041latency you see during normal operation.  Use the avg_lat value as a basis for
2042your real setting, setting at 10-15% higher than the value in io.stat.
2043
2044How IO Latency Throttling Works
2045~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2046
2047io.latency is work conserving; so as long as everybody is meeting their latency
2048target the controller doesn't do anything.  Once a group starts missing its
2049target it begins throttling any peer group that has a higher target than itself.
2050This throttling takes 2 forms:
2051
2052- Queue depth throttling.  This is the number of outstanding IO's a group is
2053  allowed to have.  We will clamp down relatively quickly, starting at no limit
2054  and going all the way down to 1 IO at a time.
2055
2056- Artificial delay induction.  There are certain types of IO that cannot be
2057  throttled without possibly adversely affecting higher priority groups.  This
2058  includes swapping and metadata IO.  These types of IO are allowed to occur
2059  normally, however they are "charged" to the originating group.  If the
2060  originating group is being throttled you will see the use_delay and delay
2061  fields in io.stat increase.  The delay value is how many microseconds that are
2062  being added to any process that runs in this group.  Because this number can
2063  grow quite large if there is a lot of swapping or metadata IO occurring we
2064  limit the individual delay events to 1 second at a time.
2065
2066Once the victimized group starts meeting its latency target again it will start
2067unthrottling any peer groups that were throttled previously.  If the victimized
2068group simply stops doing IO the global counter will unthrottle appropriately.
2069
2070IO Latency Interface Files
2071~~~~~~~~~~~~~~~~~~~~~~~~~~
2072
2073  io.latency
2074	This takes a similar format as the other controllers.
2075
2076		"MAJOR:MINOR target=<target time in microseconds>"
2077
2078  io.stat
2079	If the controller is enabled you will see extra stats in io.stat in
2080	addition to the normal ones.
2081
2082	  depth
2083		This is the current queue depth for the group.
2084
2085	  avg_lat
2086		This is an exponential moving average with a decay rate of 1/exp
2087		bound by the sampling interval.  The decay rate interval can be
2088		calculated by multiplying the win value in io.stat by the
2089		corresponding number of samples based on the win value.
2090
2091	  win
2092		The sampling window size in milliseconds.  This is the minimum
2093		duration of time between evaluation events.  Windows only elapse
2094		with IO activity.  Idle periods extend the most recent window.
2095
2096IO Priority
2097~~~~~~~~~~~
2098
2099A single attribute controls the behavior of the I/O priority cgroup policy,
2100namely the io.prio.class attribute. The following values are accepted for
2101that attribute:
2102
2103  no-change
2104	Do not modify the I/O priority class.
2105
2106  promote-to-rt
2107	For requests that have a non-RT I/O priority class, change it into RT.
2108	Also change the priority level of these requests to 4. Do not modify
2109	the I/O priority of requests that have priority class RT.
2110
2111  restrict-to-be
2112	For requests that do not have an I/O priority class or that have I/O
2113	priority class RT, change it into BE. Also change the priority level
2114	of these requests to 0. Do not modify the I/O priority class of
2115	requests that have priority class IDLE.
2116
2117  idle
2118	Change the I/O priority class of all requests into IDLE, the lowest
2119	I/O priority class.
2120
2121  none-to-rt
2122	Deprecated. Just an alias for promote-to-rt.
2123
2124The following numerical values are associated with the I/O priority policies:
2125
2126+----------------+---+
2127| no-change      | 0 |
2128+----------------+---+
2129| promote-to-rt  | 1 |
2130+----------------+---+
2131| restrict-to-be | 2 |
2132+----------------+---+
2133| idle           | 3 |
2134+----------------+---+
2135
2136The numerical value that corresponds to each I/O priority class is as follows:
2137
2138+-------------------------------+---+
2139| IOPRIO_CLASS_NONE             | 0 |
2140+-------------------------------+---+
2141| IOPRIO_CLASS_RT (real-time)   | 1 |
2142+-------------------------------+---+
2143| IOPRIO_CLASS_BE (best effort) | 2 |
2144+-------------------------------+---+
2145| IOPRIO_CLASS_IDLE             | 3 |
2146+-------------------------------+---+
2147
2148The algorithm to set the I/O priority class for a request is as follows:
2149
2150- If I/O priority class policy is promote-to-rt, change the request I/O
2151  priority class to IOPRIO_CLASS_RT and change the request I/O priority
2152  level to 4.
2153- If I/O priority class policy is not promote-to-rt, translate the I/O priority
2154  class policy into a number, then change the request I/O priority class
2155  into the maximum of the I/O priority class policy number and the numerical
2156  I/O priority class.
2157
2158PID
2159---
2160
2161The process number controller is used to allow a cgroup to stop any
2162new tasks from being fork()'d or clone()'d after a specified limit is
2163reached.
2164
2165The number of tasks in a cgroup can be exhausted in ways which other
2166controllers cannot prevent, thus warranting its own controller.  For
2167example, a fork bomb is likely to exhaust the number of tasks before
2168hitting memory restrictions.
2169
2170Note that PIDs used in this controller refer to TIDs, process IDs as
2171used by the kernel.
2172
2173
2174PID Interface Files
2175~~~~~~~~~~~~~~~~~~~
2176
2177  pids.max
2178	A read-write single value file which exists on non-root
2179	cgroups.  The default is "max".
2180
2181	Hard limit of number of processes.
2182
2183  pids.current
2184	A read-only single value file which exists on all cgroups.
2185
2186	The number of processes currently in the cgroup and its
2187	descendants.
2188
2189Organisational operations are not blocked by cgroup policies, so it is
2190possible to have pids.current > pids.max.  This can be done by either
2191setting the limit to be smaller than pids.current, or attaching enough
2192processes to the cgroup such that pids.current is larger than
2193pids.max.  However, it is not possible to violate a cgroup PID policy
2194through fork() or clone(). These will return -EAGAIN if the creation
2195of a new process would cause a cgroup policy to be violated.
2196
2197
2198Cpuset
2199------
2200
2201The "cpuset" controller provides a mechanism for constraining
2202the CPU and memory node placement of tasks to only the resources
2203specified in the cpuset interface files in a task's current cgroup.
2204This is especially valuable on large NUMA systems where placing jobs
2205on properly sized subsets of the systems with careful processor and
2206memory placement to reduce cross-node memory access and contention
2207can improve overall system performance.
2208
2209The "cpuset" controller is hierarchical.  That means the controller
2210cannot use CPUs or memory nodes not allowed in its parent.
2211
2212
2213Cpuset Interface Files
2214~~~~~~~~~~~~~~~~~~~~~~
2215
2216  cpuset.cpus
2217	A read-write multiple values file which exists on non-root
2218	cpuset-enabled cgroups.
2219
2220	It lists the requested CPUs to be used by tasks within this
2221	cgroup.  The actual list of CPUs to be granted, however, is
2222	subjected to constraints imposed by its parent and can differ
2223	from the requested CPUs.
2224
2225	The CPU numbers are comma-separated numbers or ranges.
2226	For example::
2227
2228	  # cat cpuset.cpus
2229	  0-4,6,8-10
2230
2231	An empty value indicates that the cgroup is using the same
2232	setting as the nearest cgroup ancestor with a non-empty
2233	"cpuset.cpus" or all the available CPUs if none is found.
2234
2235	The value of "cpuset.cpus" stays constant until the next update
2236	and won't be affected by any CPU hotplug events.
2237
2238  cpuset.cpus.effective
2239	A read-only multiple values file which exists on all
2240	cpuset-enabled cgroups.
2241
2242	It lists the onlined CPUs that are actually granted to this
2243	cgroup by its parent.  These CPUs are allowed to be used by
2244	tasks within the current cgroup.
2245
2246	If "cpuset.cpus" is empty, the "cpuset.cpus.effective" file shows
2247	all the CPUs from the parent cgroup that can be available to
2248	be used by this cgroup.  Otherwise, it should be a subset of
2249	"cpuset.cpus" unless none of the CPUs listed in "cpuset.cpus"
2250	can be granted.  In this case, it will be treated just like an
2251	empty "cpuset.cpus".
2252
2253	Its value will be affected by CPU hotplug events.
2254
2255  cpuset.mems
2256	A read-write multiple values file which exists on non-root
2257	cpuset-enabled cgroups.
2258
2259	It lists the requested memory nodes to be used by tasks within
2260	this cgroup.  The actual list of memory nodes granted, however,
2261	is subjected to constraints imposed by its parent and can differ
2262	from the requested memory nodes.
2263
2264	The memory node numbers are comma-separated numbers or ranges.
2265	For example::
2266
2267	  # cat cpuset.mems
2268	  0-1,3
2269
2270	An empty value indicates that the cgroup is using the same
2271	setting as the nearest cgroup ancestor with a non-empty
2272	"cpuset.mems" or all the available memory nodes if none
2273	is found.
2274
2275	The value of "cpuset.mems" stays constant until the next update
2276	and won't be affected by any memory nodes hotplug events.
2277
2278	Setting a non-empty value to "cpuset.mems" causes memory of
2279	tasks within the cgroup to be migrated to the designated nodes if
2280	they are currently using memory outside of the designated nodes.
2281
2282	There is a cost for this memory migration.  The migration
2283	may not be complete and some memory pages may be left behind.
2284	So it is recommended that "cpuset.mems" should be set properly
2285	before spawning new tasks into the cpuset.  Even if there is
2286	a need to change "cpuset.mems" with active tasks, it shouldn't
2287	be done frequently.
2288
2289  cpuset.mems.effective
2290	A read-only multiple values file which exists on all
2291	cpuset-enabled cgroups.
2292
2293	It lists the onlined memory nodes that are actually granted to
2294	this cgroup by its parent. These memory nodes are allowed to
2295	be used by tasks within the current cgroup.
2296
2297	If "cpuset.mems" is empty, it shows all the memory nodes from the
2298	parent cgroup that will be available to be used by this cgroup.
2299	Otherwise, it should be a subset of "cpuset.mems" unless none of
2300	the memory nodes listed in "cpuset.mems" can be granted.  In this
2301	case, it will be treated just like an empty "cpuset.mems".
2302
2303	Its value will be affected by memory nodes hotplug events.
2304
2305  cpuset.cpus.exclusive
2306	A read-write multiple values file which exists on non-root
2307	cpuset-enabled cgroups.
2308
2309	It lists all the exclusive CPUs that are allowed to be used
2310	to create a new cpuset partition.  Its value is not used
2311	unless the cgroup becomes a valid partition root.  See the
2312	"cpuset.cpus.partition" section below for a description of what
2313	a cpuset partition is.
2314
2315	When the cgroup becomes a partition root, the actual exclusive
2316	CPUs that are allocated to that partition are listed in
2317	"cpuset.cpus.exclusive.effective" which may be different
2318	from "cpuset.cpus.exclusive".  If "cpuset.cpus.exclusive"
2319	has previously been set, "cpuset.cpus.exclusive.effective"
2320	is always a subset of it.
2321
2322	Users can manually set it to a value that is different from
2323	"cpuset.cpus".	The only constraint in setting it is that the
2324	list of CPUs must be exclusive with respect to its sibling.
2325
2326	For a parent cgroup, any one of its exclusive CPUs can only
2327	be distributed to at most one of its child cgroups.  Having an
2328	exclusive CPU appearing in two or more of its child cgroups is
2329	not allowed (the exclusivity rule).  A value that violates the
2330	exclusivity rule will be rejected with a write error.
2331
2332	The root cgroup is a partition root and all its available CPUs
2333	are in its exclusive CPU set.
2334
2335  cpuset.cpus.exclusive.effective
2336	A read-only multiple values file which exists on all non-root
2337	cpuset-enabled cgroups.
2338
2339	This file shows the effective set of exclusive CPUs that
2340	can be used to create a partition root.  The content of this
2341	file will always be a subset of "cpuset.cpus" and its parent's
2342	"cpuset.cpus.exclusive.effective" if its parent is not the root
2343	cgroup.  It will also be a subset of "cpuset.cpus.exclusive"
2344	if it is set.  If "cpuset.cpus.exclusive" is not set, it is
2345	treated to have an implicit value of "cpuset.cpus" in the
2346	formation of local partition.
2347
2348  cpuset.cpus.isolated
2349	A read-only and root cgroup only multiple values file.
2350
2351	This file shows the set of all isolated CPUs used in existing
2352	isolated partitions. It will be empty if no isolated partition
2353	is created.
2354
2355  cpuset.cpus.partition
2356	A read-write single value file which exists on non-root
2357	cpuset-enabled cgroups.  This flag is owned by the parent cgroup
2358	and is not delegatable.
2359
2360	It accepts only the following input values when written to.
2361
2362	  ==========	=====================================
2363	  "member"	Non-root member of a partition
2364	  "root"	Partition root
2365	  "isolated"	Partition root without load balancing
2366	  ==========	=====================================
2367
2368	A cpuset partition is a collection of cpuset-enabled cgroups with
2369	a partition root at the top of the hierarchy and its descendants
2370	except those that are separate partition roots themselves and
2371	their descendants.  A partition has exclusive access to the
2372	set of exclusive CPUs allocated to it.	Other cgroups outside
2373	of that partition cannot use any CPUs in that set.
2374
2375	There are two types of partitions - local and remote.  A local
2376	partition is one whose parent cgroup is also a valid partition
2377	root.  A remote partition is one whose parent cgroup is not a
2378	valid partition root itself.  Writing to "cpuset.cpus.exclusive"
2379	is optional for the creation of a local partition as its
2380	"cpuset.cpus.exclusive" file will assume an implicit value that
2381	is the same as "cpuset.cpus" if it is not set.	Writing the
2382	proper "cpuset.cpus.exclusive" values down the cgroup hierarchy
2383	before the target partition root is mandatory for the creation
2384	of a remote partition.
2385
2386	Currently, a remote partition cannot be created under a local
2387	partition.  All the ancestors of a remote partition root except
2388	the root cgroup cannot be a partition root.
2389
2390	The root cgroup is always a partition root and its state cannot
2391	be changed.  All other non-root cgroups start out as "member".
2392
2393	When set to "root", the current cgroup is the root of a new
2394	partition or scheduling domain.  The set of exclusive CPUs is
2395	determined by the value of its "cpuset.cpus.exclusive.effective".
2396
2397	When set to "isolated", the CPUs in that partition will be in
2398	an isolated state without any load balancing from the scheduler
2399	and excluded from the unbound workqueues.  Tasks placed in such
2400	a partition with multiple CPUs should be carefully distributed
2401	and bound to each of the individual CPUs for optimal performance.
2402
2403	A partition root ("root" or "isolated") can be in one of the
2404	two possible states - valid or invalid.  An invalid partition
2405	root is in a degraded state where some state information may
2406	be retained, but behaves more like a "member".
2407
2408	All possible state transitions among "member", "root" and
2409	"isolated" are allowed.
2410
2411	On read, the "cpuset.cpus.partition" file can show the following
2412	values.
2413
2414	  =============================	=====================================
2415	  "member"			Non-root member of a partition
2416	  "root"			Partition root
2417	  "isolated"			Partition root without load balancing
2418	  "root invalid (<reason>)"	Invalid partition root
2419	  "isolated invalid (<reason>)"	Invalid isolated partition root
2420	  =============================	=====================================
2421
2422	In the case of an invalid partition root, a descriptive string on
2423	why the partition is invalid is included within parentheses.
2424
2425	For a local partition root to be valid, the following conditions
2426	must be met.
2427
2428	1) The parent cgroup is a valid partition root.
2429	2) The "cpuset.cpus.exclusive.effective" file cannot be empty,
2430	   though it may contain offline CPUs.
2431	3) The "cpuset.cpus.effective" cannot be empty unless there is
2432	   no task associated with this partition.
2433
2434	For a remote partition root to be valid, all the above conditions
2435	except the first one must be met.
2436
2437	External events like hotplug or changes to "cpuset.cpus" or
2438	"cpuset.cpus.exclusive" can cause a valid partition root to
2439	become invalid and vice versa.	Note that a task cannot be
2440	moved to a cgroup with empty "cpuset.cpus.effective".
2441
2442	A valid non-root parent partition may distribute out all its CPUs
2443	to its child local partitions when there is no task associated
2444	with it.
2445
2446	Care must be taken to change a valid partition root to "member"
2447	as all its child local partitions, if present, will become
2448	invalid causing disruption to tasks running in those child
2449	partitions. These inactivated partitions could be recovered if
2450	their parent is switched back to a partition root with a proper
2451	value in "cpuset.cpus" or "cpuset.cpus.exclusive".
2452
2453	Poll and inotify events are triggered whenever the state of
2454	"cpuset.cpus.partition" changes.  That includes changes caused
2455	by write to "cpuset.cpus.partition", cpu hotplug or other
2456	changes that modify the validity status of the partition.
2457	This will allow user space agents to monitor unexpected changes
2458	to "cpuset.cpus.partition" without the need to do continuous
2459	polling.
2460
2461	A user can pre-configure certain CPUs to an isolated state
2462	with load balancing disabled at boot time with the "isolcpus"
2463	kernel boot command line option.  If those CPUs are to be put
2464	into a partition, they have to be used in an isolated partition.
2465
2466
2467Device controller
2468-----------------
2469
2470Device controller manages access to device files. It includes both
2471creation of new device files (using mknod), and access to the
2472existing device files.
2473
2474Cgroup v2 device controller has no interface files and is implemented
2475on top of cgroup BPF. To control access to device files, a user may
2476create bpf programs of type BPF_PROG_TYPE_CGROUP_DEVICE and attach
2477them to cgroups with BPF_CGROUP_DEVICE flag. On an attempt to access a
2478device file, corresponding BPF programs will be executed, and depending
2479on the return value the attempt will succeed or fail with -EPERM.
2480
2481A BPF_PROG_TYPE_CGROUP_DEVICE program takes a pointer to the
2482bpf_cgroup_dev_ctx structure, which describes the device access attempt:
2483access type (mknod/read/write) and device (type, major and minor numbers).
2484If the program returns 0, the attempt fails with -EPERM, otherwise it
2485succeeds.
2486
2487An example of BPF_PROG_TYPE_CGROUP_DEVICE program may be found in
2488tools/testing/selftests/bpf/progs/dev_cgroup.c in the kernel source tree.
2489
2490
2491RDMA
2492----
2493
2494The "rdma" controller regulates the distribution and accounting of
2495RDMA resources.
2496
2497RDMA Interface Files
2498~~~~~~~~~~~~~~~~~~~~
2499
2500  rdma.max
2501	A readwrite nested-keyed file that exists for all the cgroups
2502	except root that describes current configured resource limit
2503	for a RDMA/IB device.
2504
2505	Lines are keyed by device name and are not ordered.
2506	Each line contains space separated resource name and its configured
2507	limit that can be distributed.
2508
2509	The following nested keys are defined.
2510
2511	  ==========	=============================
2512	  hca_handle	Maximum number of HCA Handles
2513	  hca_object 	Maximum number of HCA Objects
2514	  ==========	=============================
2515
2516	An example for mlx4 and ocrdma device follows::
2517
2518	  mlx4_0 hca_handle=2 hca_object=2000
2519	  ocrdma1 hca_handle=3 hca_object=max
2520
2521  rdma.current
2522	A read-only file that describes current resource usage.
2523	It exists for all the cgroup except root.
2524
2525	An example for mlx4 and ocrdma device follows::
2526
2527	  mlx4_0 hca_handle=1 hca_object=20
2528	  ocrdma1 hca_handle=1 hca_object=23
2529
2530HugeTLB
2531-------
2532
2533The HugeTLB controller allows to limit the HugeTLB usage per control group and
2534enforces the controller limit during page fault.
2535
2536HugeTLB Interface Files
2537~~~~~~~~~~~~~~~~~~~~~~~
2538
2539  hugetlb.<hugepagesize>.current
2540	Show current usage for "hugepagesize" hugetlb.  It exists for all
2541	the cgroup except root.
2542
2543  hugetlb.<hugepagesize>.max
2544	Set/show the hard limit of "hugepagesize" hugetlb usage.
2545	The default value is "max".  It exists for all the cgroup except root.
2546
2547  hugetlb.<hugepagesize>.events
2548	A read-only flat-keyed file which exists on non-root cgroups.
2549
2550	  max
2551		The number of allocation failure due to HugeTLB limit
2552
2553  hugetlb.<hugepagesize>.events.local
2554	Similar to hugetlb.<hugepagesize>.events but the fields in the file
2555	are local to the cgroup i.e. not hierarchical. The file modified event
2556	generated on this file reflects only the local events.
2557
2558  hugetlb.<hugepagesize>.numa_stat
2559	Similar to memory.numa_stat, it shows the numa information of the
2560        hugetlb pages of <hugepagesize> in this cgroup.  Only active in
2561        use hugetlb pages are included.  The per-node values are in bytes.
2562
2563Misc
2564----
2565
2566The Miscellaneous cgroup provides the resource limiting and tracking
2567mechanism for the scalar resources which cannot be abstracted like the other
2568cgroup resources. Controller is enabled by the CONFIG_CGROUP_MISC config
2569option.
2570
2571A resource can be added to the controller via enum misc_res_type{} in the
2572include/linux/misc_cgroup.h file and the corresponding name via misc_res_name[]
2573in the kernel/cgroup/misc.c file. Provider of the resource must set its
2574capacity prior to using the resource by calling misc_cg_set_capacity().
2575
2576Once a capacity is set then the resource usage can be updated using charge and
2577uncharge APIs. All of the APIs to interact with misc controller are in
2578include/linux/misc_cgroup.h.
2579
2580Misc Interface Files
2581~~~~~~~~~~~~~~~~~~~~
2582
2583Miscellaneous controller provides 3 interface files. If two misc resources (res_a and res_b) are registered then:
2584
2585  misc.capacity
2586        A read-only flat-keyed file shown only in the root cgroup.  It shows
2587        miscellaneous scalar resources available on the platform along with
2588        their quantities::
2589
2590	  $ cat misc.capacity
2591	  res_a 50
2592	  res_b 10
2593
2594  misc.current
2595        A read-only flat-keyed file shown in the all cgroups.  It shows
2596        the current usage of the resources in the cgroup and its children.::
2597
2598	  $ cat misc.current
2599	  res_a 3
2600	  res_b 0
2601
2602  misc.max
2603        A read-write flat-keyed file shown in the non root cgroups. Allowed
2604        maximum usage of the resources in the cgroup and its children.::
2605
2606	  $ cat misc.max
2607	  res_a max
2608	  res_b 4
2609
2610	Limit can be set by::
2611
2612	  # echo res_a 1 > misc.max
2613
2614	Limit can be set to max by::
2615
2616	  # echo res_a max > misc.max
2617
2618        Limits can be set higher than the capacity value in the misc.capacity
2619        file.
2620
2621  misc.events
2622	A read-only flat-keyed file which exists on non-root cgroups. The
2623	following entries are defined. Unless specified otherwise, a value
2624	change in this file generates a file modified event. All fields in
2625	this file are hierarchical.
2626
2627	  max
2628		The number of times the cgroup's resource usage was
2629		about to go over the max boundary.
2630
2631Migration and Ownership
2632~~~~~~~~~~~~~~~~~~~~~~~
2633
2634A miscellaneous scalar resource is charged to the cgroup in which it is used
2635first, and stays charged to that cgroup until that resource is freed. Migrating
2636a process to a different cgroup does not move the charge to the destination
2637cgroup where the process has moved.
2638
2639Others
2640------
2641
2642perf_event
2643~~~~~~~~~~
2644
2645perf_event controller, if not mounted on a legacy hierarchy, is
2646automatically enabled on the v2 hierarchy so that perf events can
2647always be filtered by cgroup v2 path.  The controller can still be
2648moved to a legacy hierarchy after v2 hierarchy is populated.
2649
2650
2651Non-normative information
2652-------------------------
2653
2654This section contains information that isn't considered to be a part of
2655the stable kernel API and so is subject to change.
2656
2657
2658CPU controller root cgroup process behaviour
2659~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2660
2661When distributing CPU cycles in the root cgroup each thread in this
2662cgroup is treated as if it was hosted in a separate child cgroup of the
2663root cgroup. This child cgroup weight is dependent on its thread nice
2664level.
2665
2666For details of this mapping see sched_prio_to_weight array in
2667kernel/sched/core.c file (values from this array should be scaled
2668appropriately so the neutral - nice 0 - value is 100 instead of 1024).
2669
2670
2671IO controller root cgroup process behaviour
2672~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
2673
2674Root cgroup processes are hosted in an implicit leaf child node.
2675When distributing IO resources this implicit child node is taken into
2676account as if it was a normal child cgroup of the root cgroup with a
2677weight value of 200.
2678
2679
2680Namespace
2681=========
2682
2683Basics
2684------
2685
2686cgroup namespace provides a mechanism to virtualize the view of the
2687"/proc/$PID/cgroup" file and cgroup mounts.  The CLONE_NEWCGROUP clone
2688flag can be used with clone(2) and unshare(2) to create a new cgroup
2689namespace.  The process running inside the cgroup namespace will have
2690its "/proc/$PID/cgroup" output restricted to cgroupns root.  The
2691cgroupns root is the cgroup of the process at the time of creation of
2692the cgroup namespace.
2693
2694Without cgroup namespace, the "/proc/$PID/cgroup" file shows the
2695complete path of the cgroup of a process.  In a container setup where
2696a set of cgroups and namespaces are intended to isolate processes the
2697"/proc/$PID/cgroup" file may leak potential system level information
2698to the isolated processes.  For example::
2699
2700  # cat /proc/self/cgroup
2701  0::/batchjobs/container_id1
2702
2703The path '/batchjobs/container_id1' can be considered as system-data
2704and undesirable to expose to the isolated processes.  cgroup namespace
2705can be used to restrict visibility of this path.  For example, before
2706creating a cgroup namespace, one would see::
2707
2708  # ls -l /proc/self/ns/cgroup
2709  lrwxrwxrwx 1 root root 0 2014-07-15 10:37 /proc/self/ns/cgroup -> cgroup:[4026531835]
2710  # cat /proc/self/cgroup
2711  0::/batchjobs/container_id1
2712
2713After unsharing a new namespace, the view changes::
2714
2715  # ls -l /proc/self/ns/cgroup
2716  lrwxrwxrwx 1 root root 0 2014-07-15 10:35 /proc/self/ns/cgroup -> cgroup:[4026532183]
2717  # cat /proc/self/cgroup
2718  0::/
2719
2720When some thread from a multi-threaded process unshares its cgroup
2721namespace, the new cgroupns gets applied to the entire process (all
2722the threads).  This is natural for the v2 hierarchy; however, for the
2723legacy hierarchies, this may be unexpected.
2724
2725A cgroup namespace is alive as long as there are processes inside or
2726mounts pinning it.  When the last usage goes away, the cgroup
2727namespace is destroyed.  The cgroupns root and the actual cgroups
2728remain.
2729
2730
2731The Root and Views
2732------------------
2733
2734The 'cgroupns root' for a cgroup namespace is the cgroup in which the
2735process calling unshare(2) is running.  For example, if a process in
2736/batchjobs/container_id1 cgroup calls unshare, cgroup
2737/batchjobs/container_id1 becomes the cgroupns root.  For the
2738init_cgroup_ns, this is the real root ('/') cgroup.
2739
2740The cgroupns root cgroup does not change even if the namespace creator
2741process later moves to a different cgroup::
2742
2743  # ~/unshare -c # unshare cgroupns in some cgroup
2744  # cat /proc/self/cgroup
2745  0::/
2746  # mkdir sub_cgrp_1
2747  # echo 0 > sub_cgrp_1/cgroup.procs
2748  # cat /proc/self/cgroup
2749  0::/sub_cgrp_1
2750
2751Each process gets its namespace-specific view of "/proc/$PID/cgroup"
2752
2753Processes running inside the cgroup namespace will be able to see
2754cgroup paths (in /proc/self/cgroup) only inside their root cgroup.
2755From within an unshared cgroupns::
2756
2757  # sleep 100000 &
2758  [1] 7353
2759  # echo 7353 > sub_cgrp_1/cgroup.procs
2760  # cat /proc/7353/cgroup
2761  0::/sub_cgrp_1
2762
2763From the initial cgroup namespace, the real cgroup path will be
2764visible::
2765
2766  $ cat /proc/7353/cgroup
2767  0::/batchjobs/container_id1/sub_cgrp_1
2768
2769From a sibling cgroup namespace (that is, a namespace rooted at a
2770different cgroup), the cgroup path relative to its own cgroup
2771namespace root will be shown.  For instance, if PID 7353's cgroup
2772namespace root is at '/batchjobs/container_id2', then it will see::
2773
2774  # cat /proc/7353/cgroup
2775  0::/../container_id2/sub_cgrp_1
2776
2777Note that the relative path always starts with '/' to indicate that
2778its relative to the cgroup namespace root of the caller.
2779
2780
2781Migration and setns(2)
2782----------------------
2783
2784Processes inside a cgroup namespace can move into and out of the
2785namespace root if they have proper access to external cgroups.  For
2786example, from inside a namespace with cgroupns root at
2787/batchjobs/container_id1, and assuming that the global hierarchy is
2788still accessible inside cgroupns::
2789
2790  # cat /proc/7353/cgroup
2791  0::/sub_cgrp_1
2792  # echo 7353 > batchjobs/container_id2/cgroup.procs
2793  # cat /proc/7353/cgroup
2794  0::/../container_id2
2795
2796Note that this kind of setup is not encouraged.  A task inside cgroup
2797namespace should only be exposed to its own cgroupns hierarchy.
2798
2799setns(2) to another cgroup namespace is allowed when:
2800
2801(a) the process has CAP_SYS_ADMIN against its current user namespace
2802(b) the process has CAP_SYS_ADMIN against the target cgroup
2803    namespace's userns
2804
2805No implicit cgroup changes happen with attaching to another cgroup
2806namespace.  It is expected that the someone moves the attaching
2807process under the target cgroup namespace root.
2808
2809
2810Interaction with Other Namespaces
2811---------------------------------
2812
2813Namespace specific cgroup hierarchy can be mounted by a process
2814running inside a non-init cgroup namespace::
2815
2816  # mount -t cgroup2 none $MOUNT_POINT
2817
2818This will mount the unified cgroup hierarchy with cgroupns root as the
2819filesystem root.  The process needs CAP_SYS_ADMIN against its user and
2820mount namespaces.
2821
2822The virtualization of /proc/self/cgroup file combined with restricting
2823the view of cgroup hierarchy by namespace-private cgroupfs mount
2824provides a properly isolated cgroup view inside the container.
2825
2826
2827Information on Kernel Programming
2828=================================
2829
2830This section contains kernel programming information in the areas
2831where interacting with cgroup is necessary.  cgroup core and
2832controllers are not covered.
2833
2834
2835Filesystem Support for Writeback
2836--------------------------------
2837
2838A filesystem can support cgroup writeback by updating
2839address_space_operations->writepage[s]() to annotate bio's using the
2840following two functions.
2841
2842  wbc_init_bio(@wbc, @bio)
2843	Should be called for each bio carrying writeback data and
2844	associates the bio with the inode's owner cgroup and the
2845	corresponding request queue.  This must be called after
2846	a queue (device) has been associated with the bio and
2847	before submission.
2848
2849  wbc_account_cgroup_owner(@wbc, @page, @bytes)
2850	Should be called for each data segment being written out.
2851	While this function doesn't care exactly when it's called
2852	during the writeback session, it's the easiest and most
2853	natural to call it as data segments are added to a bio.
2854
2855With writeback bio's annotated, cgroup support can be enabled per
2856super_block by setting SB_I_CGROUPWB in ->s_iflags.  This allows for
2857selective disabling of cgroup writeback support which is helpful when
2858certain filesystem features, e.g. journaled data mode, are
2859incompatible.
2860
2861wbc_init_bio() binds the specified bio to its cgroup.  Depending on
2862the configuration, the bio may be executed at a lower priority and if
2863the writeback session is holding shared resources, e.g. a journal
2864entry, may lead to priority inversion.  There is no one easy solution
2865for the problem.  Filesystems can try to work around specific problem
2866cases by skipping wbc_init_bio() and using bio_associate_blkg()
2867directly.
2868
2869
2870Deprecated v1 Core Features
2871===========================
2872
2873- Multiple hierarchies including named ones are not supported.
2874
2875- All v1 mount options are not supported.
2876
2877- The "tasks" file is removed and "cgroup.procs" is not sorted.
2878
2879- "cgroup.clone_children" is removed.
2880
2881- /proc/cgroups is meaningless for v2.  Use "cgroup.controllers" file
2882  at the root instead.
2883
2884
2885Issues with v1 and Rationales for v2
2886====================================
2887
2888Multiple Hierarchies
2889--------------------
2890
2891cgroup v1 allowed an arbitrary number of hierarchies and each
2892hierarchy could host any number of controllers.  While this seemed to
2893provide a high level of flexibility, it wasn't useful in practice.
2894
2895For example, as there is only one instance of each controller, utility
2896type controllers such as freezer which can be useful in all
2897hierarchies could only be used in one.  The issue is exacerbated by
2898the fact that controllers couldn't be moved to another hierarchy once
2899hierarchies were populated.  Another issue was that all controllers
2900bound to a hierarchy were forced to have exactly the same view of the
2901hierarchy.  It wasn't possible to vary the granularity depending on
2902the specific controller.
2903
2904In practice, these issues heavily limited which controllers could be
2905put on the same hierarchy and most configurations resorted to putting
2906each controller on its own hierarchy.  Only closely related ones, such
2907as the cpu and cpuacct controllers, made sense to be put on the same
2908hierarchy.  This often meant that userland ended up managing multiple
2909similar hierarchies repeating the same steps on each hierarchy
2910whenever a hierarchy management operation was necessary.
2911
2912Furthermore, support for multiple hierarchies came at a steep cost.
2913It greatly complicated cgroup core implementation but more importantly
2914the support for multiple hierarchies restricted how cgroup could be
2915used in general and what controllers was able to do.
2916
2917There was no limit on how many hierarchies there might be, which meant
2918that a thread's cgroup membership couldn't be described in finite
2919length.  The key might contain any number of entries and was unlimited
2920in length, which made it highly awkward to manipulate and led to
2921addition of controllers which existed only to identify membership,
2922which in turn exacerbated the original problem of proliferating number
2923of hierarchies.
2924
2925Also, as a controller couldn't have any expectation regarding the
2926topologies of hierarchies other controllers might be on, each
2927controller had to assume that all other controllers were attached to
2928completely orthogonal hierarchies.  This made it impossible, or at
2929least very cumbersome, for controllers to cooperate with each other.
2930
2931In most use cases, putting controllers on hierarchies which are
2932completely orthogonal to each other isn't necessary.  What usually is
2933called for is the ability to have differing levels of granularity
2934depending on the specific controller.  In other words, hierarchy may
2935be collapsed from leaf towards root when viewed from specific
2936controllers.  For example, a given configuration might not care about
2937how memory is distributed beyond a certain level while still wanting
2938to control how CPU cycles are distributed.
2939
2940
2941Thread Granularity
2942------------------
2943
2944cgroup v1 allowed threads of a process to belong to different cgroups.
2945This didn't make sense for some controllers and those controllers
2946ended up implementing different ways to ignore such situations but
2947much more importantly it blurred the line between API exposed to
2948individual applications and system management interface.
2949
2950Generally, in-process knowledge is available only to the process
2951itself; thus, unlike service-level organization of processes,
2952categorizing threads of a process requires active participation from
2953the application which owns the target process.
2954
2955cgroup v1 had an ambiguously defined delegation model which got abused
2956in combination with thread granularity.  cgroups were delegated to
2957individual applications so that they can create and manage their own
2958sub-hierarchies and control resource distributions along them.  This
2959effectively raised cgroup to the status of a syscall-like API exposed
2960to lay programs.
2961
2962First of all, cgroup has a fundamentally inadequate interface to be
2963exposed this way.  For a process to access its own knobs, it has to
2964extract the path on the target hierarchy from /proc/self/cgroup,
2965construct the path by appending the name of the knob to the path, open
2966and then read and/or write to it.  This is not only extremely clunky
2967and unusual but also inherently racy.  There is no conventional way to
2968define transaction across the required steps and nothing can guarantee
2969that the process would actually be operating on its own sub-hierarchy.
2970
2971cgroup controllers implemented a number of knobs which would never be
2972accepted as public APIs because they were just adding control knobs to
2973system-management pseudo filesystem.  cgroup ended up with interface
2974knobs which were not properly abstracted or refined and directly
2975revealed kernel internal details.  These knobs got exposed to
2976individual applications through the ill-defined delegation mechanism
2977effectively abusing cgroup as a shortcut to implementing public APIs
2978without going through the required scrutiny.
2979
2980This was painful for both userland and kernel.  Userland ended up with
2981misbehaving and poorly abstracted interfaces and kernel exposing and
2982locked into constructs inadvertently.
2983
2984
2985Competition Between Inner Nodes and Threads
2986-------------------------------------------
2987
2988cgroup v1 allowed threads to be in any cgroups which created an
2989interesting problem where threads belonging to a parent cgroup and its
2990children cgroups competed for resources.  This was nasty as two
2991different types of entities competed and there was no obvious way to
2992settle it.  Different controllers did different things.
2993
2994The cpu controller considered threads and cgroups as equivalents and
2995mapped nice levels to cgroup weights.  This worked for some cases but
2996fell flat when children wanted to be allocated specific ratios of CPU
2997cycles and the number of internal threads fluctuated - the ratios
2998constantly changed as the number of competing entities fluctuated.
2999There also were other issues.  The mapping from nice level to weight
3000wasn't obvious or universal, and there were various other knobs which
3001simply weren't available for threads.
3002
3003The io controller implicitly created a hidden leaf node for each
3004cgroup to host the threads.  The hidden leaf had its own copies of all
3005the knobs with ``leaf_`` prefixed.  While this allowed equivalent
3006control over internal threads, it was with serious drawbacks.  It
3007always added an extra layer of nesting which wouldn't be necessary
3008otherwise, made the interface messy and significantly complicated the
3009implementation.
3010
3011The memory controller didn't have a way to control what happened
3012between internal tasks and child cgroups and the behavior was not
3013clearly defined.  There were attempts to add ad-hoc behaviors and
3014knobs to tailor the behavior to specific workloads which would have
3015led to problems extremely difficult to resolve in the long term.
3016
3017Multiple controllers struggled with internal tasks and came up with
3018different ways to deal with it; unfortunately, all the approaches were
3019severely flawed and, furthermore, the widely different behaviors
3020made cgroup as a whole highly inconsistent.
3021
3022This clearly is a problem which needs to be addressed from cgroup core
3023in a uniform way.
3024
3025
3026Other Interface Issues
3027----------------------
3028
3029cgroup v1 grew without oversight and developed a large number of
3030idiosyncrasies and inconsistencies.  One issue on the cgroup core side
3031was how an empty cgroup was notified - a userland helper binary was
3032forked and executed for each event.  The event delivery wasn't
3033recursive or delegatable.  The limitations of the mechanism also led
3034to in-kernel event delivery filtering mechanism further complicating
3035the interface.
3036
3037Controller interfaces were problematic too.  An extreme example is
3038controllers completely ignoring hierarchical organization and treating
3039all cgroups as if they were all located directly under the root
3040cgroup.  Some controllers exposed a large amount of inconsistent
3041implementation details to userland.
3042
3043There also was no consistency across controllers.  When a new cgroup
3044was created, some controllers defaulted to not imposing extra
3045restrictions while others disallowed any resource usage until
3046explicitly configured.  Configuration knobs for the same type of
3047control used widely differing naming schemes and formats.  Statistics
3048and information knobs were named arbitrarily and used different
3049formats and units even in the same controller.
3050
3051cgroup v2 establishes common conventions where appropriate and updates
3052controllers so that they expose minimal and consistent interfaces.
3053
3054
3055Controller Issues and Remedies
3056------------------------------
3057
3058Memory
3059~~~~~~
3060
3061The original lower boundary, the soft limit, is defined as a limit
3062that is per default unset.  As a result, the set of cgroups that
3063global reclaim prefers is opt-in, rather than opt-out.  The costs for
3064optimizing these mostly negative lookups are so high that the
3065implementation, despite its enormous size, does not even provide the
3066basic desirable behavior.  First off, the soft limit has no
3067hierarchical meaning.  All configured groups are organized in a global
3068rbtree and treated like equal peers, regardless where they are located
3069in the hierarchy.  This makes subtree delegation impossible.  Second,
3070the soft limit reclaim pass is so aggressive that it not just
3071introduces high allocation latencies into the system, but also impacts
3072system performance due to overreclaim, to the point where the feature
3073becomes self-defeating.
3074
3075The memory.low boundary on the other hand is a top-down allocated
3076reserve.  A cgroup enjoys reclaim protection when it's within its
3077effective low, which makes delegation of subtrees possible. It also
3078enjoys having reclaim pressure proportional to its overage when
3079above its effective low.
3080
3081The original high boundary, the hard limit, is defined as a strict
3082limit that can not budge, even if the OOM killer has to be called.
3083But this generally goes against the goal of making the most out of the
3084available memory.  The memory consumption of workloads varies during
3085runtime, and that requires users to overcommit.  But doing that with a
3086strict upper limit requires either a fairly accurate prediction of the
3087working set size or adding slack to the limit.  Since working set size
3088estimation is hard and error prone, and getting it wrong results in
3089OOM kills, most users tend to err on the side of a looser limit and
3090end up wasting precious resources.
3091
3092The memory.high boundary on the other hand can be set much more
3093conservatively.  When hit, it throttles allocations by forcing them
3094into direct reclaim to work off the excess, but it never invokes the
3095OOM killer.  As a result, a high boundary that is chosen too
3096aggressively will not terminate the processes, but instead it will
3097lead to gradual performance degradation.  The user can monitor this
3098and make corrections until the minimal memory footprint that still
3099gives acceptable performance is found.
3100
3101In extreme cases, with many concurrent allocations and a complete
3102breakdown of reclaim progress within the group, the high boundary can
3103be exceeded.  But even then it's mostly better to satisfy the
3104allocation from the slack available in other groups or the rest of the
3105system than killing the group.  Otherwise, memory.max is there to
3106limit this type of spillover and ultimately contain buggy or even
3107malicious applications.
3108
3109Setting the original memory.limit_in_bytes below the current usage was
3110subject to a race condition, where concurrent charges could cause the
3111limit setting to fail. memory.max on the other hand will first set the
3112limit to prevent new charges, and then reclaim and OOM kill until the
3113new limit is met - or the task writing to memory.max is killed.
3114
3115The combined memory+swap accounting and limiting is replaced by real
3116control over swap space.
3117
3118The main argument for a combined memory+swap facility in the original
3119cgroup design was that global or parental pressure would always be
3120able to swap all anonymous memory of a child group, regardless of the
3121child's own (possibly untrusted) configuration.  However, untrusted
3122groups can sabotage swapping by other means - such as referencing its
3123anonymous memory in a tight loop - and an admin can not assume full
3124swappability when overcommitting untrusted jobs.
3125
3126For trusted jobs, on the other hand, a combined counter is not an
3127intuitive userspace interface, and it flies in the face of the idea
3128that cgroup controllers should account and limit specific physical
3129resources.  Swap space is a resource like all others in the system,
3130and that's why unified hierarchy allows distributing it separately.
3131