Display the source code in dmd/backend/gdag.d from which this page was generated on github.

If you spot a problem with this page, click here to create a Bugzilla issue.

Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

Module `dmd.backend.gdag`

Directed acyclic graphs and global optimizer common subexpressions

Compiler implementation of the D programming language.

Coverage

https://codecov.io/gh/dlang/dmd/src/master/src/dmd/backend/gdag.d

Functions

Name	Description
`boolopt()`	Do optimizations based on if we know an expression is 0 or !=0, even though we don't know anything else.
`builddags()`	Build DAGs (basically find all the common subexpressions). Must be done after all other optimizations, because most of them depend on the trees being trees, not DAGs. The general strategy is: Compute available expressions (AEs) For each block stick together nodes that match, keeping AEs up to date For each block unstick unprofitable common subexpressions (this is generally target-dependent)

Authors

Walter Bright

License

Boost License 1.0