| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 38 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
77 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
85 loop_tail = source(back_edge, g); in compute_loop_extent()
86 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| H A D | dfs.cpp | 67 void back_edge(Edge e, Graph& G) { in back_edge() function
70 Base::back_edge(e, G); in back_edge()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 38 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
77 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
85 loop_tail = source(back_edge, g); in compute_loop_extent()
86 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| H A D | dfs.cpp | 67 void back_edge(Edge e, Graph& G) { in back_edge() function
70 Base::back_edge(e, G); in back_edge()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 30 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
70 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
78 loop_tail = source(back_edge, g); in compute_loop_extent()
79 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| H A D | dfs.cpp | 67 void back_edge(Edge e, Graph& G) { in back_edge() function
70 Base::back_edge(e, G); in back_edge()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 30 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
70 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
78 loop_tail = source(back_edge, g); in compute_loop_extent()
79 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| H A D | dfs.cpp | 67 void back_edge(Edge e, Graph& G) { in back_edge() function
70 Base::back_edge(e, G); in back_edge()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 30 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
70 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
78 loop_tail = source(back_edge, g); in compute_loop_extent()
79 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| H A D | dfs.cpp | 67 void back_edge(Edge e, Graph& G) { in back_edge() function
70 Base::back_edge(e, G); in back_edge()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 30 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
70 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
78 loop_tail = source(back_edge, g); in compute_loop_extent()
79 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 30 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
70 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
78 loop_tail = source(back_edge, g); in compute_loop_extent()
79 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 38 void back_edge(Edge e, const Graph &) in back_edge() function in back_edge_recorder
77 Graph >::edge_descriptor back_edge, const Graph & g, in compute_loop_extent()
85 loop_tail = source(back_edge, g); in compute_loop_extent()
86 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 50 vis.back_edge(*ei, g); in dfs_v1()
82 back_edge(E, const G &) in back_edge() function
104 back_edge(edge_t, const file_dep_graph &) in back_edge() function
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | loops_dfs.cpp | 38 void back_edge(Edge e, const Graph&) in back_edge() function in back_edge_recorder
79 typename graph_traits< Graph >::edge_descriptor back_edge, const Graph& g, in compute_loop_extent()
87 loop_tail = source(back_edge, g); in compute_loop_extent()
88 loop_head = target(back_edge, g); in compute_loop_extent()
|
| H A D | cycle-file-dep2.cpp | 53 vis.back_edge(*ei, g); in dfs_v1()
79 template < typename E, typename G > void back_edge(E, const G&) {} in back_edge() function
91 void back_edge(edge_t, const file_dep_graph&) { has_cycle = true; } in back_edge() function
|
| /dports/devel/csmith/csmith-2.3.0/src/ |
| H A D | StatementGoto.cpp | 74 bool back_edge = false; in make_random() local
81 back_edge = true; in make_random()
85 back_edge = false; in make_random()
119 if (back_edge) { in make_random()
135 if (back_edge) { in make_random()
|
| /dports/lang/ghc/ghc-8.10.7/rts/ |
| H A D | Profiling.c | 681 CostCentre *cc, bool back_edge) in addToIndexTable() argument
690 new_it->back_edge = back_edge; in addToIndexTable()
755 if (!i->back_edge) { in countTickss_()
785 if (!i->back_edge) { in inheritCosts()
803 if (!i->back_edge) { in aggregateCCCosts()
821 if (i->back_edge) { continue; } in pruneCCSTree()
882 if (!tbl->back_edge) in sortCCSTree()
|