Reliable and Fast DWARF-Based Stack Unwinding

Théophile Bastian (1) , Stephen Kell (2) , Francesco Zappa Nardelli (3)

1 DI-ENS - Département d'informatique - ENS Paris
2 University of Kent [Canterbury]
3 Parkas - Parallélisme de Kahn Synchrone

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-25x DWARF-based unwind speedups.

Mots clés: Stack unwinding; Compilers; Debugging

Domaines: Langage de programmation [cs.PL]

Théophile Bastian, Stephen Kell, Francesco Zappa Nardelli. Reliable and Fast DWARF-Based Stack Unwinding. Proceedings of the ACM on Programming Languages, 2019, OOPSLA, ⟨10.1145/3360572⟩. ⟨hal-02297690⟩