Skip to main content

Reliable and Fast DWARF-Based Stack Unwinding

Bastian, Théophile, Kell, Stephen, Zappa Nardelli, Francesco (2019) Reliable and Fast DWARF-Based Stack Unwinding. Proceedings of the ACM on Programming Languages, 3 . Article Number 146. E-ISSN 2475-1421. (doi:10.1145/3360572) (KAR id:76575)

PDF Publisher pdf
Language: English

Creative Commons Licence
This work is licensed under a Creative Commons Attribution 4.0 International License.
Download (518kB) Preview
This file may not be suitable for user of assistive technology.
Request an accessible format.
PDF Author's Accepted Manuscript
Language: English

Restricted to Repository staff only
Contact us about this Publication
Official URL


Debug information, usually encoded in the DWARF format, is a hidden and obscure component of our computing infrastructure. Debug information is obviously used by debuggers, but it also plays a key role in program analysis tools, and, most surprisingly, it can be relied upon by the runtime of high-level programming languages. For instance the C++ runtime leverages DWARF stack unwind tables to implement exceptions!Alas, generating debug information adds significant burden to compiler implementations, and the debug information itself can be pervaded by subtle bugs, making the whole infrastructure unreliable. Additionally,interpreting the debug tables is a time-consuming task and, for some applications as sampling profilers, it turns out to be a performance bottleneck.In this paper we focus on the DWARF.eh_frame table, that enables stack unwinding in absence of frame-pointers. We will describe two techniques to perform validation and synthesis of the DWARF stack unwinding tables, and their implementation for the x86_64 architecture. The validation tool has proven effective for compiler and inline assembly testing, while the synthesis tool can generate DWARF unwind tables for arbitrary binaries lacking debug information. Additionally, we report on a technique to precompile unwind tables into native x86_64 code, which we have implemented and integrated into libunwind, resulting in 11x-25xDWARF-based unwind speedups.

Item Type: Article
DOI/Identification number: 10.1145/3360572
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Depositing User: Stephen Kell
Date Deposited: 17 Sep 2019 17:20 UTC
Last Modified: 20 Jan 2021 10:37 UTC
Resource URI: (The current URI for this page, for reference purposes)
Kell, Stephen:
  • Depositors only (login required):