€•´\Œ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/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuŒtagname”hhh ubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/zh_TW/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/it_IT/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/ja_JP/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/ko_KR/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒPortuguese (Brazilian)”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/pt_BR/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒSpanish”…””}”hh–sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ"/translations/sp_SP/bpf/map_cpumap”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h hhŒ _document”hŒsource”NŒline”NubhŒcomment”“”)”}”(hŒ%SPDX-License-Identifier: GPL-2.0-only”h]”hŒ%SPDX-License-Identifier: GPL-2.0-only”…””}”hh·sbah}”(h]”h ]”h"]”h$]”h&]”Œ xml:space”Œpreserve”uh1hµhhh²hh³Œh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³ŒR/var/lib/git/docbuild/linux/Documentation/bpf/map_cpumap:11: ./kernel/bpf/cpumap.c”h´K hhØh²hubhý)”}”(hŒSAn example use-case for this map type is software based Receive Side Scaling (RSS).”h]”hŒSAn example use-case for this map type is software based Receive Side Scaling (RSS).”…””}”(hjMh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´KhhØh²hubhý)”}”(hŒóThe CPUMAP represents the CPUs in the system indexed as the map-key, and the map-value is the config setting (per CPUMAP entry). Each CPUMAP entry has a dedicated kernel thread bound to the given CPU to represent the remote CPU execution unit.”h]”hŒóThe CPUMAP represents the CPUs in the system indexed as the map-key, and the map-value is the config setting (per CPUMAP entry). Each CPUMAP entry has a dedicated kernel thread bound to the given CPU to represent the remote CPU execution unit.”…””}”(hj[h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´KhhØh²hubhý)”}”(hXüStarting from Linux kernel version 5.9 the CPUMAP can run a second XDP program on the remote CPU. This allows an XDP program to split its processing across multiple CPUs. For example, a scenario where the initial CPU (that sees/receives the packets) needs to do minimal packet processing and the remote CPU (to which the packet is directed) can afford to spend more cycles processing the frame. The initial CPU is where the XDP redirect program is executed. The remote CPU receives raw ``xdp_frame`` objects.”h]”(hXæStarting from Linux kernel version 5.9 the CPUMAP can run a second XDP program on the remote CPU. This allows an XDP program to split its processing across multiple CPUs. For example, a scenario where the initial CPU (that sees/receives the packets) needs to do minimal packet processing and the remote CPU (to which the packet is directed) can afford to spend more cycles processing the frame. The initial CPU is where the XDP redirect program is executed. The remote CPU receives raw ”…””}”(hjih²hh³Nh´Nubj)”}”(hŒ ``xdp_frame``”h]”hŒ xdp_frame”…””}”(hjqh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjiubhŒ objects.”…””}”(hjih²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´KhhØh²hubh×)”}”(hhh]”(hÜ)”}”(hŒUsage”h]”hŒUsage”…””}”(hjŒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj‰h²hh³hÇh´Kubh×)”}”(hhh]”(hÜ)”}”(hŒ Kernel BPF”h]”hŒ Kernel BPF”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhjšh²hh³hÇh´K ubh×)”}”(hhh]”(hÜ)”}”(hŒbpf_redirect_map()”h]”hŒbpf_redirect_map()”…””}”(hj®h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj«h²hh³hÇh´K"ubhŒ literal_block”“”)”}”(hŒ>long bpf_redirect_map(struct bpf_map *map, u32 key, u64 flags)”h]”hŒ>long bpf_redirect_map(struct bpf_map *map, u32 key, u64 flags)”…””}”hj¾sbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆŒforce”‰Œlanguage”Œc”Œhighlight_args”}”uh1j¼h³hÇh´K#hj«h²hubhý)”}”(hŒRedirect the packet to the endpoint referenced by ``map`` at index ``key``. For ``BPF_MAP_TYPE_CPUMAP`` this map contains references to CPUs.”h]”(hŒ2Redirect the packet to the endpoint referenced by ”…””}”(hjÑh²hh³Nh´Nubj)”}”(hŒ``map``”h]”hŒmap”…””}”(hjÙh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjÑubhŒ at index ”…””}”(hjÑh²hh³Nh´Nubj)”}”(hŒ``key``”h]”hŒkey”…””}”(hjëh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjÑubhŒ. For ”…””}”(hjÑh²hh³Nh´Nubj)”}”(hŒ``BPF_MAP_TYPE_CPUMAP``”h]”hŒBPF_MAP_TYPE_CPUMAP”…””}”(hjýh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjÑubhŒ& this map contains references to CPUs.”…””}”(hjÑh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K'hj«h²hubhý)”}”(hŒËThe lower two bits of ``flags`` are used as the return code if the map lookup fails. This is so that the return value can be one of the XDP program return codes up to ``XDP_TX``, as chosen by the caller.”h]”(hŒThe lower two bits of ”…””}”(hjh²hh³Nh´Nubj)”}”(hŒ ``flags``”h]”hŒflags”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjubhŒˆ are used as the return code if the map lookup fails. This is so that the return value can be one of the XDP program return codes up to ”…””}”(hjh²hh³Nh´Nubj)”}”(hŒ ``XDP_TX``”h]”hŒXDP_TX”…””}”(hj/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjubhŒ, as chosen by the caller.”…””}”(hjh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K*hj«h²hubeh}”(h]”Œbpf-redirect-map”ah ]”h"]”Œbpf_redirect_map()”ah$]”h&]”uh1hÖhjšh²hh³hÇh´K"ubeh}”(h]”Œ kernel-bpf”ah ]”h"]”Œ kernel bpf”ah$]”h&]”uh1hÖhj‰h²hh³hÇh´K ubh×)”}”(hhh]”(hÜ)”}”(hŒ User space”h]”hŒ User space”…””}”(hjZh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhjWh²hh³hÇh´K/ubhì)”}”(hŒßCPUMAP entries can only be updated/looked up/deleted from user space and not from an eBPF program. Trying to call these functions from a kernel eBPF program will result in the program failing to load and a verifier warning.”h]”hý)”}”(hŒßCPUMAP entries can only be updated/looked up/deleted from user space and not from an eBPF program. Trying to call these functions from a kernel eBPF program will result in the program failing to load and a verifier warning.”h]”hŒßCPUMAP entries can only be updated/looked up/deleted from user space and not from an eBPF program. Trying to call these functions from a kernel eBPF program will result in the program failing to load and a verifier warning.”…””}”(hjlh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K1hjhubah}”(h]”h ]”h"]”h$]”h&]”uh1hëhjWh²hh³hÇh´Nubh×)”}”(hhh]”(hÜ)”}”(hŒbpf_map_update_elem()”h]”hŒbpf_map_update_elem()”…””}”(hjƒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj€h²hh³hÇh´K6ubj½)”}”(hŒQint bpf_map_update_elem(int fd, const void *key, const void *value, __u64 flags);”h]”hŒQint bpf_map_update_elem(int fd, const void *key, const void *value, __u64 flags);”…””}”hj‘sbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´K7hj€h²hubhý)”}”(hŒ¼CPU entries can be added or updated using the ``bpf_map_update_elem()`` helper. This helper replaces existing elements atomically. The ``value`` parameter can be ``struct bpf_cpumap_val``.”h]”(hŒ.CPU entries can be added or updated using the ”…””}”(hj h²hh³Nh´Nubj)”}”(hŒ``bpf_map_update_elem()``”h]”hŒbpf_map_update_elem()”…””}”(hj¨h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj ubhŒ@ helper. This helper replaces existing elements atomically. The ”…””}”(hj h²hh³Nh´Nubj)”}”(hŒ ``value``”h]”hŒvalue”…””}”(hjºh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj ubhŒ parameter can be ”…””}”(hj h²hh³Nh´Nubj)”}”(hŒ``struct bpf_cpumap_val``”h]”hŒstruct bpf_cpumap_val”…””}”(hjÌh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj ubhŒ.”…””}”(hj h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K;hj€h²hubhŒ block_quote”“”)”}”(hŒð.. code-block:: c struct bpf_cpumap_val { __u32 qsize; /* queue size to remote target CPU */ union { int fd; /* prog fd on map write */ __u32 id; /* prog id on map read */ } bpf_prog; }; ”h]”j½)”}”(hŒÇstruct bpf_cpumap_val { __u32 qsize; /* queue size to remote target CPU */ union { int fd; /* prog fd on map write */ __u32 id; /* prog id on map read */ } bpf_prog; };”h]”hŒÇstruct bpf_cpumap_val { __u32 qsize; /* queue size to remote target CPU */ union { int fd; /* prog fd on map write */ __u32 id; /* prog id on map read */ } bpf_prog; };”…””}”hjêsbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´K?hjæubah}”(h]”h ]”h"]”h$]”h&]”uh1jäh³hÇh´K?hj€h²hubhŒdefinition_list”“”)”}”(hhh]”hŒdefinition_list_item”“”)”}”(hŒÖThe flags argument can be one of the following: - BPF_ANY: Create a new element or update an existing element. - BPF_NOEXIST: Create a new element only if it did not exist. - BPF_EXIST: Update an existing element. ”h]”(hŒterm”“”)”}”(hŒ/The flags argument can be one of the following:”h]”hŒ/The flags argument can be one of the following:”…””}”(hj h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÇh´KLhjubhŒ definition”“”)”}”(hhh]”hò)”}”(hhh]”(h÷)”}”(hŒint bpf_map_lookup_elem(int fd, const void *key, void *value);”h]”hŒ>int bpf_map_lookup_elem(int fd, const void *key, void *value);”…””}”hj™sbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´KPhjˆh²hubhý)”}”(hŒHCPU entries can be retrieved using the ``bpf_map_lookup_elem()`` helper.”h]”(hŒ'CPU entries can be retrieved using the ”…””}”(hj¨h²hh³Nh´Nubj)”}”(hŒ``bpf_map_lookup_elem()``”h]”hŒbpf_map_lookup_elem()”…””}”(hj°h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhj¨ubhŒ helper.”…””}”(hj¨h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´KThjˆh²hubeh}”(h]”Œbpf-map-lookup-elem”ah ]”h"]”Œbpf_map_lookup_elem()”ah$]”h&]”uh1hÖhjWh²hh³hÇh´KOubh×)”}”(hhh]”(hÜ)”}”(hŒbpf_map_delete_elem()”h]”hŒbpf_map_delete_elem()”…””}”(hjÓh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhjÐh²hh³hÇh´KXubj½)”}”(hŒ1int bpf_map_delete_elem(int fd, const void *key);”h]”hŒ1int bpf_map_delete_elem(int fd, const void *key);”…””}”hjásbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´KYhjÐh²hubhý)”}”(hŒ’CPU entries can be deleted using the ``bpf_map_delete_elem()`` helper. This helper will return 0 on success, or negative error in case of failure.”h]”(hŒ%CPU entries can be deleted using the ”…””}”(hjðh²hh³Nh´Nubj)”}”(hŒ``bpf_map_delete_elem()``”h]”hŒbpf_map_delete_elem()”…””}”(hjøh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjðubhŒT helper. This helper will return 0 on success, or negative error in case of failure.”…””}”(hjðh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K]hjÐh²hubeh}”(h]”Œbpf-map-delete-elem”ah ]”h"]”Œbpf_map_delete_elem()”ah$]”h&]”uh1hÖhjWh²hh³hÇh´KXubeh}”(h]”Œ user-space”ah ]”h"]”h$]”Œ user space”ah&]”uh1hÖhj‰h²hh³hÇh´K/Œ referenced”Kubeh}”(h]”Œusage”ah ]”h"]”Œusage”ah$]”h&]”uh1hÖhhØh²hh³hÇh´Kubh×)”}”(hhh]”(hÜ)”}”(hŒExamples”h]”hŒExamples”…””}”(hj,h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj)h²hh³hÇh´Kbubh×)”}”(hhh]”(hÜ)”}”(hŒKernel”h]”hŒKernel”…””}”(hj=h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj:h²hh³hÇh´Kdubhý)”}”(hŒ¤The following code snippet shows how to declare a ``BPF_MAP_TYPE_CPUMAP`` called ``cpu_map`` and how to redirect packets to a remote CPU using a round robin scheme.”h]”(hŒ2The following code snippet shows how to declare a ”…””}”(hjKh²hh³Nh´Nubj)”}”(hŒ``BPF_MAP_TYPE_CPUMAP``”h]”hŒBPF_MAP_TYPE_CPUMAP”…””}”(hjSh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjKubhŒ called ”…””}”(hjKh²hh³Nh´Nubj)”}”(hŒ ``cpu_map``”h]”hŒcpu_map”…””}”(hjeh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1jhjKubhŒH and how to redirect packets to a remote CPU using a round robin scheme.”…””}”(hjKh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´Kfhj:h²hubj½)”}”(hXÀstruct { __uint(type, BPF_MAP_TYPE_CPUMAP); __type(key, __u32); __type(value, struct bpf_cpumap_val); __uint(max_entries, 12); } cpu_map SEC(".maps"); struct { __uint(type, BPF_MAP_TYPE_ARRAY); __type(key, __u32); __type(value, __u32); __uint(max_entries, 12); } cpus_available SEC(".maps"); struct { __uint(type, BPF_MAP_TYPE_PERCPU_ARRAY); __type(key, __u32); __type(value, __u32); __uint(max_entries, 1); } cpus_iterator SEC(".maps"); SEC("xdp") int xdp_redir_cpu_round_robin(struct xdp_md *ctx) { __u32 key = 0; __u32 cpu_dest = 0; __u32 *cpu_selected, *cpu_iterator; __u32 cpu_idx; cpu_iterator = bpf_map_lookup_elem(&cpus_iterator, &key); if (!cpu_iterator) return XDP_ABORTED; cpu_idx = *cpu_iterator; *cpu_iterator += 1; if (*cpu_iterator == bpf_num_possible_cpus()) *cpu_iterator = 0; cpu_selected = bpf_map_lookup_elem(&cpus_available, &cpu_idx); if (!cpu_selected) return XDP_ABORTED; cpu_dest = *cpu_selected; if (cpu_dest >= bpf_num_possible_cpus()) return XDP_ABORTED; return bpf_redirect_map(&cpu_map, cpu_dest, 0); }”h]”hXÀstruct { __uint(type, BPF_MAP_TYPE_CPUMAP); __type(key, __u32); __type(value, struct bpf_cpumap_val); __uint(max_entries, 12); } cpu_map SEC(".maps"); struct { __uint(type, BPF_MAP_TYPE_ARRAY); __type(key, __u32); __type(value, __u32); __uint(max_entries, 12); } cpus_available SEC(".maps"); struct { __uint(type, BPF_MAP_TYPE_PERCPU_ARRAY); __type(key, __u32); __type(value, __u32); __uint(max_entries, 1); } cpus_iterator SEC(".maps"); SEC("xdp") int xdp_redir_cpu_round_robin(struct xdp_md *ctx) { __u32 key = 0; __u32 cpu_dest = 0; __u32 *cpu_selected, *cpu_iterator; __u32 cpu_idx; cpu_iterator = bpf_map_lookup_elem(&cpus_iterator, &key); if (!cpu_iterator) return XDP_ABORTED; cpu_idx = *cpu_iterator; *cpu_iterator += 1; if (*cpu_iterator == bpf_num_possible_cpus()) *cpu_iterator = 0; cpu_selected = bpf_map_lookup_elem(&cpus_available, &cpu_idx); if (!cpu_selected) return XDP_ABORTED; cpu_dest = *cpu_selected; if (cpu_dest >= bpf_num_possible_cpus()) return XDP_ABORTED; return bpf_redirect_map(&cpu_map, cpu_dest, 0); }”…””}”hj}sbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´Kihj:h²hubeh}”(h]”Œkernel”ah ]”h"]”Œkernel”ah$]”h&]”uh1hÖhj)h²hh³hÇh´Kdubh×)”}”(hhh]”(hÜ)”}”(hŒ User space”h]”hŒ User space”…””}”(hj—h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhj”h²hh³hÇh´Kubhý)”}”(hŒ‡The following code snippet shows how to dynamically set the max_entries for a CPUMAP to the max number of cpus available on the system.”h]”hŒ‡The following code snippet shows how to dynamically set the max_entries for a CPUMAP to the max number of cpus available on the system.”…””}”(hj¥h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´KŸhj”h²hubj½)”}”(hXint set_max_cpu_entries(struct bpf_map *cpu_map) { if (bpf_map__set_max_entries(cpu_map, libbpf_num_possible_cpus()) < 0) { fprintf(stderr, "Failed to set max entries for cpu_map map: %s", strerror(errno)); return -1; } return 0; }”h]”hXint set_max_cpu_entries(struct bpf_map *cpu_map) { if (bpf_map__set_max_entries(cpu_map, libbpf_num_possible_cpus()) < 0) { fprintf(stderr, "Failed to set max entries for cpu_map map: %s", strerror(errno)); return -1; } return 0; }”…””}”hj³sbah}”(h]”h ]”h"]”h$]”h&]”hÅhÆj̉jÍjÎjÏ}”uh1j¼h³hÇh´K¢hj”h²hubeh}”(h]”Œid1”ah ]”h"]”h$]”jah&]”uh1hÖhj)h²hh³hÇh´Kj Kubeh}”(h]”Œexamples”ah ]”h"]”Œexamples”ah$]”h&]”uh1hÖhhØh²hh³hÇh´Kbubh×)”}”(hhh]”(hÜ)”}”(hŒ References”h]”hŒ References”…””}”(hjÔh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÛhjÑh²hh³hÇh´K¯ubhò)”}”(hhh]”h÷)”}”(hŒuhttps://developers.redhat.com/blog/2021/05/13/receive-side-scaling-rss-with-ebpf-and-cpumap#redirecting_into_a_cpumap”h]”hý)”}”(hjçh]”hŒ reference”“”)”}”(hjçh]”hŒuhttps://developers.redhat.com/blog/2021/05/13/receive-side-scaling-rss-with-ebpf-and-cpumap#redirecting_into_a_cpumap”…””}”(hjîh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”jçuh1jìhjéubah}”(h]”h ]”h"]”h$]”h&]”uh1hüh³hÇh´K±hjåubah}”(h]”h ]”h"]”h$]”h&]”uh1höhjâh²hh³hÇh´Nubah}”(h]”h ]”h"]”h$]”h&]”j'j(uh1hñh³hÇh´K±hjÑh²hubeh}”(h]”Œ references”ah ]”h"]”Œ references”ah$]”h&]”uh1hÖhhØh²hh³hÇh´K¯ubeh}”(h]”Œbpf-map-type-cpumap”ah ]”h"]”Œbpf_map_type_cpumap”ah$]”h&]”uh1hÖhhh²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”jAŒ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”}”(jjj&j#jTjQjLjIŒ user space”Nj…j‚jÍjÊjjjÎjËj‘jŽjjuŒ nametypes”}”(j‰j&‰jT‰jL‰j…‰j…‰j͉j‰jΉj‘‰j‰uh}”(jhØj#j‰jQjšjIj«jjWj‚j€jÊjˆjjÐjËj)jŽj:jÄj”jjÑ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”“”}”jOKs…”R”Œparse_messages”]”hŒsystem_message”“”)”}”(hhh]”hý)”}”(hŒ-Duplicate implicit target name: "user space".”h]”hŒ1Duplicate implicit target name: “user spaceâ€.”…””}”(hj©h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hühj¦ubah}”(h]”h ]”h"]”h$]”h&]”jÄaŒlevel”KŒtype”ŒINFO”Œsource”hÇŒline”Kuh1j¤hj”h²hh³hÇh´KubaŒtransform_messages”]”Œ transformer”NŒ include_log”]”Œ decoration”Nh²hub.