76 lines
2.2 KiB
Rust
76 lines
2.2 KiB
Rust
// Copyright 2012-2015 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.
|
|
|
|
//! Code for debugging the dep-graph.
|
|
|
|
use super::dep_node::DepNode;
|
|
use std::error::Error;
|
|
|
|
/// A dep-node filter goes from a user-defined string to a query over
|
|
/// nodes. Right now the format is like this:
|
|
///
|
|
/// x & y & z
|
|
///
|
|
/// where the format-string of the dep-node must contain `x`, `y`, and
|
|
/// `z`.
|
|
#[derive(Debug)]
|
|
pub struct DepNodeFilter {
|
|
text: String
|
|
}
|
|
|
|
impl DepNodeFilter {
|
|
pub fn new(text: &str) -> Self {
|
|
DepNodeFilter {
|
|
text: text.trim().to_string()
|
|
}
|
|
}
|
|
|
|
/// True if all nodes always pass the filter.
|
|
pub fn accepts_all(&self) -> bool {
|
|
self.text.is_empty()
|
|
}
|
|
|
|
/// Tests whether `node` meets the filter, returning true if so.
|
|
pub fn test(&self, node: &DepNode) -> bool {
|
|
let debug_str = format!("{:?}", node);
|
|
self.text.split("&")
|
|
.map(|s| s.trim())
|
|
.all(|f| debug_str.contains(f))
|
|
}
|
|
}
|
|
|
|
/// A filter like `F -> G` where `F` and `G` are valid dep-node
|
|
/// filters. This can be used to test the source/target independently.
|
|
pub struct EdgeFilter {
|
|
pub source: DepNodeFilter,
|
|
pub target: DepNodeFilter,
|
|
}
|
|
|
|
impl EdgeFilter {
|
|
pub fn new(test: &str) -> Result<EdgeFilter, Box<Error>> {
|
|
let parts: Vec<_> = test.split("->").collect();
|
|
if parts.len() != 2 {
|
|
Err(format!("expected a filter like `a&b -> c&d`, not `{}`", test).into())
|
|
} else {
|
|
Ok(EdgeFilter {
|
|
source: DepNodeFilter::new(parts[0]),
|
|
target: DepNodeFilter::new(parts[1]),
|
|
})
|
|
}
|
|
}
|
|
|
|
pub fn test(&self,
|
|
source: &DepNode,
|
|
target: &DepNode)
|
|
-> bool {
|
|
self.source.test(source) && self.target.test(target)
|
|
}
|
|
}
|