€•sYŒ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/locking/spinlocks”Œ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/locking/spinlocks”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ%/translations/it_IT/locking/spinlocks”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ%/translations/ja_JP/locking/spinlocks”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ%/translations/ko_KR/locking/spinlocks”Œ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/locking/spinlocks”Œ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/locking/spinlocks”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h hhŒ _document”hŒsource”NŒline”NubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒLocking lessons”h]”hŒLocking lessons”…””}”(hh¼h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hºhh·h²hh³Œ?/var/lib/git/docbuild/linux/Documentation/locking/spinlocks.rst”h´Kubh¶)”}”(hhh]”(h»)”}”(hŒLesson 1: Spin locks”h]”hŒLesson 1: Spin locks”…””}”(hhÎh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hºhhËh²hh³hÊh´KubhŒ paragraph”“”)”}”(hŒ2The most basic primitive for locking is spinlock::”h]”hŒ1The most basic primitive for locking is spinlock:”…””}”(hhÞh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KhhËh²hubhŒ literal_block”“”)”}”(hŒ¼static DEFINE_SPINLOCK(xxx_lock); unsigned long flags; spin_lock_irqsave(&xxx_lock, flags); ... critical section here .. spin_unlock_irqrestore(&xxx_lock, flags);”h]”hŒ¼static DEFINE_SPINLOCK(xxx_lock); unsigned long flags; spin_lock_irqsave(&xxx_lock, flags); ... critical section here .. spin_unlock_irqrestore(&xxx_lock, flags);”…””}”hhîsbah}”(h]”h ]”h"]”h$]”h&]”Œ xml:space”Œpreserve”uh1hìh³hÊh´K hhËh²hubhÝ)”}”(hXlThe above is always safe. It will disable interrupts _locally_, but the spinlock itself will guarantee the global lock, so it will guarantee that there is only one thread-of-control within the region(s) protected by that lock. This works well even under UP also, so the code does _not_ need to worry about UP vs SMP issues: the spinlocks work correctly under both.”h]”hXlThe above is always safe. It will disable interrupts _locally_, but the spinlock itself will guarantee the global lock, so it will guarantee that there is only one thread-of-control within the region(s) protected by that lock. This works well even under UP also, so the code does _not_ need to worry about UP vs SMP issues: the spinlocks work correctly under both.”…””}”(hhþh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KhhËh²hubhŒ block_quote”“”)”}”(hŒ¥NOTE! Implications of spin_locks for memory are further described in: Documentation/memory-barriers.txt (5) ACQUIRE operations. (6) RELEASE operations. ”h]”(hÝ)”}”(hŒENOTE! Implications of spin_locks for memory are further described in:”h]”hŒENOTE! Implications of spin_locks for memory are further described in:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´Khjubj )”}”(hŒXDocumentation/memory-barriers.txt (5) ACQUIRE operations. (6) RELEASE operations. ”h]”(hÝ)”}”(hŒ!Documentation/memory-barriers.txt”h]”hŒ!Documentation/memory-barriers.txt”…””}”(hj$h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´Khj ubj )”}”(hŒ1(5) ACQUIRE operations. (6) RELEASE operations. ”h]”hŒenumerated_list”“”)”}”(hhh]”(hŒ list_item”“”)”}”(hŒACQUIRE operations. ”h]”hÝ)”}”(hŒACQUIRE operations.”h]”hŒACQUIRE operations.”…””}”(hjAh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´Khj=ubah}”(h]”h ]”h"]”h$]”h&]”uh1j;hj8ubj<)”}”(hŒRELEASE operations. ”h]”hÝ)”}”(hŒRELEASE operations.”h]”hŒRELEASE operations.”…””}”(hjYh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KhjUubah}”(h]”h ]”h"]”h$]”h&]”uh1j;hj8ubeh}”(h]”h ]”h"]”h$]”h&]”Œenumtype”Œarabic”Œprefix”Œ(”Œsuffix”Œ)”Œstart”Kuh1j6hj2ubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´Khj ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´Khjubeh}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´KhhËh²hubhÝ)”}”(hX-The above is usually pretty simple (you usually need and want only one spinlock for most things - using more than one spinlock can make things a lot more complex and even slower and is usually worth it only for sequences that you **know** need to be split up: avoid it at all cost if you aren't sure).”h]”(hŒæThe above is usually pretty simple (you usually need and want only one spinlock for most things - using more than one spinlock can make things a lot more complex and even slower and is usually worth it only for sequences that you ”…””}”(hjŒh²hh³Nh´NubhŒstrong”“”)”}”(hŒ**know**”h]”hŒknow”…””}”(hj–h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j”hjŒubhŒA need to be split up: avoid it at all cost if you aren’t sure).”…””}”(hjŒh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K hhËh²hubhÝ)”}”(hX¹This is really the only really hard part about spinlocks: once you start using spinlocks they tend to expand to areas you might not have noticed before, because you have to make sure the spinlocks correctly protect the shared data structures **everywhere** they are used. The spinlocks are most easily added to places that are completely independent of other code (for example, internal driver data structures that nobody else ever touches).”h]”(hŒòThis is really the only really hard part about spinlocks: once you start using spinlocks they tend to expand to areas you might not have noticed before, because you have to make sure the spinlocks correctly protect the shared data structures ”…””}”(hj®h²hh³Nh´Nubj•)”}”(hŒ**everywhere**”h]”hŒ everywhere”…””}”(hj¶h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j”hj®ubhŒ¹ they are used. The spinlocks are most easily added to places that are completely independent of other code (for example, internal driver data structures that nobody else ever touches).”…””}”(hj®h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K&hhËh²hubj )”}”(hŒÒNOTE! The spin-lock is safe only when you **also** use the lock itself to do locking across CPU's, which implies that EVERYTHING that touches a shared variable has to agree about the spinlock they want to use. ”h]”hÝ)”}”(hŒÑNOTE! The spin-lock is safe only when you **also** use the lock itself to do locking across CPU's, which implies that EVERYTHING that touches a shared variable has to agree about the spinlock they want to use.”h]”(hŒ*NOTE! The spin-lock is safe only when you ”…””}”(hjÒh²hh³Nh´Nubj•)”}”(hŒ**also**”h]”hŒalso”…””}”(hjÚh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j”hjÒubhŒ¡ use the lock itself to do locking across CPU’s, which implies that EVERYTHING that touches a shared variable has to agree about the spinlock they want to use.”…””}”(hjÒh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K-hjÎubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´K-hhËh²hubeh}”(h]”Œlesson-1-spin-locks”ah ]”h"]”Œlesson 1: spin locks”ah$]”h&]”uh1hµhh·h²hh³hÊh´KubhŒ transition”“”)”}”(hŒ----”h]”h}”(h]”h ]”h"]”h$]”h&]”uh1jh³hÊh´K2hh·h²hubh¶)”}”(hhh]”(h»)”}”(hŒ"Lesson 2: reader-writer spinlocks.”h]”hŒ"Lesson 2: reader-writer spinlocks.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hºhj h²hh³hÊh´K5ubhÝ)”}”(hX`If your data accesses have a very natural pattern where you usually tend to mostly read from the shared variables, the reader-writer locks (rw_lock) versions of the spinlocks are sometimes useful. They allow multiple readers to be in the same critical region at once, but if somebody wants to change the variables it has to get an exclusive write lock.”h]”hX`If your data accesses have a very natural pattern where you usually tend to mostly read from the shared variables, the reader-writer locks (rw_lock) versions of the spinlocks are sometimes useful. They allow multiple readers to be in the same critical region at once, but if somebody wants to change the variables it has to get an exclusive write lock.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K7hj h²hubj )”}”(hŒ­NOTE! reader-writer locks require more atomic memory operations than simple spinlocks. Unless the reader critical section is long, you are better off just using spinlocks. ”h]”hÝ)”}”(hŒ¬NOTE! reader-writer locks require more atomic memory operations than simple spinlocks. Unless the reader critical section is long, you are better off just using spinlocks.”h]”hŒ¬NOTE! reader-writer locks require more atomic memory operations than simple spinlocks. Unless the reader critical section is long, you are better off just using spinlocks.”…””}”(hj/h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K=hj+ubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´K=hj h²hubhÝ)”}”(hŒ%The routines look the same as above::”h]”hŒ$The routines look the same as above:”…””}”(hjCh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KAhj h²hubhí)”}”(hXprwlock_t xxx_lock = __RW_LOCK_UNLOCKED(xxx_lock); unsigned long flags; read_lock_irqsave(&xxx_lock, flags); .. critical section that only reads the info ... read_unlock_irqrestore(&xxx_lock, flags); write_lock_irqsave(&xxx_lock, flags); .. read and write exclusive access to the info ... write_unlock_irqrestore(&xxx_lock, flags);”h]”hXprwlock_t xxx_lock = __RW_LOCK_UNLOCKED(xxx_lock); unsigned long flags; read_lock_irqsave(&xxx_lock, flags); .. critical section that only reads the info ... read_unlock_irqrestore(&xxx_lock, flags); write_lock_irqsave(&xxx_lock, flags); .. read and write exclusive access to the info ... write_unlock_irqrestore(&xxx_lock, flags);”…””}”hjQsbah}”(h]”h ]”h"]”h$]”h&]”hühýuh1hìh³hÊh´KChj h²hubhÝ)”}”(hX The above kind of lock may be useful for complex data structures like linked lists, especially searching for entries without changing the list itself. The read lock allows many concurrent readers. Anything that **changes** the list will have to get the write lock.”h]”(hŒÕThe above kind of lock may be useful for complex data structures like linked lists, especially searching for entries without changing the list itself. The read lock allows many concurrent readers. Anything that ”…””}”(hj_h²hh³Nh´Nubj•)”}”(hŒ **changes**”h]”hŒchanges”…””}”(hjgh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j”hj_ubhŒ* the list will have to get the write lock.”…””}”(hj_h²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KOhj h²hubj )”}”(hŒ}NOTE! RCU is better for list traversal, but requires careful attention to design detail (see Documentation/RCU/listRCU.rst). ”h]”hÝ)”}”(hŒ|NOTE! RCU is better for list traversal, but requires careful attention to design detail (see Documentation/RCU/listRCU.rst).”h]”hŒ|NOTE! RCU is better for list traversal, but requires careful attention to design detail (see Documentation/RCU/listRCU.rst).”…””}”(hjƒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KThjubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´KThj h²hubhÝ)”}”(hŒÂAlso, you cannot "upgrade" a read-lock to a write-lock, so if you at _any_ time need to do any changes (even if you don't do it every time), you have to get the write-lock at the very beginning.”h]”hŒÈAlso, you cannot “upgrade†a read-lock to a write-lock, so if you at _any_ time need to do any changes (even if you don’t do it every time), you have to get the write-lock at the very beginning.”…””}”(hj—h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KWhj h²hubj )”}”(hŒÀNOTE! We are working hard to remove reader-writer spinlocks in most cases, so please don't add a new one without consensus. (Instead, see Documentation/RCU/rcu.rst for complete information.) ”h]”hÝ)”}”(hŒ¿NOTE! We are working hard to remove reader-writer spinlocks in most cases, so please don't add a new one without consensus. (Instead, see Documentation/RCU/rcu.rst for complete information.)”h]”hŒÁNOTE! We are working hard to remove reader-writer spinlocks in most cases, so please don’t add a new one without consensus. (Instead, see Documentation/RCU/rcu.rst for complete information.)”…””}”(hj©h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K[hj¥ubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´K[hj h²hubeh}”(h]”Œ lesson-2-reader-writer-spinlocks”ah ]”h"]”Œ"lesson 2: reader-writer spinlocks.”ah$]”h&]”uh1hµhh·h²hh³hÊh´K5ubj)”}”(hŒ----”h]”h}”(h]”h ]”h"]”h$]”h&]”uh1jh³hÊh´K_hh·h²hubh¶)”}”(hhh]”(h»)”}”(hŒLesson 3: spinlocks revisited.”h]”hŒLesson 3: spinlocks revisited.”…””}”(hjÒh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hºhjÏh²hh³hÊh´KbubhÝ)”}”(hX›The single spin-lock primitives above are by no means the only ones. They are the most safe ones, and the ones that work under all circumstances, but partly **because** they are safe they are also fairly slow. They are slower than they'd need to be, because they do have to disable interrupts (which is just a single instruction on a x86, but it's an expensive one - and on other architectures it can be worse).”h]”(hŒThe single spin-lock primitives above are by no means the only ones. They are the most safe ones, and the ones that work under all circumstances, but partly ”…””}”(hjàh²hh³Nh´Nubj•)”}”(hŒ **because**”h]”hŒbecause”…””}”(hjèh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1j”hjàubhŒ÷ they are safe they are also fairly slow. They are slower than they’d need to be, because they do have to disable interrupts (which is just a single instruction on a x86, but it’s an expensive one - and on other architectures it can be worse).”…””}”(hjàh²hh³Nh´Nubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KdhjÏh²hubhÝ)”}”(hXIf you have a case where you have to protect a data structure across several CPU's and you want to use spinlocks you can potentially use cheaper versions of the spinlocks. IFF you know that the spinlocks are never used in interrupt handlers, you can use the non-irq versions::”h]”hXIf you have a case where you have to protect a data structure across several CPU’s and you want to use spinlocks you can potentially use cheaper versions of the spinlocks. IFF you know that the spinlocks are never used in interrupt handlers, you can use the non-irq versions:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KkhjÏh²hubhí)”}”(hŒ)spin_lock(&lock); ... spin_unlock(&lock);”h]”hŒ)spin_lock(&lock); ... spin_unlock(&lock);”…””}”hjsbah}”(h]”h ]”h"]”h$]”h&]”hühýuh1hìh³hÊh´KphjÏh²hubhÝ)”}”(hX(and the equivalent read-write versions too, of course). The spinlock will guarantee the same kind of exclusive access, and it will be much faster. This is useful if you know that the data in question is only ever manipulated from a "process context", ie no interrupts involved.”h]”hX(and the equivalent read-write versions too, of course). The spinlock will guarantee the same kind of exclusive access, and it will be much faster. This is useful if you know that the data in question is only ever manipulated from a “process contextâ€, ie no interrupts involved.”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KthjÏh²hubhÝ)”}”(hŒ}The reasons you mustn't use these versions if you have interrupts that play with the spinlock is that you can get deadlocks::”h]”hŒ~The reasons you mustn’t use these versions if you have interrupts that play with the spinlock is that you can get deadlocks:”…””}”(hj*h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KyhjÏh²hubhí)”}”(hŒVspin_lock(&lock); ... <- interrupt comes in: spin_lock(&lock);”h]”hŒVspin_lock(&lock); ... <- interrupt comes in: spin_lock(&lock);”…””}”hj8sbah}”(h]”h ]”h"]”h$]”h&]”hühýuh1hìh³hÊh´K|hjÏh²hubhÝ)”}”(hX¤where an interrupt tries to lock an already locked variable. This is ok if the other interrupt happens on another CPU, but it is _not_ ok if the interrupt happens on the same CPU that already holds the lock, because the lock will obviously never be released (because the interrupt is waiting for the lock, and the lock-holder is interrupted by the interrupt and will not continue until the interrupt has been processed).”h]”hX¤where an interrupt tries to lock an already locked variable. This is ok if the other interrupt happens on another CPU, but it is _not_ ok if the interrupt happens on the same CPU that already holds the lock, because the lock will obviously never be released (because the interrupt is waiting for the lock, and the lock-holder is interrupted by the interrupt and will not continue until the interrupt has been processed).”…””}”(hjFh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KhjÏh²hubhÝ)”}”(hX9(This is also the reason why the irq-versions of the spinlocks only need to disable the _local_ interrupts - it's ok to use spinlocks in interrupts on other CPU's, because an interrupt on another CPU doesn't interrupt the CPU that holds the lock, so the lock-holder can continue and eventually releases the lock).”h]”hX?(This is also the reason why the irq-versions of the spinlocks only need to disable the _local_ interrupts - it’s ok to use spinlocks in interrupts on other CPU’s, because an interrupt on another CPU doesn’t interrupt the CPU that holds the lock, so the lock-holder can continue and eventually releases the lock).”…””}”(hjTh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KˆhjÏh²hubj )”}”(hŒLinus ”h]”hÝ)”}”(hŒLinus”h]”hŒLinus”…””}”(hjfh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´KŽhjbubah}”(h]”h ]”h"]”h$]”h&]”uh1j h³hÊh´KŽhjÏh²hubeh}”(h]”Œlesson-3-spinlocks-revisited”ah ]”h"]”Œlesson 3: spinlocks revisited.”ah$]”h&]”uh1hµhh·h²hh³hÊh´Kbubj)”}”(hŒ----”h]”h}”(h]”h ]”h"]”h$]”h&]”uh1jh³hÊh´Khh·h²hubh¶)”}”(hhh]”(h»)”}”(hŒReference information:”h]”hŒReference information:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hºhjŒh²hh³hÊh´K“ubhÝ)”}”(hŒRFor dynamic initialization, use spin_lock_init() or rwlock_init() as appropriate::”h]”hŒQFor dynamic initialization, use spin_lock_init() or rwlock_init() as appropriate:”…””}”(hjh²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K•hjŒh²hubhí)”}”(hŒ±spinlock_t xxx_lock; rwlock_t xxx_rw_lock; static int __init xxx_init(void) { spin_lock_init(&xxx_lock); rwlock_init(&xxx_rw_lock); ... } module_init(xxx_init);”h]”hŒ±spinlock_t xxx_lock; rwlock_t xxx_rw_lock; static int __init xxx_init(void) { spin_lock_init(&xxx_lock); rwlock_init(&xxx_rw_lock); ... } module_init(xxx_init);”…””}”hj«sbah}”(h]”h ]”h"]”h$]”h&]”hühýuh1hìh³hÊh´K˜hjŒh²hubhÝ)”}”(hŒƒFor static initialization, use DEFINE_SPINLOCK() / DEFINE_RWLOCK() or __SPIN_LOCK_UNLOCKED() / __RW_LOCK_UNLOCKED() as appropriate.”h]”hŒƒFor static initialization, use DEFINE_SPINLOCK() / DEFINE_RWLOCK() or __SPIN_LOCK_UNLOCKED() / __RW_LOCK_UNLOCKED() as appropriate.”…””}”(hj¹h²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜh³hÊh´K¤hjŒh²hubeh}”(h]”Œreference-information”ah ]”h"]”Œreference information:”ah$]”h&]”uh1hµhh·h²hh³hÊh´K“ubeh}”(h]”Œlocking-lessons”ah ]”h"]”Œlocking lessons”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”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”}”Œnameids”}”(jÔjÑjýjújÂj¿jj|jÌjÉuŒ nametypes”}”(jÔ‰jý‰j‰j‰j̉uh}”(jÑh·júhËj¿j 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”]”hŒsystem_message”“”)”}”(hhh]”hÝ)”}”(hŒ:Enumerated list start value not ordinal-1: "5" (ordinal 5)”h]”hŒ>Enumerated list start value not ordinal-1: “5†(ordinal 5)”…””}”(hjah²hh³Nh´Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÜhj^ubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”ŒINFO”Œsource”hÊŒline”Kuh1j\hj2ubaŒtransform_messages”]”Œ transformer”NŒ include_log”]”Œ decoration”Nh²hub.