€•˜Œsphinx.addnodes”Œdocument”“”)”}”(Œ rawsource”Œ”Œchildren”]”(Œtranslations”Œ LanguagesNode”“”)”}”(hhh]”(hŒpending_xref”“”)”}”(hhh]”Œdocutils.nodes”ŒText”“”ŒChinese (Simplified)”…””}”Œparent”hsbaŒ attributes”}”(Œids”]”Œclasses”]”Œnames”]”Œdupnames”]”Œbackrefs”]”Œ refdomain”Œstd”Œreftype”Œdoc”Œ reftarget”Œ)/translations/zh_CN/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuŒtagname”hhhubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/zh_TW/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/it_IT/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/ja_JP/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/ko_KR/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒPortuguese (Brazilian)”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/pt_BR/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒSpanish”…””}”hh–sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ)/translations/sp_SP/admin-guide/cgroup-v2”Œmodname”NŒ classname”NŒrefexplicit”ˆuh1hhhubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h hhŒ _document”hŒsource”NŒline”NubhŒtarget”“”)”}”(hŒ.. _cgroup-v2:”h]”h}”(h]”h ]”h"]”h$]”h&]”Œrefid”Œ cgroup-v2”uh1hµh´Khhh²hh³ŒC/var/lib/git/docbuild/linux/Documentation/admin-guide/cgroup-v2.rst”ubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒControl Group v2”h]”hŒControl Group v2”…””}”(hhËh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhhÆh²hh³hÃh´KubhŒ field_list”“”)”}”(hhh]”(hŒfield”“”)”}”(hhh]”(hŒ field_name”“”)”}”(hŒDate”h]”hŒDate”…””}”(hhåh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hãhhàh³hÃh´KubhŒ field_body”“”)”}”(hŒ October, 2015”h]”hŒ paragraph”“”)”}”(hh÷h]”hŒ October, 2015”…””}”(hhûh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Khhõubah}”(h]”h ]”h"]”h$]”h&]”uh1hóhhàubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÞh³hÃh´KhhÛh²hubhß)”}”(hhh]”(hä)”}”(hŒAuthor”h]”hŒAuthor”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hãhjh³hÃh´Kubhô)”}”(hŒTejun Heo ”h]”hú)”}”(hŒTejun Heo ”h]”(hŒTejun Heo <”…””}”(hj)h²hh³Nh´NubhŒ reference”“”)”}”(hŒ tj@kernel.org”h]”hŒ tj@kernel.org”…””}”(hj3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”Œmailto:tj@kernel.org”uh1j1hj)ubhŒ>”…””}”(hj)h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Khj%ubah}”(h]”h ]”h"]”h$]”h&]”uh1hóhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÞh³hÃh´KhhÛh²hubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÙhhÆh²hh³hÃh´Kubhú)”}”(hXhThis is the authoritative documentation on the design, interface and conventions of cgroup v2. It describes all userland-visible aspects of cgroup including core and specific controller behaviors. All future changes must be reflected in this document. Documentation for v1 is available under :ref:`Documentation/admin-guide/cgroup-v1/index.rst `.”h]”(hX'This is the authoritative documentation on the design, interface and conventions of cgroup v2. It describes all userland-visible aspects of cgroup including core and specific controller behaviors. All future changes must be reflected in this document. Documentation for v1 is available under ”…””}”(hj_h²hh³Nh´Nubh)”}”(hŒ@:ref:`Documentation/admin-guide/cgroup-v1/index.rst `”h]”hŒinline”“”)”}”(hjih]”hŒ-Documentation/admin-guide/cgroup-v1/index.rst”…””}”(hjmh²hh³Nh´Nubah}”(h]”h ]”(Œxref”Œstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhjgubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”Œadmin-guide/cgroup-v2”Œ refdomain”jxŒreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆŒ reftarget”Œ cgroup-v1”uh1hh³hÃh´K hj_ubhŒ.”…””}”(hj_h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K hhÆh²hubhŒcomment”“”)”}”(hX„CONTENTS [Whenever any new section is added to this document, please also add an entry here.] 1. Introduction 1-1. Terminology 1-2. What is cgroup? 2. Basic Operations 2-1. Mounting 2-2. Organizing Processes and Threads 2-2-1. Processes 2-2-2. Threads 2-3. [Un]populated Notification 2-4. Controlling Controllers 2-4-1. Availability 2-4-2. Enabling and Disabling 2-4-3. Top-down Constraint 2-4-4. No Internal Process Constraint 2-5. Delegation 2-5-1. Model of Delegation 2-5-2. Delegation Containment 2-6. Guidelines 2-6-1. Organize Once and Control 2-6-2. Avoid Name Collisions 3. Resource Distribution Models 3-1. Weights 3-2. Limits 3-3. Protections 3-4. Allocations 4. Interface Files 4-1. Format 4-2. Conventions 4-3. Core Interface Files 5. Controllers 5-1. CPU 5-1-1. CPU Interface Files 5-2. Memory 5-2-1. Memory Interface Files 5-2-2. Usage Guidelines 5-2-3. Reclaim Protection 5-2-4. Memory Ownership 5-3. IO 5-3-1. IO Interface Files 5-3-2. Writeback 5-3-3. IO Latency 5-3-3-1. How IO Latency Throttling Works 5-3-3-2. IO Latency Interface Files 5-3-4. IO Priority 5-4. PID 5-4-1. PID Interface Files 5-5. Cpuset 5.5-1. Cpuset Interface Files 5-6. Device controller 5-7. RDMA 5-7-1. RDMA Interface Files 5-8. DMEM 5-8-1. DMEM Interface Files 5-9. HugeTLB 5.9-1. HugeTLB Interface Files 5-10. Misc 5.10-1 Misc Interface Files 5.10-2 Migration and Ownership 5-11. Others 5-11-1. perf_event 5-N. Non-normative information 5-N-1. CPU controller root cgroup process behaviour 5-N-2. IO controller root cgroup process behaviour 6. Namespace 6-1. Basics 6-2. The Root and Views 6-3. Migration and setns(2) 6-4. Interaction with Other Namespaces P. Information on Kernel Programming P-1. Filesystem Support for Writeback D. Deprecated v1 Core Features R. Issues with v1 and Rationales for v2 R-1. Multiple Hierarchies R-2. Thread Granularity R-3. Competition Between Inner Nodes and Threads R-4. Other Interface Issues R-5. Controller Issues and Remedies R-5-1. Memory”h]”hX„CONTENTS [Whenever any new section is added to this document, please also add an entry here.] 1. Introduction 1-1. Terminology 1-2. What is cgroup? 2. Basic Operations 2-1. Mounting 2-2. Organizing Processes and Threads 2-2-1. Processes 2-2-2. Threads 2-3. [Un]populated Notification 2-4. Controlling Controllers 2-4-1. Availability 2-4-2. Enabling and Disabling 2-4-3. Top-down Constraint 2-4-4. No Internal Process Constraint 2-5. Delegation 2-5-1. Model of Delegation 2-5-2. Delegation Containment 2-6. Guidelines 2-6-1. Organize Once and Control 2-6-2. Avoid Name Collisions 3. Resource Distribution Models 3-1. Weights 3-2. Limits 3-3. Protections 3-4. Allocations 4. Interface Files 4-1. Format 4-2. Conventions 4-3. Core Interface Files 5. Controllers 5-1. CPU 5-1-1. CPU Interface Files 5-2. Memory 5-2-1. Memory Interface Files 5-2-2. Usage Guidelines 5-2-3. Reclaim Protection 5-2-4. Memory Ownership 5-3. IO 5-3-1. IO Interface Files 5-3-2. Writeback 5-3-3. IO Latency 5-3-3-1. How IO Latency Throttling Works 5-3-3-2. IO Latency Interface Files 5-3-4. IO Priority 5-4. PID 5-4-1. PID Interface Files 5-5. Cpuset 5.5-1. Cpuset Interface Files 5-6. Device controller 5-7. RDMA 5-7-1. RDMA Interface Files 5-8. DMEM 5-8-1. DMEM Interface Files 5-9. HugeTLB 5.9-1. HugeTLB Interface Files 5-10. Misc 5.10-1 Misc Interface Files 5.10-2 Migration and Ownership 5-11. Others 5-11-1. perf_event 5-N. Non-normative information 5-N-1. CPU controller root cgroup process behaviour 5-N-2. IO controller root cgroup process behaviour 6. Namespace 6-1. Basics 6-2. The Root and Views 6-3. Migration and setns(2) 6-4. Interaction with Other Namespaces P. Information on Kernel Programming P-1. Filesystem Support for Writeback D. Deprecated v1 Core Features R. Issues with v1 and Rationales for v2 R-1. Multiple Hierarchies R-2. Thread Granularity R-3. Competition Between Inner Nodes and Threads R-4. Other Interface Issues R-5. Controller Issues and Remedies R-5-1. Memory”…””}”hj˜sbah}”(h]”h ]”h"]”h$]”h&]”Œ xml:space”Œpreserve”uh1j–hhÆh²hh³hÃh´KdubhÅ)”}”(hhh]”(hÊ)”}”(hŒIntroduction”h]”hŒIntroduction”…””}”(hj«h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj¨h²hh³hÃh´KfubhÅ)”}”(hhh]”(hÊ)”}”(hŒTerminology”h]”hŒTerminology”…””}”(hj¼h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj¹h²hh³hÃh´Kiubhú)”}”(hX"cgroup" stands for "control group" and is never capitalized. The singular form is used to designate the whole feature and also as a qualifier as in "cgroup controllers". When explicitly referring to multiple individual control groups, the plural form "cgroups" is used.”h]”hX â€œcgroupâ€ stands for â€œcontrol groupâ€ and is never capitalized. The singular form is used to designate the whole feature and also as a qualifier as in â€œcgroup controllersâ€. When explicitly referring to multiple individual control groups, the plural form â€œcgroupsâ€ is used.”…””}”(hjÊh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Kkhj¹h²hubeh}”(h]”Œterminology”ah ]”h"]”Œterminology”ah$]”h&]”uh1hÄhj¨h²hh³hÃh´KiubhÅ)”}”(hhh]”(hÊ)”}”(hŒWhat is cgroup?”h]”hŒWhat is cgroup?”…””}”(hjãh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjàh²hh³hÃh´Krubhú)”}”(hŒ—cgroup is a mechanism to organize processes hierarchically and distribute system resources along the hierarchy in a controlled and configurable manner.”h]”hŒ—cgroup is a mechanism to organize processes hierarchically and distribute system resources along the hierarchy in a controlled and configurable manner.”…””}”(hjñh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Kthjàh²hubhú)”}”(hXccgroup is largely composed of two parts - the core and controllers. cgroup core is primarily responsible for hierarchically organizing processes. A cgroup controller is usually responsible for distributing a specific type of system resource along the hierarchy although there are utility controllers which serve purposes other than resource distribution.”h]”hXccgroup is largely composed of two parts - the core and controllers. cgroup core is primarily responsible for hierarchically organizing processes. A cgroup controller is usually responsible for distributing a specific type of system resource along the hierarchy although there are utility controllers which serve purposes other than resource distribution.”…””}”(hjÿh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Kxhjàh²hubhú)”}”(hXtcgroups form a tree structure and every process in the system belongs to one and only one cgroup. All threads of a process belong to the same cgroup. On creation, all processes are put in the cgroup that the parent process belongs to at the time. A process can be migrated to another cgroup. Migration of a process doesn't affect already existing descendant processes.”h]”hXvcgroups form a tree structure and every process in the system belongs to one and only one cgroup. All threads of a process belong to the same cgroup. On creation, all processes are put in the cgroup that the parent process belongs to at the time. A process can be migrated to another cgroup. Migration of a process doesnâ€™t affect already existing descendant processes.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Khjàh²hubhú)”}”(hXõFollowing certain structural constraints, controllers may be enabled or disabled selectively on a cgroup. All controller behaviors are hierarchical - if a controller is enabled on a cgroup, it affects all processes which belong to the cgroups consisting the inclusive sub-hierarchy of the cgroup. When a controller is enabled on a nested cgroup, it always restricts the resource distribution further. The restrictions set closer to the root in the hierarchy can not be overridden from further away.”h]”hXõFollowing certain structural constraints, controllers may be enabled or disabled selectively on a cgroup. All controller behaviors are hierarchical - if a controller is enabled on a cgroup, it affects all processes which belong to the cgroups consisting the inclusive sub-hierarchy of the cgroup. When a controller is enabled on a nested cgroup, it always restricts the resource distribution further. The restrictions set closer to the root in the hierarchy can not be overridden from further away.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K†hjàh²hubeh}”(h]”Œwhat-is-cgroup”ah ]”h"]”Œwhat is cgroup?”ah$]”h&]”uh1hÄhj¨h²hh³hÃh´Krubeh}”(h]”Œintroduction”ah ]”h"]”Œintroduction”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´KfubhÅ)”}”(hhh]”(hÊ)”}”(hŒBasic Operations”h]”hŒBasic Operations”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj9h²hh³hÃh´K‘ubhÅ)”}”(hhh]”(hÊ)”}”(hŒMounting”h]”hŒMounting”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjJh²hh³hÃh´K”ubhú)”}”(hŒzUnlike v1, cgroup v2 has only single hierarchy. The cgroup v2 hierarchy can be mounted with the following mount command::”h]”hŒyUnlike v1, cgroup v2 has only single hierarchy. The cgroup v2 hierarchy can be mounted with the following mount command:”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K–hjJh²hubhŒ literal_block”“”)”}”(hŒ$# mount -t cgroup2 none $MOUNT_POINT”h]”hŒ$# mount -t cgroup2 none $MOUNT_POINT”…””}”hjksbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´K™hjJh²hubhú)”}”(hX“cgroup2 filesystem has the magic number 0x63677270 ("cgrp"). All controllers which support v2 and are not bound to a v1 hierarchy are automatically bound to the v2 hierarchy and show up at the root. Controllers which are not in active use in the v2 hierarchy can be bound to other hierarchies. This allows mixing v2 hierarchy with the legacy v1 multiple hierarchies in a fully backward compatible way.”h]”hX—cgroup2 filesystem has the magic number 0x63677270 (â€œcgrpâ€). All controllers which support v2 and are not bound to a v1 hierarchy are automatically bound to the v2 hierarchy and show up at the root. Controllers which are not in active use in the v2 hierarchy can be bound to other hierarchies. This allows mixing v2 hierarchy with the legacy v1 multiple hierarchies in a fully backward compatible way.”…””}”(hjyh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K›hjJh²hubhú)”}”(hXvA controller can be moved across hierarchies only after the controller is no longer referenced in its current hierarchy. Because per-cgroup controller states are destroyed asynchronously and controllers may have lingering references, a controller may not show up immediately on the v2 hierarchy after the final umount of the previous hierarchy. Similarly, a controller should be fully disabled to be moved out of the unified hierarchy and it may take some time for the disabled controller to become available for other hierarchies; furthermore, due to inter-controller dependencies, other controllers may need to be disabled too.”h]”hXvA controller can be moved across hierarchies only after the controller is no longer referenced in its current hierarchy. Because per-cgroup controller states are destroyed asynchronously and controllers may have lingering references, a controller may not show up immediately on the v2 hierarchy after the final umount of the previous hierarchy. Similarly, a controller should be fully disabled to be moved out of the unified hierarchy and it may take some time for the disabled controller to become available for other hierarchies; furthermore, due to inter-controller dependencies, other controllers may need to be disabled too.”…””}”(hj‡h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K¢hjJh²hubhú)”}”(hX)While useful for development and manual configurations, moving controllers dynamically between the v2 and other hierarchies is strongly discouraged for production use. It is recommended to decide the hierarchies and controller associations before starting using the controllers after system boot.”h]”hX)While useful for development and manual configurations, moving controllers dynamically between the v2 and other hierarchies is strongly discouraged for production use. It is recommended to decide the hierarchies and controller associations before starting using the controllers after system boot.”…””}”(hj•h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KhjJh²hubhú)”}”(hXKDuring transition to v2, system management software might still automount the v1 cgroup filesystem and so hijack all controllers during boot, before manual intervention is possible. To make testing and experimenting easier, the kernel parameter cgroup_no_v1= allows disabling controllers in v1 and make them always available in v2.”h]”hXKDuring transition to v2, system management software might still automount the v1 cgroup filesystem and so hijack all controllers during boot, before manual intervention is possible. To make testing and experimenting easier, the kernel parameter cgroup_no_v1= allows disabling controllers in v1 and make them always available in v2.”…””}”(hj£h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K³hjJh²hubhú)”}”(hŒ9cgroup v2 currently supports the following mount options.”h]”hŒ9cgroup v2 currently supports the following mount options.”…””}”(hj±h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K¹hjJh²hubhŒblock_quote”“”)”}”(hX¢ nsdelegate Consider cgroup namespaces as delegation boundaries. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. Please refer to the Delegation section for details. favordynmods Reduce the latencies of dynamic cgroup modifications such as task migrations and controller on/offs at the cost of making hot path operations such as forks and exits more expensive. The static usage pattern of creating a cgroup, enabling controllers, and then seeding it with CLONE_INTO_CGROUP is not affected by this option. memory_localevents Only populate memory.events with data for the current cgroup, and not any subtrees. This is legacy behaviour, the default behaviour without this option is to include subtree counts. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. memory_recursiveprot Recursively apply memory.min and memory.low protection to entire subtrees, without requiring explicit downward propagation into leaf cgroups. This allows protecting entire subtrees from one another, while retaining free competition within those subtrees. This should have been the default behavior but is a mount-option to avoid regressing setups relying on the original semantics (e.g. specifying bogusly high 'bypass' protection values at higher tree levels). memory_hugetlb_accounting Count HugeTLB memory usage towards the cgroup's overall memory usage for the memory controller (for the purpose of statistics reporting and memory protection). This is a new behavior that could regress existing setups, so it must be explicitly opted in with this mount option. A few caveats to keep in mind: * There is no HugeTLB pool management involved in the memory controller. The pre-allocated pool does not belong to anyone. Specifically, when a new HugeTLB folio is allocated to the pool, it is not accounted for from the perspective of the memory controller. It is only charged to a cgroup when it is actually used (for e.g at page fault time). Host memory overcommit management has to consider this when configuring hard limits. In general, HugeTLB pool management should be done via other mechanisms (such as the HugeTLB controller). * Failure to charge a HugeTLB folio to the memory controller results in SIGBUS. This could happen even if the HugeTLB pool still has pages available (but the cgroup limit is hit and reclaim attempt fails). * Charging HugeTLB memory towards the memory controller affects memory protection and reclaim dynamics. Any userspace tuning (of low, min limits for e.g) needs to take this into account. * HugeTLB pages utilized while this option is not selected will not be tracked by the memory controller (even if cgroup v2 is remounted later on). pids_localevents The option restores v1-like behavior of pids.events:max, that is only local (inside cgroup proper) fork failures are counted. Without this option pids.events.max represents any pids.max enforcemnt across cgroup's subtree. ”h]”hŒdefinition_list”“”)”}”(hhh]”(hŒdefinition_list_item”“”)”}”(hXnsdelegate Consider cgroup namespaces as delegation boundaries. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. Please refer to the Delegation section for details. ”h]”(hŒterm”“”)”}”(hŒ nsdelegate”h]”hŒ nsdelegate”…””}”(hjÒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´KÀhjÌubhŒ definition”“”)”}”(hhh]”hú)”}”(hXConsider cgroup namespaces as delegation boundaries. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. Please refer to the Delegation section for details.”h]”hXConsider cgroup namespaces as delegation boundaries. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. Please refer to the Delegation section for details.”…””}”(hjåh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´K¼hjâubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÌubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´KÀhjÇubjË)”}”(hXSfavordynmods Reduce the latencies of dynamic cgroup modifications such as task migrations and controller on/offs at the cost of making hot path operations such as forks and exits more expensive. The static usage pattern of creating a cgroup, enabling controllers, and then seeding it with CLONE_INTO_CGROUP is not affected by this option. ”h]”(jÑ)”}”(hŒfavordynmods”h]”hŒfavordynmods”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´KÈhjÿubjá)”}”(hhh]”hú)”}”(hXEReduce the latencies of dynamic cgroup modifications such as task migrations and controller on/offs at the cost of making hot path operations such as forks and exits more expensive. The static usage pattern of creating a cgroup, enabling controllers, and then seeding it with CLONE_INTO_CGROUP is not affected by this option.”h]”hXEReduce the latencies of dynamic cgroup modifications such as task migrations and controller on/offs at the cost of making hot path operations such as forks and exits more expensive. The static usage pattern of creating a cgroup, enabling controllers, and then seeding it with CLONE_INTO_CGROUP is not affected by this option.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KÃhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÿubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´KÈhjÇubjË)”}”(hXpmemory_localevents Only populate memory.events with data for the current cgroup, and not any subtrees. This is legacy behaviour, the default behaviour without this option is to include subtree counts. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts. ”h]”(jÑ)”}”(hŒmemory_localevents”h]”hŒmemory_localevents”…””}”(hj2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´KÐhj.ubjá)”}”(hhh]”hú)”}”(hX\Only populate memory.events with data for the current cgroup, and not any subtrees. This is legacy behaviour, the default behaviour without this option is to include subtree counts. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts.”h]”hX\Only populate memory.events with data for the current cgroup, and not any subtrees. This is legacy behaviour, the default behaviour without this option is to include subtree counts. This option is system wide and can only be set on mount or modified through remount from the init namespace. The mount option is ignored on non-init namespace mounts.”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KËhj@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´KÐhjÇubjË)”}”(hXåmemory_recursiveprot Recursively apply memory.min and memory.low protection to entire subtrees, without requiring explicit downward propagation into leaf cgroups. This allows protecting entire subtrees from one another, while retaining free competition within those subtrees. This should have been the default behavior but is a mount-option to avoid regressing setups relying on the original semantics (e.g. specifying bogusly high 'bypass' protection values at higher tree levels). ”h]”(jÑ)”}”(hŒmemory_recursiveprot”h]”hŒmemory_recursiveprot”…””}”(hjah²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´KÚhj]ubjá)”}”(hhh]”hú)”}”(hXÏRecursively apply memory.min and memory.low protection to entire subtrees, without requiring explicit downward propagation into leaf cgroups. This allows protecting entire subtrees from one another, while retaining free competition within those subtrees. This should have been the default behavior but is a mount-option to avoid regressing setups relying on the original semantics (e.g. specifying bogusly high 'bypass' protection values at higher tree levels).”h]”hXÓRecursively apply memory.min and memory.low protection to entire subtrees, without requiring explicit downward propagation into leaf cgroups. This allows protecting entire subtrees from one another, while retaining free competition within those subtrees. This should have been the default behavior but is a mount-option to avoid regressing setups relying on the original semantics (e.g. specifying bogusly high â€˜bypassâ€™ protection values at higher tree levels).”…””}”(hjrh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KÓhjoubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj]ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´KÚhjÇubjË)”}”(hX¢memory_hugetlb_accounting Count HugeTLB memory usage towards the cgroup's overall memory usage for the memory controller (for the purpose of statistics reporting and memory protection). This is a new behavior that could regress existing setups, so it must be explicitly opted in with this mount option. A few caveats to keep in mind: * There is no HugeTLB pool management involved in the memory controller. The pre-allocated pool does not belong to anyone. Specifically, when a new HugeTLB folio is allocated to the pool, it is not accounted for from the perspective of the memory controller. It is only charged to a cgroup when it is actually used (for e.g at page fault time). Host memory overcommit management has to consider this when configuring hard limits. In general, HugeTLB pool management should be done via other mechanisms (such as the HugeTLB controller). * Failure to charge a HugeTLB folio to the memory controller results in SIGBUS. This could happen even if the HugeTLB pool still has pages available (but the cgroup limit is hit and reclaim attempt fails). * Charging HugeTLB memory towards the memory controller affects memory protection and reclaim dynamics. Any userspace tuning (of low, min limits for e.g) needs to take this into account. * HugeTLB pages utilized while this option is not selected will not be tracked by the memory controller (even if cgroup v2 is remounted later on). ”h]”(jÑ)”}”(hŒmemory_hugetlb_accounting”h]”hŒmemory_hugetlb_accounting”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´K÷hjŒubjá)”}”(hhh]”(hú)”}”(hXCount HugeTLB memory usage towards the cgroup's overall memory usage for the memory controller (for the purpose of statistics reporting and memory protection). This is a new behavior that could regress existing setups, so it must be explicitly opted in with this mount option.”h]”hXCount HugeTLB memory usage towards the cgroupâ€™s overall memory usage for the memory controller (for the purpose of statistics reporting and memory protection). This is a new behavior that could regress existing setups, so it must be explicitly opted in with this mount option.”…””}”(hj¡h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KÝhjžubhú)”}”(hŒA few caveats to keep in mind:”h]”hŒA few caveats to keep in mind:”…””}”(hj¯h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KãhjžubhŒbullet_list”“”)”}”(hhh]”(hŒ list_item”“”)”}”(hXThere is no HugeTLB pool management involved in the memory controller. The pre-allocated pool does not belong to anyone. Specifically, when a new HugeTLB folio is allocated to the pool, it is not accounted for from the perspective of the memory controller. It is only charged to a cgroup when it is actually used (for e.g at page fault time). Host memory overcommit management has to consider this when configuring hard limits. In general, HugeTLB pool management should be done via other mechanisms (such as the HugeTLB controller).”h]”hú)”}”(hXThere is no HugeTLB pool management involved in the memory controller. The pre-allocated pool does not belong to anyone. Specifically, when a new HugeTLB folio is allocated to the pool, it is not accounted for from the perspective of the memory controller. It is only charged to a cgroup when it is actually used (for e.g at page fault time). Host memory overcommit management has to consider this when configuring hard limits. In general, HugeTLB pool management should be done via other mechanisms (such as the HugeTLB controller).”h]”hXThere is no HugeTLB pool management involved in the memory controller. The pre-allocated pool does not belong to anyone. Specifically, when a new HugeTLB folio is allocated to the pool, it is not accounted for from the perspective of the memory controller. It is only charged to a cgroup when it is actually used (for e.g at page fault time). Host memory overcommit management has to consider this when configuring hard limits. In general, HugeTLB pool management should be done via other mechanisms (such as the HugeTLB controller).”…””}”(hjÈh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KåhjÄubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¿ubjÃ)”}”(hŒËFailure to charge a HugeTLB folio to the memory controller results in SIGBUS. This could happen even if the HugeTLB pool still has pages available (but the cgroup limit is hit and reclaim attempt fails).”h]”hú)”}”(hŒËFailure to charge a HugeTLB folio to the memory controller results in SIGBUS. This could happen even if the HugeTLB pool still has pages available (but the cgroup limit is hit and reclaim attempt fails).”h]”hŒËFailure to charge a HugeTLB folio to the memory controller results in SIGBUS. This could happen even if the HugeTLB pool still has pages available (but the cgroup limit is hit and reclaim attempt fails).”…””}”(hjàh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KîhjÜubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¿ubjÃ)”}”(hŒ¸Charging HugeTLB memory towards the memory controller affects memory protection and reclaim dynamics. Any userspace tuning (of low, min limits for e.g) needs to take this into account.”h]”hú)”}”(hŒ¸Charging HugeTLB memory towards the memory controller affects memory protection and reclaim dynamics. Any userspace tuning (of low, min limits for e.g) needs to take this into account.”h]”hŒ¸Charging HugeTLB memory towards the memory controller affects memory protection and reclaim dynamics. Any userspace tuning (of low, min limits for e.g) needs to take this into account.”…””}”(hjøh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Kòhjôubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¿ubjÃ)”}”(hŒ‘HugeTLB pages utilized while this option is not selected will not be tracked by the memory controller (even if cgroup v2 is remounted later on). ”h]”hú)”}”(hŒHugeTLB pages utilized while this option is not selected will not be tracked by the memory controller (even if cgroup v2 is remounted later on).”h]”hŒHugeTLB pages utilized while this option is not selected will not be tracked by the memory controller (even if cgroup v2 is remounted later on).”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Kõhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¿ubeh}”(h]”h ]”h"]”h$]”h&]”Œbullet”Œ*”uh1j½h³hÃh´Kåhjžubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjŒubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´K÷hjÇubjË)”}”(hŒñpids_localevents The option restores v1-like behavior of pids.events:max, that is only local (inside cgroup proper) fork failures are counted. Without this option pids.events.max represents any pids.max enforcemnt across cgroup's subtree. ”h]”(jÑ)”}”(hŒpids_localevents”h]”hŒpids_localevents”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Kÿhj8ubjá)”}”(hhh]”hú)”}”(hŒÝThe option restores v1-like behavior of pids.events:max, that is only local (inside cgroup proper) fork failures are counted. Without this option pids.events.max represents any pids.max enforcemnt across cgroup's subtree.”h]”hŒßThe option restores v1-like behavior of pids.events:max, that is only local (inside cgroup proper) fork failures are counted. Without this option pids.events.max represents any pids.max enforcemnt across cgroupâ€™s subtree.”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´KúhjJubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´KÿhjÇubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjÁubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´K»hjJh²hubeh}”(h]”Œmounting”ah ]”h"]”Œmounting”ah$]”h&]”uh1hÄhj9h²hh³hÃh´K”ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Organizing Processes and Threads”h]”hŒ Organizing Processes and Threads”…””}”(hj~h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj{h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Processes”h]”hŒ Processes”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjŒh²hh³hÃh´Mubhú)”}”(hŒInitially, only the root cgroup exists to which all processes belong. A child cgroup can be created by creating a sub-directory::”h]”hŒ€Initially, only the root cgroup exists to which all processes belong. A child cgroup can be created by creating a sub-directory:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjŒh²hubjj)”}”(hŒ# mkdir $CGROUP_NAME”h]”hŒ# mkdir $CGROUP_NAME”…””}”hj«sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M hjŒh²hubhú)”}”(hX†A given cgroup may have multiple child cgroups forming a tree structure. Each cgroup has a read-writable interface file "cgroup.procs". When read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading.”h]”hXŠA given cgroup may have multiple child cgroups forming a tree structure. Each cgroup has a read-writable interface file â€œcgroup.procsâ€. When read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading.”…””}”(hj¹h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjŒh²hubhú)”}”(hXA process can be migrated into a cgroup by writing its PID to the target cgroup's "cgroup.procs" file. Only one process can be migrated on a single write(2) call. If a process is composed of multiple threads, writing the PID of any thread migrates all threads of the process.”h]”hXA process can be migrated into a cgroup by writing its PID to the target cgroupâ€™s â€œcgroup.procsâ€ file. Only one process can be migrated on a single write(2) call. If a process is composed of multiple threads, writing the PID of any thread migrates all threads of the process.”…””}”(hjÇh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjŒh²hubhú)”}”(hXiWhen a process forks a child process, the new process is born into the cgroup that the forking process belongs to at the time of the operation. After exit, a process stays associated with the cgroup that it belonged to at the time of exit until it's reaped; however, a zombie process does not appear in "cgroup.procs" and thus can't be moved to another cgroup.”h]”hXqWhen a process forks a child process, the new process is born into the cgroup that the forking process belongs to at the time of the operation. After exit, a process stays associated with the cgroup that it belonged to at the time of exit until itâ€™s reaped; however, a zombie process does not appear in â€œcgroup.procsâ€ and thus canâ€™t be moved to another cgroup.”…””}”(hjÕh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjŒh²hubhú)”}”(hŒðA cgroup which doesn't have any children or live processes can be destroyed by removing the directory. Note that a cgroup which doesn't have any children and is associated only with zombie processes is considered empty and can be removed::”h]”hŒóA cgroup which doesnâ€™t have any children or live processes can be destroyed by removing the directory. Note that a cgroup which doesnâ€™t have any children and is associated only with zombie processes is considered empty and can be removed:”…””}”(hjãh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjŒh²hubjj)”}”(hŒ# rmdir $CGROUP_NAME”h]”hŒ# rmdir $CGROUP_NAME”…””}”hjñsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M%hjŒh²hubhú)”}”(hŒß"/proc/$PID/cgroup" lists a process's cgroup membership. If legacy cgroup is in use in the system, this file may contain multiple lines, one for each hierarchy. The entry for cgroup v2 is always in the format "0::$PATH"::”h]”hŒèâ€œ/proc/$PID/cgroupâ€ lists a processâ€™s cgroup membership. If legacy cgroup is in use in the system, this file may contain multiple lines, one for each hierarchy. The entry for cgroup v2 is always in the format â€œ0::$PATHâ€:”…””}”(hjÿh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M'hjŒh²hubjj)”}”(hŒ=# cat /proc/842/cgroup ... 0::/test-cgroup/test-cgroup-nested”h]”hŒ=# cat /proc/842/cgroup ... 0::/test-cgroup/test-cgroup-nested”…””}”hj sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M,hjŒh²hubhú)”}”(hŒ…If the process becomes a zombie and the cgroup it was associated with is removed subsequently, " (deleted)" is appended to the path::”h]”hŒˆIf the process becomes a zombie and the cgroup it was associated with is removed subsequently, â€œ (deleted)â€ is appended to the path:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M0hjŒh²hubjj)”}”(hŒG# cat /proc/842/cgroup ... 0::/test-cgroup/test-cgroup-nested (deleted)”h]”hŒG# cat /proc/842/cgroup ... 0::/test-cgroup/test-cgroup-nested (deleted)”…””}”hj)sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M3hjŒh²hubeh}”(h]”Œ processes”ah ]”h"]”Œ processes”ah$]”h&]”uh1hÄhj{h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒThreads”h]”hŒThreads”…””}”(hjBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj?h²hh³hÃh´M9ubhú)”}”(hXácgroup v2 supports thread granularity for a subset of controllers to support use cases requiring hierarchical resource distribution across the threads of a group of processes. By default, all threads of a process belong to the same cgroup, which also serves as the resource domain to host resource consumptions which are not specific to a process or thread. The thread mode allows threads to be spread across a subtree while still maintaining the common resource domain for them.”h]”hXácgroup v2 supports thread granularity for a subset of controllers to support use cases requiring hierarchical resource distribution across the threads of a group of processes. By default, all threads of a process belong to the same cgroup, which also serves as the resource domain to host resource consumptions which are not specific to a process or thread. The thread mode allows threads to be spread across a subtree while still maintaining the common resource domain for them.”…””}”(hjPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M;hj?h²hubhú)”}”(hŒzControllers which support thread mode are called threaded controllers. The ones which don't are called domain controllers.”h]”hŒ|Controllers which support thread mode are called threaded controllers. The ones which donâ€™t are called domain controllers.”…””}”(hj^h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MChj?h²hubhú)”}”(hX‰Marking a cgroup threaded makes it join the resource domain of its parent as a threaded cgroup. The parent may be another threaded cgroup whose resource domain is further up in the hierarchy. The root of a threaded subtree, that is, the nearest ancestor which is not threaded, is called threaded domain or thread root interchangeably and serves as the resource domain for the entire subtree.”h]”hX‰Marking a cgroup threaded makes it join the resource domain of its parent as a threaded cgroup. The parent may be another threaded cgroup whose resource domain is further up in the hierarchy. The root of a threaded subtree, that is, the nearest ancestor which is not threaded, is called threaded domain or thread root interchangeably and serves as the resource domain for the entire subtree.”…””}”(hjlh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MFhj?h²hubhú)”}”(hŒíInside a threaded subtree, threads of a process can be put in different cgroups and are not subject to the no internal process constraint - threaded controllers can be enabled on non-leaf cgroups whether they have threads in them or not.”h]”hŒíInside a threaded subtree, threads of a process can be put in different cgroups and are not subject to the no internal process constraint - threaded controllers can be enabled on non-leaf cgroups whether they have threads in them or not.”…””}”(hjzh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MMhj?h²hubhú)”}”(hX‰As the threaded domain cgroup hosts all the domain resource consumptions of the subtree, it is considered to have internal resource consumptions whether there are processes in it or not and can't have populated child cgroups which aren't threaded. Because the root cgroup is not subject to no internal process constraint, it can serve both as a threaded domain and a parent to domain cgroups.”h]”hXAs the threaded domain cgroup hosts all the domain resource consumptions of the subtree, it is considered to have internal resource consumptions whether there are processes in it or not and canâ€™t have populated child cgroups which arenâ€™t threaded. Because the root cgroup is not subject to no internal process constraint, it can serve both as a threaded domain and a parent to domain cgroups.”…””}”(hjˆh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MRhj?h²hubhú)”}”(hŒßThe current operation mode or type of the cgroup is shown in the "cgroup.type" file which indicates whether the cgroup is a normal domain, a domain which is serving as the domain of a threaded subtree, or a threaded cgroup.”h]”hŒãThe current operation mode or type of the cgroup is shown in the â€œcgroup.typeâ€ file which indicates whether the cgroup is a normal domain, a domain which is serving as the domain of a threaded subtree, or a threaded cgroup.”…””}”(hj–h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MYhj?h²hubhú)”}”(hŒžOn creation, a cgroup is always a domain cgroup and can be made threaded by writing "threaded" to the "cgroup.type" file. The operation is single direction::”h]”hŒ¥On creation, a cgroup is always a domain cgroup and can be made threaded by writing â€œthreadedâ€ to the â€œcgroup.typeâ€ file. The operation is single direction:”…””}”(hj¤h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M^hj?h²hubjj)”}”(hŒ# echo threaded > cgroup.type”h]”hŒ# echo threaded > cgroup.type”…””}”hj²sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mbhj?h²hubhú)”}”(hŒyOnce threaded, the cgroup can't be made a domain again. To enable the thread mode, the following conditions must be met.”h]”hŒ{Once threaded, the cgroup canâ€™t be made a domain again. To enable the thread mode, the following conditions must be met.”…””}”(hjÀh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mdhj?h²hubj¾)”}”(hhh]”(jÃ)”}”(hŒAs the cgroup will join the parent's resource domain. The parent must either be a valid (threaded) domain or a threaded cgroup. ”h]”hú)”}”(hŒ€As the cgroup will join the parent's resource domain. The parent must either be a valid (threaded) domain or a threaded cgroup.”h]”hŒ‚As the cgroup will join the parentâ€™s resource domain. The parent must either be a valid (threaded) domain or a threaded cgroup.”…””}”(hjÕh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MghjÑubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÎh²hh³hÃh´NubjÃ)”}”(hŒ¢When the parent is an unthreaded domain, it must not have any domain controllers enabled or populated domain children. The root is exempt from this requirement. ”h]”hú)”}”(hŒ¡When the parent is an unthreaded domain, it must not have any domain controllers enabled or populated domain children. The root is exempt from this requirement.”h]”hŒ¡When the parent is an unthreaded domain, it must not have any domain controllers enabled or populated domain children. The root is exempt from this requirement.”…””}”(hjíh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mjhjéubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÎh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*Œ-”uh1j½h³hÃh´Mghj?h²hubhú)”}”(hŒ]Topology-wise, a cgroup can be in an invalid state. Please consider the following topology::”h]”hŒ\Topology-wise, a cgroup can be in an invalid state. Please consider the following topology:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mnhj?h²hubjj)”}”(hŒ=A (threaded domain) - B (threaded) - C (domain, just created)”h]”hŒ=A (threaded domain) - B (threaded) - C (domain, just created)”…””}”hjsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mqhj?h²hubhú)”}”(hX!C is created as a domain but isn't connected to a parent which can host child domains. C can't be used until it is turned into a threaded cgroup. "cgroup.type" file will report "domain (invalid)" in these cases. Operations which fail due to invalid topology use EOPNOTSUPP as the errno.”h]”hX-C is created as a domain but isnâ€™t connected to a parent which can host child domains. C canâ€™t be used until it is turned into a threaded cgroup. â€œcgroup.typeâ€ file will report â€œdomain (invalid)â€ in these cases. Operations which fail due to invalid topology use EOPNOTSUPP as the errno.”…””}”(hj$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mshj?h²hubhú)”}”(hXA domain cgroup is turned into a threaded domain when one of its child cgroup becomes threaded or threaded controllers are enabled in the "cgroup.subtree_control" file while there are processes in the cgroup. A threaded domain reverts to a normal domain when the conditions clear.”h]”hXA domain cgroup is turned into a threaded domain when one of its child cgroup becomes threaded or threaded controllers are enabled in the â€œcgroup.subtree_controlâ€ file while there are processes in the cgroup. A threaded domain reverts to a normal domain when the conditions clear.”…””}”(hj2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Myhj?h²hubhú)”}”(hX¡When read, "cgroup.threads" contains the list of the thread IDs of all threads in the cgroup. Except that the operations are per-thread instead of per-process, "cgroup.threads" has the same format and behaves the same way as "cgroup.procs". While "cgroup.threads" can be written to in any cgroup, as it can only move threads inside the same threaded domain, its operations are confined inside each threaded subtree.”h]”hX±When read, â€œcgroup.threadsâ€ contains the list of the thread IDs of all threads in the cgroup. Except that the operations are per-thread instead of per-process, â€œcgroup.threadsâ€ has the same format and behaves the same way as â€œcgroup.procsâ€. While â€œcgroup.threadsâ€ can be written to in any cgroup, as it can only move threads inside the same threaded domain, its operations are confined inside each threaded subtree.”…””}”(hj@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj?h²hubhú)”}”(hXÞThe threaded domain cgroup serves as the resource domain for the whole subtree, and, while the threads can be scattered across the subtree, all the processes are considered to be in the threaded domain cgroup. "cgroup.procs" in a threaded domain cgroup contains the PIDs of all processes in the subtree and is not readable in the subtree proper. However, "cgroup.procs" can be written to from anywhere in the subtree to migrate all threads of the matching process to the cgroup.”h]”hXæThe threaded domain cgroup serves as the resource domain for the whole subtree, and, while the threads can be scattered across the subtree, all the processes are considered to be in the threaded domain cgroup. â€œcgroup.procsâ€ in a threaded domain cgroup contains the PIDs of all processes in the subtree and is not readable in the subtree proper. However, â€œcgroup.procsâ€ can be written to from anywhere in the subtree to migrate all threads of the matching process to the cgroup.”…””}”(hjNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‡hj?h²hubhú)”}”(hXWOnly threaded controllers can be enabled in a threaded subtree. When a threaded controller is enabled inside a threaded subtree, it only accounts for and controls resource consumptions associated with the threads in the cgroup and its descendants. All consumptions which aren't tied to a specific thread belong to the threaded domain cgroup.”h]”hXYOnly threaded controllers can be enabled in a threaded subtree. When a threaded controller is enabled inside a threaded subtree, it only accounts for and controls resource consumptions associated with the threads in the cgroup and its descendants. All consumptions which arenâ€™t tied to a specific thread belong to the threaded domain cgroup.”…””}”(hj\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj?h²hubhú)”}”(hXBecause a threaded subtree is exempt from no internal process constraint, a threaded controller must be able to handle competition between threads in a non-leaf cgroup and its child cgroups. Each threaded controller defines how such competitions are handled.”h]”hXBecause a threaded subtree is exempt from no internal process constraint, a threaded controller must be able to handle competition between threads in a non-leaf cgroup and its child cgroups. Each threaded controller defines how such competitions are handled.”…””}”(hjjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M•hj?h²hubhú)”}”(hŒ[Currently, the following controllers are threaded and can be enabled in a threaded cgroup::”h]”hŒZCurrently, the following controllers are threaded and can be enabled in a threaded cgroup:”…””}”(hjxh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mšhj?h²hubjj)”}”(hŒ"- cpu - cpuset - perf_event - pids”h]”hŒ"- cpu - cpuset - perf_event - pids”…””}”hj†sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mhj?h²hubeh}”(h]”Œthreads”ah ]”h"]”Œthreads”ah$]”h&]”uh1hÄhj{h²hh³hÃh´M9ubeh}”(h]”Œ organizing-processes-and-threads”ah ]”h"]”Œ organizing processes and threads”ah$]”h&]”uh1hÄhj9h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒ[Un]populated Notification”h]”hŒ[Un]populated Notification”…””}”(hj§h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj¤h²hh³hÃh´M£ubhú)”}”(hXlEach non-root cgroup has a "cgroup.events" file which contains "populated" field indicating whether the cgroup's sub-hierarchy has live processes in it. Its value is 0 if there is no live process in the cgroup and its descendants; otherwise, 1. poll and [id]notify events are triggered when the value changes. This can be used, for example, to start a clean-up operation after all processes of a given sub-hierarchy have exited. The populated state updates and notifications are recursive. Consider the following sub-hierarchy where the numbers in the parentheses represent the numbers of processes in each cgroup::”h]”hXuEach non-root cgroup has a â€œcgroup.eventsâ€ file which contains â€œpopulatedâ€ field indicating whether the cgroupâ€™s sub-hierarchy has live processes in it. Its value is 0 if there is no live process in the cgroup and its descendants; otherwise, 1. poll and [id]notify events are triggered when the value changes. This can be used, for example, to start a clean-up operation after all processes of a given sub-hierarchy have exited. The populated state updates and notifications are recursive. Consider the following sub-hierarchy where the numbers in the parentheses represent the numbers of processes in each cgroup:”…””}”(hjµh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¥hj¤h²hubjj)”}”(hŒ%A(4) - B(0) - C(1) \ D(0)”h]”hŒ%A(4) - B(0) - C(1) \ D(0)”…””}”hjÃsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M°hj¤h²hubhú)”}”(hŒâA, B and C's "populated" fields would be 1 while D's 0. After the one process in C exits, B and C's "populated" fields would flip to "0" and file modified events will be generated on the "cgroup.events" files of both cgroups.”h]”hŒøA, B and Câ€™s â€œpopulatedâ€ fields would be 1 while Dâ€™s 0. After the one process in C exits, B and Câ€™s â€œpopulatedâ€ fields would flip to â€œ0â€ and file modified events will be generated on the â€œcgroup.eventsâ€ files of both cgroups.”…””}”(hjÑh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³hj¤h²hubeh}”(h]”Œun-populated-notification”ah ]”h"]”Œ[un]populated notification”ah$]”h&]”uh1hÄhj9h²hh³hÃh´M£ubhÅ)”}”(hhh]”(hÊ)”}”(hŒControlling Controllers”h]”hŒControlling Controllers”…””}”(hjêh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjçh²hh³hÃh´MºubhÅ)”}”(hhh]”(hÊ)”}”(hŒAvailability”h]”hŒAvailability”…””}”(hjûh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjøh²hh³hÃh´M½ubhú)”}”(hXyA controller is available in a cgroup when it is supported by the kernel (i.e., compiled in, not disabled and not attached to a v1 hierarchy) and listed in the "cgroup.controllers" file. Availability means the controller's interface files are exposed in the cgroupâ€™s directory, allowing the distribution of the target resource to be observed or controlled within that cgroup.”h]”hXA controller is available in a cgroup when it is supported by the kernel (i.e., compiled in, not disabled and not attached to a v1 hierarchy) and listed in the â€œcgroup.controllersâ€ file. Availability means the controllerâ€™s interface files are exposed in the cgroupâ€™s directory, allowing the distribution of the target resource to be observed or controlled within that cgroup.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¿hjøh²hubeh}”(h]”Œavailability”ah ]”h"]”Œavailability”ah$]”h&]”uh1hÄhjçh²hh³hÃh´M½ubhÅ)”}”(hhh]”(hÊ)”}”(hŒEnabling and Disabling”h]”hŒEnabling and Disabling”…””}”(hj"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjh²hh³hÃh´MÆubhú)”}”(hŒlEach cgroup has a "cgroup.controllers" file which lists all controllers available for the cgroup to enable::”h]”hŒoEach cgroup has a â€œcgroup.controllersâ€ file which lists all controllers available for the cgroup to enable:”…””}”(hj0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÈhjh²hubjj)”}”(hŒ&# cat cgroup.controllers cpu io memory”h]”hŒ&# cat cgroup.controllers cpu io memory”…””}”hj>sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MËhjh²hubhú)”}”(hŒNo controller is enabled by default. Controllers can be enabled and disabled by writing to the "cgroup.subtree_control" file::”h]”hŒ‚No controller is enabled by default. Controllers can be enabled and disabled by writing to the â€œcgroup.subtree_controlâ€ file:”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÎhjh²hubjj)”}”(hŒ2# echo "+cpu +memory -io" > cgroup.subtree_control”h]”hŒ2# echo "+cpu +memory -io" > cgroup.subtree_control”…””}”hjZsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÑhjh²hubhú)”}”(hŒõOnly controllers which are listed in "cgroup.controllers" can be enabled. When multiple operations are specified as above, either they all succeed or fail. If multiple operations on the same controller are specified, the last one is effective.”h]”hŒùOnly controllers which are listed in â€œcgroup.controllersâ€ can be enabled. When multiple operations are specified as above, either they all succeed or fail. If multiple operations on the same controller are specified, the last one is effective.”…””}”(hjhh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÓhjh²hubhú)”}”(hŒåEnabling a controller in a cgroup indicates that the distribution of the target resource across its immediate children will be controlled. Consider the following sub-hierarchy. The enabled controllers are listed in parentheses::”h]”hŒäEnabling a controller in a cgroup indicates that the distribution of the target resource across its immediate children will be controlled. Consider the following sub-hierarchy. The enabled controllers are listed in parentheses:”…””}”(hjvh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MØhjh²hubjj)”}”(hŒ?A(cpu,memory) - B(memory) - C() \ D()”h]”hŒ?A(cpu,memory) - B(memory) - C() \ D()”…””}”hj„sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÝhjh²hubhú)”}”(hXAs A has "cpu" and "memory" enabled, A will control the distribution of CPU cycles and memory to its children, in this case, B. As B has "memory" enabled but not "CPU", C and D will compete freely on CPU cycles but their division of memory available to B will be controlled.”h]”hX#As A has â€œcpuâ€ and â€œmemoryâ€ enabled, A will control the distribution of CPU cycles and memory to its children, in this case, B. As B has â€œmemoryâ€ enabled but not â€œCPUâ€, C and D will compete freely on CPU cycles but their division of memory available to B will be controlled.”…””}”(hj’h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Màhjh²hubhú)”}”(hX As a controller regulates the distribution of the target resource to the cgroup's children, enabling it creates the controller's interface files in the child cgroups. In the above example, enabling "cpu" on B would create the "cpu." prefixed controller interface files in C and D. Likewise, disabling "memory" from B would remove the "memory." prefixed controller interface files from C and D. This means that the controller interface files - anything which doesn't start with "cgroup." are owned by the parent rather than the cgroup itself.”h]”hX:As a controller regulates the distribution of the target resource to the cgroupâ€™s children, enabling it creates the controllerâ€™s interface files in the child cgroups. In the above example, enabling â€œcpuâ€ on B would create the â€œcpu.â€ prefixed controller interface files in C and D. Likewise, disabling â€œmemoryâ€ from B would remove the â€œmemory.â€ prefixed controller interface files from C and D. This means that the controller interface files - anything which doesnâ€™t start with â€œcgroup.â€ are owned by the parent rather than the cgroup itself.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Måhjh²hubeh}”(h]”Œenabling-and-disabling”ah ]”h"]”Œenabling and disabling”ah$]”h&]”uh1hÄhjçh²hh³hÃh´MÆubhÅ)”}”(hhh]”(hÊ)”}”(hŒTop-down Constraint”h]”hŒTop-down Constraint”…””}”(hj¹h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj¶h²hh³hÃh´Mðubhú)”}”(hXÄResources are distributed top-down and a cgroup can further distribute a resource only if the resource has been distributed to it from the parent. This means that all non-root "cgroup.subtree_control" files can only contain controllers which are enabled in the parent's "cgroup.subtree_control" file. A controller can be enabled only if the parent has the controller enabled and a controller can't be disabled if one or more children have it enabled.”h]”hXÐResources are distributed top-down and a cgroup can further distribute a resource only if the resource has been distributed to it from the parent. This means that all non-root â€œcgroup.subtree_controlâ€ files can only contain controllers which are enabled in the parentâ€™s â€œcgroup.subtree_controlâ€ file. A controller can be enabled only if the parent has the controller enabled and a controller canâ€™t be disabled if one or more children have it enabled.”…””}”(hjÇh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mòhj¶h²hubeh}”(h]”Œtop-down-constraint”ah ]”h"]”Œtop-down constraint”ah$]”h&]”uh1hÄhjçh²hh³hÃh´MðubhÅ)”}”(hhh]”(hÊ)”}”(hŒNo Internal Process Constraint”h]”hŒNo Internal Process Constraint”…””}”(hjàh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÝh²hh³hÃh´Müubhú)”}”(hXNon-root cgroups can distribute domain resources to their children only when they don't have any processes of their own. In other words, only domain cgroups which don't contain any processes can have domain controllers enabled in their "cgroup.subtree_control" files.”h]”hXNon-root cgroups can distribute domain resources to their children only when they donâ€™t have any processes of their own. In other words, only domain cgroups which donâ€™t contain any processes can have domain controllers enabled in their â€œcgroup.subtree_controlâ€ files.”…””}”(hjîh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MþhjÝh²hubhú)”}”(hŒöThis guarantees that, when a domain controller is looking at the part of the hierarchy which has it enabled, processes are always only on the leaves. This rules out situations where child cgroups compete against internal processes of the parent.”h]”hŒöThis guarantees that, when a domain controller is looking at the part of the hierarchy which has it enabled, processes are always only on the leaves. This rules out situations where child cgroups compete against internal processes of the parent.”…””}”(hjüh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÝh²hubhú)”}”(hXœThe root cgroup is exempt from this restriction. Root contains processes and anonymous resource consumption which can't be associated with any other cgroups and requires special treatment from most controllers. How resource consumption in the root cgroup is governed is up to each controller (for more information on this topic please refer to the Non-normative information section in the Controllers chapter).”h]”hXžThe root cgroup is exempt from this restriction. Root contains processes and anonymous resource consumption which canâ€™t be associated with any other cgroups and requires special treatment from most controllers. How resource consumption in the root cgroup is governed is up to each controller (for more information on this topic please refer to the Non-normative information section in the Controllers chapter).”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÝh²hubhú)”}”(hXžNote that the restriction doesn't get in the way if there is no enabled controller in the cgroup's "cgroup.subtree_control". This is important as otherwise it wouldn't be possible to create children of a populated cgroup. To control resource distribution of a cgroup, the cgroup must create children and transfer all its processes to the children before enabling controllers in its "cgroup.subtree_control" file.”•h]”hX¬Note that the restriction doesnâ€™t get in the way if there is no enabled controller in the cgroupâ€™s â€œcgroup.subtree_controlâ€. This is important as otherwise it wouldnâ€™t be possible to create children of a populated cgroup. To control resource distribution of a cgroup, the cgroup must create children and transfer all its processes to the children before enabling controllers in its â€œcgroup.subtree_controlâ€ file.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÝh²hubeh}”(h]”Œno-internal-process-constraint”ah ]”h"]”Œno internal process constraint”ah$]”h&]”uh1hÄhjçh²hh³hÃh´Müubeh}”(h]”Œcontrolling-controllers”ah ]”h"]”Œcontrolling controllers”ah$]”h&]”uh1hÄhj9h²hh³hÃh´MºubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Delegation”h]”hŒ Delegation”…””}”(hj9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj6h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒModel of Delegation”h]”hŒModel of Delegation”…””}”(hjJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjGh²hh³hÃh´Mubhú)”}”(hX7A cgroup can be delegated in two ways. First, to a less privileged user by granting write access of the directory and its "cgroup.procs", "cgroup.threads" and "cgroup.subtree_control" files to the user. Second, if the "nsdelegate" mount option is set, automatically to a cgroup namespace on namespace creation.”h]”hXGA cgroup can be delegated in two ways. First, to a less privileged user by granting write access of the directory and its â€œcgroup.procsâ€, â€œcgroup.threadsâ€ and â€œcgroup.subtree_controlâ€ files to the user. Second, if the â€œnsdelegateâ€ mount option is set, automatically to a cgroup namespace on namespace creation.”…””}”(hjXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjGh²hubhú)”}”(hXdBecause the resource control interface files in a given directory control the distribution of the parent's resources, the delegatee shouldn't be allowed to write to them. For the first method, this is achieved by not granting access to these files. For the second, files outside the namespace should be hidden from the delegatee by the means of at least mount namespacing, and the kernel rejects writes to all files on a namespace root from inside the cgroup namespace, except for those files listed in "/sys/kernel/cgroup/delegate" (including "cgroup.procs", "cgroup.threads", "cgroup.subtree_control", etc.).”h]”hXxBecause the resource control interface files in a given directory control the distribution of the parentâ€™s resources, the delegatee shouldnâ€™t be allowed to write to them. For the first method, this is achieved by not granting access to these files. For the second, files outside the namespace should be hidden from the delegatee by the means of at least mount namespacing, and the kernel rejects writes to all files on a namespace root from inside the cgroup namespace, except for those files listed in â€œ/sys/kernel/cgroup/delegateâ€ (including â€œcgroup.procsâ€, â€œcgroup.threadsâ€, â€œcgroup.subtree_controlâ€, etc.).”…””}”(hjfh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M%hjGh²hubhú)”}”(hX½The end results are equivalent for both delegation types. Once delegated, the user can build sub-hierarchy under the directory, organize processes inside it as it sees fit and further distribute the resources it received from the parent. The limits and other settings of all resource controllers are hierarchical and regardless of what happens in the delegated sub-hierarchy, nothing can escape the resource restrictions imposed by the parent.”h]”hX½The end results are equivalent for both delegation types. Once delegated, the user can build sub-hierarchy under the directory, organize processes inside it as it sees fit and further distribute the resources it received from the parent. The limits and other settings of all resource controllers are hierarchical and regardless of what happens in the delegated sub-hierarchy, nothing can escape the resource restrictions imposed by the parent.”…””}”(hjth²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M/hjGh²hubhú)”}”(hŒ³Currently, cgroup doesn't impose any restrictions on the number of cgroups in or nesting depth of a delegated sub-hierarchy; however, this may be limited explicitly in the future.”h]”hŒµCurrently, cgroup doesnâ€™t impose any restrictions on the number of cgroups in or nesting depth of a delegated sub-hierarchy; however, this may be limited explicitly in the future.”…””}”(hj‚h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M7hjGh²hubeh}”(h]”Œmodel-of-delegation”ah ]”h"]”Œmodel of delegation”ah$]”h&]”uh1hÄhj6h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒDelegation Containment”h]”hŒDelegation Containment”…””}”(hj›h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj˜h²hh³hÃh´M=ubhú)”}”(hŒ„A delegated sub-hierarchy is contained in the sense that processes can't be moved into or out of the sub-hierarchy by the delegatee.”h]”hŒ†A delegated sub-hierarchy is contained in the sense that processes canâ€™t be moved into or out of the sub-hierarchy by the delegatee.”…””}”(hj©h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M?hj˜h²hubhú)”}”(hŒÝFor delegations to a less privileged user, this is achieved by requiring the following conditions for a process with a non-root euid to migrate a target process into a cgroup by writing its PID to the "cgroup.procs" file.”h]”hŒáFor delegations to a less privileged user, this is achieved by requiring the following conditions for a process with a non-root euid to migrate a target process into a cgroup by writing its PID to the â€œcgroup.procsâ€ file.”…””}”(hj·h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MBhj˜h²hubj¾)”}”(hhh]”(jÃ)”}”(hŒ>The writer must have write access to the "cgroup.procs" file. ”h]”hú)”}”(hŒ=The writer must have write access to the "cgroup.procs" file.”h]”hŒAThe writer must have write access to the â€œcgroup.procsâ€ file.”…””}”(hjÌh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MGhjÈubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÅh²hh³hÃh´NubjÃ)”}”(hŒ{The writer must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. ”h]”hú)”}”(hŒzThe writer must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups.”h]”hŒ~The writer must have write access to the â€œcgroup.procsâ€ file of the common ancestor of the source and destination cgroups.”…””}”(hjäh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MIhjàubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÅh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´MGhj˜h²hubhú)”}”(hŒºThe above two constraints ensure that while a delegatee may migrate processes around freely in the delegated sub-hierarchy it can't pull in from or push out to outside the sub-hierarchy.”h]”hŒ¼The above two constraints ensure that while a delegatee may migrate processes around freely in the delegated sub-hierarchy it canâ€™t pull in from or push out to outside the sub-hierarchy.”…””}”(hjþh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MLhj˜h²hubhú)”}”(hŒ¸For an example, let's assume cgroups C0 and C1 have been delegated to user U0 who created C00, C01 under C0 and C10 under C1 as follows and all processes under C0 and C1 belong to U0::”h]”hŒ¹For an example, letâ€™s assume cgroups C0 and C1 have been delegated to user U0 who created C00, C01 under C0 and C10 under C1 as follows and all processes under C0 and C1 belong to U0:”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MPhj˜h²hubjj)”}”(hŒX~~~~~~~~~~~~~ - C0 - C00 ~ cgroup ~ \ C01 ~ hierarchy ~ ~~~~~~~~~~~~~ - C1 - C10”h]”hŒX~~~~~~~~~~~~~ - C0 - C00 ~ cgroup ~ \ C01 ~ hierarchy ~ ~~~~~~~~~~~~~ - C1 - C10”…””}”hj sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MThj˜h²hubhú)”}”(hXpLet's also say U0 wants to write the PID of a process which is currently in C10 into "C00/cgroup.procs". U0 has write access to the file; however, the common ancestor of the source cgroup C10 and the destination cgroup C00 is above the points of delegation and U0 would not have write access to its "cgroup.procs" files and thus the write will be denied with -EACCES.”h]”hXzLetâ€™s also say U0 wants to write the PID of a process which is currently in C10 into â€œC00/cgroup.procsâ€. U0 has write access to the file; however, the common ancestor of the source cgroup C10 and the destination cgroup C00 is above the points of delegation and U0 would not have write access to its â€œcgroup.procsâ€ files and thus the write will be denied with -EACCES.”…””}”(hj( h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MYhj˜h²hubhú)”}”(hXFor delegations to namespaces, containment is achieved by requiring that both the source and destination cgroups are reachable from the namespace of the process which is attempting the migration. If either is not reachable, the migration is rejected with -ENOENT.”h]”hXFor delegations to namespaces, containment is achieved by requiring that both the source and destination cgroups are reachable from the namespace of the process which is attempting the migration. If either is not reachable, the migration is rejected with -ENOENT.”…””}”(hj6 h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M`hj˜h²hubeh}”(h]”Œdelegation-containment”ah ]”h"]”Œdelegation containment”ah$]”h&]”uh1hÄhj6h²hh³hÃh´M=ubeh}”(h]”Œ delegation”ah ]”h"]”Œ delegation”ah$]”h&]”uh1hÄhj9h²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Guidelines”h]”hŒ Guidelines”…””}”(hjW h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjT h²hh³hÃh´MgubhÅ)”}”(hhh]”(hÊ)”}”(hŒOrganize Once and Control”h]”hŒOrganize Once and Control”…””}”(hjh h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhje h²hh³hÃh´Mjubhú)”}”(hX-Migrating a process across cgroups is a relatively expensive operation and stateful resources such as memory are not moved together with the process. This is an explicit design decision as there often exist inherent trade-offs between migration and various hot paths in terms of synchronization cost.”h]”hX-Migrating a process across cgroups is a relatively expensive operation and stateful resources such as memory are not moved together with the process. This is an explicit design decision as there often exist inherent trade-offs between migration and various hot paths in terms of synchronization cost.”…””}”(hjv h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mlhje h²hubhú)”}”(hXlAs such, migrating processes across cgroups frequently as a means to apply different resource restrictions is discouraged. A workload should be assigned to a cgroup according to the system's logical and resource structure once on start-up. Dynamic adjustments to resource distribution can be made by changing controller configuration through the interface files.”h]”hXnAs such, migrating processes across cgroups frequently as a means to apply different resource restrictions is discouraged. A workload should be assigned to a cgroup according to the systemâ€™s logical and resource structure once on start-up. Dynamic adjustments to resource distribution can be made by changing controller configuration through the interface files.”…””}”(hj„ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mrhje h²hubeh}”(h]”Œorganize-once-and-control”ah ]”h"]”Œorganize once and control”ah$]”h&]”uh1hÄhjT h²hh³hÃh´MjubhÅ)”}”(hhh]”(hÊ)”}”(hŒAvoid Name Collisions”h]”hŒAvoid Name Collisions”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjš h²hh³hÃh´M{ubhú)”}”(hŒ¡Interface files for a cgroup and its children cgroups occupy the same directory and it is possible to create children cgroups which collide with interface files.”h]”hŒ¡Interface files for a cgroup and its children cgroups occupy the same directory and it is possible to create children cgroups which collide with interface files.”…””}”(hj« h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M}hjš h²hubhú)”}”(hXÌAll cgroup core interface files are prefixed with "cgroup." and each controller's interface files are prefixed with the controller name and a dot. A controller's name is composed of lower case alphabets and '_'s but never begins with an '_' so it can be used as the prefix character for collision avoidance. Also, interface file names won't start or end with terms which are often used in categorizing workloads such as job, service, slice, unit or workload.”h]”hXÞAll cgroup core interface files are prefixed with â€œcgroup.â€ and each controllerâ€™s interface files are prefixed with the controller name and a dot. A controllerâ€™s name is composed of lower case alphabets and â€˜_â€™s but never begins with an â€˜_â€™ so it can be used as the prefix character for collision avoidance. Also, interface file names wonâ€™t start or end with terms which are often used in categorizing workloads such as job, service, slice, unit or workload.”…””}”(hj¹ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjš h²hubhú)”}”(hŒgcgroup doesn't do anything to prevent name collisions and it's the user's responsibility to avoid them.”h]”hŒmcgroup doesnâ€™t do anything to prevent name collisions and itâ€™s the userâ€™s responsibility to avoid them.”…””}”(hjÇ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‰hjš h²hubeh}”(h]”Œavoid-name-collisions”ah ]”h"]”Œavoid name collisions”ah$]”h&]”uh1hÄhjT h²hh³hÃh´M{ubeh}”(h]”Œ guidelines”ah ]”h"]”Œ guidelines”ah$]”h&]”uh1hÄhj9h²hh³hÃh´Mgubeh}”(h]”Œbasic-operations”ah ]”h"]”Œbasic operations”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´K‘ubhÅ)”}”(hhh]”(hÊ)”}”(hŒResource Distribution Models”h]”hŒResource Distribution Models”…””}”(hjð h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjí h²hh³hÃh´MŽubhú)”}”(hŒËcgroup controllers implement several resource distribution schemes depending on the resource type and expected use cases. This section describes major schemes in use along with their expected behaviors.”h]”hŒËcgroup controllers implement several resource distribution schemes depending on the resource type and expected use cases. This section describes major schemes in use along with their expected behaviors.”…””}”(hjþ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjí h²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒWeights”h]”hŒWeights”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj h²hh³hÃh´M–ubhú)”}”(hXnA parent's resource is distributed by adding up the weights of all active children and giving each the fraction matching the ratio of its weight against the sum. As only children which can make use of the resource at the moment participate in the distribution, this is work-conserving. Due to the dynamic nature, this model is usually used for stateless resources.”h]”hXpA parentâ€™s resource is distributed by adding up the weights of all active children and giving each the fraction matching the ratio of its weight against the sum. As only children which can make use of the resource at the moment participate in the distribution, this is work-conserving. Due to the dynamic nature, this model is usually used for stateless resources.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M˜hj h²hubhú)”}”(hŒÁAll weights are in the range [1, 10000] with the default at 100. This allows symmetric multiplicative biases in both directions at fine enough granularity while staying in the intuitive range.”h]”hŒÁAll weights are in the range [1, 10000] with the default at 100. This allows symmetric multiplicative biases in both directions at fine enough granularity while staying in the intuitive range.”…””}”(hj+ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŸhj h²hubhú)”}”(hŒ™As long as the weight is in range, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”h]”hŒ™As long as the weight is in range, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”…””}”(hj9 h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M£hj h²hubhú)”}”(hŒe"cpu.weight" proportionally distributes CPU cycles to active children and is an example of this type.”h]”hŒiâ€œcpu.weightâ€ proportionally distributes CPU cycles to active children and is an example of this type.”…””}”(hjG h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M§hj h²hubh¶)”}”(hŒ .. _cgroupv2-limits-distributor:”h]”h}”(h]”h ]”h"]”h$]”h&]”hÁŒcgroupv2-limits-distributor”uh1hµh´M«hj h²hh³hÃubeh}”(h]”Œweights”ah ]”h"]”Œweights”ah$]”h&]”uh1hÄhjí h²hh³hÃh´M–ubhÅ)”}”(hhh]”(hÊ)”}”(hŒLimits”h]”hŒLimits”…””}”(hjk h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjh h²hh³hÃh´M®ubhú)”}”(hŒÁA child can only consume up to the configured amount of the resource. Limits can be over-committed - the sum of the limits of children can exceed the amount of resource available to the parent.”h]”hŒÁA child can only consume up to the configured amount of the resource. Limits can be over-committed - the sum of the limits of children can exceed the amount of resource available to the parent.”…””}”(hjy h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M°hjh h²hubhú)”}”(hŒFLimits are in the range [0, max] and defaults to "max", which is noop.”h]”hŒJLimits are in the range [0, max] and defaults to â€œmaxâ€, which is noop.”…””}”(hj‡ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´hjh h²hubhú)”}”(hŒ—As limits can be over-committed, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”h]”hŒ—As limits can be over-committed, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”…””}”(hj• h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¶hjh h²hubhú)”}”(hŒu"io.max" limits the maximum BPS and/or IOPS that a cgroup can consume on an IO device and is an example of this type.”h]”hŒyâ€œio.maxâ€ limits the maximum BPS and/or IOPS that a cgroup can consume on an IO device and is an example of this type.”…””}”(hj£ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mºhjh h²hubh¶)”}”(hŒ%.. _cgroupv2-protections-distributor:”h]”h}”(h]”h ]”h"]”h$]”h&]”hÁŒ cgroupv2-protections-distributor”uh1hµh´M½hjh h²hh³hÃubeh}”(h]”(Œlimits”j_ eh ]”h"]”(Œlimits”Œcgroupv2-limits-distributor”eh$]”h&]”uh1hÄhjí h²hh³hÃh´M®Œexpect_referenced_by_name”}”jÂ jU sŒexpect_referenced_by_id”}”j_ jU subhÅ)”}”(hhh]”(hÊ)”}”(hŒProtections”h]”hŒProtections”…””}”(hjÌ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÉ h²hh³hÃh´MÀubhú)”}”(hXSA cgroup is protected up to the configured amount of the resource as long as the usages of all its ancestors are under their protected levels. Protections can be hard guarantees or best effort soft boundaries. Protections can also be over-committed in which case only up to the amount available to the parent is protected among children.”h]”hXSA cgroup is protected up to the configured amount of the resource as long as the usages of all its ancestors are under their protected levels. Protections can be hard guarantees or best effort soft boundaries. Protections can also be over-committed in which case only up to the amount available to the parent is protected among children.”…””}”(hjÚ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÂhjÉ h²hubhú)”}”(hŒGProtections are in the range [0, max] and defaults to 0, which is noop.”h]”hŒGProtections are in the range [0, max] and defaults to 0, which is noop.”…””}”(hjè h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÉhjÉ h²hubhú)”}”(hŒœAs protections can be over-committed, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”h]”hŒœAs protections can be over-committed, all configuration combinations are valid and there is no reason to reject configuration changes or process migrations.”…””}”(hjö h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÌhjÉ h²hubhú)”}”(hŒU"memory.low" implements best-effort memory protection and is an example of this type.”h]”hŒYâ€œmemory.lowâ€ implements best-effort memory protection and is an example of this type.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÐhjÉ h²hubeh}”(h]”(Œprotections”j» eh ]”h"]”(Œprotections”Œ cgroupv2-protections-distributor”eh$]”h&]”uh1hÄhjí h²hh³hÃh´MÀjÅ }”jj± sjÇ }”j» j± subhÅ)”}”(hhh]”(hÊ)”}”(hŒAllocations”h]”hŒAllocations”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjh²hh³hÃh´MÕubhú)”}”(hŒÕA cgroup is exclusively allocated a certain amount of a finite resource. Allocations can't be over-committed - the sum of the allocations of children can not exceed the amount of resource available to the parent.”h]”hŒ×A cgroup is exclusively allocated a certain amount of a finite resource. Allocations canâ€™t be over-committed - the sum of the allocations of children can not exceed the amount of resource available to the parent.”…””}”(hj.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M×hjh²hubhú)”}”(hŒNAllocations are in the range [0, max] and defaults to 0, which is no resource.”h]”hŒNAllocations are in the range [0, max] and defaults to 0, which is no resource.”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÜhjh²hubhú)”}”(hŒÏAs allocations can't be over-committed, some configuration combinations are invalid and should be rejected. Also, if the resource is mandatory for execution of processes, process migrations may be rejected.”h]”hŒÑAs allocations canâ€™t be over-committed, some configuration combinations are invalid and should be rejected. Also, if the resource is mandatory for execution of processes, process migrations may be rejected.”…””}”(hjJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mßhjh²hubeh}”(h]”Œallocations”ah ]”h"]”Œallocations”ah$]”h&]”uh1hÄhjí h²hh³hÃh´MÕubeh}”(h]”Œresource-distribution-models”ah ]”h"]”Œresource distribution models”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´MŽubhÅ)”}”(hhh]”(hÊ)”}”(hŒInterface Files”h]”hŒInterface Files”…””}”(hjkh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjhh²hh³hÃh´MæubhÅ)”}”(hhh]”(hÊ)”}”(hŒFormat”h]”hŒFormat”…””}”(hj|h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjyh²hh³hÃh´Méubhú)”}”(hŒQAll interface files should be in one of the following formats whenever possible::”h]”hŒPAll interface files should be in one of the following formats whenever possible:”…””}”(hjŠh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mëhjyh²hubjj)”}”(hXNew-line separated values (when only one value can be written at once) VAL0\n VAL1\n ... Space separated values (when read-only or multiple values can be written at once) VAL0 VAL1 ...\n Flat keyed KEY0 VAL0\n KEY1 VAL1\n ... Nested keyed KEY0 SUB_KEY0=VAL00 SUB_KEY1=VAL01... KEY1 SUB_KEY0=VAL10 SUB_KEY1=VAL11... ...”h]”hXNew-line separated values (when only one value can be written at once) VAL0\n VAL1\n ... Space separated values (when read-only or multiple values can be written at once) VAL0 VAL1 ...\n Flat keyed KEY0 VAL0\n KEY1 VAL1\n ... Nested keyed KEY0 SUB_KEY0=VAL00 SUB_KEY1=VAL01... KEY1 SUB_KEY0=VAL10 SUB_KEY1=VAL11... ...”…””}”hj˜sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mîhjyh²hubhú)”}”(hŒ½For a writable file, the format for writing should generally match reading; however, controllers may allow omitting later fields or implement restricted shortcuts for most common use cases.”h]”hŒ½For a writable file, the format for writing should generally match reading; however, controllers may allow omitting later fields or implement restricted shortcuts for most common use cases.”…””}”(hj¦h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjyh²hubhú)”}”(hŒÑFor both flat and nested keyed files, only the values for a single key can be written at a time. For nested keyed files, the sub key pairs may be specified in any order and not all pairs have to be specified.”h]”hŒÑFor both flat and nested keyed files, only the values for a single key can be written at a time. For nested keyed files, the sub key pairs may be specified in any order and not all pairs have to be specified.”…””}”(hj´h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjyh²hubeh}”(h]”Œformat”ah ]”h"]”Œformat”ah$]”h&]”uh1hÄhjhh²hh³hÃh´MéubhÅ)”}”(hhh]”(hÊ)”}”(hŒConventions”h]”hŒConventions”…””}”(hjÍh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÊh²hh³hÃh´Mubj¾)”}”(hhh]”(jÃ)”}”(hŒDSettings for a single feature should be contained in a single file. ”h]”hú)”}”(hŒCSettings for a single feature should be contained in a single file.”h]”hŒCSettings for a single feature should be contained in a single file.”…””}”(hjâh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÞubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hŒqThe root cgroup should be exempt from resource control and thus shouldn't have resource control interface files. ”h]”hú)”}”(hŒpThe root cgroup should be exempt from resource control and thus shouldn't have resource control interface files.”h]”hŒrThe root cgroup should be exempt from resource control and thus shouldnâ€™t have resource control interface files.”…””}”(hjúh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjöubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hŒsThe default time unit is microseconds. If a different unit is ever used, an explicit unit suffix must be present. ”h]”hú)”}”(hŒrThe default time unit is microseconds. If a different unit is ever used, an explicit unit suffix must be present.”h]”hŒrThe default time unit is microseconds. If a different unit is ever used, an explicit unit suffix must be present.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hŒkA parts-per quantity should use a percentage decimal with at least two digit fractional part - e.g. 13.40. ”h]”hú)”}”(hŒjA parts-per quantity should use a percentage decimal with at least two digit fractional part - e.g. 13.40.”h]”hŒjA parts-per quantity should use a percentage decimal with at least two digit fractional part - e.g. 13.40.”…””}”(hj*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj&ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hX!If a controller implements weight based resource distribution, its interface file should be named "weight" and have the range [1, 10000] with 100 as the default. The values are chosen to allow enough and symmetric bias in both directions while keeping it intuitive (the default is 100%). ”h]”hú)”}”(hX If a controller implements weight based resource distribution, its interface file should be named "weight" and have the range [1, 10000] with 100 as the default. The values are chosen to allow enough and symmetric bias in both directions while keeping it intuitive (the default is 100%).”h]”hX$If a controller implements weight based resource distribution, its interface file should be named â€œweightâ€ and have the range [1, 10000] with 100 as the default. The values are chosen to allow enough and symmetric bias in both directions while keeping it intuitive (the default is 100%).”…””}”(hjBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj>ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hXšIf a controller implements an absolute resource guarantee and/or limit, the interface files should be named "min" and "max" respectively. If a controller implements best effort resource guarantee and/or limit, the interface files should be named "low" and "high" respectively. In the above four control files, the special token "max" should be used to represent upward infinity for both reading and writing. ”h]”(hú)”}”(hXIf a controller implements an absolute resource guarantee and/or limit, the interface files should be named "min" and "max" respectively. If a controller implements best effort resource guarantee and/or limit, the interface files should be named "low" and "high" respectively.”h]”hX%If a controller implements an absolute resource guarantee and/or limit, the interface files should be named â€œminâ€ and â€œmaxâ€ respectively. If a controller implements best effort resource guarantee and/or limit, the interface files should be named â€œlowâ€ and â€œhighâ€ respectively.”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M#hjVubhú)”}”(hŒ‚In the above four control files, the special token "max" should be used to represent upward infinity for both reading and writing.”h]”hŒ†In the above four control files, the special token â€œmaxâ€ should be used to represent upward infinity for both reading and writing.”…””}”(hjhh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M)hjVubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hXØIf a setting has a configurable default value and keyed specific overrides, the default entry should be keyed with "default" and appear as the first entry in the file. The default value can be updated by writing either "default $VAL" or "$VAL". When writing to update a specific override, "default" can be used as the value to indicate removal of the override. Override entries with "default" as the value must not appear when read. For example, a setting which is keyed by major:minor device numbers with integer values may look like the following:: # cat cgroup-example-interface-file default 150 8:0 300 The default value can be updated by:: # echo 125 > cgroup-example-interface-file or:: # echo "default 125" > cgroup-example-interface-file An override can be set by:: # echo "8:16 170" > cgroup-example-interface-file and cleared by:: # echo "8:0 default" > cgroup-example-interface-file # cat cgroup-example-interface-file default 125 8:16 170 ”h]”(hú)”}”(hŒ§If a setting has a configurable default value and keyed specific overrides, the default entry should be keyed with "default" and appear as the first entry in the file.”h]”hŒ«If a setting has a configurable default value and keyed specific overrides, the default entry should be keyed with â€œdefaultâ€ and appear as the first entry in the file.”…””}”(hj€h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M,hj|ubhú)”}”(hŒLThe default value can be updated by writing either "default $VAL" or "$VAL".”h]”hŒTThe default value can be updated by writing either â€œdefault $VALâ€ or â€œ$VALâ€.”…””}”(hjŽh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M0hj|ubhú)”}”(hŒ¼When writing to update a specific override, "default" can be used as the value to indicate removal of the override. Override entries with "default" as the value must not appear when read.”h]”hŒÄWhen writing to update a specific override, â€œdefaultâ€ can be used as the value to indicate removal of the override. Override entries with â€œdefaultâ€ as the value must not appear when read.”…””}”(hjœh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M3hj|ubhú)”}”(hŒuFor example, a setting which is keyed by major:minor device numbers with integer values may look like the following::”h]”hŒtFor example, a setting which is keyed by major:minor device numbers with integer values may look like the following:”…””}”(hjªh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M7hj|ubjj)”}”(hŒ7# cat cgroup-example-interface-file default 150 8:0 300”h]”hŒ7# cat cgroup-example-interface-file default 150 8:0 300”…””}”hj¸sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M:hj|ubhú)”}”(hŒ%The default value can be updated by::”h]”hŒ$The default value can be updated by:”…””}”(hjÆh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M>hj|ubjj)”}”(hŒ*# echo 125 > cgroup-example-interface-file”h]”hŒ*# echo 125 > cgroup-example-interface-file”…””}”hjÔsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M@hj|ubhú)”}”(hŒor::”h]”hŒor:”…””}”(hjâh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MBhj|ubjj)”}”(hŒ4# echo "default 125" > cgroup-example-interface-file”h]”hŒ4# echo "default 125" > cgroup-example-interface-file”…””}”hjðsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MDhj|ubhú)”}”(hŒAn override can be set by::”h]”hŒAn override can be set by:”…””}”(hjþh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MFhj|ubjj)”}”(hŒ1# echo "8:16 170" > cgroup-example-interface-file”h]”hŒ1# echo "8:16 170" > cgroup-example-interface-file”…””}”hj sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MHhj|ubhú)”}”(hŒand cleared by::”h]”hŒand cleared by:”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MJhj|ubjj)”}”(hŒm# echo "8:0 default" > cgroup-example-interface-file # cat cgroup-example-interface-file default 125 8:16 170”h]”hŒm# echo "8:0 default" > cgroup-example-interface-file # cat cgroup-example-interface-file default 125 8:16 170”…””}”hj( sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MLhj|ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´NubjÃ)”}”(hŒÙFor events which are not very high frequency, an interface file "events" should be created which lists event key value pairs. Whenever a notifiable event happens, file modified event should be generated on the file. ”h]”hú)”}”(hŒ×For events which are not very high frequency, an interface file "events" should be created which lists event key value pairs. Whenever a notifiable event happens, file modified event should be generated on the file.”h]”hŒÛFor events which are not very high frequency, an interface file â€œeventsâ€ should be created which lists event key value pairs. Whenever a notifiable event happens, file modified event should be generated on the file.”…””}”(hj@ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MQhj< ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÛh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´MhjÊh²hubeh}”(h]”Œconventions”ah ]”h"]”Œconventions”ah$]”h&]”uh1hÄhjhh²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒCore Interface Files”h]”hŒCore Interface Files”…””}”(hje h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjb h²hh³hÃh´MXubhú)”}”(hŒ1All cgroup core files are prefixed with "cgroup."”h]”hŒ5All cgroup core files are prefixed with â€œcgroup.â€”…””}”(hjs h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MZhjb h²hubjÀ)”}”(hXL$cgroup.type A read-write single value file which exists on non-root cgroups. When read, it indicates the current type of the cgroup, which can be one of the following values. - "domain" : A normal valid domain cgroup. - "domain threaded" : A threaded domain cgroup which is serving as the root of a threaded subtree. - "domain invalid" : A cgroup which is in an invalid state. It can't be populated or have controllers enabled. It may be allowed to become a threaded cgroup. - "threaded" : A threaded cgroup which is a member of a threaded subtree. A cgroup can be turned into a threaded cgroup by writing "threaded" to this file. cgroup.procs A read-write new-line separated values file which exists on all cgroups. When read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading. A PID can be written to migrate the process associated with the PID to the cgroup. The writer should match all of the following conditions. - It must have write access to the "cgroup.procs" file. - It must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. When delegating a sub-hierarchy, write access to this file should be granted along with the containing directory. In a threaded cgroup, reading this file fails with EOPNOTSUPP as all the processes belong to the thread root. Writing is supported and moves every thread of the process to the cgroup. cgroup.threads A read-write new-line separated values file which exists on all cgroups. When read, it lists the TIDs of all threads which belong to the cgroup one-per-line. The TIDs are not ordered and the same TID may show up more than once if the thread got moved to another cgroup and then back or the TID got recycled while reading. A TID can be written to migrate the thread associated with the TID to the cgroup. The writer should match all of the following conditions. - It must have write access to the "cgroup.threads" file. - The cgroup that the thread is currently in must be in the same resource domain as the destination cgroup. - It must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. When delegating a sub-hierarchy, write access to this file should be granted along with the containing directory. cgroup.controllers A read-only space separated values file which exists on all cgroups. It shows space separated list of all controllers available to the cgroup. The controllers are not ordered. cgroup.subtree_control A read-write space separated values file which exists on all cgroups. Starts out empty. When read, it shows space separated list of the controllers which are enabled to control resource distribution from the cgroup to its children. Space separated list of controllers prefixed with '+' or '-' can be written to enable or disable controllers. A controller name prefixed with '+' enables the controller and '-' disables. If a controller appears more than once on the list, the last one is effective. When multiple enable and disable operations are specified, either all succeed or all fail. cgroup.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. populated 1 if the cgroup or its descendants contains any live processes; otherwise, 0. frozen 1 if the cgroup is frozen; otherwise, 0. cgroup.max.descendants A read-write single value files. The default is "max". Maximum allowed number of descent cgroups. If the actual number of descendants is equal or larger, an attempt to create a new cgroup in the hierarchy will fail. cgroup.max.depth A read-write single value files. The default is "max". Maximum allowed descent depth below the current cgroup. If the actual descent depth is equal or larger, an attempt to create a new child cgroup will fail. cgroup.stat A read-only flat-keyed file with the following entries: nr_descendants Total number of visible descendant cgroups. nr_dying_descendants Total number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed. A process can't enter a dying cgroup under any circumstances, a dying cgroup can't revive. A dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion. nr_subsys_ Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup. nr_dying_subsys_ Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup. cgroup.stat.local A read-only flat-keyed file which exists in non-root cgroups. The following entry is defined: frozen_usec Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching "frozen" state is not accounted here. Using the following ASCII representation of a cgroup's freezer state, :: 1 _____ frozen 0 __/ \__ ab cd the duration being measured is the span between a and c. cgroup.freeze A read-write single value file which exists on non-root cgroups. Allowed values are "0" and "1". The default is "0". Writing "1" to the file causes freezing of the cgroup and all descendant cgroups. This means that all belonging processes will be stopped and will not run until the cgroup will be explicitly unfrozen. Freezing of the cgroup may take some time; when this action is completed, the "frozen" value in the cgroup.events control file will be updated to "1" and the corresponding notification will be issued. A cgroup can be frozen either by its own settings, or by settings of any ancestor cgroups. If any of ancestor cgroups is frozen, the cgroup will remain frozen. Processes in the frozen cgroup can be killed by a fatal signal. They also can enter and leave a frozen cgroup: either by an explicit move by a user, or if freezing of the cgroup races with fork(). If a process is moved to a frozen cgroup, it stops. If a process is moved out of a frozen cgroup, it becomes running. Frozen status of a cgroup doesn't affect any cgroup tree operations: it's possible to delete a frozen (and empty) cgroup, as well as create new sub-cgroups. cgroup.kill A write-only single value file which exists in non-root cgroups. The only allowed value is "1". Writing "1" to the file causes the cgroup and all descendant cgroups to be killed. This means that all processes located in the affected cgroup tree will be killed via SIGKILL. Killing a cgroup tree will deal with concurrent forks appropriately and is protected against migrations. In a threaded cgroup, writing this file fails with EOPNOTSUPP as killing cgroups is a process directed operation, i.e. it affects the whole thread-group. cgroup.pressure A read-write single value file that allowed values are "0" and "1". The default is "1". Writing "0" to the file will disable the cgroup PSI accounting. Writing "1" to the file will re-enable the cgroup PSI accounting. This control attribute is not hierarchical, so disable or enable PSI accounting in a cgroup does not affect PSI accounting in descendants and doesn't need pass enablement via ancestors from root. The reason this control attribute exists is that PSI accounts stalls for each cgroup separately and aggregates it at each level of the hierarchy. This may cause non-negligible overhead for some workloads when under deep level of the hierarchy, in which case this control attribute can be used to disable PSI accounting in the non-leaf cgroups. irq.pressure A read-write nested-keyed file. Shows pressure stall information for IRQ/SOFTIRQ. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”jÆ)”}”(hhh]”(jË)”}”(hX†cgroup.type A read-write single value file which exists on non-root cgroups. When read, it indicates the current type of the cgroup, which can be one of the following values. - "domain" : A normal valid domain cgroup. - "domain threaded" : A threaded domain cgroup which is serving as the root of a threaded subtree. - "domain invalid" : A cgroup which is in an invalid state. It can't be populated or have controllers enabled. It may be allowed to become a threaded cgroup. - "threaded" : A threaded cgroup which is a member of a threaded subtree. A cgroup can be turned into a threaded cgroup by writing "threaded" to this file. ”h]”(jÑ)”}”(hŒcgroup.type”h]”hŒcgroup.type”…””}”(hjŒ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mphjˆ ubjá)”}”(hhh]”(hú)”}”(hŒ@A read-write single value file which exists on non-root cgroups.”h]”hŒ@A read-write single value file which exists on non-root cgroups.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M]hjš ubhú)”}”(hŒaWhen read, it indicates the current type of the cgroup, which can be one of the following values.”h]”hŒaWhen read, it indicates the current type of the cgroup, which can be one of the following values.”…””}”(hj« h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M`hjš ubj¾)”}”(hhh]”(jÃ)”}”(hŒ)"domain" : A normal valid domain cgroup. ”h]”hú)”}”(hŒ("domain" : A normal valid domain cgroup.”h]”hŒ,â€œdomainâ€ : A normal valid domain cgroup.”…””}”(hjÀ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mchj¼ ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¹ ubjÃ)”}”(hŒa"domain threaded" : A threaded domain cgroup which is serving as the root of a threaded subtree. ”h]”hú)”}”(hŒ`"domain threaded" : A threaded domain cgroup which is serving as the root of a threaded subtree.”h]”hŒdâ€œdomain threadedâ€ : A threaded domain cgroup which is serving as the root of a threaded subtree.”…””}”(hjØ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MehjÔ ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¹ ubjÃ)”}”(hŒ"domain invalid" : A cgroup which is in an invalid state. It can't be populated or have controllers enabled. It may be allowed to become a threaded cgroup. ”h]”hú)”}”(hŒœ"domain invalid" : A cgroup which is in an invalid state. It can't be populated or have controllers enabled. It may be allowed to become a threaded cgroup.”h]”hŒ¢â€œdomain invalidâ€ : A cgroup which is in an invalid state. It canâ€™t be populated or have controllers enabled. It may be allowed to become a threaded cgroup.”…””}”(hjð h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhhjì ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¹ ubjÃ)”}”(hŒH"threaded" : A threaded cgroup which is a member of a threaded subtree. ”h]”hú)”}”(hŒG"threaded" : A threaded cgroup which is a member of a threaded subtree.”h]”hŒKâ€œthreadedâ€ : A threaded cgroup which is a member of a threaded subtree.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mlhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj¹ ubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´Mchjš ubhú)”}”(hŒQA cgroup can be turned into a threaded cgroup by writing "threaded" to this file.”h]”hŒUA cgroup can be turned into a threaded cgroup by writing â€œthreadedâ€ to this file.”…””}”(hj"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mohjš ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjˆ ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mphj… ubjË)”}”(hXÀcgroup.procs A read-write new-line separated values file which exists on all cgroups. When read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading. A PID can be written to migrate the process associated with the PID to the cgroup. The writer should match all of the following conditions. - It must have write access to the "cgroup.procs" file. - It must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. When delegating a sub-hierarchy, write access to this file should be granted along with the containing directory. In a threaded cgroup, reading this file fails with EOPNOTSUPP as all the processes belong to the thread root. Writing is supported and moves every thread of the process to the cgroup. ”h]”(jÑ)”}”(hŒcgroup.procs”h]”hŒcgroup.procs”…””}”(hj@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MŠhj<ubjá)”}”(hhh]”(hú)”}”(hŒHA read-write new-line separated values file which exists on all cgroups.”h]”hŒHA read-write new-line separated values file which exists on all cgroups.”…””}”(hjQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MshjNubhú)”}”(hŒüWhen read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading.”h]”hŒüWhen read, it lists the PIDs of all processes which belong to the cgroup one-per-line. The PIDs are not ordered and the same PID may show up more than once if the process got moved to another cgroup and then back or the PID got recycled while reading.”…””}”(hj_h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MvhjNubhú)”}”(hŒŒA PID can be written to migrate the process associated with the PID to the cgroup. The writer should match all of the following conditions.”h]”hŒŒA PID can be written to migrate the process associated with the PID to the cgroup. The writer should match all of the following conditions.”…””}”(hjmh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M|hjNubj¾)”}”(hhh]”(jÃ)”}”(hŒ6It must have write access to the "cgroup.procs" file. ”h]”hú)”}”(hŒ5It must have write access to the "cgroup.procs" file.”h]”hŒ9It must have write access to the â€œcgroup.procsâ€ file.”…””}”(hj‚h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M€hj~ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj{ubjÃ)”}”(hŒsIt must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. ”h]”hú)”}”(hŒrIt must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups.”h]”hŒvIt must have write access to the â€œcgroup.procsâ€ file of the common ancestor of the source and destination cgroups.”…””}”(hjšh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‚hj–ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj{ubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M€hjNubhú)”}”(hŒqWhen delegating a sub-hierarchy, write access to this file should be granted along with the containing directory.”h]”hŒqWhen delegating a sub-hierarchy, write access to this file should be granted along with the containing directory.”…””}”(hj´h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M…hjNubhú)”}”(hŒ¸In a threaded cgroup, reading this file fails with EOPNOTSUPP as all the processes belong to the thread root. Writing is supported and moves every thread of the process to the cgroup.”h]”hŒ¸In a threaded cgroup, reading this file fails with EOPNOTSUPP as all the processes belong to the thread root. Writing is supported and moves every thread of the process to the cgroup.”…””}”(hjÂh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MˆhjNubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj<ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MŠhj… ubjË)”}”(hXucgroup.threads A read-write new-line separated values file which exists on all cgroups. When read, it lists the TIDs of all threads which belong to the cgroup one-per-line. The TIDs are not ordered and the same TID may show up more than once if the thread got moved to another cgroup and then back or the TID got recycled while reading. A TID can be written to migrate the thread associated with the TID to the cgroup. The writer should match all of the following conditions. - It must have write access to the "cgroup.threads" file. - The cgroup that the thread is currently in must be in the same resource domain as the destination cgroup. - It must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. When delegating a sub-hierarchy, write access to this file should be granted along with the containing directory. ”h]”(jÑ)”}”(hŒcgroup.threads”h]”hŒcgroup.threads”…””}”(hjàh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M£hjÜubjá)”}”(hhh]”(hú)”}”(hŒHA read-write new-line separated values file which exists on all cgroups.”h]”hŒHA read-write new-line separated values file which exists on all cgroups.”…””}”(hjñh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjîubhú)”}”(hŒùWhen read, it lists the TIDs of all threads which belong to the cgroup one-per-line. The TIDs are not ordered and the same TID may show up more than once if the thread got moved to another cgroup and then back or the TID got recycled while reading.”h]”hŒùWhen read, it lists the TIDs of all threads which belong to the cgroup one-per-line. The TIDs are not ordered and the same TID may show up more than once if the thread got moved to another cgroup and then back or the TID got recycled while reading.”…””}”(hjÿh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjîubhú)”}”(hŒ‹A TID can be written to migrate the thread associated with the TID to the cgroup. The writer should match all of the following conditions.”h]”hŒ‹A TID can be written to migrate the thread associated with the TID to the cgroup. The writer should match all of the following conditions.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M–hjîubj¾)”}”(hhh]”(jÃ)”}”(hŒ8It must have write access to the "cgroup.threads" file. ”h]”hú)”}”(hŒ7It must have write access to the "cgroup.threads" file.”h]”hŒ;It must have write access to the â€œcgroup.threadsâ€ file.”…””}”(hj"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mšhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjubjÃ)”}”(hŒjThe cgroup that the thread is currently in must be in the same resource domain as the destination cgroup. ”h]”hú)”}”(hŒiThe cgroup that the thread is currently in must be in the same resource domain as the destination cgroup.”h]”hŒiThe cgroup that the thread is currently in must be in the same resource domain as the destination cgroup.”…””}”(hj:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mœhj6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjubjÃ)”}”(hŒsIt must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups. ”h]”hú)”}”(hŒrIt must have write access to the "cgroup.procs" file of the common ancestor of the source and destination cgroups.”h]”hŒvIt must have write access to the â€œcgroup.procsâ€ file of the common ancestor of the source and destination cgroups.”…””}”(hjRh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŸhjNubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´Mšhjîubhú)”}”(hŒqWhen delegating a sub-hierarchy, write access to this file should be granted along with the containing directory.”h]”hŒqWhen delegating a sub-hierarchy, write access to this file should be granted along with the containing directory.”…””}”(hjlh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¢hjîubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÜubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M£hj… ubjË)”}”(hŒÅcgroup.controllers A read-only space separated values file which exists on all cgroups. It shows space separated list of all controllers available to the cgroup. The controllers are not ordered. ”h]”(jÑ)”}”(hŒcgroup.controllers”h]”hŒcgroup.controllers”…””}”(hjŠh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mªhj†ubjá)”}”(hhh]”(hú)”}”(hŒDA read-only space separated values file which exists on all cgroups.”h]”hŒDA read-only space separated values file which exists on all cgroups.”…””}”(hj›h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¦hj˜ubhú)”}”(hŒkIt shows space separated list of all controllers available to the cgroup. The controllers are not ordered.”h]”hŒkIt shows space separated list of all controllers available to the cgroup. The controllers are not ordered.”…””}”(hj©h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M©hj˜ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj†ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mªhj… ubjË)”}”(hXjcgroup.subtree_control A read-write space separated values file which exists on all cgroups. Starts out empty. When read, it shows space separated list of the controllers which are enabled to control resource distribution from the cgroup to its children. Space separated list of controllers prefixed with '+' or '-' can be written to enable or disable controllers. A controller name prefixed with '+' enables the controller and '-' disables. If a controller appears more than once on the list, the last one is effective. When multiple enable and disable operations are specified, either all succeed or all fail. ”h]”(jÑ)”}”(hŒcgroup.subtree_control”h]”hŒcgroup.subtree_control”…””}”(hjÇh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¹hjÃubjá)”}”(hhh]”(hú)”}”(hŒXA read-write space separated values file which exists on all cgroups. Starts out empty.”h]”hŒXA read-write space separated values file which exists on all cgroups. Starts out empty.”…””}”(hjØh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÕubhú)”}”(hŒWhen read, it shows space separated list of the controllers which are enabled to control resource distribution from the cgroup to its children.”h]”hŒWhen read, it shows space separated list of the controllers which are enabled to control resource distribution from the cgroup to its children.”…””}”(hjæh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M°hjÕubhú)”}”(hXgSpace separated list of controllers prefixed with '+' or '-' can be written to enable or disable controllers. A controller name prefixed with '+' enables the controller and '-' disables. If a controller appears more than once on the list, the last one is effective. When multiple enable and disable operations are specified, either all succeed or all fail.”h]”hXwSpace separated list of controllers prefixed with â€˜+â€™ or â€˜-â€™ can be written to enable or disable controllers. A controller name prefixed with â€˜+â€™ enables the controller and â€˜-â€™ disables. If a controller appears more than once on the list, the last one is effective. When multiple enable and disable operations are specified, either all succeed or all fail.”…””}”(hjôh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´hjÕubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÃubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¹hj… ubjË)”}”(hXncgroup.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. populated 1 if the cgroup or its descendants contains any live processes; otherwise, 0. frozen 1 if the cgroup is frozen; otherwise, 0. ”h]”(jÑ)”}”(hŒ cgroup.events”h]”hŒ cgroup.events”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÅhjubjá)”}”(hhh]”(hú)”}”(hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”h]”hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”…””}”(hj#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¼hj ubjÀ)”}”(hŒšpopulated 1 if the cgroup or its descendants contains any live processes; otherwise, 0. frozen 1 if the cgroup is frozen; otherwise, 0. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒWpopulated 1 if the cgroup or its descendants contains any live processes; otherwise, 0.”h]”(jÑ)”}”(hŒ populated”h]”hŒ populated”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÂhj8ubjá)”}”(hhh]”hú)”}”(hŒM1 if the cgroup or its descendants contains any live processes; otherwise, 0.”h]”hŒM1 if the cgroup or its descendants contains any live processes; otherwise, 0.”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÂhjJubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÂhj5ubjË)”}”(hŒ0frozen 1 if the cgroup is frozen; otherwise, 0. ”h]”(jÑ)”}”(hŒfrozen”h]”hŒfrozen”…””}”(hjkh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÅhjgubjá)”}”(hhh]”hú)”}”(hŒ(1 if the cgroup is frozen; otherwise, 0.”h]”hŒ(1 if the cgroup is frozen; otherwise, 0.”…””}”(hj|h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÅhjyubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjgubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÅhj5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj1ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MÁhj ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÅhj… ubjË)”}”(hŒñcgroup.max.descendants A read-write single value files. The default is "max". Maximum allowed number of descent cgroups. If the actual number of descendants is equal or larger, an attempt to create a new cgroup in the hierarchy will fail. ”h]”(jÑ)”}”(hŒcgroup.max.descendants”h]”hŒcgroup.max.descendants”…””}”(hj²h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÌhj®ubjá)”}”(hhh]”(hú)”}”(hŒ7A read-write single value files. The default is "max".”h]”hŒ;A read-write single value files. The default is â€œmaxâ€.”…””}”(hjÃh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÈhjÀubhú)”}”(hŒ Maximum allowed number of descent cgroups. If the actual number of descendants is equal or larger, an attempt to create a new cgroup in the hierarchy will fail.”h]”hŒ Maximum allowed number of descent cgroups. If the actual number of descendants is equal or larger, an attempt to create a new cgroup in the hierarchy will fail.”…””}”(hjÑh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÊhjÀubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj®ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÌhj… ubjË)”}”(hŒåcgroup.max.depth A read-write single value files. The default is "max". Maximum allowed descent depth below the current cgroup. If the actual descent depth is equal or larger, an attempt to create a new child cgroup will fail. ”h]”(jÑ)”}”(hŒcgroup.max.depth”h]”hŒcgroup.max.depth”…””}”(hjïh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÓhjëubjá)”}”(hhh]”(hú)”}”(hŒ7A read-write single value files. The default is "max".”h]”hŒ;A read-write single value files. The default is â€œmaxâ€.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÏhjýubhú)”}”(hŒšMaximum allowed descent depth below the current cgroup. If the actual descent depth is equal or larger, an attempt to create a new child cgroup will fail.”h]”hŒšMaximum allowed descent depth below the current cgroup. If the actual descent depth is equal or larger, an attempt to create a new child cgroup will fail.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÑhjýubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjëubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÓhj… ubjË)”}”(hX»cgroup.stat A read-only flat-keyed file with the following entries: nr_descendants Total number of visible descendant cgroups. nr_dying_descendants Total number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed. A process can't enter a dying cgroup under any circumstances, a dying cgroup can't revive. A dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion. nr_subsys_ Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup. nr_dying_subsys_ Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup. ”h]”(jÑ)”}”(hŒcgroup.stat”h]”hŒcgroup.stat”…””}”(hj,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Míhj(ubjá)”}”(hhh]”(hú)”}”(•˜hŒ7A read-only flat-keyed file with the following entries:”h]”hŒ7A read-only flat-keyed file with the following entries:”…””}”(hj=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÖhj:ubjÀ)”}”(hXTnr_descendants Total number of visible descendant cgroups. nr_dying_descendants Total number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed. A process can't enter a dying cgroup under any circumstances, a dying cgroup can't revive. A dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion. nr_subsys_ Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup. nr_dying_subsys_ Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ;nr_descendants Total number of visible descendant cgroups. ”h]”(jÑ)”}”(hŒnr_descendants”h]”hŒnr_descendants”…””}”(hjVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÙhjRubjá)”}”(hhh]”hú)”}”(hŒ+Total number of visible descendant cgroups.”h]”hŒ+Total number of visible descendant cgroups.”…””}”(hjgh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÙhjdubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjRubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÙhjOubjË)”}”(hXÐnr_dying_descendants Total number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed. A process can't enter a dying cgroup under any circumstances, a dying cgroup can't revive. A dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion. ”h]”(jÑ)”}”(hŒnr_dying_descendants”h]”hŒnr_dying_descendants”…””}”(hj…h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Måhjubjá)”}”(hhh]”(hú)”}”(hŒçTotal number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed.”h]”hŒçTotal number of dying descendant cgroups. A cgroup becomes dying after being deleted by a user. The cgroup will remain in dying state for some time undefined time (which can depend on system load) before being completely destroyed.”…””}”(hj–h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÜhj“ubhú)”}”(hŒZA process can't enter a dying cgroup under any circumstances, a dying cgroup can't revive.”h]”hŒ^A process canâ€™t enter a dying cgroup under any circumstances, a dying cgroup canâ€™t revive.”…””}”(hj¤h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Máhj“ubhú)”}”(hŒuA dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion.”h]”hŒuA dying cgroup can consume system resources not exceeding limits, which were active at the moment of cgroup deletion.”…””}”(hj²h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mähj“ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MåhjOubjË)”}”(hŒxnr_subsys_ Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup. ”h]”(jÑ)”}”(hŒnr_subsys_”h]”hŒnr_subsys_”…””}”(hjÐh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MéhjÌubjá)”}”(hhh]”hú)”}”(hŒ]Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup.”h]”hŒ]Total number of live cgroup subsystems (e.g memory cgroup) at and beneath the current cgroup.”…””}”(hjáh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MèhjÞubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÌubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MéhjOubjË)”}”(hŒ€nr_dying_subsys_ Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup. ”h]”(jÑ)”}”(hŒnr_dying_subsys_”h]”hŒnr_dying_subsys_”…””}”(hjÿh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Míhjûubjá)”}”(hhh]”hú)”}”(hŒ_Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup.”h]”hŒ_Total number of dying cgroup subsystems (e.g. memory cgroup) at and beneath the current cgroup.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mìhj ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjûubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MíhjOubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjKubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MØhj:ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj(ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Míhj… ubjË)”}”(hXRcgroup.stat.local A read-only flat-keyed file which exists in non-root cgroups. The following entry is defined: frozen_usec Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching "frozen" state is not accounted here. Using the following ASCII representation of a cgroup's freezer state, :: 1 _____ frozen 0 __/ \__ ab cd the duration being measured is the span between a and c. ”h]”(jÑ)”}”(hŒcgroup.stat.local”h]”hŒcgroup.stat.local”…””}”(hjFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÿhjBubjá)”}”(hhh]”(hú)”}”(hŒ]A read-only flat-keyed file which exists in non-root cgroups. The following entry is defined:”h]”hŒ]A read-only flat-keyed file which exists in non-root cgroups. The following entry is defined:”…””}”(hjWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MðhjTubjÀ)”}”(hXÍfrozen_usec Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching "frozen" state is not accounted here. Using the following ASCII representation of a cgroup's freezer state, :: 1 _____ frozen 0 __/ \__ ab cd the duration being measured is the span between a and c. ”h]”jÆ)”}”(hhh]”jË)”}”(hX—frozen_usec Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching "frozen" state is not accounted here. Using the following ASCII representation of a cgroup's freezer state, :: 1 _____ frozen 0 __/ \__ ab cd the duration being measured is the span between a and c. ”h]”(jÑ)”}”(hŒfrozen_usec”h]”hŒfrozen_usec”…””}”(hjph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mÿhjlubjá)”}”(hhh]”(hú)”}”(hŒ³Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching "frozen" state is not accounted here.”h]”hŒ·Cumulative time that this cgroup has spent between freezing and thawing, regardless of whether by self or ancestor groups. NB: (not) reaching â€œfrozenâ€ state is not accounted here.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Môhj~ubhú)”}”(hŒHUsing the following ASCII representation of a cgroup's freezer state, ::”h]”hŒGUsing the following ASCII representation of a cgroupâ€™s freezer state,”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Møhj~ubjj)”}”(hŒ9 1 _____ frozen 0 __/ \__ ab cd”h]”hŒ9 1 _____ frozen 0 __/ \__ ab cd”…””}”hjsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mûhj~ubhú)”}”(hŒ8the duration being measured is the span between a and c.”h]”hŒ8the duration being measured is the span between a and c.”…””}”(hj«h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mÿhj~ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjlubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mÿhjiubah}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjeubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MóhjTubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjBubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mÿhj… ubjË)”}”(hX‘cgroup.freeze A read-write single value file which exists on non-root cgroups. Allowed values are "0" and "1". The default is "0". Writing "1" to the file causes freezing of the cgroup and all descendant cgroups. This means that all belonging processes will be stopped and will not run until the cgroup will be explicitly unfrozen. Freezing of the cgroup may take some time; when this action is completed, the "frozen" value in the cgroup.events control file will be updated to "1" and the corresponding notification will be issued. A cgroup can be frozen either by its own settings, or by settings of any ancestor cgroups. If any of ancestor cgroups is frozen, the cgroup will remain frozen. Processes in the frozen cgroup can be killed by a fatal signal. They also can enter and leave a frozen cgroup: either by an explicit move by a user, or if freezing of the cgroup races with fork(). If a process is moved to a frozen cgroup, it stops. If a process is moved out of a frozen cgroup, it becomes running. Frozen status of a cgroup doesn't affect any cgroup tree operations: it's possible to delete a frozen (and empty) cgroup, as well as create new sub-cgroups. ”h]”(jÑ)”}”(hŒ cgroup.freeze”h]”hŒ cgroup.freeze”…””}”(hjáh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MhjÝubjá)”}”(hhh]”(hú)”}”(hŒtA read-write single value file which exists on non-root cgroups. Allowed values are "0" and "1". The default is "0".”h]”hŒ€A read-write single value file which exists on non-root cgroups. Allowed values are â€œ0â€ and â€œ1â€. The default is â€œ0â€.”…””}”(hjòh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjïubhú)”}”(hX‘Writing "1" to the file causes freezing of the cgroup and all descendant cgroups. This means that all belonging processes will be stopped and will not run until the cgroup will be explicitly unfrozen. Freezing of the cgroup may take some time; when this action is completed, the "frozen" value in the cgroup.events control file will be updated to "1" and the corresponding notification will be issued.”h]”hXWriting â€œ1â€ to the file causes freezing of the cgroup and all descendant cgroups. This means that all belonging processes will be stopped and will not run until the cgroup will be explicitly unfrozen. Freezing of the cgroup may take some time; when this action is completed, the â€œfrozenâ€ value in the cgroup.events control file will be updated to â€œ1â€ and the corresponding notification will be issued.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjïubhú)”}”(hŒŸA cgroup can be frozen either by its own settings, or by settings of any ancestor cgroups. If any of ancestor cgroups is frozen, the cgroup will remain frozen.”h]”hŒŸA cgroup can be frozen either by its own settings, or by settings of any ancestor cgroups. If any of ancestor cgroups is frozen, the cgroup will remain frozen.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjïubhú)”}”(hX:Processes in the frozen cgroup can be killed by a fatal signal. They also can enter and leave a frozen cgroup: either by an explicit move by a user, or if freezing of the cgroup races with fork(). If a process is moved to a frozen cgroup, it stops. If a process is moved out of a frozen cgroup, it becomes running.”h]”hX:Processes in the frozen cgroup can be killed by a fatal signal. They also can enter and leave a frozen cgroup: either by an explicit move by a user, or if freezing of the cgroup races with fork(). If a process is moved to a frozen cgroup, it stops. If a process is moved out of a frozen cgroup, it becomes running.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjïubhú)”}”(hŒœFrozen status of a cgroup doesn't affect any cgroup tree operations: it's possible to delete a frozen (and empty) cgroup, as well as create new sub-cgroups.”h]”hŒ Frozen status of a cgroup doesnâ€™t affect any cgroup tree operations: itâ€™s possible to delete a frozen (and empty) cgroup, as well as create new sub-cgroups.”…””}”(hj*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjïubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÝubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj… ubjË)”}”(hX#cgroup.kill A write-only single value file which exists in non-root cgroups. The only allowed value is "1". Writing "1" to the file causes the cgroup and all descendant cgroups to be killed. This means that all processes located in the affected cgroup tree will be killed via SIGKILL. Killing a cgroup tree will deal with concurrent forks appropriately and is protected against migrations. In a threaded cgroup, writing this file fails with EOPNOTSUPP as killing cgroups is a process directed operation, i.e. it affects the whole thread-group. ”h]”(jÑ)”}”(hŒcgroup.kill”h]”hŒcgroup.kill”…””}”(hjHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M(hjDubjá)”}”(hhh]”(hú)”}”(hŒ_A write-only single value file which exists in non-root cgroups. The only allowed value is "1".”h]”hŒcA write-only single value file which exists in non-root cgroups. The only allowed value is â€œ1â€.”…””}”(hjYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjVubhú)”}”(hŒ°Writing "1" to the file causes the cgroup and all descendant cgroups to be killed. This means that all processes located in the affected cgroup tree will be killed via SIGKILL.”h]”hŒ´Writing â€œ1â€ to the file causes the cgroup and all descendant cgroups to be killed. This means that all processes located in the affected cgroup tree will be killed via SIGKILL.”…””}”(hjgh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjVubhú)”}”(hŒhKilling a cgroup tree will deal with concurrent forks appropriately and is protected against migrations.”h]”hŒhKilling a cgroup tree will deal with concurrent forks appropriately and is protected against migrations.”…””}”(hjuh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M#hjVubhú)”}”(hŒ™In a threaded cgroup, writing this file fails with EOPNOTSUPP as killing cgroups is a process directed operation, i.e. it affects the whole thread-group.”h]”hŒ™In a threaded cgroup, writing this file fails with EOPNOTSUPP as killing cgroups is a process directed operation, i.e. it affects the whole thread-group.”…””}”(hjƒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M&hjVubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjDubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M(hj… ubjË)”}”(hX cgroup.pressure A read-write single value file that allowed values are "0" and "1". The default is "1". Writing "0" to the file will disable the cgroup PSI accounting. Writing "1" to the file will re-enable the cgroup PSI accounting. This control attribute is not hierarchical, so disable or enable PSI accounting in a cgroup does not affect PSI accounting in descendants and doesn't need pass enablement via ancestors from root. The reason this control attribute exists is that PSI accounts stalls for each cgroup separately and aggregates it at each level of the hierarchy. This may cause non-negligible overhead for some workloads when under deep level of the hierarchy, in which case this control attribute can be used to disable PSI accounting in the non-leaf cgroups. ”h]”(jÑ)”}”(hŒcgroup.pressure”h]”hŒcgroup.pressure”…””}”(hj¡h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M9hjubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file that allowed values are "0" and "1". The default is "1".”h]”hŒcA read-write single value file that allowed values are â€œ0â€ and â€œ1â€. The default is â€œ1â€.”…””}”(hj²h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M+hj¯ubhú)”}”(hŒWriting "0" to the file will disable the cgroup PSI accounting. Writing "1" to the file will re-enable the cgroup PSI accounting.”h]”hŒ‰Writing â€œ0â€ to the file will disable the cgroup PSI accounting. Writing â€œ1â€ to the file will re-enable the cgroup PSI accounting.”…””}”(hjÀh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M.hj¯ubhú)”}”(hŒÃThis control attribute is not hierarchical, so disable or enable PSI accounting in a cgroup does not affect PSI accounting in descendants and doesn't need pass enablement via ancestors from root.”h]”hŒÅThis control attribute is not hierarchical, so disable or enable PSI accounting in a cgroup does not affect PSI accounting in descendants and doesnâ€™t need pass enablement via ancestors from root.”…””}”(hjÎh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M1hj¯ubhú)”}”(hXWThe reason this control attribute exists is that PSI accounts stalls for each cgroup separately and aggregates it at each level of the hierarchy. This may cause non-negligible overhead for some workloads when under deep level of the hierarchy, in which case this control attribute can be used to disable PSI accounting in the non-leaf cgroups.”h]”hXWThe reason this control attribute exists is that PSI accounts stalls for each cgroup separately and aggregates it at each level of the hierarchy. This may cause non-negligible overhead for some workloads when under deep level of the hierarchy, in which case this control attribute can be used to disable PSI accounting in the non-leaf cgroups.”…””}”(hjÜh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M5hj¯ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M9hj… ubjË)”}”(hŒŸirq.pressure A read-write nested-keyed file. Shows pressure stall information for IRQ/SOFTIRQ. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”(jÑ)”}”(hŒirq.pressure”h]”hŒirq.pressure”…””}”(hjúh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M?hjöubjá)”}”(hhh]”(hú)”}”(hŒA read-write nested-keyed file.”h]”hŒA read-write nested-keyed file.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M` for details.”h]”(hŒ6Shows pressure stall information for IRQ/SOFTIRQ. See ”…””}”(hjh²hh³Nh´Nubh)”}”(hŒ-:ref:`Documentation/accounting/psi.rst `”h]”jl)”}”(hj#h]”hŒ Documentation/accounting/psi.rst”…””}”(hj%h²hh³Nh´Nubah}”(h]”h ]”(jwŒstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhj!ubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”j„Œ refdomain”j/Œreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆjŠŒpsi”uh1hh³hÃh´M>hjubhŒ for details.”…””}”(hjh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M>hjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjöubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M?hj… ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M\hjb h²hubeh}”(h]”Œcore-interface-files”ah ]”h"]”Œcore interface files”ah$]”h&]”uh1hÄhjhh²hh³hÃh´MXubeh}”(h]”Œinterface-files”ah ]”h"]”Œinterface files”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´MæubhÅ)”}”(hhh]”(hÊ)”}”(hŒControllers”h]”hŒControllers”…””}”(hjvh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjsh²hh³hÃh´MBubh¶)”}”(hŒ.. _cgroup-v2-cpu:”h]”h}”(h]”h ]”h"]”h$]”h&]”hÁŒ cgroup-v2-cpu”uh1hµh´MDhjsh²hh³hÃubhÅ)”}”(hhh]”(hÊ)”}”(hŒCPU”h]”hŒCPU”…””}”(hj’h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjh²hh³hÃh´MGubhú)”}”(hŒçThe "cpu" controllers regulates distribution of CPU cycles. This controller implements weight and absolute bandwidth limit models for normal scheduling policy and absolute bandwidth allocation model for realtime scheduling policy.”h]”hŒëThe â€œcpuâ€ controllers regulates distribution of CPU cycles. This controller implements weight and absolute bandwidth limit models for normal scheduling policy and absolute bandwidth allocation model for realtime scheduling policy.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MIhjh²hubhú)”}”(hXIn all the above models, cycles distribution is defined only on a temporal base and it does not account for the frequency at which tasks are executed. The (optional) utilization clamping support allows to hint the schedutil cpufreq governor about the minimum desired frequency which should always be provided by a CPU, as well as the maximum desired frequency, which should not be exceeded by a CPU.”h]”hXIn all the above models, cycles distribution is defined only on a temporal base and it does not account for the frequency at which tasks are executed. The (optional) utilization clamping support allows to hint the schedutil cpufreq governor about the minimum desired frequency which should always be provided by a CPU, as well as the maximum desired frequency, which should not be exceeded by a CPU.”…””}”(hj®h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MNhjh²hubhú)”}”(hX:WARNING: cgroup2 cpu controller doesn't yet support the (bandwidth) control of realtime processes. For a kernel built with the CONFIG_RT_GROUP_SCHED option enabled for group scheduling of realtime processes, the cpu controller can only be enabled when all RT processes are in the root cgroup. Be aware that system management software may already have placed RT processes into non-root cgroups during the system boot process, and these processes may need to be moved to the root cgroup before the cpu controller can be enabled with a CONFIG_RT_GROUP_SCHED enabled kernel.”h]”hX<WARNING: cgroup2 cpu controller doesnâ€™t yet support the (bandwidth) control of realtime processes. For a kernel built with the CONFIG_RT_GROUP_SCHED option enabled for group scheduling of realtime processes, the cpu controller can only be enabled when all RT processes are in the root cgroup. Be aware that system management software may already have placed RT processes into non-root cgroups during the system boot process, and these processes may need to be moved to the root cgroup before the cpu controller can be enabled with a CONFIG_RT_GROUP_SCHED enabled kernel.”…””}”(hj¼h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MUhjh²hubhú)”}”(hXrWith CONFIG_RT_GROUP_SCHED disabled, this limitation does not apply and some of the interface files either affect realtime processes or account for them. See the following section for details. Only the cpu controller is affected by CONFIG_RT_GROUP_SCHED. Other controllers can be used for the resource control of realtime processes irrespective of CONFIG_RT_GROUP_SCHED.”h]”hXrWith CONFIG_RT_GROUP_SCHED disabled, this limitation does not apply and some of the interface files either affect realtime processes or account for them. See the following section for details. Only the cpu controller is affected by CONFIG_RT_GROUP_SCHED. Other controllers can be used for the resource control of realtime processes irrespective of CONFIG_RT_GROUP_SCHED.”…””}”(hjÊh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M^hjh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒCPU Interface Files”h]”hŒCPU Interface Files”…””}”(hjÛh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjØh²hh³hÃh´Mfubhú)”}”(hŒÊThe interaction of a process with the cpu controller depends on its scheduling policy and the underlying scheduler. From the point of view of the cpu controller, processes can be categorized as follows:”h]”hŒÊThe interaction of a process with the cpu controller depends on its scheduling policy and the underlying scheduler. From the point of view of the cpu controller, processes can be categorized as follows:”…””}”(hjéh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhhjØh²hubj¾)”}”(hhh]”(jÃ)”}”(hŒ(Processes under the fair-class scheduler”h]”hú)”}”(hjüh]”hŒ(Processes under the fair-class scheduler”…””}”(hjþh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mlhjúubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj÷h²hh³hÃh´NubjÃ)”}”(hŒPProcesses under a BPF scheduler with the corresponding ``cgroup_set_*`` callback”h]”hú)”}”(hjh]”(hŒ7Processes under a BPF scheduler with the corresponding ”…””}”(hjh²hh³Nh´NubhŒliteral”“”)”}”(hŒ``cgroup_set_*``”h]”hŒcgroup_set_*”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjubhŒ callback”…””}”(hjh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mmhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj÷h²hh³hÃh´NubjÃ)”}”(hŒ†Everything else: ``SCHED_{FIFO,RR,DEADLINE}`` and processes under a BPF scheduler without the corresponding ``cgroup_set_*`` callback ”h]”hú)”}”(hŒ…Everything else: ``SCHED_{FIFO,RR,DEADLINE}`` and processes under a BPF scheduler without the corresponding ``cgroup_set_*`` callback”h]”(hŒEverything else: ”…””}”(hj@h²hh³Nh´Nubj)”}”(hŒ``SCHED_{FIFO,RR,DEADLINE}``”h]”hŒSCHED_{FIFO,RR,DEADLINE}”…””}”(hjHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj@ubhŒ? and processes under a BPF scheduler without the corresponding ”…””}”(hj@h²hh³Nh´Nubj)”}”(hŒ``cgroup_set_*``”h]”hŒcgroup_set_*”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj@ubhŒ callback”…””}”(hj@h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mnhj<ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj÷h²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*j+uh1j½h³hÃh´MlhjØh²hubhú)”}”(hŒ—For details on when a process is under the fair-class scheduler or a BPF scheduler, check out :ref:`Documentation/scheduler/sched-ext.rst `.”h]”(hŒ^For details on when a process is under the fair-class scheduler or a BPF scheduler, check out ”…””}”(hj~h²hh³Nh´Nubh)”}”(hŒ8:ref:`Documentation/scheduler/sched-ext.rst `”h]”jl)”}”(hjˆh]”hŒ%Documentation/scheduler/sched-ext.rst”…””}”(hjŠh²hh³Nh´Nubah}”(h]”h ]”(jwŒstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhj†ubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”j„Œ refdomain”j”Œreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆjŠŒ sched-ext”uh1hh³hÃh´Mqhj~ubhŒ.”…””}”(hj~h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MqhjØh²hubhú)”}”(hŒ|For each of the following interface files, the above categories will be referred to. All time durations are in microseconds.”h]”hŒ|For each of the following interface files, the above categories will be referred to. All time durations are in microseconds.”…””}”(hj°h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MthjØh²hubjÀ)”}”(hX2cpu.stat A read-only flat-keyed file. This file exists whether the controller is enabled or not. It always reports the following three stats, which account for all the processes in the cgroup (including those in descendant cgroups): - usage_usec - user_usec - system_usec and the following five when the controller is enabled, which account for only the processes under the fair-class scheduler: - nr_periods - nr_throttled - throttled_usec - nr_bursts - burst_usec Note that the above five CFS bandwidth stats are non-hierarchical; they only account for throttling caused by this cgroup's own bandwidth limit, not including throttling inherited from ancestor cgroups. cpu.stat.local A read-only flat-keyed file. This file exists whether the controller is enabled or not. It reports the following stat when the controller is enabled: - throttled_usec Unlike the ``throttled_usec`` reported by ``cpu.stat`` which accounts for throttling caused by this cgroup's own CFS bandwidth limit, ``cpu.stat.local`` reports the actual throttling time incurred by this cgroup's own runqueues, which may include throttling inherited from ancestor cgroup bandwidth limits. When the controller is not enabled, this stat is not reported. cpu.weight A read-write single value file which exists on non-root cgroups. The default is "100". For non idle groups (cpu.idle = 0), the weight is in the range [1, 10000]. If the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1), then the weight will show as a 0. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does. cpu.weight.nice A read-write single value file which exists on non-root cgroups. The default is "0". The nice value is in the range [-20, 19]. This interface file is an alternative interface for "cpu.weight" and allows reading and setting weight using the same values used by nice(2). Because the range is smaller and granularity is coarser for the nice values, the read value is the closest approximation of the current weight. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does. cpu.max A read-write two value file which exists on non-root cgroups. The default is "max 100000". The maximum bandwidth limit. It's in the following format:: $MAX $PERIOD which indicates that the group may consume up to $MAX in each $PERIOD duration. "max" for $MAX indicates no limit. If only one number is written, $MAX is updated. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_bandwidth`` callback depending on what the callback actually does. cpu.max.burst A read-write single value file which exists on non-root cgroups. The default is "0". The burst in the range [0, $MAX]. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_bandwidth`` callback depending on what the callback actually does. cpu.pressure A read-write nested-keyed file. Shows pressure stall information for CPU. See :ref:`Documentation/accounting/psi.rst ` for details. This file accounts for all the processes in the cgroup. cpu.uclamp.min A read-write single value file which exists on non-root cgroups. The default is "0", i.e. no utilization boosting. The requested minimum utilization (protection) as a percentage rational number, e.g. 12.34 for 12.34%. This interface allows reading and setting minimum utilization clamp values similar to the sched_setattr(2). This minimum utilization value is used to clamp the task specific minimum utilization clamp, including those of realtime processes. The requested minimum utilization (protection) is always capped by the current value for the maximum utilization (limit), i.e. `cpu.uclamp.max`. This file affects all the processes in the cgroup. cpu.uclamp.max A read-write single value file which exists on non-root cgroups. The default is "max". i.e. no utilization capping The requested maximum utilization (limit) as a percentage rational number, e.g. 98.76 for 98.76%. This interface allows reading and setting maximum utilization clamp values similar to the sched_setattr(2). This maximum utilization value is used to clamp the task specific maximum utilization clamp, including those of realtime processes. This file affects all the processes in the cgroup. cpu.idle A read-write single value file which exists on non-root cgroups. The default is 0. This is the cgroup analog of the per-task SCHED_IDLE sched policy. Setting this value to a 1 will make the scheduling policy of the cgroup SCHED_IDLE. The threads inside the cgroup will retain their own relative priorities, but the cgroup itself will be treated as very low priority relative to its peers. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_idle`` callback depending on what the callback actually does. ”h]”jÆ)”}”(hhh]”(jË)”}”(hX¢cpu.stat A read-only flat-keyed file. This file exists whether the controller is enabled or not. It always reports the following three stats, which account for all the processes in the cgroup (including those in descendant cgroups): - usage_usec - user_usec - system_usec and the following five when the controller is enabled, which account for only the processes under the fair-class scheduler: - nr_periods - nr_throttled - throttled_usec - nr_bursts - burst_usec Note that the above five CFS bandwidth stats are non-hierarchical; they only account for throttling caused by this cgroup's own bandwidth limit, not including throttling inherited from ancestor cgroups. ”h]”(jÑ)”}”(hŒcpu.stat”h]”hŒcpu.stat”…””}”(hjÉh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MhjÅubjá)”}”(hhh]”(hú)”}”(hŒWA read-only flat-keyed file. This file exists whether the controller is enabled or not.”h]”hŒWA read-only flat-keyed file. This file exists whether the controller is enabled or not.”…””}”(hjÚh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mxhj×ubhú)”}”(hŒ‡It always reports the following three stats, which account for all the processes in the cgroup (including those in descendant cgroups):”h]”hŒ‡It always reports the following three stats, which account for all the processes in the cgroup (including those in descendant cgroups):”…””}”(hjèh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M{hj×ubj¾)”}”(hhh]”(jÃ)”}”(hŒ usage_usec”h]”hú)”}”(hjûh]”hŒ usage_usec”…””}”(hjýh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M~hjùubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjöubjÃ)”}”(hŒ user_usec”h]”hú)”}”(hjh]”hŒ user_usec”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjöubjÃ)”}”(hŒsystem_usec ”h]”hú)”}”(hŒsystem_usec”h]”hŒsystem_usec”…””}”(hj+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M€hj'ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjöubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M~hj×ubhú)”}”(hŒ{and the following five when the controller is enabled, which account for only the processes under the fair-class scheduler:”h]”hŒ{and the following five when the controller is enabled, which account for only the processes under the fair-class scheduler:”…””}”(hjEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‚hj×ubj¾)”}”(hhh]”(jÃ)”}”(hŒ nr_periods”h]”hú)”}”(hjXh]”hŒ nr_periods”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M…hjVubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjSubjÃ)”}”(hŒnr_throttled”h]”hú)”}”(hjoh]”hŒnr_throttled”…””}”(hjqh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M†hjmubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjSubjÃ)”}”(hŒthrottled_usec”h]”hú)”}”(hj†h]”hŒthrottled_usec”…””}”(hjˆh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‡hj„ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjSubjÃ)”}”(hŒ nr_bursts”h]”hú)”}”(hjh]”hŒ nr_bursts”…””}”(hjŸh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mˆhj›ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjSubjÃ)”}”(hŒburst_usec ”h]”hú)”}”(hŒ burst_usec”h]”hŒ burst_usec”…””}”(hj¶h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‰hj²ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjSubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M…hj×ubhú)”}”(hŒÊNote that the above five CFS bandwidth stats are non-hierarchical; they only account for throttling caused by this cgroup's own bandwidth limit, not including throttling inherited from ancestor cgroups.”h]”hŒÌNote that the above five CFS bandwidth stats are non-hierarchical; they only account for throttling caused by this cgroupâ€™s own bandwidth limit, not including throttling inherited from ancestor cgroups.”…””}”(hjÐh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‹hj×ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÅubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MhjÂubjË)”}”(hX,cpu.stat.local A read-only flat-keyed file. This file exists whether the controller is enabled or not. It reports the following stat when the controller is enabled: - throttled_usec Unlike the ``throttled_usec`` reported by ``cpu.stat`` which accounts for throttling caused by this cgroup's own CFS bandwidth limit, ``cpu.stat.local`` reports the actual throttling time incurred by this cgroup's own runqueues, which may include throttling inherited from ancestor cgroup bandwidth limits. When the controller is not enabled, this stat is not reported. ”h]”(jÑ)”}”(hŒcpu.stat.local”h]”hŒcpu.stat.local”…””}”(hjîh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mžhjêubjá)”}”(hhh]”(hú)”}”(hŒWA read-only flat-keyed file. This file exists whether the controller is enabled or not.”h]”hŒWA read-only flat-keyed file. This file exists whether the controller is enabled or not.”…””}”(hjÿh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjüubhú)”}”(hŒ=It reports the following stat when the controller is enabled:”h]”hŒ=It reports the following stat when the controller is enabled:”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M“hjüubj¾)”}”(hhh]”jÃ)”}”(hŒthrottled_usec ”h]”hú)”}”(hŒthrottled_usec”h]”hŒthrottled_usec”…””}”(hj"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M•hjubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjubah}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M•hjüubhú)”}”(hX2Unlike the ``throttled_usec`` reported by ``cpu.stat`` which accounts for throttling caused by this cgroup's own CFS bandwidth limit, ``cpu.stat.local`` reports the actual throttling time incurred by this cgroup's own runqueues, which may include throttling inherited from ancestor cgroup bandwidth limits.”h]”(hŒUnlike the ”…””}”(hj<h²hh³Nh´Nubj)”}”(hŒ``throttled_usec``”h]”hŒthrottled_usec”…””}”(hjDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj<ubhŒ reported by ”…””}”(hj<h²hh³Nh´Nubj)”}”(hŒ``cpu.stat``”h]”hŒcpu.stat”…””}”(hjVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj<ubhŒR which accounts for throttling caused by this cgroupâ€™s own CFS bandwidth limit, ”…””}”(hj<h²hh³Nh´Nubj)”}”(hŒ``cpu.stat.local``”h]”hŒcpu.stat.local”…””}”(hjhh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj<ubhŒœ reports the actual throttling time incurred by this cgroupâ€™s own runqueues, which may include throttling inherited from ancestor cgroup bandwidth limits.”…””}”(hj<h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M—hjüubhú)”}”(hŒ>When the controller is not enabled, this stat is not reported.”h]”hŒ>When the controller is not enabled, this stat is not reported.”…””}”(hj€h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mžhjüubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjêubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MžhjÂubjË)”}”(hXÀcpu.weight A read-write single value file which exists on non-root cgroups. The default is "100". For non idle groups (cpu.idle = 0), the weight is in the range [1, 10000]. If the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1), then the weight will show as a 0. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does. ”h]”(jÑ)”}”(hŒ cpu.weight”h]”hŒ cpu.weight”…””}”(hjžh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¬hjšubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "100".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œ100â€.”…””}”(hj¯h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¡hj¬ubhú)”}”(hŒJFor non idle groups (cpu.idle = 0), the weight is in the range [1, 10000].”h]”hŒJFor non idle groups (cpu.idle = 0), the weight is in the range [1, 10000].”…””}”(hj½h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¤hj¬ubhú)”}”(hŒdIf the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1), then the weight will show as a 0.”h]”hŒdIf the cgroup has been configured to be SCHED_IDLE (cpu.idle = 1), then the weight will show as a 0.”…””}”(hjËh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M§hj¬ubhú)”}”(hŒ©This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does.”h]”(hŒ]This file affects only processes under the fair-class scheduler and a BPF scheduler with the ”…””}”(hjÙh²hh³Nh´Nubj)”}”(hŒ``cgroup_set_weight``”h]”hŒcgroup_set_weight”…””}”(hjáh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjÙubhŒ7 callback depending on what the callback actually does.”…””}”(hjÙh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mªhj¬ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjšubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¬hjÂubjË)”}”(hX\cpu.weight.nice A read-write single value file which exists on non-root cgroups. The default is "0". The nice value is in the range [-20, 19]. This interface file is an alternative interface for "cpu.weight" and allows reading and setting weight using the same values used by nice(2). Because the range is smaller and granularity is coarser for the nice values, the read value is the closest approximation of the current weight. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does. ”h]”(jÑ)”}”(hŒcpu.weight.nice”h]”hŒcpu.weight.nice”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¼hjubjá)”}”(hhh]”(hú)”}”(hŒUA read-write single value file which exists on non-root cgroups. The default is "0".”h]”hŒYA read-write single value file which exists on non-root cgroups. The default is â€œ0â€.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¯hjubhú)”}”(hŒ)The nice value is in the range [-20, 19].”h]”hŒ)The nice value is in the range [-20, 19].”…””}”(hj(h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M²hjubhú)”}”(hXThis interface file is an alternative interface for "cpu.weight" and allows reading and setting weight using the same values used by nice(2). Because the range is smaller and granularity is coarser for the nice values, the read value is the closest approximation of the current weight.”h]”hX"This interface file is an alternative interface for â€œcpu.weightâ€ and allows reading and setting weight using the same values used by nice(2). Because the range is smaller and granularity is coarser for the nice values, the read value is the closest approximation of the current weight.”…””}”(hj6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´hjubhú)”}”(hŒ©This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_weight`` callback depending on what the callback actually does.”h]”(hŒ]This file affects only processes under the fair-class scheduler and a BPF scheduler with the ”…””}”(hjDh²hh³Nh´Nubj)”}”(hŒ``cgroup_set_weight``”h]”hŒcgroup_set_weight”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjDubhŒ7 callback depending on what the callback actually does.”…””}”(hjDh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mºhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¼hjÂubjË)”}”(hXcpu.max A read-write two value file which exists on non-root cgroups. The default is "max 100000". The maximum bandwidth limit. It's in the following format:: $MAX $PERIOD which indicates that the group may consume up to $MAX in each $PERIOD duration. "max" for $MAX indicates no limit. If only one number is written, $MAX is updated. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_bandwidth`` callback depending on what the callback actually does. ”h]”(jÑ)”}”(hŒcpu.max”h]”hŒcpu.max”…””}”(hjth²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÌhjpubjá)”}”(hhh]”(hú)”}”(hŒZA read-write two value file which exists on non-root cgroups. The default is "max 100000".”h]”hŒ^A read-write two value file which exists on non-root cgroups. The default is â€œmax 100000â€.”…””}”(hj…h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¿hj‚ubhú)”}”(hŒ` for details. This file accounts for all the processes in the cgroup. ”h]”(jÑ)”}”(hŒcpu.pressure”h]”hŒcpu.pressure”…””}”(hjJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÞhjFubjá)”}”(hhh]”(hú)”}”(hŒA read-write nested-keyed file.”h]”hŒA read-write nested-keyed file.”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÙhjXubhú)”}”(hŒhShows pressure stall information for CPU. See :ref:`Documentation/accounting/psi.rst ` for details.”h]”(hŒ.Shows pressure stall information for CPU. See ”…””}”(hjih²hh³Nh´Nubh)”}”(hŒ-:ref:`Documentation/accounting/psi.rst `”h]”jl)”}”(hjsh]”hŒ Documentation/accounting/psi.rst”…””}”(hjuh²hh³Nh´Nubah}”(h]”h ]”(jwŒstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhjqubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”j„Œ refdomain”jŒreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆjŠŒpsi”uh1hh³hÃh´MÛhjiubhŒ for details.”…””}”(hjih²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÛhjXubhú)”}”(hŒ7This file accounts for all the processes in the cgroup.”h]”hŒ7This file accounts for all the processes in the cgroup.”…””}”(hj›h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÞhjXubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjFubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÞhjÂubjË)”}”(hX¡cpu.uclamp.min A read-write single value file which exists on non-root cgroups. The default is "0", i.e. no utilization boosting. The requested minimum utilization (protection) as a percentage rational number, e.g. 12.34 for 12.34%. This interface allows reading and setting minimum utilization clamp values similar to the sched_setattr(2). This minimum utilization value is used to clamp the task specific minimum utilization clamp, including those of realtime processes. The requested minimum utilization (protection) is always capped by the current value for the maximum utilization (limit), i.e. `cpu.uclamp.max`. This file affects all the processes in the cgroup. ”h]”(jÑ)”}”(hŒcpu.uclamp.min”h]”hŒcpu.uclamp.min”…””}”(hj¹h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mðhjµubjá)”}”(hhh]”(hú)”}”(hŒrA read-write single value file which exists on non-root cgroups. The default is "0", i.e. no utilization boosting.”h]”hŒvA read-write single value file which exists on non-root cgroups. The default is â€œ0â€, i.e. no utilization boosting.”…””}”(hjÊh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MáhjÇubhú)”}”(hŒfThe requested minimum utilization (protection) as a percentage rational number, e.g. 12.34 for 12.34%.”h]”hŒfThe requested minimum utilization (protection) as a percentage rational number, e.g. 12.34 for 12.34%.”…””}”(hjØh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MähjÇubhú)”}”(hŒïThis interface allows reading and setting minimum utilization clamp values similar to the sched_setattr(2). This minimum utilization value is used to clamp the task specific minimum utilization clamp, including those of realtime processes.”h]”hŒïThis interface allows reading and setting minimum utilization clamp values similar to the sched_setattr(2). This minimum utilization value is used to clamp the task specific minimum utilization clamp, including those of realtime processes.”…””}”(hjæh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MçhjÇubhú)”}”(hŒThe requested minimum utilization (protection) is always capped by the current value for the maximum utilization (limit), i.e. `cpu.uclamp.max`.”h]”(hŒThe requested minimum utilization (protection) is always capped by the current value for the maximum utilization (limit), i.e. ”…””}”(hjôh²hh³Nh´NubhŒtitle_reference”“”)”}”(hŒ`cpu.uclamp.max`”h]”hŒcpu.uclamp.max”…””}”(hjþh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jühjôubhŒ.”…””}”(hjôh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MìhjÇubhú)”}”(hŒ2This file affects all the processes in the cgroup.”h]”hŒ2This file affects all the processes in the cgroup.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MðhjÇubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjµubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MðhjÂubjË)”}”(hX cpu.uclamp.max A read-write single value file which exists on non-root cgroups. The default is "max". i.e. no utilization capping The requested maximum utilization (limit) as a percentage rational number, e.g. 98.76 for 98.76%. This interface allows reading and setting maximum utilization clamp values similar to the sched_setattr(2). This maximum utilization value is used to clamp the task specific maximum utilization clamp, including those of realtime processes. This file affects all the processes in the cgroup. ”h]”(jÑ)”}”(hŒcpu.uclamp.max”h]”hŒcpu.uclamp.max”…””}”(hj4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mþhj0ubjá)”}”(hhh]”(hú)”}”(hŒrA read-write single value file which exists on non-root cgroups. The default is "max". i.e. no utilization capping”h]”hŒvA read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€. i.e. no utilization capping”…””}”(hjEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MóhjBubhú)”}”(hŒaThe requested maximum utilization (limit) as a percentage rational number, e.g. 98.76 for 98.76%.”h]”hŒaThe requested maximum utilization (limit) as a percentage rational number, e.g. 98.76 for 98.76%.”…””}”(hjSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MöhjBubhú)”}”(hŒïThis interface allows reading and setting maximum utilization clamp values similar to the sched_setattr(2). This maximum utilization value is used to clamp the task specific maximum utilization clamp, including those of realtime processes.”h]”hŒïThis interface allows reading and setting maximum utilization clamp values similar to the sched_setattr(2). This maximum utilization value is used to clamp the task specific maximum utilization clamp, including those of realtime processes.”…””}”(hjah²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MùhjBubhú)”}”(hŒ2This file affects all the processes in the cgroup.”h]”hŒ2This file affects all the processes in the cgroup.”…””}”(hjoh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MþhjBubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MþhjÂubjË)”}”(hX8cpu.idle A read-write single value file which exists on non-root cgroups. The default is 0. This is the cgroup analog of the per-task SCHED_IDLE sched policy. Setting this value to a 1 will make the scheduling policy of the cgroup SCHED_IDLE. The threads inside the cgroup will retain their own relative priorities, but the cgroup itself will be treated as very low priority relative to its peers. This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_idle`` callback depending on what the callback actually does. ”h]”(jÑ)”}”(hŒcpu.idle”h]”hŒcpu.idle”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj‰ubjá)”}”(hhh]”(hú)”}”(hŒRA read-write single value file which exists on non-root cgroups. The default is 0.”h]”hŒRA read-write single value file which exists on non-root cgroups. The default is 0.”…””}”(hjžh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj›ubhú)”}”(hX1This is the cgroup analog of the per-task SCHED_IDLE sched policy. Setting this value to a 1 will make the scheduling policy of the cgroup SCHED_IDLE. The threads inside the cgroup will retain their own relative priorities, but the cgroup itself will be treated as very low priority relative to its peers.”h]”hX1This is the cgroup analog of the per-task SCHED_IDLE sched policy. Setting this value to a 1 will make the scheduling policy of the cgroup SCHED_IDLE. The threads inside the cgroup will retain their own relative priorities, but the cgroup itself will be treated as very low priority relative to its peers.”…””}”(hj¬h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj›ubhú)”}”(hŒ§This file affects only processes under the fair-class scheduler and a BPF scheduler with the ``cgroup_set_idle`` callback depending on what the callback actually does.”h]”(hŒ]This file affects only processes under the fair-class scheduler and a BPF scheduler with the ”…””}”(hjºh²hh³Nh´Nubj)”}”(hŒ``cgroup_set_idle``”h]”hŒcgroup_set_idle”…””}”(hjÂh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjºubhŒ7 callback depending on what the callback actually does.”…””}”(hjºh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj›ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj‰ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MhjÂubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj¾ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MwhjØh²hubeh}”(h]”Œcpu-interface-files”ah ]”h"]”Œcpu interface files”ah$]”h&]”uh1hÄhjh²hh³hÃh´Mfubeh}”(h]”(Œcpu”jŽeh ]”h"]”(Œcpu”Œ cgroup-v2-cpu”eh$]”h&]”uh1hÄhjsh²hh³hÃh´MGjÅ }”jj„sjÇ }”jŽj„subhÅ)”}”(hhh]”(hÊ)”}”(hŒMemory”h]”hŒMemory”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjh²hh³hÃh´Mubhú)”}”(hXThe "memory" controller regulates distribution of memory. Memory is stateful and implements both limit and protection models. Due to the intertwining between memory usage and reclaim pressure and the stateful nature of memory, the distribution model is relatively complex.”h]”hXThe â€œmemoryâ€ controller regulates distribution of memory. Memory is stateful and implements both limit and protection models. Due to the intertwining between memory usage and reclaim pressure and the stateful nature of memory, the distribution model is relatively complex.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjh²hubhú)”}”(hŒòWhile not completely water-tight, all major memory usages by a given cgroup are tracked so that the total memory consumption can be accounted and controlled to a reasonable extent. Currently, the following types of memory usages are tracked.”h]”hŒòWhile not completely water-tight, all major memory usages by a given cgroup are tracked so that the total memory consumption can be accounted and controlled to a reasonable extent. Currently, the following types of memory usages are tracked.”…””}”(hj$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjh²hubj¾)”}”(hhh]”(jÃ)”}”(hŒ3Userland memory - page cache and anonymous memory. ”h]”hú)”}”(hŒ2Userland memory - page cache and anonymous memory.”h]”hŒ2Userland memory - page cache and anonymous memory.”…””}”(hj9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj2h²hh³hÃh´NubjÃ)”}”(hŒ4Kernel data structures such as dentries and inodes. ”h]”hú)”}”(hŒ3Kernel data structures such as dentries and inodes.”h]”hŒ3Kernel data structures such as dentries and inodes.”…””}”(hjQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjMubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj2h²hh³hÃh´NubjÃ)”}”(hŒTCP socket buffers. ”h]”hú)”}”(hŒTCP socket buffers.”h]”hŒTCP socket buffers.”…””}”(hjih²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjeubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhj2h²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´Mhjh²hubhú)”}”(hŒ memory.reclaim Please note that the kernel can over or under reclaim from the target cgroup. If less bytes are reclaimed than the specified amount, -EAGAIN is returned. Please note that the proactive reclaim (triggered by this interface) is not meant to indicate memory pressure on the memory cgroup. Therefore socket memory balancing triggered by the memory reclaim normally is not exercised in this case. This means that the networking layer will not adapt based on reclaim induced by memory.reclaim. ”•h]”jÆ)”}”(hhh]”(jË)”}”(hŒ£memory.current A read-only single value file which exists on non-root cgroups. The total amount of memory currently being used by the cgroup and its descendants. ”h]”(jÑ)”}”(hŒmemory.current”h]”hŒmemory.current”…””}”(hj»h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M1hj·ubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only single value file which exists on non-root cgroups.”h]”hŒ?A read-only single value file which exists on non-root cgroups.”…””}”(hjÌh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M-hjÉubhú)”}”(hŒRThe total amount of memory currently being used by the cgroup and its descendants.”h]”hŒRThe total amount of memory currently being used by the cgroup and its descendants.”…””}”(hjÚh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M0hjÉubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj·ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M1hj´ubjË)”}”(hX´memory.min A read-write single value file which exists on non-root cgroups. The default is "0". Hard memory protection. If the memory usage of a cgroup is within its effective min boundary, the cgroup's memory won't be reclaimed under any conditions. If there is no unprotected reclaimable memory available, OOM killer is invoked. Above the effective min boundary (or effective low boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages. Effective min boundary is limited by memory.min values of ancestor cgroups. If there is memory.min overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parent's protection proportional to its actual memory usage below memory.min. Putting more memory than generally available under this protection is discouraged and may lead to constant OOMs. ”h]”(jÑ)”}”(hŒ memory.min”h]”hŒ memory.min”…””}”(hjøh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MHhjôubjá)”}”(hhh]”(hú)”}”(hŒUA read-write single value file which exists on non-root cgroups. The default is "0".”h]”hŒYA read-write single value file which exists on non-root cgroups. The default is â€œ0â€.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M4hjubhú)”}”(hXœHard memory protection. If the memory usage of a cgroup is within its effective min boundary, the cgroup's memory won't be reclaimed under any conditions. If there is no unprotected reclaimable memory available, OOM killer is invoked. Above the effective min boundary (or effective low boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages.”h]”hX Hard memory protection. If the memory usage of a cgroup is within its effective min boundary, the cgroupâ€™s memory wonâ€™t be reclaimed under any conditions. If there is no unprotected reclaimable memory available, OOM killer is invoked. Above the effective min boundary (or effective low boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M7hjubhú)”}”(hXAEffective min boundary is limited by memory.min values of ancestor cgroups. If there is memory.min overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parent's protection proportional to its actual memory usage below memory.min.”h]”hXCEffective min boundary is limited by memory.min values of ancestor cgroups. If there is memory.min overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parentâ€™s protection proportional to its actual memory usage below memory.min.”…””}”(hj%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M@hjubhú)”}”(hŒpPutting more memory than generally available under this protection is discouraged and may lead to constant OOMs.”h]”hŒpPutting more memory than generally available under this protection is discouraged and may lead to constant OOMs.”…””}”(hj3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MGhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjôubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MHhj´ubjË)”}”(hXmemory.low A read-write single value file which exists on non-root cgroups. The default is "0". Best-effort memory protection. If the memory usage of a cgroup is within its effective low boundary, the cgroup's memory won't be reclaimed unless there is no reclaimable memory available in unprotected cgroups. Above the effective low boundary (or effective min boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages. Effective low boundary is limited by memory.low values of ancestor cgroups. If there is memory.low overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parent's protection proportional to its actual memory usage below memory.low. Putting more memory than generally available under this protection is discouraged. ”h]”(jÑ)”}”(hŒ memory.low”h]”hŒ memory.low”…””}”(hjQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M_hjMubjá)”}”(hhh]”(hú)”}”(hŒUA read-write single value file which exists on non-root cgroups. The default is "0".”h]”hŒYA read-write single value file which exists on non-root cgroups. The default is â€œ0â€.”…””}”(hjbh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MKhj_ubhú)”}”(hX…Best-effort memory protection. If the memory usage of a cgroup is within its effective low boundary, the cgroup's memory won't be reclaimed unless there is no reclaimable memory available in unprotected cgroups. Above the effective low boundary (or effective min boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages.”h]”hX‰Best-effort memory protection. If the memory usage of a cgroup is within its effective low boundary, the cgroupâ€™s memory wonâ€™t be reclaimed unless there is no reclaimable memory available in unprotected cgroups. Above the effective low boundary (or effective min boundary if it is higher), pages are reclaimed proportionally to the overage, reducing reclaim pressure for smaller overages.”…””}”(hjph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MNhj_ubhú)”}”(hXAEffective low boundary is limited by memory.low values of ancestor cgroups. If there is memory.low overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parent's protection proportional to its actual memory usage below memory.low.”h]”hXCEffective low boundary is limited by memory.low values of ancestor cgroups. If there is memory.low overcommitment (child cgroup or cgroups are requiring more protected memory than parent will allow), then each child cgroup will get the part of parentâ€™s protection proportional to its actual memory usage below memory.low.”…””}”(hj~h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MWhj_ubhú)”}”(hŒRPutting more memory than generally available under this protection is discouraged.”h]”hŒRPutting more memory than generally available under this protection is discouraged.”…””}”(hjŒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M^hj_ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjMubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M_hj´ubjË)”}”(hX!memory.high A read-write single value file which exists on non-root cgroups. The default is "max". Memory usage throttle limit. If a cgroup's usage goes over the high boundary, the processes of the cgroup are throttled and put under heavy reclaim pressure. Going over the high limit never invokes the OOM killer and under extreme conditions the limit may be breached. The high limit should be used in scenarios where an external process monitors the limited cgroup to alleviate heavy reclaim pressure. If memory.high is opened with O_NONBLOCK then the synchronous reclaim is bypassed. This is useful for admin processes that need to dynamically adjust the job's memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or get throttled on its next charge request. Please note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim. ”h]”(jÑ)”}”(hŒmemory.high”h]”hŒmemory.high”…””}”(hjªh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Myhj¦ubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hj»h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mbhj¸ubhú)”}”(hŒžMemory usage throttle limit. If a cgroup's usage goes over the high boundary, the processes of the cgroup are throttled and put under heavy reclaim pressure.”h]”hŒ Memory usage throttle limit. If a cgroupâ€™s usage goes over the high boundary, the processes of the cgroup are throttled and put under heavy reclaim pressure.”…””}”(hjÉh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mehj¸ubhú)”}”(hŒôGoing over the high limit never invokes the OOM killer and under extreme conditions the limit may be breached. The high limit should be used in scenarios where an external process monitors the limited cgroup to alleviate heavy reclaim pressure.”h]”hŒôGoing over the high limit never invokes the OOM killer and under extreme conditions the limit may be breached. The high limit should be used in scenarios where an external process monitors the limited cgroup to alleviate heavy reclaim pressure.”…””}”(hj×h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mihj¸ubhú)”}”(hX@If memory.high is opened with O_NONBLOCK then the synchronous reclaim is bypassed. This is useful for admin processes that need to dynamically adjust the job's memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or get throttled on its next charge request.”h]”hXBIf memory.high is opened with O_NONBLOCK then the synchronous reclaim is bypassed. This is useful for admin processes that need to dynamically adjust the jobâ€™s memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or get throttled on its next charge request.”…””}”(hjåh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mohj¸ubhú)”}”(hŒãPlease note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim.”h]”hŒãPlease note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim.”…””}”(hjóh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mvhj¸ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¦ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Myhj´ubjË)”}”(hXÌmemory.max A read-write single value file which exists on non-root cgroups. The default is "max". Memory usage hard limit. This is the main mechanism to limit memory usage of a cgroup. If a cgroup's memory usage reaches this limit and can't be reduced, the OOM killer is invoked in the cgroup. Under certain circumstances, the usage may go over the limit temporarily. In default configuration regular 0-order allocations always succeed unless OOM killer chooses current task as a victim. Some kinds of allocations don't invoke the OOM killer. Caller could retry them differently, return into userspace as -ENOMEM or silently ignore in cases like disk readahead. If memory.max is opened with O_NONBLOCK, then the synchronous reclaim and oom-kill are bypassed. This is useful for admin processes that need to dynamically adjust the job's memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or oom-kill on its next charge request. Please note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim. ”h]”(jÑ)”}”(hŒ memory.max”h]”hŒ memory.max”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M–hj ubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hj"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M|hjubhú)”}”(hXMemory usage hard limit. This is the main mechanism to limit memory usage of a cgroup. If a cgroup's memory usage reaches this limit and can't be reduced, the OOM killer is invoked in the cgroup. Under certain circumstances, the usage may go over the limit temporarily.”h]”hXMemory usage hard limit. This is the main mechanism to limit memory usage of a cgroup. If a cgroupâ€™s memory usage reaches this limit and canâ€™t be reduced, the OOM killer is invoked in the cgroup. Under certain circumstances, the usage may go over the limit temporarily.”…””}”(hj0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjubhú)”}”(hŒwIn default configuration regular 0-order allocations always succeed unless OOM killer chooses current task as a victim.”h]”hŒwIn default configuration regular 0-order allocations always succeed unless OOM killer chooses current task as a victim.”…””}”(hj>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M…hjubhú)”}”(hŒSome kinds of allocations don't invoke the OOM killer. Caller could retry them differently, return into userspace as -ENOMEM or silently ignore in cases like disk readahead.”h]”hŒ¯Some kinds of allocations donâ€™t invoke the OOM killer. Caller could retry them differently, return into userspace as -ENOMEM or silently ignore in cases like disk readahead.”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mˆhjubhú)”}”(hXIIf memory.max is opened with O_NONBLOCK, then the synchronous reclaim and oom-kill are bypassed. This is useful for admin processes that need to dynamically adjust the job's memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or oom-kill on its next charge request.”h]”hXKIf memory.max is opened with O_NONBLOCK, then the synchronous reclaim and oom-kill are bypassed. This is useful for admin processes that need to dynamically adjust the jobâ€™s memory limits without expending their own CPU resources on memory reclamation. The job will trigger the reclaim and/or oom-kill on its next charge request.”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŒhjubhú)”}”(hŒãPlease note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim.”h]”hŒãPlease note that with O_NONBLOCK, there is a chance that the target memory cgroup may take indefinite amount of time to reduce usage below the limit due to delayed charge request or busy-hitting its memory to slow down reclaim.”…””}”(hjhh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M“hjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M–hj´ubjË)”}”(hX«memory.reclaim A write-only nested-keyed file which exists for all cgroups. This is a simple interface to trigger memory reclaim in the target cgroup. Example:: echo "1G" > memory.reclaim Please note that the kernel can over or under reclaim from the target cgroup. If less bytes are reclaimed than the specified amount, -EAGAIN is returned. Please note that the proactive reclaim (triggered by this interface) is not meant to indicate memory pressure on the memory cgroup. Therefore socket memory balancing triggered by the memory reclaim normally is not exercised in this case. This means that the networking layer will not adapt based on reclaim induced by memory.reclaim. ”h]”(jÑ)”}”(hŒmemory.reclaim”h]”hŒmemory.reclaim”…””}”(hj†h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M«hj‚ubjá)”}”(hhh]”(hú)”}”(hŒ memory.reclaim”h]”hŒecho "1G" > memory.reclaim”…””}”hjÁsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M hj”ubhú)”}”(hŒ™Please note that the kernel can over or under reclaim from the target cgroup. If less bytes are reclaimed than the specified amount, -EAGAIN is returned.”h]”hŒ™Please note that the kernel can over or under reclaim from the target cgroup. If less bytes are reclaimed than the specified amount, -EAGAIN is returned.”…””}”(hjÏh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¢hj”ubhú)”}”(hXMPlease note that the proactive reclaim (triggered by this interface) is not meant to indicate memory pressure on the memory cgroup. Therefore socket memory balancing triggered by the memory reclaim normally is not exercised in this case. This means that the networking layer will not adapt based on reclaim induced by memory.reclaim.”h]”hXMPlease note that the proactive reclaim (triggered by this interface) is not meant to indicate memory pressure on the memory cgroup. Therefore socket memory balancing triggered by the memory reclaim normally is not exercised in this case. This means that the networking layer will not adapt based on reclaim induced by memory.reclaim.”…””}”(hjÝh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¦hj”ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj‚ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M«hj´ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj°ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M,hj‘h²hubhú)”}”(hŒ&The following nested keys are defined.”h]”hŒ&The following nested keys are defined.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj‘h²hubjÀ)”}”(hXH ========== ================================ swappiness Swappiness value to reclaim with ========== ================================ Specifying a swappiness value instructs the kernel to perform the reclaim with that swappiness value. Note that this has the same semantics as vm.swappiness applied to memcg reclaim with all the existing limitations and potential future extensions. The valid range for swappiness is [0-200, max], setting swappiness=max exclusively reclaims anonymous memory. memory.peak A read-write single value file which exists on non-root cgroups. The max memory usage recorded for the cgroup and its descendants since either the creation of the cgroup or the most recent reset for that FD. A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor. memory.oom.group A read-write single value file which exists on non-root cgroups. The default value is "0". Determines whether the cgroup should be treated as an indivisible workload by the OOM killer. If set, all tasks belonging to the cgroup or to its descendants (if the memory cgroup is not a leaf cgroup) are killed together or not at all. This can be used to avoid partial kills to guarantee workload integrity. Tasks with the OOM protection (oom_score_adj set to -1000) are treated as an exception and are never killed. If the OOM killer is invoked in a cgroup, it's not going to kill any tasks outside of this cgroup, regardless memory.oom.group values of ancestor cgroups. memory.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. Note that all fields in this file are hierarchical and the file modified event can be generated due to an event down the hierarchy. For the local events at the cgroup level see memory.events.local. low The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed. high The number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this event's occurrences are expected. max The number of times the cgroup's memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state. oom The number of time the cgroup's memory usage was reached the limit and allocation was about to fail. This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts. oom_kill The number of processes belonging to this cgroup killed by any kind of OOM killer. oom_group_kill The number of times a group OOM has occurred. sock_throttled The number of times network sockets associated with this cgroup are throttled. memory.events.local Similar to memory.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. memory.stat A read-only flat-keyed file which exists on non-root cgroups. This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information on the state and past events of the memory management system. All memory amounts are in bytes. The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values! If the entry has no per-node counter (or not show in the memory.numa_stat). We use 'npn' (non-per-node) as the tag to indicate that it will not show in the memory.numa_stat. anon Amount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore. file Amount of memory used to cache filesystem data, including tmpfs and shared memory. kernel (npn) Amount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases. kernel_stack Amount of memory allocated to kernel stacks. pagetables Amount of memory allocated for page tables. sec_pagetables Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables. percpu (npn) Amount of memory used for storing per-cpu kernel data structures. sock (npn) Amount of memory used in network transmission buffers vmalloc Amount of memory used for vmap backed memory. shmem Amount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s zswap Amount of memory consumed by the zswap compression backend. zswapped Amount of application memory swapped out to zswap. file_mapped Amount of cached filesystem data mapped with mmap(). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not not all the memory of such an allocation is mapped. file_dirty Amount of cached filesystem data that was modified but not yet written back to disk file_writeback Amount of cached filesystem data that was modified and is currently being written back to disk swapcached Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage. anon_thp Amount of memory used in anonymous mappings backed by transparent hugepages file_thp Amount of cached filesystem data backed by transparent hugepages shmem_thp Amount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages inactive_anon, active_anon, inactive_file, active_file, unevictable Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm. As these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based. slab_reclaimable Part of "slab" that might be reclaimed, such as dentries and inodes. slab_unreclaimable Part of "slab" that cannot be reclaimed on memory pressure. slab (npn) Amount of memory used for storing in-kernel data structures. workingset_refault_anon Number of refaults of previously evicted anonymous pages. workingset_refault_file Number of refaults of previously evicted file pages. workingset_activate_anon Number of refaulted anonymous pages that were immediately activated. workingset_activate_file Number of refaulted file pages that were immediately activated. workingset_restore_anon Number of restored anonymous pages which have been detected as an active workingset before they got reclaimed. workingset_restore_file Number of restored file pages which have been detected as an active workingset before they got reclaimed. workingset_nodereclaim Number of times a shadow node has been reclaimed pswpin (npn) Number of pages swapped into memory pswpout (npn) Number of pages swapped out of memory pgscan (npn) Amount of scanned pages (in an inactive LRU list) pgsteal (npn) Amount of reclaimed pages pgscan_kswapd (npn) Amount of scanned pages by kswapd (in an inactive LRU list) pgscan_direct (npn) Amount of scanned pages directly (in an inactive LRU list) pgscan_khugepaged (npn) Amount of scanned pages by khugepaged (in an inactive LRU list) pgscan_proactive (npn) Amount of scanned pages proactively (in an inactive LRU list) pgsteal_kswapd (npn) Amount of reclaimed pages by kswapd pgsteal_direct (npn) Amount of reclaimed pages directly pgsteal_khugepaged (npn) Amount of reclaimed pages by khugepaged pgsteal_proactive (npn) Amount of reclaimed pages proactively pgfault (npn) Total number of page faults incurred pgmajfault (npn) Number of major page faults incurred pgrefill (npn) Amount of scanned pages (in an active LRU list) pgactivate (npn) Amount of pages moved to the active LRU list pgdeactivate (npn) Amount of pages moved to the inactive LRU list pglazyfree (npn) Amount of pages postponed to be freed under memory pressure pglazyfreed (npn) Amount of reclaimed lazyfree pages swpin_zero Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout. swpout_zero Number of zero-filled pages swapped out with I/O skipped due to the content being detected as zero. zswpin Number of pages moved in to memory from zswap. zswpout Number of pages moved out of memory to zswap. zswpwb Number of pages written from zswap to swap. zswap_incomp Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is. thp_fault_alloc (npn) Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_collapse_alloc (npn) Number of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_swpout (npn) Number of transparent hugepages which are swapout in one piece without splitting. thp_swpout_fallback (npn) Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page. numa_pages_migrated (npn) Number of pages migrated by NUMA balancing. numa_pte_updates (npn) Number of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access. numa_hint_faults (npn) Number of NUMA hinting faults. pgdemote_kswapd Number of pages demoted by kswapd. pgdemote_direct Number of pages demoted directly. pgdemote_khugepaged Number of pages demoted by khugepaged. pgdemote_proactive Number of pages demoted by proactively. hugetlb Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option). memory.numa_stat A read-only nested-keyed file which exists on non-root cgroups. This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information per node on the state of the memory management system. This is useful for providing visibility into the NUMA locality information within an memcg since the pages are allowed to be allocated from any physical node. One of the use case is evaluating application performance by combining this information with the application's CPU allocation. All memory amounts are in bytes. The output format of memory.numa_stat is:: type N0= N1= ... The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values! The entries can refer to the memory.stat. memory.swap.current A read-only single value file which exists on non-root cgroups. The total amount of swap currently being used by the cgroup and its descendants. memory.swap.high A read-write single value file which exists on non-root cgroups. The default is "max". Swap usage throttle limit. If a cgroup's swap usage exceeds this limit, all its further allocations will be throttled to allow userspace to implement custom out-of-memory procedures. This limit marks a point of no return for the cgroup. It is NOT designed to manage the amount of swapping a workload does during regular operation. Compare to memory.swap.max, which prohibits swapping past a set amount, but lets the cgroup continue unimpeded as long as other memory can be reclaimed. Healthy workloads are not expected to reach this limit. memory.swap.peak A read-write single value file which exists on non-root cgroups. The max swap usage recorded for the cgroup and its descendants since the creation of the cgroup or the most recent reset for that FD. A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor. memory.swap.max A read-write single value file which exists on non-root cgroups. The default is "max". Swap usage hard limit. If a cgroup's swap usage reaches this limit, anonymous memory of the cgroup will not be swapped out. memory.swap.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. high The number of times the cgroup's swap usage was over the high threshold. max The number of times the cgroup's swap usage was about to go over the max boundary and swap allocation failed. fail The number of times swap allocation failed either because of running out of swap system-wide or max limit. When reduced under the current usage, the existing swap entries are reclaimed gradually and the swap usage may stay higher than the limit for an extended period of time. This reduces the impact on the workload and memory management. memory.zswap.current A read-only single value file which exists on non-root cgroups. The total amount of memory consumed by the zswap compression backend. memory.zswap.max A read-write single value file which exists on non-root cgroups. The default is "max". Zswap usage hard limit. If a cgroup's zswap pool reaches this limit, it will refuse to take any more stores before existing entries fault back in or are written out to disk. memory.zswap.writeback A read-write single value file. The default value is "1". Note that this setting is hierarchical, i.e. the writeback would be implicitly disabled for child cgroups if the upper hierarchy does so. When this is set to 0, all swapping attempts to swapping devices are disabled. This included both zswap writebacks, and swapping due to zswap store failures. If the zswap store failures are recurring (for e.g if the pages are incompressible), users can observe reclaim inefficiency after disabling writeback (because the same pages might be rejected again and again). Note that this is subtly different from setting memory.swap.max to 0, as it still allows for pages to be written to the zswap pool. This setting has no effect if zswap is disabled, and swapping is allowed unless memory.swap.max is set to 0. memory.pressure A read-write nested-keyed file. Shows pressure stall information for memory. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”(jÀ)”}”(hX ========== ================================ swappiness Swappiness value to reclaim with ========== ================================ Specifying a swappiness value instructs the kernel to perform the reclaim with that swappiness value. Note that this has the same semantics as vm.swappiness applied to memcg reclaim with all the existing limitations and potential future extensions. The valid range for swappiness is [0-200, max], setting swappiness=max exclusively reclaims anonymous memory. ”h]”(jÀ)”}”(hŒ¥========== ================================ swappiness Swappiness value to reclaim with ========== ================================ ”h]”hŒtable”“”)”}”(hhh]”hŒtgroup”“”)”}”(hhh]”(hŒcolspec”“”)”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hj$ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hj$ubhŒtbody”“”)”}”(hhh]”hŒrow”“”)”}”(hhh]”(hŒentry”“”)”}”(hhh]”hú)”}”(hŒ swappiness”h]”hŒ swappiness”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M°hjIubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjDubjH)”}”(hhh]”hú)”}”(hŒ Swappiness value to reclaim with”h]”hŒ Swappiness value to reclaim with”…””}”(hjch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M°hj`ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjDubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj?ubah}”(h]”h ]”h"]”h$]”h&]”uh1j=hj$ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M¯hjubhú)”}”(hŒøSpecifying a swappiness value instructs the kernel to perform the reclaim with that swappiness value. Note that this has the same semantics as vm.swappiness applied to memcg reclaim with all the existing limitations and potential future extensions.”h]”hŒøSpecifying a swappiness value instructs the kernel to perform the reclaim with that swappiness value. Note that this has the same semantics as vm.swappiness applied to memcg reclaim with all the existing limitations and potential future extensions.”…””}”(hj–h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³hjubhú)”}”(hŒmThe valid range for swappiness is [0-200, max], setting swappiness=max exclusively reclaims anonymous memory.”h]”hŒmThe valid range for swappiness is [0-200, max], setting swappiness=max exclusively reclaims anonymous memory.”…””}”(hj¤h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¸hjubeh}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M¯hjubjÆ)”}”(hhh]”(jË)”}”(hXhmemory.peak A read-write single value file which exists on non-root cgroups. The max memory usage recorded for the cgroup and its descendants since either the creation of the cgroup or the most recent reset for that FD. A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor. ”h]”(jÑ)”}”(hŒmemory.peak”h]”hŒmemory.peak”…””}”(hj¿h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÃhj»ubjá)”}”(hhh]”(hú)”}”(hŒ@A read-write single value file which exists on non-root cgroups.”h]”hŒ@A read-write single value file which exists on non-root cgroups.”…””}”(hjÐh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¼hjÍubhú)”}”(hŒŽThe max memory usage recorded for the cgroup and its descendants since either the creation of the cgroup or the most recent reset for that FD.”h]”hŒŽThe max memory usage recorded for the cgroup and its descendants since either the creation of the cgroup or the most recent reset for that FD.”…””}”(hjÞh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¾hjÍubhú)”}”(hŒ‰A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor.”h]”hŒ‰A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor.”…””}”(hjìh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÁhjÍubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj»ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÃhj¸ubjË)”}”(hX®memory.oom.group A read-write single value file which exists on non-root cgroups. The default value is "0". Determines whether the cgroup should be treated as an indivisible workload by the OOM killer. If set, all tasks belonging to the cgroup or to its descendants (if the memory cgroup is not a leaf cgroup) are killed together or not at all. This can be used to avoid partial kills to guarantee workload integrity. Tasks with the OOM protection (oom_score_adj set to -1000) are treated as an exception and are never killed. If the OOM killer is invoked in a cgroup, it's not going to kill any tasks outside of this cgroup, regardless memory.oom.group values of ancestor cgroups. ”h]”(jÑ)”}”(hŒmemory.oom.group”h]”hŒmemory.oom.group”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÕhjubjá)”}”(hhh]”(hú)”}”(hŒ[A read-write single value file which exists on non-root cgroups. The default value is "0".”h]”hŒ_A read-write single value file which exists on non-root cgroups. The default value is â€œ0â€.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÆhjubhú)”}”(hX5Determines whether the cgroup should be treated as an indivisible workload by the OOM killer. If set, all tasks belonging to the cgroup or to its descendants (if the memory cgroup is not a leaf cgroup) are killed together or not at all. This can be used to avoid partial kills to guarantee workload integrity.”h]”hX5Determines whether the cgroup should be treated as an indivisible workload by the OOM killer. If set, all tasks belonging to the cgroup or to its descendants (if the memory cgroup is not a leaf cgroup) are killed together or not at all. This can be used to avoid partial kills to guarantee workload integrity.”…””}”(hj)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÉhjubhú)”}”(hŒlTasks with the OOM protection (oom_score_adj set to -1000) are treated as an exception and are never killed.”h]”hŒlTasks with the OOM protection (oom_score_adj set to -1000) are treated as an exception and are never killed.”…””}”(hj7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÐhjubhú)”}”(hŒšIf the OOM killer is invoked in a cgroup, it's not going to kill any tasks outside of this cgroup, regardless memory.oom.group values of ancestor cgroups.”h]”hŒœIf the OOM killer is invoked in a cgroup, itâ€™s not going to kill any tasks outside of this cgroup, regardless memory.oom.group values of ancestor cgroups.”…””}”(hjEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÓhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÕhj¸ubjË)”}”(hXÜmemory.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. Note that all fields in this file are hierarchical and the file modified event can be generated due to an event down the hierarchy. For the local events at the cgroup level see memory.events.local. low The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed. high The number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this event's occurrences are expected. max The number of times the cgroup's memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state. oom The number of time the cgroup's memory usage was reached the limit and allocation was about to fail. This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts. oom_kill The number of processes belonging to this cgroup killed by any kind of OOM killer. oom_group_kill The number of times a group OOM has occurred. sock_throttled The number of times network sockets associated with this cgroup are throttled. ”h]”(jÑ)”}”(hŒ memory.events”h]”hŒ memory.events”…””}”(hjch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj_ubjá)”}”(hhh]”(hú)”}”(hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”h]”hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”…””}”(hjth²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MØhjqubhú)”}”(hŒÅNote that all fields in this file are hierarchical and the file modified event can be generated due to an event down the hierarchy. For the local events at the cgroup level see memory.events.local.”h]”hŒÅNote that all fields in this file are hierarchical and the file modified event can be generated due to an event down the hierarchy. For the local events at the cgroup level see memory.events.local.”…””}”(hj‚h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÝhjqubjÀ)”}”(hXlow The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed. high The number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this event's occurrences are expected. max The number of times the cgroup's memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state. oom The number of time the cgroup's memory usage was reached the limit and allocation was about to fail. This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts. oom_kill The number of processes belonging to this cgroup killed by any kind of OOM killer. oom_group_kill The number of times a group OOM has occurred. sock_throttled The number of times network sockets associated with this cgroup are throttled. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ¾low The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed. ”h]”(jÑ)”}”(hŒlow”h]”hŒlow”…””}”(hj›h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mæhj—ubjá)”}”(hhh]”hú)”}”(hŒ¹The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed.”h]”hŒ¹The number of times the cgroup is reclaimed due to high memory pressure even though its usage is under the low boundary. This usually indicates that the low boundary is over-committed.”…””}”(hj¬h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mãhj©ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj—ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mæhj”ubjË)”}”(hX"high The number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this event's occurrences are expected. ”h]”(jÑ)”}”(hŒhigh”h]”hŒhigh”…””}”(hjÊh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MîhjÆubjá)”}”(hhh]”hú)”}”(hXThe number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this event's occurrences are expected.”h]”hXThe number of times processes of the cgroup are throttled and routed to perform direct memory reclaim because the high memory boundary was exceeded. For a cgroup whose memory usage is capped by the high limit rather than global memory pressure, this eventâ€™s occurrences are expected.”…””}”(hjÛh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MéhjØubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÆubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mîhj”ubjË)”}”(hŒ¢max The number of times the cgroup's memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state. ”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hjùh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Móhjõubjá)”}”(hhh]”hú)”}”(hŒThe number of times the cgroup's memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state.”h]”hŒŸThe number of times the cgroupâ€™s memory usage was about to go over the max boundary. If direct reclaim fails to bring it down, the cgroup goes to OOM state.”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mñhj ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjõubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Móhj”ubjË)”}”(hXoom The number of time the cgroup's memory usage was reached the limit and allocation was about to fail. This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts. ”h]”(jÑ)”}”(hŒoom”h]”hŒoom”…””}”(hj( h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mûhj$ ubjá)”}”(hhh]”(hú)”}”(hŒdThe number of time the cgroup's memory usage was reached the limit and allocation was about to fail.”h]”hŒfThe number of time the cgroupâ€™s memory usage was reached the limit and allocation was about to fail.”…””}”(hj9 h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Möhj6 ubhú)”}”(hŒ›This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts.”h]”hŒ›This event is not raised if the OOM killer is not considered as an option, e.g. for failed high-order allocations or if caller asked to not retry attempts.”…””}”(hjG h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mùhj6 ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj$ ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mûhj”ubjË)”}”(hŒ\oom_kill The number of processes belonging to this cgroup killed by any kind of OOM killer. ”h]”(jÑ)”}”(hŒoom_kill”h]”hŒoom_kill”…””}”(hje h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mÿhja ubjá)”}”(hhh]”hú)”}”(hŒRThe number of processes belonging to this cgroup killed by any kind of OOM killer.”h]”hŒRThe number of processes belonging to this cgroup killed by any kind of OOM killer.”…””}”(hjv h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mþhjs ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhja ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mÿhj”ubjË)”}”(hŒ=oom_group_kill The number of times a group OOM has occurred. ”h]”(jÑ)”}”(hŒoom_group_kill”h]”hŒoom_group_kill”…””}”(hj” h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj ubjá)”}”(hhh]”hú)”}”(hŒ-The number of times a group OOM has occurred.”h]”hŒ-The number of times a group OOM has occurred.”…””}”(hj¥ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj¢ ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”ubjË)”}”(hŒ^sock_throttled The number of times network sockets associated with this cgroup are throttled. ”h]”(jÑ)”}”(hŒsock_throttled”h]”hŒsock_throttled”…””}”(hjÃ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj¿ ubjá)”}”(hhh]”hú)”}”(hŒNThe number of times network sockets associated with this cgroup are throttled.”h]”hŒNThe number of times network sockets associated with this cgroup are throttled.”…””}”(hjÔ h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÑ ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¿ ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´Mâhjqubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj_ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj¸ubjË)”}”(hŒÆmemory.events.local Similar to memory.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”(jÑ)”}”(hŒmemory.events.local”h]”hŒmemory.events.local”…””}”(hj !h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj!ubjá)”}”(hhh]”hú)”}”(hŒ±Similar to memory.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”h]”hŒ±Similar to memory.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”…””}”(hj!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj!ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj¸ubjË)”}”(hXA memory.stat A read-only flat-keyed file which exists on non-root cgroups. This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information on the state and past events of the memory management system. All memory amounts are in bytes. The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values! If the entry has no per-node counter (or not show in the memory.numa_stat). We use 'npn' (non-per-node) as the tag to indicate that it will not show in the memory.numa_stat. anon Amount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore. file Amount of memory used to cache filesystem data, including tmpfs and shared memory. kernel (npn) Amount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases. kernel_stack Amount of memory allocated to kernel stacks. pagetables Amount of memory allocated for page tables. sec_pagetables Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables. percpu (npn) Amount of memory used for storing per-cpu kernel data structures. sock (npn) Amount of memory used in network transmission buffers vmalloc Amount of memory used for vmap backed memory. shmem Amount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s zswap Amount of memory consumed by the zswap compression backend. zswapped Amount of application memory swapped out to zswap. file_mapped Amount of cached filesystem data mapped with mmap(). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not not all the memory of such an allocation is mapped. file_dirty Amount of cached filesystem data that was modified but not yet written back to disk file_writeback Amount of cached filesystem data that was modified and is currently being written back to disk swapcached Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage. anon_thp Amount of memory used in anonymous mappings backed by transparent hugepages file_thp Amount of cached filesystem data backed by transparent hugepages shmem_thp Amount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages inactive_anon, active_anon, inactive_file, active_file, unevictable Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm. As these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based. slab_reclaimable Part of "slab" that might be reclaimed, such as dentries and inodes. slab_unreclaimable Part of "slab" that cannot be reclaimed on memory pressure. slab (npn) Amount of memory used for storing in-kernel data structures. workingset_refault_anon Number of refaults of previously evicted anonymous pages. workingset_refault_file Number of refaults of previously evicted file pages. workingset_activate_anon Number of refaulted anonymous pages that were immediately activated. workingset_activate_file Number of refaulted file pages that were immediately activated. workingset_restore_anon Number of restored anonymous pages which have been detected as an active workingset before they got reclaimed. workingset_restore_file Number of restored file pages which have been detected as an active workingset before they got reclaimed. workingset_nodereclaim Number of times a shadow node has been reclaimed pswpin (npn) Number of pages swapped into memory pswpout (npn) Number of pages swapped out of memory pgscan (npn) Amount of scanned pages (in an inactive LRU list) pgsteal (npn) Amount of reclaimed pages pgscan_kswapd (npn) Amount of scanned pages by kswapd (in an inactive LRU list) pgscan_direct (npn) Amount of scanned pages directly (in an inactive LRU list) pgscan_khugepaged (npn) Amount of scanned pages by khugepaged (in an inactive LRU list) pgscan_proactive (npn) Amount of scanned pages proactively (in an inactive LRU list) pgsteal_kswapd (npn) Amount of reclaimed pages by kswapd pgsteal_direct (npn) Amount of reclaimed pages directly pgsteal_khugepaged (npn) Amount of reclaimed pages by khugepaged pgsteal_proactive (npn) Amount of reclaimed pages proactively pgfault (npn) Total number of page faults incurred pgmajfault (npn) Number of major page faults incurred pgrefill (npn) Amount of scanned pages (in an active LRU list) pgactivate (npn) Amount of pages moved to the active LRU list pgdeactivate (npn) Amount of pages moved to the inactive LRU list pglazyfree (npn) Amount of pages postponed to be freed under memory pressure pglazyfreed (npn) Amount of reclaimed lazyfree pages swpin_zero Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout. swpout_zero Number of zero-filled pages swapped out with I/O skipped due to the content being detected as zero. zswpin Number of pages moved in to memory from zswap. zswpout Number of pages moved out of memory to zswap. zswpwb Number of pages written from zswap to swap. zswap_incomp Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is. thp_fault_alloc (npn) Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_collapse_alloc (npn) Number of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_swpout (npn) Number of transparent hugepages which are swapout in one piece without splitting. thp_swpout_fallback (npn) Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page. numa_pages_migrated (npn) Number of pages migrated by NUMA balancing. numa_pte_updates (npn) Number of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access. numa_hint_faults (npn) Number of NUMA hinting faults. pgdemote_kswapd Number of pages demoted by kswapd. pgdemote_direct Number of pages demoted directly. pgdemote_khugepaged Number of pages demoted by khugepaged. pgdemote_proactive Number of pages demoted by proactively. hugetlb Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option). ”h]”(jÑ)”}”(hŒmemory.stat”h]”hŒmemory.stat”…””}”(hj9!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj5!ubjá)”}”(hhh]”(hú)”}”(hŒ=A read-only flat-keyed file which exists on non-root cgroups.”h]”hŒ=A read-only flat-keyed file which exists on non-root cgroups.”…””}”(hjJ!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjG!ubhú)”}”(hŒ¹This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information on the state and past events of the memory management system.”h]”hŒ»This breaks down the cgroupâ€™s memory footprint into different types of memory, type-specific details, and other information on the state and past events of the memory management system.”…””}”(hjX!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjG!ubhú)”}”(hŒ All memory amounts are in bytes.”h]”hŒ All memory amounts are in bytes.”…””}”(hjf!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjG!ubhú)”}”(hŒ´The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values!”h]”hŒ¶The entries are ordered to be human readable, and new entries can show up in the middle. Donâ€™t rely on items remaining in a fixed position; use the keys to look up specific values!”…””}”(hjt!h²•hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjG!ubhú)”}”(hŒIf the entry has no per-node counter (or not show in the memory.numa_stat). We use 'npn' (non-per-node) as the tag to indicate that it will not show in the memory.numa_stat.”h]”hŒ±If the entry has no per-node counter (or not show in the memory.numa_stat). We use â€˜npnâ€™ (non-per-node) as the tag to indicate that it will not show in the memory.numa_stat.”…””}”(hj‚!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjG!ubjÀ)”}”(hXJanon Amount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore. file Amount of memory used to cache filesystem data, including tmpfs and shared memory. kernel (npn) Amount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases. kernel_stack Amount of memory allocated to kernel stacks. pagetables Amount of memory allocated for page tables. sec_pagetables Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables. percpu (npn) Amount of memory used for storing per-cpu kernel data structures. sock (npn) Amount of memory used in network transmission buffers vmalloc Amount of memory used for vmap backed memory. shmem Amount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s zswap Amount of memory consumed by the zswap compression backend. zswapped Amount of application memory swapped out to zswap. file_mapped Amount of cached filesystem data mapped with mmap(). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not not all the memory of such an allocation is mapped. file_dirty Amount of cached filesystem data that was modified but not yet written back to disk file_writeback Amount of cached filesystem data that was modified and is currently being written back to disk swapcached Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage. anon_thp Amount of memory used in anonymous mappings backed by transparent hugepages file_thp Amount of cached filesystem data backed by transparent hugepages shmem_thp Amount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages inactive_anon, active_anon, inactive_file, active_file, unevictable Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm. As these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based. slab_reclaimable Part of "slab" that might be reclaimed, such as dentries and inodes. slab_unreclaimable Part of "slab" that cannot be reclaimed on memory pressure. slab (npn) Amount of memory used for storing in-kernel data structures. workingset_refault_anon Number of refaults of previously evicted anonymous pages. workingset_refault_file Number of refaults of previously evicted file pages. workingset_activate_anon Number of refaulted anonymous pages that were immediately activated. workingset_activate_file Number of refaulted file pages that were immediately activated. workingset_restore_anon Number of restored anonymous pages which have been detected as an active workingset before they got reclaimed. workingset_restore_file Number of restored file pages which have been detected as an active workingset before they got reclaimed. workingset_nodereclaim Number of times a shadow node has been reclaimed pswpin (npn) Number of pages swapped into memory pswpout (npn) Number of pages swapped out of memory pgscan (npn) Amount of scanned pages (in an inactive LRU list) pgsteal (npn) Amount of reclaimed pages pgscan_kswapd (npn) Amount of scanned pages by kswapd (in an inactive LRU list) pgscan_direct (npn) Amount of scanned pages directly (in an inactive LRU list) pgscan_khugepaged (npn) Amount of scanned pages by khugepaged (in an inactive LRU list) pgscan_proactive (npn) Amount of scanned pages proactively (in an inactive LRU list) pgsteal_kswapd (npn) Amount of reclaimed pages by kswapd pgsteal_direct (npn) Amount of reclaimed pages directly pgsteal_khugepaged (npn) Amount of reclaimed pages by khugepaged pgsteal_proactive (npn) Amount of reclaimed pages proactively pgfault (npn) Total number of page faults incurred pgmajfault (npn) Number of major page faults incurred pgrefill (npn) Amount of scanned pages (in an active LRU list) pgactivate (npn) Amount of pages moved to the active LRU list pgdeactivate (npn) Amount of pages moved to the inactive LRU list pglazyfree (npn) Amount of pages postponed to be freed under memory pressure pglazyfreed (npn) Amount of reclaimed lazyfree pages swpin_zero Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout. swpout_zero Number of zero-filled pages swapped out with I/O skipped due to the content being detected as zero. zswpin Number of pages moved in to memory from zswap. zswpout Number of pages moved out of memory to zswap. zswpwb Number of pages written from zswap to swap. zswap_incomp Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is. thp_fault_alloc (npn) Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_collapse_alloc (npn) Number of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. thp_swpout (npn) Number of transparent hugepages which are swapout in one piece without splitting. thp_swpout_fallback (npn) Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page. numa_pages_migrated (npn) Number of pages migrated by NUMA balancing. numa_pte_updates (npn) Number of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access. numa_hint_faults (npn) Number of NUMA hinting faults. pgdemote_kswapd Number of pages demoted by kswapd. pgdemote_direct Number of pages demoted directly. pgdemote_khugepaged Number of pages demoted by khugepaged. pgdemote_proactive Number of pages demoted by proactively. hugetlb Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option). ”h]”jÆ)”}”(hhh]”(jË)”}”(hX anon Amount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore. ”h]”(jÑ)”}”(hŒanon”h]”hŒanon”…””}”(hj›!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M#hj—!ubjá)”}”(hhh]”hú)”}”(hXAmount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore.”h]”hXAmount of memory used in anonymous mappings such as brk(), sbrk(), and mmap(MAP_ANONYMOUS). Note that some kernel configurations might account complete larger allocations (e.g., THP) if only some, but not all the memory of such an allocation is mapped anymore.”…””}”(hj¬!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj©!ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj—!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M#hj”!ubjË)”}”(hŒXfile Amount of memory used to cache filesystem data, including tmpfs and shared memory. ”h]”(jÑ)”}”(hŒfile”h]”hŒfile”…””}”(hjÊ!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M'hjÆ!ubjá)”}”(hhh]”hú)”}”(hŒRAmount of memory used to cache filesystem data, including tmpfs and shared memory.”h]”hŒRAmount of memory used to cache filesystem data, including tmpfs and shared memory.”…””}”(hjÛ!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M&hjØ!ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÆ!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M'hj”!ubjË)”}”(hŒ–kernel (npn) Amount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases. ”h]”(jÑ)”}”(hŒkernel (npn)”h]”hŒkernel (npn)”…””}”(hjù!h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M,hjõ!ubjá)”}”(hhh]”hú)”}”(hŒˆAmount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases.”h]”hŒˆAmount of total kernel memory, including (kernel_stack, pagetables, percpu, vmalloc, slab) in addition to other kernel memory use cases.”…””}”(hj "h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M*hj"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjõ!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M,hj”!ubjË)”}”(hŒ:kernel_stack Amount of memory allocated to kernel stacks. ”h]”(jÑ)”}”(hŒkernel_stack”h]”hŒkernel_stack”…””}”(hj("h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M/hj$"ubjá)”}”(hhh]”hú)”}”(hŒ,Amount of memory allocated to kernel stacks.”h]”hŒ,Amount of memory allocated to kernel stacks.”…””}”(hj9"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M/hj6"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj$"ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M/hj”!ubjË)”}”(hŒ7pagetables Amount of memory allocated for page tables. ”h]”(jÑ)”}”(hŒ pagetables”h]”hŒ pagetables”…””}”(hjW"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M2hjS"ubjá)”}”(hhh]”hú)”}”(hŒ+Amount of memory allocated for page tables.”h]”hŒ+Amount of memory allocated for page tables.”…””}”(hjh"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M2hje"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjS"ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M2hj”!ubjË)”}”(hŒ™sec_pagetables Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables. ”h]”(jÑ)”}”(hŒsec_pagetables”h]”hŒsec_pagetables”…””}”(hj†"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M7hj‚"ubjá)”}”(hhh]”hú)”}”(hŒ‰Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables.”h]”hŒ‰Amount of memory allocated for secondary page tables, this currently includes KVM mmu allocations on x86 and arm64 and IOMMU page tables.”…””}”(hj—"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M5hj”"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj‚"ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M7hj”!ubjË)”}”(hŒOpercpu (npn) Amount of memory used for storing per-cpu kernel data structures. ”h]”(jÑ)”}”(hŒpercpu (npn)”h]”hŒpercpu (npn)”…””}”(hjµ"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M;hj±"ubjá)”}”(hhh]”hú)”}”(hŒAAmount of memory used for storing per-cpu kernel data structures.”h]”hŒAAmount of memory used for storing per-cpu kernel data structures.”…””}”(hjÆ"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M:hjÃ"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj±"ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M;hj”!ubjË)”}”(hŒAsock (npn) Amount of memory used in network transmission buffers ”h]”(jÑ)”}”(hŒ sock (npn)”h]”hŒ sock (npn)”…””}”(hjä"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M>hjà"ubjá)”}”(hhh]”hú)”}”(hŒ5Amount of memory used in network transmission buffers”h]”hŒ5Amount of memory used in network transmission buffers”…””}”(hjõ"h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M>hjò"ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjà"ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M>hj”!ubjË)”}”(hŒ6vmalloc Amount of memory used for vmap backed memory. ”h]”(jÑ)”}”(hŒvmalloc”h]”hŒvmalloc”…””}”(hj#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MAhj#ubjá)”}”(hhh]”hú)”}”(hŒ-Amount of memory used for vmap backed memory.”h]”hŒ-Amount of memory used for vmap backed memory.”…””}”(hj$#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MAhj!#ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj#ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MAhj”!ubjË)”}”(hŒrshmem Amount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s ”h]”(jÑ)”}”(hŒshmem”h]”hŒshmem”…””}”(hjB#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MEhj>#ubjá)”}”(hhh]”hú)”}”(hŒkAmount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s”h]”hŒkAmount of cached filesystem data that is swap-backed, such as tmpfs, shm segments, shared anonymous mmap()s”…””}”(hjS#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MDhjP#ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj>#ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MEhj”!ubjË)”}”(hŒBzswap Amount of memory consumed by the zswap compression backend. ”h]”(jÑ)”}”(hŒzswap”h]”hŒzswap”…””}”(hjq#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MHhjm#ubjá)”}”(hhh]”hú)”}”(hŒ;Amount of memory consumed by the zswap compression backend.”h]”hŒ;Amount of memory consumed by the zswap compression backend.”…””}”(hj‚#h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MHhj#ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjm#ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MHhj”!ubjË)”}”(hŒ$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MXhj;$ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj)$ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MYhj”!ubjË)”}”(hŒkswapcached Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage. ”h]”(jÑ)”}”(hŒ swapcached”h]”hŒ swapcached”…””}”(hj\$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M]hjX$ubjá)”}”(hhh]”hú)”}”(hŒ_Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage.”h]”hŒ_Amount of swap cached in memory. The swapcache is accounted against both memory and swap usage.”…””}”(hjm$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M\hjj$ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjX$ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M]hj”!ubjË)”}”(hŒUanon_thp Amount of memory used in anonymous mappings backed by transparent hugepages ”h]”(jÑ)”}”(hŒanon_thp”h]”hŒanon_thp”…””}”(hj‹$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mahj‡$ubjá)”}”(hhh]”hú)”}”(hŒKAmount of memory used in anonymous mappings backed by transparent hugepages”h]”hŒKAmount of memory used in anonymous mappings backed by transparent hugepages”…””}”(hjœ$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M`hj™$ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj‡$ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mahj”!ubjË)”}”(hŒJfile_thp Amount of cached filesystem data backed by transparent hugepages ”h]”(jÑ)”}”(hŒfile_thp”h]”hŒfile_thp”…””}”(hjº$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mehj¶$ubjá)”}”(hhh]”hú)”}”(hŒ@Amount of cached filesystem data backed by transparent hugepages”h]”hŒ@Amount of cached filesystem data backed by transparent hugepages”…””}”(hjË$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MdhjÈ$ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¶$ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mehj”!ubjË)”}”(hŒYshmem_thp Amount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages ”h]”(jÑ)”}”(hŒ shmem_thp”h]”hŒ shmem_thp”…””}”(hjé$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mihjå$ubjá)”}”(hhh]”hú)”}”(hŒNAmount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages”h]”hŒNAmount of shm, tmpfs, shared anonymous mmap()s backed by transparent hugepages”…””}”(hjú$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhhj÷$ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjå$ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mihj”!ubjË)”}”(hX¦inactive_anon, active_anon, inactive_file, active_file, unevictable Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm. As these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based. ”h]”(jÑ)”}”(hŒCinactive_anon, active_anon, inactive_file, active_file, unevictable”h]”hŒCinactive_anon, active_anon, inactive_file, active_file, unevictable”…””}”(hj%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mshj%ubjá)”}”(hhh]”(hú)”}”(hŒ€Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm.”h]”hŒ€Amount of memory, swap-backed and filesystem-backed, on the internal memory management lists used by the page reclaim algorithm.”…””}”(hj)%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mlhj&%ubhú)”}”(hŒßAs these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based.”h]”hŒßAs these represent internal list state (eg. shmem pages are on anon memory management lists), inactive_foo + active_foo may not be equal to the value for the foo counter, since the foo counter is type-based, not list-based.”…””}”(hj7%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mphj&%ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj%ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mshj”!ubjË)”}”(hŒVslab_reclaimable Part of "slab" that might be reclaimed, such as dentries and inodes. ”h]”(jÑ)”}”(hŒslab_reclaimable”h]”hŒslab_reclaimable”…””}”(hjU%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MwhjQ%ubjá)”}”(hhh]”hú)”}”(hŒDPart of "slab" that might be reclaimed, such as dentries and inodes.”h]”hŒHPart of â€œslabâ€ that might be reclaimed, such as dentries and inodes.”…””}”(hjf%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mvhjc%ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjQ%ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mwhj”!ubjË)”}”(hŒOslab_unreclaimable Part of "slab" that cannot be reclaimed on memory pressure. ”h]”(jÑ)”}”(hŒslab_unreclaimable”h]”hŒslab_unreclaimable”…””}”(hj„%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M{hj€%ubjá)”}”(hhh]”hú)”}”(hŒ;Part of "slab" that cannot be reclaimed on memory pressure.”h]”hŒ?Part of â€œslabâ€ that cannot be reclaimed on memory pressure.”…””}”(hj•%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mzhj’%ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj€%ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M{hj”!ubjË)”}”(hŒHslab (npn) Amount of memory used for storing in-kernel data structures. ”h]”(jÑ)”}”(hŒ slab (npn)”h]”hŒ slab (npn)”…””}”(hj³%h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj¯%ubjá)”}”(hhh]”hú)”}”(hŒpgsteal_proactive (npn) Amount of reclaimed pages proactively ”h]”(jÑ)”}”(hŒpgsteal_proactive (npn)”h]”hŒpgsteal_proactive (npn)”…””}”(hj0)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M»hj,)ubjá)”}”(hhh]”hú)”}”(hŒ%Amount of reclaimed pages proactively”h]”hŒ%Amount of reclaimed pages proactively”…””}”(hjA)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M»hj>)ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj,)ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M»hj”!ubjË)”}”(hŒ3pgfault (npn) Total number of page faults incurred ”h]”(jÑ)”}”(hŒ pgfault (npn)”h]”hŒ pgfault (npn)”…””}”(hj_)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¾hj[)ubjá)”}”(hhh]”hú)”}”(hŒ$Total number of page faults incurred”h]”hŒ$Total number of page faults incurred”…””}”(hjp)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¾hjm)ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj[)ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¾hj”!ubjË)”}”(hŒ6pgmajfault (npn) Number of major page faults incurred ”h]”(jÑ)”}”(hŒpgmajfault (npn)”h]”hŒpgmajfault (npn)”…””}”(hjŽ)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÁhjŠ)ubjá)”}”(hhh]”hú)”}”(hŒ$Number of major page faults incurred”h]”hŒ$Number of major page faults incurred”…””}”(hjŸ)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÁhjœ)ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjŠ)ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÁhj”!ubjË)”}”(hŒ?pgrefill (npn) Amount of scanned pages (in an active LRU list) ”h]”(jÑ)”}”(hŒpgrefill (npn)”h]”hŒpgrefill (npn)”…””}”(hj½)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÄhj¹)ubjá)”}”(hhh]”hú)”}”(hŒ/Amount of scanned pages (in an active LRU list)”h]”hŒ/Amount of scanned pages (in an active LRU list)”…””}”(hjÎ)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÄhjË)ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¹)ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÄhj”!ubjË)”}”(hŒ>pgactivate (npn) Amount of pages moved to the active LRU list ”h]”(jÑ)”}”(hŒpgactivate (npn)”h]”hŒpgactivate (npn)”…””}”(hjì)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÇhjè)ubjá)”}”(hhh]”hú)”}”(hŒ,Amount of pages moved to the active LRU list”h]”hŒ,Amount of pages moved to the active LRU list”…””}”(hjý)h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÇhjú)ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjè)ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÇhj”!ubjË)”}”(hŒBpgdeactivate (npn) Amount of pages moved to the inactive LRU list ”h]”(jÑ)”}”(hŒpgdeactivate (npn)”h]”hŒpgdeactivate (npn)”…””}”(hj*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÊhj*ubjá)”}”(hhh]”hú)”}”(hŒ.Amount of pages moved to the inactive LRU list”h]”hŒ.Amount of pages moved to the inactive LRU list”…””}”(hj,*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÊhj)*ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj*ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÊhj”!ubjË)”}”(hŒMpglazyfree (npn) Amount of pages postponed to be freed under memory pressure ”h]”(jÑ)”}”(hŒpglazyfree (npn)”h]”hŒpglazyfree (npn)”…””}”(hjJ*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÍhjF*ubjá)”}”(hhh]”hú)”}”(hŒ;Amount of pages postponed to be freed under memory pressure”h]”hŒ;Amount of pages postponed to be freed under memory pressure”…””}”(hj[*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÍhjX*ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjF*ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÍhj”!ubjË)”}”(hŒ5pglazyfreed (npn) Amount of reclaimed lazyfree pages ”h]”(jÑ)”}”(hŒpglazyfreed (npn)”h]”hŒpglazyfreed (npn)”…””}”(hjy*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÐhju*ubjá)”}”(hhh]”hú)”}”(hŒ"Amount of reclaimed lazyfree pages”h]”hŒ"Amount of reclaimed lazyfree pages”…””}”(hjŠ*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÐhj‡*ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhju*ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÐhj”!ubjË)”}”(hŒ¢swpin_zero Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout. ”h]”(jÑ)”}”(hŒ swpin_zero”h]”hŒ swpin_zero”…””}”(hj¨*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÕhj¤*ubjá)”}”(hhh]”hú)”}”(hŒ–Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout.”h]”hŒ–Number of pages swapped into memory and filled with zero, where I/O was optimized out because the page content was detected to be zero during swapout.”…””}”(hj¹*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÓhj¶*ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¤*ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÕhj”!ubjË)”}”(hŒpswpout_zero Number of zero-filled pages swapped out with I/O skipped due to the content being detected as zero. ”h]”(jÑ)”}”(hŒswpout_zero”h]”hŒswpout_zero”…””}”(hj×*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÙhjÓ*ubjá)”}”(hhh]”hú)”}”(hŒcNumber of zero-filled pages swapped out with I/O skipped due to the content being detected as zero.”h]”hŒcNumber of zero-filled pages swapped out with I/O skipped due to the content being detected as zero.”…””}”(hjè*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MØhjå*ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÓ*ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÙhj”!ubjË)”}”(hŒ6zswpin Number of pages moved in to memory from zswap. ”h]”(jÑ)”}”(hŒzswpin”h]”hŒzswpin”…””}”(hj+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÜhj+ubjá)”}”(hhh]”hú)”}”(hŒ.Number of pages moved in to memory from zswap.”h]”hŒ.Number of pages moved in to memory from zswap.”…””}”(hj+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÜhj+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÜhj”!ubjË)”}”(hŒ6zswpout Number of pages moved out of memory to zswap. ”h]”(jÑ)”}”(hŒzswpout”h]”hŒzswpout”…””}”(hj5+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mßhj1+ubjá)”}”(hhh]”hú)”}”(hŒ-Number of pages moved out of memory to zswap.”h]”hŒ-Number of pages moved out of memory to zswap.”…””}”(hjF+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MßhjC+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj1+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mßhj”!ubjË)”}”(hŒ3zswpwb Number of pages written from zswap to swap. ”h]”(jÑ)”}”(hŒzswpwb”h]”hŒzswpwb”…””}”(hjd+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mâhj`+ubjá)”}”(hhh]”hú)”}”(hŒ+Number of pages written from zswap to swap.”h]”hŒ+Number of pages written from zswap to swap.”…””}”(hju+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mâhjr+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj`+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mâhj”!ubjË)”}”(hŒÊzswap_incomp Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is. ”h]”(jÑ)”}”(hŒzswap_incomp”h]”hŒzswap_incomp”…””}”(hj“+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mçhj+ubjá)”}”(hhh]”hú)”}”(hŒ¼Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is.”h]”hŒ¼Amount of memory used by incompressible pages currently stored in zswap without compression. These pages could not be compressed to a size smaller than PAGE_SIZE, so they are stored as-is.”…””}”(hj¤+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Måhj¡+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mçhj”!ubjË)”}”(hŒthp_fault_alloc (npn) Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. ”h]”(jÑ)”}”(hŒthp_fault_alloc (npn)”h]”hŒthp_fault_alloc (npn)”…””}”(hjÂ+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mìhj¾+ubjá)”}”(hhh]”hú)”}”(hŒ–Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set.”h]”hŒ–Number of transparent hugepages which were allocated to satisfy a page fault. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set.”…””}”(hjÓ+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MêhjÐ+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¾+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mìhj”!ubjË)”}”(hŒÇthp_collapse_alloc (npn) Number of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set. ”h]”(jÑ)”}”(hŒthp_collapse_alloc (npn)”h]”hŒthp_collapse_alloc (npn)”…””}”(hjñ+h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mñhjí+ubjá)”}”(hhh]”hú)”}”(hŒNumber of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set.”h]”hŒNumber of transparent hugepages which were allocated to allow collapsing an existing range of pages. This counter is not present when CONFIG_TRANSPARENT_HUGEPAGE is not set.”…””}”(hj,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mïhjÿ+ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjí+ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mñhj”!ubjË)”}”(hŒcthp_swpout (npn) Number of transparent hugepages which are swapout in one piece without splitting. ”h]”(jÑ)”}”(hŒthp_swpout (npn)”h]”hŒthp_swpout (npn)”…””}”(hj ,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mõhj,ubjá)”}”(hhh]”hú)”}”(hŒQNumber of transparent hugepages which are swapout in one piece without splitting.”h]”hŒQNumber of transparent hugepages which are swapout in one piece without splitting.”…””}”(hj1,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Môhj.,ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj,ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mõhj”!ubjË)”}”(hŒ¬thp_swpout_fallback (npn) Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page. ”h]”(jÑ)”}”(hŒthp_swpout_fallback (npn)”h]”hŒthp_swpout_fallback (npn)”…””}”(hjO,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MúhjK,ubjá)”}”(hhh]”hú)”}”(hŒ‘Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page.”h]”hŒ‘Number of transparent hugepages which were split before swapout. Usually because failed to allocate some continuous swap space for the huge page.”…””}”(hj`,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Møhj],ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjK,ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Múhj”!ubjË)”}”(hŒFnuma_pages_migrated (npn) Number of pages migrated by NUMA balancing. ”h]”(jÑ)”}”(hŒnuma_pages_migrated (npn)”h]”hŒnuma_pages_migrated (npn)”…””}”(hj~,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mýhjz,ubjá)”}”(hhh]”hú)”}”(hŒ+Number of pages migrated by NUMA balancing.”h]”hŒ+Number of pages migrated by NUMA balancing.”…””}”(hj,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MýhjŒ,ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjz,ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mýhj”!ubjË)”}”(hŒ‰numa_pte_updates (npn) Number of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access. ”h]”(jÑ)”}”(hŒnuma_pte_updates (npn)”h]”hŒnuma_pte_updates (npn)”…””}”(hj,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj©,ubjá)”}”(hhh]”hú)”}”(hŒqNumber of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access.”h]”hŒqNumber of pages whose page table entries are modified by NUMA balancing to produce NUMA hinting faults on access.”…””}”(hj¾,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj»,ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj©,ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”!ubjË)”}”(hŒ6numa_hint_faults (npn) Number of NUMA hinting faults. ”h]”(jÑ)”}”(hŒnuma_hint_faults (npn)”h]”hŒnuma_hint_faults (npn)”…””}”(hjÜ,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MhjØ,ubjá)”}”(hhh]”hú)”}”(hŒNumber of NUMA hinting faults.”h]”hŒNumber of NUMA hinting faults.”…””}”(hjí,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjê,ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjØ,ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”!ubjË)”}”(hŒ3pgdemote_kswapd Number of pages demoted by kswapd. ”h]”(jÑ)”}”(hŒpgdemote_kswapd”h]”hŒpgdemote_kswapd”…””}”(hj-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj-ubjá)”}”(hhh]”hú)”}”(hŒ"Number of pages demoted by kswapd.”h]”hŒ"Number of pages demoted by kswapd.”…””}”(hj-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj-ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj-ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”!ubjË)”}”(hŒ2pgdemote_direct Number of pages demoted directly. ”h]”(jÑ)”}”(hŒpgdemote_direct”h]”hŒpgdemote_direct”…””}”(hj:-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M hj6-ubjá)”}”(hhh]”hú)”}”(hŒ!Number of pages demoted directly.”h]”hŒ!Number of pages demoted directly.”…””}”(hjK-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjH-ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj6-ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M hj”!ubjË)”}”(hŒ;pgdemote_khugepaged Number of pages demoted by khugepaged. ”h]”(jÑ)”}”(hŒpgdemote_khugepaged”h]”hŒpgdemote_khugepaged”…””}”(hji-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M hje-ubjá)”}”(hhh]”hú)”}”(hŒ&Number of pages demoted by khugepaged.”h]”hŒ&Number of pages demoted by khugepaged.”…””}”(hjz-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjw-ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhje-ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M hj”!ubjË)”}”(hŒ;pgdemote_proactive Number of pages demoted by proactively. ”h]”(jÑ)”}”(hŒpgdemote_proactive”h]”hŒpgdemote_proactive”…””}”(hj˜-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj”-ubjá)”}”(hhh]”hú)”}”(hŒ'Number of pages demoted by proactively.”h]”hŒ'Number of pages demoted by proactively.”…””}”(hj©-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj¦-ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj”-ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”!ubjË)”}”(hŒÂhugetlb Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option). ”h]”(jÑ)”}”(hŒhugetlb”h]”hŒhugetlb”…””}”(hjÇ-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MhjÃ-ubjá)”}”(hhh]”hú)”}”(hŒ¹Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option).”h]”hŒ¹Amount of memory used by hugetlb pages. This metric only shows up if hugetlb usage is accounted for in memory.current (i.e. cgroup is mounted with the memory_hugetlb_accounting option).”…””}”(hjØ-h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÕ-ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÃ-ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj”!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj!ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MhjG!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj5!ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj¸ubjË)”}”(hX‰memory.numa_stat A read-only nested-keyed file which exists on non-root cgroups. This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information per node on the state of the memory management system. This is useful for providing visibility into the NUMA locality information within an memcg since the pages are allowed to be allocated from any physical node. One of the use case is evaluating application performance by combining this information with the application's CPU allocation. All memory amounts are in bytes. The output format of memory.numa_stat is:: type N0= N1= ... The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values! The entries can refer to the memory.stat. ”h]”(jÑ)”}”(hŒmemory.numa_stat”h]”hŒmemory.numa_stat”…””}”(hj.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M.hj .ubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only nested-keyed file which exists on non-root cgroups.”h]”hŒ?A read-only nested-keyed file which exists on non-root cgroups.”…””}”(hj.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj.ubhú)”}”(hŒ²This breaks down the cgroup's memory footprint into different types of memory, type-specific details, and other information per node on the state of the memory management system.”h]”hŒ´This breaks down the cgroupâ€™s memory footprint into different types of memory, type-specific details, and other information per node on the state of the memory management system.”…””}”(hj-.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj.ubhú)”}”(hXThis is useful for providing visibility into the NUMA locality information within an memcg since the pages are allowed to be allocated from any physical node. One of the use case is evaluating application performance by combining this information with the application's CPU allocation.”h]”hXThis is useful for providing visibility into the NUMA locality information within an memcg since the pages are allowed to be allocated from any physical node. One of the use case is evaluating application performance by combining this information with the applicationâ€™s CPU allocation.”…””}”(hj;.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj.ubhú)”}”(hŒ All memory amounts are in bytes.”h]”hŒ All memory amounts are in bytes.”…””}”(hjI.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M$hj.ubhú)”}”(hŒ*The output format of memory.numa_stat is::”h]”hŒ)The output format of memory.numa_stat is:”…””}”(hjW.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M&hj.ubjj)”}”(hŒ2type N0= N1= ...”h]”hŒ2type N0= N1= ...”…””}”hje.sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M(hj.ubhú)”}”(hŒ´The entries are ordered to be human readable, and new entries can show up in the middle. Don't rely on items remaining in a fixed position; use the keys to look up specific values!”h]”hŒ¶The entries are ordered to be human readable, and new entries can show up in the middle. Donâ€™t rely on items remaining in a fixed position; use the keys to look up specific values!”…””}”(hjs.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M*hj.ubhú)”}”(hŒ)The entries can refer to the memory.stat.”h]”hŒ)The entries can refer to the memory.stat.”…””}”(hj.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M.hj.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj .ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M.hj¸ubjË)”}”(hŒ¦memory.swap.current A read-only single value file which exists on non-root cgroups. The total amount of swap currently being used by the cgroup and its descendants. ”h]”(jÑ)”}”(hŒmemory.swap.current”h]”hŒmemory.swap.current”…””}”(hjŸ.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M5hj›.ubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only single value file which exists on non-root cgroups.”h]”hŒ?A read-only single value file which exists on non-root cgroups.”…””}”(hj°.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M1hj.ubhú)”}”(hŒPThe total amount of swap currently being used by the cgroup and its descendants.”h]”hŒPThe total amount of swap currently being used by the cgroup and its descendants.”…””}”(hj¾.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M4hj.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj›.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M5hj¸ubjË)”}”(hX‰memory.swap.high A read-write single value file which exists on non-root cgroups. The default is "max". Swap usage throttle limit. If a cgroup's swap usage exceeds this limit, all its further allocations will be throttled to allow userspace to implement custom out-of-memory procedures. This limit marks a point of no return for the cgroup. It is NOT designed to manage the amount of swapping a workload does during regular operation. Compare to memory.swap.max, which prohibits swapping past a set amount, but lets the cgroup continue unimpeded as long as other memory can be reclaimed. Healthy workloads are not expected to reach this limit. ”h]”(jÑ)”}”(hŒmemory.swap.high”h]”hŒmemory.swap.high”…””}”(hjÜ.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MEhjØ.ubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hjí.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M8hjê.ubhú)”}”(hŒ·Swap usage throttle limit. If a cgroup's swap usage exceeds this limit, all its further allocations will be throttled to allow userspace to implement custom out-of-memory procedures.”h]”hŒ¹Swap usage throttle limit. If a cgroupâ€™s swap usage exceeds this limit, all its further allocations will be throttled to allow userspace to implement custom out-of-memory procedures.”…””}”(hjû.h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M;hjê.ubhú)”}”(hX,This limit marks a point of no return for the cgroup. It is NOT designed to manage the amount of swapping a workload does during regular operation. Compare to memory.swap.max, which prohibits swapping past a set amount, but lets the cgroup continue unimpeded as long as other memory can be reclaimed.”h]”hX,This limit marks a point of no return for the cgroup. It is NOT designed to manage the amount of swapping a workload does during regular operation. Compare to memory.swap.max, which prohibits swapping past a set amount, but lets the cgroup continue unimpeded as long as other memory can be reclaimed.”…””}”(hj /h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M?hjê.ubhú)”}”(hŒ7Healthy workloads are not expected to reach this limit.”h]”hŒ7Healthy workloads are not expected to reach this limit.”…””}”(hj/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MEhjê.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjØ.ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MEhj¸ubjË)”}”(hXdmemory.swap.peak A read-write single value file which exists on non-root cgroups. The max swap usage recorded for the cgroup and its descendants since the creation of the cgroup or the most recent reset for that FD. A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor. ”h]”(jÑ)”}”(hŒmemory.swap.peak”h]”hŒmemory.swap.peak”…””}”(hj5/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MOhj1/ubjá)”}”(hhh]”(hú)”}”(hŒ@A read-write single value file which exists on non-root cgroups.”h]”hŒ@A read-write single value file which exists on non-root cgroups.”…””}”(hjF/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MHhjC/ubhú)”}”(hŒ…The max swap usage recorded for the cgroup and its descendants since the creation of the cgroup or the most recent reset for that FD.”h]”hŒ…The max swap usage recorded for the cgroup and its descendants since the creation of the cgroup or the most recent reset for that FD.”…””}”(hjT/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MJhjC/ubhú)”}”(hŒ‰A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor.”h]”hŒ‰A write of any non-empty string to this file resets it to the current memory usage for subsequent reads through the same file descriptor.”…””}”(hjb/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MMhjC/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj1/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MOhj¸ubjË)”}”(hŒæmemory.swap.max A read-write single value file which exists on non-root cgroups. The default is "max". Swap usage hard limit. If a cgroup's swap usage reaches this limit, anonymous memory of the cgroup will not be swapped out. ”h]”(jÑ)”}”(hŒmemory.swap.max”h]”hŒmemory.swap.max”…””}”(hj€/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MVhj|/ubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hj‘/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MRhjŽ/ubhú)”}”(hŒ|Swap usage hard limit. If a cgroup's swap usage reaches this limit, anonymous memory of the cgroup will not be swapped out.”h]”hŒ~Swap usage hard limit. If a cgroupâ€™s swap usage reaches this limit, anonymous memory of the cgroup will not be swapped out.”…””}”(hjŸ/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MUhjŽ/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj|/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MVhj¸ubjË)”}”(hX2memory.swap.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. high The number of times the cgroup's swap usage was over the high threshold. max The number of times the cgroup's swap usage was about to go over the max boundary and swap allocation failed. fail The number of times swap allocation failed either because of running out of swap system-wide or max limit. When reduced under the current usage, the existing swap entries are reclaimed gradually and the swap usage may stay higher than the limit for an extended period of time. This reduces the impact on the workload and memory management. ”h]”(jÑ)”}”(hŒmemory.swap.events”h]”hŒmemory.swap.events”…””}”(hj½/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mohj¹/ubjá)”}”(hhh]”(hú)”}”(hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”h]”hŒºA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event.”…””}”(hjÎ/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MYhjË/ubjÀ)”}”(hXbhigh The number of times the cgroup's swap usage was over the high threshold. max The number of times the cgroup's swap usage was about to go over the max boundary and swap allocation failed. fail The number of times swap allocation failed either because of running out of swap system-wide or max limit. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒNhigh The number of times the cgroup's swap usage was over the high threshold. ”h]”(jÑ)”}”(hŒhigh”h]”hŒhigh”…””}”(hjç/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M`hjã/ubjá)”}”(hhh]”hú)”}”(hŒHThe number of times the cgroup's swap usage was over the high threshold.”h]”hŒJThe number of times the cgroupâ€™s swap usage was over the high threshold.”…””}”(hjø/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M_hjõ/ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjã/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M`hjà/ubjË)”}”(hŒrmax The number of times the cgroup's swap usage was about to go over the max boundary and swap allocation failed. ”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hj0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mehj0ubjá)”}”(hhh]”hú)”}”(hŒmThe number of times the cgroup's swap usage was about to go over the max boundary and swap allocation failed.”h]”hŒoThe number of times the cgroupâ€™s swap usage was about to go over the max boundary and swap allocation failed.”…””}”(hj'0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mchj$0ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mehjà/ubjË)”}”(hŒpfail The number of times swap allocation failed either because of running out of swap system-wide or max limit. ”h]”(jÑ)”}”(hŒfail”h]”hŒfail”…””}”(hjE0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MjhjA0ubjá)”}”(hhh]”hú)”}”(hŒjThe number of times swap allocation failed either because of running out of swap system-wide or max limit.”h]”hŒjThe number of times swap allocation failed either because of running out of swap system-wide or max limit.”…””}”(hjV0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhhjS0ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjA0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mjhjà/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjÜ/ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M^hjË/ubhú)”}”(hŒéWhen reduced under the current usage, the existing swap entries are reclaimed gradually and the swap usage may stay higher than the limit for an extended period of time. This reduces the impact on the workload and memory management.”h]”hŒéWhen reduced under the current usage, the existing swap entries are reclaimed gradually and the swap usage may stay higher than the limit for an extended period of time. This reduces the impact on the workload and memory management.”…””}”(hj|0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MlhjË/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¹/ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mohj¸ubjË)”}”(hŒœmemory.zswap.current A read-only single value file which exists on non-root cgroups. The total amount of memory consumed by the zswap compression backend. ”h]”(jÑ)”}”(hŒmemory.zswap.current”h]”hŒmemory.zswap.current”…””}”(hjš0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mvhj–0ubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only single value file which exists on non-root cgroups.”h]”hŒ?A read-only single value file which exists on non-root cgroups.”…””}”(hj«0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mrhj¨0ubhú)”}”(hŒEThe total amount of memory consumed by the zswap compression backend.”h]”hŒEThe total amount of memory consumed by the zswap compression backend.”…””}”(hj¹0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Muhj¨0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj–0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mvhj¸ubjË)”}”(hXmemory.zswap.max A read-write single value file which exists on non-root cgroups. The default is "max". Zswap usage hard limit. If a cgroup's zswap pool reaches this limit, it will refuse to take any more stores before existing entries fault back in or are written out to disk. ”h]”(jÑ)”}”(hŒmemory.zswap.max”h]”hŒmemory.zswap.max”…””}”(hj×0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M~hjÓ0ubjá)”•}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hjè0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Myhjå0ubhú)”}”(hŒZswap usage hard limit. If a cgroup's zswap pool reaches this limit, it will refuse to take any more stores before existing entries fault back in or are written out to disk.”h]”hŒ¯Zswap usage hard limit. If a cgroupâ€™s zswap pool reaches this limit, it will refuse to take any more stores before existing entries fault back in or are written out to disk.”…””}”(hjö0h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M|hjå0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÓ0ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M~hj¸ubjË)”}”(hX>memory.zswap.writeback A read-write single value file. The default value is "1". Note that this setting is hierarchical, i.e. the writeback would be implicitly disabled for child cgroups if the upper hierarchy does so. When this is set to 0, all swapping attempts to swapping devices are disabled. This included both zswap writebacks, and swapping due to zswap store failures. If the zswap store failures are recurring (for e.g if the pages are incompressible), users can observe reclaim inefficiency after disabling writeback (because the same pages might be rejected again and again). Note that this is subtly different from setting memory.swap.max to 0, as it still allows for pages to be written to the zswap pool. This setting has no effect if zswap is disabled, and swapping is allowed unless memory.swap.max is set to 0. ”h]”(jÑ)”}”(hŒmemory.zswap.writeback”h]”hŒmemory.zswap.writeback”…””}”(hj1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj1ubjá)”}”(hhh]”(hú)”}”(hŒÃA read-write single value file. The default value is "1". Note that this setting is hierarchical, i.e. the writeback would be implicitly disabled for child cgroups if the upper hierarchy does so.”h]”hŒÇA read-write single value file. The default value is â€œ1â€. Note that this setting is hierarchical, i.e. the writeback would be implicitly disabled for child cgroups if the upper hierarchy does so.”…””}”(hj%1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj"1ubhú)”}”(hXoWhen this is set to 0, all swapping attempts to swapping devices are disabled. This included both zswap writebacks, and swapping due to zswap store failures. If the zswap store failures are recurring (for e.g if the pages are incompressible), users can observe reclaim inefficiency after disabling writeback (because the same pages might be rejected again and again).”h]”hXoWhen this is set to 0, all swapping attempts to swapping devices are disabled. This included both zswap writebacks, and swapping due to zswap store failures. If the zswap store failures are recurring (for e.g if the pages are incompressible), users can observe reclaim inefficiency after disabling writeback (because the same pages might be rejected again and again).”…””}”(hj31h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M†hj"1ubhú)”}”(hŒðNote that this is subtly different from setting memory.swap.max to 0, as it still allows for pages to be written to the zswap pool. This setting has no effect if zswap is disabled, and swapping is allowed unless memory.swap.max is set to 0.”h]”hŒðNote that this is subtly different from setting memory.swap.max to 0, as it still allows for pages to be written to the zswap pool. This setting has no effect if zswap is disabled, and swapping is allowed unless memory.swap.max is set to 0.”…””}”(hjA1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj"1ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj1ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj¸ubjË)”}”(hŒžmemory.pressure A read-write nested-keyed file. Shows pressure stall information for memory. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”(jÑ)”}”(hŒmemory.pressure”h]”hŒmemory.pressure”…””}”(hj_1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M—hj[1ubjá)”}”(hhh]”(hú)”}”(hŒA read-write nested-keyed file.”h]”hŒA read-write nested-keyed file.”…””}”(hjp1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M“hjm1ubhú)”}”(hŒkShows pressure stall information for memory. See :ref:`Documentation/accounting/psi.rst ` for details.”h]”(hŒ1Shows pressure stall information for memory. See ”…””}”(hj~1h²hh³Nh´Nubh)”}”(hŒ-:ref:`Documentation/accounting/psi.rst `”h]”jl)”}”(hjˆ1h]”hŒ Documentation/accounting/psi.rst”…””}”(hjŠ1h²hh³Nh´Nubah}”(h]”h ]”(jwŒstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhj†1ubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”j„Œ refdomain”j”1Œreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆjŠŒpsi”uh1hh³hÃh´M•hj~1ubhŒ for details.”…””}”(hj~1h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M•hjm1ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj[1ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M—hj¸ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjubeh}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M¯hj‘h²hubeh}”(h]”Œmemory-interface-files”ah ]”h"]”Œmemory interface files”ah$]”h&]”uh1hÄhjh²hh³hÃh´M&ubhÅ)”}”(hhh]”(hÊ)”}”(hŒUsage Guidelines”h]”hŒUsage Guidelines”…””}”(hjÓ1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÐ1h²hh³hÃh´Mšubhú)”}”(hŒã"memory.high" is the main mechanism to control memory usage. Over-committing on high limit (sum of high limits > available memory) and letting global memory pressure to distribute memory according to usage is a viable strategy.”h]”hŒçâ€œmemory.highâ€ is the main mechanism to control memory usage. Over-committing on high limit (sum of high limits > available memory) and letting global memory pressure to distribute memory according to usage is a viable strategy.”…””}”(hjá1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MœhjÐ1h²hubhú)”}”(hŒðBecause breach of the high limit doesn't trigger the OOM killer but throttles the offending cgroup, a management agent has ample opportunities to monitor and take appropriate actions such as granting more memory or terminating the workload.”h]”hŒòBecause breach of the high limit doesnâ€™t trigger the OOM killer but throttles the offending cgroup, a management agent has ample opportunities to monitor and take appropriate actions such as granting more memory or terminating the workload.”…””}”(hjï1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¡hjÐ1h²hubhú)”}”(hX&Determining whether a cgroup has enough memory is not trivial as memory usage doesn't indicate whether the workload can benefit from more memory. For example, a workload which writes data received from network to a file can use all available memory but can also operate as performant with a small amount of memory. A measure of memory pressure - how much the workload is being impacted due to lack of memory - is necessary to determine whether a workload needs more memory; unfortunately, memory pressure monitoring mechanism isn't implemented yet.”h]”hX*Determining whether a cgroup has enough memory is not trivial as memory usage doesnâ€™t indicate whether the workload can benefit from more memory. For example, a workload which writes data received from network to a file can use all available memory but can also operate as performant with a small amount of memory. A measure of memory pressure - how much the workload is being impacted due to lack of memory - is necessary to determine whether a workload needs more memory; unfortunately, memory pressure monitoring mechanism isnâ€™t implemented yet.”…””}”(hjý1h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¦hjÐ1h²hubeh}”(h]”Œusage-guidelines”ah ]”h"]”Œusage guidelines”ah$]”h&]”uh1hÄhjh²hh³hÃh´MšubhÅ)”}”(hhh]”(hÊ)”}”(hŒReclaim Protection”h]”hŒReclaim Protection”…””}”(hj2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj2h²hh³hÃh´M±ubhú)”}”(hXfThe protection configured with "memory.low" or "memory.min" applies relatively to the target of the reclaim (i.e. any of memory cgroup limits, proactive memory.reclaim or global reclaim apparently located in the root cgroup). The protection value configured for B applies unchanged to the reclaim targeting A (i.e. caused by competition with the sibling E)::”h]”hXmThe protection configured with â€œmemory.lowâ€ or â€œmemory.minâ€ applies relatively to the target of the reclaim (i.e. any of memory cgroup limits, proactive memory.reclaim or global reclaim apparently located in the root cgroup). The protection value configured for B applies unchanged to the reclaim targeting A (i.e. caused by competition with the sibling E):”…””}”(hj$2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³hj2h²hubjj)”}”(hŒ@root - ... - A - B - C \ ` D ` E”h]”hŒ@root - ... - A - B - C \ ` D ` E”…””}”hj22sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M¹hj2h²hubhú)”}”(hŒºWhen the reclaim targets ancestors of A, the effective protection of B is capped by the protection value configured for A (and any other intermediate ancestors between A and the target).”h]”hŒºWhen the reclaim targets ancestors of A, the effective protection of B is capped by the protection value configured for A (and any other intermediate ancestors between A and the target).”…””}”(hj@2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M½hj2h²hubhú)”}”(hŒìTo express indifference about relative sibling protection, it is suggested to use memory_recursiveprot. Configuring all descendants of a parent with finite protection to "max" works but it may unnecessarily skew memory.events:low field.”h]”hŒðTo express indifference about relative sibling protection, it is suggested to use memory_recursiveprot. Configuring all descendants of a parent with finite protection to â€œmaxâ€ works but it may unnecessarily skew memory.events:low field.”…””}”(hjN2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÁhj2h²hubeh}”(h]”Œreclaim-protection”ah ]”h"]”Œreclaim protection”ah$]”h&]”uh1hÄhjh²hh³hÃh´M±ubhÅ)”}”(hhh]”(hÊ)”}”(hŒMemory Ownership”h]”hŒMemory Ownership”…””}”(hjg2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjd2h²hh³hÃh´MÇubhú)”}”(hXA memory area is charged to the cgroup which instantiated it and stays charged to the cgroup until the area is released. Migrating a process to a different cgroup doesn't move the memory usages that it instantiated while in the previous cgroup to the new cgroup.”h]”hX A memory area is charged to the cgroup which instantiated it and stays charged to the cgroup until the area is released. Migrating a process to a different cgroup doesnâ€™t move the memory usages that it instantiated while in the previous cgroup to the new cgroup.”…””}”(hju2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÉhjd2h²hubhú)”}”(hX A memory area may be used by processes belonging to different cgroups. To which cgroup the area will be charged is in-deterministic; however, over time, the memory area is likely to end up in a cgroup which has enough memory allowance to avoid high reclaim pressure.”h]”hX A memory area may be used by processes belonging to different cgroups. To which cgroup the area will be charged is in-deterministic; however, over time, the memory area is likely to end up in a cgroup which has enough memory allowance to avoid high reclaim pressure.”…””}”(hjƒ2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÎhjd2h²hubhú)”}”(hX If a cgroup sweeps a considerable amount of memory which is expected to be accessed repeatedly by other cgroups, it may make sense to use POSIX_FADV_DONTNEED to relinquish the ownership of memory areas belonging to the affected files to ensure correct memory ownership.”h]”hX If a cgroup sweeps a considerable amount of memory which is expected to be accessed repeatedly by other cgroups, it may make sense to use POSIX_FADV_DONTNEED to relinquish the ownership of memory areas belonging to the affected files to ensure correct memory ownership.”…””}”(hj‘2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÓhjd2h²hubeh}”(h]”Œmemory-ownership”ah ]”h"]”Œmemory ownership”ah$]”h&]”uh1hÄhjh²hh³hÃh´MÇubeh}”(h]”Œmemory”ah ]”h"]”h$]”Œmemory”ah&]”uh1hÄhjsh²hh³hÃh´MŒ referenced”KubhÅ)”}”(hhh]”(hÊ)”}”(hŒIO”h]”hŒIO”…””}”(hj³2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj°2h²hh³hÃh´MÚubhú)”}”(hXEThe "io" controller regulates the distribution of IO resources. This controller implements both weight based and absolute bandwidth or IOPS limit distribution. Absolute BPS and IOPS limits are enforced by blk-throttle and apply to all devices, while weight based proportional distribution is provided by the iocost cost model controller (CONFIG_BLK_CGROUP_IOCOST) and, when the BFQ I/O scheduler is in use for a device, by BFQ's own cgroup support. Latency-based protection (CONFIG_BLK_CGROUP_IOLATENCY) and I/O priority assignment (CONFIG_BLK_CGROUP_IOPRIO) are also available.”h]”hXKThe â€œioâ€ controller regulates the distribution of IO resources. This controller implements both weight based and absolute bandwidth or IOPS limit distribution. Absolute BPS and IOPS limits are enforced by blk-throttle and apply to all devices, while weight based proportional distribution is provided by the iocost cost model controller (CONFIG_BLK_CGROUP_IOCOST) and, when the BFQ I/O scheduler is in use for a device, by BFQâ€™s own cgroup support. Latency-based protection (CONFIG_BLK_CGROUP_IOLATENCY) and I/O priority assignment (CONFIG_BLK_CGROUP_IOPRIO) are also available.”…””}”(hjÁ2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÜhj°2h²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒIO Interface Files”h]”hŒIO Interface Files”…””}”(hjÒ2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÏ2h²hh³hÃh´MèubjÀ)”}”(hX€io.stat A read-only nested-keyed file. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined. ====== ===================== rbytes Bytes read wbytes Bytes written rios Number of read IOs wios Number of write IOs dbytes Bytes discarded dios Number of discard IOs ====== ===================== An example read output follows:: 8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021 io.cost.qos A read-write nested-keyed file which exists only on the root cgroup. This file configures the Quality of Service of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined. ====== ===================================== enable Weight-based control enable ctrl "auto" or "user" rpct Read latency percentile [0, 100] rlat Read latency threshold wpct Write latency percentile [0, 100] wlat Write latency threshold min Minimum scaling percentage [1, 10000] max Maximum scaling percentage [1, 10000] ====== ===================================== The controller is disabled by default and can be enabled by setting "enable" to 1. "rpct" and "wpct" parameters default to zero and the controller uses internal device saturation state to adjust the overall IO rate between "min" and "max". When a better control quality is needed, latency QoS parameters can be configured. For example:: 8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0 shows that on sdb, the controller is enabled, will consider the device saturated if the 95th percentile of read completion latencies is above 75ms or write 150ms, and adjust the overall IO issue rate between 50% and 150% accordingly. The lower the saturation point, the better the latency QoS at the cost of aggregate bandwidth. The narrower the allowed adjustment range between "min" and "max", the more conformant to the cost model the IO behavior. Note that the IO issue base rate may be far off from 100% and setting "min" and "max" blindly can lead to a significant loss of device capacity or control quality. "min" and "max" are useful for regulating devices which show wide temporary behavior changes - e.g. a ssd which accepts writes at the line speed for a while and then completely stalls for multiple seconds. When "ctrl" is "auto", the parameters are controlled by the kernel and may change automatically. Setting "ctrl" to "user" or setting any of the percentile and latency parameters puts it into "user" mode and disables the automatic changes. The automatic mode can be restored by setting "ctrl" to "auto". io.cost.model A read-write nested-keyed file which exists only on the root cgroup. This file configures the cost model of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined. ===== ================================ ctrl "auto" or "user" model The cost model in use - "linear" ===== ================================ When "ctrl" is "auto", the kernel may change all parameters dynamically. When "ctrl" is set to "user" or any other parameters are written to, "ctrl" become "user" and the automatic changes are disabled. When "model" is "linear", the following model parameters are defined. ============= ======================================== [r|w]bps The maximum sequential IO throughput [r|w]seqiops The maximum 4k sequential IOs per second [r|w]randiops The maximum 4k random IOs per second ============= ======================================== From the above, the builtin linear model determines the base costs of a sequential and random IO and the cost coefficient for the IO size. While simple, this model can cover most common device classes acceptably. The IO cost model isn't expected to be accurate in absolute sense and is scaled to the device behavior dynamically. If needed, tools/cgroup/iocost_coef_gen.py can be used to generate device-specific coefficients. io.weight A read-write flat-keyed file which exists on non-root cgroups. The default is "default 100". The first line is the default weight applied to devices without specific override. The rest are overrides keyed by $MAJ:$MIN device numbers and not ordered. The weights are in the range [1, 10000] and specifies the relative amount IO time the cgroup can use in relation to its siblings. The default weight can be updated by writing either "default $WEIGHT" or simply "$WEIGHT". Overrides can be set by writing "$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default". An example read output follows:: default 100 8:16 200 8:0 50 io.max A read-write nested-keyed file which exists on non-root cgroups. BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined. ===== ================================== rbps Max read bytes per second wbps Max write bytes per second riops Max read IO operations per second wiops Max write IO operations per second ===== ================================== When writing, any number of nested key-value pairs can be specified in any order. "max" can be specified as the value to remove a specific limit. If the same key is specified multiple times, the outcome is undefined. BPS and IOPS are measured in each IO direction and IOs are delayed if limit is reached. Temporary bursts are allowed. Setting read limit at 2M BPS and write at 120 IOPS for 8:16:: echo "8:16 rbps=2097152 wiops=120" > io.max Reading returns the following:: 8:16 rbps=2097152 wbps=max riops=max wiops=120 Write IOPS limit can be removed by writing the following:: echo "8:16 wiops=max" > io.max Reading now returns the following:: 8:16 rbps=2097152 wbps=max riops=max wiops=max io.pressure A read-write nested-keyed file. Shows pressure stall information for IO. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”jÆ)”}”(hhh]”(jË)”}”(hX`io.stat A read-only nested-keyed file. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined. ====== ===================== rbytes Bytes read wbytes Bytes written rios Number of read IOs wios Number of write IOs dbytes Bytes discarded dios Number of discard IOs ====== ===================== An example read output follows:: 8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021 ”h]”(jÑ)”}”(hŒio.stat”h]”hŒio.stat”…””}”(hjë2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mühjç2ubjá)”}”(hhh]”(hú)”}”(hŒA read-only nested-keyed file.”h]”hŒA read-only nested-keyed file.”…””}”(hjü2h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mëhjù2ubhú)”}”(hŒcLines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined.”h]”hŒcLines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined.”…””}”(hj 3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Míhjù2ubjÀ)”}”(hX====== ===================== rbytes Bytes read wbytes Bytes written rios Number of read IOs wios Number of write IOs dbytes Bytes discarded dios Number of discard IOs ====== ===================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hj3ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hj3ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrbytes”h]”hŒrbytes”…””}”(hj?3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mñhj<3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj93ubjH)”}”(hhh]”hú)”}”(hŒ Bytes read”h]”hŒ Bytes read”…””}”(hjV3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MñhjS3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj93ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwbytes”h]”hŒwbytes”…””}”(hjv3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mòhjs3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjp3ubjH)”}”(hhh]”hú)”}”(hŒ Bytes written”h]”hŒ Bytes written”…””}”(hj3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MòhjŠ3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjp3ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrios”h]”hŒrios”…””}”(hj3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Móhjª3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj§3ubjH)”}”(hhh]”hú)”}”(hŒNumber of read IOs”h]”hŒNumber of read IOs”…””}”(hjÄ3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MóhjÁ3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj§3ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwios”h]”hŒwios”…””}”(hjä3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Môhjá3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÞ3ubjH)”}”(hhh]”hú)”}”(hŒNumber of write IOs”h]”hŒNumber of write IOs”…””}”(hjû3h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Môhjø3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÞ3ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒdbytes”h]”hŒdbytes”…””}”(hj4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mõhj4ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj4ubjH)”}”(hhh]”hú)”}”(hŒBytes discarded”h]”hŒBytes discarded”…””}”(hj24h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mõhj/4ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj4ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒdios”h]”hŒdios”…””}”(hjR4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MöhjO4ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjL4ubjH)”}”(hhh]”hú)”}”(hŒNumber of discard IOs”h]”hŒNumber of discard IOs”…””}”(hji4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Möhjf4ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjL4ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj63ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hj3ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hj3ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj3ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´Mðhjù2ubhú)”}”(hŒ An example read output follows::”h]”hŒAn example read output follows:”…””}”(hjœ4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mùhjù2ubjj)”}”(hŒ™8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021”h]”hŒ™8:16 rbytes=1459200 wbytes=314773504 rios=192 wios=353 dbytes=0 dios=0 8:0 rbytes=90430464 wbytes=299008000 rios=8950 wios=1252 dbytes=50331648 dios=3021”…””}”hjª4sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mûhjù2ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjç2ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mühjä2ubjË)”}”(hXÍ io.cost.qos A read-write nested-keyed file which exists only on the root cgroup. This file configures the Quality of Service of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined. ====== ===================================== enable Weight-based control enable ctrl "auto" or "user" rpct Read latency percentile [0, 100] rlat Read latency threshold wpct Write latency percentile [0, 100] wlat Write latency threshold min Minimum scaling percentage [1, 10000] max Maximum scaling percentage [1, 10000] ====== ===================================== The controller is disabled by default and can be enabled by setting "enable" to 1. "rpct" and "wpct" parameters default to zero and the controller uses internal device saturation state to adjust the overall IO rate between "min" and "max". When a better control quality is needed, latency QoS parameters can be configured. For example:: 8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0 shows that on sdb, the controller is enabled, will consider the device saturated if the 95th percentile of read completion latencies is above 75ms or write 150ms, and adjust the overall IO issue rate between 50% and 150% accordingly. The lower the saturation point, the better the latency QoS at the cost of aggregate bandwidth. The narrower the allowed adjustment range between "min" and "max", the more conformant to the cost model the IO behavior. Note that the IO issue base rate may be far off from 100% and setting "min" and "max" blindly can lead to a significant loss of device capacity or control quality. "min" and "max" are useful for regulating devices which show wide temporary behavior changes - e.g. a ssd which accepts writes at the line speed for a while and then completely stalls for multiple seconds. When "ctrl" is "auto", the parameters are controlled by the kernel and may change automatically. Setting "ctrl" to "user" or setting any of the percentile and latency parameters puts it into "user" mode and disables the automatic changes. The automatic mode can be restored by setting "ctrl" to "auto". ”h]”(jÑ)”}”(hŒio.cost.qos”h]”hŒio.cost.qos”…””}”(hjÈ4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M3hjÄ4ubjá)”}”(hhh]”(hú)”}”(hŒDA read-write nested-keyed file which exists only on the root cgroup.”h]”hŒDA read-write nested-keyed file which exists only on the root cgroup.”…””}”(hjÙ4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÿhjÖ4ubhú)”}”(hX€This file configures the Quality of Service of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined.”h]”hXŒThis file configures the Quality of Service of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements â€œio.weightâ€ proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on â€œio.cost.qosâ€ or â€œio.cost.modelâ€. The following nested keys are defined.”…””}”(hjç4h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÖ4ubjÀ)”}”(hXÈ====== ===================================== enable Weight-based control enable ctrl "auto" or "user" rpct Read latency percentile [0, 100] rlat Read latency threshold wpct Write latency percentile [0, 100] wlat Write latency threshold min Minimum scaling percentage [1, 10000] max Maximum scaling percentage [1, 10000] ====== ===================================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjü4ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K%uh1j'hjü4ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒenable”h]”hŒenable”…””}”(hj5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj5ubjH)”}”(hhh]”hú)”}”(hŒWeight-based control enable”h]”hŒWeight-based control enable”…””}”(hj35h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj05ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒctrl”h]”hŒctrl”…””}”(hjS5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjP5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjM5ubjH)”}”(hhh]”hú)”}”(hŒ"auto" or "user"”h]”hŒâ€œautoâ€ or â€œuserâ€”…””}”(hjj5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjg5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjM5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrpct”h]”hŒrpct”…””}”(hjŠ5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj‡5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj„5ubjH)”}”(hhh]”hú)”}”(hŒ#Read latency percentile [0, 100]”h]”hŒ#Read latency percentile [0, 100]”…””}”(hj¡5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjž5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj„5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrlat”h]”hŒrlat”…””}”(hjÁ5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj¾5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj»5ubjH)”}”(hhh]”hú)”}”(hŒRead latency threshold”h]”hŒRead latency threshold”…””}”(hjØ5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÕ5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj»5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwpct”h]”hŒwpct”…””}”(hjø5h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjõ5ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjò5ubjH)”}”(hhh]”hú)”}”(hŒ#Write latency percentile [0, 100]”h]”hŒ#Write latency percentile [0, 100]”…””}”(hj6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjò5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwlat”h]”hŒwlat”…””}”(hj/6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj,6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj)6ubjH)”}”(hhh]”hú)”}”(hŒWrite latency threshold”h]”hŒWrite latency threshold”…””}”(hjF6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjC6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj)6ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒmin”h]”hŒmin”…””}”(hjf6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjc6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj`6ubjH)”}”(hhh]”hú)”}”(hŒ%Minimum scaling percentage [1, 10000]”h]”hŒ%Minimum scaling percentage [1, 10000]”…””}”(hj}6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjz6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj`6ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒmax”h]”hŒmax”…””}”(hj6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhjš6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj—6ubjH)”}”(hhh]”hú)”}”(hŒ%Maximum scaling percentage [1, 10000]”h]”hŒ%Maximum scaling percentage [1, 10000]”…””}”(hj´6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj±6ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj—6ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj5ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjü4ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjù4ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjõ4ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M hjÖ4ubhú)”}”(hŒðThe controller is disabled by default and can be enabled by setting "enable" to 1. "rpct" and "wpct" parameters default to zero and the controller uses internal device saturation state to adjust the overall IO rate between "min" and "max".”h]”hXThe controller is disabled by default and can be enabled by setting â€œenableâ€ to 1. â€œrpctâ€ and â€œwpctâ€ parameters default to zero and the controller uses internal device saturation state to adjust the overall IO rate between â€œminâ€ and â€œmaxâ€.”…””}”(hjç6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÖ4ubhú)”}”(hŒaWhen a better control quality is needed, latency QoS parameters can be configured. For example::”h]”hŒ`When a better control quality is needed, latency QoS parameters can be configured. For example:”…””}”(hjõ6h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÖ4ubjj)”}”(hŒX8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0”h]”hŒX8:16 enable=1 ctrl=auto rpct=95.00 rlat=75000 wpct=95.00 wlat=150000 min=50.00 max=150.0”…””}”hj7sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MhjÖ4ubhú)”}”(hŒéshows that on sdb, the controller is enabled, will consider the device saturated if the 95th percentile of read completion latencies is above 75ms or write 150ms, and adjust the overall IO issue rate between 50% and 150% accordingly.”h]”hŒéshows that on sdb, the controller is enabled, will consider the device saturated if the 95th percentile of read completion latencies is above 75ms or write 150ms, and adjust the overall IO issue rate between 50% and 150% accordingly.”…””}”(hj7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÖ4ubhú)”}”(hXMThe lower the saturation point, the better the latency QoS at the cost of aggregate bandwidth. The narrower the allowed adjustment range between "min" and "max", the more conformant to the cost model the IO behavior. Note that the IO issue base rate may be far off from 100% and setting "min" and "max" blindly can lead to a significant loss of device capacity or control quality. "min" and "max" are useful for regulating devices which show wide temporary behavior changes - e.g. a ssd which accepts writes at the line speed for a while and then completely stalls for multiple seconds.”h]”hXeThe lower the saturation point, the better the latency QoS at the cost of aggregate bandwidth. The narrower the allowed adjustment range between â€œminâ€ and â€œmaxâ€, the more conformant to the cost model the IO behavior. Note that the IO issue base rate may be far off from 100% and setting â€œminâ€ and â€œmaxâ€ blindly can lead to a significant loss of device capacity or control quality. â€œminâ€ and â€œmaxâ€ are useful for regulating devices which show wide temporary behavior changes - e.g. a ssd which accepts writes at the line speed for a while and then completely stalls for multiple seconds.”…””}”(hj7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M$hjÖ4ubhú)”}”(hX0When "ctrl" is "auto", the parameters are controlled by the kernel and may change automatically. Setting "ctrl" to "user" or setting any of the percentile and latency parameters puts it into "user" mode and disables the automatic changes. The automatic mode can be restored by setting "ctrl" to "auto".”h]”hXLWhen â€œctrlâ€ is â€œautoâ€, the parameters are controlled by the kernel and may change automatically. Setting â€œctrlâ€ to â€œuserâ€ or setting any of the percentile and latency parameters puts it into â€œuserâ€ mode and disables the automatic changes. The automatic mode can be restored by setting â€œctrlâ€ to â€œautoâ€.”…””}”(hj-7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M/hjÖ4ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÄ4ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M3hjä2ubjË)”}”(hXZio.cost.model A read-write nested-keyed file which exists only on the root cgroup. This file configures the cost model of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined. ===== ================================ ctrl "auto" or "user" model The cost model in use - "linear" ===== ================================ When "ctrl" is "auto", the kernel may change all parameters dynamically. When "ctrl" is set to "user" or any other parameters are written to, "ctrl" become "user" and the automatic changes are disabled. When "model" is "linear", the following model parameters are defined. ============= ======================================== [r|w]bps The maximum sequential IO throughput [r|w]seqiops The maximum 4k sequential IOs per second [r|w]randiops The maximum 4k random IOs per second ============= ======================================== From the above, the builtin linear model determines the base costs of a sequential and random IO and the cost coefficient for the IO size. While simple, this model can cover most common device classes acceptably. The IO cost model isn't expected to be accurate in absolute sense and is scaled to the device behavior dynamically. If needed, tools/cgroup/iocost_coef_gen.py can be used to generate device-specific coefficients. ”h]”(jÑ)”}”(hŒ io.cost.model”h]”hŒ io.cost.model”…””}”(hjK7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M]hjG7ubjá)”}”(hhh]”(hú)”}”(hŒDA read-write nested-keyed file which exists only on the root cgroup.”h]”hŒDA read-write nested-keyed file which exists only on the root cgroup.”…””}”(hj\7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M6hjY7ubhú)”}”(hXxThis file configures the cost model of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements "io.weight" proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on "io.cost.qos" or "io.cost.model". The following nested keys are defined.”h]”hX„This file configures the cost model of the IO cost model based controller (CONFIG_BLK_CGROUP_IOCOST) which currently implements â€œio.weightâ€ proportional control. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The line for a given device is populated on the first write for the device on â€œio.cost.qosâ€ or â€œio.cost.modelâ€. The following nested keys are defined.”…””}”(hjj7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M9hjY7ubjÀ)”}”(hŒ¬===== ================================ ctrl "auto" or "user" model The cost model in use - "linear" ===== ================================ ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hj7ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hj7ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒctrl”h]”hŒctrl”…””}”(hjŸ7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MBhjœ7ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj™7ubjH)”}”(hhh]”hú)”}”(hŒ"auto" or "user"”h]”hŒâ€œautoâ€ or â€œuserâ€”…””}”(hj¶7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MBhj³7ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj™7ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj–7ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒmodel”h]”hŒmodel”…””}”(hjÖ7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MChjÓ7ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÐ7ubjH)”}”(hhh]”hú)”}”(hŒ The cost model in use - "linear"”h]”hŒ$The cost model in use - â€œlinearâ€”…””}”(hjí7h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MChjê7ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÐ7ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj–7ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hj7ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hj|7ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjx7ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MAhjY7ubhú)”}”(hŒËWhen "ctrl" is "auto", the kernel may change all parameters dynamically. When "ctrl" is set to "user" or any other parameters are written to, "ctrl" become "user" and the automatic changes are disabled.”h]”hŒãWhen â€œctrlâ€ is â€œautoâ€, the kernel may change all parameters dynamically. When â€œctrlâ€ is set to â€œuserâ€ or any other parameters are written to, â€œctrlâ€ become â€œuserâ€ and the automatic changes are disabled.”…””}”(hj 8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MFhjY7ubhú)”}”(hŒEWhen "model" is "linear", the following model parameters are defined.”h]”hŒMWhen â€œmodelâ€ is â€œlinearâ€, the following model parameters are defined.”…””}”(hj.8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MKhjY7ubjÀ)”}”(hX============= ======================================== [r|w]bps The maximum sequential IO throughput [r|w]seqiops The maximum 4k sequential IOs per second [r|w]randiops The maximum 4k random IOs per second ============= ======================================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hjC8ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K(uh1j'hjC8ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ[r|w]bps”h]”hŒ[r|w]bps”…””}”(hjc8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MOhj`8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj]8ubjH)”}”(hhh]”hú)”}”(hŒ$The maximum sequential IO throughput”h]”hŒ$The maximum sequential IO throughput”…””}”(hjz8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MOhjw8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj]8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjZ8ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ[r|w]seqiops”h]”hŒ[r|w]seqiops”…””}”(hjš8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MPhj—8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj”8ubjH)”}”(hhh]”hú)”}”(hŒ(The maximum 4k sequential IOs per second”h]”hŒ(The maximum 4k sequential IOs per second”…””}”(hj±8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MPhj®8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj”8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjZ8ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ [r|w]randiops”h]”hŒ [r|w]randiops”…””}”(hjÑ8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MQhjÎ8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjË8ubjH)”}”(hhh]”hú)”}”(hŒ$The maximum 4k random IOs per second”h]”hŒ$The maximum 4k random IOs per second”…””}”(hjè8h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MQhjå8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjË8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjZ8ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjC8ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hj@8ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj<8ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MNhjY7ubhú)”}”(hŒÕFrom the above, the builtin linear model determines the base costs of a sequential and random IO and the cost coefficient for the IO size. While simple, this model can cover most common device classes acceptably.”h]”hŒÕFrom the above, the builtin linear model determines the base costs of a sequential and random IO and the cost coefficient for the IO size. While simple, this model can cover most common device classes acceptably.”…””}”(hj9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MThjY7ubhú)”}”(hŒsThe IO cost model isn't expected to be accurate in absolute sense and is scaled to the device behavior dynamically.”h]”hŒuThe IO cost model isnâ€™t expected to be accurate in absolute sense and is scaled to the device behavior dynamically.”…””}”(hj)9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MYhjY7ubhú)”}”(hŒ`If needed, tools/cgroup/iocost_coef_gen.py can be used to generate device-specific coefficients.”h]”hŒ`If needed, tools/cgroup/iocost_coef_gen.py can be used to generate device-specific coefficients.”…””}”(hj79h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M\hjY7ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjG7ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M]hjä2ubjË)”}”(hX‰io.weight A read-write flat-keyed file which exists on non-root cgroups. The default is "default 100". The first line is the default weight applied to devices without specific override. The rest are overrides keyed by $MAJ:$MIN device numbers and not ordered. The weights are in the range [1, 10000] and specifies the relative amount IO time the cgroup can use in relation to its siblings. The default weight can be updated by writing either "default $WEIGHT" or simply "$WEIGHT". Overrides can be set by writing "$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default". An example read output follows:: default 100 8:16 200 8:0 50 ”h]”(jÑ)”}”(hŒ io.weight”h]”hŒ io.weight”…””}”(hjU9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MqhjQ9ubjá)”}”(hhh]”(hú)”}”(hŒ\A read-write flat-keyed file which exists on non-root cgroups. The default is "default 100".”h]”hŒ`A read-write flat-keyed file which exists on non-root cgroups. The default is â€œdefault 100â€.”…””}”(hjf9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M`hjc9ubhú)”}”(hX The first line is the default weight applied to devices without specific override. The rest are overrides keyed by $MAJ:$MIN device numbers and not ordered. The weights are in the range [1, 10000] and specifies the relative amount IO time the cgroup can use in relation to its siblings.”h]”hX The first line is the default weight applied to devices without specific override. The rest are overrides keyed by $MAJ:$MIN device numbers and not ordered. The weights are in the range [1, 10000] and specifies the relative amount IO time the cgroup can use in relation to its siblings.”…””}”(hjt9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mchjc9ubhú)”}”(hŒ¹The default weight can be updated by writing either "default $WEIGHT" or simply "$WEIGHT". Overrides can be set by writing "$MAJ:$MIN $WEIGHT" and unset by writing "$MAJ:$MIN default".”h]”hŒÉThe default weight can be updated by writing either â€œdefault $WEIGHTâ€ or simply â€œ$WEIGHTâ€. Overrides can be set by writing â€œ$MAJ:$MIN $WEIGHTâ€ and unset by writing â€œ$MAJ:$MIN defaultâ€.”…””}”(hj‚9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mihjc9ubhú)”}”(hŒ An example read output follows::”h]”hŒAn example read output follows:”…””}”(hj9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mmhjc9ubjj)”}”(hŒdefault 100 8:16 200 8:0 50”h]”hŒdefault 100 8:16 200 8:0 50”…””}”hjž9sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mohjc9ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjQ9ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mqhjä2ubjË)”}”(hX·io.max A read-write nested-keyed file which exists on non-root cgroups. BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined. ===== ================================== rbps Max read bytes per second wbps Max write bytes per second riops Max read IO operations per second wiops Max write IO operations per second ===== ================================== When writing, any number of nested key-value pairs can be specified in any order. "max" can be specified as the value to remove a specific limit. If the same key is specified multiple times, the outcome is undefined. BPS and IOPS are measured in each IO direction and IOs are delayed if limit is reached. Temporary bursts are allowed. Setting read limit at 2M BPS and write at 120 IOPS for 8:16:: echo "8:16 rbps=2097152 wiops=120" > io.max Reading returns the following:: 8:16 rbps=2097152 wbps=max riops=max wiops=120 Write IOPS limit can be removed by writing the following:: echo "8:16 wiops=max" > io.max Reading now returns the following:: 8:16 rbps=2097152 wbps=max riops=max wiops=max ”h]”(jÑ)”}”(hŒio.max”h]”hŒio.max”…””}”(hj¼9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M˜hj¸9ubjá)”}”(hhh]”(hú)”}”(hŒ@A read-write nested-keyed file which exists on non-root cgroups.”h]”hŒ@A read-write nested-keyed file which exists on non-root cgroups.”…””}”(hjÍ9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MthjÊ9ubhú)”}”(hŒ‚BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined.”h]”hŒ‚BPS and IOPS based IO limit. Lines are keyed by $MAJ:$MIN device numbers and not ordered. The following nested keys are defined.”…””}”(hjÛ9h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MwhjÊ9ubjÀ)”}”(hX===== ================================== rbps Max read bytes per second wbps Max write bytes per second riops Max read IO operations per second wiops Max write IO operations per second ===== ================================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjð9ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K"uh1j'hjð9ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrbps”h]”hŒrbps”…””}”(hj:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M|hj :ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj :ubjH)”}”(hhh]”hú)”}”(hŒMax read bytes per second”h]”hŒMax read bytes per second”…””}”(hj':h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M|hj$:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj :ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj:ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwbps”h]”hŒwbps”…””}”(hjG:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M}hjD:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjA:ubjH)”}”(hhh]”hú)”}”(hŒMax write bytes per second”h]”hŒMax write bytes per second”…””}”(hj^:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M}hj[:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjA:ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj:ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒriops”h]”hŒriops”…””}”(hj~:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M~hj{:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjx:ubjH)”}”(hhh]”hú)”}”(hŒ!Max read IO operations per second”h]”hŒ!Max read IO operations per second”…””}”(hj•:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M~hj’:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjx:ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj:ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒwiops”h]”hŒwiops”…””}”(hjµ:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj²:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj¯:ubjH)”}”(hhh]”hú)”}”(hŒ"Max write IO operations per second”h]”hŒ"Max write IO operations per second”…””}”(hjÌ:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÉ:ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj¯:ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj:ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjð9ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjí9ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjé9ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M{hjÊ9ubhú)”}”(hŒÚWhen writing, any number of nested key-value pairs can be specified in any order. "max" can be specified as the value to remove a specific limit. If the same key is specified multiple times, the outcome is undefined.”h]”hŒÞWhen writing, any number of nested key-value pairs can be specified in any order. â€œmaxâ€ can be specified as the value to remove a specific limit. If the same key is specified multiple times, the outcome is undefined.”…””}”(hjÿ:h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‚hjÊ9ubhú)”}”(hŒvBPS and IOPS are measured in each IO direction and IOs are delayed if limit is reached. Temporary bursts are allowed.”h]”hŒvBPS and IOPS are measured in each IO direction and IOs are delayed if limit is reached. Temporary bursts are allowed.”…””}”(hj ;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‡hjÊ9ubhú)”}”(hŒ=Setting read limit at 2M BPS and write at 120 IOPS for 8:16::”h]”hŒ io.max”h]”hŒ+echo "8:16 rbps=2097152 wiops=120" > io.max”…””}”hj);sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MŒhjÊ9ubhú)”}”(hŒReading returns the following::”h]”hŒReading returns the following:”…””}”(hj7;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŽhjÊ9ubjj)”}”(hŒ.8:16 rbps=2097152 wbps=max riops=max wiops=120”h]”hŒ.8:16 rbps=2097152 wbps=max riops=max wiops=120”…””}”hjE;sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MhjÊ9ubhú)”}”(hŒ:Write IOPS limit can be removed by writing the following::”h]”hŒ9Write IOPS limit can be removed by writing the following:”…””}”(hjS;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M’hjÊ9ubjj)”}”(hŒecho "8:16 wiops=max" > io.max”h]”hŒecho "8:16 wiops=max" > io.max”…””}”hja;sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M”hjÊ9ubhú)”}”(hŒ#Reading now returns the following::”h]”hŒ"Reading now returns the following:”…””}”(hjo;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M–hjÊ9ubjj)”}”(hŒ.8:16 rbps=2097152 wbps=max riops=max wiops=max”h]”hŒ.8:16 rbps=2097152 wbps=max riops=max wiops=max”…””}”hj};sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M˜hjÊ9ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¸9ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M˜hjä2ubjË)”}”(hŒ–io.pressure A read-write nested-keyed file. Shows pressure stall information for IO. See :ref:`Documentation/accounting/psi.rst ` for details. ”h]”(jÑ)”}”(hŒio.pressure”h]”hŒio.pressure”…””}”(hj›;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MŸhj—;ubjá)”}”(hhh]”(hú)”}”(hŒA read-write nested-keyed file.”h]”hŒA read-write nested-keyed file.”…””}”(hj¬;h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M›hj©;ubhú)”}”(hŒgShows pressure stall information for IO. See :ref:`Documentation/accounting/psi.rst ` for details.”h]”(hŒ-Shows pressure stall information for IO. See ”…””}”(hjº;h²hh³Nh´Nubh)”}”(hŒ-:ref:`Documentation/accounting/psi.rst `”h]”jl)”}”(hjÄ;h]”hŒ Documentation/accounting/psi.rst”…””}”(hjÆ;h²hh³Nh´Nubah}”(h]”h ]”(jwŒstd”Œstd-ref”eh"]”h$]”h&]”uh1jkhjÂ;ubah}”(h]”h ]”h"]”h$]”h&]”Œrefdoc”j„Œ refdomain”jÐ;Œreftype”Œref”Œrefexplicit”ˆŒrefwarn”ˆjŠŒpsi”uh1hh³hÃh´Mhjº;ubhŒ for details.”…””}”(hjº;h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj©;ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj—;ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MŸhjä2ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjà2ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MêhjÏ2h²hubeh}”(h]”Œio-interface-files”ah ]”h"]”Œio interface files”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´MèubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Writeback”h]”hŒ Writeback”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj<h²hh³hÃh´M¢ubhú)”}”(hXPage cache is dirtied through buffered writes and shared mmaps and written asynchronously to the backing filesystem by the writeback mechanism. Writeback sits between the memory and IO domains and regulates the proportion of dirty memory by balancing dirtying and write IOs.”h]”hXPage cache is dirtied through buffered writes and shared mmaps and written asynchronously to the backing filesystem by the writeback mechanism. Writeback sits between the memory and IO domains and regulates the proportion of dirty memory by balancing dirtying and write IOs.”…””}”(hj<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¤hj<h²hubhú)”}”(hXªThe io controller, in conjunction with the memory controller, implements control of page cache writeback IOs. The memory controller defines the memory domain that dirty memory ratio is calculated and maintained for and the io controller defines the io domain which writes out dirty pages for the memory domain. Both system-wide and per-cgroup dirty memory states are examined and the more restrictive of the two is enforced.”h]”hXªThe io controller, in conjunction with the memory controller, implements control of page cache writeback IOs. The memory controller defines the memory domain that dirty memory ratio is calculated and maintained for and the io controller defines the io domain which writes out dirty pages for the memory domain. Both system-wide and per-cgroup dirty memory states are examined and the more restrictive of the two is enforced.”…””}”(hj+<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mªhj<h²hubhú)”}”(hŒçcgroup writeback requires explicit support from the underlying filesystem. Currently, cgroup writeback is implemented on ext2, ext4, btrfs, f2fs, and xfs. On other filesystems, all writeback IOs are attributed to the root cgroup.”h]”hŒçcgroup writeback requires explicit support from the underlying filesystem. Currently, cgroup writeback is implemented on ext2, ext4, btrfs, f2fs, and xfs. On other filesystems, all writeback IOs are attributed to the root cgroup.”…””}”(hj9<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M²hj<h²hubhú)”}”(hX>There are inherent differences in memory and writeback management which affects how cgroup ownership is tracked. Memory is tracked per page while writeback per inode. For the purpose of writeback, an inode is assigned to a cgroup and all IO requests to write dirty pages from the inode are attributed to that cgroup.”h]”hX>There are inherent differences in memory and writeback management which affects how cgroup ownership is tracked. Memory is tracked per page while writeback per inode. For the purpose of writeback, an inode is assigned to a cgroup and all IO requests to write dirty pages from the inode are attributed to that cgroup.”…””}”(hjG<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M·hj<h²hubhú)”}”(hXAs cgroup ownership for memory is tracked per page, there can be pages which are associated with different cgroups than the one the inode is associated with. These are called foreign pages. The writeback constantly keeps track of foreign pages and, if a particular foreign cgroup becomes the majority over a certain period of time, switches the ownership of the inode to that cgroup.”h]”hXAs cgroup ownership for memory is tracked per page, there can be pages which are associated with different cgroups than the one the inode is associated with. These are called foreign pages. The writeback constantly keeps track of foreign pages and, if a particular foreign cgroup becomes the majority over a certain period of time, switches the ownership of the inode to that cgroup.”…””}”(hjU<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M½hj<h²hubhú)”}”(hXrWhile this model is enough for most use cases where a given inode is mostly dirtied by a single cgroup even when the main writing cgroup changes over time, use cases where multiple cgroups write to a single inode simultaneously are not supported well. In such circumstances, a significant portion of IOs are likely to be attributed incorrectly. As memory controller assigns page ownership on the first use and doesn't update it until the page is released, even if writeback strictly follows page ownership, multiple cgroups dirtying overlapping areas wouldn't work as expected. It's recommended to avoid such usage patterns.”h]”hXxWhile this model is enough for most use cases where a given inode is mostly dirtied by a single cgroup even when the main writing cgroup changes over time, use cases where multiple cgroups write to a single inode simultaneously are not supported well. In such circumstances, a significant portion of IOs are likely to be attributed incorrectly. As memory controller assigns page ownership on the first use and doesnâ€™t update it until the page is released, even if writeback strictly follows page ownership, multiple cgroups dirtying overlapping areas wouldnâ€™t work as expected. Itâ€™s recommended to avoid such usage patterns.”…””}”(hjc<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÄhj<h²hubhú)”}”(hŒ\The sysctl knobs which affect writeback behavior are applied to cgroup writeback as follows.”h]”hŒ\The sysctl knobs which affect writeback behavior are applied to cgroup writeback as follows.”…””}”(hjq<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÏhj<h²hubjÀ)”}”(hXªvm.dirty_background_ratio, vm.dirty_ratio These ratios apply the same to cgroup writeback with the amount of available memory capped by limits imposed by the memory controller and system-wide clean memory. vm.dirty_background_bytes, vm.dirty_bytes For cgroup writeback, this is calculated into ratio against total available memory and applied the same way as vm.dirty[_background]_ratio. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒÎvm.dirty_background_ratio, vm.dirty_ratio These ratios apply the same to cgroup writeback with the amount of available memory capped by limits imposed by the memory controller and system-wide clean memory. ”h]”(jÑ)”}”(hŒ)vm.dirty_background_ratio, vm.dirty_ratio”h]”hŒ)vm.dirty_background_ratio, vm.dirty_ratio”…””}”(hjŠ<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÕhj†<ubjá)”}”(hhh]”hú)”}”(hŒ£These ratios apply the same to cgroup writeback with the amount of available memory capped by limits imposed by the memory controller and system-wide clean memory.”h]”hŒ£These ratios apply the same to cgroup writeback with the amount of available memory capped by limits imposed by the memory controller and system-wide clean memory.”…””}”(hj›<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÓhj˜<ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj†<ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÕhjƒ<ubjË)”}”(hŒ·vm.dirty_background_bytes, vm.dirty_bytes For cgroup writeback, this is calculated into ratio against total available memory and applied the same way as vm.dirty[_background]_ratio. ”•h]”(jÑ)”}”(hŒ)vm.dirty_background_bytes, vm.dirty_bytes”h]”hŒ)vm.dirty_background_bytes, vm.dirty_bytes”…””}”(hj¹<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÛhjµ<ubjá)”}”(hhh]”hú)”}”(hŒ‹For cgroup writeback, this is calculated into ratio against total available memory and applied the same way as vm.dirty[_background]_ratio.”h]”hŒ‹For cgroup writeback, this is calculated into ratio against total available memory and applied the same way as vm.dirty[_background]_ratio.”…””}”(hjÊ<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MØhjÇ<ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjµ<ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÛhjƒ<ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj<ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MÒhj<h²hubeh}”(h]”Œ writeback”ah ]”h"]”Œ writeback”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´M¢ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ IO Latency”h]”hŒ IO Latency”…””}”(hjû<h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjø<h²hh³hÃh´MÞubhú)”}”(hXæThis is a cgroup v2 controller for IO workload protection. You provide a group with a latency target, and if the group misses its target the controller will throttle any peers that have a lower latency target than the protected workload. How a miss is detected depends on the device: on rotational devices the average latency over the window must exceed the target, while on non-rotational devices a miss is counted once enough of the IOs in the window individually exceed the target.”h]”hXæThis is a cgroup v2 controller for IO workload protection. You provide a group with a latency target, and if the group misses its target the controller will throttle any peers that have a lower latency target than the protected workload. How a miss is detected depends on the device: on rotational devices the average latency over the window must exceed the target, while on non-rotational devices a miss is counted once enough of the IOs in the window individually exceed the target.”…””}”(hj =h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Màhjø<h²hubhú)”}”(hŒèThe limits are only applied at the peer level in the hierarchy. This means that in the diagram below, only groups A, B, and C will influence each other, and groups D and F will influence each other. Group G will influence nobody::”h]”hŒçThe limits are only applied at the peer level in the hierarchy. This means that in the diagram below, only groups A, B, and C will influence each other, and groups D and F will influence each other. Group G will influence nobody:”…””}”(hj=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mèhjø<h²hubjj)”}”(hŒf [root] / | \ A B C / \ | D F G”h]”hŒf [root] / | \ A B C / \ | D F G”…””}”hj%=sbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mìhjø<h²hubhú)”}”(hX³So the ideal way to configure this is to set io.latency in groups A, B, and C. Generally you do not want to set a value lower than the latency your device supports. Experiment to find the value that works best for your workload. Start at higher than the expected latency for your device and, with blkcg_debug_stats enabled, observe io.stat for your workload group to get an idea of the latency you see during normal operation. On rotational devices, use the avg_lat value as a basis for your real setting, setting it 10-15% higher. On non-rotational devices io.stat reports no average latency; set the target based on your device and use the missed/total fields to verify it is being met.”h]”hX³So the ideal way to configure this is to set io.latency in groups A, B, and C. Generally you do not want to set a value lower than the latency your device supports. Experiment to find the value that works best for your workload. Start at higher than the expected latency for your device and, with blkcg_debug_stats enabled, observe io.stat for your workload group to get an idea of the latency you see during normal operation. On rotational devices, use the avg_lat value as a basis for your real setting, setting it 10-15% higher. On non-rotational devices io.stat reports no average latency; set the target based on your device and use the missed/total fields to verify it is being met.”…””}”(hj3=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Móhjø<h²hubeh}”(h]”Œ io-latency”ah ]”h"]”Œ io latency”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´MÞubhÅ)”}”(hhh]”(hÊ)”}”(hŒHow IO Latency Throttling Works”h]”hŒHow IO Latency Throttling Works”…””}”(hjL=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjI=h²hh³hÃh´Mÿubhú)”}”(hXio.latency is work conserving; so as long as everybody is meeting their latency target the controller doesn't do anything. Once a group starts missing its target it begins throttling any peer group that has a higher target than itself. This throttling takes 2 forms:”h]”hX io.latency is work conserving; so as long as everybody is meeting their latency target the controller doesnâ€™t do anything. Once a group starts missing its target it begins throttling any peer group that has a higher target than itself. This throttling takes 2 forms:”…””}”(hjZ=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjI=h²hubj¾)”}”(hhh]”(jÃ)”}”(hŒÇQueue depth throttling. This is the number of outstanding IO's a group is allowed to have. We will clamp down relatively quickly, starting at no limit and going all the way down to 1 IO at a time. ”h]”hú)”}”(hŒÆQueue depth throttling. This is the number of outstanding IO's a group is allowed to have. We will clamp down relatively quickly, starting at no limit and going all the way down to 1 IO at a time.”h]”hŒÈQueue depth throttling. This is the number of outstanding IOâ€™s a group is allowed to have. We will clamp down relatively quickly, starting at no limit and going all the way down to 1 IO at a time.”…””}”(hjo=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjk=ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjh=h²hh³hÃh´NubjÃ)”}”(hXœArtificial delay induction. There are certain types of IO that cannot be throttled without possibly adversely affecting higher priority groups. This includes swapping and metadata IO. These types of IO are allowed to occur normally, however they are "charged" to the originating group. If the originating group is being throttled you will see the use_delay and delay_nsec fields in io.stat increase. The delay_nsec value is how many nanoseconds that are being added to any process that runs in this group. Because this number can grow quite large if there is a lot of swapping or metadata IO occurring we limit the individual delay events to 1 second at a time. ”h]”hú)”}”(hX›Artificial delay induction. There are certain types of IO that cannot be throttled without possibly adversely affecting higher priority groups. This includes swapping and metadata IO. These types of IO are allowed to occur normally, however they are "charged" to the originating group. If the originating group is being throttled you will see the use_delay and delay_nsec fields in io.stat increase. The delay_nsec value is how many nanoseconds that are being added to any process that runs in this group. Because this number can grow quite large if there is a lot of swapping or metadata IO occurring we limit the individual delay events to 1 second at a time.”h]”hXŸArtificial delay induction. There are certain types of IO that cannot be throttled without possibly adversely affecting higher priority groups. This includes swapping and metadata IO. These types of IO are allowed to occur normally, however they are â€œchargedâ€ to the originating group. If the originating group is being throttled you will see the use_delay and delay_nsec fields in io.stat increase. The delay_nsec value is how many nanoseconds that are being added to any process that runs in this group. Because this number can grow quite large if there is a lot of swapping or metadata IO occurring we limit the individual delay events to 1 second at a time.”…””}”(hj‡=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjƒ=ubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjh=h²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M hjI=h²hubhú)”}”(hŒíOnce the victimized group starts meeting its latency target again it will start unthrottling any peer groups that were throttled previously. If the victimized group simply stops doing IO the global counter will unthrottle appropriately.”h]”hŒíOnce the victimized group starts meeting its latency target again it will start unthrottling any peer groups that were throttled previously. If the victimized group simply stops doing IO the global counter will unthrottle appropriately.”…””}”(hj¡=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjI=h²hubeh}”(h]”Œhow-io-latency-throttling-works”ah ]”h"]”Œhow io latency throttling works”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´MÿubhÅ)”}”(hhh]”(hÊ)”}”(hŒIO Latency Interface Files”h]”hŒIO Latency Interface Files”…””}”(hjº=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj·=h²hh³hÃh´M ubjÀ)”}”(hXòio.latency This takes a similar format as the other controllers. "MAJOR:MINOR target=" io.stat If the controller is enabled you will see extra stats in io.stat in addition to the normal ones. These debug stats are only emitted when the blkcg_debug_stats module parameter is enabled (it is disabled by default). The reported latency fields depend on the device. Rotational devices report avg_lat and win; non-rotational devices report missed and total instead. missed and total are live counters for the current window and may change between reads. depth This is the current queue depth for the group. avg_lat (Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value. win (Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window. missed (Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total. total (Non-rotational devices only.) The total number of IOs accounted in the current window. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ}io.latency This takes a similar format as the other controllers. "MAJOR:MINOR target=" ”h]”(jÑ)”}”(hŒ io.latency”h]”hŒ io.latency”…””}”(hjÓ=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M hjÏ=ubjá)”}”(hhh]”(hú)”}”(hŒ5This takes a similar format as the other controllers.”h]”hŒ5This takes a similar format as the other controllers.”…””}”(hjä=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjá=ubjÀ)”}”(hŒ3"MAJOR:MINOR target=" ”h]”hú)”}”(hŒ2"MAJOR:MINOR target="”h]”hŒ6â€œMAJOR:MINOR target=â€”…””}”(hjö=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjò=ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M hjá=ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÏ=ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M hjÌ=ubjË)”}”(hXºio.stat If the controller is enabled you will see extra stats in io.stat in addition to the normal ones. These debug stats are only emitted when the blkcg_debug_stats module parameter is enabled (it is disabled by default). The reported latency fields depend on the device. Rotational devices report avg_lat and win; non-rotational devices report missed and total instead. missed and total are live counters for the current window and may change between reads. depth This is the current queue depth for the group. avg_lat (Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value. win (Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window. missed (Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total. total (Non-rotational devices only.) The total number of IOs accounted in the current window. ”h]”(jÑ)”}”(hŒio.stat”h]”hŒio.stat”…””}”(hj>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MC hj>ubjá)”}”(hhh]”(hú)”}”(hŒØIf the controller is enabled you will see extra stats in io.stat in addition to the normal ones. These debug stats are only emitted when the blkcg_debug_stats module parameter is enabled (it is disabled by default).”h]”hŒØIf the controller is enabled you will see extra stats in io.stat in addition to the normal ones. These debug stats are only emitted when the blkcg_debug_stats module parameter is enabled (it is disabled by default).”…””}”(hj+>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M! hj(>ubhú)”}”(hŒîThe reported latency fields depend on the device. Rotational devices report avg_lat and win; non-rotational devices report missed and total instead. missed and total are live counters for the current window and may change between reads.”h]”hŒîThe reported latency fields depend on the device. Rotational devices report avg_lat and win; non-rotational devices report missed and total instead. missed and total are live counters for the current window and may change between reads.”…””}”(hj9>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M& hj(>ubjÀ)”}”(hX¾depth This is the current queue depth for the group. avg_lat (Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value. win (Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window. missed (Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total. total (Non-rotational devices only.) The total number of IOs accounted in the current window. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ5depth This is the current queue depth for the group. ”h]”(jÑ)”}”(hŒdepth”h]”hŒdepth”…””}”(hjR>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M, hjN>ubjá)”}”(hhh]”hú)”}”(hŒ.This is the current queue depth for the group.”h]”hŒ.This is the current queue depth for the group.”…””}”(hjc>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M, hj`>ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjN>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M, hjK>ubjË)”}”(hXavg_lat (Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value. ”h]”(jÑ)”}”(hŒavg_lat”h]”hŒavg_lat”…””}”(hj>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M3 hj}>ubjá)”}”(hhh]”hú)”}”(hX(Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value.”h]”hX(Rotational devices only.) This is an exponential moving average with a decay rate of 1/exp bound by the sampling interval. The decay rate interval can be calculated by multiplying the win value in io.stat by the corresponding number of samples based on the win value.”…””}”(hj’>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M/ hj>ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj}>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M3 hjK>ubjË)”}”(hŒßwin (Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window. ”h]”(jÑ)”}”(hŒwin”h]”hŒwin”…””}”(hj°>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M9 hj¬>ubjá)”}”(hhh]”hú)”}”(hŒÚ(Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window.”h]”hŒÚ(Rotational devices only.) The sampling window size in milliseconds. This is the minimum duration of time between evaluation events. Windows only elapse with IO activity. Idle periods extend the most recent window.”…””}”(hjÁ>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M6 hj¾>ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj¬>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M9 hjK>ubjË)”}”(hŒÐmissed (Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total. ”h]”(jÑ)”}”(hŒmissed”h]”hŒmissed”…””}”(hjß>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M? hjÛ>ubjá)”}”(hhh]”hú)”}”(hŒÈ(Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total.”h]”hŒÈ(Non-rotational devices only.) The number of IOs in the current window whose latency exceeded the target. A group is considered to be missing its target once missed reaches a certain ratio of total.”…””}”(hjð>h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M< hjí>ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÛ>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M? hjK>ubjË)”}”(hŒ_total (Non-rotational devices only.) The total number of IOs accounted in the current window. ”h]”(jÑ)”}”(hŒtotal”h]”hŒtotal”…””}”(hj?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MC hj ?ubjá)”}”(hhh]”hú)”}”(hŒX(Non-rotational devices only.) The total number of IOs accounted in the current window.”h]”hŒX(Non-rotational devices only.) The total number of IOs accounted in the current window.”…””}”(hj?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MB hj?ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj ?ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MC hjK>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjG>ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M+ hj(>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj>ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MC hjÌ=ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjÈ=ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M hj·=h²hubeh}”(h]”Œio-latency-interface-files”ah ]”h"]”Œio latency interface files”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´M ubhÅ)”}”(hhh]”(hÊ)”}”(hŒIO Priority”h]”hŒIO Priority”…””}”(hjh?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhje?h²hh³hÃh´MF ubhú)”}”(hŒ¥A single attribute controls the behavior of the I/O priority cgroup policy, namely the io.prio.class attribute. The following values are accepted for that attribute:”h]”hŒ¥A single attribute controls the behavior of the I/O priority cgroup policy, namely the io.prio.class attribute. The following values are accepted for that attribute:”…””}”(hjv?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MH hje?h²hubjÀ)”}”(hXàno-change Do not modify the I/O priority class. promote-to-rt For requests that have a non-RT I/O priority class, change it into RT. Also change the priority level of these requests to 4. Do not modify the I/O priority of requests that have priority class RT. restrict-to-be For requests that do not have an I/O priority class or that have I/O priority class RT, change it into BE. Also change the priority level of these requests to 0. Do not modify the I/O priority class of requests that have priority class IDLE. idle Change the I/O priority class of all requests into IDLE, the lowest I/O priority class. none-to-rt Deprecated. Just an alias for promote-to-rt. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ0no-change Do not modify the I/O priority class. ”h]”(jÑ)”}”(hŒ no-change”h]”hŒ no-change”…””}”(hj?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MM hj‹?ubjá)”}”(hhh]”hú)”}”(hŒ%Do not modify the I/O priority class.”h]”hŒ%Do not modify the I/O priority class.”…””}”(hj ?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MM hj?ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj‹?ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MM hjˆ?ubjË)”}”(hŒÔpromote-to-rt For requests that have a non-RT I/O priority class, change it into RT. Also change the priority level of these requests to 4. Do not modify the I/O priority of requests that have priority class RT. ”h]”(jÑ)”}”(hŒ promote-to-rt”h]”hŒ promote-to-rt”…””}”(hj¾?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MR hjº?ubjá)”}”(hhh]”hú)”}”(hŒÅFor requests that have a non-RT I/O priority class, change it into RT. Also change the priority level of these requests to 4. Do not modify the I/O priority of requests that have priority class RT.”h]”hŒÅFor requests that have a non-RT I/O priority class, change it into RT. Also change the priority level of these requests to 4. Do not modify the I/O priority of requests that have priority class RT.”…””}”(hjÏ?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MP hjÌ?ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjº?ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MR hjˆ?ubjË)”}”(hXrestrict-to-be For requests that do not have an I/O priority class or that have I/O priority class RT, change it into BE. Also change the priority level of these requests to 0. Do not modify the I/O priority class of requests that have priority class IDLE. ”h]”(jÑ)”}”(hŒrestrict-to-be”h]”hŒrestrict-to-be”…””}”(hjí?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MX hjé?ubjá)”}”(hhh]”hú)”}”(hŒñFor requests that do not have an I/O priority class or that have I/O priority class RT, change it into BE. Also change the priority level of these requests to 0. Do not modify the I/O priority class of requests that have priority class IDLE.”h]”hŒñFor requests that do not have an I/O priority class or that have I/O priority class RT, change it into BE. Also change the priority level of these requests to 0. Do not modify the I/O priority class of requests that have priority class IDLE.”…””}”(hjþ?h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MU hjû?ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjé?ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MX hjˆ?ubjË)”}”(hŒ]idle Change the I/O priority class of all requests into IDLE, the lowest I/O priority class. ”h]”(jÑ)”}”(hŒidle”h]”hŒidle”…””}”(hj@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M\ hj@ubjá)”}”(hhh]”hú)”}”(hŒWChange the I/O priority class of all requests into IDLE, the lowest I/O priority class.”h]”hŒWChange the I/O priority class of all requests into IDLE, the lowest I/O priority class.”…””}”(hj-@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M[ hj*@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj@ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M\ hjˆ?ubjË)”}”(hŒ8none-to-rt Deprecated. Just an alias for promote-to-rt. ”h]”(jÑ)”}”(hŒ none-to-rt”h]”hŒ none-to-rt”…””}”(hjK@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M_ hjG@ubjá)”}”(hhh]”hú)”}”(hŒ,Deprecated. Just an alias for promote-to-rt.”h]”hŒ,Deprecated. Just an alias for promote-to-rt.”…””}”(hj\@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M_ hjY@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjG@ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M_ hjˆ?ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj„?ubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´ML hje?h²hubhú)”}”(hŒMThe following numerical values are associated with the I/O priority policies:”h]”hŒMThe following numerical values are associated with the I/O priority policies:”…””}”(hj‚@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Ma hje?h²hubj)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hj“@ubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hj“@ubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ no-change”h]”hŒ no-change”…””}”(hj³@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Md hj°@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj@ubjH)”}”(hhh]”hú)”}”(hŒ0”h]”hŒ0”…””}”(hjÊ@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Md hjÇ@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj@ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjª@ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ promote-to-rt”h]”hŒ promote-to-rt”…””}”(hjê@h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mf hjç@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjä@ubjH)”}”(hhh]”hú)”}”(hŒ1”h]”hŒ1”…””}”(hjAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mf hjþ@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjä@ubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjª@ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒrestrict-to-be”h]”hŒrestrict-to-be”…””}”(hj!Ah²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mh hjAubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjAubjH)”}”(hhh]”hú)”}”(hŒ2”h]”hŒ2”…””}”(hj8Ah²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mh hj5Aubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjAubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjª@ubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒidle”h]”hŒidle”…””}”(hjXAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mj hjUAubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjRAubjH)”}”(hhh]”hú)”}”(hŒ3”h]”hŒ3”…””}”(hjoAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mj hjlAubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjRAubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjª@ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hj“@ubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hj@ubah}”(h]”h ]”h"]”h$]”h&]”uh1jhje?h²hh³hÃh´Nubhú)”}”(hŒNThe numerical value that corresponds to each I/O priority class is as follows:”h]”hŒNThe numerical value that corresponds to each I/O priority class is as follows:”…””}”(hjœAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mm hje?h²hubj)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjAubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjAubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒIOPRIO_CLASS_NONE”h]”hŒIOPRIO_CLASS_NONE”…””}”(hjÍAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mp hjÊAubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÇAubjH)”}”(hhh]”hú)”}”(hjÌ@h]”hŒ0”…””}”(hjäAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mp hjáAubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÇAubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjÄAubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒIOPRIO_CLASS_RT (real-time)”h]”hŒIOPRIO_CLASS_RT (real-time)”…””}”(hjBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mr hjBubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjýAubjH)”}”(hhh]”hú)”}”(hjAh]”hŒ1”…””}”(hjBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mr hjBubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjýAubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjÄAubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒIOPRIO_CLASS_BE (best effort)”h]”hŒIOPRIO_CLASS_BE (best effort)”…””}”(hj9Bh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mt hj6Bubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj3BubjH)”}”(hhh]”hú)”}”(hj:Ah]”hŒ2”…””}”(hjPBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mt hjMBubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj3Bubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjÄAubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒIOPRIO_CLASS_IDLE”h]”hŒIOPRIO_CLASS_IDLE”…””}”(hjoBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mv hjlBubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjiBubjH)”}”(hhh]”hú)”}”(hjqAh]”hŒ3”…””}”(hj†Bh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mv hjƒBubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjiBubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjÄAubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjAubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjªAubah}”(h]”h ]”h"]”h$]”h&]”uh1jhje?h²hh³hÃh´Nubhú)”}”(hŒHThe algorithm to set the I/O priority class for a request is as follows:”h]”hŒHThe algorithm to set the I/O priority class for a request is as follows:”…””}”(hj²Bh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´My hje?h²hubj¾)”}”(hhh]”(jÃ)”}”(hŒ—If I/O priority class policy is promote-to-rt, change the request I/O priority class to IOPRIO_CLASS_RT and change the request I/O priority level to 4.”h]”hú)”}”(hŒ—If I/O priority class policy is promote-to-rt, change the request I/O priority class to IOPRIO_CLASS_RT and change the request I/O priority level to 4.”h]”hŒ—If I/O priority class policy is promote-to-rt, change the request I/O priority class to IOPRIO_CLASS_RT and change the request I/O priority level to 4.”…””}”(hjÇBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M{ hjÃBubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÀBh²hh³hÃh´NubjÃ)”}”(hŒôIf I/O priority class policy is not promote-to-rt, translate the I/O priority class policy into a number, then change the request I/O priority class into the maximum of the I/O priority class policy number and the numerical I/O priority class. ”h]”hú)”}”(hŒóIf I/O priority class policy is not promote-to-rt, translate the I/O priority class policy into a number, then change the request I/O priority class into the maximum of the I/O priority class policy number and the numerical I/O priority class.”h]”hŒóIf I/O priority class policy is not promote-to-rt, translate the I/O priority class policy into a number, then change the request I/O priority class into the maximum of the I/O priority class policy number and the numerical I/O priority class.”…””}”(hjßBh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M~ hjÛBubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjÀBh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´M{ hje?h²hubeh}”(h]”Œio-priority”ah ]”h"]”Œio priority”ah$]”h&]”uh1hÄhj°2h²hh³hÃh´MF ubeh}”(h]”Œio”ah ]”h"]”Œio”ah$]”h&]”uh1hÄhjsh²hh³hÃh´MÚubhÅ)”}”(hhh]”(hÊ)”}”(hŒPID”h]”hŒPID”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj Ch²hh³hÃh´M„ ubhú)”}”(hŒ’The process number controller is used to allow a cgroup to stop any new tasks from being fork()'d or clone()'d after a specified limit is reached.”h]”hŒ–The process number controller is used to allow a cgroup to stop any new tasks from being fork()â€™d or clone()â€™d after a specified limit is reached.”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M† hj Ch²hubhú)”}”(hŒëThe number of tasks in a cgroup can be exhausted in ways which other controllers cannot prevent, thus warranting its own controller. For example, a fork bomb is likely to exhaust the number of tasks before hitting memory restrictions.”h]”hŒëThe number of tasks in a cgroup can be exhausted in ways which other controllers cannot prevent, thus warranting its own controller. For example, a fork bomb is likely to exhaust the number of tasks before hitting memory restrictions.”…””}”(hj(Ch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŠ hj Ch²hubhú)”}”(hŒXNote that PIDs used in this controller refer to TIDs, process IDs as used by the kernel.”h]”hŒXNote that PIDs used in this controller refer to TIDs, process IDs as used by the kernel.”…””}”(hj6Ch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj Ch²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒPID Interface Files”h]”hŒPID Interface Files”…””}”(hjGCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjDCh²hh³hÃh´M” ubjÀ)”}”(hXDpids.max A read-write single value file which exists on non-root cgroups. The default is "max". Hard limit of number of processes. pids.current A read-only single value file which exists on non-root cgroups. The number of processes currently in the cgroup and its descendants. pids.peak A read-only single value file which exists on non-root cgroups. The maximum value that the number of processes in the cgroup and its descendants has ever reached. pids.events A read-only flat-keyed file which exists on non-root cgroups. Unless specified otherwise, a value change in this file generates a file modified event. The following entries are defined. max The number of times the cgroup's total number of processes hit the pids.max limit (see also pids_localevents). pids.events.local Similar to pids.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ…pids.max A read-write single value file which exists on non-root cgroups. The default is "max". Hard limit of number of processes. ”h]”(jÑ)”}”(hŒpids.max”h]”hŒpids.max”…””}”(hj`Ch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mš hj\Cubjá)”}”(hhh]”(hú)”}”(hŒWA read-write single value file which exists on non-root cgroups. The default is "max".”h]”hŒ[A read-write single value file which exists on non-root cgroups. The default is â€œmaxâ€.”…””}”(hjqCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M— hjnCubhú)”}”(hŒ"Hard limit of number of processes.”h]”hŒ"Hard limit of number of processes.”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mš hjnCubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj\Cubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mš hjYCubjË)”}”(hŒ“pids.current A read-only single value file which exists on non-root cgroups. The number of processes currently in the cgroup and its descendants. ”h]”(jÑ)”}”(hŒpids.current”h]”hŒpids.current”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M hj™Cubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only single value file which exists on non-root cgroups.”h]”hŒ?A read-only single value file which exists on non-root cgroups.”…””}”(hj®Ch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj«Cubhú)”}”(hŒDThe number of processes currently in the cgroup and its descendants.”h]”hŒDThe number of processes currently in the cgroup and its descendants.”…””}”(hj¼Ch²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŸ hj«Cubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj™Cubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M hjYCubjË)”}”(hŒ®pids.peak A read-only single value file which exists on non-root cgroups. The maximum value that the number of processes in the cgroup and its descendants has ever reached. ”h]”(jÑ)”}”(hŒ pids.peak”h]”hŒ pids.peak”…””}”(hjÚCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¦ hjÖCubjá)”}”(hhh]”(hú)”}”(hŒ?A read-only single value file which exists on non-root cgroups.”h]”hŒ?A read-only single value file which exists on non-root cgroups.”…””}”(hjëCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M£ hjèCubhú)”}”(hŒbThe maximum value that the number of processes in the cgroup and its descendants has ever reached.”h]”hŒbThe maximum value that the number of processes in the cgroup and its descendants has ever reached.”…””}”(hjùCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¥ hjèCubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÖCubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¦ hjYCubjË)”}”(hXLpids.events A read-only flat-keyed file which exists on non-root cgroups. Unless specified otherwise, a value change in this file generates a file modified event. The following entries are defined. max The number of times the cgroup's total number of processes hit the pids.max limit (see also pids_localevents). ”h]”(jÑ)”}”(hŒpids.events”h]”hŒpids.events”…””}”(hjDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¯ hjDubjá)”}”(hhh]”(hú)”}”(hŒ¹A read-only flat-keyed file which exists on non-root cgroups. Unless specified otherwise, a value change in this file generates a file modified event. The following entries are defined.”h]”hŒ¹A read-only flat-keyed file which exists on non-root cgroups. Unless specified otherwise, a value change in this file generates a file modified event. The following entries are defined.”…””}”(hj(Dh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M© hj%DubjÀ)”}”(hŒmax The number of times the cgroup's total number of processes hit the pids.max limit (see also pids_localevents). ”h]”jÆ)”}”(hhh]”jË)”}”(hŒsmax The number of times the cgroup's total number of processes hit the pids.max limit (see also pids_localevents). ”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hjADh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¯ hj=Dubjá)”}”(hhh]”hú)”}”(hŒnThe number of times the cgroup's total number of processes hit the pids.max limit (see also pids_localevents).”h]”hŒpThe number of times the cgroupâ€™s total number of processes hit the pids.max limit (see also pids_localevents).”…””}”(hjRDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M® hjODubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj=Dubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¯ hj:Dubah}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj6Dubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M hj%Dubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjDubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¯ hjYCubjË)”}”(hŒÂpids.events.local Similar to pids.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”(jÑ)”}”(hŒpids.events.local”h]”hŒpids.events.local”…””}”(hjˆDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M´ hj„Dubjá)”}”(hhh]”hú)”}”(hŒ¯Similar to pids.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”h]”hŒ¯Similar to pids.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”…””}”(hj™Dh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M² hj–Dubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj„Dubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M´ hjYCubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjUCubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M– hjDCh²hubhú)”}”(hXÙOrganisational operations are not blocked by cgroup policies, so it is possible to have pids.current > pids.max. This can be done by either setting the limit to be smaller than pids.current, or attaching enough processes to the cgroup such that pids.current is larger than pids.max. However, it is not possible to violate a cgroup PID policy through fork() or clone(). These will return -EAGAIN if the creation of a new process would cause a cgroup policy to be violated.”h]”hXÙOrganisational operations are not blocked by cgroup policies, so it is possible to have pids.current > pids.max. This can be done by either setting the limit to be smaller than pids.current, or attaching enough processes to the cgroup such that pids.current is larger than pids.max. However, it is not possible to violate a cgroup PID policy through fork() or clone(). These will return -EAGAIN if the creation of a new process would cause a cgroup policy to be violated.”…””}”(hj¿Dh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¶ hjDCh²hubeh}”(h]”Œpid-interface-files”ah ]”h"]”Œpid interface files”ah$]”h&]”uh1hÄhj Ch²hh³hÃh´M” ubeh}”(h]”Œpid”ah ]”h"]”Œpid”ah$]”h&]”uh1hÄhjsh²hh³hÃh´M„ ubhÅ)”}”(hhh]”(hÊ)”}”(hŒCpuset”h]”hŒCpuset”…””}”(hjàDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÝDh²hh³hÃh´MÀ ubhú)”}”(hX¶The "cpuset" controller provides a mechanism for constraining the CPU and memory node placement of tasks to only the resources specified in the cpuset interface files in a task's current cgroup. This is especially valuable on large NUMA systems where placing jobs on properly sized subsets of the systems with careful processor and memory placement to reduce cross-node memory access and contention can improve overall system performance.”h]”hX¼The â€œcpusetâ€ controller provides a mechanism for constraining the CPU and memory node placement of tasks to only the resources specified in the cpuset interface files in a taskâ€™s current cgroup. This is especially valuable on large NUMA systems where placing jobs on properly sized subsets of the systems with careful processor and memory placement to reduce cross-node memory access and contention can improve overall system performance.”…””}”(hjîDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÂ hjÝDh²hubhú)”}”(hŒ~The "cpuset" controller is hierarchical. That means the controller cannot use CPUs or memory nodes not allowed in its parent.”h]”hŒ‚The â€œcpusetâ€ controller is hierarchical. That means the controller cannot use CPUs or memory nodes not allowed in its parent.”…””}”(hjüDh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÊ hjÝDh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒCpuset Interface Files”h]”hŒCpuset Interface Files”…””}”(hj Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj Eh²hh³hÃh´MÏ ubjÀ)”}”(hX’1cpuset.cpus A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists the requested CPUs to be used by tasks within this cgroup. The actual list of CPUs to be granted, however, is subjected to constraints imposed by its parent and can differ from the requested CPUs. The CPU numbers are comma-separated numbers or ranges. For example:: # cat cpuset.cpus 0-4,6,8-10 An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.cpus" or all the available CPUs if none is found. The value of "cpuset.cpus" stays constant until the next update and won't be affected by any CPU hotplug events. cpuset.cpus.effective A read-only multiple values file which exists on all cpuset-enabled cgroups. It lists the onlined CPUs that are actually granted to this cgroup by its parent. These CPUs are allowed to be used by tasks within the current cgroup. If "cpuset.cpus" is empty, the "cpuset.cpus.effective" file shows all the CPUs from the parent cgroup that can be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.cpus" unless none of the CPUs listed in "cpuset.cpus" can be granted. In this case, it will be treated just like an empty "cpuset.cpus". Its value will be affected by CPU hotplug events. cpuset.mems A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists the requested memory nodes to be used by tasks within this cgroup. The actual list of memory nodes granted, however, is subjected to constraints imposed by its parent and can differ from the requested memory nodes. The memory node numbers are comma-separated numbers or ranges. For example:: # cat cpuset.mems 0-1,3 An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.mems" or all the available memory nodes if none is found. The value of "cpuset.mems" stays constant until the next update and won't be affected by any memory nodes hotplug events. Setting a non-empty value to "cpuset.mems" causes memory of tasks within the cgroup to be migrated to the designated nodes if they are currently using memory outside of the designated nodes. There is a cost for this memory migration. The migration may not be complete and some memory pages may be left behind. So it is recommended that "cpuset.mems" should be set properly before spawning new tasks into the cpuset. Even if there is a need to change "cpuset.mems" with active tasks, it shouldn't be done frequently. For a multithreaded process, the threadgroup leader is considered the owner of the group's memory. Memory policy rebinding and migration will only happen with respect to the threadgroup leader. To avoid unexpected results, non-leading threads shouldn't be put into another cgroup whose "cpuset.mems" doesn't fully overlap that of the threadgroup leader. cpuset.mems.effective A read-only multiple values file which exists on all cpuset-enabled cgroups. It lists the onlined memory nodes that are actually granted to this cgroup by its parent. These memory nodes are allowed to be used by tasks within the current cgroup. If "cpuset.mems" is empty, it shows all the memory nodes from the parent cgroup that will be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.mems" unless none of the memory nodes listed in "cpuset.mems" can be granted. In this case, it will be treated just like an empty "cpuset.mems". Its value will be affected by memory nodes hotplug events. cpuset.cpus.exclusive A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists all the exclusive CPUs that are allowed to be used to create a new cpuset partition. Its value is not used unless the cgroup becomes a valid partition root. See the "cpuset.cpus.partition" section below for a description of what a cpuset partition is. When the cgroup becomes a partition root, the actual exclusive CPUs that are allocated to that partition are listed in "cpuset.cpus.exclusive.effective" which may be different from "cpuset.cpus.exclusive". If "cpuset.cpus.exclusive" has previously been set, "cpuset.cpus.exclusive.effective" is always a subset of it. Users can manually set it to a value that is different from "cpuset.cpus". One constraint in setting it is that the list of CPUs must be exclusive with respect to "cpuset.cpus.exclusive" and "cpuset.cpus.exclusive.effective" of its siblings. Another constraint is that it cannot be a superset of "cpuset.cpus" of its sibling in order to leave at least one CPU available to that sibling when the exclusive CPUs are taken away. For a parent cgroup, any one of its exclusive CPUs can only be distributed to at most one of its child cgroups. Having an exclusive CPU appearing in two or more of its child cgroups is not allowed (the exclusivity rule). A value that violates the exclusivity rule will be rejected with a write error. The root cgroup is a partition root and all its available CPUs are in its exclusive CPU set. cpuset.cpus.exclusive.effective A read-only multiple values file which exists on all non-root cpuset-enabled cgroups. This file shows the effective set of exclusive CPUs that can be used to create a partition root. The content of this file will always be a subset of its parent's "cpuset.cpus.exclusive.effective" if its parent is not the root cgroup. It will also be a subset of "cpuset.cpus.exclusive" if it is set. This file should only be non-empty if either "cpuset.cpus.exclusive" is set or when the current cpuset is a valid partition root. cpuset.cpus.isolated A read-only and root cgroup only multiple values file. This file shows the set of all isolated CPUs used in existing isolated partitions. It will be empty if no isolated partition is created. cpuset.cpus.partition A read-write single value file which exists on non-root cpuset-enabled cgroups. This flag is owned by the parent cgroup and is not delegatable. It accepts only the following input values when written to. ========== ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing ========== ===================================== A cpuset partition is a collection of cpuset-enabled cgroups with a partition root at the top of the hierarchy and its descendants except those that are separate partition roots themselves and their descendants. A partition has exclusive access to the set of exclusive CPUs allocated to it. Other cgroups outside of that partition cannot use any CPUs in that set. There are two types of partitions - local and remote. A local partition is one whose parent cgroup is also a valid partition root. A remote partition is one whose parent cgroup is not a valid partition root itself. Writing to "cpuset.cpus.exclusive" is optional for the creation of a local partition as its "cpuset.cpus.exclusive" file will assume an implicit value that is the same as "cpuset.cpus" if it is not set. Writing the proper "cpuset.cpus.exclusive" values down the cgroup hierarchy before the target partition root is mandatory for the creation of a remote partition. Not all the CPUs requested in "cpuset.cpus.exclusive" can be used to form a new partition. Only those that were present in its parent's "cpuset.cpus.exclusive.effective" control file can be used. For partitions created without setting "cpuset.cpus.exclusive", exclusive CPUs specified in sibling's "cpuset.cpus.exclusive" or "cpuset.cpus.exclusive.effective" also cannot be used. Currently, a remote partition cannot be created under a local partition. All the ancestors of a remote partition root except the root cgroup cannot be a partition root. The root cgroup is always a partition root and its state cannot be changed. All other non-root cgroups start out as "member". Even though the "cpuset.cpus.exclusive*" and "cpuset.cpus" control files are not present in the root cgroup, they are implicitly the same as the "/sys/devices/system/cpu/possible" sysfs file. When set to "root", the current cgroup is the root of a new partition or scheduling domain. The set of exclusive CPUs is determined by the value of its "cpuset.cpus.exclusive.effective". When set to "isolated", the CPUs in that partition will be in an isolated state without any load balancing from the scheduler and excluded from the unbound workqueues. Tasks placed in such a partition with multiple CPUs should be carefully distributed and bound to each of the individual CPUs for optimal performance. A partition root ("root" or "isolated") can be in one of the two possible states - valid or invalid. An invalid partition root is in a degraded state where some state information may be retained, but behaves more like a "member". All possible state transitions among "member", "root" and "isolated" are allowed. On read, the "cpuset.cpus.partition" file can show the following values. ============================= ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing "root invalid ()" Invalid partition root "isolated invalid ()" Invalid isolated partition root ============================= ===================================== In the case of an invalid partition root, a descriptive string on why the partition is invalid is included within parentheses. For a local partition root to be valid, the following conditions must be met. 1) The parent cgroup is a valid partition root. 2) The "cpuset.cpus.exclusive.effective" file cannot be empty, though it may contain offline CPUs. 3) The "cpuset.cpus.effective" cannot be empty unless there is no task associated with this partition. For a remote partition root to be valid, all the above conditions except the first one must be met. External events like hotplug or changes to "cpuset.cpus" or "cpuset.cpus.exclusive" can cause a valid partition root to become invalid and vice versa. Note that a task cannot be moved to a cgroup with empty "cpuset.cpus.effective". A valid non-root parent partition may distribute out all its CPUs to its child local partitions when there is no task associated with it. Care must be taken to change a valid partition root to "member" as all its child local partitions, if present, will become invalid causing disruption to tasks running in those child partitions. These inactivated partitions could be recovered if their parent is switched back to a partition root with a proper value in "cpuset.cpus" or "cpuset.cpus.exclusive". Poll and inotify events are triggered whenever the state of "cpuset.cpus.partition" changes. That includes changes caused by write to "cpuset.cpus.partition", cpu hotplug or other changes that modify the validity status of the partition. This will allow user space agents to monitor unexpected changes to "cpuset.cpus.partition" without the need to do continuous polling. A user can pre-configure certain CPUs to an isolated state with load balancing disabled at boot time with the "isolcpus" kernel boot command line option. If those CPUs are to be put into a partition, they have to be used in an isolated partition. ”h]”jÆ)”}”(hhh]”(jË)”}”(hX·cpuset.cpus A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists the requested CPUs to be used by tasks within this cgroup. The actual list of CPUs to be granted, however, is subjected to constraints imposed by its parent and can differ from the requested CPUs. The CPU numbers are comma-separated numbers or ranges. For example:: # cat cpuset.cpus 0-4,6,8-10 An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.cpus" or all the available CPUs if none is found. The value of "cpuset.cpus" stays constant until the next update and won't be affected by any CPU hotplug events. ”h]”(jÑ)”}”(hŒcpuset.cpus”h]”hŒcpuset.cpus”…””}”(hj&Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Må hj"Eubjá)”}”(hhh]”(hú)”}”(hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”h]”hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”…””}”(hj7Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÒ hj4Eubhú)”}”(hŒÎIt lists the requested CPUs to be used by tasks within this cgroup. The actual list of CPUs to be granted, however, is subjected to constraints imposed by its parent and can differ from the requested CPUs.”h]”hŒÎIt lists the requested CPUs to be used by tasks within this cgroup. The actual list of CPUs to be granted, however, is subjected to constraints imposed by its parent and can differ from the requested CPUs.”…””}”(hjEEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÕ hj4Eubhú)”}”(hŒDThe CPU numbers are comma-separated numbers or ranges. For example::”h]”hŒCThe CPU numbers are comma-separated numbers or ranges. For example:”…””}”(hjSEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÚ hj4Eubjj)”}”(hŒ# cat cpuset.cpus 0-4,6,8-10”h]”hŒ# cat cpuset.cpus 0-4,6,8-10”…””}”hjaEsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÝ hj4Eubhú)”}”(hŒ¬An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.cpus" or all the available CPUs if none is found.”h]”hŒ°An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty â€œcpuset.cpusâ€ or all the available CPUs if none is found.”…””}”(hjoEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mà hj4Eubhú)”}”(hŒpThe value of "cpuset.cpus" stays constant until the next update and won't be affected by any CPU hotplug events.”h]”hŒvThe value of â€œcpuset.cpusâ€ stays constant until the next update and wonâ€™t be affected by any CPU hotplug events.”…””}”(hj}Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mä hj4Eubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj"Eubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Må hjEubjË)”}”(hXcpuset.cpus.effective A read-only multiple values file which exists on all cpuset-enabled cgroups. It lists the onlined CPUs that are actually granted to this cgroup by its parent. These CPUs are allowed to be used by tasks within the current cgroup. If "cpuset.cpus" is empty, the "cpuset.cpus.effective" file shows all the CPUs from the parent cgroup that can be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.cpus" unless none of the CPUs listed in "cpuset.cpus" can be granted. In this case, it will be treated just like an empty "cpuset.cpus". Its value will be affected by CPU hotplug events. ”h]”(jÑ)”}”(hŒcpuset.cpus.effective”h]”hŒcpuset.cpus.effective”…””}”(hj›Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mö hj—Eubjá)”}”(hhh]”(hú)”}”(hŒLA read-only multiple values file which exists on all cpuset-enabled cgroups.”h]”hŒLA read-only multiple values file which exists on all cpuset-enabled cgroups.”…””}”(hj¬Eh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mè hj©Eubhú)”}”(hŒ˜It lists the onlined CPUs that are actually granted to this cgroup by its parent. These CPUs are allowed to be used by tasks within the current cgroup.”h]”hŒ˜It lists the onlined CPUs that are actually granted to this cgroup by its parent. These CPUs are allowed to be used by tasks within the current cgroup.”…””}”(hjºEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Më hj©Eubhú)”}”(hXMIf "cpuset.cpus" is empty, the "cpuset.cpus.effective" file shows all the CPUs from the parent cgroup that can be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.cpus" unless none of the CPUs listed in "cpuset.cpus" can be granted. In this case, it will be treated just like an empty "cpuset.cpus".”h]”hXaIf â€œcpuset.cpusâ€ is empty, the â€œcpuset.cpus.effectiveâ€ file shows all the CPUs from the parent cgroup that can be available to be used by this cgroup. Otherwise, it should be a subset of â€œcpuset.cpusâ€ unless none of the CPUs listed in â€œcpuset.cpusâ€ can be granted. In this case, it will be treated just like an empty â€œcpuset.cpusâ€.”…””}”(hjÈEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mï hj©Eubhú)”}”(hŒ1Its value will be affected by CPU hotplug events.”h]”hŒ1Its value will be affected by CPU hotplug events.”…””}”(hjÖEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mö hj©Eubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj—Eubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mö hjEubjË)”}”(hXHcpuset.mems A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists the requested memory nodes to be used by tasks within this cgroup. The actual list of memory nodes granted, however, is subjected to constraints imposed by its parent and can differ from the requested memory nodes. The memory node numbers are comma-separated numbers or ranges. For example:: # cat cpuset.mems 0-1,3 An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.mems" or all the available memory nodes if none is found. The value of "cpuset.mems" stays constant until the next update and won't be affected by any memory nodes hotplug events. Setting a non-empty value to "cpuset.mems" causes memory of tasks within the cgroup to be migrated to the designated nodes if they are currently using memory outside of the designated nodes. There is a cost for this memory migration. The migration may not be complete and some memory pages may be left behind. So it is recommended that "cpuset.mems" should be set properly before spawning new tasks into the cpuset. Even if there is a need to change "cpuset.mems" with active tasks, it shouldn't be done frequently. For a multithreaded process, the threadgroup leader is considered the owner of the group's memory. Memory policy rebinding and migration will only happen with respect to the threadgroup leader. To avoid unexpected results, non-leading threads shouldn't be put into another cgroup whose "cpuset.mems" doesn't fully overlap that of the threadgroup leader. ”h]”(jÑ)”}”(hŒcpuset.mems”h]”hŒcpuset.mems”…””}”(hjôEh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M hjðEubjá)”}”(hhh]”(hú)”}”(hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”h]”hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”…””}”(hjFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mù hjFubhú)”}”(hŒàIt lists the requested memory nodes to be used by tasks within this cgroup. The actual list of memory nodes granted, however, is subjected to constraints imposed by its parent and can differ from the requested memory nodes.”h]”hŒàIt lists the requested memory nodes to be used by tasks within this cgroup. The actual list of memory nodes granted, however, is subjected to constraints imposed by its parent and can differ from the requested memory nodes.”…””}”(hjFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mü hjFubhú)”}”(hŒLThe memory node numbers are comma-separated numbers or ranges. For example::”h]”hŒKThe memory node numbers are comma-separated numbers or ranges. For example:”…””}”(hj!Fh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubjj)”}”(hŒ# cat cpuset.mems 0-1,3”h]”hŒ# cat cpuset.mems 0-1,3”…””}”hj/Fsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M hjFubhú)”}”(hŒ´An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty "cpuset.mems" or all the available memory nodes if none is found.”h]”hŒ¸An empty value indicates that the cgroup is using the same setting as the nearest cgroup ancestor with a non-empty â€œcpuset.memsâ€ or all the available memory nodes if none is found.”…””}”(hj=Fh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubhú)”}”(hŒyThe value of "cpuset.mems" stays constant until the next update and won't be affected by any memory nodes hotplug events.”h]”hŒThe value of â€œcpuset.memsâ€ stays constant until the next update and wonâ€™t be affected by any memory nodes hotplug events.”…””}”(hjKFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubhú)”}”(hŒ¾Setting a non-empty value to "cpuset.mems" causes memory of tasks within the cgroup to be migrated to the designated nodes if they are currently using memory outside of the designated nodes.”h]”hŒÂSetting a non-empty value to â€œcpuset.memsâ€ causes memory of tasks within the cgroup to be migrated to the designated nodes if they are currently using memory outside of the designated nodes.”…””•}”(hjYFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubhú)”}”(hXFThere is a cost for this memory migration. The migration may not be complete and some memory pages may be left behind. So it is recommended that "cpuset.mems" should be set properly before spawning new tasks into the cpuset. Even if there is a need to change "cpuset.mems" with active tasks, it shouldn't be done frequently.”h]”hXPThere is a cost for this memory migration. The migration may not be complete and some memory pages may be left behind. So it is recommended that â€œcpuset.memsâ€ should be set properly before spawning new tasks into the cpuset. Even if there is a need to change â€œcpuset.memsâ€ with active tasks, it shouldnâ€™t be done frequently.”…””}”(hjgFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubhú)”}”(hXaFor a multithreaded process, the threadgroup leader is considered the owner of the group's memory. Memory policy rebinding and migration will only happen with respect to the threadgroup leader. To avoid unexpected results, non-leading threads shouldn't be put into another cgroup whose "cpuset.mems" doesn't fully overlap that of the threadgroup leader.”h]”hXkFor a multithreaded process, the threadgroup leader is considered the owner of the groupâ€™s memory. Memory policy rebinding and migration will only happen with respect to the threadgroup leader. To avoid unexpected results, non-leading threads shouldnâ€™t be put into another cgroup whose â€œcpuset.memsâ€ doesnâ€™t fully overlap that of the threadgroup leader.”…””}”(hjuFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjFubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjðEubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M hjEubjË)”}”(hX‰cpuset.mems.effective A read-only multiple values file which exists on all cpuset-enabled cgroups. It lists the onlined memory nodes that are actually granted to this cgroup by its parent. These memory nodes are allowed to be used by tasks within the current cgroup. If "cpuset.mems" is empty, it shows all the memory nodes from the parent cgroup that will be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.mems" unless none of the memory nodes listed in "cpuset.mems" can be granted. In this case, it will be treated just like an empty "cpuset.mems". Its value will be affected by memory nodes hotplug events. ”h]”(jÑ)”}”(hŒcpuset.mems.effective”h]”hŒcpuset.mems.effective”…””}”(hj“Fh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M/ hjFubjá)”}”(hhh]”(hú)”}”(hŒLA read-only multiple values file which exists on all cpuset-enabled cgroups.”h]”hŒLA read-only multiple values file which exists on all cpuset-enabled cgroups.”…””}”(hj¤Fh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M" hj¡Fubhú)”}”(hŒ§It lists the onlined memory nodes that are actually granted to this cgroup by its parent. These memory nodes are allowed to be used by tasks within the current cgroup.”h]”hŒ§It lists the onlined memory nodes that are actually granted to this cgroup by its parent. These memory nodes are allowed to be used by tasks within the current cgroup.”…””}”(hj²Fh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M% hj¡Fubhú)”}”(hX?If "cpuset.mems" is empty, it shows all the memory nodes from the parent cgroup that will be available to be used by this cgroup. Otherwise, it should be a subset of "cpuset.mems" unless none of the memory nodes listed in "cpuset.mems" can be granted. In this case, it will be treated just like an empty "cpuset.mems".”h]”hXOIf â€œcpuset.memsâ€ is empty, it shows all the memory nodes from the parent cgroup that will be available to be used by this cgroup. Otherwise, it should be a subset of â€œcpuset.memsâ€ unless none of the memory nodes listed in â€œcpuset.memsâ€ can be granted. In this case, it will be treated just like an empty â€œcpuset.memsâ€.”…””}”(hjÀFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M) hj¡Fubhú)”}”(hŒ:Its value will be affected by memory nodes hotplug events.”h]”hŒ:Its value will be affected by memory nodes hotplug events.”…””}”(hjÎFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M/ hj¡Fubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjFubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M/ hjEubjË)”}”(hXìcpuset.cpus.exclusive A read-write multiple values file which exists on non-root cpuset-enabled cgroups. It lists all the exclusive CPUs that are allowed to be used to create a new cpuset partition. Its value is not used unless the cgroup becomes a valid partition root. See the "cpuset.cpus.partition" section below for a description of what a cpuset partition is. When the cgroup becomes a partition root, the actual exclusive CPUs that are allocated to that partition are listed in "cpuset.cpus.exclusive.effective" which may be different from "cpuset.cpus.exclusive". If "cpuset.cpus.exclusive" has previously been set, "cpuset.cpus.exclusive.effective" is always a subset of it. Users can manually set it to a value that is different from "cpuset.cpus". One constraint in setting it is that the list of CPUs must be exclusive with respect to "cpuset.cpus.exclusive" and "cpuset.cpus.exclusive.effective" of its siblings. Another constraint is that it cannot be a superset of "cpuset.cpus" of its sibling in order to leave at least one CPU available to that sibling when the exclusive CPUs are taken away. For a parent cgroup, any one of its exclusive CPUs can only be distributed to at most one of its child cgroups. Having an exclusive CPU appearing in two or more of its child cgroups is not allowed (the exclusivity rule). A value that violates the exclusivity rule will be rejected with a write error. The root cgroup is a partition root and all its available CPUs are in its exclusive CPU set. ”h]”(jÑ)”}”(hŒcpuset.cpus.exclusive”h]”hŒcpuset.cpus.exclusive”…””}”(hjìFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MQ hjèFubjá)”}”(hhh]”(hú)”}”(hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”h]”hŒRA read-write multiple values file which exists on non-root cpuset-enabled cgroups.”…””}”(hjýFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M2 hjúFubhú)”}”(hXIt lists all the exclusive CPUs that are allowed to be used to create a new cpuset partition. Its value is not used unless the cgroup becomes a valid partition root. See the "cpuset.cpus.partition" section below for a description of what a cpuset partition is.”h]”hX It lists all the exclusive CPUs that are allowed to be used to create a new cpuset partition. Its value is not used unless the cgroup becomes a valid partition root. See the â€œcpuset.cpus.partitionâ€ section below for a description of what a cpuset partition is.”…””}”(hjGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M5 hjúFubhú)”}”(hX>When the cgroup becomes a partition root, the actual exclusive CPUs that are allocated to that partition are listed in "cpuset.cpus.exclusive.effective" which may be different from "cpuset.cpus.exclusive". If "cpuset.cpus.exclusive" has previously been set, "cpuset.cpus.exclusive.effective" is always a subset of it.”h]”hXNWhen the cgroup becomes a partition root, the actual exclusive CPUs that are allocated to that partition are listed in â€œcpuset.cpus.exclusive.effectiveâ€ which may be different from â€œcpuset.cpus.exclusiveâ€. If â€œcpuset.cpus.exclusiveâ€ has previously been set, â€œcpuset.cpus.exclusive.effectiveâ€ is always a subset of it.”…””}”(hjGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M; hjúFubhú)”}”(hX«Users can manually set it to a value that is different from "cpuset.cpus". One constraint in setting it is that the list of CPUs must be exclusive with respect to "cpuset.cpus.exclusive" and "cpuset.cpus.exclusive.effective" of its siblings. Another constraint is that it cannot be a superset of "cpuset.cpus" of its sibling in order to leave at least one CPU available to that sibling when the exclusive CPUs are taken away.”h]”hX»Users can manually set it to a value that is different from â€œcpuset.cpusâ€. One constraint in setting it is that the list of CPUs must be exclusive with respect to â€œcpuset.cpus.exclusiveâ€ and â€œcpuset.cpus.exclusive.effectiveâ€ of its siblings. Another constraint is that it cannot be a superset of â€œcpuset.cpusâ€ of its sibling in order to leave at least one CPU available to that sibling when the exclusive CPUs are taken away.”…””}”(hj'Gh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MB hjúFubhú)”}”(hX.For a parent cgroup, any one of its exclusive CPUs can only be distributed to at most one of its child cgroups. Having an exclusive CPU appearing in two or more of its child cgroups is not allowed (the exclusivity rule). A value that violates the exclusivity rule will be rejected with a write error.”h]”hX.For a parent cgroup, any one of its exclusive CPUs can only be distributed to at most one of its child cgroups. Having an exclusive CPU appearing in two or more of its child cgroups is not allowed (the exclusivity rule). A value that violates the exclusivity rule will be rejected with a write error.”…””}”(hj5Gh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MJ hjúFubhú)”}”(hŒ\The root cgroup is a partition root and all its available CPUs are in its exclusive CPU set.”h]”hŒ\The root cgroup is a partition root and all its available CPUs are in its exclusive CPU set.”…””}”(hjCGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MP hjúFubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjèFubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MQ hjEubjË)”}”(hX(cpuset.cpus.exclusive.effective A read-only multiple values file which exists on all non-root cpuset-enabled cgroups. This file shows the effective set of exclusive CPUs that can be used to create a partition root. The content of this file will always be a subset of its parent's "cpuset.cpus.exclusive.effective" if its parent is not the root cgroup. It will also be a subset of "cpuset.cpus.exclusive" if it is set. This file should only be non-empty if either "cpuset.cpus.exclusive" is set or when the current cpuset is a valid partition root. ”h]”(jÑ)”}”(hŒcpuset.cpus.exclusive.effective”h]”hŒcpuset.cpus.exclusive.effective”…””}”(hjaGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M^ hj]Gubjá)”}”(hhh]”(hú)”}”(hŒUA read-only multiple values file which exists on all non-root cpuset-enabled cgroups.”h]”hŒUA read-only multiple values file which exists on all non-root cpuset-enabled cgroups.”…””}”(hjrGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MT hjoGubhú)”}”(hX°This file shows the effective set of exclusive CPUs that can be used to create a partition root. The content of this file will always be a subset of its parent's "cpuset.cpus.exclusive.effective" if its parent is not the root cgroup. It will also be a subset of "cpuset.cpus.exclusive" if it is set. This file should only be non-empty if either "cpuset.cpus.exclusive" is set or when the current cpuset is a valid partition root.”h]”hX¾This file shows the effective set of exclusive CPUs that can be used to create a partition root. The content of this file will always be a subset of its parentâ€™s â€œcpuset.cpus.exclusive.effectiveâ€ if its parent is not the root cgroup. It will also be a subset of â€œcpuset.cpus.exclusiveâ€ if it is set. This file should only be non-empty if either â€œcpuset.cpus.exclusiveâ€ is set or when the current cpuset is a valid partition root.”…””}”(hj€Gh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MW hjoGubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj]Gubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M^ hjEubjË)”}”(hŒÖcpuset.cpus.isolated A read-only and root cgroup only multiple values file. This file shows the set of all isolated CPUs used in existing isolated partitions. It will be empty if no isolated partition is created. ”h]”(jÑ)”}”(hŒcpuset.cpus.isolated”h]”hŒcpuset.cpus.isolated”…””}”(hjžGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Me hjšGubjá)”}”(hhh]”(hú)”}”(hŒ6A read-only and root cgroup only multiple values file.”h]”hŒ6A read-only and root cgroup only multiple values file.”…””}”(hj¯Gh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Ma hj¬Gubhú)”}”(hŒˆThis file shows the set of all isolated CPUs used in existing isolated partitions. It will be empty if no isolated partition is created.”h]”hŒˆThis file shows the set of all isolated CPUs used in existing isolated partitions. It will be empty if no isolated partition is created.”…””}”(hj½Gh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mc hj¬Gubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjšGubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Me hjEubjË)”}”(hX´cpuset.cpus.partition A read-write single value file which exists on non-root cpuset-enabled cgroups. This flag is owned by the parent cgroup and is not delegatable. It accepts only the following input values when written to. ========== ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing ========== ===================================== A cpuset partition is a collection of cpuset-enabled cgroups with a partition root at the top of the hierarchy and its descendants except those that are separate partition roots themselves and their descendants. A partition has exclusive access to the set of exclusive CPUs allocated to it. Other cgroups outside of that partition cannot use any CPUs in that set. There are two types of partitions - local and remote. A local partition is one whose parent cgroup is also a valid partition root. A remote partition is one whose parent cgroup is not a valid partition root itself. Writing to "cpuset.cpus.exclusive" is optional for the creation of a local partition as its "cpuset.cpus.exclusive" file will assume an implicit value that is the same as "cpuset.cpus" if it is not set. Writing the proper "cpuset.cpus.exclusive" values down the cgroup hierarchy before the target partition root is mandatory for the creation of a remote partition. Not all the CPUs requested in "cpuset.cpus.exclusive" can be used to form a new partition. Only those that were present in its parent's "cpuset.cpus.exclusive.effective" control file can be used. For partitions created without setting "cpuset.cpus.exclusive", exclusive CPUs specified in sibling's "cpuset.cpus.exclusive" or "cpuset.cpus.exclusive.effective" also cannot be used. Currently, a remote partition cannot be created under a local partition. All the ancestors of a remote partition root except the root cgroup cannot be a partition root. The root cgroup is always a partition root and its state cannot be changed. All other non-root cgroups start out as "member". Even though the "cpuset.cpus.exclusive*" and "cpuset.cpus" control files are not present in the root cgroup, they are implicitly the same as the "/sys/devices/system/cpu/possible" sysfs file. When set to "root", the current cgroup is the root of a new partition or scheduling domain. The set of exclusive CPUs is determined by the value of its "cpuset.cpus.exclusive.effective". When set to "isolated", the CPUs in that partition will be in an isolated state without any load balancing from the scheduler and excluded from the unbound workqueues. Tasks placed in such a partition with multiple CPUs should be carefully distributed and bound to each of the individual CPUs for optimal performance. A partition root ("root" or "isolated") can be in one of the two possible states - valid or invalid. An invalid partition root is in a degraded state where some state information may be retained, but behaves more like a "member". All possible state transitions among "member", "root" and "isolated" are allowed. On read, the "cpuset.cpus.partition" file can show the following values. ============================= ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing "root invalid ()" Invalid partition root "isolated invalid ()" Invalid isolated partition root ============================= ===================================== In the case of an invalid partition root, a descriptive string on why the partition is invalid is included within parentheses. For a local partition root to be valid, the following conditions must be met. 1) The parent cgroup is a valid partition root. 2) The "cpuset.cpus.exclusive.effective" file cannot be empty, though it may contain offline CPUs. 3) The "cpuset.cpus.effective" cannot be empty unless there is no task associated with this partition. For a remote partition root to be valid, all the above conditions except the first one must be met. External events like hotplug or changes to "cpuset.cpus" or "cpuset.cpus.exclusive" can cause a valid partition root to become invalid and vice versa. Note that a task cannot be moved to a cgroup with empty "cpuset.cpus.effective". A valid non-root parent partition may distribute out all its CPUs to its child local partitions when there is no task associated with it. Care must be taken to change a valid partition root to "member" as all its child local partitions, if present, will become invalid causing disruption to tasks running in those child partitions. These inactivated partitions could be recovered if their parent is switched back to a partition root with a proper value in "cpuset.cpus" or "cpuset.cpus.exclusive". Poll and inotify events are triggered whenever the state of "cpuset.cpus.partition" changes. That includes changes caused by write to "cpuset.cpus.partition", cpu hotplug or other changes that modify the validity status of the partition. This will allow user space agents to monitor unexpected changes to "cpuset.cpus.partition" without the need to do continuous polling. A user can pre-configure certain CPUs to an isolated state with load balancing disabled at boot time with the "isolcpus" kernel boot command line option. If those CPUs are to be put into a partition, they have to be used in an isolated partition. ”h]”(jÑ)”}”(hŒcpuset.cpus.partition”h]”hŒcpuset.cpus.partition”…””}”(hjÛGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mâ hj×Gubjá)”}”(hhh]”(hú)”}”(hŒA read-write single value file which exists on non-root cpuset-enabled cgroups. This flag is owned by the parent cgroup and is not delegatable.”h]”hŒA read-write single value file which exists on non-root cpuset-enabled cgroups. This flag is owned by the parent cgroup and is not delegatable.”…””}”(hjìGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mh hjéGubhú)”}”(hŒ;It accepts only the following input values when written to.”h]”hŒ;It accepts only the following input values when written to.”…””}”(hjúGh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Ml hjéGubjÀ)”}”(hŒæ========== ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing ========== ===================================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hjHubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K%uh1j'hjHubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"member"”h]”hŒâ€œmemberâ€”…””}”(hj/Hh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mo hj,Hubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj)HubjH)”}”(hhh]”hú)”}”(hŒNon-root member of a partition”h]”hŒNon-root member of a partition”…””}”(hjFHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mo hjCHubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj)Hubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj&HubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"root"”h]”hŒ â€œrootâ€”…””}”(hjfHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mp hjcHubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj`HubjH)”}”(hhh]”hú)”}”(hŒPartition root”h]”hŒPartition root”…””}”(hj}Hh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mp hjzHubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj`Hubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj&HubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ "isolated"”h]”hŒâ€œisolatedâ€”…””}”(hjHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mq hjšHubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj—HubjH)”}”(hhh]”hú)”}”(hŒ%Partition root without load balancing”h]”hŒ%Partition root without load balancing”…””}”(hj´Hh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mq hj±Hubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj—Hubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhj&Hubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjHubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjHubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjHubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´Mn hjéGubhú)”}”(hXmA cpuset partition is a collection of cpuset-enabled cgroups with a partition root at the top of the hierarchy and its descendants except those that are separate partition roots themselves and their descendants. A partition has exclusive access to the set of exclusive CPUs allocated to it. Other cgroups outside of that partition cannot use any CPUs in that set.”h]”hXmA cpuset partition is a collection of cpuset-enabled cgroups with a partition root at the top of the hierarchy and its descendants except those that are separate partition roots themselves and their descendants. A partition has exclusive access to the set of exclusive CPUs allocated to it. Other cgroups outside of that partition cannot use any CPUs in that set.”…””}”(hjçHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mt hjéGubhú)”}”(hŒØThere are two types of partitions - local and remote. A local partition is one whose parent cgroup is also a valid partition root. A remote partition is one whose parent cgroup is not a valid partition root itself.”h]”hŒØThere are two types of partitions - local and remote. A local partition is one whose parent cgroup is also a valid partition root. A remote partition is one whose parent cgroup is not a valid partition root itself.”…””}”(hjõHh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M{ hjéGubhú)”}”(hXmWriting to "cpuset.cpus.exclusive" is optional for the creation of a local partition as its "cpuset.cpus.exclusive" file will assume an implicit value that is the same as "cpuset.cpus" if it is not set. Writing the proper "cpuset.cpus.exclusive" values down the cgroup hierarchy before the target partition root is mandatory for the creation of a remote partition.”h]”hX}Writing to â€œcpuset.cpus.exclusiveâ€ is optional for the creation of a local partition as its â€œcpuset.cpus.exclusiveâ€ file will assume an implicit value that is the same as â€œcpuset.cpusâ€ if it is not set. Writing the proper â€œcpuset.cpus.exclusiveâ€ values down the cgroup hierarchy before the target partition root is mandatory for the creation of a remote partition.”…””}”(hjIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M€ hjéGubhú)”}”(hX}Not all the CPUs requested in "cpuset.cpus.exclusive" can be used to form a new partition. Only those that were present in its parent's "cpuset.cpus.exclusive.effective" control file can be used. For partitions created without setting "cpuset.cpus.exclusive", exclusive CPUs specified in sibling's "cpuset.cpus.exclusive" or "cpuset.cpus.exclusive.effective" also cannot be used.”h]”hX•Not all the CPUs requested in â€œcpuset.cpus.exclusiveâ€ can be used to form a new partition. Only those that were present in its parentâ€™s â€œcpuset.cpus.exclusive.effectiveâ€ control file can be used. For partitions created without setting â€œcpuset.cpus.exclusiveâ€, exclusive CPUs specified in siblingâ€™s â€œcpuset.cpus.exclusiveâ€ or â€œcpuset.cpus.exclusive.effectiveâ€ also cannot be used.”…””}”(hjIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‡ hjéGubhú)”}”(hŒ©Currently, a remote partition cannot be created under a local partition. All the ancestors of a remote partition root except the root cgroup cannot be a partition root.”h]”hŒ©Currently, a remote partition cannot be created under a local partition. All the ancestors of a remote partition root except the root cgroup cannot be a partition root.”…””}”(hjIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjéGubhú)”}”(hX>The root cgroup is always a partition root and its state cannot be changed. All other non-root cgroups start out as "member". Even though the "cpuset.cpus.exclusive*" and "cpuset.cpus" control files are not present in the root cgroup, they are implicitly the same as the "/sys/devices/system/cpu/possible" sysfs file.”h]”hXNThe root cgroup is always a partition root and its state cannot be changed. All other non-root cgroups start out as â€œmemberâ€. Even though the â€œcpuset.cpus.exclusive*â€ and â€œcpuset.cpusâ€ control files are not present in the root cgroup, they are implicitly the same as the â€œ/sys/devices/system/cpu/possibleâ€ sysfs file.”…””}”(hj-Ih²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M“ hjéGubhú)”}”(hŒ»When set to "root", the current cgroup is the root of a new partition or scheduling domain. The set of exclusive CPUs is determined by the value of its "cpuset.cpus.exclusive.effective".”h]”hŒÃWhen set to â€œrootâ€, the current cgroup is the root of a new partition or scheduling domain. The set of exclusive CPUs is determined by the value of its â€œcpuset.cpus.exclusive.effectiveâ€.”…””}”(hj;Ih²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mš hjéGubhú)”}”(hX>When set to "isolated", the CPUs in that partition will be in an isolated state without any load balancing from the scheduler and excluded from the unbound workqueues. Tasks placed in such a partition with multiple CPUs should be carefully distributed and bound to each of the individual CPUs for optimal performance.”h]”hXBWhen set to â€œisolatedâ€, the CPUs in that partition will be in an isolated state without any load balancing from the scheduler and excluded from the unbound workqueues. Tasks placed in such a partition with multiple CPUs should be carefully distributed and bound to each of the individual CPUs for optimal performance.”…””}”(hjIIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mž hjéGubhú)”}”(hŒæA partition root ("root" or "isolated") can be in one of the two possible states - valid or invalid. An invalid partition root is in a degraded state where some state information may be retained, but behaves more like a "member".”h]”hŒòA partition root (â€œrootâ€ or â€œisolatedâ€) can be in one of the two possible states - valid or invalid. An invalid partition root is in a degraded state where some state information may be retained, but behaves more like a â€œmemberâ€.”…””}”(hjWIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¤ hjéGubhú)”}”(hŒQAll possible state transitions among "member", "root" and "isolated" are allowed.”h]”hŒ]All possible state transitions among â€œmemberâ€, â€œrootâ€ and â€œisolatedâ€ are allowed.”…””}”(hjeIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M© hjéGubhú)”}”(hŒHOn read, the "cpuset.cpus.partition" file can show the following values.”h]”hŒLOn read, the â€œcpuset.cpus.partitionâ€ file can show the following values.”…””}”(hjsIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¬ hjéGubjÀ)”}”(hX©============================= ===================================== "member" Non-root member of a partition "root" Partition root "isolated" Partition root without load balancing "root invalid ()" Invalid partition root "isolated invalid ()" Invalid isolated partition root ============================= ===================================== ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjˆIubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K%uh1j'hjˆIubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"member"”h]”hŒâ€œmemberâ€”…””}”(hj¨Ih²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M° hj¥Iubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj¢IubjH)”}”(hhh]”hú)”}”(hŒNon-root member of a partition”h]”hŒNon-root member of a partition”…””}”(hj¿Ih²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M° hj¼Iubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj¢Iubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjŸIubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"root"”h]”hŒ â€œrootâ€”…””}”(hjßIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M± hjÜIubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÙIubjH)”}”(hhh]”hú)”}”(hŒPartition root”h]”hŒPartition root”…””}”(hjöIh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M± hjóIubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjÙIubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjŸIubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ "isolated"”h]”hŒâ€œisolatedâ€”…””}”(hjJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M² hjJubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjJubjH)”}”(hhh]”hú)”}”(hŒ%Partition root without load balancing”h]”hŒ%Partition root without load balancing”…””}”(hj-Jh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M² hj*Jubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjJubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjŸIubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"root invalid ()"”h]”hŒâ€œroot invalid ()â€”…””}”(hjMJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³ hjJJubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjGJubjH)”}”(hhh]”hú)”}”(hŒInvalid partition root”h]”hŒInvalid partition root”…””}”(hjdJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³ hjaJubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjGJubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjŸIubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ"isolated invalid ()"”h]”hŒ!â€œisolated invalid ()â€”…””}”(hj„Jh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´ hjJubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj~JubjH)”}”(hhh]”hú)”}”(hŒInvalid isolated partition root”h]”hŒInvalid isolated partition root”…””}”(hj›Jh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´ hj˜Jubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj~Jubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjŸIubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjˆIubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hj…Iubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjIubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M¯ hjéGubhú)”}”(hŒ~In the case of an invalid partition root, a descriptive string on why the partition is invalid is included within parentheses.”h]”hŒ~In the case of an invalid partition root, a descriptive string on why the partition is invalid is included within parentheses.”…””}”(hjÎJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M· hjéGubhú)”}”(hŒMFor a local partition root to be valid, the following conditions must be met.”h]”hŒMFor a local partition root to be valid, the following conditions must be met.”…””}”(hjÜJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mº hjéGubhŒenumerated_list”“”)”}”(hhh]”(jÃ)”}”(hŒ,The parent cgroup is a valid partition root.”h]”hú)”}”(hjñJh]”hŒ,The parent cgroup is a valid partition root.”…””}”(hjóJh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M½ hjïJubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjìJubjÃ)”}”(hŒ_The "cpuset.cpus.exclusive.effective" file cannot be empty, though it may contain offline CPUs.”h]”hú)”}”(hŒ_The "cpuset.cpus.exclusive.effective" file cannot be empty, though it may contain offline CPUs.”h]”hŒcThe â€œcpuset.cpus.exclusive.effectiveâ€ file cannot be empty, though it may contain offline CPUs.”…””}”(hj Kh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¾ hjKubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjìJubjÃ)”}”(hŒdThe "cpuset.cpus.effective" cannot be empty unless there is no task associated with this partition. ”h]”hú)”}”(hŒcThe "cpuset.cpus.effective" cannot be empty unless there is no task associated with this partition.”h]”hŒgThe â€œcpuset.cpus.effectiveâ€ cannot be empty unless there is no task associated with this partition.”…””}”(hj"Kh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÀ hjKubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjìJubeh}”(h]”h ]”h"]”h$]”h&]”Œenumtype”Œarabic”Œprefix”hŒsuffix”Œ)”uh1jêJhjéGubhú)”}”(hŒcFor a remote partition root to be valid, all the above conditions except the first one must be met.”h]”hŒcFor a remote partition root to be valid, all the above conditions except the first one must be met.”…””}”(hjAKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÃ hjéGubhú)”}”(hŒèExternal events like hotplug or changes to "cpuset.cpus" or "cpuset.cpus.exclusive" can cause a valid partition root to become invalid and vice versa. Note that a task cannot be moved to a cgroup with empty "cpuset.cpus.effective".”h]”hŒôExternal events like hotplug or changes to â€œcpuset.cpusâ€ or â€œcpuset.cpus.exclusiveâ€ can cause a valid partition root to become invalid and vice versa. Note that a task cannot be moved to a cgroup with empty â€œcpuset.cpus.effectiveâ€.”…””}”(hjOKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÆ hjéGubhú)”}”(hŒ‰A valid non-root parent partition may distribute out all its CPUs to its child local partitions when there is no task associated with it.”h]”hŒ‰A valid non-root parent partition may distribute out all its CPUs to its child local partitions when there is no task associated with it.”…””}”(hj]Kh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MË hjéGubhú)”}”(hXgCare must be taken to change a valid partition root to "member" as all its child local partitions, if present, will become invalid causing disruption to tasks running in those child partitions. These inactivated partitions could be recovered if their parent is switched back to a partition root with a proper value in "cpuset.cpus" or "cpuset.cpus.exclusive".”h]”hXsCare must be taken to change a valid partition root to â€œmemberâ€ as all its child local partitions, if present, will become invalid causing disruption to tasks running in those child partitions. These inactivated partitions could be recovered if their parent is switched back to a partition root with a proper value in â€œcpuset.cpusâ€ or â€œcpuset.cpus.exclusiveâ€.”…””}”(hjkKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÏ hjéGubhú)”}”(hXtPoll and inotify events are triggered whenever the state of "cpuset.cpus.partition" changes. That includes changes caused by write to "cpuset.cpus.partition", cpu hotplug or other changes that modify the validity status of the partition. This will allow user space agents to monitor unexpected changes to "cpuset.cpus.partition" without the need to do continuous polling.”h]”hX€Poll and inotify events are triggered whenever the state of â€œcpuset.cpus.partitionâ€ changes. That includes changes caused by write to â€œcpuset.cpus.partitionâ€, cpu hotplug or other changes that modify the validity status of the partition. This will allow user space agents to monitor unexpected changes to â€œcpuset.cpus.partitionâ€ without the need to do continuous polling.”…””}”(hjyKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÖ hjéGubhú)”}”(hŒ÷A user can pre-configure certain CPUs to an isolated state with load balancing disabled at boot time with the "isolcpus" kernel boot command line option. If those CPUs are to be put into a partition, they have to be used in an isolated partition.”h]”hŒûA user can pre-configure certain CPUs to an isolated state with load balancing disabled at boot time with the â€œisolcpusâ€ kernel boot command line option. If those CPUs are to be put into a partition, they have to be used in an isolated partition.”…””}”(hj‡Kh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÞ hjéGubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj×Gubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mâ hjEubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjEubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MÑ hj Eh²hubeh}”(h]”Œcpuset-interface-files”ah ]”h"]”Œcpuset interface files”ah$]”h&]”uh1hÄhjÝDh²hh³hÃh´MÏ ubeh}”(h]”Œcpuset”ah ]”h"]”Œcpuset”ah$]”h&]”uh1hÄhjsh²hh³hÃh´MÀ ubhÅ)”}”(hhh]”(hÊ)”}”(hŒDevice controller”h]”hŒDevice controller”…””}”(hjÀKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj½Kh²hh³hÃh´Må ubhú)”}”(hŒ—Device controller manages access to device files. It includes both creation of new device files (using mknod), and access to the existing device files.”h]”hŒ—Device controller manages access to device files. It includes both creation of new device files (using mknod), and access to the existing device files.”…””}”(hjÎKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mç hj½Kh²hubhú)”}”(hXCgroup v2 device controller has no interface files and is implemented on top of cgroup BPF. To control access to device files, a user may create bpf programs of type BPF_PROG_TYPE_CGROUP_DEVICE and attach them to cgroups with BPF_CGROUP_DEVICE flag. On an attempt to access a device file, corresponding BPF programs will be executed, and depending on the return value the attempt will succeed or fail with -EPERM.”h]”hXCgroup v2 device controller has no interface files and is implemented on top of cgroup BPF. To control access to device files, a user may create bpf programs of type BPF_PROG_TYPE_CGROUP_DEVICE and attach them to cgroups with BPF_CGROUP_DEVICE flag. On an attempt to access a device file, corresponding BPF programs will be executed, and depending on the return value the attempt will succeed or fail with -EPERM.”…””}”(hjÜKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Më hj½Kh²hubhú)”}”(hX A BPF_PROG_TYPE_CGROUP_DEVICE program takes a pointer to the bpf_cgroup_dev_ctx structure, which describes the device access attempt: access type (mknod/read/write) and device (type, major and minor numbers). If the program returns 0, the attempt fails with -EPERM, otherwise it succeeds.”h]”hX A BPF_PROG_TYPE_CGROUP_DEVICE program takes a pointer to the bpf_cgroup_dev_ctx structure, which describes the device access attempt: access type (mknod/read/write) and device (type, major and minor numbers). If the program returns 0, the attempt fails with -EPERM, otherwise it succeeds.”…””}”(hjêKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mò hj½Kh²hubhú)”}”(hŒ‹An example of BPF_PROG_TYPE_CGROUP_DEVICE program may be found in tools/testing/selftests/bpf/progs/dev_cgroup.c in the kernel source tree.”h]”hŒ‹An example of BPF_PROG_TYPE_CGROUP_DEVICE program may be found in tools/testing/selftests/bpf/progs/dev_cgroup.c in the kernel source tree.”…””}”(hjøKh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mø hj½Kh²hubeh}”(h]”Œdevice-controller”ah ]”h"]”Œdevice controller”ah$]”h&]”uh1hÄhjsh²hh³hÃh´Må ubhÅ)”}”(hhh]”(hÊ)”}”(hŒRDMA”h]”hŒRDMA”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjLh²hh³hÃh´Mý ubhú)”}”(hŒRThe "rdma" controller regulates the distribution and accounting of RDMA resources.”h]”hŒVThe â€œrdmaâ€ controller regulates the distribution and accounting of RDMA resources.”…””}”(hjLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mÿ hjLh²hubhú)”}”(hŒ÷RDMA devices from all network namespaces are listed. Each line starts with the device name. If more than one device has the same name, ``index=N`` follows the name, where ``N`` is the system-wide RDMA device index, unique among registered devices.”h]”(hŒ‡RDMA devices from all network namespaces are listed. Each line starts with the device name. If more than one device has the same name, ”…””}”(hj-Lh²hh³Nh´Nubj)”}”(hŒ``index=N``”h]”hŒindex=N”…””}”(hj5Lh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj-LubhŒ follows the name, where ”…””}”(hj-Lh²hh³Nh´Nubj)”}”(hŒ``N``”h]”hŒN”…””}”(hjGLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj-LubhŒG is the system-wide RDMA device index, unique among registered devices.”…””}”(hj-Lh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjLh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒRDMA Interface Files”h]”hŒRDMA Interface Files”…””}”(hjbLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj_Lh²hh³hÃh´MubjÀ)”}”(hXË rdma.max A readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a RDMA/IB device. Lines are keyed by device name and are not ordered. A write may include ``index=N`` after the device name. The index is optional when the name is globally unique. If multiple devices have that name, the index is required and a write without it fails with ``-ENOTUNIQ``. Each line contains space separated resource name and its configured limit that can be distributed. The following nested keys are defined. ========== ============================= hca_handle Maximum number of HCA Handles hca_object Maximum number of HCA Objects ========== ============================= An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=2 hca_object=2000 ocrdma1 hca_handle=3 hca_object=max For devices with duplicate names, select the device by index:: echo "rxe0 index=5 hca_handle=2" > rdma.max rdma.current A read-only file that describes current resource usage. It exists for all the cgroup except root. An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=1 hca_object=23 rdma.peak A read-only nested-keyed file that exists for all the cgroups except root. It shows the historical high watermark of resource usage per device since the cgroup was created. An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=0 hca_object=23 rdma.events A read-only nested-keyed file which exists on non-root cgroups. The following nested keys are defined. max The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event. alloc_fail The number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward. An example for mlx4 device follows:: mlx4_0 hca_handle.max=5 hca_handle.alloc_fail=3 hca_object.max=0 hca_object.alloc_fail=0 rdma.events.local Similar to rdma.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. The following nested keys are defined. max The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroup's own rdma.max limit was reached. alloc_fail The number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroup's or an ancestor's rdma.max limit. An example for mlx4 device follows:: mlx4_0 hca_handle.max=5 hca_handle.alloc_fail=0 hca_object.max=0 hca_object.alloc_fail=0 ”h]”jÆ)”}”(hhh]”(jË)”}”(hXÚrdma.max A readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a RDMA/IB device. Lines are keyed by device name and are not ordered. A write may include ``index=N`` after the device name. The index is optional when the name is globally unique. If multiple devices have that name, the index is required and a write without it fails with ``-ENOTUNIQ``. Each line contains space separated resource name and its configured limit that can be distributed. The following nested keys are defined. ========== ============================= hca_handle Maximum number of HCA Handles hca_object Maximum number of HCA Objects ========== ============================= An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=2 hca_object=2000 ocrdma1 hca_handle=3 hca_object=max For devices with duplicate names, select the device by index:: echo "rxe0 index=5 hca_handle=2" > rdma.max ”h]”(jÑ)”}”(hŒrdma.max”h]”hŒrdma.max”…””}”(hj{Lh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M%hjwLubjá)”}”(hhh]”(hú)”}”(hŒA readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a RDMA/IB device.”h]”hŒA readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a RDMA/IB device.”…””}”(hjŒLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj‰Lubhú)”}”(hXpLines are keyed by device name and are not ordered. A write may include ``index=N`` after the device name. The index is optional when the name is globally unique. If multiple devices have that name, the index is required and a write without it fails with ``-ENOTUNIQ``. Each line contains space separated resource name and its configured limit that can be distributed.”h]”(hŒHLines are keyed by device name and are not ordered. A write may include ”…””}”(hjšLh²hh³Nh´Nubj)”}”(hŒ``index=N``”h]”hŒindex=N”…””}”(hj¢Lh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjšLubhŒ¬ after the device name. The index is optional when the name is globally unique. If multiple devices have that name, the index is required and a write without it fails with ”…””}”(hjšLh²hh³Nh´Nubj)”}”(hŒ ``-ENOTUNIQ``”h]”hŒ -ENOTUNIQ”…””}”(hj´Lh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjšLubhŒd. Each line contains space separated resource name and its configured limit that can be distributed.”…””}”(hjšLh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj‰Lubhú)”}”(hŒ&The following nested keys are defined.”h]”hŒ&The following nested keys are defined.”…””}”(hjÌLh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj‰LubjÀ)”}”(hŒ°========== ============================= hca_handle Maximum number of HCA Handles hca_object Maximum number of HCA Objects ========== ============================= ”h]”j)”}”(hhh]”j#)”}”(hhh]”(j()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”K uh1j'hjáLubj()”}”(hhh]”h}”(h]”h ]”h"]”h$]”h&]”Œcolwidth”Kuh1j'hjáLubj>)”}”(hhh]”(jC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ hca_handle”h]”hŒ hca_handle”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjþLubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjûLubjH)”}”(hhh]”hú)”}”(hŒMaximum number of HCA Handles”h]”hŒMaximum number of HCA Handles”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjMubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhjûLubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjøLubjC)”}”(hhh]”(jH)”}”(hhh]”hú)”}”(hŒ hca_object”h]”hŒ hca_object”…””}”(hj8Mh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj5Mubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj2MubjH)”}”(hhh]”hú)”}”(hŒMaximum number of HCA Objects”h]”hŒMaximum number of HCA Objects”…””}”(hjOMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjLMubah}”(h]”h ]”h"]”h$]”h&]”uh1jGhj2Mubeh}”(h]”h ]”h"]”h$]”h&]”uh1jBhjøLubeh}”(h]”h ]”h"]”h$]”h&]”uh1j=hjáLubeh}”(h]”h ]”h"]”h$]”h&]”Œcols”Kuh1j"hjÞLubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjÚLubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´Mhj‰Lubhú)”}”(hŒ/An example for mlx4 and ocrdma device follows::”h]”hŒ.An example for mlx4 and ocrdma device follows:”…””}”(hj‚Mh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj‰Lubjj)”}”(hŒGmlx4_0 hca_handle=2 hca_object=2000 ocrdma1 hca_handle=3 hca_object=max”h]”hŒGmlx4_0 hca_handle=2 hca_object=2000 ocrdma1 hca_handle=3 hca_object=max”…””}”hjMsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M hj‰Lubhú)”}”(hŒ>For devices with duplicate names, select the device by index::”h]”hŒ=For devices with duplicate names, select the device by index:”…””}”(hjžMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M#hj‰Lubjj)”}”(hŒ+echo "rxe0 index=5 hca_handle=2" > rdma.max”h]”hŒ+echo "rxe0 index=5 hca_handle=2" > rdma.max”…””}”hj¬Msbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M%hj‰Lubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjwLubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M%hjtLubjË)”}”(hŒêrdma.current A read-only file that describes current resource usage. It exists for all the cgroup except root. An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=1 hca_object=23 ”h]”(jÑ)”}”(hŒrdma.current”h]”hŒrdma.current”…””}”(hjÊMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M.hjÆMubjá)”}”(hhh]”(hú)”}”(hŒaA read-only file that describes current resource usage. It exists for all the cgroup except root.”h]”hŒaA read-only file that describes current resource usage. It exists for all the cgroup except root.”…””}”(hjÛMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M(hjØMubhú)”}”(hŒ/An example for mlx4 and ocrdma device follows::”h]”hŒ.An example for mlx4 and ocrdma device follows:”…””}”(hjéMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M+hjØMubjj)”}”(hŒDmlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=1 hca_object=23”h]”hŒDmlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=1 hca_object=23”…””}”hj÷Msbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M-hjØMubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÆMubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M.hjtLubjË)”}”(hX3rdma.peak A read-only nested-keyed file that exists for all the cgroups except root. It shows the historical high watermark of resource usage per device since the cgroup was created. An example for mlx4 and ocrdma device follows:: mlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=0 hca_object=23 ”h]”(jÑ)”}”(hŒ rdma.peak”h]”hŒ rdma.peak”…””}”(hjNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M8hjNubjá)”}”(hhh]”(hú)”}”(hŒA read-only nested-keyed file that exists for all the cgroups except root. It shows the historical high watermark of resource usage per device since the cgroup was created.”h]”hŒA read-only nested-keyed file that exists for all the cgroups except root. It shows the historical high watermark of resource usage per device since the cgroup was created.”…””}”(hj&Nh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M1hj#Nubhú)”}”(hŒ/An example for mlx4 and ocrdma device follows::”h]”hŒ.An example for mlx4 and ocrdma device follows:”…””}”(hj4Nh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M5hj#Nubjj)”}”(hŒDmlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=0 hca_object=23”h]”hŒDmlx4_0 hca_handle=1 hca_object=20 ocrdma1 hca_handle=0 hca_object=23”…””}”hjBNsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M7hj#Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjNubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M8hjtLubjË)”}”(hXfrdma.events A read-only nested-keyed file which exists on non-root cgroups. The following nested keys are defined. max The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event. alloc_fail The number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward. An example for mlx4 device follows:: mlx4_0 hca_handle.max=5 hca_handle.alloc_fail=3 hca_object.max=0 hca_object.alloc_fail=0 ”h]”(jÑ)”}”(hŒrdma.events”h]”hŒrdma.events”…””}”(hj`Nh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MNhj\Nubjá)”}”(hhh]”(hú)”}”(hŒgA read-only nested-keyed file which exists on non-root cgroups. The following nested keys are defined.”h]”hŒgA read-only nested-keyed file which exists on non-root cgroups. The following nested keys are defined.”…””}”(hjqNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M;hjnNubjÀ)”}”(hXWmax The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event. alloc_fail The number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward. ”h]”jÆ)”}”(hhh]”(jË)”}”(hXHmax The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event. ”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hjŠNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MDhj†Nubjá)”}”(hhh]”hú)”}”(hXCThe number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event.”h]”hXCThe number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because a rdma.max limit in the subtree was reached. This is a hierarchical counter: the event is propagated upward to all ancestor cgroups. A value change in this file generates a file modified event.”…””}”(hj›Nh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M?hj˜Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj†Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MDhjƒNubjË)”}”(hŒÒalloc_fail The number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward. ”h]”(jÑ)”}”(hŒ alloc_fail”h]”hŒ alloc_fail”…””}”(hj¹Nh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MJhjµNubjá)”}”(hhh]”hú)”}”(hŒÆThe number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward.”h]”hŒÆThe number of RDMA resource allocation attempts that originated in this cgroup or its descendants and failed due to a rdma.max limit being reached. This is a hierarchical counter propagated upward.”…””}”(hjÊNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MGhjÇNubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjµNubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MJhjƒNubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjNubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M>hjnNubhú)”}”(hŒ$An example for mlx4 device follows::”h]”hŒ#An example for mlx4 device follows:”…””}”(hjðNh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MLhjnNubjj)”}”(hŒXmlx4_0 hca_handle.max=5 hca_handle.alloc_fail=3 hca_object.max=0 hca_object.alloc_fail=0”h]”hŒXmlx4_0 hca_handle.max=5 hca_handle.alloc_fail=3 hca_object.max=0 hca_object.alloc_fail=0”…””}”hjþNsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MNhjnNubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj\Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MNhjtLubjË)”}”(hXördma.events.local Similar to rdma.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. The following nested keys are defined. max The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroup's own rdma.max limit was reached. alloc_fail The number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroup's or an ancestor's rdma.max limit. An example for mlx4 device follows:: mlx4_0 hca_handle.max=5 hca_handle.alloc_fail=0 hca_object.max=0 hca_object.alloc_fail=0 ”h]”(jÑ)”}”(hŒrdma.events.local”h]”hŒrdma.events.local”…””}”(hjOh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MchjOubjá)”}”(hhh]”(hú)”}”(hŒ°Similar to rdma.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”h]”hŒ°Similar to rdma.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”…””}”(hj-Oh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MQhj*Oubhú)”}”(hŒ&The following nested keys are defined.”h]”hŒ&The following nested keys are defined.”…””}”(hj;Oh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MUhj*OubjÀ)”}”(hXvmax The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroup's own rdma.max limit was reached. alloc_fail The number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroup's or an ancestor's rdma.max limit. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ±max The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroup's own rdma.max limit was reached.”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hjTOh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MZhjPOubjá)”}”(hhh]”hú)”}”(hŒThe number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroup's own rdma.max limit was reached.”h]”hŒ¯The number of times a process in this cgroup or its descendants attempted an RDMA resource allocation that was rejected because this cgroupâ€™s own rdma.max limit was reached.”…””}”(hjeOh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MXhjbOubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjPOubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MZhjMOubjË)”}”(hŒšalloc_fail The number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroup's or an ancestor's rdma.max limit. ”h]”(jÑ)”}”(hŒ alloc_fail”h]”hŒ alloc_fail”…””}”(hjƒOh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M_hjOubjá)”}”(hhh]”hú)”}”(hŒŽThe number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroup's or an ancestor's rdma.max limit.”h]”hŒ’The number of RDMA resource allocation attempts originating from this cgroup that failed due to this cgroupâ€™s or an ancestorâ€™s rdma.max limit.”…””}”(hj”Oh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M]hj‘Oubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjOubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M_hjMOubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjIOubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MWhj*Oubhú)”}”(hŒ$An example for mlx4 device follows::”h]”hŒ#An example for mlx4 device follows:”…””}”(hjºOh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mahj*Oubjj)”}”(hŒXmlx4_0 hca_handle.max=5 hca_handle.alloc_fail=0 hca_object.max=0 hca_object.alloc_fail=0”h]”hŒXmlx4_0 hca_handle.max=5 hca_handle.alloc_fail=0 hca_object.max=0 hca_object.alloc_fail=0”…””}”hjÈOsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mchj*Oubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjOubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MchjtLubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjpLubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´M hj_Lh²hubeh}”(h]”Œrdma-interface-files”ah ]”h"]”Œrdma interface files”ah$]”h&]”uh1hÄhjLh²hh³hÃh´Mubeh}”(h]”Œrdma”ah ]”h"]”Œrdma”ah$]”h&]”uh1hÄhjsh²hh³hÃh´Mý ubhÅ)”}”(hhh]”(hÊ)”}”(hŒDMEM”h]”hŒDMEM”…””}”(hjPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjþOh²hh³hÃh´Mfubhú)”}”(hŒåThe "dmem" controller regulates the distribution and accounting of device memory regions. Because each memory region may have its own page size, which does not have to be equal to the system page size, the units are always bytes.”h]”hŒéThe â€œdmemâ€ controller regulates the distribution and accounting of device memory regions. Because each memory region may have its own page size, which does not have to be equal to the system page size, the units are always bytes.”…””}”(hjPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhhjþOh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒDMEM Interface Files”h]”hŒDMEM Interface Files”…””}”(hj Ph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjPh²hh³hÃh´MmubjÀ)”}”(hX¶dmem.max, dmem.min, dmem.low A readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a region. An example for xe follows:: drm/0000:03:00.0/vram0 1073741824 drm/0000:03:00.0/stolen max The semantics are the same as for the memory cgroup controller, and are calculated in the same way. dmem.peak A read-only nested-keyed file that exists on non-root cgroups. The max device memory usage recorded for the cgroup and its descendants since the creation of the cgroup for each region. dmem.capacity A read-only file that describes maximum region capacity. It only exists on the root cgroup. Not all memory can be allocated by cgroups, as the kernel reserves some for internal use. An example for xe follows:: drm/0000:03:00.0/vram0 8514437120 drm/0000:03:00.0/stolen 67108864 dmem.current A read-only file that describes current resource usage. It exists for all the cgroup except root. An example for xe follows:: drm/0000:03:00.0/vram0 12550144 drm/0000:03:00.0/stolen 8650752 ”h]”jÆ)”}”(hhh]”(jË)”}”(hXkdmem.max, dmem.min, dmem.low A readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a region. An example for xe follows:: drm/0000:03:00.0/vram0 1073741824 drm/0000:03:00.0/stolen max The semantics are the same as for the memory cgroup controller, and are calculated in the same way. ”h]”(jÑ)”}”(hŒdmem.max, dmem.min, dmem.low”h]”hŒdmem.max, dmem.min, dmem.low”…””}”(hj9Ph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mzhj5Pubjá)”}”(hhh]”(hú)”}”(hŒˆA readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a region.”h]”hŒˆA readwrite nested-keyed file that exists for all the cgroups except root that describes current configured resource limit for a region.”…””}”(hjJPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MphjGPubhú)”}”(hŒAn example for xe follows::”h]”hŒAn example for xe follows:”…””}”(hjXPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MthjGPubjj)”}”(hŒ=drm/0000:03:00.0/vram0 1073741824 drm/0000:03:00.0/stolen max”h]”hŒ=drm/0000:03:00.0/vram0 1073741824 drm/0000:03:00.0/stolen max”…””}”hjfPsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MvhjGPubhú)”}”(hŒcThe semantics are the same as for the memory cgroup controller, and are calculated in the same way.”h]”hŒcThe semantics are the same as for the memory cgroup controller, and are calculated in the same way.”…””}”(hjtPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MyhjGPubeh}”(•«h]”h ]”h"]”h$]”h&]”uh1jàhj5Pubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mzhj2PubjË)”}”(hŒÄdmem.peak A read-only nested-keyed file that exists on non-root cgroups. The max device memory usage recorded for the cgroup and its descendants since the creation of the cgroup for each region. ”h]”(jÑ)”}”(hŒ dmem.peak”h]”hŒ dmem.peak”…””}”(hj’Ph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M€hjŽPubjá)”}”(hhh]”(hú)”}”(hŒ>A read-only nested-keyed file that exists on non-root cgroups.”h]”hŒ>A read-only nested-keyed file that exists on non-root cgroups.”…””}”(hj£Ph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M}hj Pubhú)”}”(hŒyThe max device memory usage recorded for the cgroup and its descendants since the creation of the cgroup for each region.”h]”hŒyThe max device memory usage recorded for the cgroup and its descendants since the creation of the cgroup for each region.”…””}”(hj±Ph²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mhj Pubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjŽPubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M€hj2PubjË)”}”(hX)dmem.capacity A read-only file that describes maximum region capacity. It only exists on the root cgroup. Not all memory can be allocated by cgroups, as the kernel reserves some for internal use. An example for xe follows:: drm/0000:03:00.0/vram0 8514437120 drm/0000:03:00.0/stolen 67108864 ”h]”(jÑ)”}”(hŒ dmem.capacity”h]”hŒ dmem.capacity”…””}”(hjÏPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M‹hjËPubjá)”}”(hhh]”(hú)”}”(hŒµA read-only file that describes maximum region capacity. It only exists on the root cgroup. Not all memory can be allocated by cgroups, as the kernel reserves some for internal use.”h]”hŒµA read-only file that describes maximum region capacity. It only exists on the root cgroup. Not all memory can be allocated by cgroups, as the kernel reserves some for internal use.”…””}”(hjàPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MƒhjÝPubhú)”}”(hŒAn example for xe follows::”h]”hŒAn example for xe follows:”…””}”(hjîPh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MˆhjÝPubjj)”}”(hŒBdrm/0000:03:00.0/vram0 8514437120 drm/0000:03:00.0/stolen 67108864”h]”hŒBdrm/0000:03:00.0/vram0 8514437120 drm/0000:03:00.0/stolen 67108864”…””}”hjüPsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MŠhjÝPubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjËPubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M‹hj2PubjË)”}”(hŒÑdmem.current A read-only file that describes current resource usage. It exists for all the cgroup except root. An example for xe follows:: drm/0000:03:00.0/vram0 12550144 drm/0000:03:00.0/stolen 8650752 ”h]”(jÑ)”}”(hŒdmem.current”h]”hŒdmem.current”…””}”(hjQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M”hjQubjá)”}”(hhh]”(hú)”}”(hŒaA read-only file that describes current resource usage. It exists for all the cgroup except root.”h]”hŒaA read-only file that describes current resource usage. It exists for all the cgroup except root.”…””}”(hj+Qh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŽhj(Qubhú)”}”(hŒAn example for xe follows::”h]”hŒAn example for xe follows:”…””}”(hj9Qh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‘hj(Qubjj)”}”(hŒ?drm/0000:03:00.0/vram0 12550144 drm/0000:03:00.0/stolen 8650752”h]”hŒ?drm/0000:03:00.0/vram0 12550144 drm/0000:03:00.0/stolen 8650752”…””}”hjGQsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M“hj(Qubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjQubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M”hj2Pubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj.Pubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MohjPh²hubeh}”(h]”Œdmem-interface-files”ah ]”h"]”Œdmem interface files”ah$]”h&]”uh1hÄhjþOh²hh³hÃh´Mmubeh}”(h]”Œdmem”ah ]”h"]”Œdmem”ah$]”h&]”uh1hÄhjsh²hh³hÃh´MfubhÅ)”}”(hhh]”(hÊ)”}”(hŒHugeTLB”h]”hŒHugeTLB”…””}”(hj€Qh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj}Qh²hh³hÃh´M—ubhú)”}”(hŒThe HugeTLB controller allows limiting the HugeTLB usage per control group and enforces the controller limit during page fault.”h]”hŒThe HugeTLB controller allows limiting the HugeTLB usage per control group and enforces the controller limit during page fault.”…””}”(hjŽQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M™hj}Qh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒHugeTLB Interface Files”h]”hŒHugeTLB Interface Files”…””}”(hjŸQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjœQh²hh³hÃh´MubjÀ)”}”(hXÓhugetlb..current Show current usage for "hugepagesize" hugetlb. It exists for all the cgroup except root. hugetlb..max Set/show the hard limit of "hugepagesize" hugetlb usage. The default value is "max". It exists for all the cgroup except root. hugetlb..events A read-only flat-keyed file which exists on non-root cgroups. max The number of allocation failure due to HugeTLB limit hugetlb..events.local Similar to hugetlb..events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. hugetlb..numa_stat Similar to memory.numa_stat, it shows the numa information of the hugetlb pages of in this cgroup. Only active in use hugetlb pages are included. The per-node values are in bytes. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒyhugetlb..current Show current usage for "hugepagesize" hugetlb. It exists for all the cgroup except root. ”h]”(jÑ)”}”(hŒhugetlb..current”h]”hŒhugetlb..current”…””}”(hj¸Qh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¡hj´Qubjá)”}”(hhh]”hú)”}”(hŒYShow current usage for "hugepagesize" hugetlb. It exists for all the cgroup except root.”h]”hŒ]Show current usage for â€œhugepagesizeâ€ hugetlb. It exists for all the cgroup except root.”…””}”(hjÉQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjÆQubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj´Qubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¡hj±QubjË)”}”(hŒ›hugetlb..max Set/show the hard limit of "hugepagesize" hugetlb usage. The default value is "max". It exists for all the cgroup except root. ”h]”(jÑ)”}”(hŒhugetlb..max”h]”hŒhugetlb..max”…””}”(hjçQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M¥hjãQubjá)”}”(hhh]”hú)”}”(hŒSet/show the hard limit of "hugepagesize" hugetlb usage. The default value is "max". It exists for all the cgroup except root.”h]”hŒ‡Set/show the hard limit of â€œhugepagesizeâ€ hugetlb usage. The default value is â€œmaxâ€. It exists for all the cgroup except root.”…””}”(hjøQh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¤hjõQubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjãQubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M¥hj±QubjË)”}”(hŒ¡hugetlb..events A read-only flat-keyed file which exists on non-root cgroups. max The number of allocation failure due to HugeTLB limit ”h]”(jÑ)”}”(hŒhugetlb..events”h]”hŒhugetlb..events”…””}”(hjRh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M«hjRubjá)”}”(hhh]”(hú)”}”(hŒ=A read-only flat-keyed file which exists on non-root cgroups.”h]”hŒ=A read-only flat-keyed file which exists on non-root cgroups.”…””}”(hj'Rh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¨hj$RubjÀ)”}”(hŒ@max The number of allocation failure due to HugeTLB limit ”h]”jÆ)”}”(hhh]”jË)”}”(hŒ:max The number of allocation failure due to HugeTLB limit ”h]”(jÑ)”}”(hŒmax”h]”hŒmax”…””}”(hj@Rh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M«hj.events.local Similar to hugetlb..events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”(jÑ)”}”(hŒ#hugetlb..events.local”h]”hŒ#hugetlb..events.local”…””}”(hj‡Rh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´M°hjƒRubjá)”}”(hhh]”hú)”}”(hŒÁSimilar to hugetlb..events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”h]”hŒÁSimilar to hugetlb..events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”…””}”(hj˜Rh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M®hj•Rubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjƒRubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´M°hj±QubjË)”}”(hŒæhugetlb..numa_stat Similar to memory.numa_stat, it shows the numa information of the hugetlb pages of in this cgroup. Only active in use hugetlb pages are included. The per-node values are in bytes. ”h]”(jÑ)”}”(hŒ hugetlb..numa_stat”h]”hŒ hugetlb..numa_stat”…””}”(hj¶Rh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mµhj²Rubjá)”}”(hhh]”hú)”}”(hŒÄSimilar to memory.numa_stat, it shows the numa information of the hugetlb pages of in this cgroup. Only active in use hugetlb pages are included. The per-node values are in bytes.”h]”hŒÄSimilar to memory.numa_stat, it shows the numa information of the hugetlb pages of in this cgroup. Only active in use hugetlb pages are included. The per-node values are in bytes.”…””}”(hjÇRh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M³hjÄRubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj²Rubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mµhj±Qubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjQubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MŸhjœQh²hubeh}”(h]”Œhugetlb-interface-files”ah ]”h"]”Œhugetlb interface files”ah$]”h&]”uh1hÄhj}Qh²hh³hÃh´Mubeh}”(h]”Œhugetlb”ah ]”h"]”Œhugetlb”ah$]”h&]”uh1hÄhjsh²hh³hÃh´M—ubhÅ)”}”(hhh]”(hÊ)”}”(hŒMisc”h]”hŒMisc”…””}”(hjSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjýRh²hh³hÃh´M¸ubhú)”}”(hŒâThe Miscellaneous cgroup provides the resource limiting and tracking mechanism for the scalar resources which cannot be abstracted like the other cgroup resources. Controller is enabled by the CONFIG_CGROUP_MISC config option.”h]”hŒâThe Miscellaneous cgroup provides the resource limiting and tracking mechanism for the scalar resources which cannot be abstracted like the other cgroup resources. Controller is enabled by the CONFIG_CGROUP_MISC config option.”…””}”(hjSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MºhjýRh²hubhú)”}”(hX)A resource can be added to the controller via enum misc_res_type{} in the include/linux/misc_cgroup.h file and the corresponding name via misc_res_name[] in the kernel/cgroup/misc.c file. Provider of the resource must set its capacity prior to using the resource by calling misc_cg_set_capacity().”h]”hX)A resource can be added to the controller via enum misc_res_type{} in the include/linux/misc_cgroup.h file and the corresponding name via misc_res_name[] in the kernel/cgroup/misc.c file. Provider of the resource must set its capacity prior to using the resource by calling misc_cg_set_capacity().”…””}”(hjSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¿hjýRh²hubhú)”}”(hŒ²Once a capacity is set then the resource usage can be updated using charge and uncharge APIs. All of the APIs to interact with misc controller are in include/linux/misc_cgroup.h.”h]”hŒ²Once a capacity is set then the resource usage can be updated using charge and uncharge APIs. All of the APIs to interact with misc controller are in include/linux/misc_cgroup.h.”…””}”(hj*Sh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÄhjýRh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒMisc Interface Files”h]”hŒMisc Interface Files”…””}”(hj;Sh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj8Sh²hh³hÃh´MÉubhú)”}”(hŒ}Miscellaneous controller provides the following interface files. If two misc resources (res_a and res_b) are registered then:”h]”hŒ}Miscellaneous controller provides the following interface files. If two misc resources (res_a and res_b) are registered then:”…””}”(hjISh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MËhj8Sh²hubjÀ)”}”(hXÔmisc.capacity A read-only flat-keyed file shown only in the root cgroup. It shows miscellaneous scalar resources available on the platform along with their quantities:: $ cat misc.capacity res_a 50 res_b 10 misc.current A read-only flat-keyed file shown in the all cgroups. It shows the current usage of the resources in the cgroup and its children.:: $ cat misc.current res_a 3 res_b 0 misc.peak A read-only flat-keyed file shown in all cgroups. It shows the historical maximum usage of the resources in the cgroup and its children.:: $ cat misc.peak res_a 10 res_b 8 misc.max A read-write flat-keyed file shown in the non root cgroups. Allowed maximum usage of the resources in the cgroup and its children.:: $ cat misc.max res_a max res_b 4 Limit can be set by:: # echo res_a 1 > misc.max Limit can be set to max by:: # echo res_a max > misc.max Limits can be set higher than the capacity value in the misc.capacity file. misc.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. All fields in this file are hierarchical. .max The number of times the cgroup's resource usage was about to go over the max boundary. misc.events.local Similar to misc.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”jÆ)”}”(hhh]”(jË)”}”(hŒ×misc.capacity A read-only flat-keyed file shown only in the root cgroup. It shows miscellaneous scalar resources available on the platform along with their quantities:: $ cat misc.capacity res_a 50 res_b 10 ”h]”(jÑ)”}”(hŒ misc.capacity”h]”hŒ misc.capacity”…””}”(hjbSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÕhj^Subjá)”}”(hhh]”(hú)”}”(hŒ›A read-only flat-keyed file shown only in the root cgroup. It shows miscellaneous scalar resources available on the platform along with their quantities::”h]”hŒšA read-only flat-keyed file shown only in the root cgroup. It shows miscellaneous scalar resources available on the platform along with their quantities:”…””}”(hjsSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÏhjpSubjj)”}”(hŒ%$ cat misc.capacity res_a 50 res_b 10”h]”hŒ%$ cat misc.capacity res_a 50 res_b 10”…””}”hjSsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÓhjpSubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj^Subeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÕhj[SubjË)”}”(hŒ¼misc.current A read-only flat-keyed file shown in the all cgroups. It shows the current usage of the resources in the cgroup and its children.:: $ cat misc.current res_a 3 res_b 0 ”h]”(jÑ)”}”(hŒmisc.current”h]”hŒmisc.current”…””}”(hjŸSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MÝhj›Subjá)”}”(hhh]”(hú)”}”(hŒ„A read-only flat-keyed file shown in the all cgroups. It shows the current usage of the resources in the cgroup and its children.::”h]”hŒƒA read-only flat-keyed file shown in the all cgroups. It shows the current usage of the resources in the cgroup and its children.:”…””}”(hj°Sh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MØhjSubjj)”}”(hŒ"$ cat misc.current res_a 3 res_b 0”h]”hŒ"$ cat misc.current res_a 3 res_b 0”…””}”hj¾Ssbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÛhjSubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj›Subeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MÝhj[SubjË)”}”(hŒ¾misc.peak A read-only flat-keyed file shown in all cgroups. It shows the historical maximum usage of the resources in the cgroup and its children.:: $ cat misc.peak res_a 10 res_b 8 ”h]”(jÑ)”}”(hŒ misc.peak”h]”hŒ misc.peak”…””}”(hjÜSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MæhjØSubjá)”}”(hhh]”(hú)”}”(hŒ‹A read-only flat-keyed file shown in all cgroups. It shows the historical maximum usage of the resources in the cgroup and its children.::”h]”hŒŠA read-only flat-keyed file shown in all cgroups. It shows the historical maximum usage of the resources in the cgroup and its children.:”…””}”(hjíSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MàhjêSubjj)”}”(hŒ $ cat misc.peak res_a 10 res_b 8”h]”hŒ $ cat misc.peak res_a 10 res_b 8”…””}”hjûSsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MähjêSubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjØSubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mæhj[SubjË)”}”(hXtmisc.max A read-write flat-keyed file shown in the non root cgroups. Allowed maximum usage of the resources in the cgroup and its children.:: $ cat misc.max res_a max res_b 4 Limit can be set by:: # echo res_a 1 > misc.max Limit can be set to max by:: # echo res_a max > misc.max Limits can be set higher than the capacity value in the misc.capacity file. ”h]”(jÑ)”}”(hŒmisc.max”h]”hŒmisc.max”…””}”(hjTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MùhjTubjá)”}”(hhh]”(hú)”}”(hŒ„A read-write flat-keyed file shown in the non root cgroups. Allowed maximum usage of the resources in the cgroup and its children.::”h]”hŒƒA read-write flat-keyed file shown in the non root cgroups. Allowed maximum usage of the resources in the cgroup and its children.:”…””}”(hj*Th²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Méhj'Tubjj)”}”(hŒ $ cat misc.max res_a max res_b 4”h]”hŒ $ cat misc.max res_a max res_b 4”…””}”hj8Tsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mìhj'Tubhú)”}”(hŒLimit can be set by::”h]”hŒLimit can be set by:”…””}”(hjFTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mðhj'Tubjj)”}”(hŒ# echo res_a 1 > misc.max”h]”hŒ# echo res_a 1 > misc.max”…””}”hjTTsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Mòhj'Tubhú)”}”(hŒLimit can be set to max by::”h]”hŒLimit can be set to max by:”…””}”(hjbTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Môhj'Tubjj)”}”(hŒ# echo res_a max > misc.max”h]”hŒ# echo res_a max > misc.max”…””}”hjpTsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´Möhj'Tubhú)”}”(hŒKLimits can be set higher than the capacity value in the misc.capacity file.”h]”hŒKLimits can be set higher than the capacity value in the misc.capacity file.”…””}”(hj~Th²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Møhj'Tubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhjTubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mùhj[SubjË)”}”(hXdmisc.events A read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. All fields in this file are hierarchical. .max The number of times the cgroup's resource usage was about to go over the max boundary. ”h]”(jÑ)”}”(hŒmisc.events”h]”hŒmisc.events”…””}”(hjœTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj˜Tubjá)”}”(hhh]”(hú)”}”(hŒãA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. All fields in this file are hierarchical.”h]”hŒãA read-only flat-keyed file which exists on non-root cgroups. The following entries are defined. Unless specified otherwise, a value change in this file generates a file modified event. All fields in this file are hierarchical.”…””}”(hjTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MühjªTubjÀ)”}”(hŒm.max The number of times the cgroup's resource usage was about to go over the max boundary. ”h]”jÆ)”}”(hhh]”jË)”}”(hŒa.max The number of times the cgroup's resource usage was about to go over the max boundary. ”h]”(jÑ)”}”(hŒ .max”h]”hŒ .max”…””}”(hjÆTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MhjÂTubjá)”}”(hhh]”hú)”}”(hŒVThe number of times the cgroup's resource usage was about to go over the max boundary.”h]”hŒXThe number of times the cgroupâ€™s resource usage was about to go over the max boundary.”…””}”(hj×Th²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjÔTubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjÂTubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj¿Tubah}”(h]”h ]”h"]”h$]”h&]”uh1jÅhj»Tubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MhjªTubeh}”(h]”h ]”h"]”h$]”h&]”uh1jàhj˜Tubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj[SubjË)”}”(hŒÂmisc.events.local Similar to misc.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events. ”h]”(jÑ)”}”(hŒmisc.events.local”h]”hŒmisc.events.local”…””}”(hj Uh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´Mhj Uubjá)”}”(hhh]”hú)”}”(hŒ¯Similar to misc.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”h]”hŒ¯Similar to misc.events but the fields in the file are local to the cgroup i.e. not hierarchical. The file modified event generated on this file reflects only the local events.”…””}”(hjUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjUubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhj Uubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´Mhj[Subeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjWSubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MÎhj8Sh²hubeh}”(h]”Œmisc-interface-files”ah ]”h"]”Œmisc interface files”ah$]”h&]”uh1hÄhjýRh²hh³hÃh´MÉubhÅ)”}”(hhh]”(hÊ)”}”(hŒMigration and Ownership”h]”hŒMigration and Ownership”…””}”(hjOUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjLUh²hh³hÃh´Mubhú)”}”(hXA miscellaneous scalar resource is charged to the cgroup in which it is used first, and stays charged to that cgroup until that resource is freed. Migrating a process to a different cgroup does not move the charge to the destination cgroup where the process has moved.”h]”hXA miscellaneous scalar resource is charged to the cgroup in which it is used first, and stays charged to that cgroup until that resource is freed. Migrating a process to a different cgroup does not move the charge to the destination cgroup where the process has moved.”…””}”(hj]Uh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjLUh²hubeh}”(h]”Œmigration-and-ownership”ah ]”h"]”Œmigration and ownership”ah$]”h&]”uh1hÄhjýRh²hh³hÃh´Mubeh}”(h]”Œmisc”ah ]”h"]”Œmisc”ah$]”h&]”uh1hÄhjsh²hh³hÃh´M¸ubhÅ)”}”(hhh]”(hÊ)”}”(hŒOthers”h]”hŒOthers”…””}”(hj~Uh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj{Uh²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒ perf_event”h]”hŒ perf_event”…””}”(hjUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjŒUh²hh³hÃh´Mubhú)”}”(hXperf_event controller, if not mounted on a legacy hierarchy, is automatically enabled on the v2 hierarchy so that perf events can always be filtered by cgroup v2 path. The controller can still be moved to a legacy hierarchy after v2 hierarchy is populated.”h]”hXperf_event controller, if not mounted on a legacy hierarchy, is automatically enabled on the v2 hierarchy so that perf events can always be filtered by cgroup v2 path. The controller can still be moved to a legacy hierarchy after v2 hierarchy is populated.”…””}”(hjUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhjŒUh²hubeh}”(h]”Œ perf-event”ah ]”h"]”Œ perf_event”ah$]”h&]”uh1hÄhj{Uh²hh³hÃh´Mubeh}”(h]”Œothers”ah ]”h"]”Œothers”ah$]”h&]”uh1hÄhjsh²hh³hÃh´MubhÅ)”}”(hhh]”(hÊ)”}”(hŒNon-normative information”h]”hŒNon-normative information”…””}”(hj¾Uh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj»Uh²hh³hÃh´Mubhú)”}”(hŒzThis section contains information that isn't considered to be a part of the stable kernel API and so is subject to change.”h]”hŒ|This section contains information that isnâ€™t considered to be a part of the stable kernel API and so is subject to change.”…””}”(hjÌUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M!hj»Uh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒ,CPU controller root cgroup process behaviour”h]”hŒ,CPU controller root cgroup process behaviour”…””}”(hjÝUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÚUh²hh³hÃh´M&ubhú)”}”(hŒØWhen distributing CPU cycles in the root cgroup each thread in this cgroup is treated as if it was hosted in a separate child cgroup of the root cgroup. This child cgroup weight is dependent on its thread nice level.”h]”hŒØWhen distributing CPU cycles in the root cgroup each thread in this cgroup is treated as if it was hosted in a separate child cgroup of the root cgroup. This child cgroup weight is dependent on its thread nice level.”…””}”(hjëUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M(hjÚUh²hubhú)”}”(hŒÆFor details of this mapping see sched_prio_to_weight array in kernel/sched/core.c file (values from this array should be scaled appropriately so the neutral - nice 0 - value is 100 instead of 1024).”h]”hŒÆFor details of this mapping see sched_prio_to_weight array in kernel/sched/core.c file (values from this array should be scaled appropriately so the neutral - nice 0 - value is 100 instead of 1024).”…””}”(hjùUh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M-hjÚUh²hubeh}”(h]”Œ,cpu-controller-root-cgroup-process-behaviour”ah ]”h"]”Œ,cpu controller root cgroup process behaviour”ah$]”h&]”uh1hÄhj»Uh²hh³hÃh´M&ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ+IO controller root cgroup process behaviour”h]”hŒ+IO controller root cgroup process behaviour”…””}”(hjVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjVh²hh³hÃh´M3ubhú)”}”(hŒàRoot cgroup processes are hosted in an implicit leaf child node. When distributing IO resources this implicit child node is taken into account as if it was a normal child cgroup of the root cgroup with a weight value of 200.”h]”hŒàRoot cgroup processes are hosted in an implicit leaf child node. When distributing IO resources this implicit child node is taken into account as if it was a normal child cgroup of the root cgroup with a weight value of 200.”…””}”(hj Vh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M5hjVh²hubeh}”(h]”Œ+io-controller-root-cgroup-process-behaviour”ah ]”h"]”Œ+io controller root cgroup process behaviour”ah$]”h&]”uh1hÄhj»Uh²hh³hÃh´M3ubeh}”(h]”Œnon-normative-information”ah ]”h"]”Œnon-normative information”ah$]”h&]”uh1hÄhjsh²hh³hÃh´Mubeh}”(h]”Œcontrollers”ah ]”h"]”Œcontrollers”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´MBubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Namespace”h]”hŒ Namespace”…””}”(hjIVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjFVh²hh³hÃh´M<ubhÅ)”}”(hhh]”(hÊ)”}”(hŒBasics”h]”hŒBasics”…””}”(hjZVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjWVh²hh³hÃh´M?ubhú)”}”(hX²cgroup namespace provides a mechanism to virtualize the view of the "/proc/$PID/cgroup" file and cgroup mounts. The CLONE_NEWCGROUP clone flag can be used with clone(2) and unshare(2) to create a new cgroup namespace. The process running inside the cgroup namespace will have its "/proc/$PID/cgroup" output restricted to cgroupns root. The cgroupns root is the cgroup of the process at the time of creation of the cgroup namespace.”h]”hXºcgroup namespace provides a mechanism to virtualize the view of the â€œ/proc/$PID/cgroupâ€ file and cgroup mounts. The CLONE_NEWCGROUP clone flag can be used with clone(2) and unshare(2) to create a new cgroup namespace. The process running inside the cgroup namespace will have its â€œ/proc/$PID/cgroupâ€ output restricted to cgroupns root. The cgroupns root is the cgroup of the process at the time of creation of the cgroup namespace.”…””}”(hjhVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MAhjWVh²hubhú)”}”(hX;Without cgroup namespace, the "/proc/$PID/cgroup" file shows the complete path of the cgroup of a process. In a container setup where a set of cgroups and namespaces are intended to isolate processes the "/proc/$PID/cgroup" file may leak potential system level information to the isolated processes. For example::”h]”hXBWithout cgroup namespace, the â€œ/proc/$PID/cgroupâ€ file shows the complete path of the cgroup of a process. In a container setup where a set of cgroups and namespaces are intended to isolate processes the â€œ/proc/$PID/cgroupâ€ file may leak potential system level information to the isolated processes. For example:”…””}”(hjvVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MIhjWVh²hubjj)”}”(hŒ3# cat /proc/self/cgroup 0::/batchjobs/container_id1”h]”hŒ3# cat /proc/self/cgroup 0::/batchjobs/container_id1”…””}”hj„Vsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MOhjWVh²hubhú)”}”(hŒþThe path '/batchjobs/container_id1' can be considered as system-data and undesirable to expose to the isolated processes. cgroup namespace can be used to restrict visibility of this path. For example, before creating a cgroup namespace, one would see::”h]”hXThe path â€˜/batchjobs/container_id1â€™ can be considered as system-data and undesirable to expose to the isolated processes. cgroup namespace can be used to restrict visibility of this path. For example, before creating a cgroup namespace, one would see:”…””}”(hj’Vh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MRhjWVh²hubjj)”}”(hŒ¦# ls -l /proc/self/ns/cgroup lrwxrwxrwx 1 root root 0 2014-07-15 10:37 /proc/self/ns/cgroup -> cgroup:[4026531835] # cat /proc/self/cgroup 0::/batchjobs/container_id1”h]”hŒ¦# ls -l /proc/self/ns/cgroup lrwxrwxrwx 1 root root 0 2014-07-15 10:37 /proc/self/ns/cgroup -> cgroup:[4026531835] # cat /proc/self/cgroup 0::/batchjobs/container_id1”…””}”hj Vsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MWhjWVh²hubhú)”}”(hŒ3After unsharing a new namespace, the view changes::”h]”hŒ2After unsharing a new namespace, the view changes:”…””}”(hj®Vh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M\hjWVh²hubjj)”}”(hŒ# ls -l /proc/self/ns/cgroup lrwxrwxrwx 1 root root 0 2014-07-15 10:35 /proc/self/ns/cgroup -> cgroup:[4026532183] # cat /proc/self/cgroup 0::/”h]”hŒ# ls -l /proc/self/ns/cgroup lrwxrwxrwx 1 root root 0 2014-07-15 10:35 /proc/self/ns/cgroup -> cgroup:[4026532183] # cat /proc/self/cgroup 0::/”…””}”hj¼Vsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M^hjWVh²hubhú)”}”(hŒøWhen some thread from a multi-threaded process unshares its cgroup namespace, the new cgroupns gets applied to the entire process (all the threads). This is natural for the v2 hierarchy; however, for the legacy hierarchies, this may be unexpected.”h]”hŒøWhen some thread from a multi-threaded process unshares its cgroup namespace, the new cgroupns gets applied to the entire process (all the threads). This is natural for the v2 hierarchy; however, for the legacy hierarchies, this may be unexpected.”…””}”(hjÊVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MchjWVh²hubhú)”}”(hŒÌA cgroup namespace is alive as long as there are processes inside or mounts pinning it. When the last usage goes away, the cgroup namespace is destroyed. The cgroupns root and the actual cgroups remain.”h]”hŒÌA cgroup namespace is alive as long as there are processes inside or mounts pinning it. When the last usage goes away, the cgroup namespace is destroyed. The cgroupns root and the actual cgroups remain.”…””}”(hjØVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MhhjWVh²hubeh}”(h]”Œbasics”ah ]”h"]”Œbasics”ah$]”h&]”uh1hÄhjFVh²hh³hÃh´M?ubhÅ)”}”(hhh]”(hÊ)”}”(hŒThe Root and Views”h]”hŒThe Root and Views”…””}”(hjñVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjîVh²hh³hÃh´Moubhú)”}”(hX1The 'cgroupns root' for a cgroup namespace is the cgroup in which the process calling unshare(2) is running. For example, if a process in /batchjobs/container_id1 cgroup calls unshare, cgroup /batchjobs/container_id1 becomes the cgroupns root. For the init_cgroup_ns, this is the real root ('/') cgroup.”h]”hX9The â€˜cgroupns rootâ€™ for a cgroup namespace is the cgroup in which the process calling unshare(2) is running. For example, if a process in /batchjobs/container_id1 cgroup calls unshare, cgroup /batchjobs/container_id1 becomes the cgroupns root. For the init_cgroup_ns, this is the real root (â€˜/â€™) cgroup.”…””}”(hjÿVh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MqhjîVh²hubhú)”}”(hŒrThe cgroupns root cgroup does not change even if the namespace creator process later moves to a different cgroup::”h]”hŒqThe cgroupns root cgroup does not change even if the namespace creator process later moves to a different cgroup:”…””}”(hj Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MwhjîVh²hubjj)”}”(hŒª# ~/unshare -c # unshare cgroupns in some cgroup # cat /proc/self/cgroup 0::/ # mkdir sub_cgrp_1 # echo 0 > sub_cgrp_1/cgroup.procs # cat /proc/self/cgroup 0::/sub_cgrp_1”h]”hŒª# ~/unshare -c # unshare cgroupns in some cgroup # cat /proc/self/cgroup 0::/ # mkdir sub_cgrp_1 # echo 0 > sub_cgrp_1/cgroup.procs # cat /proc/self/cgroup 0::/sub_cgrp_1”…””}”hjWsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MzhjîVh²hubhú)”}”(hŒDEach process gets its namespace-specific view of "/proc/$PID/cgroup"”h]”hŒHEach process gets its namespace-specific view of â€œ/proc/$PID/cgroupâ€”…””}”(hj)Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‚hjîVh²hubhú)”}”(hŒ§Processes running inside the cgroup namespace will be able to see cgroup paths (in /proc/self/cgroup) only inside their root cgroup. From within an unshared cgroupns::”h]”hŒ¦Processes running inside the cgroup namespace will be able to see cgroup paths (in /proc/self/cgroup) only inside their root cgroup. From within an unshared cgroupns:”…””}”(hj7Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M„hjîVh²hubjj)”}”(hŒf# sleep 100000 & [1] 7353 # echo 7353 > sub_cgrp_1/cgroup.procs # cat /proc/7353/cgroup 0::/sub_cgrp_1”h]”hŒf# sleep 100000 & [1] 7353 # echo 7353 > sub_cgrp_1/cgroup.procs # cat /proc/7353/cgroup 0::/sub_cgrp_1”…””}”hjEWsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MˆhjîVh²hubhú)”}”(hŒIFrom the initial cgroup namespace, the real cgroup path will be visible::”h]”hŒHFrom the initial cgroup namespace, the real cgroup path will be visible:”…””}”(hjSWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŽhjîVh²hubjj)”}”(hŒ>$ cat /proc/7353/cgroup 0::/batchjobs/container_id1/sub_cgrp_1”h]”hŒ>$ cat /proc/7353/cgroup 0::/batchjobs/container_id1/sub_cgrp_1”…””}”hjaWsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M‘hjîVh²hubhú)”}”(hXFrom a sibling cgroup namespace (that is, a namespace rooted at a different cgroup), the cgroup path relative to its own cgroup namespace root will be shown. For instance, if PID 7353's cgroup namespace root is at '/batchjobs/container_id2', then it will see::”h]”hX From a sibling cgroup namespace (that is, a namespace rooted at a different cgroup), the cgroup path relative to its own cgroup namespace root will be shown. For instance, if PID 7353â€™s cgroup namespace root is at â€˜/batchjobs/container_id2â€™, then it will see:”…””}”(hjoWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M”hjîVh²hubjj)”}”(hŒ7# cat /proc/7353/cgroup 0::/../container_id2/sub_cgrp_1”h]”hŒ7# cat /proc/7353/cgroup 0::/../container_id2/sub_cgrp_1”…””}”hj}Wsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M™hjîVh²hubhú)”}”(hŒ|Note that the relative path always starts with '/' to indicate that its relative to the cgroup namespace root of the caller.”h]”hŒ€Note that the relative path always starts with â€˜/â€™ to indicate that its relative to the cgroup namespace root of the caller.”…””}”(hj‹Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MœhjîVh²hubeh}”(h]”Œthe-root-and-views”ah ]”h"]”Œthe root and views”ah$]”h&]”uh1hÄhjFVh²hh³hÃh´MoubhÅ)”}”(hhh]”(hÊ)”}”(hŒMigration and setns(2)”h]”hŒMigration and setns(2)”…””}”(hj¤Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj¡Wh²hh³hÃh´M¡ubhú)”}”(hX"Processes inside a cgroup namespace can move into and out of the namespace root if they have proper access to external cgroups. For example, from inside a namespace with cgroupns root at /batchjobs/container_id1, and assuming that the global hierarchy is still accessible inside cgroupns::”h]”hX!Processes inside a cgroup namespace can move into and out of the namespace root if they have proper access to external cgroups. For example, from inside a namespace with cgroupns root at /batchjobs/container_id1, and assuming that the global hierarchy is still accessible inside cgroupns:”…””}”(hj²Wh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M£hj¡Wh²hubjj)”}”(hŒ†# cat /proc/7353/cgroup 0::/sub_cgrp_1 # echo 7353 > batchjobs/container_id2/cgroup.procs # cat /proc/7353/cgroup 0::/../container_id2”h]”hŒ†# cat /proc/7353/cgroup 0::/sub_cgrp_1 # echo 7353 > batchjobs/container_id2/cgroup.procs # cat /proc/7353/cgroup 0::/../container_id2”…””}”hjÀWsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´M©hj¡Wh²hubhú)”}”(hŒ…Note that this kind of setup is not encouraged. A task inside cgroup namespace should only be exposed to its own cgroupns hierarchy.”h]”hŒ…Note that this kind of setup is not encouraged. A task inside cgroup namespace should only be exposed to its own cgroupns hierarchy.”…””}”(hjÎWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¯hj¡Wh²hubhú)”}”(hŒ5setns(2) to another cgroup namespace is allowed when:”h]”hŒ5setns(2) to another cgroup namespace is allowed when:”…””}”(hjÜWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M²hj¡Wh²hubjëJ)”}”(hhh]”(jÃ)”}”(hŒ@the process has CAP_SYS_ADMIN against its current user namespace”h]”hú)”}”(hjïWh]”hŒ@the process has CAP_SYS_ADMIN against its current user namespace”…””}”(hjñWh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M´hjíWubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjêWh²hh³hÃh´NubjÃ)”}”(hŒKthe process has CAP_SYS_ADMIN against the target cgroup namespace's userns ”h]”hú)”}”(hŒJthe process has CAP_SYS_ADMIN against the target cgroup namespace's userns”h]”hŒLthe process has CAP_SYS_ADMIN against the target cgroup namespaceâ€™s userns”…””}”(hjXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MµhjXubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjêWh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”jKŒ(”j?Kj@Kuh1jêJhj¡Wh²hh³hÃh´M´ubhú)”}”(hŒ²No implicit cgroup changes happen with attaching to another cgroup namespace. It is expected that the someone moves the attaching process under the target cgroup namespace root.”h]”hŒ²No implicit cgroup changes happen with attaching to another cgroup namespace. It is expected that the someone moves the attaching process under the target cgroup namespace root.”…””}”(hj$Xh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¸hj¡Wh²hubeh}”(h]”Œmigration-and-setns-2”ah ]”h"]”Œmigration and setns(2)”ah$]”h&]”uh1hÄhjFVh²hh³hÃh´M¡ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ!Interaction with Other Namespaces”h]”hŒ!Interaction with Other Namespaces”…””}”(hj=Xh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj:Xh²hh³hÃh´M¾ubhú)”}”(hŒlNamespace specific cgroup hierarchy can be mounted by a process running inside a non-init cgroup namespace::”h]”hŒkNamespace specific cgroup hierarchy can be mounted by a process running inside a non-init cgroup namespace:”…””}”(hjKXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÀhj:Xh²hubjj)”}”(hŒ$# mount -t cgroup2 none $MOUNT_POINT”h]”hŒ$# mount -t cgroup2 none $MOUNT_POINT”…””}”hjYXsbah}”(h]”h ]”h"]”h$]”h&]”j¦j§uh1jih³hÃh´MÃhj:Xh²hubhú)”}”(hŒŸThis will mount the unified cgroup hierarchy with cgroupns root as the filesystem root. The process needs CAP_SYS_ADMIN against its user and mount namespaces.”h]”hŒŸThis will mount the unified cgroup hierarchy with cgroupns root as the filesystem root. The process needs CAP_SYS_ADMIN against its user and mount namespaces.”…””}”(hjgXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÅhj:Xh²hubhú)”}”(hŒÆThe virtualization of /proc/self/cgroup file combined with restricting the view of cgroup hierarchy by namespace-private cgroupfs mount provides a properly isolated cgroup view inside the container.”h]”hŒÆThe virtualization of /proc/self/cgroup file combined with restricting the view of cgroup hierarchy by namespace-private cgroupfs mount provides a properly isolated cgroup view inside the container.”…””}”(hjuXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÉhj:Xh²hubeh}”(h]”Œ!interaction-with-other-namespaces”ah ]”h"]”Œ!interaction with other namespaces”ah$]”h&]”uh1hÄhjFVh²hh³hÃh´M¾ubeh}”(h]”Œ namespace”ah ]”h"]”Œ namespace”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´M<ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ!Information on Kernel Programming”h]”hŒ!Information on Kernel Programming”…””}”(hj–Xh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj“Xh²hh³hÃh´MÏubhú)”}”(hŒ›This section contains kernel programming information in the areas where interacting with cgroup is necessary. cgroup core and controllers are not covered.”h]”hŒ›This section contains kernel programming information in the areas where interacting with cgroup is necessary. cgroup core and controllers are not covered.”…””}”(hj¤Xh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÑhj“Xh²hubhÅ)”}”(hhh]”(hÊ)”}”(hŒ Filesystem Support for Writeback”h]”hŒ Filesystem Support for Writeback”…””}”(hjµXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj²Xh²hh³hÃh´M×ubhú)”}”(hŒ‘A filesystem can support cgroup writeback by updating address_space_operations->writepages() to annotate bio's using the following two functions.”h]”hŒ“A filesystem can support cgroup writeback by updating address_space_operations->writepages() to annotate bioâ€™s using the following two functions.”…””}”(hjÃXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÙhj²Xh²hubjÀ)”}”(hXWwbc_init_bio(@wbc, @bio) Should be called for each bio carrying writeback data and associates the bio with the inode's owner cgroup and the corresponding request queue. This must be called after a queue (device) has been associated with the bio and before submission. wbc_account_cgroup_owner(@wbc, @folio, @bytes) Should be called for each data segment being written out. While this function doesn't care exactly when it's called during the writeback session, it's the easiest and most natural to call it as data segments are added to a bio. ”h]”jÆ)”}”(hhh]”(jË)”}”(hX wbc_init_bio(@wbc, @bio) Should be called for each bio carrying writeback data and associates the bio with the inode's owner cgroup and the corresponding request queue. This must be called after a queue (device) has been associated with the bio and before submission. ”h]”(jÑ)”}”(hŒwbc_init_bio(@wbc, @bio)”h]”hŒwbc_init_bio(@wbc, @bio)”…””}”(hjÜXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MâhjØXubjá)”}”(hhh]”hú)”}”(hŒóShould be called for each bio carrying writeback data and associates the bio with the inode's owner cgroup and the corresponding request queue. This must be called after a queue (device) has been associated with the bio and before submission.”h]”hŒõShould be called for each bio carrying writeback data and associates the bio with the inodeâ€™s owner cgroup and the corresponding request queue. This must be called after a queue (device) has been associated with the bio and before submission.”…””}”(hjíXh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÞhjêXubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjØXubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MâhjÕXubjË)”}”(hXwbc_account_cgroup_owner(@wbc, @folio, @bytes) Should be called for each data segment being written out. While this function doesn't care exactly when it's called during the writeback session, it's the easiest and most natural to call it as data segments are added to a bio. ”h]”(jÑ)”}”(hŒ.wbc_account_cgroup_owner(@wbc, @folio, @bytes)”h]”hŒ.wbc_account_cgroup_owner(@wbc, @folio, @bytes)”…””}”(hjYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jÐh³hÃh´MèhjYubjá)”}”(hhh]”hú)”}”(hŒãShould be called for each data segment being written out. While this function doesn't care exactly when it's called during the writeback session, it's the easiest and most natural to call it as data segments are added to a bio.”h]”hŒéShould be called for each data segment being written out. While this function doesnâ€™t care exactly when itâ€™s called during the writeback session, itâ€™s the easiest and most natural to call it as data segments are added to a bio.”…””}”(hjYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MåhjYubah}”(h]”h ]”h"]”h$]”h&]”uh1jàhjYubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÊh³hÃh´MèhjÕXubeh}”(h]”h ]”h"]”h$]”h&]”uh1jÅhjÑXubah}”(h]”h ]”h"]”h$]”h&]”uh1j¿h³hÃh´MÝhj²Xh²hubhú)”}”(hXWith writeback bio's annotated, cgroup support can be enabled per super_block by setting SB_I_CGROUPWB in ->s_iflags. This allows for selective disabling of cgroup writeback support which is helpful when certain filesystem features, e.g. journaled data mode, are incompatible.”h]”hXWith writeback bioâ€™s annotated, cgroup support can be enabled per super_block by setting SB_I_CGROUPWB in ->s_iflags. This allows for selective disabling of cgroup writeback support which is helpful when certain filesystem features, e.g. journaled data mode, are incompatible.”…””}”(hjBYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mêhj²Xh²hubhú)”}”(hX¡wbc_init_bio() binds the specified bio to its cgroup. Depending on the configuration, the bio may be executed at a lower priority and if the writeback session is holding shared resources, e.g. a journal entry, may lead to priority inversion. There is no one easy solution for the problem. Filesystems can try to work around specific problem cases by skipping wbc_init_bio() and using bio_associate_blkg() directly.”h]”hX¡wbc_init_bio() binds the specified bio to its cgroup. Depending on the configuration, the bio may be executed at a lower priority and if the writeback session is holding shared resources, e.g. a journal entry, may lead to priority inversion. There is no one easy solution for the problem. Filesystems can try to work around specific problem cases by skipping wbc_init_bio() and using bio_associate_blkg() directly.”…””}”(hjPYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mðhj²Xh²hubeh}”(h]”Œ filesystem-support-for-writeback”ah ]”h"]”Œ filesystem support for writeback”ah$]”h&]”uh1hÄhj“Xh²hh³hÃh´M×ubeh}”(h]”Œ!information-on-kernel-programming”ah ]”h"]”Œ!information on kernel programming”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´MÏubhÅ)”}”(hhh]”(hÊ)”}”(hŒDeprecated v1 Core Features”h]”hŒDeprecated v1 Core Features”…””}”(hjqYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjnYh²hh³hÃh´Múubj¾)”}”(hhh]”(jÃ)”}”(hŒ=Multiple hierarchies including named ones are not supported. ”h]”hú)”}”(hŒThe "tasks" file is removed and "cgroup.procs" is not sorted. ”h]”hú)”}”(hŒ=The "tasks" file is removed and "cgroup.procs" is not sorted.”h]”hŒEThe â€œtasksâ€ file is removed and â€œcgroup.procsâ€ is not sorted.”…””}”(hj¶Yh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj²Yubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjYh²hh³hÃh´NubjÃ)”}”(hŒ$"cgroup.clone_children" is removed. ”h]”hú)”}”(hŒ#"cgroup.clone_children" is removed.”h]”hŒ'â€œcgroup.clone_childrenâ€ is removed.”…””}”(hjÎYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjÊYubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjYh²hh³hÃh´NubjÃ)”}”(hŒl/proc/cgroups is meaningless for v2. Use "cgroup.controllers" or "cgroup.stat" files at the root instead. ”h]”hú)”}”(hŒj/proc/cgroups is meaningless for v2. Use "cgroup.controllers" or "cgroup.stat" files at the root instead.”h]”hŒr/proc/cgroups is meaningless for v2. Use â€œcgroup.controllersâ€ or â€œcgroup.statâ€ files at the root instead.”…””}”(hjæYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjâYubah}”(h]”h ]”h"]”h$]”h&]”uh1jÂhjYh²hh³hÃh´Nubeh}”(h]”h ]”h"]”h$]”h&]”j*juh1j½h³hÃh´MühjnYh²hubeh}”(h]”Œdeprecated-v1-core-features”ah ]”h"]”Œdeprecated v1 core features”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´MúubhÅ)”}”(hhh]”(hÊ)”}”(hŒ$Issues with v1 and Rationales for v2”h]”hŒ$Issues with v1 and Rationales for v2”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjZh²hh³hÃh´M ubhÅ)”}”(hhh]”(hÊ)”}”(hŒMultiple Hierarchies”h]”hŒMultiple Hierarchies”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjZh²hh³hÃh´M ubhú)”}”(hŒÆcgroup v1 allowed an arbitrary number of hierarchies and each hierarchy could host any number of controllers. While this seemed to provide a high level of flexibility, it wasn't useful in practice.”h]”hŒÈcgroup v1 allowed an arbitrary number of hierarchies and each hierarchy could host any number of controllers. While this seemed to provide a high level of flexibility, it wasnâ€™t useful in practice.”…””}”(hj*Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjZh²hubhú)”}”(hXóFor example, as there is only one instance of each controller, utility type controllers such as freezer which can be useful in all hierarchies could only be used in one. The issue is exacerbated by the fact that controllers couldn't be moved to another hierarchy once hierarchies were populated. Another issue was that all controllers bound to a hierarchy were forced to have exactly the same view of the hierarchy. It wasn't possible to vary the granularity depending on the specific controller.”h]”hX÷For example, as there is only one instance of each controller, utility type controllers such as freezer which can be useful in all hierarchies could only be used in one. The issue is exacerbated by the fact that controllers couldnâ€™t be moved to another hierarchy once hierarchies were populated. Another issue was that all controllers bound to a hierarchy were forced to have exactly the same view of the hierarchy. It wasnâ€™t possible to vary the granularity depending on the specific controller.”…””}”(hj8Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjZh²hubhú)”}”(hXÔIn practice, these issues heavily limited which controllers could be put on the same hierarchy and most configurations resorted to putting each controller on its own hierarchy. Only closely related ones, such as the cpu and cpuacct controllers, made sense to be put on the same hierarchy. This often meant that userland ended up managing multiple similar hierarchies repeating the same steps on each hierarchy whenever a hierarchy management operation was necessary.”h]”hXÔIn practice, these issues heavily limited which controllers could be put on the same hierarchy and most configurations resorted to putting each controller on its own hierarchy. Only closely related ones, such as the cpu and cpuacct controllers, made sense to be put on the same hierarchy. This often meant that userland ended up managing multiple similar hierarchies repeating the same steps on each hierarchy whenever a hierarchy management operation was necessary.”…””}”(hjFZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hjZh²hubhú)”}”(hXFurthermore, support for multiple hierarchies came at a steep cost. It greatly complicated cgroup core implementation but more importantly the support for multiple hierarchies restricted how cgroup could be used in general and what controllers was able to do.”h]”hXFurthermore, support for multiple hierarchies came at a steep cost. It greatly complicated cgroup core implementation but more importantly the support for multiple hierarchies restricted how cgroup could be used in general and what controllers was able to do.”…””}”(hjTZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M# hjZh²hubhú)”}”(hXªThere was no limit on how many hierarchies there might be, which meant that a thread's cgroup membership couldn't be described in finite length. The key might contain any number of entries and was unlimited in length, which made it highly awkward to manipulate and led to addition of controllers which existed only to identify membership, which in turn exacerbated the original problem of proliferating number of hierarchies.”h]”hX®There was no limit on how many hierarchies there might be, which meant that a threadâ€™s cgroup membership couldnâ€™t be described in finite length. The key might contain any number of entries and was unlimited in length, which made it highly awkward to manipulate and led to addition of controllers which existed only to identify membership, which in turn exacerbated the original problem of proliferating number of hierarchies.”…””}”(hjbZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M( hjZh²hubhú)”}”(hXLAlso, as a controller couldn't have any expectation regarding the topologies of hierarchies other controllers might be on, each controller had to assume that all other controllers were attached to completely orthogonal hierarchies. This made it impossible, or at least very cumbersome, for controllers to cooperate with each other.”h]”hXNAlso, as a controller couldnâ€™t have any expectation regarding the topologies of hierarchies other controllers might be on, each controller had to assume that all other controllers were attached to completely orthogonal hierarchies. This made it impossible, or at least very cumbersome, for controllers to cooperate with each other.”…””}”(hjpZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M0 hjZh²hubhú)”}”(hXIn most use cases, putting controllers on hierarchies which are completely orthogonal to each other isn't necessary. What usually is called for is the ability to have differing levels of granularity depending on the specific controller. In other words, hierarchy may be collapsed from leaf towards root when viewed from specific controllers. For example, a given configuration might not care about how memory is distributed beyond a certain level while still wanting to control how CPU cycles are distributed.”h]”hXIn most use cases, putting controllers on hierarchies which are completely orthogonal to each other isnâ€™t necessary. What usually is called for is the ability to have differing levels of granularity depending on the specific controller. In other words, hierarchy may be collapsed from leaf towards root when viewed from specific controllers. For example, a given configuration might not care about how memory is distributed beyond a certain level while still wanting to control how CPU cycles are distributed.”…””}”(hj~Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M6 hjZh²hubeh}”(h]”Œmultiple-hierarchies”ah ]”h"]”Œmultiple hierarchies”ah$]”h&]”uh1hÄhjZh²hh³hÃh´M ubhÅ)”}”(hhh]”(hÊ)”}”(hŒThread Granularity”h]”hŒThread Granularity”…””}”(hj—Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj”Zh²hh³hÃh´MA ubhú)”}”(hXEcgroup v1 allowed threads of a process to belong to different cgroups. This didn't make sense for some controllers and those controllers ended up implementing different ways to ignore such situations but much more importantly it blurred the line between API exposed to individual applications and system management interface.”h]”hXGcgroup v1 allowed threads of a process to belong to different cgroups. This didnâ€™t make sense for some controllers and those controllers ended up implementing different ways to ignore such situations but much more importantly it blurred the line between API exposed to individual applications and system management interface.”…””}”(hj¥Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MC hj”Zh²hubhú)”}”(hŒòGenerally, in-process knowledge is available only to the process itself; thus, unlike service-level organization of processes, categorizing threads of a process requires active participation from the application which owns the target process.”h]”hŒòGenerally, in-process knowledge is available only to the process itself; thus, unlike service-level organization of processes, categorizing threads of a process requires active participation from the application which owns the target process.”…””}”(hj³Zh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MI hj”Zh²hubhú)”}”(hXjcgroup v1 had an ambiguously defined delegation model which got abused in combination with thread granularity. cgroups were delegated to individual applications so that they can create and manage their own sub-hierarchies and control resource distributions along them. This effectively raised cgroup to the status of a syscall-like API exposed to lay programs.”h]”hXjcgroup v1 had an ambiguously defined delegation model which got abused in combination with thread granularity. cgroups were delegated to individual applications so that they can create and manage their own sub-hierarchies and control resource distributions along them. This effectively raised cgroup to the status of a syscall-like API exposed to lay programs.”…””}”(hjÁZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MN hj”Zh²hubhú)”}”(hX)First of all, cgroup has a fundamentally inadequate interface to be exposed this way. For a process to access its own knobs, it has to extract the path on the target hierarchy from /proc/self/cgroup, construct the path by appending the name of the knob to the path, open and then read and/or write to it. This is not only extremely clunky and unusual but also inherently racy. There is no conventional way to define transaction across the required steps and nothing can guarantee that the process would actually be operating on its own sub-hierarchy.”h]”hX)First of all, cgroup has a fundamentally inadequate interface to be exposed this way. For a process to access its own knobs, it has to extract the path on the target hierarchy from /proc/self/cgroup, construct the path by appending the name of the knob to the path, open and then read and/or write to it. This is not only extremely clunky and unusual but also inherently racy. There is no conventional way to define transaction across the required steps and nothing can guarantee that the process would actually be operating on its own sub-hierarchy.”…””}”(hjÏZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MU hj”Zh²hubhú)”}”(hXcgroup controllers implemented a number of knobs which would never be accepted as public APIs because they were just adding control knobs to system-management pseudo filesystem. cgroup ended up with interface knobs which were not properly abstracted or refined and directly revealed kernel internal details. These knobs got exposed to individual applications through the ill-defined delegation mechanism effectively abusing cgroup as a shortcut to implementing public APIs without going through the required scrutiny.”h]”hXcgroup controllers implemented a number of knobs which would never be accepted as public APIs because they were just adding control knobs to system-management pseudo filesystem. cgroup ended up with interface knobs which were not properly abstracted or refined and directly revealed kernel internal details. These knobs got exposed to individual applications through the ill-defined delegation mechanism effectively abusing cgroup as a shortcut to implementing public APIs without going through the required scrutiny.”…””}”(hjÝZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M^ hj”Zh²hubhú)”}”(hŒ±This was painful for both userland and kernel. Userland ended up with misbehaving and poorly abstracted interfaces and kernel exposing and locked into constructs inadvertently.”h]”hŒ±This was painful for both userland and kernel. Userland ended up with misbehaving and poorly abstracted interfaces and kernel exposing and locked into constructs inadvertently.”…””}”(hjëZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mg hj”Zh²hubeh}”(h]”Œthread-granularity”ah ]”h"]”Œthread granularity”ah$]”h&]”uh1hÄhjZh²hh³hÃh´MA ubhÅ)”}”(hhh]”(hÊ)”}”(hŒ+Competition Between Inner Nodes and Threads”h]”hŒ+Competition Between Inner Nodes and Threads”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj[h²hh³hÃh´Mm ubhú)”}”(hXCcgroup v1 allowed threads to be in any cgroups which created an interesting problem where threads belonging to a parent cgroup and its children cgroups competed for resources. This was nasty as two different types of entities competed and there was no obvious way to settle it. Different controllers did different things.”h]”hXCcgroup v1 allowed threads to be in any cgroups which created an interesting problem where threads belonging to a parent cgroup and its children cgroups competed for resources. This was nasty as two different types of entities competed and there was no obvious way to settle it. Different controllers did different things.”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mo hj[h²hubhú)”}”(hXThe cpu controller considered threads and cgroups as equivalents and mapped nice levels to cgroup weights. This worked for some cases but fell flat when children wanted to be allocated specific ratios of CPU cycles and the number of internal threads fluctuated - the ratios constantly changed as the number of competing entities fluctuated. There also were other issues. The mapping from nice level to weight wasn't obvious or universal, and there were various other knobs which simply weren't available for threads.”h]”hX The cpu controller considered threads and cgroups as equivalents and mapped nice levels to cgroup weights. This worked for some cases but fell flat when children wanted to be allocated specific ratios of CPU cycles and the number of internal threads fluctuated - the ratios constantly changed as the number of competing entities fluctuated. There also were other issues. The mapping from nice level to weight wasnâ€™t obvious or universal, and there were various other knobs which simply werenâ€™t available for threads.”…””}”(hj [h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mu hj[h²hubhú)”}”(hX¤The io controller implicitly created a hidden leaf node for each cgroup to host the threads. The hidden leaf had its own copies of all the knobs with ``leaf_`` prefixed. While this allowed equivalent control over internal threads, it was with serious drawbacks. It always added an extra layer of nesting which wouldn't be necessary otherwise, made the interface messy and significantly complicated the implementation.”h]”(hŒ—The io controller implicitly created a hidden leaf node for each cgroup to host the threads. The hidden leaf had its own copies of all the knobs with ”…””}”(hj.[h²hh³Nh´Nubj)”}”(hŒ ``leaf_``”h]”hŒleaf_”…””}”(hj6[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj.[ubhX prefixed. While this allowed equivalent control over internal threads, it was with serious drawbacks. It always added an extra layer of nesting which wouldnâ€™t be necessary otherwise, made the interface messy and significantly complicated the implementation.”…””• N}”(hj.[h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M~ hj[h²hubhú)”}”(hXIThe memory controller didn't have a way to control what happened between internal tasks and child cgroups and the behavior was not clearly defined. There were attempts to add ad-hoc behaviors and knobs to tailor the behavior to specific workloads which would have led to problems extremely difficult to resolve in the long term.”h]”hXKThe memory controller didnâ€™t have a way to control what happened between internal tasks and child cgroups and the behavior was not clearly defined. There were attempts to add ad-hoc behaviors and knobs to tailor the behavior to specific workloads which would have led to problems extremely difficult to resolve in the long term.”…””}”(hjN[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M† hj[h²hubhú)”}”(hŒ÷Multiple controllers struggled with internal tasks and came up with different ways to deal with it; unfortunately, all the approaches were severely flawed and, furthermore, the widely different behaviors made cgroup as a whole highly inconsistent.”h]”hŒ÷Multiple controllers struggled with internal tasks and came up with different ways to deal with it; unfortunately, all the approaches were severely flawed and, furthermore, the widely different behaviors made cgroup as a whole highly inconsistent.”…””}”(hj\[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MŒ hj[h²hubhú)”}”(hŒXThis clearly is a problem which needs to be addressed from cgroup core in a uniform way.”h]”hŒXThis clearly is a problem which needs to be addressed from cgroup core in a uniform way.”…””}”(hjj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M‘ hj[h²hubeh}”(h]”Œ+competition-between-inner-nodes-and-threads”ah ]”h"]”Œ+competition between inner nodes and threads”ah$]”h&]”uh1hÄhjZh²hh³hÃh´Mm ubhÅ)”}”(hhh]”(hÊ)”}”(hŒOther Interface Issues”h]”hŒOther Interface Issues”…””}”(hjƒ[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhj€[h²hh³hÃh´M– ubhú)”}”(hX£cgroup v1 grew without oversight and developed a large number of idiosyncrasies and inconsistencies. One issue on the cgroup core side was how an empty cgroup was notified - a userland helper binary was forked and executed for each event. The event delivery wasn't recursive or delegatable. The limitations of the mechanism also led to in-kernel event delivery filtering mechanism further complicating the interface.”h]”hX¥cgroup v1 grew without oversight and developed a large number of idiosyncrasies and inconsistencies. One issue on the cgroup core side was how an empty cgroup was notified - a userland helper binary was forked and executed for each event. The event delivery wasnâ€™t recursive or delegatable. The limitations of the mechanism also led to in-kernel event delivery filtering mechanism further complicating the interface.”…””}”(hj‘[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M˜ hj€[h²hubhú)”}”(hX.Controller interfaces were problematic too. An extreme example is controllers completely ignoring hierarchical organization and treating all cgroups as if they were all located directly under the root cgroup. Some controllers exposed a large amount of inconsistent implementation details to userland.”h]”hX.Controller interfaces were problematic too. An extreme example is controllers completely ignoring hierarchical organization and treating all cgroups as if they were all located directly under the root cgroup. Some controllers exposed a large amount of inconsistent implementation details to userland.”…””}”(hjŸ[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M hj€[h²hubhú)”}”(hX¶There also was no consistency across controllers. When a new cgroup was created, some controllers defaulted to not imposing extra restrictions while others disallowed any resource usage until explicitly configured. Configuration knobs for the same type of control used widely differing naming schemes and formats. Statistics and information knobs were named arbitrarily and used different formats and units even in the same controller.”h]”hX¶There also was no consistency across controllers. When a new cgroup was created, some controllers defaulted to not imposing extra restrictions while others disallowed any resource usage until explicitly configured. Configuration knobs for the same type of control used widely differing naming schemes and formats. Statistics and information knobs were named arbitrarily and used different formats and units even in the same controller.”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¦ hj€[h²hubhú)”}”(hŒ‰cgroup v2 establishes common conventions where appropriate and updates controllers so that they expose minimal and consistent interfaces.”h]”hŒ‰cgroup v2 establishes common conventions where appropriate and updates controllers so that they expose minimal and consistent interfaces.”…””}”(hj»[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M® hj€[h²hubeh}”(h]”Œother-interface-issues”ah ]”h"]”Œother interface issues”ah$]”h&]”uh1hÄhjZh²hh³hÃh´M– ubhÅ)”}”(hhh]”(hÊ)”}”(hŒController Issues and Remedies”h]”hŒController Issues and Remedies”…””}”(hjÔ[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjÑ[h²hh³hÃh´M³ ubhÅ)”}”(hhh]”(hÊ)”}”(hŒMemory”h]”hŒMemory”…””}”(hjå[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjâ[h²hh³hÃh´M¶ ubhú)”}”(hX?The original lower boundary, the soft limit, is defined as a limit that is per default unset. As a result, the set of cgroups that global reclaim prefers is opt-in, rather than opt-out. The costs for optimizing these mostly negative lookups are so high that the implementation, despite its enormous size, does not even provide the basic desirable behavior. First off, the soft limit has no hierarchical meaning. All configured groups are organized in a global rbtree and treated like equal peers, regardless where they are located in the hierarchy. This makes subtree delegation impossible. Second, the soft limit reclaim pass is so aggressive that it not just introduces high allocation latencies into the system, but also impacts system performance due to overreclaim, to the point where the feature becomes self-defeating.”h]”hX?The original lower boundary, the soft limit, is defined as a limit that is per default unset. As a result, the set of cgroups that global reclaim prefers is opt-in, rather than opt-out. The costs for optimizing these mostly negative lookups are so high that the implementation, despite its enormous size, does not even provide the basic desirable behavior. First off, the soft limit has no hierarchical meaning. All configured groups are organized in a global rbtree and treated like equal peers, regardless where they are located in the hierarchy. This makes subtree delegation impossible. Second, the soft limit reclaim pass is so aggressive that it not just introduces high allocation latencies into the system, but also impacts system performance due to overreclaim, to the point where the feature becomes self-defeating.”…””}”(hjó[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M¸ hjâ[h²hubhú)”}”(hX The memory.low boundary on the other hand is a top-down allocated reserve. A cgroup enjoys reclaim protection when it's within its effective low, which makes delegation of subtrees possible. It also enjoys having reclaim pressure proportional to its overage when above its effective low.”h]”hX"The memory.low boundary on the other hand is a top-down allocated reserve. A cgroup enjoys reclaim protection when itâ€™s within its effective low, which makes delegation of subtrees possible. It also enjoys having reclaim pressure proportional to its overage when above its effective low.”…””}”(hj\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÆ hjâ[h²hubhú)”}”(hX‘The original high boundary, the hard limit, is defined as a strict limit that can not budge, even if the OOM killer has to be called. But this generally goes against the goal of making the most out of the available memory. The memory consumption of workloads varies during runtime, and that requires users to overcommit. But doing that with a strict upper limit requires either a fairly accurate prediction of the working set size or adding slack to the limit. Since working set size estimation is hard and error prone, and getting it wrong results in OOM kills, most users tend to err on the side of a looser limit and end up wasting precious resources.”h]”hX‘The original high boundary, the hard limit, is defined as a strict limit that can not budge, even if the OOM killer has to be called. But this generally goes against the goal of making the most out of the available memory. The memory consumption of workloads varies during runtime, and that requires users to overcommit. But doing that with a strict upper limit requires either a fairly accurate prediction of the working set size or adding slack to the limit. Since working set size estimation is hard and error prone, and getting it wrong results in OOM kills, most users tend to err on the side of a looser limit and end up wasting precious resources.”…””}”(hj\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´MÌ hjâ[h²hubhú)”}”(hXöThe memory.high boundary on the other hand can be set much more conservatively. When hit, it throttles allocations by forcing them into direct reclaim to work off the excess, but it never invokes the OOM killer. As a result, a high boundary that is chosen too aggressively will not terminate the processes, but instead it will lead to gradual performance degradation. The user can monitor this and make corrections until the minimal memory footprint that still gives acceptable performance is found.”h]”hXöThe memory.high boundary on the other hand can be set much more conservatively. When hit, it throttles allocations by forcing them into direct reclaim to work off the excess, but it never invokes the OOM killer. As a result, a high boundary that is chosen too aggressively will not terminate the processes, but instead it will lead to gradual performance degradation. The user can monitor this and make corrections until the minimal memory footprint that still gives acceptable performance is found.”…””}”(hj\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´M× hjâ[h²hubhú)”}”(hX¨In extreme cases, with many concurrent allocations and a complete breakdown of reclaim progress within the group, the high boundary can be exceeded. But even then it's mostly better to satisfy the allocation from the slack available in other groups or the rest of the system than killing the group. Otherwise, memory.max is there to limit this type of spillover and ultimately contain buggy or even malicious applications.”h]”hXªIn extreme cases, with many concurrent allocations and a complete breakdown of reclaim progress within the group, the high boundary can be exceeded. But even then itâ€™s mostly better to satisfy the allocation from the slack available in other groups or the rest of the system than killing the group. Otherwise, memory.max is there to limit this type of spillover and ultimately contain buggy or even malicious applications.”…””}”(hj+\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mà hjâ[h²hubhú)”}”(hXYSetting the original memory.limit_in_bytes below the current usage was subject to a race condition, where concurrent charges could cause the limit setting to fail. memory.max on the other hand will first set the limit to prevent new charges, and then reclaim and OOM kill until the new limit is met - or the task writing to memory.max is killed.”h]”hXYSetting the original memory.limit_in_bytes below the current usage was subject to a race condition, where concurrent charges could cause the limit setting to fail. memory.max on the other hand will first set the limit to prevent new charges, and then reclaim and OOM kill until the new limit is met - or the task writing to memory.max is killed.”…””}”(hj9\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mè hjâ[h²hubhú)”}”(hŒ]The combined memory+swap accounting and limiting is replaced by real control over swap space.”h]”hŒ]The combined memory+swap accounting and limiting is replaced by real control over swap space.”…””}”(hjG\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mî hjâ[h²hubhú)”}”(hXÍThe main argument for a combined memory+swap facility in the original cgroup design was that global or parental pressure would always be able to swap all anonymous memory of a child group, regardless of the child's own (possibly untrusted) configuration. However, untrusted groups can sabotage swapping by other means - such as referencing its anonymous memory in a tight loop - and an admin can not assume full swappability when overcommitting untrusted jobs.”h]”hXÏThe main argument for a combined memory+swap facility in the original cgroup design was that global or parental pressure would always be able to swap all anonymous memory of a child group, regardless of the childâ€™s own (possibly untrusted) configuration. However, untrusted groups can sabotage swapping by other means - such as referencing its anonymous memory in a tight loop - and an admin can not assume full swappability when overcommitting untrusted jobs.”…””}”(hjU\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mñ hjâ[h²hubhú)”}”(hXPFor trusted jobs, on the other hand, a combined counter is not an intuitive userspace interface, and it flies in the face of the idea that cgroup controllers should account and limit specific physical resources. Swap space is a resource like all others in the system, and that's why unified hierarchy allows distributing it separately.”h]”hXRFor trusted jobs, on the other hand, a combined counter is not an intuitive userspace interface, and it flies in the face of the idea that cgroup controllers should account and limit specific physical resources. Swap space is a resource like all others in the system, and thatâ€™s why unified hierarchy allows distributing it separately.”…””}”(hjc\h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùh³hÃh´Mù hjâ[h²hubeh}”(h]”Œid1”ah ]”h"]”h$]”j2ah&]”uh1hÄhjÑ[h²hh³hÃh´M¶ j¯2Kubeh}”(h]”Œcontroller-issues-and-remedies”ah ]”h"]”Œcontroller issues and remedies”ah$]”h&]”uh1hÄhjZh²hh³hÃh´M³ ubeh}”(h]”Œ$issues-with-v1-and-rationales-for-v2”ah ]”h"]”Œ$issues with v1 and rationales for v2”ah$]”h&]”uh1hÄhhÆh²hh³hÃh´M ubeh}”(h]”(Œcontrol-group-v2”hÂeh ]”h"]”(Œcontrol group v2”Œ cgroup-v2”eh$]”h&]”uh1hÄhhh²hh³hÃh´KjÅ }”jŽ\h·sjÇ }”hÂh·subeh}”(h]”h ]”h"]”h$]”h&]”Œsource”hÃuh1hŒcurrent_source”NŒcurrent_line”NŒsettings”Œdocutils.frontend”ŒValues”“”)”}”(hÉNŒ generator”NŒ datestamp”NŒsource_link”NŒ source_url”NŒ toc_backlinks”jGŒfootnote_backlinks”KŒ sectnum_xform”KŒstrip_comments”NŒstrip_elements_with_classes”NŒ strip_classes”NŒreport_level”KŒ halt_level”KŒexit_status_level”KŒdebug”NŒwarning_stream”NŒ traceback”ˆŒinput_encoding”Œ utf-8-sig”Œinput_encoding_error_handler”Œstrict”Œoutput_encoding”Œutf-8”Œoutput_encoding_error_handler”jµ\Œerror_encoding”Œutf-8”Œerror_encoding_error_handler”Œbackslashreplace”Œ language_code”Œen”Œrecord_dependencies”NŒconfig”NŒ id_prefix”hŒauto_id_prefix”Œid”Œ dump_settings”NŒdump_internals”NŒdump_transforms”NŒdump_pseudo_xml”NŒexpose_internals”NŒstrict_visitor”NŒ_disable_config”NŒ_source”hÃŒ_destination”NŒ _config_files”]”Œ7/var/lib/git/docbuild/linux/Documentation/docutils.conf”aŒfile_insertion_enabled”ˆŒraw_enabled”KŒline_length_limit”M'Œpep_references”NŒpep_base_url”Œhttps://peps.python.org/”Œpep_file_url_template”Œpep-%04d”Œrfc_references”NŒrfc_base_url”Œ&https://datatracker.ietf.org/doc/html/”Œ tab_width”KŒtrim_footnote_reference_space”‰Œsyntax_highlight”Œlong”Œsmart_quotes”ˆŒsmartquotes_locales”]”Œcharacter_level_inline_markup”‰Œdoctitle_xform”‰Œ docinfo_xform”KŒsectsubtitle_xform”‰Œ image_loading”Œlink”Œembed_stylesheet”‰Œcloak_email_addresses”ˆŒsection_self_link”‰Œenv”NubŒreporter”NŒindirect_targets”]”Œsubstitution_defs”}”Œsubstitution_names”}”Œrefnames”}”Œrefids”}”(hÂ]”h·aj_ ]”jU aj» ]”j± ajŽ]”j„auŒnameids”}”(jŽ\hÂj\jŠ\j6j3jÝjÚj.j+jê jç jxjuj¡jžj<j9j™j–jäjáj3j0jjj³j°jÚj×j+j(jQ jN j•j’jI jF jâ jß j— j” jÚ j× jejbje jb jÂ j_ jÁ j¾ jj» jjj]jZjpjmjÇjÄj_ j\ jhjejCVj@VjjŽjÿjüj÷jôŒmemory”NjÍ1jÊ1j2j 2ja2j^2j¤2j¡2jCjCj <j<jõ<jò<jF=jC=j´=j±=jb?j_?jþBjûBjÚDj×DjÒDjÏDjºKj·Kj²Kj¯KjLjLjûOjøOjóOjðOjzQjwQjrQjoQjúRj÷RjòRjïRjxUjuUjIUjFUjpUjmUj¸UjµUj°UjUj;Vj8VjVj Vj3Vj0VjXjXjëVjèVjžWj›Wj7Xj4XjˆXj…XjkYjhYjcYj`YjZjZj…\j‚\j‘ZjŽZjþZjûZj}[jz[jÎ[jË[j}\jz\uŒ nametypes”}”(jŽ\ˆj\‰j6‰jÝ‰j.‰jê ‰jx‰j¡‰j<‰j™‰jä‰j3‰j‰j³‰jÚ‰j+‰jQ ‰j•‰jI ‰jâ ‰j— ‰jÚ ‰je‰je ‰jÂ ˆjÁ ‰jˆj‰j]‰jp‰jÇ‰j_ ‰jh‰jCV‰jˆjÿ‰j÷‰jý\‰jÍ1‰j2‰ja2‰j¤2‰jC‰j <‰jõ<‰jF=‰j´=‰jb?‰jþB‰jÚD‰jÒD‰jºK‰j²K‰jL‰jûO‰jóO‰jzQ‰jrQ‰júR‰jòR‰jxU‰jIU‰jpU‰j¸U‰j°U‰j;V‰jV‰j3V‰jX‰jëV‰jžW‰j7X‰jˆX‰jkY‰jcY‰jZ‰j…\‰j‘Z‰jþZ‰j}[‰jÎ[‰j}\‰uh}”(hÂhÆjŠ\hÆj3j¨jÚj¹j+jàjç j9jujJjžj{j9jŒj–j?jáj¤j0jçjjøj°jj×j¶j(jÝjN j6j’jGjF j˜jß jT j” je j× jš jbjí jb j j_ jh j¾ jh j» jÉ jjÉ jZjjmjhjÄjyj\ jÊjejb j@VjsjŽjjüjjôjØj©2jjÊ1j‘j 2jÐ1j^2j2j¡2jd2jCj°2j<jÏ2jò<j<jC=jø<j±=jI=j_?j·=jûBje?j×Dj CjÏDjDCj·KjÝDj¯Kj EjLj½KjøOjLjðOj_LjwQjþOjoQjPj÷Rj}QjïRjœQjuUjýRjFUj8SjmUjLUjµUj{UjUjŒUj8Vj»Uj VjÚUj0VjVjXjFVjèVjWVj›WjîVj4Xj¡Wj…Xj:XjhYj“Xj`Yj²XjZjnYj‚\jZjŽZjZjûZj”Zjz[j[jË[j€[jz\jÑ[js\jâ[uŒ footnote_refs”}”Œ citation_refs”}”Œ autofootnotes”]”Œautofootnote_refs”]”Œsymbol_footnotes”]”Œsymbol_footnote_refs”]”Œ footnotes”]”Œ citations”]”Œautofootnote_start”KŒsymbol_footnote_start”KŒ id_counter”Œcollections”ŒCounter”“”}”jÃ\Ks…”R”Œparse_messages”]”hŒsystem_message”“”)”}”(hhh]”hú)”}”(hŒ)Duplicate implicit target name: "memory".”h]”hŒ-Duplicate implicit target name: â€œmemoryâ€.”…””}”(hj!]h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hùhj]ubah}”(h]”h ]”h"]”h$]”h&]”js\aŒlevel”KŒtype”ŒINFO”Œsource”hÃŒline”M¶ uh1j]hjâ[h²hh³hÃh´M¶ ubaŒtransform_messages”]”(j])”}”(hhh]”hú)”}”(hhh]”hŒ/Hyperlink target "cgroup-v2" is not referenced.”…””}”hj?]sbah}”(h]”h ]”h"]”h$]”h&]”uh1hùhj<]ubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”j7]Œsource”hÃŒline”Kuh1j]ubj])”}”(hhh]”hú)”}”(hhh]”hŒAHyperlink target "cgroupv2-limits-distributor" is not referenced.”…””}”hjY]sbah}”(h]”h ]”h"]”h$]”h&]”uh1hùhjV]ubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”j7]Œsource”hÃŒline”M«uh1j]ubj])”}”(hhh]”hú)”}”(hhh]”hŒFHyperlink target "cgroupv2-protections-distributor" is not referenced.”…””}”hjs]sbah}”(h]”h ]”h"]”h$]”h&]”uh1hùhjp]ubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”j7]Œsource”hÃŒline”M½uh1j]ubj])”}”(hhh]”hú)”}”(hhh]”hŒ3Hyperlink target "cgroup-v2-cpu" is not referenced.”…””}”hj]sbah}”(h]”h ]”h"]”h$]”h&]”uh1hùhjŠ]ubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”j7]Œsource”hÃŒline”MDuh1j]ubeŒtransformer”NŒinclude_log”]”Œ decoration”Nh²hub.