orc-unwinder.txt 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
  1. ORC unwinder
  2. ============
  3. Overview
  4. --------
  5. The kernel CONFIG_UNWINDER_ORC option enables the ORC unwinder, which is
  6. similar in concept to a DWARF unwinder. The difference is that the
  7. format of the ORC data is much simpler than DWARF, which in turn allows
  8. the ORC unwinder to be much simpler and faster.
  9. The ORC data consists of unwind tables which are generated by objtool.
  10. They contain out-of-band data which is used by the in-kernel ORC
  11. unwinder. Objtool generates the ORC data by first doing compile-time
  12. stack metadata validation (CONFIG_STACK_VALIDATION). After analyzing
  13. all the code paths of a .o file, it determines information about the
  14. stack state at each instruction address in the file and outputs that
  15. information to the .orc_unwind and .orc_unwind_ip sections.
  16. The per-object ORC sections are combined at link time and are sorted and
  17. post-processed at boot time. The unwinder uses the resulting data to
  18. correlate instruction addresses with their stack states at run time.
  19. ORC vs frame pointers
  20. ---------------------
  21. With frame pointers enabled, GCC adds instrumentation code to every
  22. function in the kernel. The kernel's .text size increases by about
  23. 3.2%, resulting in a broad kernel-wide slowdown. Measurements by Mel
  24. Gorman [1] have shown a slowdown of 5-10% for some workloads.
  25. In contrast, the ORC unwinder has no effect on text size or runtime
  26. performance, because the debuginfo is out of band. So if you disable
  27. frame pointers and enable the ORC unwinder, you get a nice performance
  28. improvement across the board, and still have reliable stack traces.
  29. Ingo Molnar says:
  30. "Note that it's not just a performance improvement, but also an
  31. instruction cache locality improvement: 3.2% .text savings almost
  32. directly transform into a similarly sized reduction in cache
  33. footprint. That can transform to even higher speedups for workloads
  34. whose cache locality is borderline."
  35. Another benefit of ORC compared to frame pointers is that it can
  36. reliably unwind across interrupts and exceptions. Frame pointer based
  37. unwinds can sometimes skip the caller of the interrupted function, if it
  38. was a leaf function or if the interrupt hit before the frame pointer was
  39. saved.
  40. The main disadvantage of the ORC unwinder compared to frame pointers is
  41. that it needs more memory to store the ORC unwind tables: roughly 2-4MB
  42. depending on the kernel config.
  43. ORC vs DWARF
  44. ------------
  45. ORC debuginfo's advantage over DWARF itself is that it's much simpler.
  46. It gets rid of the complex DWARF CFI state machine and also gets rid of
  47. the tracking of unnecessary registers. This allows the unwinder to be
  48. much simpler, meaning fewer bugs, which is especially important for
  49. mission critical oops code.
  50. The simpler debuginfo format also enables the unwinder to be much faster
  51. than DWARF, which is important for perf and lockdep. In a basic
  52. performance test by Jiri Slaby [2], the ORC unwinder was about 20x
  53. faster than an out-of-tree DWARF unwinder. (Note: That measurement was
  54. taken before some performance tweaks were added, which doubled
  55. performance, so the speedup over DWARF may be closer to 40x.)
  56. The ORC data format does have a few downsides compared to DWARF. ORC
  57. unwind tables take up ~50% more RAM (+1.3MB on an x86 defconfig kernel)
  58. than DWARF-based eh_frame tables.
  59. Another potential downside is that, as GCC evolves, it's conceivable
  60. that the ORC data may end up being *too* simple to describe the state of
  61. the stack for certain optimizations. But IMO this is unlikely because
  62. GCC saves the frame pointer for any unusual stack adjustments it does,
  63. so I suspect we'll really only ever need to keep track of the stack
  64. pointer and the frame pointer between call frames. But even if we do
  65. end up having to track all the registers DWARF tracks, at least we will
  66. still be able to control the format, e.g. no complex state machines.
  67. ORC unwind table generation
  68. ---------------------------
  69. The ORC data is generated by objtool. With the existing compile-time
  70. stack metadata validation feature, objtool already follows all code
  71. paths, and so it already has all the information it needs to be able to
  72. generate ORC data from scratch. So it's an easy step to go from stack
  73. validation to ORC data generation.
  74. It should be possible to instead generate the ORC data with a simple
  75. tool which converts DWARF to ORC data. However, such a solution would
  76. be incomplete due to the kernel's extensive use of asm, inline asm, and
  77. special sections like exception tables.
  78. That could be rectified by manually annotating those special code paths
  79. using GNU assembler .cfi annotations in .S files, and homegrown
  80. annotations for inline asm in .c files. But asm annotations were tried
  81. in the past and were found to be unmaintainable. They were often
  82. incorrect/incomplete and made the code harder to read and keep updated.
  83. And based on looking at glibc code, annotating inline asm in .c files
  84. might be even worse.
  85. Objtool still needs a few annotations, but only in code which does
  86. unusual things to the stack like entry code. And even then, far fewer
  87. annotations are needed than what DWARF would need, so they're much more
  88. maintainable than DWARF CFI annotations.
  89. So the advantages of using objtool to generate ORC data are that it
  90. gives more accurate debuginfo, with very few annotations. It also
  91. insulates the kernel from toolchain bugs which can be very painful to
  92. deal with in the kernel since we often have to workaround issues in
  93. older versions of the toolchain for years.
  94. The downside is that the unwinder now becomes dependent on objtool's
  95. ability to reverse engineer GCC code flow. If GCC optimizations become
  96. too complicated for objtool to follow, the ORC data generation might
  97. stop working or become incomplete. (It's worth noting that livepatch
  98. already has such a dependency on objtool's ability to follow GCC code
  99. flow.)
  100. If newer versions of GCC come up with some optimizations which break
  101. objtool, we may need to revisit the current implementation. Some
  102. possible solutions would be asking GCC to make the optimizations more
  103. palatable, or having objtool use DWARF as an additional input, or
  104. creating a GCC plugin to assist objtool with its analysis. But for now,
  105. objtool follows GCC code quite well.
  106. Unwinder implementation details
  107. -------------------------------
  108. Objtool generates the ORC data by integrating with the compile-time
  109. stack metadata validation feature, which is described in detail in
  110. tools/objtool/Documentation/stack-validation.txt. After analyzing all
  111. the code paths of a .o file, it creates an array of orc_entry structs,
  112. and a parallel array of instruction addresses associated with those
  113. structs, and writes them to the .orc_unwind and .orc_unwind_ip sections
  114. respectively.
  115. The ORC data is split into the two arrays for performance reasons, to
  116. make the searchable part of the data (.orc_unwind_ip) more compact. The
  117. arrays are sorted in parallel at boot time.
  118. Performance is further improved by the use of a fast lookup table which
  119. is created at runtime. The fast lookup table associates a given address
  120. with a range of indices for the .orc_unwind table, so that only a small
  121. subset of the table needs to be searched.
  122. Etymology
  123. ---------
  124. Orcs, fearsome creatures of medieval folklore, are the Dwarves' natural
  125. enemies. Similarly, the ORC unwinder was created in opposition to the
  126. complexity and slowness of DWARF.
  127. "Although Orcs rarely consider multiple solutions to a problem, they do
  128. excel at getting things done because they are creatures of action, not
  129. thought." [3] Similarly, unlike the esoteric DWARF unwinder, the
  130. veracious ORC unwinder wastes no time or siloconic effort decoding
  131. variable-length zero-extended unsigned-integer byte-coded
  132. state-machine-based debug information entries.
  133. Similar to how Orcs frequently unravel the well-intentioned plans of
  134. their adversaries, the ORC unwinder frequently unravels stacks with
  135. brutal, unyielding efficiency.
  136. ORC stands for Oops Rewind Capability.
  137. [1] https://lkml.kernel.org/r/20170602104048.jkkzssljsompjdwy@suse.de
  138. [2] https://lkml.kernel.org/r/d2ca5435-6386-29b8-db87-7f227c2b713a@suse.cz
  139. [3] http://dustin.wikidot.com/half-orcs-and-orcs