spaette
commented
2 days ago @giordano
julia-1.11.0.pdf
Chapter 104 Documentation of Julia's Internals
The footnotes for 104.24 appear in the next subchapter 104.25.
$ grep -A 3 "partial lattice" julia/doc/src/devdocs/EscapeAnalysis.md
These attributes can be combined to create a partial lattice that has a finite height, given
the invariant that an input program has a finite number of statements, which is assured by Julia's semantics.
The clever part of this lattice design is that it enables a simpler implementation of
lattice operations by allowing them to handle each lattice property separately[^LatticeDesign].
$ grep -A 26 "alternative approach" julia/doc/src/devdocs/EscapeAnalysis.md
[^LatticeDesign]: Our type inference implementation takes the alternative approach,
where each lattice property is represented by a special lattice element type object.
It turns out that it started to complicate implementations of the lattice operations
mainly because it often requires conversion rules between each lattice element type object.
And we are working on [overhauling our type inference lattice implementation](https://github.com/JuliaLang/julia/pull/42596)
with `EscapeInfo`-like lattice design.
[^MM02]: _A Graph-Free approach to Data-Flow Analysis_.
Markas Mohnen, 2002, April.
<https://api.semanticscholar.org/CorpusID:28519618>.
[^BackandForth]: Our type inference algorithm in contrast is implemented as a forward analysis,
because type information usually flows from "definition" to "usage" and it is more
natural and effective to propagate such information in a forward way.
[^Dynamism]: In some cases, however, object fields can't be analyzed precisely.
For example, object may escape to somewhere `EscapeAnalysis` can't account for possible memory effects on it,
or fields of the objects simply can't be known because of the lack of type information.
In such cases `AliasInfo` property is raised to the topmost element within its own lattice order,
and it causes succeeding field analysis to be conservative and escape information imposed on
fields of an unanalyzable object to be propagated to the object itself.
[^JVM05]: _Escape Analysis in the Context of Dynamic Compilation and Deoptimization_.
Thomas Kotzmann and Hanspeter Mössenböck, 2005, June.
<https://dl.acm.org/doi/10.1145/1064979.1064996>.
[^ArrayDimension]: Otherwise we will need yet another forward data-flow analysis on top of the escape analysis.
$
The .html and .pdf do not render this correctly.
julia-1.11.0.pdf
The similar regarding the code pertaining to Dongarra.
The .html and .pdf do not render this correctly.