Commit 9c603f8f by Ben Elliston Committed by Ben Elliston

* doc/tree-ssa.texi (Interfaces): Describe low vs. high GIMPLE.

From-SVN: r111286
parent 3d8504ac
2006-02-20 Ben Elliston <bje@au.ibm.com>
* doc/tree-ssa.texi (Interfaces): Describe low vs. high GIMPLE.
2006-02-19 Roger Sayle <roger@eyesopen.com> 2006-02-19 Roger Sayle <roger@eyesopen.com>
Steven Bosscher <stevenb.gcc@gmail.com> Steven Bosscher <stevenb.gcc@gmail.com>
......
...@@ -132,6 +132,11 @@ convert the front end trees to GIMPLE@. Usually such a hook will involve ...@@ -132,6 +132,11 @@ convert the front end trees to GIMPLE@. Usually such a hook will involve
much of the same code for expanding front end trees to RTL@. This function much of the same code for expanding front end trees to RTL@. This function
can return fully lowered GIMPLE, or it can return GENERIC trees and let the can return fully lowered GIMPLE, or it can return GENERIC trees and let the
main gimplifier lower them the rest of the way; this is often simpler. main gimplifier lower them the rest of the way; this is often simpler.
GIMPLE that is not fully lowered is known as ``high GIMPLE'' and
consists of the IL before the pass @code{pass_lower_cf}. High GIMPLE
still contains lexical scopes and nested expressions, while low GIMPLE
exposes all of the implicit jumps for control expressions like
@code{COND_EXPR}.
The C and C++ front ends currently convert directly from front end The C and C++ front ends currently convert directly from front end
trees to GIMPLE, and hand that off to the back end rather than first trees to GIMPLE, and hand that off to the back end rather than first
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment