Re:How do compilers optimize divisions?
by techdragon on Tuesday February 21, 2017 @05:56AM
(#13694708)
How did I go so far without hearing the path of execution described as a DAG. Damn that's a useful concept.
I might start prototyping some things in DAG notation just to avoid ever forgetting this conceptual abstraction.
Re:How do compilers optimize divisions?
by barrkel on Tuesday February 21, 2017 @07:57AM
(#13695083)
Expressions are DAGs after common subexpression elimination. DAGs are what you get when you symbolically evaluate expressions on a stack machine without backward edges in control flow. Leave out the backward edges and the phi nodes they create, and you get DAGs from SSA form as well (but sequencing has information that you lose).
You might be interested in "FIRM—A Graph-Based Intermediate Representation" http://pp.ipd.kit.edu/publication.php?id=braun11wir
(I'm one of the authors)
There's a nice overview for people with a passing interest here: http://www.lighterra.com/papers/basicinstructionscheduling/