spinlocks.txt 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  1. SPIN_LOCK_UNLOCKED and RW_LOCK_UNLOCKED defeat lockdep state tracking and
  2. are hence deprecated.
  3. Please use DEFINE_SPINLOCK()/DEFINE_RWLOCK() or
  4. __SPIN_LOCK_UNLOCKED()/__RW_LOCK_UNLOCKED() as appropriate for static
  5. initialization.
  6. Most of the time, you can simply turn:
  7. static spinlock_t xxx_lock = SPIN_LOCK_UNLOCKED;
  8. into:
  9. static DEFINE_SPINLOCK(xxx_lock);
  10. Static structure member variables go from:
  11. struct foo bar {
  12. .lock = SPIN_LOCK_UNLOCKED;
  13. };
  14. to:
  15. struct foo bar {
  16. .lock = __SPIN_LOCK_UNLOCKED(bar.lock);
  17. };
  18. Declaration of static rw_locks undergo a similar transformation.
  19. Dynamic initialization, when necessary, may be performed as
  20. demonstrated below.
  21. spinlock_t xxx_lock;
  22. rwlock_t xxx_rw_lock;
  23. static int __init xxx_init(void)
  24. {
  25. spin_lock_init(&xxx_lock);
  26. rwlock_init(&xxx_rw_lock);
  27. ...
  28. }
  29. module_init(xxx_init);
  30. The following discussion is still valid, however, with the dynamic
  31. initialization of spinlocks or with DEFINE_SPINLOCK, etc., used
  32. instead of SPIN_LOCK_UNLOCKED.
  33. -----------------------
  34. On Fri, 2 Jan 1998, Doug Ledford wrote:
  35. >
  36. > I'm working on making the aic7xxx driver more SMP friendly (as well as
  37. > importing the latest FreeBSD sequencer code to have 7895 support) and wanted
  38. > to get some info from you. The goal here is to make the various routines
  39. > SMP safe as well as UP safe during interrupts and other manipulating
  40. > routines. So far, I've added a spin_lock variable to things like my queue
  41. > structs. Now, from what I recall, there are some spin lock functions I can
  42. > use to lock these spin locks from other use as opposed to a (nasty)
  43. > save_flags(); cli(); stuff; restore_flags(); construct. Where do I find
  44. > these routines and go about making use of them? Do they only lock on a
  45. > per-processor basis or can they also lock say an interrupt routine from
  46. > mucking with a queue if the queue routine was manipulating it when the
  47. > interrupt occurred, or should I still use a cli(); based construct on that
  48. > one?
  49. See <asm/spinlock.h>. The basic version is:
  50. spinlock_t xxx_lock = SPIN_LOCK_UNLOCKED;
  51. unsigned long flags;
  52. spin_lock_irqsave(&xxx_lock, flags);
  53. ... critical section here ..
  54. spin_unlock_irqrestore(&xxx_lock, flags);
  55. and the above is always safe. It will disable interrupts _locally_, but the
  56. spinlock itself will guarantee the global lock, so it will guarantee that
  57. there is only one thread-of-control within the region(s) protected by that
  58. lock.
  59. Note that it works well even under UP - the above sequence under UP
  60. essentially is just the same as doing a
  61. unsigned long flags;
  62. save_flags(flags); cli();
  63. ... critical section ...
  64. restore_flags(flags);
  65. so the code does _not_ need to worry about UP vs SMP issues: the spinlocks
  66. work correctly under both (and spinlocks are actually more efficient on
  67. architectures that allow doing the "save_flags + cli" in one go because I
  68. don't export that interface normally).
  69. NOTE NOTE NOTE! The reason the spinlock is so much faster than a global
  70. interrupt lock under SMP is exactly because it disables interrupts only on
  71. the local CPU. The spin-lock is safe only when you _also_ use the lock
  72. itself to do locking across CPU's, which implies that EVERYTHING that
  73. touches a shared variable has to agree about the spinlock they want to
  74. use.
  75. The above is usually pretty simple (you usually need and want only one
  76. spinlock for most things - using more than one spinlock can make things a
  77. lot more complex and even slower and is usually worth it only for
  78. sequences that you _know_ need to be split up: avoid it at all cost if you
  79. aren't sure). HOWEVER, it _does_ mean that if you have some code that does
  80. cli();
  81. .. critical section ..
  82. sti();
  83. and another sequence that does
  84. spin_lock_irqsave(flags);
  85. .. critical section ..
  86. spin_unlock_irqrestore(flags);
  87. then they are NOT mutually exclusive, and the critical regions can happen
  88. at the same time on two different CPU's. That's fine per se, but the
  89. critical regions had better be critical for different things (ie they
  90. can't stomp on each other).
  91. The above is a problem mainly if you end up mixing code - for example the
  92. routines in ll_rw_block() tend to use cli/sti to protect the atomicity of
  93. their actions, and if a driver uses spinlocks instead then you should
  94. think about issues like the above..
  95. This is really the only really hard part about spinlocks: once you start
  96. using spinlocks they tend to expand to areas you might not have noticed
  97. before, because you have to make sure the spinlocks correctly protect the
  98. shared data structures _everywhere_ they are used. The spinlocks are most
  99. easily added to places that are completely independent of other code (ie
  100. internal driver data structures that nobody else ever touches, for
  101. example).
  102. ----
  103. Lesson 2: reader-writer spinlocks.
  104. If your data accesses have a very natural pattern where you usually tend
  105. to mostly read from the shared variables, the reader-writer locks
  106. (rw_lock) versions of the spinlocks are often nicer. They allow multiple
  107. readers to be in the same critical region at once, but if somebody wants
  108. to change the variables it has to get an exclusive write lock. The
  109. routines look the same as above:
  110. rwlock_t xxx_lock = RW_LOCK_UNLOCKED;
  111. unsigned long flags;
  112. read_lock_irqsave(&xxx_lock, flags);
  113. .. critical section that only reads the info ...
  114. read_unlock_irqrestore(&xxx_lock, flags);
  115. write_lock_irqsave(&xxx_lock, flags);
  116. .. read and write exclusive access to the info ...
  117. write_unlock_irqrestore(&xxx_lock, flags);
  118. The above kind of lock is useful for complex data structures like linked
  119. lists etc, especially when you know that most of the work is to just
  120. traverse the list searching for entries without changing the list itself,
  121. for example. Then you can use the read lock for that kind of list
  122. traversal, which allows many concurrent readers. Anything that _changes_
  123. the list will have to get the write lock.
  124. Note: you cannot "upgrade" a read-lock to a write-lock, so if you at _any_
  125. time need to do any changes (even if you don't do it every time), you have
  126. to get the write-lock at the very beginning. I could fairly easily add a
  127. primitive to create a "upgradeable" read-lock, but it hasn't been an issue
  128. yet. Tell me if you'd want one.
  129. ----
  130. Lesson 3: spinlocks revisited.
  131. The single spin-lock primitives above are by no means the only ones. They
  132. are the most safe ones, and the ones that work under all circumstances,
  133. but partly _because_ they are safe they are also fairly slow. They are
  134. much faster than a generic global cli/sti pair, but slower than they'd
  135. need to be, because they do have to disable interrupts (which is just a
  136. single instruction on a x86, but it's an expensive one - and on other
  137. architectures it can be worse).
  138. If you have a case where you have to protect a data structure across
  139. several CPU's and you want to use spinlocks you can potentially use
  140. cheaper versions of the spinlocks. IFF you know that the spinlocks are
  141. never used in interrupt handlers, you can use the non-irq versions:
  142. spin_lock(&lock);
  143. ...
  144. spin_unlock(&lock);
  145. (and the equivalent read-write versions too, of course). The spinlock will
  146. guarantee the same kind of exclusive access, and it will be much faster.
  147. This is useful if you know that the data in question is only ever
  148. manipulated from a "process context", ie no interrupts involved.
  149. The reasons you mustn't use these versions if you have interrupts that
  150. play with the spinlock is that you can get deadlocks:
  151. spin_lock(&lock);
  152. ...
  153. <- interrupt comes in:
  154. spin_lock(&lock);
  155. where an interrupt tries to lock an already locked variable. This is ok if
  156. the other interrupt happens on another CPU, but it is _not_ ok if the
  157. interrupt happens on the same CPU that already holds the lock, because the
  158. lock will obviously never be released (because the interrupt is waiting
  159. for the lock, and the lock-holder is interrupted by the interrupt and will
  160. not continue until the interrupt has been processed).
  161. (This is also the reason why the irq-versions of the spinlocks only need
  162. to disable the _local_ interrupts - it's ok to use spinlocks in interrupts
  163. on other CPU's, because an interrupt on another CPU doesn't interrupt the
  164. CPU that holds the lock, so the lock-holder can continue and eventually
  165. releases the lock).
  166. Note that you can be clever with read-write locks and interrupts. For
  167. example, if you know that the interrupt only ever gets a read-lock, then
  168. you can use a non-irq version of read locks everywhere - because they
  169. don't block on each other (and thus there is no dead-lock wrt interrupts.
  170. But when you do the write-lock, you have to use the irq-safe version.
  171. For an example of being clever with rw-locks, see the "waitqueue_lock"
  172. handling in kernel/sched.c - nothing ever _changes_ a wait-queue from
  173. within an interrupt, they only read the queue in order to know whom to
  174. wake up. So read-locks are safe (which is good: they are very common
  175. indeed), while write-locks need to protect themselves against interrupts.
  176. Linus