Implement performance estimation routines as post-order traversals.

[lapets]

Use the enter() and exit() functions provided by the Babel API to implement a stateless post-order traversal of the AST that keeps track of each intermediate result as an attribute in that subtree, as in this example.