![]() |
PandA-2024.02
|
implementation of loops finding algorithm More...
#include "loops.hpp"#include "config_HAVE_HOST_PROFILING_BUILT.hpp"#include "custom_map.hpp"#include "custom_set.hpp"#include <boost/graph/depth_first_search.hpp>#include <boost/graph/graph_traits.hpp>#include <iosfwd>#include <list>#include <ostream>#include <utility>#include <vector>#include "Dominance.hpp"#include "Parameter.hpp"#include "Vertex.hpp"#include "basic_block.hpp"#include "basic_blocks_graph_constructor.hpp"#include "behavioral_helper.hpp"#include "behavioral_writer_helper.hpp"#include "dbgPrintHelper.hpp"#include "exceptions.hpp"#include "function_behavior.hpp"#include "graph.hpp"#include "hash_helper.hpp"#include "loop.hpp"#include "string_manipulation.hpp"#include "tree_basic_block.hpp"
Go to the source code of this file.
Data Structures | |
| struct | djgraph_dfs_tree_visitor |
| Header include. More... | |
Functions | |
| static bool | check_ancestor (vertex x, vertex y, const vertex2obj< vertex > &parent_depth_search_spanning_tree) |
implementation of loops finding algorithm
Loops are detection described in in Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee: Identifying Loops Using DJ Graphs. ACM Trans. Program. Lang. Syst. 18(6): 649-658 (1996)
Definition in file loops.cpp.
|
static |
Definition at line 209 of file loops.cpp.
Referenced by Loops::DetectLoops().

1.8.13