README 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131
  1. This directory contains the following litmus tests:
  2. CoRR+poonceonce+Once.litmus
  3. Test of read-read coherence, that is, whether or not two
  4. successive reads from the same variable are ordered.
  5. CoRW+poonceonce+Once.litmus
  6. Test of read-write coherence, that is, whether or not a read
  7. from a given variable followed by a write to that same variable
  8. are ordered.
  9. CoWR+poonceonce+Once.litmus
  10. Test of write-read coherence, that is, whether or not a write
  11. to a given variable followed by a read from that same variable
  12. are ordered.
  13. CoWW+poonceonce.litmus
  14. Test of write-write coherence, that is, whether or not two
  15. successive writes to the same variable are ordered.
  16. IRIW+mbonceonces+OnceOnce.litmus
  17. Test of independent reads from independent writes with smp_mb()
  18. between each pairs of reads. In other words, is smp_mb()
  19. sufficient to cause two different reading processes to agree on
  20. the order of a pair of writes, where each write is to a different
  21. variable by a different process?
  22. IRIW+poonceonces+OnceOnce.litmus
  23. Test of independent reads from independent writes with nothing
  24. between each pairs of reads. In other words, is anything at all
  25. needed to cause two different reading processes to agree on the
  26. order of a pair of writes, where each write is to a different
  27. variable by a different process?
  28. ISA2+pooncelock+pooncelock+pombonce.litmus
  29. Tests whether the ordering provided by a lock-protected S
  30. litmus test is visible to an external process whose accesses are
  31. separated by smp_mb(). This addition of an external process to
  32. S is otherwise known as ISA2.
  33. ISA2+poonceonces.litmus
  34. As below, but with store-release replaced with WRITE_ONCE()
  35. and load-acquire replaced with READ_ONCE().
  36. ISA2+pooncerelease+poacquirerelease+poacquireonce.litmus
  37. Can a release-acquire chain order a prior store against
  38. a later load?
  39. LB+ctrlonceonce+mbonceonce.litmus
  40. Does a control dependency and an smp_mb() suffice for the
  41. load-buffering litmus test, where each process reads from one
  42. of two variables then writes to the other?
  43. LB+poacquireonce+pooncerelease.litmus
  44. Does a release-acquire pair suffice for the load-buffering
  45. litmus test, where each process reads from one of two variables then
  46. writes to the other?
  47. LB+poonceonces.litmus
  48. As above, but with store-release replaced with WRITE_ONCE()
  49. and load-acquire replaced with READ_ONCE().
  50. MP+onceassign+derefonce.litmus
  51. As below, but with rcu_assign_pointer() and an rcu_dereference().
  52. MP+polocks.litmus
  53. As below, but with the second access of the writer process
  54. and the first access of reader process protected by a lock.
  55. MP+poonceonces.litmus
  56. As below, but without the smp_rmb() and smp_wmb().
  57. MP+pooncerelease+poacquireonce.litmus
  58. As below, but with a release-acquire chain.
  59. MP+porevlocks.litmus
  60. As below, but with the first access of the writer process
  61. and the second access of reader process protected by a lock.
  62. MP+wmbonceonce+rmbonceonce.litmus
  63. Does a smp_wmb() (between the stores) and an smp_rmb() (between
  64. the loads) suffice for the message-passing litmus test, where one
  65. process writes data and then a flag, and the other process reads
  66. the flag and then the data. (This is similar to the ISA2 tests,
  67. but with two processes instead of three.)
  68. R+mbonceonces.litmus
  69. This is the fully ordered (via smp_mb()) version of one of
  70. the classic counterintuitive litmus tests that illustrates the
  71. effects of store propagation delays.
  72. R+poonceonces.litmus
  73. As above, but without the smp_mb() invocations.
  74. SB+mbonceonces.litmus
  75. This is the fully ordered (again, via smp_mb() version of store
  76. buffering, which forms the core of Dekker's mutual-exclusion
  77. algorithm.
  78. SB+poonceonces.litmus
  79. As above, but without the smp_mb() invocations.
  80. S+poonceonces.litmus
  81. As below, but without the smp_wmb() and acquire load.
  82. S+wmbonceonce+poacquireonce.litmus
  83. Can a smp_wmb(), instead of a release, and an acquire order
  84. a prior store against a subsequent store?
  85. WRC+poonceonces+Once.litmus
  86. WRC+pooncerelease+rmbonceonce+Once.litmus
  87. These two are members of an extension of the MP litmus-test class
  88. in which the first write is moved to a separate process.
  89. Z6.0+pooncelock+pooncelock+pombonce.litmus
  90. Is the ordering provided by a spin_unlock() and a subsequent
  91. spin_lock() sufficient to make ordering apparent to accesses
  92. by a process not holding the lock?
  93. Z6.0+pooncelock+poonceLock+pombonce.litmus
  94. As above, but with smp_mb__after_spinlock() immediately
  95. following the spin_lock().
  96. Z6.0+pooncerelease+poacquirerelease+mbonceonce.litmus
  97. Is the ordering provided by a release-acquire chain sufficient
  98. to make ordering apparent to accesses by a process that does
  99. not participate in that release-acquire chain?
  100. A great many more litmus tests are available here:
  101. https://github.com/paulmckrcu/litmus