€•¯Y      Œsphinx.addnodes”Œdocument”“”)”}”(Œ	rawsource”Œ ”Œchildren”]”(Œtranslations”ŒLanguagesNode”“”)”}”(hhh]”(h Œpending_xref”“”)”}”(hhh]”Œdocutils.nodes”ŒText”“”ŒChinese (Simplified)”…””}”Œparent”hsbaŒ
attributes”}”(Œids”]”Œclasses”]”Œnames”]”Œdupnames”]”Œbackrefs”]”Œ	refdomain”Œstd”Œreftype”Œdoc”Œ	reftarget”Œ+/translations/zh_CN/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuŒtagname”hhhubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ+/translations/zh_TW/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ+/translations/it_IT/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ+/translations/ja_JP/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ+/translations/ko_KR/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubh)”}”(hhh]”hŒSpanish”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ	refdomain”h)Œreftype”h+Œ	reftarget”Œ+/translations/sp_SP/admin-guide/mm/numaperf”Œmodname”NŒ	classname”NŒrefexplicit”ˆuh1hhhubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h
hhŒ	_document”hŒsource”NŒline”NubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒNUMA Memory Performance”h]”hŒNUMA Memory Performance”…””}”(hh¨hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hh£hžhhŸŒE/var/lib/git/docbuild/linux/Documentation/admin-guide/mm/numaperf.rst”h Kubh¢)”}”(hhh]”(h§)”}”(hŒNUMA Locality”h]”hŒNUMA Locality”…””}”(hhºhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hh·hžhhŸh¶h KubhŒ	paragraph”“”)”}”(hX  Some platforms may have multiple types of memory attached to a compute
node. These disparate memory ranges may share some characteristics, such
as CPU cache coherence, but may have different performance. For example,
different media types and buses affect bandwidth and latency.”h]”hX  Some platforms may have multiple types of memory attached to a compute
node. These disparate memory ranges may share some characteristics, such
as CPU cache coherence, but may have different performance. For example,
different media types and buses affect bandwidth and latency.”…””}”(hhÊhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Khh·hžhubhÉ)”}”(hXþ  A system supports such heterogeneous memory by grouping each memory type
under different domains, or "nodes", based on locality and performance
characteristics.  Some memory may share the same node as a CPU, and others
are provided as memory only nodes. While memory only nodes do not provide
CPUs, they may still be local to one or more compute nodes relative to
other nodes. The following diagram shows one such example of two compute
nodes with local memory and a memory only node for each of compute node::”h]”hX  A system supports such heterogeneous memory by grouping each memory type
under different domains, or â€œnodesâ€, based on locality and performance
characteristics.  Some memory may share the same node as a CPU, and others
are provided as memory only nodes. While memory only nodes do not provide
CPUs, they may still be local to one or more compute nodes relative to
other nodes. The following diagram shows one such example of two compute
nodes with local memory and a memory only node for each of compute node:”…””}”(hhØhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Khh·hžhubhŒliteral_block”“”)”}”(hXe  +------------------+     +------------------+
| Compute Node 0   +-----+ Compute Node 1   |
| Local Node0 Mem  |     | Local Node1 Mem  |
+--------+---------+     +--------+---------+
         |                        |
+--------+---------+     +--------+---------+
| Slower Node2 Mem |     | Slower Node3 Mem |
+------------------+     +--------+---------+”h]”hXe  +------------------+     +------------------+
| Compute Node 0   +-----+ Compute Node 1   |
| Local Node0 Mem  |     | Local Node1 Mem  |
+--------+---------+     +--------+---------+
         |                        |
