1 // Copyright 2012 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Module that constructs a control-flow graph representing an item.
12 //! Uses `Graph` as the underlying representation.
14 use rustc_data_structures::graph;
28 #[derive(Copy, Clone, Debug, PartialEq)]
29 pub enum CFGNodeData {
38 pub fn id(&self) -> ast::NodeId {
39 if let CFGNodeData::AST(id) = *self {
48 pub struct CFGEdgeData {
49 pub exiting_scopes: Vec<ast::NodeId>
52 pub type CFGIndex = graph::NodeIndex;
54 pub type CFGGraph = graph::Graph<CFGNodeData, CFGEdgeData>;
56 pub type CFGNode = graph::Node<CFGNodeData>;
58 pub type CFGEdge = graph::Edge<CFGEdgeData>;
61 pub fn new(tcx: &ty::ctxt,
62 blk: &hir::Block) -> CFG {
63 construct::construct(tcx, blk)
66 pub fn node_is_reachable(&self, id: ast::NodeId) -> bool {
67 self.graph.depth_traverse(self.entry)
68 .any(|idx| self.graph.node_data(idx).id() == id)