csphinx.addnodesdocument)}( rawsourcechildren]( translations LanguagesNode)}(hhh](h pending_xref)}(hhh]docutils.nodesTextChinese (Simplified)}parenthsba attributes}(ids]classes]names]dupnames]backrefs] refdomainstdreftypedoc reftarget%/translations/zh_CN/filesystems/ubifsmodnameN classnameN refexplicitutagnamehhh ubh)}(hhh]hChinese (Traditional)}hh2sbah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget%/translations/zh_TW/filesystems/ubifsmodnameN classnameN refexplicituh1hhh ubh)}(hhh]hItalian}hhFsbah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget%/translations/it_IT/filesystems/ubifsmodnameN classnameN refexplicituh1hhh ubh)}(hhh]hJapanese}hhZsbah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget%/translations/ja_JP/filesystems/ubifsmodnameN classnameN refexplicituh1hhh ubh)}(hhh]hKorean}hhnsbah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget%/translations/ko_KR/filesystems/ubifsmodnameN classnameN refexplicituh1hhh ubh)}(hhh]hSpanish}hhsbah}(h]h ]h"]h$]h&] refdomainh)reftypeh+ reftarget%/translations/sp_SP/filesystems/ubifsmodnameN classnameN refexplicituh1hhh ubeh}(h]h ]h"]h$]h&]current_languageEnglishuh1h hh _documenthsourceNlineNubhcomment)}(h SPDX-License-Identifier: GPL-2.0h]h SPDX-License-Identifier: GPL-2.0}hhsbah}(h]h ]h"]h$]h&] xml:spacepreserveuh1hhhhhh?/var/lib/git/docbuild/linux/Documentation/filesystems/ubifs.rsthKubhsection)}(hhh](htitle)}(hUBI File Systemh]hUBI File System}(hhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhhhhhKubh)}(hhh](h)}(h Introductionh]h Introduction}(hhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhhhhhKubh paragraph)}(hXUBIFS file-system stands for UBI File System. UBI stands for "Unsorted Block Images". UBIFS is a flash file system, which means it is designed to work with flash devices. It is important to understand, that UBIFS is completely different to any traditional file-system in Linux, like Ext2, XFS, JFS, etc. UBIFS represents a separate class of file-systems which work with MTD devices, not block devices. The other Linux file-system of this class is JFFS2.h]hXUBIFS file-system stands for UBI File System. UBI stands for “Unsorted Block Images”. UBIFS is a flash file system, which means it is designed to work with flash devices. It is important to understand, that UBIFS is completely different to any traditional file-system in Linux, like Ext2, XFS, JFS, etc. UBIFS represents a separate class of file-systems which work with MTD devices, not block devices. The other Linux file-system of this class is JFFS2.}(hhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK hhhhubh)}(hSTo make it more clear, here is a small comparison of MTD devices and block devices.h]hSTo make it more clear, here is a small comparison of MTD devices and block devices.}(hhhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhhhhubhdefinition_list)}(hhh](hdefinition_list_item)}(h1 MTD devices represent flash devices and they consist of eraseblocks of rather large size, typically about 128KiB. Block devices consist of small blocks, typically 512 bytes.h](hterm)}(hH1 MTD devices represent flash devices and they consist of eraseblocks ofh]hH1 MTD devices represent flash devices and they consist of eraseblocks of}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhhubh definition)}(hhh]h)}(hfrather large size, typically about 128KiB. Block devices consist of small blocks, typically 512 bytes.h]hfrather large size, typically about 128KiB. Block devices consist of small blocks, typically 512 bytes.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhhubeh}(h]h ]h"]h$]h&]uh1hhhhKhhubh)}(h2 MTD devices support 3 main operations - read from some offset within an eraseblock, write to some offset within an eraseblock, and erase a whole eraseblock. Block devices support 2 main operations - read a whole block and write a whole block.h](j)}(hI2 MTD devices support 3 main operations - read from some offset within anh]hI2 MTD devices support 3 main operations - read from some offset within an}(hj6hhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhj2ubj)}(hhh]h)}(heraseblock, write to some offset within an eraseblock, and erase a whole eraseblock. Block devices support 2 main operations - read a whole block and write a whole block.h]heraseblock, write to some offset within an eraseblock, and erase a whole eraseblock. Block devices support 2 main operations - read a whole block and write a whole block.}(hjGhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjDubah}(h]h ]h"]h$]h&]uh1jhj2ubeh}(h]h ]h"]h$]h&]uh1hhhhKhhhhubh)}(h{3 The whole eraseblock has to be erased before it becomes possible to re-write its contents. Blocks may be just re-written.h](j)}(hE3 The whole eraseblock has to be erased before it becomes possible toh]hE3 The whole eraseblock has to be erased before it becomes possible to}(hjehhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhjaubj)}(hhh]h)}(h5re-write its contents. Blocks may be just re-written.h]h5re-write its contents. Blocks may be just re-written.}(hjvhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjsubah}(h]h ]h"]h$]h&]uh1jhjaubeh}(h]h ]h"]h$]h&]uh1hhhhKhhhhubh)}(h4 Eraseblocks become worn out after some number of erase cycles - typically 100K-1G for SLC NAND and NOR flashes, and 1K-10K for MLC NAND flashes. Blocks do not have the wear-out property.h](j)}(hA4 Eraseblocks become worn out after some number of erase cycles -h]hA4 Eraseblocks become worn out after some number of erase cycles -}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhKhjubj)}(hhh]h)}(hztypically 100K-1G for SLC NAND and NOR flashes, and 1K-10K for MLC NAND flashes. Blocks do not have the wear-out property.h]hztypically 100K-1G for SLC NAND and NOR flashes, and 1K-10K for MLC NAND flashes. Blocks do not have the wear-out property.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1hhhhKhhhhubh)}(h5 Eraseblocks may become bad (only on NAND flashes) and software should deal with this. Blocks on hard drives typically do not become bad, because hardware has mechanisms to substitute bad blocks, at least in modern LBA disks. h](j)}(hG5 Eraseblocks may become bad (only on NAND flashes) and software shouldh]hG5 Eraseblocks may become bad (only on NAND flashes) and software should}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1jhhhK$hjubj)}(hhh]h)}(hdeal with this. Blocks on hard drives typically do not become bad, because hardware has mechanisms to substitute bad blocks, at least in modern LBA disks.h]hdeal with this. Blocks on hard drives typically do not become bad, because hardware has mechanisms to substitute bad blocks, at least in modern LBA disks.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK"hjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1hhhhK$hhhhubeh}(h]h ]h"]h$]h&]uh1hhhhhhhhNubh)}(hSIt should be quite obvious why UBIFS is very different to traditional file-systems.h]hSIt should be quite obvious why UBIFS is very different to traditional file-systems.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK&hhhhubh)}(hXUBIFS works on top of UBI. UBI is a separate software layer which may be found in drivers/mtd/ubi. UBI is basically a volume management and wear-leveling layer. It provides so called UBI volumes which is a higher level abstraction than a MTD device. The programming model of UBI devices is very similar to MTD devices - they still consist of large eraseblocks, they have read/write/erase operations, but UBI devices are devoid of limitations like wear and bad blocks (items 4 and 5 in the above list).h]hXUBIFS works on top of UBI. UBI is a separate software layer which may be found in drivers/mtd/ubi. UBI is basically a volume management and wear-leveling layer. It provides so called UBI volumes which is a higher level abstraction than a MTD device. The programming model of UBI devices is very similar to MTD devices - they still consist of large eraseblocks, they have read/write/erase operations, but UBI devices are devoid of limitations like wear and bad blocks (items 4 and 5 in the above list).}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK)hhhhubh)}(hIn a sense, UBIFS is a next generation of JFFS2 file-system, but it is very different and incompatible to JFFS2. The following are the main differences.h]hIn a sense, UBIFS is a next generation of JFFS2 file-system, but it is very different and incompatible to JFFS2. The following are the main differences.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK1hhhhubh bullet_list)}(hhh](h list_item)}(hXJFFS2 works on top of MTD devices, UBIFS depends on UBI and works on top of UBI volumes.h]h)}(hXJFFS2 works on top of MTD devices, UBIFS depends on UBI and works on top of UBI volumes.h]hXJFFS2 works on top of MTD devices, UBIFS depends on UBI and works on top of UBI volumes.}(hj)hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK5hj%ubah}(h]h ]h"]h$]h&]uh1j#hj hhhhhNubj$)}(hJFFS2 does not have on-media index and has to build it while mounting, which requires full media scan. UBIFS maintains the FS indexing information on the flash media and does not require full media scan, so it mounts many times faster than JFFS2.h]h)}(hJFFS2 does not have on-media index and has to build it while mounting, which requires full media scan. UBIFS maintains the FS indexing information on the flash media and does not require full media scan, so it mounts many times faster than JFFS2.h]hJFFS2 does not have on-media index and has to build it while mounting, which requires full media scan. UBIFS maintains the FS indexing information on the flash media and does not require full media scan, so it mounts many times faster than JFFS2.}(hjAhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK7hj=ubah}(h]h ]h"]h$]h&]uh1j#hj hhhhhNubj$)}(hpJFFS2 is a write-through file-system, while UBIFS supports write-back, which makes UBIFS much faster on writes. h]h)}(hoJFFS2 is a write-through file-system, while UBIFS supports write-back, which makes UBIFS much faster on writes.h]hoJFFS2 is a write-through file-system, while UBIFS supports write-back, which makes UBIFS much faster on writes.}(hjYhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK;hjUubah}(h]h ]h"]h$]h&]uh1j#hj hhhhhNubeh}(h]h ]h"]h$]h&]bullet*uh1jhhhK5hhhhubh)}(hzSimilarly to JFFS2, UBIFS supports on-the-fly compression which makes it possible to fit quite a lot of data to the flash.h]hzSimilarly to JFFS2, UBIFS supports on-the-fly compression which makes it possible to fit quite a lot of data to the flash.}(hjuhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK>hhhhubh)}(hSimilarly to JFFS2, UBIFS is tolerant of unclean reboots and power-cuts. It does not need stuff like fsck.ext2. UBIFS automatically replays its journal and recovers from crashes, ensuring that the on-flash data structures are consistent.h]hSimilarly to JFFS2, UBIFS is tolerant of unclean reboots and power-cuts. It does not need stuff like fsck.ext2. UBIFS automatically replays its journal and recovers from crashes, ensuring that the on-flash data structures are consistent.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKAhhhhubh)}(hXUBIFS scales logarithmically (most of the data structures it uses are trees), so the mount time and memory consumption do not linearly depend on the flash size, like in case of JFFS2. This is because UBIFS maintains the FS index on the flash media. However, UBIFS depends on UBI, which scales linearly. So overall UBI/UBIFS stack scales linearly. Nevertheless, UBI/UBIFS scales considerably better than JFFS2.h]hXUBIFS scales logarithmically (most of the data structures it uses are trees), so the mount time and memory consumption do not linearly depend on the flash size, like in case of JFFS2. This is because UBIFS maintains the FS index on the flash media. However, UBIFS depends on UBI, which scales linearly. So overall UBI/UBIFS stack scales linearly. Nevertheless, UBI/UBIFS scales considerably better than JFFS2.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKFhhhhubh)}(hThe authors of UBIFS believe, that it is possible to develop UBI2 which would scale logarithmically as well. UBI2 would support the same API as UBI, but it would be binary incompatible to UBI. So UBIFS would not need to be changed to use UBI2h]hThe authors of UBIFS believe, that it is possible to develop UBI2 which would scale logarithmically as well. UBI2 would support the same API as UBI, but it would be binary incompatible to UBI. So UBIFS would not need to be changed to use UBI2}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKMhhhhubeh}(h] introductionah ]h"] introductionah$]h&]uh1hhhhhhhhKubh)}(hhh](h)}(h Mount optionsh]h Mount options}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhKTubh)}(h(*) == default.h]h(*) == default.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKVhjhhubhtable)}(hhh]htgroup)}(hhh](hcolspec)}(hhh]h}(h]h ]h"]h$]h&]colwidthKuh1jhjubj)}(hhh]h}(h]h ]h"]h$]h&]colwidthK7uh1jhjubhtbody)}(hhh](hrow)}(hhh](hentry)}(hhh]h)}(h bulk_readh]h bulk_read}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKYhjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh]h)}(hRread more in one go to take advantage of flash media that read faster sequentiallyh]hRread more in one go to take advantage of flash media that read faster sequentially}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKYhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(hno_bulk_read (*)h]hno_bulk_read (*)}(hj:hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK[hj7ubah}(h]h ]h"]h$]h&]uh1jhj4ubj)}(hhh]h)}(hdo not bulk-readh]hdo not bulk-read}(hjQhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK[hjNubah}(h]h ]h"]h$]h&]uh1jhj4ubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(hno_chk_data_crc (*)h]hno_chk_data_crc (*)}(hjqhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK\hjnubah}(h]h ]h"]h$]h&]uh1jhjkubj)}(hhh]h)}(hskip checking of CRCs on data nodes in order to improve read performance. Use this option only if the flash media is highly reliable. The effect of this option is that corruption of the contents of a file can go unnoticed.h]hskip checking of CRCs on data nodes in order to improve read performance. Use this option only if the flash media is highly reliable. The effect of this option is that corruption of the contents of a file can go unnoticed.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhK\hjubah}(h]h ]h"]h$]h&]uh1jhjkubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(h chk_data_crch]h chk_data_crc}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKahjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh]h)}(h'do not skip checking CRCs on data nodesh]h'do not skip checking CRCs on data nodes}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKahjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(h compr=noneh]h compr=none}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKbhjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh]h)}(h0override default compressor and set it to "none"h]h4override default compressor and set it to “none”}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKbhjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(h compr=lzoh]h compr=lzo}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKchjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh]h)}(h/override default compressor and set it to "lzo"h]h3override default compressor and set it to “lzo”}(hj-hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKchj*ubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(h compr=zlibh]h compr=zlib}(hjMhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKdhjJubah}(h]h ]h"]h$]h&]uh1jhjGubj)}(hhh]h)}(h0override default compressor and set it to "zlib"h]h4override default compressor and set it to “zlib”}(hjdhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKdhjaubah}(h]h ]h"]h$]h&]uh1jhjGubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(h auth_key=h]h auth_key=}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKehjubah}(h]h ]h"]h$]h&]uh1jhj~ubj)}(hhh]h)}(hspecify the key used for authenticating the filesystem. Passing this option makes authentication mandatory. The passed key must be present in the kernel keyring and must be of type 'logon'h]hspecify the key used for authenticating the filesystem. Passing this option makes authentication mandatory. The passed key must be present in the kernel keyring and must be of type ‘logon’}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKehjubah}(h]h ]h"]h$]h&]uh1jhj~ubeh}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh](j)}(hhh]h)}(hauth_hash_name=h]hauth_hash_name=}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKihjubah}(h]h ]h"]h$]h&]uh1jhjubj)}(hhh]h)}(hThe hash algorithm used for authentication. Used for both hashing and for creating HMACs. Typical values include "sha256" or "sha512"h]hThe hash algorithm used for authentication. Used for both hashing and for creating HMACs. Typical values include “sha256” or “sha512”}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKihjubah}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]uh1jhjubeh}(h]h ]h"]h$]h&]colsKuh1jhjubah}(h]h ]h"]h$]h&]uh1jhjhhhhhNubeh}(h] mount-optionsah ]h"] mount optionsah$]h&]uh1hhhhhhhhKTubh)}(hhh](h)}(hQuick usage instructionsh]hQuick usage instructions}(hj hhhNhNubah}(h]h ]h"]h$]h&]uh1hhjhhhhhKpubh)}(hThe UBI volume to mount is specified using "ubiX_Y" or "ubiX:NAME" syntax, where "X" is UBI device number, "Y" is UBI volume number, and "NAME" is UBI volume name.h]hThe UBI volume to mount is specified using “ubiX_Y” or “ubiX:NAME” syntax, where “X” is UBI device number, “Y” is UBI volume number, and “NAME” is UBI volume name.}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKrhjhhubh)}(h.Mount volume 0 on UBI device 0 to /mnt/ubifs::h]h-Mount volume 0 on UBI device 0 to /mnt/ubifs:}(hj&hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKvhjhhubh literal_block)}(h"$ mount -t ubifs ubi0_0 /mnt/ubifsh]h"$ mount -t ubifs ubi0_0 /mnt/ubifs}hj6sbah}(h]h ]h"]h$]h&]hhuh1j4hhhKxhjhhubh)}(hOMount "rootfs" volume of UBI device 0 to /mnt/ubifs ("rootfs" is volume name)::h]hVMount “rootfs” volume of UBI device 0 to /mnt/ubifs (“rootfs” is volume name):}(hjDhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKzhjhhubj5)}(h'$ mount -t ubifs ubi0:rootfs /mnt/ubifsh]h'$ mount -t ubifs ubi0:rootfs /mnt/ubifs}hjRsbah}(h]h ]h"]h$]h&]hhuh1j4hhhK}hjhhubh)}(hThe following is an example of the kernel boot arguments to attach mtd0 to UBI and mount volume "rootfs": ubi.mtd=0 root=ubi0:rootfs rootfstype=ubifsh]hThe following is an example of the kernel boot arguments to attach mtd0 to UBI and mount volume “rootfs”: ubi.mtd=0 root=ubi0:rootfs rootfstype=ubifs}(hj`hhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjhhubeh}(h]quick-usage-instructionsah ]h"]quick usage instructionsah$]h&]uh1hhhhhhhhKpubh)}(hhh](h)}(h Referencesh]h References}(hjyhhhNhNubah}(h]h ]h"]h$]h&]uh1hhjvhhhhhKubh)}(h6UBIFS documentation and FAQ/HOWTO at the MTD web site:h]h6UBIFS documentation and FAQ/HOWTO at the MTD web site:}(hjhhhNhNubah}(h]h ]h"]h$]h&]uh1hhhhKhjvhhubj)}(hhh](j$)}(h1http://www.linux-mtd.infradead.org/doc/ubifs.htmlh]h)}(hjh]h reference)}(hjh]h1http://www.linux-mtd.infradead.org/doc/ubifs.html}(hjhhhNhNubah}(h]h ]h"]h$]h&]refurijuh1jhjubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1j#hjhhhhhNubj$)}(h1http://www.linux-mtd.infradead.org/faq/ubifs.htmlh]h)}(hjh]j)}(hjh]h1http://www.linux-mtd.infradead.org/faq/ubifs.html}(hjhhhNhNubah}(h]h ]h"]h$]h&]refurijuh1jhjubah}(h]h ]h"]h$]h&]uh1hhhhKhjubah}(h]h ]h"]h$]h&]uh1j#hjhhhhhNubeh}(h]h ]h"]h$]h&]js-uh1jhhhKhjvhhubeh}(h] referencesah ]h"] referencesah$]h&]uh1hhhhhhhhKubeh}(h]ubi-file-systemah ]h"]ubi file systemah$]h&]uh1hhhhhhhhKubeh}(h]h ]h"]h$]h&]sourcehuh1hcurrent_sourceN current_lineNsettingsdocutils.frontendValues)}(hN generatorN datestampN source_linkN source_urlN toc_backlinksjfootnote_backlinksK sectnum_xformKstrip_commentsNstrip_elements_with_classesN strip_classesN report_levelK halt_levelKexit_status_levelKdebugNwarning_streamN tracebackinput_encoding utf-8-siginput_encoding_error_handlerstrictoutput_encodingutf-8output_encoding_error_handlerjerror_encodingutf-8error_encoding_error_handlerbackslashreplace language_codeenrecord_dependenciesNconfigN id_prefixhauto_id_prefixid dump_settingsNdump_internalsNdump_transformsNdump_pseudo_xmlNexpose_internalsNstrict_visitorN_disable_configN_sourceh _destinationN _config_files]7/var/lib/git/docbuild/linux/Documentation/docutils.confafile_insertion_enabled raw_enabledKline_length_limitM'pep_referencesN pep_base_urlhttps://peps.python.org/pep_file_url_templatepep-%04drfc_referencesN rfc_base_url&https://datatracker.ietf.org/doc/html/ tab_widthKtrim_footnote_reference_spacesyntax_highlightlong smart_quotessmartquotes_locales]character_level_inline_markupdoctitle_xform docinfo_xformKsectsubtitle_xform image_loadinglinkembed_stylesheetcloak_email_addressessection_self_linkenvNubreporterNindirect_targets]substitution_defs}substitution_names}refnames}refids}nameids}(jjjjjjjsjpjju nametypes}(jjjjsjuh}(jhjhjjjpjjjvu footnote_refs} citation_refs} autofootnotes]autofootnote_refs]symbol_footnotes]symbol_footnote_refs] footnotes] citations]autofootnote_startKsymbol_footnote_startK id_counter collectionsCounter}Rparse_messages]transform_messages] transformerN include_log] decorationNhhub.