+--------+---------+     +--------+---------+
| Slower Node2 Mem |     | Slower Node3 Mem |
+------------------+     +--------+---------+”…””}”hhèsbah}”(h]”h ]”h"]”h$]”h&]”Œ	xml:space”Œpreserve”uh1hæhŸh¶h Khh·hžhubhÉ)”}”(hX  A "memory initiator" is a node containing one or more devices such as
CPUs or separate memory I/O devices that can initiate memory requests.
A "memory target" is a node containing one or more physical address
ranges accessible from one or more memory initiators.”h]”hX  A â€œmemory initiatorâ€ is a node containing one or more devices such as
CPUs or separate memory I/O devices that can initiate memory requests.
A â€œmemory targetâ€ is a node containing one or more physical address
ranges accessible from one or more memory initiators.”…””}”(hhøhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Khh·hžhubhÉ)”}”(hXõ  When multiple memory initiators exist, they may not all have the same
performance when accessing a given memory target. Each initiator-target
pair may be organized into different ranked access classes to represent
this relationship. The highest performing initiator to a given target
is considered to be one of that target's local initiators, and given
the highest access class, 0. Any given target may have one or more
local initiators, and any given initiator may have multiple local
memory targets.”h]”hX÷  When multiple memory initiators exist, they may not all have the same
performance when accessing a given memory target. Each initiator-target
pair may be organized into different ranked access classes to represent
this relationship. The highest performing initiator to a given target
is considered to be one of that targetâ€™s local initiators, and given
the highest access class, 0. Any given target may have one or more
local initiators, and any given initiator may have multiple local
memory targets.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K#hh·hžhubhÉ)”}”(hŒÔTo aid applications matching memory targets with their initiators, the
kernel provides symlinks to each other. The following example lists the
relationship for the access class "0" memory initiators and targets::”h]”hŒ×To aid applications matching memory targets with their initiators, the
kernel provides symlinks to each other. The following example lists the
relationship for the access class â€œ0â€ memory initiators and targets:”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K,hh·hžhubhç)”}”(hX  # symlinks -v /sys/devices/system/node/nodeX/access0/targets/
relative: /sys/devices/system/node/nodeX/access0/targets/nodeY -> ../../nodeY

# symlinks -v /sys/devices/system/node/nodeY/access0/initiators/
relative: /sys/devices/system/node/nodeY/access0/initiators/nodeX -> ../../nodeX”h]”hX  # symlinks -v /sys/devices/system/node/nodeX/access0/targets/
relative: /sys/devices/system/node/nodeX/access0/targets/nodeY -> ../../nodeY

# symlinks -v /sys/devices/system/node/nodeY/access0/initiators/
relative: /sys/devices/system/node/nodeY/access0/initiators/nodeX -> ../../nodeX”…””}”hj"  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h K0hh·hžhubhÉ)”}”(hXX  A memory initiator may have multiple memory targets in the same access
class. The target memory's initiators in a given class indicate the
nodes' access characteristics share the same performance relative to other
linked initiator nodes. Each target within an initiator's access class,
though, do not necessarily perform the same as each other.”h]”hX^  A memory initiator may have multiple memory targets in the same access
class. The target memoryâ€™s initiators in a given class indicate the
nodesâ€™ access characteristics share the same performance relative to other
linked initiator nodes. Each target within an initiatorâ€™s access class,
though, do not necessarily perform the same as each other.”…””}”(hj0  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K6hh·hžhubhÉ)”}”(hŒòThe access class "1" is used to allow differentiation between initiators
that are CPUs and hence suitable for generic task scheduling, and
IO initiators such as GPUs and NICs.  Unlike access class 0, only
nodes containing CPUs are considered.”h]”hŒöThe access class â€œ1â€ is used to allow differentiation between initiators
that are CPUs and hence suitable for generic task scheduling, and
IO initiators such as GPUs and NICs.  Unlike access class 0, only
nodes containing CPUs are considered.”…””}”(hj>  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K<hh·hžhubeh}”(h]”Œnuma-locality”ah ]”h"]”Œnuma locality”ah$]”h&]”uh1h¡hh£hžhhŸh¶h Kubh¢)”}”(hhh]”(h§)”}”(hŒNUMA Performance”h]”hŒNUMA Performance”…””}”(hjW  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjT  hžhhŸh¶h KBubhÉ)”}”(hXN  Applications may wish to consider which node they want their memory to
be allocated from based on the node's performance characteristics. If
the system provides these attributes, the kernel exports them under the
node sysfs hierarchy by appending the attributes directory under the
memory node's access class 0 initiators as follows::”h]”hXQ  Applications may wish to consider which node they want their memory to
be allocated from based on the nodeâ€™s performance characteristics. If
the system provides these attributes, the kernel exports them under the
node sysfs hierarchy by appending the attributes directory under the
memory nodeâ€™s access class 0 initiators as follows:”…””}”(hje  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h KDhjT  hžhubhç)”}”(hŒ2/sys/devices/system/node/nodeY/access0/initiators/”h]”hŒ2/sys/devices/system/node/nodeY/access0/initiators/”…””}”hjs  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h KJhjT  hžhubhÉ)”}”(hŒqThese attributes apply only when accessed from nodes that have the
are linked under the this access's initiators.”h]”hŒsThese attributes apply only when accessed from nodes that have the
are linked under the this accessâ€™s initiators.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h KLhjT  hžhubhÉ)”}”(hŒjThe performance characteristics the kernel provides for the local initiators
are exported are as follows::”h]”hŒiThe performance characteristics the kernel provides for the local initiators
are exported are as follows:”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h KOhjT  hžhubhç)”}”(hŒÈ# tree -P "read*|write*" /sys/devices/system/node/nodeY/access0/initiators/
/sys/devices/system/node/nodeY/access0/initiators/
|-- read_bandwidth
|-- read_latency
|-- write_bandwidth
`-- write_latency”h]”hŒÈ# tree -P "read*|write*" /sys/devices/system/node/nodeY/access0/initiators/
/sys/devices/system/node/nodeY/access0/initiators/
|-- read_bandwidth
|-- read_latency
|-- write_bandwidth
`-- write_latency”…””}”hj  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h KRhjT  hžhubhÉ)”}”(hŒ4The bandwidth attributes are provided in MiB/second.”h]”hŒ4The bandwidth attributes are provided in MiB/second.”…””}”(hj«  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h KYhjT  hžhubhÉ)”}”(hŒ3The latency attributes are provided in nanoseconds.”h]”hŒ3The latency attributes are provided in nanoseconds.”…””}”(hj¹  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K[hjT  hžhubhÉ)”}”(hŒXThe values reported here correspond to the rated latency and bandwidth
for the platform.”h]”hŒXThe values reported here correspond to the rated latency and bandwidth
for the platform.”…””}”(hjÇ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K]hjT  hžhubhÉ)”}”(hŒWAccess class 1 takes the same form but only includes values for CPU to
memory activity.”h]”hŒWAccess class 1 takes the same form but only includes values for CPU to
memory activity.”…””}”(hjÕ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K`hjT  hžhubeh}”(h]”Œnuma-performance”ah ]”h"]”Œnuma performance”ah$]”h&]”uh1h¡hh£hžhhŸh¶h KBubh¢)”}”(hhh]”(h§)”}”(hŒ
NUMA Cache”h]”hŒ
NUMA Cache”…””}”(hjî  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjë  hžhhŸh¶h KdubhÉ)”}”(hX½  System memory may be constructed in a hierarchy of elements with various
performance characteristics in order to provide large address space of
slower performing memory cached by a smaller higher performing memory. The
system physical addresses memory  initiators are aware of are provided
by the last memory level in the hierarchy. The system meanwhile uses
higher performing memory to transparently cache access to progressively
slower levels.”h]”hX½  System memory may be constructed in a hierarchy of elements with various
performance characteristics in order to provide large address space of
slower performing memory cached by a smaller higher performing memory. The
system physical addresses memory  initiators are aware of are provided
by the last memory level in the hierarchy. The system meanwhile uses
higher performing memory to transparently cache access to progressively
slower levels.”…””}”(hjü  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Kfhjë  hžhubhÉ)”}”(hŒèThe term "far memory" is used to denote the last level memory in the
hierarchy. Each increasing cache level provides higher performing
initiator access, and the term "near memory" represents the fastest
cache provided by the system.”h]”hŒðThe term â€œfar memoryâ€ is used to denote the last level memory in the
hierarchy. Each increasing cache level provides higher performing
initiator access, and the term â€œnear memoryâ€ represents the fastest
cache provided by the system.”…””}”(hj
  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Knhjë  hžhubhÉ)”}”(hXL  This numbering is different than CPU caches where the cache level (ex:
L1, L2, L3) uses the CPU-side view where each increased level is lower
performing. In contrast, the memory cache level is centric to the last
level memory, so the higher numbered cache level corresponds to  memory
nearer to the CPU, and further from far memory.”h]”hXL  This numbering is different than CPU caches where the cache level (ex:
L1, L2, L3) uses the CPU-side view where each increased level is lower
performing. In contrast, the memory cache level is centric to the last
level memory, so the higher numbered cache level corresponds to  memory
nearer to the CPU, and further from far memory.”…””}”(hj  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Kshjë  hžhubhÉ)”}”(hX>  The memory-side caches are not directly addressable by software. When
software accesses a system address, the system will return it from the
near memory cache if it is present. If it is not present, the system
accesses the next level of memory until there is either a hit in that
cache level, or it reaches far memory.”h]”hX>  The memory-side caches are not directly addressable by software. When
software accesses a system address, the system will return it from the
near memory cache if it is present. If it is not present, the system
accesses the next level of memory until there is either a hit in that
cache level, or it reaches far memory.”…””}”(hj&  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Kyhjë  hžhubhÉ)”}”(hX¢  An application does not need to know about caching attributes in order
to use the system. Software may optionally query the memory cache
attributes in order to maximize the performance out of such a setup.
If the system provides a way for the kernel to discover this information,
for example with ACPI HMAT (Heterogeneous Memory Attribute Table),
the kernel will append these attributes to the NUMA node memory target.”h]”hX¢  An application does not need to know about caching attributes in order
to use the system. Software may optionally query the memory cache
attributes in order to maximize the performance out of such a setup.
If the system provides a way for the kernel to discover this information,
for example with ACPI HMAT (Heterogeneous Memory Attribute Table),
the kernel will append these attributes to the NUMA node memory target.”…””}”(hj4  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h Khjë  hžhubhÉ)”}”(hŒlWhen the kernel first registers a memory cache with a node, the kernel
will create the following directory::”h]”hŒkWhen the kernel first registers a memory cache with a node, the kernel
will create the following directory:”…””}”(hjB  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K†hjë  hžhubhç)”}”(hŒ1/sys/devices/system/node/nodeX/memory_side_cache/”h]”hŒ1/sys/devices/system/node/nodeX/memory_side_cache/”…””}”hjP  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h K‰hjë  hžhubhÉ)”}”(hŒŽIf that directory is not present, the system either does not provide
a memory-side cache, or that information is not accessible to the kernel.”h]”hŒŽIf that directory is not present, the system either does not provide
a memory-side cache, or that information is not accessible to the kernel.”…””}”(hj^  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K‹hjë  hžhubhÉ)”}”(hŒPThe attributes for each level of cache is provided under its cache
level index::”h]”hŒOThe attributes for each level of cache is provided under its cache
level index:”…””}”(hjl  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h KŽhjë  hžhubhç)”}”(hŒª/sys/devices/system/node/nodeX/memory_side_cache/indexA/
/sys/devices/system/node/nodeX/memory_side_cache/indexB/
/sys/devices/system/node/nodeX/memory_side_cache/indexC/”h]”hŒª/sys/devices/system/node/nodeX/memory_side_cache/indexA/
/sys/devices/system/node/nodeX/memory_side_cache/indexB/
/sys/devices/system/node/nodeX/memory_side_cache/indexC/”…””}”hjz  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h K‘hjë  hžhubhÉ)”}”(hŒ Each cache level's directory provides its attributes. For example, the
following shows a single cache level and the attributes available for
software to query::”h]”hŒ¡Each cache levelâ€™s directory provides its attributes. For example, the
following shows a single cache level and the attributes available for
software to query:”…””}”(hjˆ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K•hjë  hžhubhç)”}”(hŒº# tree /sys/devices/system/node/node0/memory_side_cache/
/sys/devices/system/node/node0/memory_side_cache/
|-- index1
|   |-- indexing
|   |-- line_size
|   |-- size
|   `-- write_policy”h]”hŒº# tree /sys/devices/system/node/node0/memory_side_cache/
/sys/devices/system/node/node0/memory_side_cache/
|-- index1
|   |-- indexing
|   |-- line_size
|   |-- size
|   `-- write_policy”…””}”hj–  sbah}”(h]”h ]”h"]”h$]”h&]”höh÷uh1hæhŸh¶h K™hjë  hžhubhÉ)”}”(hŒ{The "indexing" will be 0 if it is a direct-mapped cache, and non-zero
for any other indexed based, multi-way associativity.”h]”hŒThe â€œindexingâ€ will be 0 if it is a direct-mapped cache, and non-zero
for any other indexed based, multi-way associativity.”…””}”(hj¤  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K¡hjë  hžhubhÉ)”}”(hŒTThe "line_size" is the number of bytes accessed from the next cache
level on a miss.”h]”hŒXThe â€œline_sizeâ€ is the number of bytes accessed from the next cache
level on a miss.”…””}”(hj²  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K¤hjë  hžhubhÉ)”}”(hŒ?The "size" is the number of bytes provided by this cache level.”h]”hŒCThe â€œsizeâ€ is the number of bytes provided by this cache level.”…””}”(hjÀ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K§hjë  hžhubhÉ)”}”(hŒTThe "write_policy" will be 0 for write-back, and non-zero for
write-through caching.”h]”hŒXThe â€œwrite_policyâ€ will be 0 for write-back, and non-zero for
write-through caching.”…””}”(hjÎ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K©hjë  hžhubeh}”(h]”Œ
numa-cache”ah ]”h"]”Œ
numa cache”ah$]”h&]”uh1h¡hh£hžhhŸh¶h Kdubh¢)”}”(hhh]”(h§)”}”(hŒSee Also”h]”hŒSee Also”…””}”(hjç  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¦hjä  hžhhŸh¶h K­ubhÉ)”}”(hŒT[1] https://www.uefi.org/sites/default/files/resources/ACPI_6_2.pdf
- Section 5.2.27”h]”(hŒ[1] ”…””}”(hjõ  hžhhŸNh NubhŒ	reference”“”)”}”(hŒ?https://www.uefi.org/sites/default/files/resources/ACPI_6_2.pdf”h]”hŒ?https://www.uefi.org/sites/default/files/resources/ACPI_6_2.pdf”…””}”(hjÿ  hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”j  uh1jý  hjõ  ubhŒ
- Section 5.2.27”…””}”(hjõ  hžhhŸNh Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÈhŸh¶h K¯hjä  hžhubeh}”(h]”Œsee-also”ah ]”h"]”Œsee also”ah$]”h&]”uh1h¡hh£hžhhŸh¶h K­ubeh}”(h]”Œnuma-memory-performance”ah ]”h"]”Œnuma memory performance”ah$]”h&]”uh1h¡hhhžhhŸh¶h Kubeh}”(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”Œentry”Œ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”jK  Œ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”}”Œnameids”}”(j%  j"  jQ  jN  jè  jå  já  jÞ  j  j  uŒ	nametypes”}”(j%  ‰jQ  ‰jè  ‰já  ‰j  ‰uh}”(j"  h£jN  h·jå  jT  jÞ  jë  j  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”“”}”…”R”Œparse_messages”]”Œtransform_messages”]”Œtransformer”NŒinclude_log”]”Œ
decoration”Nhžhub.