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::control_flow_graph::implementation as graph;
17 use hir::def_id::DefId;
23 pub owner_def_id: DefId,
29 #[derive(Copy, Clone, Debug, PartialEq)]
30 pub enum CFGNodeData {
31 AST(hir::ItemLocalId),
39 pub fn id(&self) -> hir::ItemLocalId {
40 if let CFGNodeData::AST(id) = *self {
43 hir::DUMMY_ITEM_LOCAL_ID
49 pub struct CFGEdgeData {
50 pub exiting_scopes: Vec<hir::ItemLocalId>
53 pub type CFGIndex = graph::NodeIndex;
55 pub type CFGGraph = graph::Graph<CFGNodeData, CFGEdgeData>;
57 pub type CFGNode = graph::Node<CFGNodeData>;
59 pub type CFGEdge = graph::Edge<CFGEdgeData>;
62 pub fn new<'a, 'tcx>(tcx: TyCtxt<'a, 'tcx, 'tcx>,
63 body: &hir::Body) -> CFG {
64 construct::construct(tcx, body)
67 pub fn node_is_reachable(&self, id: hir::ItemLocalId) -> bool {
68 self.graph.depth_traverse(self.entry, graph::OUTGOING)
69 .any(|idx| self.graph.node_data(idx).id() == id)