Revision 6aeb3388 src/scheduling.ml
src/scheduling.ml | ||
---|---|---|
30 | 30 |
(* Topological sort with a priority for variables belonging in the same equation lhs. |
31 | 31 |
For variables still unrelated, standard compare is used to choose the minimal element. |
32 | 32 |
This priority is used since it helps a lot in factorizing generated code. |
33 |
Moreover, the dependency graph is browsed in a depth-first manner whenever possible, |
|
34 |
to improve the behavior of optimization algorithms applied in forthcoming compilation steps. |
|
33 | 35 |
In the following functions: |
34 | 36 |
- [eq_equiv] is the equivalence relation between vars of the same equation lhs |
35 | 37 |
- [g] the (imperative) graph to be topologically sorted |
Also available in: Unified diff