2.Process.rst 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494
  1. .. _development_process:
  2. How the development process works
  3. =================================
  4. Linux kernel development in the early 1990s was a pretty loose affair,
  5. with relatively small numbers of users and developers involved. With a
  6. user base in the millions and with some 2,000 developers involved over the
  7. course of one year, the kernel has since had to evolve a number of
  8. processes to keep development happening smoothly. A solid understanding of
  9. how the process works is required in order to be an effective part of it.
  10. The big picture
  11. ---------------
  12. The Linux kernel uses a loosely time-based, rolling release development
  13. model. A new major kernel release (which we will call, as an example, 9.x)
  14. [1]_ happens every two or three months, which comes with new features,
  15. internal API changes, and more. A typical release can contain about 13,000
  16. changesets with changes to several hundred thousand lines of code. Recent
  17. releases, along with their dates, can be found at `Wikipedia
  18. <https://en.wikipedia.org/wiki/Linux_kernel_version_history>`_.
  19. .. [1] Strictly speaking, the Linux kernel does not use semantic versioning
  20. number scheme, but rather the 9.x pair identifies major release
  21. version as a whole number. For each release, x is incremented,
  22. but 9 is incremented only if x is deemed large enough (e.g.
  23. Linux 5.0 is released following Linux 4.20).
  24. A relatively straightforward discipline is followed with regard to the
  25. merging of patches for each release. At the beginning of each development
  26. cycle, the "merge window" is said to be open. At that time, code which is
  27. deemed to be sufficiently stable (and which is accepted by the development
  28. community) is merged into the mainline kernel. The bulk of changes for a
  29. new development cycle (and all of the major changes) will be merged during
  30. this time, at a rate approaching 1,000 changes ("patches," or "changesets")
  31. per day.
  32. (As an aside, it is worth noting that the changes integrated during the
  33. merge window do not come out of thin air; they have been collected, tested,
  34. and staged ahead of time. How that process works will be described in
  35. detail later on).
  36. The merge window lasts for approximately two weeks. At the end of this
  37. time, Linus Torvalds will declare that the window is closed and release the
  38. first of the "rc" kernels. For the kernel which is destined to be 9.x,
  39. for example, the release which happens at the end of the merge window will
  40. be called 9.x-rc1. The -rc1 release is the signal that the time to
  41. merge new features has passed, and that the time to stabilize the next
  42. kernel has begun.
  43. Over the next six to ten weeks, only patches which fix problems should be
  44. submitted to the mainline. On occasion a more significant change will be
  45. allowed, but such occasions are rare; developers who try to merge new
  46. features outside of the merge window tend to get an unfriendly reception.
  47. As a general rule, if you miss the merge window for a given feature, the
  48. best thing to do is to wait for the next development cycle. (An occasional
  49. exception is made for drivers for previously-unsupported hardware; if they
  50. touch no in-tree code, they cannot cause regressions and should be safe to
  51. add at any time).
  52. As fixes make their way into the mainline, the patch rate will slow over
  53. time. Linus releases new -rc kernels about once a week; a normal series
  54. will get up to somewhere between -rc6 and -rc9 before the kernel is
  55. considered to be sufficiently stable and the final release is made.
  56. At that point the whole process starts over again.
  57. As an example, here is how the 5.4 development cycle went (all dates in
  58. 2019):
  59. ============== ===============================
  60. September 15 5.3 stable release
  61. September 30 5.4-rc1, merge window closes
  62. October 6 5.4-rc2
  63. October 13 5.4-rc3
  64. October 20 5.4-rc4
  65. October 27 5.4-rc5
  66. November 3 5.4-rc6
  67. November 10 5.4-rc7
  68. November 17 5.4-rc8
  69. November 24 5.4 stable release
  70. ============== ===============================
  71. How do the developers decide when to close the development cycle and create
  72. the stable release? The most significant metric used is the list of
  73. regressions from previous releases. No bugs are welcome, but those which
  74. break systems which worked in the past are considered to be especially
  75. serious. For this reason, patches which cause regressions are looked upon
  76. unfavorably and are quite likely to be reverted during the stabilization
  77. period.
  78. The developers' goal is to fix all known regressions before the stable
  79. release is made. In the real world, this kind of perfection is hard to
  80. achieve; there are just too many variables in a project of this size.
  81. There comes a point where delaying the final release just makes the problem
  82. worse; the pile of changes waiting for the next merge window will grow
  83. larger, creating even more regressions the next time around. So most kernels
  84. go out with a handful of known regressions, though, hopefully, none of them
  85. are serious.
  86. Once a stable release is made, its ongoing maintenance is passed off to the
  87. "stable team," currently consists of Greg Kroah-Hartman and Sasha Levin. The
  88. stable team will release occasional updates to the stable release using the
  89. 9.x.y numbering scheme.
  90. To be considered for an update release, a patch must (1) fix a significant
  91. bug, and (2) already be merged into the mainline for the next development
  92. kernel. Kernels will typically receive stable updates for a little more
  93. than one development cycle past their initial release. So, for example, the
  94. 5.2 kernel's history looked like this (all dates in 2019):
  95. ============== ===============================
  96. July 7 5.2 stable release
  97. July 14 5.2.1
  98. July 21 5.2.2
  99. July 26 5.2.3
  100. July 28 5.2.4
  101. July 31 5.2.5
  102. ... ...
  103. October 11 5.2.21
  104. ============== ===============================
  105. 5.2.21 was the final stable update of the 5.2 release.
  106. Some kernels are designated "long term" kernels; they will receive support
  107. for a longer period. Please refer to the following link for the list of active
  108. long term kernel versions and their maintainers:
  109. https://www.kernel.org/category/releases.html
  110. The selection of a kernel for long-term support is purely a matter of a
  111. maintainer having the need and the time to maintain that release. There
  112. are no known plans for long-term support for any specific upcoming
  113. release.
  114. The lifecycle of a patch
  115. ------------------------
  116. Patches do not go directly from the developer's keyboard into the mainline
  117. kernel. There is, instead, a somewhat involved (if somewhat informal)
  118. process designed to ensure that each patch is reviewed for quality and that
  119. each patch implements a change which is desirable to have in the mainline.
  120. This process can happen quickly for minor fixes, or, in the case of large
  121. and controversial changes, go on for years. Much developer frustration
  122. comes from a lack of understanding of this process or from attempts to
  123. circumvent it.
  124. In the hopes of reducing that frustration, this document will describe how
  125. a patch gets into the kernel. What follows below is an introduction which
  126. describes the process in a somewhat idealized way. A much more detailed
  127. treatment will come in later sections.
  128. The stages that a patch goes through are, generally:
  129. - Design. This is where the real requirements for the patch - and the way
  130. those requirements will be met - are laid out. Design work is often
  131. done without involving the community, but it is better to do this work
  132. in the open if at all possible; it can save a lot of time redesigning
  133. things later.
  134. - Early review. Patches are posted to the relevant mailing list, and
  135. developers on that list reply with any comments they may have. This
  136. process should turn up any major problems with a patch if all goes
  137. well.
  138. - Wider review. When the patch is getting close to ready for mainline
  139. inclusion, it should be accepted by a relevant subsystem maintainer -
  140. though this acceptance is not a guarantee that the patch will make it
  141. all the way to the mainline. The patch will show up in the maintainer's
  142. subsystem tree and into the -next trees (described below). When the
  143. process works, this step leads to more extensive review of the patch and
  144. the discovery of any problems resulting from the integration of this
  145. patch with work being done by others.
  146. - Please note that most maintainers also have day jobs, so merging
  147. your patch may not be their highest priority. If your patch is
  148. getting feedback about changes that are needed, you should either
  149. make those changes or justify why they should not be made. If your
  150. patch has no review complaints but is not being merged by its
  151. appropriate subsystem or driver maintainer, you should be persistent
  152. in updating the patch to the current kernel so that it applies cleanly
  153. and keep sending it for review and merging.
  154. - Merging into the mainline. Eventually, a successful patch will be
  155. merged into the mainline repository managed by Linus Torvalds. More
  156. comments and/or problems may surface at this time; it is important that
  157. the developer be responsive to these and fix any issues which arise.
  158. - Stable release. The number of users potentially affected by the patch
  159. is now large, so, once again, new problems may arise.
  160. - Long-term maintenance. While it is certainly possible for a developer
  161. to forget about code after merging it, that sort of behavior tends to
  162. leave a poor impression in the development community. Merging code
  163. eliminates some of the maintenance burden, in that others will fix
  164. problems caused by API changes. But the original developer should
  165. continue to take responsibility for the code if it is to remain useful
  166. in the longer term.
  167. One of the largest mistakes made by kernel developers (or their employers)
  168. is to try to cut the process down to a single "merging into the mainline"
  169. step. This approach invariably leads to frustration for everybody
  170. involved.
  171. How patches get into the Kernel
  172. -------------------------------
  173. There is exactly one person who can merge patches into the mainline kernel
  174. repository: Linus Torvalds. But, for example, of the over 9,500 patches
  175. which went into the 2.6.38 kernel, only 112 (around 1.3%) were directly
  176. chosen by Linus himself. The kernel project has long since grown to a size
  177. where no single developer could possibly inspect and select every patch
  178. unassisted. The way the kernel developers have addressed this growth is
  179. through the use of a lieutenant system built around a chain of trust.
  180. The kernel code base is logically broken down into a set of subsystems:
  181. networking, specific architecture support, memory management, video
  182. devices, etc. Most subsystems have a designated maintainer, a developer
  183. who has overall responsibility for the code within that subsystem. These
  184. subsystem maintainers are the gatekeepers (in a loose way) for the portion
  185. of the kernel they manage; they are the ones who will (usually) accept a
  186. patch for inclusion into the mainline kernel.
  187. Subsystem maintainers each manage their own version of the kernel source
  188. tree, usually (but certainly not always) using the git source management
  189. tool. Tools like git (and related tools like quilt or mercurial) allow
  190. maintainers to track a list of patches, including authorship information
  191. and other metadata. At any given time, the maintainer can identify which
  192. patches in his or her repository are not found in the mainline.
  193. When the merge window opens, top-level maintainers will ask Linus to "pull"
  194. the patches they have selected for merging from their repositories. If
  195. Linus agrees, the stream of patches will flow up into his repository,
  196. becoming part of the mainline kernel. The amount of attention that Linus
  197. pays to specific patches received in a pull operation varies. It is clear
  198. that, sometimes, he looks quite closely. But, as a general rule, Linus
  199. trusts the subsystem maintainers to not send bad patches upstream.
  200. Subsystem maintainers, in turn, can pull patches from other maintainers.
  201. For example, the networking tree is built from patches which accumulated
  202. first in trees dedicated to network device drivers, wireless networking,
  203. etc. This chain of repositories can be arbitrarily long, though it rarely
  204. exceeds two or three links. Since each maintainer in the chain trusts
  205. those managing lower-level trees, this process is known as the "chain of
  206. trust."
  207. Clearly, in a system like this, getting patches into the kernel depends on
  208. finding the right maintainer. Sending patches directly to Linus is not
  209. normally the right way to go.
  210. Next trees
  211. ----------
  212. The chain of subsystem trees guides the flow of patches into the kernel,
  213. but it also raises an interesting question: what if somebody wants to look
  214. at all of the patches which are being prepared for the next merge window?
  215. Developers will be interested in what other changes are pending to see
  216. whether there are any conflicts to worry about; a patch which changes a
  217. core kernel function prototype, for example, will conflict with any other
  218. patches which use the older form of that function. Reviewers and testers
  219. want access to the changes in their integrated form before all of those
  220. changes land in the mainline kernel. One could pull changes from all of
  221. the interesting subsystem trees, but that would be a big and error-prone
  222. job.
  223. The answer comes in the form of -next trees, where subsystem trees are
  224. collected for testing and review. The older of these trees, maintained by
  225. Andrew Morton, is called "-mm" (for memory management, which is how it got
  226. started). The -mm tree integrates patches from a long list of subsystem
  227. trees; it also has some patches aimed at helping with debugging.
  228. Beyond that, -mm contains a significant collection of patches which have
  229. been selected by Andrew directly. These patches may have been posted on a
  230. mailing list, or they may apply to a part of the kernel for which there is
  231. no designated subsystem tree. As a result, -mm operates as a sort of
  232. subsystem tree of last resort; if there is no other obvious path for a
  233. patch into the mainline, it is likely to end up in -mm. Miscellaneous
  234. patches which accumulate in -mm will eventually either be forwarded on to
  235. an appropriate subsystem tree or be sent directly to Linus. In a typical
  236. development cycle, approximately 5-10% of the patches going into the
  237. mainline get there via -mm.
  238. The current -mm patch is available in the "mmotm" (-mm of the moment)
  239. directory at:
  240. https://www.ozlabs.org/~akpm/mmotm/
  241. Use of the MMOTM tree is likely to be a frustrating experience, though;
  242. there is a definite chance that it will not even compile.
  243. The primary tree for next-cycle patch merging is linux-next, maintained by
  244. Stephen Rothwell. The linux-next tree is, by design, a snapshot of what
  245. the mainline is expected to look like after the next merge window closes.
  246. Linux-next trees are announced on the linux-kernel and linux-next mailing
  247. lists when they are assembled; they can be downloaded from:
  248. https://www.kernel.org/pub/linux/kernel/next/
  249. Linux-next has become an integral part of the kernel development process;
  250. all patches merged during a given merge window should really have found
  251. their way into linux-next some time before the merge window opens.
  252. Staging trees
  253. -------------
  254. The kernel source tree contains the drivers/staging/ directory, where
  255. many sub-directories for drivers or filesystems that are on their way to
  256. being added to the kernel tree live. They remain in drivers/staging while
  257. they still need more work; once complete, they can be moved into the
  258. kernel proper. This is a way to keep track of drivers that aren't
  259. up to Linux kernel coding or quality standards, but people may want to use
  260. them and track development.
  261. Greg Kroah-Hartman currently maintains the staging tree. Drivers that
  262. still need work are sent to him, with each driver having its own
  263. subdirectory in drivers/staging/. Along with the driver source files, a
  264. TODO file should be present in the directory as well. The TODO file lists
  265. the pending work that the driver needs for acceptance into the kernel
  266. proper, as well as a list of people that should be Cc'd for any patches to
  267. the driver. Current rules require that drivers contributed to staging
  268. must, at a minimum, compile properly.
  269. Staging can be a relatively easy way to get new drivers into the mainline
  270. where, with luck, they will come to the attention of other developers and
  271. improve quickly. Entry into staging is not the end of the story, though;
  272. code in staging which is not seeing regular progress will eventually be
  273. removed. Distributors also tend to be relatively reluctant to enable
  274. staging drivers. So staging is, at best, a stop on the way toward becoming
  275. a proper mainline driver.
  276. Tools
  277. -----
  278. As can be seen from the above text, the kernel development process depends
  279. heavily on the ability to herd collections of patches in various
  280. directions. The whole thing would not work anywhere near as well as it
  281. does without suitably powerful tools. Tutorials on how to use these tools
  282. are well beyond the scope of this document, but there is space for a few
  283. pointers.
  284. By far the dominant source code management system used by the kernel
  285. community is git. Git is one of a number of distributed version control
  286. systems being developed in the free software community. It is well tuned
  287. for kernel development, in that it performs quite well when dealing with
  288. large repositories and large numbers of patches. It also has a reputation
  289. for being difficult to learn and use, though it has gotten better over
  290. time. Some sort of familiarity with git is almost a requirement for kernel
  291. developers; even if they do not use it for their own work, they'll need git
  292. to keep up with what other developers (and the mainline) are doing.
  293. Git is now packaged by almost all Linux distributions. There is a home
  294. page at:
  295. https://git-scm.com/
  296. That page has pointers to documentation and tutorials.
  297. Among the kernel developers who do not use git, the most popular choice is
  298. almost certainly Mercurial:
  299. https://www.selenic.com/mercurial/
  300. Mercurial shares many features with git, but it provides an interface which
  301. many find easier to use.
  302. The other tool worth knowing about is Quilt:
  303. https://savannah.nongnu.org/projects/quilt/
  304. Quilt is a patch management system, rather than a source code management
  305. system. It does not track history over time; it is, instead, oriented
  306. toward tracking a specific set of changes against an evolving code base.
  307. Some major subsystem maintainers use quilt to manage patches intended to go
  308. upstream. For the management of certain kinds of trees (-mm, for example),
  309. quilt is the best tool for the job.
  310. Mailing lists
  311. -------------
  312. A great deal of Linux kernel development work is done by way of mailing
  313. lists. It is hard to be a fully-functioning member of the community
  314. without joining at least one list somewhere. But Linux mailing lists also
  315. represent a potential hazard to developers, who risk getting buried under a
  316. load of electronic mail, running afoul of the conventions used on the Linux
  317. lists, or both.
  318. Most kernel mailing lists are hosted at kernel.org; the master list can
  319. be found at:
  320. https://subspace.kernel.org
  321. There are lists hosted elsewhere; please check the MAINTAINERS file for
  322. the list relevant for any particular subsystem.
  323. The core mailing list for kernel development is, of course, linux-kernel.
  324. This list is an intimidating place to be; volume can reach 500 messages per
  325. day, the amount of noise is high, the conversation can be severely
  326. technical, and participants are not always concerned with showing a high
  327. degree of politeness. But there is no other place where the kernel
  328. development community comes together as a whole; developers who avoid this
  329. list will miss important information.
  330. There are a few hints which can help with linux-kernel survival:
  331. - Have the list delivered to a separate folder, rather than your main
  332. mailbox. One must be able to ignore the stream for sustained periods of
  333. time.
  334. - Do not try to follow every conversation - nobody else does. It is
  335. important to filter on both the topic of interest (though note that
  336. long-running conversations can drift away from the original subject
  337. without changing the email subject line) and the people who are
  338. participating.
  339. - Do not feed the trolls. If somebody is trying to stir up an angry
  340. response, ignore them.
  341. - When responding to linux-kernel email (or that on other lists) preserve
  342. the Cc: header for all involved. In the absence of a strong reason (such
  343. as an explicit request), you should never remove recipients. Always make
  344. sure that the person you are responding to is in the Cc: list. This
  345. convention also makes it unnecessary to explicitly ask to be copied on
  346. replies to your postings.
  347. - Search the list archives (and the net as a whole) before asking
  348. questions. Some developers can get impatient with people who clearly
  349. have not done their homework.
  350. - Use interleaved ("inline") replies, which makes your response easier to
  351. read. (i.e. avoid top-posting -- the practice of putting your answer above
  352. the quoted text you are responding to.) For more details, see
  353. :ref:`Documentation/process/submitting-patches.rst <interleaved_replies>`.
  354. - Ask on the correct mailing list. Linux-kernel may be the general meeting
  355. point, but it is not the best place to find developers from all
  356. subsystems.
  357. The last point - finding the correct mailing list - is a common place for
  358. beginning developers to go wrong. Somebody who asks a networking-related
  359. question on linux-kernel will almost certainly receive a polite suggestion
  360. to ask on the netdev list instead, as that is the list frequented by most
  361. networking developers. Other lists exist for the SCSI, video4linux, IDE,
  362. filesystem, etc. subsystems. The best place to look for mailing lists is
  363. in the MAINTAINERS file packaged with the kernel source.
  364. Getting started with Kernel development
  365. ---------------------------------------
  366. Questions about how to get started with the kernel development process are
  367. common - from both individuals and companies. Equally common are missteps
  368. which make the beginning of the relationship harder than it has to be.
  369. Companies often look to hire well-known developers to get a development
  370. group started. This can, in fact, be an effective technique. But it also
  371. tends to be expensive and does not do much to grow the pool of experienced
  372. kernel developers. It is possible to bring in-house developers up to speed
  373. on Linux kernel development, given the investment of a bit of time. Taking
  374. this time can endow an employer with a group of developers who understand
  375. the kernel and the company both, and who can help to train others as well.
  376. Over the medium term, this is often the more profitable approach.
  377. Individual developers are often, understandably, at a loss for a place to
  378. start. Beginning with a large project can be intimidating; one often wants
  379. to test the waters with something smaller first. This is the point where
  380. some developers jump into the creation of patches fixing spelling errors or
  381. minor coding style issues. Unfortunately, such patches create a level of
  382. noise which is distracting for the development community as a whole, so,
  383. increasingly, they are looked down upon. New developers wishing to
  384. introduce themselves to the community will not get the sort of reception
  385. they wish for by these means.
  386. Andrew Morton gives this advice for aspiring kernel developers
  387. ::
  388. The #1 project for all kernel beginners should surely be "make sure
  389. that the kernel runs perfectly at all times on all machines which
  390. you can lay your hands on". Usually the way to do this is to work
  391. with others on getting things fixed up (this can require
  392. persistence!) but that's fine - it's a part of kernel development.
  393. (https://lwn.net/Articles/283982/).
  394. In the absence of obvious problems to fix, developers are advised to look
  395. at the current lists of regressions and open bugs in general. There is
  396. never any shortage of issues in need of fixing; by addressing these issues,
  397. developers will gain experience with the process while, at the same time,
  398. building respect with the rest of the development community.