| Authors: | Slava Pestov |
| Class | Superclass | Slots |
| in-d out-d | ||
| params child | ||
| in-d out-d | ||
| in-d out-d | ||
| params | ||
| in-d children live-branches | ||
| word in-d out-d body method class info | ||
| label in-d out-d info | ||
| in-d out-d | ||
| declaration | ||
| in-d out-d label info | ||
| out-d | ||
| phi-in-d phi-info-d out-d terminated | ||
| literal out-d | ||
| in-d word label loop? child | ||
| in-d info | ||
| in-d out-d label info | ||
| mapping in-d out-d in-r out-r | ||
| in-d in-r | ||
| Word | Stack effect |
| ( #renaming -- inputs outputs ) |
| Word | Stack effect |
| ( params -- node ) | |
| ( params child -- node ) | |
| ( params -- node ) | |
| ( params -- node ) | |
| ( inputs outputs label -- node ) | |
| ( inputs outputs word -- node ) | |
| ( inputs outputs -- node ) | |
| ( in-d out-d mapping -- node ) | |
| ( declaration -- node ) | |
| ( n branches -- node ) | |
| ( inputs -- node ) | |
| ( label inputs outputs -- node ) | |
| ( ? true false -- node ) | |
| ( out-d -- node ) | |
| ( d-phi-in d-phi-out terminated -- node ) | |
| ( literal value -- node ) | |
| ( label inputs child -- node ) | |
| ( label inputs outputs -- node ) | |
| ( stack -- node ) | |
| ( in-d out-d in-r out-r mapping -- node ) | |
| ( in-d in-r -- node ) | |
| ( nodes -- ? ) | |
| ( params class -- node ) | |
| ( value children class -- node ) | |
| ( node -- ) |
| Word | Stack effect |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) | |
| ( object -- ? ) |
| Vocabulary | Summary |
| Constructing high-level tree IR | |
| Debugging tool for checking various invariants of tree IR | |
| Finalizing speculative inlining and constant folding from propagation pass | |
| Combinators for iterating over tree IR | |
| Utilities for working with binary comparison operations | |
| Dead code elimination | |
| Tools for debugging high-level optimizer | |
| Def/use chain construction | |
| Escape analysis for tuple unboxing | |
| Final pass cleans up high-level IR | |
| Applying arithmetic identities to integer code | |
| Utilities used by several optimization passes run in the later stages | |
| Modular arithmetic optimization | |
| Normalize IR created by high level IR builder to simplify subsequent passes | |
| Top-level harness for high-level optimizer | |
| Class, interval, constant propagation | |
| Analysis of inline recursive combinators and loop detection | |
| Tuple unboxing |