4.Coding.rst 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  1. .. _development_coding:
  2. Getting the code right
  3. ======================
  4. While there is much to be said for a solid and community-oriented design
  5. process, the proof of any kernel development project is in the resulting
  6. code. It is the code which will be examined by other developers and merged
  7. (or not) into the mainline tree. So it is the quality of this code which
  8. will determine the ultimate success of the project.
  9. This section will examine the coding process. We'll start with a look at a
  10. number of ways in which kernel developers can go wrong. Then the focus
  11. will shift toward doing things right and the tools which can help in that
  12. quest.
  13. Pitfalls
  14. ---------
  15. Coding style
  16. ************
  17. The kernel has long had a standard coding style, described in
  18. Documentation/CodingStyle. For much of that time, the policies described
  19. in that file were taken as being, at most, advisory. As a result, there is
  20. a substantial amount of code in the kernel which does not meet the coding
  21. style guidelines. The presence of that code leads to two independent
  22. hazards for kernel developers.
  23. The first of these is to believe that the kernel coding standards do not
  24. matter and are not enforced. The truth of the matter is that adding new
  25. code to the kernel is very difficult if that code is not coded according to
  26. the standard; many developers will request that the code be reformatted
  27. before they will even review it. A code base as large as the kernel
  28. requires some uniformity of code to make it possible for developers to
  29. quickly understand any part of it. So there is no longer room for
  30. strangely-formatted code.
  31. Occasionally, the kernel's coding style will run into conflict with an
  32. employer's mandated style. In such cases, the kernel's style will have to
  33. win before the code can be merged. Putting code into the kernel means
  34. giving up a degree of control in a number of ways - including control over
  35. how the code is formatted.
  36. The other trap is to assume that code which is already in the kernel is
  37. urgently in need of coding style fixes. Developers may start to generate
  38. reformatting patches as a way of gaining familiarity with the process, or
  39. as a way of getting their name into the kernel changelogs - or both. But
  40. pure coding style fixes are seen as noise by the development community;
  41. they tend to get a chilly reception. So this type of patch is best
  42. avoided. It is natural to fix the style of a piece of code while working
  43. on it for other reasons, but coding style changes should not be made for
  44. their own sake.
  45. The coding style document also should not be read as an absolute law which
  46. can never be transgressed. If there is a good reason to go against the
  47. style (a line which becomes far less readable if split to fit within the
  48. 80-column limit, for example), just do it.
  49. Abstraction layers
  50. ******************
  51. Computer Science professors teach students to make extensive use of
  52. abstraction layers in the name of flexibility and information hiding.
  53. Certainly the kernel makes extensive use of abstraction; no project
  54. involving several million lines of code could do otherwise and survive.
  55. But experience has shown that excessive or premature abstraction can be
  56. just as harmful as premature optimization. Abstraction should be used to
  57. the level required and no further.
  58. At a simple level, consider a function which has an argument which is
  59. always passed as zero by all callers. One could retain that argument just
  60. in case somebody eventually needs to use the extra flexibility that it
  61. provides. By that time, though, chances are good that the code which
  62. implements this extra argument has been broken in some subtle way which was
  63. never noticed - because it has never been used. Or, when the need for
  64. extra flexibility arises, it does not do so in a way which matches the
  65. programmer's early expectation. Kernel developers will routinely submit
  66. patches to remove unused arguments; they should, in general, not be added
  67. in the first place.
  68. Abstraction layers which hide access to hardware - often to allow the bulk
  69. of a driver to be used with multiple operating systems - are especially
  70. frowned upon. Such layers obscure the code and may impose a performance
  71. penalty; they do not belong in the Linux kernel.
  72. On the other hand, if you find yourself copying significant amounts of code
  73. from another kernel subsystem, it is time to ask whether it would, in fact,
  74. make sense to pull out some of that code into a separate library or to
  75. implement that functionality at a higher level. There is no value in
  76. replicating the same code throughout the kernel.
  77. #ifdef and preprocessor use in general
  78. **************************************
  79. The C preprocessor seems to present a powerful temptation to some C
  80. programmers, who see it as a way to efficiently encode a great deal of
  81. flexibility into a source file. But the preprocessor is not C, and heavy
  82. use of it results in code which is much harder for others to read and
  83. harder for the compiler to check for correctness. Heavy preprocessor use
  84. is almost always a sign of code which needs some cleanup work.
  85. Conditional compilation with #ifdef is, indeed, a powerful feature, and it
  86. is used within the kernel. But there is little desire to see code which is
  87. sprinkled liberally with #ifdef blocks. As a general rule, #ifdef use
  88. should be confined to header files whenever possible.
  89. Conditionally-compiled code can be confined to functions which, if the code
  90. is not to be present, simply become empty. The compiler will then quietly
  91. optimize out the call to the empty function. The result is far cleaner
  92. code which is easier to follow.
  93. C preprocessor macros present a number of hazards, including possible
  94. multiple evaluation of expressions with side effects and no type safety.
  95. If you are tempted to define a macro, consider creating an inline function
  96. instead. The code which results will be the same, but inline functions are
  97. easier to read, do not evaluate their arguments multiple times, and allow
  98. the compiler to perform type checking on the arguments and return value.
  99. Inline functions
  100. ****************
  101. Inline functions present a hazard of their own, though. Programmers can
  102. become enamored of the perceived efficiency inherent in avoiding a function
  103. call and fill a source file with inline functions. Those functions,
  104. however, can actually reduce performance. Since their code is replicated
  105. at each call site, they end up bloating the size of the compiled kernel.
  106. That, in turn, creates pressure on the processor's memory caches, which can
  107. slow execution dramatically. Inline functions, as a rule, should be quite
  108. small and relatively rare. The cost of a function call, after all, is not
  109. that high; the creation of large numbers of inline functions is a classic
  110. example of premature optimization.
  111. In general, kernel programmers ignore cache effects at their peril. The
  112. classic time/space tradeoff taught in beginning data structures classes
  113. often does not apply to contemporary hardware. Space *is* time, in that a
  114. larger program will run slower than one which is more compact.
  115. More recent compilers take an increasingly active role in deciding whether
  116. a given function should actually be inlined or not. So the liberal
  117. placement of "inline" keywords may not just be excessive; it could also be
  118. irrelevant.
  119. Locking
  120. *******
  121. In May, 2006, the "Devicescape" networking stack was, with great
  122. fanfare, released under the GPL and made available for inclusion in the
  123. mainline kernel. This donation was welcome news; support for wireless
  124. networking in Linux was considered substandard at best, and the Devicescape
  125. stack offered the promise of fixing that situation. Yet, this code did not
  126. actually make it into the mainline until June, 2007 (2.6.22). What
  127. happened?
  128. This code showed a number of signs of having been developed behind
  129. corporate doors. But one large problem in particular was that it was not
  130. designed to work on multiprocessor systems. Before this networking stack
  131. (now called mac80211) could be merged, a locking scheme needed to be
  132. retrofitted onto it.
  133. Once upon a time, Linux kernel code could be developed without thinking
  134. about the concurrency issues presented by multiprocessor systems. Now,
  135. however, this document is being written on a dual-core laptop. Even on
  136. single-processor systems, work being done to improve responsiveness will
  137. raise the level of concurrency within the kernel. The days when kernel
  138. code could be written without thinking about locking are long past.
  139. Any resource (data structures, hardware registers, etc.) which could be
  140. accessed concurrently by more than one thread must be protected by a lock.
  141. New code should be written with this requirement in mind; retrofitting
  142. locking after the fact is a rather more difficult task. Kernel developers
  143. should take the time to understand the available locking primitives well
  144. enough to pick the right tool for the job. Code which shows a lack of
  145. attention to concurrency will have a difficult path into the mainline.
  146. Regressions
  147. ***********
  148. One final hazard worth mentioning is this: it can be tempting to make a
  149. change (which may bring big improvements) which causes something to break
  150. for existing users. This kind of change is called a "regression," and
  151. regressions have become most unwelcome in the mainline kernel. With few
  152. exceptions, changes which cause regressions will be backed out if the
  153. regression cannot be fixed in a timely manner. Far better to avoid the
  154. regression in the first place.
  155. It is often argued that a regression can be justified if it causes things
  156. to work for more people than it creates problems for. Why not make a
  157. change if it brings new functionality to ten systems for each one it
  158. breaks? The best answer to this question was expressed by Linus in July,
  159. 2007:
  160. ::
  161. So we don't fix bugs by introducing new problems. That way lies
  162. madness, and nobody ever knows if you actually make any real
  163. progress at all. Is it two steps forwards, one step back, or one
  164. step forward and two steps back?
  165. (http://lwn.net/Articles/243460/).
  166. An especially unwelcome type of regression is any sort of change to the
  167. user-space ABI. Once an interface has been exported to user space, it must
  168. be supported indefinitely. This fact makes the creation of user-space
  169. interfaces particularly challenging: since they cannot be changed in
  170. incompatible ways, they must be done right the first time. For this
  171. reason, a great deal of thought, clear documentation, and wide review for
  172. user-space interfaces is always required.
  173. Code checking tools
  174. -------------------
  175. For now, at least, the writing of error-free code remains an ideal that few
  176. of us can reach. What we can hope to do, though, is to catch and fix as
  177. many of those errors as possible before our code goes into the mainline
  178. kernel. To that end, the kernel developers have put together an impressive
  179. array of tools which can catch a wide variety of obscure problems in an
  180. automated way. Any problem caught by the computer is a problem which will
  181. not afflict a user later on, so it stands to reason that the automated
  182. tools should be used whenever possible.
  183. The first step is simply to heed the warnings produced by the compiler.
  184. Contemporary versions of gcc can detect (and warn about) a large number of
  185. potential errors. Quite often, these warnings point to real problems.
  186. Code submitted for review should, as a rule, not produce any compiler
  187. warnings. When silencing warnings, take care to understand the real cause
  188. and try to avoid "fixes" which make the warning go away without addressing
  189. its cause.
  190. Note that not all compiler warnings are enabled by default. Build the
  191. kernel with "make EXTRA_CFLAGS=-W" to get the full set.
  192. The kernel provides several configuration options which turn on debugging
  193. features; most of these are found in the "kernel hacking" submenu. Several
  194. of these options should be turned on for any kernel used for development or
  195. testing purposes. In particular, you should turn on:
  196. - ENABLE_WARN_DEPRECATED, ENABLE_MUST_CHECK, and FRAME_WARN to get an
  197. extra set of warnings for problems like the use of deprecated interfaces
  198. or ignoring an important return value from a function. The output
  199. generated by these warnings can be verbose, but one need not worry about
  200. warnings from other parts of the kernel.
  201. - DEBUG_OBJECTS will add code to track the lifetime of various objects
  202. created by the kernel and warn when things are done out of order. If
  203. you are adding a subsystem which creates (and exports) complex objects
  204. of its own, consider adding support for the object debugging
  205. infrastructure.
  206. - DEBUG_SLAB can find a variety of memory allocation and use errors; it
  207. should be used on most development kernels.
  208. - DEBUG_SPINLOCK, DEBUG_ATOMIC_SLEEP, and DEBUG_MUTEXES will find a
  209. number of common locking errors.
  210. There are quite a few other debugging options, some of which will be
  211. discussed below. Some of them have a significant performance impact and
  212. should not be used all of the time. But some time spent learning the
  213. available options will likely be paid back many times over in short order.
  214. One of the heavier debugging tools is the locking checker, or "lockdep."
  215. This tool will track the acquisition and release of every lock (spinlock or
  216. mutex) in the system, the order in which locks are acquired relative to
  217. each other, the current interrupt environment, and more. It can then
  218. ensure that locks are always acquired in the same order, that the same
  219. interrupt assumptions apply in all situations, and so on. In other words,
  220. lockdep can find a number of scenarios in which the system could, on rare
  221. occasion, deadlock. This kind of problem can be painful (for both
  222. developers and users) in a deployed system; lockdep allows them to be found
  223. in an automated manner ahead of time. Code with any sort of non-trivial
  224. locking should be run with lockdep enabled before being submitted for
  225. inclusion.
  226. As a diligent kernel programmer, you will, beyond doubt, check the return
  227. status of any operation (such as a memory allocation) which can fail. The
  228. fact of the matter, though, is that the resulting failure recovery paths
  229. are, probably, completely untested. Untested code tends to be broken code;
  230. you could be much more confident of your code if all those error-handling
  231. paths had been exercised a few times.
  232. The kernel provides a fault injection framework which can do exactly that,
  233. especially where memory allocations are involved. With fault injection
  234. enabled, a configurable percentage of memory allocations will be made to
  235. fail; these failures can be restricted to a specific range of code.
  236. Running with fault injection enabled allows the programmer to see how the
  237. code responds when things go badly. See
  238. Documentation/fault-injection/fault-injection.txt for more information on
  239. how to use this facility.
  240. Other kinds of errors can be found with the "sparse" static analysis tool.
  241. With sparse, the programmer can be warned about confusion between
  242. user-space and kernel-space addresses, mixture of big-endian and
  243. small-endian quantities, the passing of integer values where a set of bit
  244. flags is expected, and so on. Sparse must be installed separately (it can
  245. be found at https://sparse.wiki.kernel.org/index.php/Main_Page if your
  246. distributor does not package it); it can then be run on the code by adding
  247. "C=1" to your make command.
  248. The "Coccinelle" tool (http://coccinelle.lip6.fr/) is able to find a wide
  249. variety of potential coding problems; it can also propose fixes for those
  250. problems. Quite a few "semantic patches" for the kernel have been packaged
  251. under the scripts/coccinelle directory; running "make coccicheck" will run
  252. through those semantic patches and report on any problems found. See
  253. Documentation/coccinelle.txt for more information.
  254. Other kinds of portability errors are best found by compiling your code for
  255. other architectures. If you do not happen to have an S/390 system or a
  256. Blackfin development board handy, you can still perform the compilation
  257. step. A large set of cross compilers for x86 systems can be found at
  258. http://www.kernel.org/pub/tools/crosstool/
  259. Some time spent installing and using these compilers will help avoid
  260. embarrassment later.
  261. Documentation
  262. -------------
  263. Documentation has often been more the exception than the rule with kernel
  264. development. Even so, adequate documentation will help to ease the merging
  265. of new code into the kernel, make life easier for other developers, and
  266. will be helpful for your users. In many cases, the addition of
  267. documentation has become essentially mandatory.
  268. The first piece of documentation for any patch is its associated
  269. changelog. Log entries should describe the problem being solved, the form
  270. of the solution, the people who worked on the patch, any relevant
  271. effects on performance, and anything else that might be needed to
  272. understand the patch. Be sure that the changelog says *why* the patch is
  273. worth applying; a surprising number of developers fail to provide that
  274. information.
  275. Any code which adds a new user-space interface - including new sysfs or
  276. /proc files - should include documentation of that interface which enables
  277. user-space developers to know what they are working with. See
  278. Documentation/ABI/README for a description of how this documentation should
  279. be formatted and what information needs to be provided.
  280. The file Documentation/kernel-parameters.txt describes all of the kernel's
  281. boot-time parameters. Any patch which adds new parameters should add the
  282. appropriate entries to this file.
  283. Any new configuration options must be accompanied by help text which
  284. clearly explains the options and when the user might want to select them.
  285. Internal API information for many subsystems is documented by way of
  286. specially-formatted comments; these comments can be extracted and formatted
  287. in a number of ways by the "kernel-doc" script. If you are working within
  288. a subsystem which has kerneldoc comments, you should maintain them and add
  289. them, as appropriate, for externally-available functions. Even in areas
  290. which have not been so documented, there is no harm in adding kerneldoc
  291. comments for the future; indeed, this can be a useful activity for
  292. beginning kernel developers. The format of these comments, along with some
  293. information on how to create kerneldoc templates can be found in the file
  294. Documentation/kernel-documentation.rst.
  295. Anybody who reads through a significant amount of existing kernel code will
  296. note that, often, comments are most notable by their absence. Once again,
  297. the expectations for new code are higher than they were in the past;
  298. merging uncommented code will be harder. That said, there is little desire
  299. for verbosely-commented code. The code should, itself, be readable, with
  300. comments explaining the more subtle aspects.
  301. Certain things should always be commented. Uses of memory barriers should
  302. be accompanied by a line explaining why the barrier is necessary. The
  303. locking rules for data structures generally need to be explained somewhere.
  304. Major data structures need comprehensive documentation in general.
  305. Non-obvious dependencies between separate bits of code should be pointed
  306. out. Anything which might tempt a code janitor to make an incorrect
  307. "cleanup" needs a comment saying why it is done the way it is. And so on.
  308. Internal API changes
  309. --------------------
  310. The binary interface provided by the kernel to user space cannot be broken
  311. except under the most severe circumstances. The kernel's internal
  312. programming interfaces, instead, are highly fluid and can be changed when
  313. the need arises. If you find yourself having to work around a kernel API,
  314. or simply not using a specific functionality because it does not meet your
  315. needs, that may be a sign that the API needs to change. As a kernel
  316. developer, you are empowered to make such changes.
  317. There are, of course, some catches. API changes can be made, but they need
  318. to be well justified. So any patch making an internal API change should be
  319. accompanied by a description of what the change is and why it is
  320. necessary. This kind of change should also be broken out into a separate
  321. patch, rather than buried within a larger patch.
  322. The other catch is that a developer who changes an internal API is
  323. generally charged with the task of fixing any code within the kernel tree
  324. which is broken by the change. For a widely-used function, this duty can
  325. lead to literally hundreds or thousands of changes - many of which are
  326. likely to conflict with work being done by other developers. Needless to
  327. say, this can be a large job, so it is best to be sure that the
  328. justification is solid. Note that the Coccinelle tool can help with
  329. wide-ranging API changes.
  330. When making an incompatible API change, one should, whenever possible,
  331. ensure that code which has not been updated is caught by the compiler.
  332. This will help you to be sure that you have found all in-tree uses of that
  333. interface. It will also alert developers of out-of-tree code that there is
  334. a change that they need to respond to. Supporting out-of-tree code is not
  335. something that kernel developers need to be worried about, but we also do
  336. not have to make life harder for out-of-tree developers than it needs to
  337. be.