use rustc::lint::*;
use rustc_front::hir::*;
-use utils::{get_parent_expr, in_macro, is_block_equal, is_exp_equal, span_lint, span_note_and_lint};
+use utils::SpanlessEq;
+use utils::{get_parent_expr, in_macro, span_lint, span_note_and_lint};
/// **What it does:** This lint checks for consecutive `ifs` with the same condition. This lint is
/// `Warn` by default.
fn lint_same_then_else(cx: &LateContext, expr: &Expr) {
if let ExprIf(_, ref then_block, Some(ref else_expr)) = expr.node {
if let ExprBlock(ref else_block) = else_expr.node {
- if is_block_equal(cx, &then_block, &else_block, false) {
+ if SpanlessEq::new(cx).eq_block(&then_block, &else_block) {
span_lint(cx, IF_SAME_THEN_ELSE, expr.span, "this if has the same then and else blocks");
}
}
for (n, i) in conds.iter().enumerate() {
for j in conds.iter().skip(n+1) {
- if is_exp_equal(cx, i, j, true) {
+ if SpanlessEq::new(cx).ignore_fn().eq_expr(i, j) {
span_note_and_lint(cx, IFS_SAME_COND, j.span, "this if has the same condition as a previous if", i.span, "same as this");
}
}
use rustc::lint::*;
use rustc_front::hir::*;
use syntax::codemap::Span;
-use utils::{get_item_name, is_exp_equal, match_type, snippet, span_lint_and_then, walk_ptrs_ty};
+use utils::SpanlessEq;
use utils::{BTREEMAP_PATH, HASHMAP_PATH};
+use utils::{get_item_name, match_type, snippet, span_lint_and_then, walk_ptrs_ty};
/// **What it does:** This lint checks for uses of `contains_key` + `insert` on `HashMap` or
/// `BTreeMap`.
params.len() == 3,
name.node.as_str() == "insert",
get_item_name(cx, map) == get_item_name(cx, &*params[0]),
- is_exp_equal(cx, key, ¶ms[1], false)
+ SpanlessEq::new(cx).eq_expr(key, ¶ms[1])
], {
let help = if sole_expr {
format!("{}.entry({}).or_insert({})",
use rustc_front::hir::*;
use rustc_front::util as ast_util;
-use utils::{is_exp_equal, span_lint};
+use utils::{SpanlessEq, span_lint};
/// **What it does:** This lint checks for equal operands to comparison, logical and bitwise,
/// difference and division binary operators (`==`, `>`, etc., `&&`, `||`, `&`, `|`, `^`, `-` and
impl LateLintPass for EqOp {
fn check_expr(&mut self, cx: &LateContext, e: &Expr) {
if let ExprBinary(ref op, ref left, ref right) = e.node {
- if is_valid_operator(op) && is_exp_equal(cx, left, right, true) {
+ if is_valid_operator(op) && SpanlessEq::new(cx).ignore_fn().eq_expr(left, right) {
span_lint(cx,
EQ_OP,
e.span,
use rustc_front::hir::*;
use syntax::codemap::Spanned;
-use utils::{is_exp_equal, match_type, span_lint, walk_ptrs_ty, get_parent_expr};
+use utils::{match_type, span_lint, walk_ptrs_ty, get_parent_expr};
+use utils::SpanlessEq;
use utils::STRING_PATH;
/// **What it does:** This lint matches code of the form `x = x + y` (without `let`!).
if let Some(ref p) = parent {
if let ExprAssign(ref target, _) = p.node {
// avoid duplicate matches
- if is_exp_equal(cx, target, left, false) {
+ if SpanlessEq::new(cx).eq_expr(target, left) {
return;
}
}
fn is_add(cx: &LateContext, src: &Expr, target: &Expr) -> bool {
match src.node {
- ExprBinary(Spanned{ node: BiAdd, .. }, ref left, _) => is_exp_equal(cx, target, left, false),
+ ExprBinary(Spanned{ node: BiAdd, .. }, ref left, _) => SpanlessEq::new(cx).eq_expr(target, left),
ExprBlock(ref block) => {
block.stmts.is_empty() && block.expr.as_ref().map_or(false, |expr| is_add(cx, expr, target))
}
+++ /dev/null
-use consts::constant;
-use reexport::*;
-use rustc::front::map::Node;
-use rustc::lint::{LintContext, LateContext, Level, Lint};
-use rustc::middle::def_id::DefId;
-use rustc::middle::{cstore, def, infer, ty, traits};
-use rustc::session::Session;
-use rustc_front::hir::*;
-use std::borrow::Cow;
-use std::mem;
-use std::ops::{Deref, DerefMut};
-use std::str::FromStr;
-use syntax::ast::Lit_;
-use syntax::ast;
-use syntax::codemap::{ExpnInfo, Span, ExpnFormat};
-use syntax::errors::DiagnosticBuilder;
-use syntax::ptr::P;
-
-pub type MethodArgs = HirVec<P<Expr>>;
-
-// module DefPaths for certain structs/enums we check for
-pub const BEGIN_UNWIND: [&'static str; 3] = ["std", "rt", "begin_unwind"];
-pub const BOX_NEW_PATH: [&'static str; 4] = ["std", "boxed", "Box", "new"];
-pub const BTREEMAP_ENTRY_PATH: [&'static str; 4] = ["collections", "btree", "map", "Entry"];
-pub const BTREEMAP_PATH: [&'static str; 4] = ["collections", "btree", "map", "BTreeMap"];
-pub const CLONE_PATH: [&'static str; 3] = ["clone", "Clone", "clone"];
-pub const CLONE_TRAIT_PATH: [&'static str; 2] = ["clone", "Clone"];
-pub const COW_PATH: [&'static str; 3] = ["collections", "borrow", "Cow"];
-pub const DEBUG_FMT_METHOD_PATH: [&'static str; 4] = ["std", "fmt", "Debug", "fmt"];
-pub const DEFAULT_TRAIT_PATH: [&'static str; 3] = ["core", "default", "Default"];
-pub const DROP_PATH: [&'static str; 3] = ["core", "mem", "drop"];
-pub const FMT_ARGUMENTV1_NEW_PATH: [&'static str; 4] = ["std", "fmt", "ArgumentV1", "new"];
-pub const HASHMAP_ENTRY_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "Entry"];
-pub const HASHMAP_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "HashMap"];
-pub const HASH_PATH: [&'static str; 2] = ["hash", "Hash"];
-pub const IO_PRINT_PATH: [&'static str; 3] = ["std", "io", "_print"];
-pub const LL_PATH: [&'static str; 3] = ["collections", "linked_list", "LinkedList"];
-pub const MUTEX_PATH: [&'static str; 4] = ["std", "sync", "mutex", "Mutex"];
-pub const OPEN_OPTIONS_PATH: [&'static str; 3] = ["std", "fs", "OpenOptions"];
-pub const OPTION_PATH: [&'static str; 3] = ["core", "option", "Option"];
-pub const REGEX_NEW_PATH: [&'static str; 3] = ["regex", "Regex", "new"];
-pub const RESULT_PATH: [&'static str; 3] = ["core", "result", "Result"];
-pub const STRING_PATH: [&'static str; 3] = ["collections", "string", "String"];
-pub const VEC_FROM_ELEM_PATH: [&'static str; 3] = ["std", "vec", "from_elem"];
-pub const VEC_PATH: [&'static str; 3] = ["collections", "vec", "Vec"];
-
-/// Produce a nested chain of if-lets and ifs from the patterns:
-///
-/// if_let_chain! {
-/// [
-/// let Some(y) = x,
-/// y.len() == 2,
-/// let Some(z) = y,
-/// ],
-/// {
-/// block
-/// }
-/// }
-///
-/// becomes
-///
-/// if let Some(y) = x {
-/// if y.len() == 2 {
-/// if let Some(z) = y {
-/// block
-/// }
-/// }
-/// }
-#[macro_export]
-macro_rules! if_let_chain {
- ([let $pat:pat = $expr:expr, $($tt:tt)+], $block:block) => {
- if let $pat = $expr {
- if_let_chain!{ [$($tt)+], $block }
- }
- };
- ([let $pat:pat = $expr:expr], $block:block) => {
- if let $pat = $expr {
- $block
- }
- };
- ([$expr:expr, $($tt:tt)+], $block:block) => {
- if $expr {
- if_let_chain!{ [$($tt)+], $block }
- }
- };
- ([$expr:expr], $block:block) => {
- if $expr {
- $block
- }
- };
-}
-
-/// Returns true if the two spans come from differing expansions (i.e. one is from a macro and one
-/// isn't).
-pub fn differing_macro_contexts(sp1: Span, sp2: Span) -> bool {
- sp1.expn_id != sp2.expn_id
-}
-/// Returns true if this `expn_info` was expanded by any macro.
-pub fn in_macro<T: LintContext>(cx: &T, span: Span) -> bool {
- cx.sess().codemap().with_expn_info(span.expn_id, |info| info.is_some())
-}
-
-/// Returns true if the macro that expanded the crate was outside of the current crate or was a
-/// compiler plugin.
-pub fn in_external_macro<T: LintContext>(cx: &T, span: Span) -> bool {
- /// Invokes in_macro with the expansion info of the given span slightly heavy, try to use this
- /// after other checks have already happened.
- fn in_macro_ext<T: LintContext>(cx: &T, opt_info: Option<&ExpnInfo>) -> bool {
- // no ExpnInfo = no macro
- opt_info.map_or(false, |info| {
- if let ExpnFormat::MacroAttribute(..) = info.callee.format {
- // these are all plugins
- return true;
- }
- // no span for the callee = external macro
- info.callee.span.map_or(true, |span| {
- // no snippet = external macro or compiler-builtin expansion
- cx.sess().codemap().span_to_snippet(span).ok().map_or(true, |code| !code.starts_with("macro_rules"))
- })
- })
- }
-
- cx.sess().codemap().with_expn_info(span.expn_id, |info| in_macro_ext(cx, info))
-}
-
-/// Check if a `DefId`'s path matches the given absolute type path usage.
-///
-/// # Examples
-/// ```
-/// match_def_path(cx, id, &["core", "option", "Option"])
-/// ```
-pub fn match_def_path(cx: &LateContext, def_id: DefId, path: &[&str]) -> bool {
- cx.tcx.with_path(def_id, |iter| {
- iter.zip(path)
- .all(|(nm, p)| nm.name().as_str() == *p)
- })
-}
-
-/// Check if type is struct or enum type with given def path.
-pub fn match_type(cx: &LateContext, ty: ty::Ty, path: &[&str]) -> bool {
- match ty.sty {
- ty::TyEnum(ref adt, _) | ty::TyStruct(ref adt, _) => match_def_path(cx, adt.did, path),
- _ => false,
- }
-}
-
-/// Check if the method call given in `expr` belongs to given type.
-pub fn match_impl_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
- let method_call = ty::MethodCall::expr(expr.id);
-
- let trt_id = cx.tcx
- .tables
- .borrow()
- .method_map
- .get(&method_call)
- .and_then(|callee| cx.tcx.impl_of_method(callee.def_id));
- if let Some(trt_id) = trt_id {
- match_def_path(cx, trt_id, path)
- } else {
- false
- }
-}
-
-/// Check if the method call given in `expr` belongs to given trait.
-pub fn match_trait_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
- let method_call = ty::MethodCall::expr(expr.id);
-
- let trt_id = cx.tcx
- .tables
- .borrow()
- .method_map
- .get(&method_call)
- .and_then(|callee| cx.tcx.trait_of_item(callee.def_id));
- if let Some(trt_id) = trt_id {
- match_def_path(cx, trt_id, path)
- } else {
- false
- }
-}
-
-/// Match a `Path` against a slice of segment string literals.
-///
-/// # Examples
-/// ```
-/// match_path(path, &["std", "rt", "begin_unwind"])
-/// ```
-pub fn match_path(path: &Path, segments: &[&str]) -> bool {
- path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
-}
-
-/// Match a `Path` against a slice of segment string literals, e.g.
-///
-/// # Examples
-/// ```
-/// match_path(path, &["std", "rt", "begin_unwind"])
-/// ```
-pub fn match_path_ast(path: &ast::Path, segments: &[&str]) -> bool {
- path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
-}
-
-/// Get the definition associated to a path.
-/// TODO: investigate if there is something more efficient for that.
-pub fn path_to_def(cx: &LateContext, path: &[&str]) -> Option<cstore::DefLike> {
- let cstore = &cx.tcx.sess.cstore;
-
- let crates = cstore.crates();
- let krate = crates.iter().find(|&&krate| cstore.crate_name(krate) == path[0]);
- if let Some(krate) = krate {
- let mut items = cstore.crate_top_level_items(*krate);
- let mut path_it = path.iter().skip(1).peekable();
-
- loop {
- let segment = match path_it.next() {
- Some(segment) => segment,
- None => return None,
- };
-
- for item in &mem::replace(&mut items, vec![]) {
- if item.name.as_str() == *segment {
- if path_it.peek().is_none() {
- return Some(item.def);
- }
-
- let def_id = match item.def {
- cstore::DefLike::DlDef(def) => def.def_id(),
- cstore::DefLike::DlImpl(def_id) => def_id,
- _ => panic!("Unexpected {:?}", item.def),
- };
-
- items = cstore.item_children(def_id);
- break;
- }
- }
- }
- } else {
- None
- }
-}
-
-/// Convenience function to get the `DefId` of a trait by path.
-pub fn get_trait_def_id(cx: &LateContext, path: &[&str]) -> Option<DefId> {
- let def = match path_to_def(cx, path) {
- Some(def) => def,
- None => return None,
- };
-
- match def {
- cstore::DlDef(def::Def::Trait(trait_id)) => Some(trait_id),
- _ => None,
- }
-}
-
-/// Check whether a type implements a trait.
-/// See also `get_trait_def_id`.
-pub fn implements_trait<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, ty: ty::Ty<'tcx>, trait_id: DefId,
- ty_params: Option<Vec<ty::Ty<'tcx>>>)
- -> bool {
- cx.tcx.populate_implementations_for_trait_if_necessary(trait_id);
-
- let infcx = infer::new_infer_ctxt(cx.tcx, &cx.tcx.tables, None);
- let obligation = traits::predicate_for_trait_def(cx.tcx,
- traits::ObligationCause::dummy(),
- trait_id,
- 0,
- ty,
- ty_params.unwrap_or_default());
-
- traits::SelectionContext::new(&infcx).evaluate_obligation_conservatively(&obligation)
-}
-
-/// Match an `Expr` against a chain of methods, and return the matched `Expr`s.
-///
-/// For example, if `expr` represents the `.baz()` in `foo.bar().baz()`,
-/// `matched_method_chain(expr, &["bar", "baz"])` will return a `Vec` containing the `Expr`s for
-/// `.bar()` and `.baz()`
-pub fn method_chain_args<'a>(expr: &'a Expr, methods: &[&str]) -> Option<Vec<&'a MethodArgs>> {
- let mut current = expr;
- let mut matched = Vec::with_capacity(methods.len());
- for method_name in methods.iter().rev() {
- // method chains are stored last -> first
- if let ExprMethodCall(ref name, _, ref args) = current.node {
- if name.node.as_str() == *method_name {
- matched.push(args); // build up `matched` backwards
- current = &args[0] // go to parent expression
- } else {
- return None;
- }
- } else {
- return None;
- }
- }
- matched.reverse(); // reverse `matched`, so that it is in the same order as `methods`
- Some(matched)
-}
-
-
-/// Get the name of the item the expression is in, if available.
-pub fn get_item_name(cx: &LateContext, expr: &Expr) -> Option<Name> {
- let parent_id = cx.tcx.map.get_parent(expr.id);
- match cx.tcx.map.find(parent_id) {
- Some(Node::NodeItem(&Item{ ref name, .. })) |
- Some(Node::NodeTraitItem(&TraitItem{ ref name, .. })) |
- Some(Node::NodeImplItem(&ImplItem{ ref name, .. })) => Some(*name),
- _ => None,
- }
-}
-
-/// Checks if a `let` decl is from a `for` loop desugaring.
-pub fn is_from_for_desugar(decl: &Decl) -> bool {
- if_let_chain! {
- [
- let DeclLocal(ref loc) = decl.node,
- let Some(ref expr) = loc.init,
- let ExprMatch(_, _, MatchSource::ForLoopDesugar) = expr.node
- ],
- { return true; }
- };
- false
-}
-
-
-/// Convert a span to a code snippet if available, otherwise use default.
-///
-/// # Example
-/// ```
-/// snippet(cx, expr.span, "..")
-/// ```
-pub fn snippet<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
- cx.sess().codemap().span_to_snippet(span).map(From::from).unwrap_or_else(|_| Cow::Borrowed(default))
-}
-
-/// Convert a span to a code snippet. Returns `None` if not available.
-pub fn snippet_opt<T: LintContext>(cx: &T, span: Span) -> Option<String> {
- cx.sess().codemap().span_to_snippet(span).ok()
-}
-
-/// Convert a span (from a block) to a code snippet if available, otherwise use default.
-/// This trims the code of indentation, except for the first line. Use it for blocks or block-like
-/// things which need to be printed as such.
-///
-/// # Example
-/// ```
-/// snippet(cx, expr.span, "..")
-/// ```
-pub fn snippet_block<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
- let snip = snippet(cx, span, default);
- trim_multiline(snip, true)
-}
-
-/// Like `snippet_block`, but add braces if the expr is not an `ExprBlock`.
-/// Also takes an `Option<String>` which can be put inside the braces.
-pub fn expr_block<'a, T: LintContext>(cx: &T, expr: &Expr, option: Option<String>, default: &'a str) -> Cow<'a, str> {
- let code = snippet_block(cx, expr.span, default);
- let string = option.unwrap_or_default();
- if let ExprBlock(_) = expr.node {
- Cow::Owned(format!("{}{}", code, string))
- } else if string.is_empty() {
- Cow::Owned(format!("{{ {} }}", code))
- } else {
- Cow::Owned(format!("{{\n{};\n{}\n}}", code, string))
- }
-}
-
-/// Trim indentation from a multiline string with possibility of ignoring the first line.
-pub fn trim_multiline(s: Cow<str>, ignore_first: bool) -> Cow<str> {
- let s_space = trim_multiline_inner(s, ignore_first, ' ');
- let s_tab = trim_multiline_inner(s_space, ignore_first, '\t');
- trim_multiline_inner(s_tab, ignore_first, ' ')
-}
-
-fn trim_multiline_inner(s: Cow<str>, ignore_first: bool, ch: char) -> Cow<str> {
- let x = s.lines()
- .skip(ignore_first as usize)
- .filter_map(|l| {
- if l.len() > 0 {
- // ignore empty lines
- Some(l.char_indices()
- .find(|&(_, x)| x != ch)
- .unwrap_or((l.len(), ch))
- .0)
- } else {
- None
- }
- })
- .min()
- .unwrap_or(0);
- if x > 0 {
- Cow::Owned(s.lines()
- .enumerate()
- .map(|(i, l)| {
- if (ignore_first && i == 0) || l.len() == 0 {
- l
- } else {
- l.split_at(x).1
- }
- })
- .collect::<Vec<_>>()
- .join("\n"))
- } else {
- s
- }
-}
-
-/// Get a parent expressions if any – this is useful to constrain a lint.
-pub fn get_parent_expr<'c>(cx: &'c LateContext, e: &Expr) -> Option<&'c Expr> {
- let map = &cx.tcx.map;
- let node_id: NodeId = e.id;
- let parent_id: NodeId = map.get_parent_node(node_id);
- if node_id == parent_id {
- return None;
- }
- map.find(parent_id).and_then(|node| {
- if let Node::NodeExpr(parent) = node {
- Some(parent)
- } else {
- None
- }
- })
-}
-
-pub fn get_enclosing_block<'c>(cx: &'c LateContext, node: NodeId) -> Option<&'c Block> {
- let map = &cx.tcx.map;
- let enclosing_node = map.get_enclosing_scope(node)
- .and_then(|enclosing_id| map.find(enclosing_id));
- if let Some(node) = enclosing_node {
- match node {
- Node::NodeBlock(ref block) => Some(block),
- Node::NodeItem(&Item{ node: ItemFn(_, _, _, _, _, ref block), .. }) => Some(block),
- _ => None,
- }
- } else {
- None
- }
-}
-
-pub struct DiagnosticWrapper<'a>(pub DiagnosticBuilder<'a>);
-
-impl<'a> Drop for DiagnosticWrapper<'a> {
- fn drop(&mut self) {
- self.0.emit();
- }
-}
-
-impl<'a> DerefMut for DiagnosticWrapper<'a> {
- fn deref_mut(&mut self) -> &mut DiagnosticBuilder<'a> {
- &mut self.0
- }
-}
-
-impl<'a> Deref for DiagnosticWrapper<'a> {
- type Target = DiagnosticBuilder<'a>;
- fn deref(&self) -> &DiagnosticBuilder<'a> {
- &self.0
- }
-}
-
-pub fn span_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str) -> DiagnosticWrapper<'a> {
- let mut db = cx.struct_span_lint(lint, sp, msg);
- if cx.current_level(lint) != Level::Allow {
- db.fileline_help(sp,
- &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
- lint.name_lower()));
- }
- DiagnosticWrapper(db)
-}
-
-pub fn span_help_and_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, span: Span, msg: &str, help: &str)
- -> DiagnosticWrapper<'a> {
- let mut db = cx.struct_span_lint(lint, span, msg);
- if cx.current_level(lint) != Level::Allow {
- db.fileline_help(span,
- &format!("{}\nfor further information visit \
- https://github.com/Manishearth/rust-clippy/wiki#{}",
- help,
- lint.name_lower()));
- }
- DiagnosticWrapper(db)
-}
-
-pub fn span_note_and_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, span: Span, msg: &str, note_span: Span,
- note: &str)
- -> DiagnosticWrapper<'a> {
- let mut db = cx.struct_span_lint(lint, span, msg);
- if cx.current_level(lint) != Level::Allow {
- if note_span == span {
- db.fileline_note(note_span, note);
- } else {
- db.span_note(note_span, note);
- }
- db.fileline_help(span,
- &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
- lint.name_lower()));
- }
- DiagnosticWrapper(db)
-}
-
-pub fn span_lint_and_then<'a, T: LintContext, F>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str, f: F)
- -> DiagnosticWrapper<'a>
- where F: FnOnce(&mut DiagnosticWrapper)
-{
- let mut db = DiagnosticWrapper(cx.struct_span_lint(lint, sp, msg));
- if cx.current_level(lint) != Level::Allow {
- f(&mut db);
- db.fileline_help(sp,
- &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
- lint.name_lower()));
- }
- db
-}
-
-/// Return the base type for references and raw pointers.
-pub fn walk_ptrs_ty(ty: ty::Ty) -> ty::Ty {
- match ty.sty {
- ty::TyRef(_, ref tm) | ty::TyRawPtr(ref tm) => walk_ptrs_ty(tm.ty),
- _ => ty,
- }
-}
-
-/// Return the base type for references and raw pointers, and count reference depth.
-pub fn walk_ptrs_ty_depth(ty: ty::Ty) -> (ty::Ty, usize) {
- fn inner(ty: ty::Ty, depth: usize) -> (ty::Ty, usize) {
- match ty.sty {
- ty::TyRef(_, ref tm) | ty::TyRawPtr(ref tm) => inner(tm.ty, depth + 1),
- _ => (ty, depth),
- }
- }
- inner(ty, 0)
-}
-
-/// Check whether the given expression is a constant literal of the given value.
-pub fn is_integer_literal(expr: &Expr, value: u64) -> bool {
- // FIXME: use constant folding
- if let ExprLit(ref spanned) = expr.node {
- if let Lit_::LitInt(v, _) = spanned.node {
- return v == value;
- }
- }
- false
-}
-
-pub fn is_adjusted(cx: &LateContext, e: &Expr) -> bool {
- cx.tcx.tables.borrow().adjustments.get(&e.id).is_some()
-}
-
-pub struct LimitStack {
- stack: Vec<u64>,
-}
-
-impl Drop for LimitStack {
- fn drop(&mut self) {
- assert_eq!(self.stack.len(), 1);
- }
-}
-
-impl LimitStack {
- pub fn new(limit: u64) -> LimitStack {
- LimitStack { stack: vec![limit] }
- }
- pub fn limit(&self) -> u64 {
- *self.stack.last().expect("there should always be a value in the stack")
- }
- pub fn push_attrs(&mut self, sess: &Session, attrs: &[ast::Attribute], name: &'static str) {
- let stack = &mut self.stack;
- parse_attrs(sess, attrs, name, |val| stack.push(val));
- }
- pub fn pop_attrs(&mut self, sess: &Session, attrs: &[ast::Attribute], name: &'static str) {
- let stack = &mut self.stack;
- parse_attrs(sess, attrs, name, |val| assert_eq!(stack.pop(), Some(val)));
- }
-}
-
-fn parse_attrs<F: FnMut(u64)>(sess: &Session, attrs: &[ast::Attribute], name: &'static str, mut f: F) {
- for attr in attrs {
- let attr = &attr.node;
- if attr.is_sugared_doc {
- continue;
- }
- if let ast::MetaNameValue(ref key, ref value) = attr.value.node {
- if *key == name {
- if let Lit_::LitStr(ref s, _) = value.node {
- if let Ok(value) = FromStr::from_str(s) {
- f(value)
- } else {
- sess.span_err(value.span, "not a number");
- }
- } else {
- unreachable!()
- }
- }
- }
- }
-}
-
-/// Check whether two statements are the same.
-/// See also `is_exp_equal`.
-pub fn is_stmt_equal(cx: &LateContext, left: &Stmt, right: &Stmt, ignore_fn: bool) -> bool {
- match (&left.node, &right.node) {
- (&StmtDecl(ref l, _), &StmtDecl(ref r, _)) => {
- if let (&DeclLocal(ref l), &DeclLocal(ref r)) = (&l.node, &r.node) {
- // TODO: tys
- l.ty.is_none() && r.ty.is_none() &&
- both(&l.init, &r.init, |l, r| is_exp_equal(cx, l, r, ignore_fn))
- }
- else {
- false
- }
- }
- (&StmtExpr(ref l, _), &StmtExpr(ref r, _)) => is_exp_equal(cx, l, r, ignore_fn),
- (&StmtSemi(ref l, _), &StmtSemi(ref r, _)) => is_exp_equal(cx, l, r, ignore_fn),
- _ => false,
- }
-}
-
-/// Check whether two blocks are the same.
-/// See also `is_exp_equal`.
-pub fn is_block_equal(cx: &LateContext, left: &Block, right: &Block, ignore_fn: bool) -> bool {
- over(&left.stmts, &right.stmts, |l, r| is_stmt_equal(cx, l, r, ignore_fn)) &&
- both(&left.expr, &right.expr, |l, r| is_exp_equal(cx, l, r, ignore_fn))
-}
-
-/// Check whether two pattern are the same.
-/// See also `is_exp_equal`.
-pub fn is_pat_equal(cx: &LateContext, left: &Pat, right: &Pat, ignore_fn: bool) -> bool {
- match (&left.node, &right.node) {
- (&PatBox(ref l), &PatBox(ref r)) => {
- is_pat_equal(cx, l, r, ignore_fn)
- }
- (&PatEnum(ref lp, ref la), &PatEnum(ref rp, ref ra)) => {
- is_path_equal(lp, rp) &&
- both(la, ra, |l, r| {
- over(l, r, |l, r| is_pat_equal(cx, l, r, ignore_fn))
- })
- }
- (&PatIdent(ref lb, ref li, ref lp), &PatIdent(ref rb, ref ri, ref rp)) => {
- lb == rb && li.node.name.as_str() == ri.node.name.as_str() &&
- both(lp, rp, |l, r| is_pat_equal(cx, l, r, ignore_fn))
- }
- (&PatLit(ref l), &PatLit(ref r)) => {
- is_exp_equal(cx, l, r, ignore_fn)
- }
- (&PatQPath(ref ls, ref lp), &PatQPath(ref rs, ref rp)) => {
- is_qself_equal(ls, rs) && is_path_equal(lp, rp)
- }
- (&PatTup(ref l), &PatTup(ref r)) => {
- over(l, r, |l, r| is_pat_equal(cx, l, r, ignore_fn))
- }
- (&PatRange(ref ls, ref le), &PatRange(ref rs, ref re)) => {
- is_exp_equal(cx, ls, rs, ignore_fn) &&
- is_exp_equal(cx, le, re, ignore_fn)
- }
- (&PatRegion(ref le, ref lm), &PatRegion(ref re, ref rm)) => {
- lm == rm && is_pat_equal(cx, le, re, ignore_fn)
- }
- (&PatVec(ref ls, ref li, ref le), &PatVec(ref rs, ref ri, ref re)) => {
- over(ls, rs, |l, r| is_pat_equal(cx, l, r, ignore_fn)) &&
- over(le, re, |l, r| is_pat_equal(cx, l, r, ignore_fn)) &&
- both(li, ri, |l, r| is_pat_equal(cx, l, r, ignore_fn))
- }
- (&PatWild, &PatWild) => true,
- _ => false,
- }
-}
-
-/// Check whether two expressions are the same. This is different from the operator `==` on
-/// expression as this operator would compare true equality with ID and span.
-/// If `ignore_fn` is true, never consider as equal fonction calls.
-///
-/// Note that some expression kinds are not considered but could be added.
-#[allow(cyclomatic_complexity)] // ok, it’s a big function, but mostly one big match with simples cases
-pub fn is_exp_equal(cx: &LateContext, left: &Expr, right: &Expr, ignore_fn: bool) -> bool {
- if let (Some(l), Some(r)) = (constant(cx, left), constant(cx, right)) {
- if l == r {
- return true;
- }
- }
-
- match (&left.node, &right.node) {
- (&ExprAddrOf(ref lmut, ref le), &ExprAddrOf(ref rmut, ref re)) => {
- lmut == rmut && is_exp_equal(cx, le, re, ignore_fn)
- }
- (&ExprAgain(li), &ExprAgain(ri)) => {
- both(&li, &ri, |l, r| l.node.name.as_str() == r.node.name.as_str())
- }
- (&ExprAssign(ref ll, ref lr), &ExprAssign(ref rl, ref rr)) => {
- is_exp_equal(cx, ll, rl, ignore_fn) && is_exp_equal(cx, lr, rr, ignore_fn)
- }
- (&ExprAssignOp(ref lo, ref ll, ref lr), &ExprAssignOp(ref ro, ref rl, ref rr)) => {
- lo.node == ro.node && is_exp_equal(cx, ll, rl, ignore_fn) && is_exp_equal(cx, lr, rr, ignore_fn)
- }
- (&ExprBlock(ref l), &ExprBlock(ref r)) => {
- is_block_equal(cx, l, r, ignore_fn)
- }
- (&ExprBinary(lop, ref ll, ref lr), &ExprBinary(rop, ref rl, ref rr)) => {
- lop.node == rop.node && is_exp_equal(cx, ll, rl, ignore_fn) && is_exp_equal(cx, lr, rr, ignore_fn)
- }
- (&ExprBreak(li), &ExprBreak(ri)) => {
- both(&li, &ri, |l, r| l.node.name.as_str() == r.node.name.as_str())
- }
- (&ExprBox(ref l), &ExprBox(ref r)) => {
- is_exp_equal(cx, l, r, ignore_fn)
- }
- (&ExprCall(ref lfun, ref largs), &ExprCall(ref rfun, ref rargs)) => {
- !ignore_fn &&
- is_exp_equal(cx, lfun, rfun, ignore_fn) &&
- is_exps_equal(cx, largs, rargs, ignore_fn)
- }
- (&ExprCast(ref lx, ref lt), &ExprCast(ref rx, ref rt)) => {
- is_exp_equal(cx, lx, rx, ignore_fn) && is_cast_ty_equal(lt, rt)
- }
- (&ExprField(ref lfexp, ref lfident), &ExprField(ref rfexp, ref rfident)) => {
- lfident.node == rfident.node && is_exp_equal(cx, lfexp, rfexp, ignore_fn)
- }
- (&ExprIndex(ref la, ref li), &ExprIndex(ref ra, ref ri)) => {
- is_exp_equal(cx, la, ra, ignore_fn) && is_exp_equal(cx, li, ri, ignore_fn)
- }
- (&ExprIf(ref lc, ref lt, ref le), &ExprIf(ref rc, ref rt, ref re)) => {
- is_exp_equal(cx, lc, rc, ignore_fn) &&
- is_block_equal(cx, lt, rt, ignore_fn) &&
- both(le, re, |l, r| is_exp_equal(cx, l, r, ignore_fn))
- }
- (&ExprIndex(ref la, ref li), &ExprIndex(ref ra, ref ri)) => {
- is_exp_equal(cx, la, ra) && is_exp_equal(cx, li, ri)
- }
- (&ExprLit(ref l), &ExprLit(ref r)) => l.node == r.node,
- (&ExprMatch(ref le, ref la, ref ls), &ExprMatch(ref re, ref ra, ref rs)) => {
- ls == rs &&
- is_exp_equal(cx, le, re, ignore_fn) &&
- over(la, ra, |l, r| {
- is_exp_equal(cx, &l.body, &r.body, ignore_fn) &&
- both(&l.guard, &r.guard, |l, r| is_exp_equal(cx, l, r, ignore_fn)) &&
- over(&l.pats, &r.pats, |l, r| is_pat_equal(cx, l, r, ignore_fn))
- })
- }
- (&ExprMethodCall(ref lname, ref ltys, ref largs), &ExprMethodCall(ref rname, ref rtys, ref rargs)) => {
- // TODO: tys
- !ignore_fn &&
- lname.node == rname.node &&
- ltys.is_empty() &&
- rtys.is_empty() &&
- is_exps_equal(cx, largs, rargs, ignore_fn)
- }
- (&ExprRange(ref lb, ref le), &ExprRange(ref rb, ref re)) => {
- both(lb, rb, |l, r| is_exp_equal(cx, l, r, ignore_fn)) &&
- both(le, re, |l, r| is_exp_equal(cx, l, r, ignore_fn))
- }
- (&ExprRepeat(ref le, ref ll), &ExprRepeat(ref re, ref rl)) => {
- is_exp_equal(cx, le, re, ignore_fn) && is_exp_equal(cx, ll, rl, ignore_fn)
- }
- (&ExprRet(ref l), &ExprRet(ref r)) => {
- both(l, r, |l, r| is_exp_equal(cx, l, r, ignore_fn))
- }
- (&ExprPath(ref lqself, ref lsubpath), &ExprPath(ref rqself, ref rsubpath)) => {
- both(lqself, rqself, is_qself_equal) && is_path_equal(lsubpath, rsubpath)
- }
- (&ExprTup(ref ltup), &ExprTup(ref rtup)) => is_exps_equal(cx, ltup, rtup, ignore_fn),
- (&ExprTupField(ref le, li), &ExprTupField(ref re, ri)) => {
- li.node == ri.node && is_exp_equal(cx, le, re, ignore_fn)
- }
- (&ExprUnary(lop, ref le), &ExprUnary(rop, ref re)) => {
- lop == rop && is_exp_equal(cx, le, re, ignore_fn)
- }
- (&ExprVec(ref l), &ExprVec(ref r)) => is_exps_equal(cx, l, r, ignore_fn),
- (&ExprWhile(ref lc, ref lb, ref ll), &ExprWhile(ref rc, ref rb, ref rl)) => {
- is_exp_equal(cx, lc, rc, ignore_fn) &&
- is_block_equal(cx, lb, rb, ignore_fn) &&
- both(ll, rl, |l, r| l.name.as_str() == r.name.as_str())
- }
- _ => false,
- }
-}
-
-fn is_exps_equal(cx: &LateContext, left: &[P<Expr>], right: &[P<Expr>], ignore_fn: bool) -> bool {
- over(left, right, |l, r| is_exp_equal(cx, l, r, ignore_fn))
-}
-
-fn is_path_equal(left: &Path, right: &Path) -> bool {
- // The == of idents doesn't work with different contexts,
- // we have to be explicit about hygiene
- left.global == right.global &&
- over(&left.segments,
- &right.segments,
- |l, r| l.identifier.name.as_str() == r.identifier.name.as_str() && l.parameters == r.parameters)
-}
-
-fn is_qself_equal(left: &QSelf, right: &QSelf) -> bool {
- left.ty.node == right.ty.node && left.position == right.position
-}
-
-/// Check if two slices are equal as per `eq_fn`.
-pub fn over<X, F>(left: &[X], right: &[X], mut eq_fn: F) -> bool
- where F: FnMut(&X, &X) -> bool
-{
- left.len() == right.len() && left.iter().zip(right).all(|(x, y)| eq_fn(x, y))
-}
-
-/// Check if the two `Option`s are both `None` or some equal values as per `eq_fn`.
-pub fn both<X, F>(l: &Option<X>, r: &Option<X>, mut eq_fn: F) -> bool
- where F: FnMut(&X, &X) -> bool
-{
- l.as_ref().map_or_else(|| r.is_none(), |x| r.as_ref().map_or(false, |y| eq_fn(x, y)))
-}
-
-fn is_cast_ty_equal(left: &Ty, right: &Ty) -> bool {
- match (&left.node, &right.node) {
- (&TyVec(ref lvec), &TyVec(ref rvec)) => is_cast_ty_equal(lvec, rvec),
- (&TyPtr(ref lmut), &TyPtr(ref rmut)) => lmut.mutbl == rmut.mutbl && is_cast_ty_equal(&*lmut.ty, &*rmut.ty),
- (&TyRptr(_, ref lrmut), &TyRptr(_, ref rrmut)) => {
- lrmut.mutbl == rrmut.mutbl && is_cast_ty_equal(&*lrmut.ty, &*rrmut.ty)
- }
- (&TyPath(ref lq, ref lpath), &TyPath(ref rq, ref rpath)) => {
- both(lq, rq, is_qself_equal) && is_path_equal(lpath, rpath)
- }
- (&TyInfer, &TyInfer) => true,
- _ => false,
- }
-}
-
-/// Return the pre-expansion span if is this comes from an expansion of the macro `name`.
-pub fn is_expn_of(cx: &LateContext, mut span: Span, name: &str) -> Option<Span> {
- loop {
- let span_name_span = cx.tcx.sess.codemap().with_expn_info(span.expn_id, |expn| {
- expn.map(|ei| {
- (ei.callee.name(), ei.call_site)
- })
- });
-
- match span_name_span {
- Some((mac_name, new_span)) if mac_name.as_str() == name => return Some(new_span),
- None => return None,
- Some((_, new_span)) => span = new_span,
- }
- }
-}
--- /dev/null
+use consts::constant;
+use rustc::lint::*;
+use rustc_front::hir::*;
+use syntax::ptr::P;
+
+/// Type used to check whether two ast are the same. This is different from the operator
+/// `==` on ast types as this operator would compare true equality with ID and span.
+///
+/// Note that some expressions kinds are not considered but could be added.
+pub struct SpanlessEq<'a, 'tcx: 'a> {
+ /// Context used to evaluate constant expressions.
+ cx: &'a LateContext<'a, 'tcx>,
+ /// If is true, never consider as equal expressions containing fonction calls.
+ ignore_fn: bool,
+}
+
+impl<'a, 'tcx: 'a> SpanlessEq<'a, 'tcx> {
+ pub fn new(cx: &'a LateContext<'a, 'tcx>) -> Self {
+ SpanlessEq { cx: cx, ignore_fn: false }
+ }
+
+ pub fn ignore_fn(self) -> Self {
+ SpanlessEq { cx: self.cx, ignore_fn: true }
+ }
+
+ /// Check whether two statements are the same.
+ pub fn eq_stmt(&self, left: &Stmt, right: &Stmt) -> bool {
+ match (&left.node, &right.node) {
+ (&StmtDecl(ref l, _), &StmtDecl(ref r, _)) => {
+ if let (&DeclLocal(ref l), &DeclLocal(ref r)) = (&l.node, &r.node) {
+ // TODO: tys
+ l.ty.is_none() && r.ty.is_none() &&
+ both(&l.init, &r.init, |l, r| self.eq_expr(l, r))
+ }
+ else {
+ false
+ }
+ }
+ (&StmtExpr(ref l, _), &StmtExpr(ref r, _)) => self.eq_expr(l, r),
+ (&StmtSemi(ref l, _), &StmtSemi(ref r, _)) => self.eq_expr(l, r),
+ _ => false,
+ }
+ }
+
+ /// Check whether two blocks are the same.
+ pub fn eq_block(&self, left: &Block, right: &Block) -> bool {
+ over(&left.stmts, &right.stmts, |l, r| self.eq_stmt(l, r)) &&
+ both(&left.expr, &right.expr, |l, r| self.eq_expr(l, r))
+ }
+
+ // ok, it’s a big function, but mostly one big match with simples cases
+ #[allow(cyclomatic_complexity)]
+ pub fn eq_expr(&self, left: &Expr, right: &Expr) -> bool {
+ if let (Some(l), Some(r)) = (constant(self.cx, left), constant(self.cx, right)) {
+ if l == r {
+ return true;
+ }
+ }
+
+ match (&left.node, &right.node) {
+ (&ExprAddrOf(ref lmut, ref le), &ExprAddrOf(ref rmut, ref re)) => {
+ lmut == rmut && self.eq_expr(le, re)
+ }
+ (&ExprAgain(li), &ExprAgain(ri)) => {
+ both(&li, &ri, |l, r| l.node.name.as_str() == r.node.name.as_str())
+ }
+ (&ExprAssign(ref ll, ref lr), &ExprAssign(ref rl, ref rr)) => {
+ self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
+ }
+ (&ExprAssignOp(ref lo, ref ll, ref lr), &ExprAssignOp(ref ro, ref rl, ref rr)) => {
+ lo.node == ro.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
+ }
+ (&ExprBlock(ref l), &ExprBlock(ref r)) => {
+ self.eq_block(l, r)
+ }
+ (&ExprBinary(lop, ref ll, ref lr), &ExprBinary(rop, ref rl, ref rr)) => {
+ lop.node == rop.node && self.eq_expr(ll, rl) && self.eq_expr(lr, rr)
+ }
+ (&ExprBreak(li), &ExprBreak(ri)) => {
+ both(&li, &ri, |l, r| l.node.name.as_str() == r.node.name.as_str())
+ }
+ (&ExprBox(ref l), &ExprBox(ref r)) => {
+ self.eq_expr(l, r)
+ }
+ (&ExprCall(ref lfun, ref largs), &ExprCall(ref rfun, ref rargs)) => {
+ !self.ignore_fn &&
+ self.eq_expr(lfun, rfun) &&
+ self.eq_exprs(largs, rargs)
+ }
+ (&ExprCast(ref lx, ref lt), &ExprCast(ref rx, ref rt)) => {
+ self.eq_expr(lx, rx) && self.eq_ty(lt, rt)
+ }
+ (&ExprField(ref lfexp, ref lfident), &ExprField(ref rfexp, ref rfident)) => {
+ lfident.node == rfident.node && self.eq_expr(lfexp, rfexp)
+ }
+ (&ExprIndex(ref la, ref li), &ExprIndex(ref ra, ref ri)) => {
+ self.eq_expr(la, ra) && self.eq_expr(li, ri)
+ }
+ (&ExprIf(ref lc, ref lt, ref le), &ExprIf(ref rc, ref rt, ref re)) => {
+ self.eq_expr(lc, rc) &&
+ self.eq_block(lt, rt) &&
+ both(le, re, |l, r| self.eq_expr(l, r))
+ }
+ (&ExprLit(ref l), &ExprLit(ref r)) => l.node == r.node,
+ (&ExprMatch(ref le, ref la, ref ls), &ExprMatch(ref re, ref ra, ref rs)) => {
+ ls == rs &&
+ self.eq_expr(le, re) &&
+ over(la, ra, |l, r| {
+ self.eq_expr(&l.body, &r.body) &&
+ both(&l.guard, &r.guard, |l, r| self.eq_expr(l, r)) &&
+ over(&l.pats, &r.pats, |l, r| self.eq_pat(l, r))
+ })
+ }
+ (&ExprMethodCall(ref lname, ref ltys, ref largs), &ExprMethodCall(ref rname, ref rtys, ref rargs)) => {
+ // TODO: tys
+ !self.ignore_fn &&
+ lname.node == rname.node &&
+ ltys.is_empty() &&
+ rtys.is_empty() &&
+ self.eq_exprs(largs, rargs)
+ }
+ (&ExprRange(ref lb, ref le), &ExprRange(ref rb, ref re)) => {
+ both(lb, rb, |l, r| self.eq_expr(l, r)) &&
+ both(le, re, |l, r| self.eq_expr(l, r))
+ }
+ (&ExprRepeat(ref le, ref ll), &ExprRepeat(ref re, ref rl)) => {
+ self.eq_expr(le, re) && self.eq_expr(ll, rl)
+ }
+ (&ExprRet(ref l), &ExprRet(ref r)) => {
+ both(l, r, |l, r| self.eq_expr(l, r))
+ }
+ (&ExprPath(ref lqself, ref lsubpath), &ExprPath(ref rqself, ref rsubpath)) => {
+ both(lqself, rqself, |l, r| self.eq_qself(l, r)) && self.eq_path(lsubpath, rsubpath)
+ }
+ (&ExprTup(ref ltup), &ExprTup(ref rtup)) => self.eq_exprs(ltup, rtup),
+ (&ExprTupField(ref le, li), &ExprTupField(ref re, ri)) => {
+ li.node == ri.node && self.eq_expr(le, re)
+ }
+ (&ExprUnary(lop, ref le), &ExprUnary(rop, ref re)) => {
+ lop == rop && self.eq_expr(le, re)
+ }
+ (&ExprVec(ref l), &ExprVec(ref r)) => self.eq_exprs(l, r),
+ (&ExprWhile(ref lc, ref lb, ref ll), &ExprWhile(ref rc, ref rb, ref rl)) => {
+ self.eq_expr(lc, rc) &&
+ self.eq_block(lb, rb) &&
+ both(ll, rl, |l, r| l.name.as_str() == r.name.as_str())
+ }
+ _ => false,
+ }
+ }
+
+ fn eq_exprs(&self, left: &[P<Expr>], right: &[P<Expr>]) -> bool {
+ over(left, right, |l, r| self.eq_expr(l, r))
+ }
+
+ /// Check whether two patterns are the same.
+ pub fn eq_pat(&self, left: &Pat, right: &Pat) -> bool {
+ match (&left.node, &right.node) {
+ (&PatBox(ref l), &PatBox(ref r)) => {
+ self.eq_pat(l, r)
+ }
+ (&PatEnum(ref lp, ref la), &PatEnum(ref rp, ref ra)) => {
+ self.eq_path(lp, rp) &&
+ both(la, ra, |l, r| {
+ over(l, r, |l, r| self.eq_pat(l, r))
+ })
+ }
+ (&PatIdent(ref lb, ref li, ref lp), &PatIdent(ref rb, ref ri, ref rp)) => {
+ lb == rb && li.node.name.as_str() == ri.node.name.as_str() &&
+ both(lp, rp, |l, r| self.eq_pat(l, r))
+ }
+ (&PatLit(ref l), &PatLit(ref r)) => {
+ self.eq_expr(l, r)
+ }
+ (&PatQPath(ref ls, ref lp), &PatQPath(ref rs, ref rp)) => {
+ self.eq_qself(ls, rs) && self.eq_path(lp, rp)
+ }
+ (&PatTup(ref l), &PatTup(ref r)) => {
+ over(l, r, |l, r| self.eq_pat(l, r))
+ }
+ (&PatRange(ref ls, ref le), &PatRange(ref rs, ref re)) => {
+ self.eq_expr(ls, rs) &&
+ self.eq_expr(le, re)
+ }
+ (&PatRegion(ref le, ref lm), &PatRegion(ref re, ref rm)) => {
+ lm == rm && self.eq_pat(le, re)
+ }
+ (&PatVec(ref ls, ref li, ref le), &PatVec(ref rs, ref ri, ref re)) => {
+ over(ls, rs, |l, r| self.eq_pat(l, r)) &&
+ over(le, re, |l, r| self.eq_pat(l, r)) &&
+ both(li, ri, |l, r| self.eq_pat(l, r))
+ }
+ (&PatWild, &PatWild) => true,
+ _ => false,
+ }
+ }
+
+ fn eq_path(&self, left: &Path, right: &Path) -> bool {
+ // The == of idents doesn't work with different contexts,
+ // we have to be explicit about hygiene
+ left.global == right.global &&
+ over(&left.segments,
+ &right.segments,
+ |l, r| l.identifier.name.as_str() == r.identifier.name.as_str() && l.parameters == r.parameters)
+ }
+
+ fn eq_qself(&self, left: &QSelf, right: &QSelf) -> bool {
+ left.ty.node == right.ty.node && left.position == right.position
+ }
+
+ fn eq_ty(&self, left: &Ty, right: &Ty) -> bool {
+ match (&left.node, &right.node) {
+ (&TyVec(ref lvec), &TyVec(ref rvec)) => self.eq_ty(lvec, rvec),
+ (&TyPtr(ref lmut), &TyPtr(ref rmut)) => lmut.mutbl == rmut.mutbl && self.eq_ty(&*lmut.ty, &*rmut.ty),
+ (&TyRptr(_, ref lrmut), &TyRptr(_, ref rrmut)) => {
+ lrmut.mutbl == rrmut.mutbl && self.eq_ty(&*lrmut.ty, &*rrmut.ty)
+ }
+ (&TyPath(ref lq, ref lpath), &TyPath(ref rq, ref rpath)) => {
+ both(lq, rq, |l, r| self.eq_qself(l, r)) && self.eq_path(lpath, rpath)
+ }
+ (&TyInfer, &TyInfer) => true,
+ _ => false,
+ }
+ }
+}
+
+/// Check if the two `Option`s are both `None` or some equal values as per `eq_fn`.
+fn both<X, F>(l: &Option<X>, r: &Option<X>, mut eq_fn: F) -> bool
+ where F: FnMut(&X, &X) -> bool
+{
+ l.as_ref().map_or_else(|| r.is_none(), |x| r.as_ref().map_or(false, |y| eq_fn(x, y)))
+}
+
+/// Check if two slices are equal as per `eq_fn`.
+fn over<X, F>(left: &[X], right: &[X], mut eq_fn: F) -> bool
+ where F: FnMut(&X, &X) -> bool
+{
+ left.len() == right.len() && left.iter().zip(right).all(|(x, y)| eq_fn(x, y))
+}
--- /dev/null
+use reexport::*;
+use rustc::front::map::Node;
+use rustc::lint::{LintContext, LateContext, Level, Lint};
+use rustc::middle::def_id::DefId;
+use rustc::middle::{cstore, def, infer, ty, traits};
+use rustc::session::Session;
+use rustc_front::hir::*;
+use std::borrow::Cow;
+use std::mem;
+use std::ops::{Deref, DerefMut};
+use std::str::FromStr;
+use syntax::ast::Lit_;
+use syntax::ast;
+use syntax::codemap::{ExpnInfo, Span, ExpnFormat};
+use syntax::errors::DiagnosticBuilder;
+use syntax::ptr::P;
+
+mod hir;
+pub use self::hir::SpanlessEq;
+pub type MethodArgs = HirVec<P<Expr>>;
+
+// module DefPaths for certain structs/enums we check for
+pub const BEGIN_UNWIND: [&'static str; 3] = ["std", "rt", "begin_unwind"];
+pub const BOX_NEW_PATH: [&'static str; 4] = ["std", "boxed", "Box", "new"];
+pub const BTREEMAP_ENTRY_PATH: [&'static str; 4] = ["collections", "btree", "map", "Entry"];
+pub const BTREEMAP_PATH: [&'static str; 4] = ["collections", "btree", "map", "BTreeMap"];
+pub const CLONE_PATH: [&'static str; 3] = ["clone", "Clone", "clone"];
+pub const CLONE_TRAIT_PATH: [&'static str; 2] = ["clone", "Clone"];
+pub const COW_PATH: [&'static str; 3] = ["collections", "borrow", "Cow"];
+pub const DEBUG_FMT_METHOD_PATH: [&'static str; 4] = ["std", "fmt", "Debug", "fmt"];
+pub const DEFAULT_TRAIT_PATH: [&'static str; 3] = ["core", "default", "Default"];
+pub const DROP_PATH: [&'static str; 3] = ["core", "mem", "drop"];
+pub const FMT_ARGUMENTV1_NEW_PATH: [&'static str; 4] = ["std", "fmt", "ArgumentV1", "new"];
+pub const HASHMAP_ENTRY_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "Entry"];
+pub const HASHMAP_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "HashMap"];
+pub const HASH_PATH: [&'static str; 2] = ["hash", "Hash"];
+pub const IO_PRINT_PATH: [&'static str; 3] = ["std", "io", "_print"];
+pub const LL_PATH: [&'static str; 3] = ["collections", "linked_list", "LinkedList"];
+pub const MUTEX_PATH: [&'static str; 4] = ["std", "sync", "mutex", "Mutex"];
+pub const OPEN_OPTIONS_PATH: [&'static str; 3] = ["std", "fs", "OpenOptions"];
+pub const OPTION_PATH: [&'static str; 3] = ["core", "option", "Option"];
+pub const REGEX_NEW_PATH: [&'static str; 3] = ["regex", "Regex", "new"];
+pub const RESULT_PATH: [&'static str; 3] = ["core", "result", "Result"];
+pub const STRING_PATH: [&'static str; 3] = ["collections", "string", "String"];
+pub const VEC_FROM_ELEM_PATH: [&'static str; 3] = ["std", "vec", "from_elem"];
+pub const VEC_PATH: [&'static str; 3] = ["collections", "vec", "Vec"];
+
+/// Produce a nested chain of if-lets and ifs from the patterns:
+///
+/// if_let_chain! {
+/// [
+/// let Some(y) = x,
+/// y.len() == 2,
+/// let Some(z) = y,
+/// ],
+/// {
+/// block
+/// }
+/// }
+///
+/// becomes
+///
+/// if let Some(y) = x {
+/// if y.len() == 2 {
+/// if let Some(z) = y {
+/// block
+/// }
+/// }
+/// }
+#[macro_export]
+macro_rules! if_let_chain {
+ ([let $pat:pat = $expr:expr, $($tt:tt)+], $block:block) => {
+ if let $pat = $expr {
+ if_let_chain!{ [$($tt)+], $block }
+ }
+ };
+ ([let $pat:pat = $expr:expr], $block:block) => {
+ if let $pat = $expr {
+ $block
+ }
+ };
+ ([$expr:expr, $($tt:tt)+], $block:block) => {
+ if $expr {
+ if_let_chain!{ [$($tt)+], $block }
+ }
+ };
+ ([$expr:expr], $block:block) => {
+ if $expr {
+ $block
+ }
+ };
+}
+
+/// Returns true if the two spans come from differing expansions (i.e. one is from a macro and one
+/// isn't).
+pub fn differing_macro_contexts(sp1: Span, sp2: Span) -> bool {
+ sp1.expn_id != sp2.expn_id
+}
+/// Returns true if this `expn_info` was expanded by any macro.
+pub fn in_macro<T: LintContext>(cx: &T, span: Span) -> bool {
+ cx.sess().codemap().with_expn_info(span.expn_id, |info| info.is_some())
+}
+
+/// Returns true if the macro that expanded the crate was outside of the current crate or was a
+/// compiler plugin.
+pub fn in_external_macro<T: LintContext>(cx: &T, span: Span) -> bool {
+ /// Invokes in_macro with the expansion info of the given span slightly heavy, try to use this
+ /// after other checks have already happened.
+ fn in_macro_ext<T: LintContext>(cx: &T, opt_info: Option<&ExpnInfo>) -> bool {
+ // no ExpnInfo = no macro
+ opt_info.map_or(false, |info| {
+ if let ExpnFormat::MacroAttribute(..) = info.callee.format {
+ // these are all plugins
+ return true;
+ }
+ // no span for the callee = external macro
+ info.callee.span.map_or(true, |span| {
+ // no snippet = external macro or compiler-builtin expansion
+ cx.sess().codemap().span_to_snippet(span).ok().map_or(true, |code| !code.starts_with("macro_rules"))
+ })
+ })
+ }
+
+ cx.sess().codemap().with_expn_info(span.expn_id, |info| in_macro_ext(cx, info))
+}
+
+/// Check if a `DefId`'s path matches the given absolute type path usage.
+///
+/// # Examples
+/// ```
+/// match_def_path(cx, id, &["core", "option", "Option"])
+/// ```
+pub fn match_def_path(cx: &LateContext, def_id: DefId, path: &[&str]) -> bool {
+ cx.tcx.with_path(def_id, |iter| {
+ iter.zip(path)
+ .all(|(nm, p)| nm.name().as_str() == *p)
+ })
+}
+
+/// Check if type is struct or enum type with given def path.
+pub fn match_type(cx: &LateContext, ty: ty::Ty, path: &[&str]) -> bool {
+ match ty.sty {
+ ty::TyEnum(ref adt, _) | ty::TyStruct(ref adt, _) => match_def_path(cx, adt.did, path),
+ _ => false,
+ }
+}
+
+/// Check if the method call given in `expr` belongs to given type.
+pub fn match_impl_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
+ let method_call = ty::MethodCall::expr(expr.id);
+
+ let trt_id = cx.tcx
+ .tables
+ .borrow()
+ .method_map
+ .get(&method_call)
+ .and_then(|callee| cx.tcx.impl_of_method(callee.def_id));
+ if let Some(trt_id) = trt_id {
+ match_def_path(cx, trt_id, path)
+ } else {
+ false
+ }
+}
+
+/// Check if the method call given in `expr` belongs to given trait.
+pub fn match_trait_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
+ let method_call = ty::MethodCall::expr(expr.id);
+
+ let trt_id = cx.tcx
+ .tables
+ .borrow()
+ .method_map
+ .get(&method_call)
+ .and_then(|callee| cx.tcx.trait_of_item(callee.def_id));
+ if let Some(trt_id) = trt_id {
+ match_def_path(cx, trt_id, path)
+ } else {
+ false
+ }
+}
+
+/// Match a `Path` against a slice of segment string literals.
+///
+/// # Examples
+/// ```
+/// match_path(path, &["std", "rt", "begin_unwind"])
+/// ```
+pub fn match_path(path: &Path, segments: &[&str]) -> bool {
+ path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
+}
+
+/// Match a `Path` against a slice of segment string literals, e.g.
+///
+/// # Examples
+/// ```
+/// match_path(path, &["std", "rt", "begin_unwind"])
+/// ```
+pub fn match_path_ast(path: &ast::Path, segments: &[&str]) -> bool {
+ path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
+}
+
+/// Get the definition associated to a path.
+/// TODO: investigate if there is something more efficient for that.
+pub fn path_to_def(cx: &LateContext, path: &[&str]) -> Option<cstore::DefLike> {
+ let cstore = &cx.tcx.sess.cstore;
+
+ let crates = cstore.crates();
+ let krate = crates.iter().find(|&&krate| cstore.crate_name(krate) == path[0]);
+ if let Some(krate) = krate {
+ let mut items = cstore.crate_top_level_items(*krate);
+ let mut path_it = path.iter().skip(1).peekable();
+
+ loop {
+ let segment = match path_it.next() {
+ Some(segment) => segment,
+ None => return None,
+ };
+
+ for item in &mem::replace(&mut items, vec![]) {
+ if item.name.as_str() == *segment {
+ if path_it.peek().is_none() {
+ return Some(item.def);
+ }
+
+ let def_id = match item.def {
+ cstore::DefLike::DlDef(def) => def.def_id(),
+ cstore::DefLike::DlImpl(def_id) => def_id,
+ _ => panic!("Unexpected {:?}", item.def),
+ };
+
+ items = cstore.item_children(def_id);
+ break;
+ }
+ }
+ }
+ } else {
+ None
+ }
+}
+
+/// Convenience function to get the `DefId` of a trait by path.
+pub fn get_trait_def_id(cx: &LateContext, path: &[&str]) -> Option<DefId> {
+ let def = match path_to_def(cx, path) {
+ Some(def) => def,
+ None => return None,
+ };
+
+ match def {
+ cstore::DlDef(def::Def::Trait(trait_id)) => Some(trait_id),
+ _ => None,
+ }
+}
+
+/// Check whether a type implements a trait.
+/// See also `get_trait_def_id`.
+pub fn implements_trait<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, ty: ty::Ty<'tcx>, trait_id: DefId,
+ ty_params: Option<Vec<ty::Ty<'tcx>>>)
+ -> bool {
+ cx.tcx.populate_implementations_for_trait_if_necessary(trait_id);
+
+ let infcx = infer::new_infer_ctxt(cx.tcx, &cx.tcx.tables, None);
+ let obligation = traits::predicate_for_trait_def(cx.tcx,
+ traits::ObligationCause::dummy(),
+ trait_id,
+ 0,
+ ty,
+ ty_params.unwrap_or_default());
+
+ traits::SelectionContext::new(&infcx).evaluate_obligation_conservatively(&obligation)
+}
+
+/// Match an `Expr` against a chain of methods, and return the matched `Expr`s.
+///
+/// For example, if `expr` represents the `.baz()` in `foo.bar().baz()`,
+/// `matched_method_chain(expr, &["bar", "baz"])` will return a `Vec` containing the `Expr`s for
+/// `.bar()` and `.baz()`
+pub fn method_chain_args<'a>(expr: &'a Expr, methods: &[&str]) -> Option<Vec<&'a MethodArgs>> {
+ let mut current = expr;
+ let mut matched = Vec::with_capacity(methods.len());
+ for method_name in methods.iter().rev() {
+ // method chains are stored last -> first
+ if let ExprMethodCall(ref name, _, ref args) = current.node {
+ if name.node.as_str() == *method_name {
+ matched.push(args); // build up `matched` backwards
+ current = &args[0] // go to parent expression
+ } else {
+ return None;
+ }
+ } else {
+ return None;
+ }
+ }
+ matched.reverse(); // reverse `matched`, so that it is in the same order as `methods`
+ Some(matched)
+}
+
+
+/// Get the name of the item the expression is in, if available.
+pub fn get_item_name(cx: &LateContext, expr: &Expr) -> Option<Name> {
+ let parent_id = cx.tcx.map.get_parent(expr.id);
+ match cx.tcx.map.find(parent_id) {
+ Some(Node::NodeItem(&Item{ ref name, .. })) |
+ Some(Node::NodeTraitItem(&TraitItem{ ref name, .. })) |
+ Some(Node::NodeImplItem(&ImplItem{ ref name, .. })) => Some(*name),
+ _ => None,
+ }
+}
+
+/// Checks if a `let` decl is from a `for` loop desugaring.
+pub fn is_from_for_desugar(decl: &Decl) -> bool {
+ if_let_chain! {
+ [
+ let DeclLocal(ref loc) = decl.node,
+ let Some(ref expr) = loc.init,
+ let ExprMatch(_, _, MatchSource::ForLoopDesugar) = expr.node
+ ],
+ { return true; }
+ };
+ false
+}
+
+
+/// Convert a span to a code snippet if available, otherwise use default.
+///
+/// # Example
+/// ```
+/// snippet(cx, expr.span, "..")
+/// ```
+pub fn snippet<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
+ cx.sess().codemap().span_to_snippet(span).map(From::from).unwrap_or_else(|_| Cow::Borrowed(default))
+}
+
+/// Convert a span to a code snippet. Returns `None` if not available.
+pub fn snippet_opt<T: LintContext>(cx: &T, span: Span) -> Option<String> {
+ cx.sess().codemap().span_to_snippet(span).ok()
+}
+
+/// Convert a span (from a block) to a code snippet if available, otherwise use default.
+/// This trims the code of indentation, except for the first line. Use it for blocks or block-like
+/// things which need to be printed as such.
+///
+/// # Example
+/// ```
+/// snippet(cx, expr.span, "..")
+/// ```
+pub fn snippet_block<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
+ let snip = snippet(cx, span, default);
+ trim_multiline(snip, true)
+}
+
+/// Like `snippet_block`, but add braces if the expr is not an `ExprBlock`.
+/// Also takes an `Option<String>` which can be put inside the braces.
+pub fn expr_block<'a, T: LintContext>(cx: &T, expr: &Expr, option: Option<String>, default: &'a str) -> Cow<'a, str> {
+ let code = snippet_block(cx, expr.span, default);
+ let string = option.unwrap_or_default();
+ if let ExprBlock(_) = expr.node {
+ Cow::Owned(format!("{}{}", code, string))
+ } else if string.is_empty() {
+ Cow::Owned(format!("{{ {} }}", code))
+ } else {
+ Cow::Owned(format!("{{\n{};\n{}\n}}", code, string))
+ }
+}
+
+/// Trim indentation from a multiline string with possibility of ignoring the first line.
+pub fn trim_multiline(s: Cow<str>, ignore_first: bool) -> Cow<str> {
+ let s_space = trim_multiline_inner(s, ignore_first, ' ');
+ let s_tab = trim_multiline_inner(s_space, ignore_first, '\t');
+ trim_multiline_inner(s_tab, ignore_first, ' ')
+}
+
+fn trim_multiline_inner(s: Cow<str>, ignore_first: bool, ch: char) -> Cow<str> {
+ let x = s.lines()
+ .skip(ignore_first as usize)
+ .filter_map(|l| {
+ if l.len() > 0 {
+ // ignore empty lines
+ Some(l.char_indices()
+ .find(|&(_, x)| x != ch)
+ .unwrap_or((l.len(), ch))
+ .0)
+ } else {
+ None
+ }
+ })
+ .min()
+ .unwrap_or(0);
+ if x > 0 {
+ Cow::Owned(s.lines()
+ .enumerate()
+ .map(|(i, l)| {
+ if (ignore_first && i == 0) || l.len() == 0 {
+ l
+ } else {
+ l.split_at(x).1
+ }
+ })
+ .collect::<Vec<_>>()
+ .join("\n"))
+ } else {
+ s
+ }
+}
+
+/// Get a parent expressions if any – this is useful to constrain a lint.
+pub fn get_parent_expr<'c>(cx: &'c LateContext, e: &Expr) -> Option<&'c Expr> {
+ let map = &cx.tcx.map;
+ let node_id: NodeId = e.id;
+ let parent_id: NodeId = map.get_parent_node(node_id);
+ if node_id == parent_id {
+ return None;
+ }
+ map.find(parent_id).and_then(|node| {
+ if let Node::NodeExpr(parent) = node {
+ Some(parent)
+ } else {
+ None
+ }
+ })
+}
+
+pub fn get_enclosing_block<'c>(cx: &'c LateContext, node: NodeId) -> Option<&'c Block> {
+ let map = &cx.tcx.map;
+ let enclosing_node = map.get_enclosing_scope(node)
+ .and_then(|enclosing_id| map.find(enclosing_id));
+ if let Some(node) = enclosing_node {
+ match node {
+ Node::NodeBlock(ref block) => Some(block),
+ Node::NodeItem(&Item{ node: ItemFn(_, _, _, _, _, ref block), .. }) => Some(block),
+ _ => None,
+ }
+ } else {
+ None
+ }
+}
+
+pub struct DiagnosticWrapper<'a>(pub DiagnosticBuilder<'a>);
+
+impl<'a> Drop for DiagnosticWrapper<'a> {
+ fn drop(&mut self) {
+ self.0.emit();
+ }
+}
+
+impl<'a> DerefMut for DiagnosticWrapper<'a> {
+ fn deref_mut(&mut self) -> &mut DiagnosticBuilder<'a> {
+ &mut self.0
+ }
+}
+
+impl<'a> Deref for DiagnosticWrapper<'a> {
+ type Target = DiagnosticBuilder<'a>;
+ fn deref(&self) -> &DiagnosticBuilder<'a> {
+ &self.0
+ }
+}
+
+pub fn span_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str) -> DiagnosticWrapper<'a> {
+ let mut db = cx.struct_span_lint(lint, sp, msg);
+ if cx.current_level(lint) != Level::Allow {
+ db.fileline_help(sp,
+ &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
+ lint.name_lower()));
+ }
+ DiagnosticWrapper(db)
+}
+
+pub fn span_help_and_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, span: Span, msg: &str, help: &str)
+ -> DiagnosticWrapper<'a> {
+ let mut db = cx.struct_span_lint(lint, span, msg);
+ if cx.current_level(lint) != Level::Allow {
+ db.fileline_help(span,
+ &format!("{}\nfor further information visit \
+ https://github.com/Manishearth/rust-clippy/wiki#{}",
+ help,
+ lint.name_lower()));
+ }
+ DiagnosticWrapper(db)
+}
+
+pub fn span_note_and_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, span: Span, msg: &str, note_span: Span,
+ note: &str)
+ -> DiagnosticWrapper<'a> {
+ let mut db = cx.struct_span_lint(lint, span, msg);
+ if cx.current_level(lint) != Level::Allow {
+ if note_span == span {
+ db.fileline_note(note_span, note);
+ } else {
+ db.span_note(note_span, note);
+ }
+ db.fileline_help(span,
+ &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
+ lint.name_lower()));
+ }
+ DiagnosticWrapper(db)
+}
+
+pub fn span_lint_and_then<'a, T: LintContext, F>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str, f: F)
+ -> DiagnosticWrapper<'a>
+ where F: FnOnce(&mut DiagnosticWrapper)
+{
+ let mut db = DiagnosticWrapper(cx.struct_span_lint(lint, sp, msg));
+ if cx.current_level(lint) != Level::Allow {
+ f(&mut db);
+ db.fileline_help(sp,
+ &format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
+ lint.name_lower()));
+ }
+ db
+}
+
+/// Return the base type for references and raw pointers.
+pub fn walk_ptrs_ty(ty: ty::Ty) -> ty::Ty {
+ match ty.sty {
+ ty::TyRef(_, ref tm) | ty::TyRawPtr(ref tm) => walk_ptrs_ty(tm.ty),
+ _ => ty,
+ }
+}
+
+/// Return the base type for references and raw pointers, and count reference depth.
+pub fn walk_ptrs_ty_depth(ty: ty::Ty) -> (ty::Ty, usize) {
+ fn inner(ty: ty::Ty, depth: usize) -> (ty::Ty, usize) {
+ match ty.sty {
+ ty::TyRef(_, ref tm) | ty::TyRawPtr(ref tm) => inner(tm.ty, depth + 1),
+ _ => (ty, depth),
+ }
+ }
+ inner(ty, 0)
+}
+
+/// Check whether the given expression is a constant literal of the given value.
+pub fn is_integer_literal(expr: &Expr, value: u64) -> bool {
+ // FIXME: use constant folding
+ if let ExprLit(ref spanned) = expr.node {
+ if let Lit_::LitInt(v, _) = spanned.node {
+ return v == value;
+ }
+ }
+ false
+}
+
+pub fn is_adjusted(cx: &LateContext, e: &Expr) -> bool {
+ cx.tcx.tables.borrow().adjustments.get(&e.id).is_some()
+}
+
+pub struct LimitStack {
+ stack: Vec<u64>,
+}
+
+impl Drop for LimitStack {
+ fn drop(&mut self) {
+ assert_eq!(self.stack.len(), 1);
+ }
+}
+
+impl LimitStack {
+ pub fn new(limit: u64) -> LimitStack {
+ LimitStack { stack: vec![limit] }
+ }
+ pub fn limit(&self) -> u64 {
+ *self.stack.last().expect("there should always be a value in the stack")
+ }
+ pub fn push_attrs(&mut self, sess: &Session, attrs: &[ast::Attribute], name: &'static str) {
+ let stack = &mut self.stack;
+ parse_attrs(sess, attrs, name, |val| stack.push(val));
+ }
+ pub fn pop_attrs(&mut self, sess: &Session, attrs: &[ast::Attribute], name: &'static str) {
+ let stack = &mut self.stack;
+ parse_attrs(sess, attrs, name, |val| assert_eq!(stack.pop(), Some(val)));
+ }
+}
+
+fn parse_attrs<F: FnMut(u64)>(sess: &Session, attrs: &[ast::Attribute], name: &'static str, mut f: F) {
+ for attr in attrs {
+ let attr = &attr.node;
+ if attr.is_sugared_doc {
+ continue;
+ }
+ if let ast::MetaNameValue(ref key, ref value) = attr.value.node {
+ if *key == name {
+ if let Lit_::LitStr(ref s, _) = value.node {
+ if let Ok(value) = FromStr::from_str(s) {
+ f(value)
+ } else {
+ sess.span_err(value.span, "not a number");
+ }
+ } else {
+ unreachable!()
+ }
+ }
+ }
+ }
+}
+
+/// Return the pre-expansion span if is this comes from an expansion of the macro `name`.
+pub fn is_expn_of(cx: &LateContext, mut span: Span, name: &str) -> Option<Span> {
+ loop {
+ let span_name_span = cx.tcx.sess.codemap().with_expn_info(span.expn_id, |expn| {
+ expn.map(|ei| {
+ (ei.callee.name(), ei.call_site)
+ })
+ });
+
+ match span_name_span {
+ Some((mac_name, new_span)) if mac_name.as_str() == name => return Some(new_span),
+ None => return None,
+ Some((_, new_span)) => span = new_span,
+ }
+ }
+}
projects / rust.git / commitdiff