README 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  1. It has been said that successful communication requires first identifying
  2. what your audience knows and then building a bridge from their current
  3. knowledge to what they need to know. Unfortunately, the expected
  4. Linux-kernel memory model (LKMM) audience might be anywhere from novice
  5. to expert both in kernel hacking and in understanding LKMM.
  6. This document therefore points out a number of places to start reading,
  7. depending on what you know and what you would like to learn. Please note
  8. that the documents later in this list assume that the reader understands
  9. the material provided by documents earlier in this list.
  10. If LKMM-specific terms lost you, glossary.txt might help you.
  11. o You are new to Linux-kernel concurrency: simple.txt
  12. o You have some background in Linux-kernel concurrency, and would
  13. like an overview of the types of low-level concurrency primitives
  14. that the Linux kernel provides: ordering.txt
  15. Here, "low level" means atomic operations to single variables.
  16. o You are familiar with the Linux-kernel concurrency primitives
  17. that you need, and just want to get started with LKMM litmus
  18. tests: litmus-tests.txt
  19. o You need to locklessly access shared variables that are otherwise
  20. protected by a lock: locking.txt
  21. This locking.txt file expands on the "Locking" section in
  22. recipes.txt, but is self-contained.
  23. o You are familiar with Linux-kernel concurrency, and would
  24. like a detailed intuitive understanding of LKMM, including
  25. situations involving more than two threads: recipes.txt
  26. o You would like a detailed understanding of what your compiler can
  27. and cannot do to control dependencies: control-dependencies.txt
  28. o You would like to mark concurrent normal accesses to shared
  29. variables so that intentional "racy" accesses can be properly
  30. documented, especially when you are responding to complaints
  31. from KCSAN: access-marking.txt
  32. o You are familiar with Linux-kernel concurrency and the use of
  33. LKMM, and would like a quick reference: cheatsheet.txt
  34. o You are familiar with Linux-kernel concurrency and the use
  35. of LKMM, and would like to learn about LKMM's requirements,
  36. rationale, and implementation: explanation.txt and
  37. herd-representation.txt
  38. o You are interested in the publications related to LKMM, including
  39. hardware manuals, academic literature, standards-committee
  40. working papers, and LWN articles: references.txt
  41. ====================
  42. DESCRIPTION OF FILES
  43. ====================
  44. README
  45. This file.
  46. access-marking.txt
  47. Guidelines for marking intentionally concurrent accesses to
  48. shared memory.
  49. cheatsheet.txt
  50. Quick-reference guide to the Linux-kernel memory model.
  51. control-dependencies.txt
  52. Guide to preventing compiler optimizations from destroying
  53. your control dependencies.
  54. explanation.txt
  55. Detailed description of the memory model.
  56. glossary.txt
  57. Brief definitions of LKMM-related terms.
  58. herd-representation.txt
  59. The (abstract) representation of the Linux-kernel concurrency
  60. primitives in terms of events.
  61. litmus-tests.txt
  62. The format, features, capabilities, and limitations of the litmus
  63. tests that LKMM can evaluate.
  64. locking.txt
  65. Rules for accessing lock-protected shared variables outside of
  66. their corresponding critical sections.
  67. ordering.txt
  68. Overview of the Linux kernel's low-level memory-ordering
  69. primitives by category.
  70. recipes.txt
  71. Common memory-ordering patterns.
  72. references.txt
  73. Background information.
  74. simple.txt
  75. Starting point for someone new to Linux-kernel concurrency.
  76. And also a reminder of the simpler approaches to concurrency!