Trace tree
A trace tree is a data structure that is used in the runtime compilation of programming code. Trace trees are used in tracing just-in-time compilation where tracing is used during code execution to look for hot spots before compilation. When those hot spots are entered again the compiled code is run instead. Each statement executed is traced, including within other function calls, and the entire execution path is compiled. This is different from compiling individual functions. More information can be gained allowing better compiler optimizations, including the removal of some function call overhead. The interpreter is called to continue whenever compiled code makes calls to code outside the compilation contexts.
References
[edit]- Bala, Vasanth; Duesterwald, Evelyn; Banerjia, Sanjeev (June 1999), Transparent Dynamic Optimization: The Design and Implementation of Dynamo, retrieved 2020-12-18
- Gal, Andreas; Franz, Michael (November 2006), Incremental Dynamic Code Generation with Trace Trees (PDF), CiteSeerX 10.1.1.113.557, S2CID 9352256, retrieved 2020-12-18
- Gal, Andreas; Bebenita, Michael; Chang, Mason; Franz, Michael (October 2007), Making the Compilation "Pipeline" Explicit: Dynamic Compilation Using Trace Tree Serialization, CiteSeerX 10.1.1.85.2412, S2CID 14848180
- Double, Chris (February 2008), Quick Introduction to Tamarin Tracing, retrieved 2020-12-18
- Chang, Mason (January 12, 2009), "The Difference Between Extended Basic Blocks and Traces", Hacking With Caffeine, archived from the original on 2020-01-29
- Bolz, Carl Friedrich (March 2, 2009), PyPy Blog: Applying a Tracing JIT to an Interpreter, retrieved 2020-12-18