Data Fields | |
| basic_block * | stack |
| unsigned int | sp |
| sbitmap | visited_blocks |
Detailed Description
@verbatim
Control flow graph analysis code for GNU compiler. Copyright (C) 1987-2013 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see http://www.gnu.org/licenses/.
This file contains various simple utilities to analyze the CFG.
Store the data structures necessary for depth-first search.
Field Documentation
| unsigned int depth_first_search_dsS::sp |
number of edges in the stack. That is, positions 0, ..., sp-1
have edges.
Referenced by pre_and_rev_post_order_compute().
| basic_block* depth_first_search_dsS::stack |
stack for backtracking during the algorithm
Referenced by pre_and_rev_post_order_compute().
| sbitmap depth_first_search_dsS::visited_blocks |
record of basic blocks already seen by depth-first search
Referenced by pre_and_rev_post_order_compute().
The documentation for this struct was generated from the following file:
