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.

  • Bala, Vasanth; Duesterwald, Evelyn; Banerjia, Sanjeev (June 1999),
  • Gal, Andreas; Franz, Michael (November 2006), (PDF), CiteSeerX , S2CID
  • Gal, Andreas; Bebenita, Michael; Chang, Mason; Franz, Michael (October 2007), Making the Compilation "Pipeline" Explicit: Dynamic Compilation Using Trace Tree Serialization, CiteSeerX , S2CID
  • Double, Chris (February 2008),
  • Chang, Mason (January 12, 2009), , Hacking With Caffeine, archived from on 2020-01-29
  • Bolz, Carl Friedrich (March 2, 2009),