Commit 43186552 by Nicklas Bo Jensen Committed by Jeff Law

loop.texi (Loop Analysis and Representation): Document loop_depth function.

        * doc/loop.texi (Loop Analysis and Representation): Document
	loop_depth function.

From-SVN: r232389
parent bf93d543
2016-01-14 Nicklas Bo Jensen <nbjensen@gmail.com>
* doc/loop.texi (Loop Analysis and Representation): Document
loop_depth function.
2016-01-14 Tom de Vries <tom@codesourcery.com> 2016-01-14 Tom de Vries <tom@codesourcery.com>
PR tree-optimization/68773 PR tree-optimization/68773
......
...@@ -173,8 +173,6 @@ loop structure (that are kept up-to-date at all times) are: ...@@ -173,8 +173,6 @@ loop structure (that are kept up-to-date at all times) are:
loop. loop.
@item @code{num_nodes}: Number of basic blocks in the loop (including @item @code{num_nodes}: Number of basic blocks in the loop (including
the basic blocks of the sub-loops). the basic blocks of the sub-loops).
@item @code{depth}: The depth of the loop in the loops tree, i.e., the
number of super-loops of the loop.
@item @code{outer}, @code{inner}, @code{next}: The super-loop, the first @item @code{outer}, @code{inner}, @code{next}: The super-loop, the first
sub-loop, and the sibling of the loop in the loops tree. sub-loop, and the sibling of the loop in the loops tree.
@end itemize @end itemize
...@@ -186,6 +184,8 @@ should not be accessed directly. ...@@ -186,6 +184,8 @@ should not be accessed directly.
The most important functions to query loop structures are: The most important functions to query loop structures are:
@itemize @itemize
@item @code{loop_depth}: The depth of the loop in the loops tree, i.e., the
number of super-loops of the loop.
@item @code{flow_loops_dump}: Dumps the information about loops to a @item @code{flow_loops_dump}: Dumps the information about loops to a
file. file.
@item @code{verify_loop_structure}: Checks consistency of the loop @item @code{verify_loop_structure}: Checks consistency of the loop
......
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