A manifest expression is a computer programming construct that a compiler can fully analyze and predict which values it can take. This information can enable compiler optimizations, in particular loop nest optimization, and parallelization through data dependency analysis. An expression is called manifest if it is computed only from outer loop counters and constants (a more formal definition is given below). When all control flow for a loop or condition is regulated by manifest expressions, it is called a manifest loop resp. condition. Most practical applications of manifest expressions also require the expression to be integral and affine (or stepwise affine) in its variables.
Definition
A manifest expression is a compile time computable function which depends only on
- compile-time constants,
- manifest variable references, and
- loop counters of loops surrounding the expression.
A manifest variable reference is itself defined as a variable reference with
- a single, unambiguous definition of its value,
- which is itself a manifest expression.
The single, unambiguous definition is particularly relevant in procedural languages, where pointer analysis and/or data flow analysis is required to find the expression that defines the variable value. If several defining expressions are possible (e.g. because the variable is assigned in a condition), the variable reference is not manifest.
See also
- Polytope model which requires manifest loops and conditions
- Loop nest optimization
References
Feautrier, Paul (February 1991). "Dataflow analysis of array and scalar references". International Journal of Parallel Programming 20 (1): 23-53. Springer Netherlands. doi:10.1007/BF01407931. ISSN: 0885-7458 (Print), 1573-7640 (Online).
