eee209d9e2
This narrows the definition of nested returns such that only when the outer return has a chance of being executed (due to the inner return being conditional) do we mark the function as having nested returns. Fixes #19684
60 lines
1.5 KiB
Rust
60 lines
1.5 KiB
Rust
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
//! Module that constructs a control-flow graph representing an item.
|
|
//! Uses `Graph` as the underlying representation.
|
|
|
|
use middle::graph;
|
|
use middle::ty;
|
|
use syntax::ast;
|
|
use util::nodemap::NodeMap;
|
|
|
|
mod construct;
|
|
pub mod graphviz;
|
|
|
|
pub struct CFG {
|
|
pub exit_map: NodeMap<CFGIndex>,
|
|
pub graph: CFGGraph,
|
|
pub entry: CFGIndex,
|
|
pub exit: CFGIndex,
|
|
}
|
|
|
|
pub struct CFGNodeData {
|
|
pub id: ast::NodeId
|
|
}
|
|
|
|
impl Copy for CFGNodeData {}
|
|
|
|
pub struct CFGEdgeData {
|
|
pub exiting_scopes: Vec<ast::NodeId>
|
|
}
|
|
|
|
pub type CFGIndex = graph::NodeIndex;
|
|
|
|
pub type CFGGraph = graph::Graph<CFGNodeData, CFGEdgeData>;
|
|
|
|
pub type CFGNode = graph::Node<CFGNodeData>;
|
|
|
|
pub type CFGEdge = graph::Edge<CFGEdgeData>;
|
|
|
|
impl CFG {
|
|
pub fn new(tcx: &ty::ctxt,
|
|
blk: &ast::Block) -> CFG {
|
|
construct::construct(tcx, blk)
|
|
}
|
|
|
|
pub fn node_is_reachable(&self, id: ast::NodeId) -> bool {
|
|
for node in self.graph.depth_traverse(self.entry) {
|
|
if node.id == id { return true }
|
|
}
|
|
return false;
|
|
}
|
|
}
|