2015-09-03 14:42:17 +00:00
|
|
|
|
use reexport::*;
|
2016-02-03 14:39:22 +00:00
|
|
|
|
use rustc::front::map::Node;
|
|
|
|
|
use rustc::lint::{LintContext, LateContext, Level, Lint};
|
2015-08-25 21:21:38 +00:00
|
|
|
|
use rustc::middle::def_id::DefId;
|
2016-01-18 12:10:13 +00:00
|
|
|
|
use rustc::middle::{cstore, def, infer, ty, traits};
|
|
|
|
|
use rustc::session::Session;
|
|
|
|
|
use rustc_front::hir::*;
|
2015-08-16 06:54:43 +00:00
|
|
|
|
use std::borrow::Cow;
|
2016-01-18 12:10:13 +00:00
|
|
|
|
use std::mem;
|
|
|
|
|
use std::ops::{Deref, DerefMut};
|
|
|
|
|
use std::str::FromStr;
|
2016-03-07 15:31:38 +00:00
|
|
|
|
use syntax::ast::{self, LitKind, RangeLimits};
|
2016-01-18 12:10:13 +00:00
|
|
|
|
use syntax::codemap::{ExpnInfo, Span, ExpnFormat};
|
2015-12-31 20:39:03 +00:00
|
|
|
|
use syntax::errors::DiagnosticBuilder;
|
2015-12-27 22:15:09 +00:00
|
|
|
|
use syntax::ptr::P;
|
2015-11-18 11:35:18 +00:00
|
|
|
|
|
2016-02-06 19:13:25 +00:00
|
|
|
|
mod hir;
|
2016-02-09 14:18:27 +00:00
|
|
|
|
pub use self::hir::{SpanlessEq, SpanlessHash};
|
2015-12-27 22:15:09 +00:00
|
|
|
|
pub type MethodArgs = HirVec<P<Expr>>;
|
|
|
|
|
|
2015-08-21 16:48:36 +00:00
|
|
|
|
// module DefPaths for certain structs/enums we check for
|
2016-01-12 19:23:28 +00:00
|
|
|
|
pub const BEGIN_UNWIND: [&'static str; 3] = ["std", "rt", "begin_unwind"];
|
2016-01-29 00:54:10 +00:00
|
|
|
|
pub const BOX_NEW_PATH: [&'static str; 4] = ["std", "boxed", "Box", "new"];
|
2016-01-19 23:53:26 +00:00
|
|
|
|
pub const BTREEMAP_ENTRY_PATH: [&'static str; 4] = ["collections", "btree", "map", "Entry"];
|
2016-01-12 19:23:28 +00:00
|
|
|
|
pub const BTREEMAP_PATH: [&'static str; 4] = ["collections", "btree", "map", "BTreeMap"];
|
2016-01-24 12:56:23 +00:00
|
|
|
|
pub const CLONE_PATH: [&'static str; 3] = ["clone", "Clone", "clone"];
|
|
|
|
|
pub const CLONE_TRAIT_PATH: [&'static str; 2] = ["clone", "Clone"];
|
2016-01-12 19:23:28 +00:00
|
|
|
|
pub const COW_PATH: [&'static str; 3] = ["collections", "borrow", "Cow"];
|
2016-02-07 17:30:57 +00:00
|
|
|
|
pub const DEBUG_FMT_METHOD_PATH: [&'static str; 4] = ["std", "fmt", "Debug", "fmt"];
|
2016-01-18 12:10:13 +00:00
|
|
|
|
pub const DEFAULT_TRAIT_PATH: [&'static str; 3] = ["core", "default", "Default"];
|
2016-02-20 20:15:05 +00:00
|
|
|
|
pub const DISPLAY_FMT_METHOD_PATH: [&'static str; 4] = ["std", "fmt", "Display", "fmt"];
|
2016-02-01 18:53:03 +00:00
|
|
|
|
pub const DROP_PATH: [&'static str; 3] = ["core", "mem", "drop"];
|
2016-02-20 20:15:05 +00:00
|
|
|
|
pub const FMT_ARGUMENTS_NEWV1_PATH: [&'static str; 4] = ["std", "fmt", "Arguments", "new_v1"];
|
2016-02-07 17:30:57 +00:00
|
|
|
|
pub const FMT_ARGUMENTV1_NEW_PATH: [&'static str; 4] = ["std", "fmt", "ArgumentV1", "new"];
|
2016-01-19 23:53:26 +00:00
|
|
|
|
pub const HASHMAP_ENTRY_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "Entry"];
|
2016-01-12 19:23:28 +00:00
|
|
|
|
pub const HASHMAP_PATH: [&'static str; 5] = ["std", "collections", "hash", "map", "HashMap"];
|
2016-01-21 17:19:02 +00:00
|
|
|
|
pub const HASH_PATH: [&'static str; 2] = ["hash", "Hash"];
|
2016-01-28 18:29:59 +00:00
|
|
|
|
pub const IO_PRINT_PATH: [&'static str; 3] = ["std", "io", "_print"];
|
2016-01-12 19:23:28 +00:00
|
|
|
|
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"];
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub const OPTION_PATH: [&'static str; 3] = ["core", "option", "Option"];
|
2016-03-07 15:31:38 +00:00
|
|
|
|
pub const RANGE_FROM_PATH: [&'static str; 3] = ["std", "ops", "RangeFrom"];
|
|
|
|
|
pub const RANGE_FULL_PATH: [&'static str; 3] = ["std", "ops", "RangeFull"];
|
|
|
|
|
pub const RANGE_INCLUSIVE_NON_EMPTY_PATH: [&'static str; 4] = ["std", "ops", "RangeInclusive", "NonEmpty"];
|
|
|
|
|
pub const RANGE_PATH: [&'static str; 3] = ["std", "ops", "Range"];
|
|
|
|
|
pub const RANGE_TO_INCLUSIVE_PATH: [&'static str; 3] = ["std", "ops", "RangeToInclusive"];
|
|
|
|
|
pub const RANGE_TO_PATH: [&'static str; 3] = ["std", "ops", "RangeTo"];
|
2016-02-04 23:36:06 +00:00
|
|
|
|
pub const REGEX_NEW_PATH: [&'static str; 3] = ["regex", "Regex", "new"];
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub const RESULT_PATH: [&'static str; 3] = ["core", "result", "Result"];
|
|
|
|
|
pub const STRING_PATH: [&'static str; 3] = ["collections", "string", "String"];
|
2016-01-29 00:54:10 +00:00
|
|
|
|
pub const VEC_FROM_ELEM_PATH: [&'static str; 3] = ["std", "vec", "from_elem"];
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub const VEC_PATH: [&'static str; 3] = ["collections", "vec", "Vec"];
|
2015-08-21 16:48:36 +00:00
|
|
|
|
|
2015-10-11 21:12:21 +00:00
|
|
|
|
/// Produce a nested chain of if-lets and ifs from the patterns:
|
|
|
|
|
///
|
|
|
|
|
/// if_let_chain! {
|
|
|
|
|
/// [
|
2015-10-12 05:54:44 +00:00
|
|
|
|
/// let Some(y) = x,
|
2015-10-11 21:12:21 +00:00
|
|
|
|
/// y.len() == 2,
|
2015-10-12 05:54:44 +00:00
|
|
|
|
/// let Some(z) = y,
|
2015-10-11 21:12:21 +00:00
|
|
|
|
/// ],
|
|
|
|
|
/// {
|
|
|
|
|
/// 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
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Returns true if the two spans come from differing expansions (i.e. one is from a macro and one
|
|
|
|
|
/// isn't).
|
2016-01-02 16:11:48 +00:00
|
|
|
|
pub fn differing_macro_contexts(sp1: Span, sp2: Span) -> bool {
|
|
|
|
|
sp1.expn_id != sp2.expn_id
|
|
|
|
|
}
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Returns true if this `expn_info` was expanded by any macro.
|
2015-11-18 11:35:18 +00:00
|
|
|
|
pub fn in_macro<T: LintContext>(cx: &T, span: Span) -> bool {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
cx.sess().codemap().with_expn_info(span.expn_id, |info| info.is_some())
|
2015-06-01 20:30:34 +00:00
|
|
|
|
}
|
2015-06-07 10:05:14 +00:00
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Returns true if the macro that expanded the crate was outside of the current crate or was a
|
|
|
|
|
/// compiler plugin.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn in_external_macro<T: LintContext>(cx: &T, span: Span) -> bool {
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Invokes in_macro with the expansion info of the given span slightly heavy, try to use this
|
|
|
|
|
/// after other checks have already happened.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
fn in_macro_ext<T: LintContext>(cx: &T, opt_info: Option<&ExpnInfo>) -> bool {
|
2015-09-17 05:27:18 +00:00
|
|
|
|
// no ExpnInfo = no macro
|
|
|
|
|
opt_info.map_or(false, |info| {
|
2015-10-11 21:12:21 +00:00
|
|
|
|
if let ExpnFormat::MacroAttribute(..) = info.callee.format {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
// these are all plugins
|
|
|
|
|
return true;
|
2015-09-17 05:27:18 +00:00
|
|
|
|
}
|
|
|
|
|
// no span for the callee = external macro
|
|
|
|
|
info.callee.span.map_or(true, |span| {
|
|
|
|
|
// no snippet = external macro or compiler-builtin expansion
|
2016-01-04 04:26:12 +00:00
|
|
|
|
cx.sess().codemap().span_to_snippet(span).ok().map_or(true, |code| !code.starts_with("macro_rules"))
|
2015-09-17 05:27:18 +00:00
|
|
|
|
})
|
|
|
|
|
})
|
|
|
|
|
}
|
2015-09-06 08:53:55 +00:00
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
cx.sess().codemap().with_expn_info(span.expn_id, |info| in_macro_ext(cx, info))
|
2015-06-07 10:05:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Check if a `DefId`'s path matches the given absolute type path usage.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
/// ```
|
|
|
|
|
/// match_def_path(cx, id, &["core", "option", "Option"])
|
|
|
|
|
/// ```
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn match_def_path(cx: &LateContext, def_id: DefId, path: &[&str]) -> bool {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
cx.tcx.with_path(def_id, |iter| {
|
2016-02-22 19:00:51 +00:00
|
|
|
|
let mut len = 0;
|
|
|
|
|
|
|
|
|
|
iter.inspect(|_| len += 1)
|
|
|
|
|
.zip(path)
|
2016-02-29 11:19:32 +00:00
|
|
|
|
.all(|(nm, p)| nm.name().as_str() == *p) && len == path.len()
|
2016-01-04 04:26:12 +00:00
|
|
|
|
})
|
2015-06-07 10:05:14 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Check if type is struct or enum type with given def path.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn match_type(cx: &LateContext, ty: ty::Ty, path: &[&str]) -> bool {
|
2015-08-21 17:00:33 +00:00
|
|
|
|
match ty.sty {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
ty::TyEnum(ref adt, _) | ty::TyStruct(ref adt, _) => match_def_path(cx, adt.did, path),
|
|
|
|
|
_ => false,
|
2015-08-21 17:00:33 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-18 12:10:13 +00:00
|
|
|
|
/// Check if the method call given in `expr` belongs to given type.
|
2015-10-17 18:16:54 +00:00
|
|
|
|
pub fn match_impl_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
|
|
|
|
|
let method_call = ty::MethodCall::expr(expr.id);
|
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
let trt_id = cx.tcx
|
|
|
|
|
.tables
|
|
|
|
|
.borrow()
|
|
|
|
|
.method_map
|
|
|
|
|
.get(&method_call)
|
|
|
|
|
.and_then(|callee| cx.tcx.impl_of_method(callee.def_id));
|
2015-10-17 18:16:54 +00:00
|
|
|
|
if let Some(trt_id) = trt_id {
|
|
|
|
|
match_def_path(cx, trt_id, path)
|
|
|
|
|
} else {
|
|
|
|
|
false
|
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-27 09:22:53 +00:00
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Check if the method call given in `expr` belongs to given trait.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn match_trait_method(cx: &LateContext, expr: &Expr, path: &[&str]) -> bool {
|
2015-08-23 14:32:50 +00:00
|
|
|
|
let method_call = ty::MethodCall::expr(expr.id);
|
2016-01-12 22:17:54 +00:00
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
let trt_id = cx.tcx
|
|
|
|
|
.tables
|
|
|
|
|
.borrow()
|
|
|
|
|
.method_map
|
|
|
|
|
.get(&method_call)
|
|
|
|
|
.and_then(|callee| cx.tcx.trait_of_item(callee.def_id));
|
2015-08-23 14:32:50 +00:00
|
|
|
|
if let Some(trt_id) = trt_id {
|
|
|
|
|
match_def_path(cx, trt_id, path)
|
|
|
|
|
} else {
|
|
|
|
|
false
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Match a `Path` against a slice of segment string literals.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
/// ```
|
|
|
|
|
/// match_path(path, &["std", "rt", "begin_unwind"])
|
|
|
|
|
/// ```
|
2015-06-07 10:05:14 +00:00
|
|
|
|
pub fn match_path(path: &Path, segments: &[&str]) -> bool {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
|
2015-06-07 10:05:14 +00:00
|
|
|
|
}
|
2015-07-09 15:02:21 +00:00
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Match a `Path` against a slice of segment string literals, e.g.
|
|
|
|
|
///
|
|
|
|
|
/// # Examples
|
|
|
|
|
/// ```
|
|
|
|
|
/// match_path(path, &["std", "rt", "begin_unwind"])
|
|
|
|
|
/// ```
|
2015-10-11 21:12:21 +00:00
|
|
|
|
pub fn match_path_ast(path: &ast::Path, segments: &[&str]) -> bool {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
path.segments.iter().rev().zip(segments.iter().rev()).all(|(a, b)| a.identifier.name.as_str() == *b)
|
2015-10-11 21:12:21 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-18 12:10:13 +00:00
|
|
|
|
/// 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,
|
2016-01-30 12:48:39 +00:00
|
|
|
|
None => return None,
|
2016-01-18 12:10:13 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
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;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-01-30 12:48:39 +00:00
|
|
|
|
} else {
|
2016-01-18 12:10:13 +00:00
|
|
|
|
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 {
|
2016-01-22 12:24:44 +00:00
|
|
|
|
cstore::DlDef(def::Def::Trait(trait_id)) => Some(trait_id),
|
2016-01-18 12:10:13 +00:00
|
|
|
|
_ => None,
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Check whether a type implements a trait.
|
|
|
|
|
/// See also `get_trait_def_id`.
|
2016-01-30 12:48:39 +00:00
|
|
|
|
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 {
|
2016-01-18 12:10:13 +00:00
|
|
|
|
cx.tcx.populate_implementations_for_trait_if_necessary(trait_id);
|
|
|
|
|
|
2016-01-18 12:27:42 +00:00
|
|
|
|
let infcx = infer::new_infer_ctxt(cx.tcx, &cx.tcx.tables, None);
|
2016-01-18 12:10:13 +00:00
|
|
|
|
let obligation = traits::predicate_for_trait_def(cx.tcx,
|
|
|
|
|
traits::ObligationCause::dummy(),
|
2016-01-30 12:48:39 +00:00
|
|
|
|
trait_id,
|
|
|
|
|
0,
|
|
|
|
|
ty,
|
2016-01-18 14:35:50 +00:00
|
|
|
|
ty_params.unwrap_or_default());
|
2016-01-18 12:10:13 +00:00
|
|
|
|
|
|
|
|
|
traits::SelectionContext::new(&infcx).evaluate_obligation_conservatively(&obligation)
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// 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()`
|
2015-12-27 22:15:09 +00:00
|
|
|
|
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());
|
2016-01-04 04:26:12 +00:00
|
|
|
|
for method_name in methods.iter().rev() {
|
|
|
|
|
// method chains are stored last -> first
|
2015-12-27 22:15:09 +00:00
|
|
|
|
if let ExprMethodCall(ref name, _, ref args) = current.node {
|
2015-12-27 09:22:53 +00:00
|
|
|
|
if name.node.as_str() == *method_name {
|
2015-12-27 22:15:09 +00:00
|
|
|
|
matched.push(args); // build up `matched` backwards
|
|
|
|
|
current = &args[0] // go to parent expression
|
2016-01-04 04:26:12 +00:00
|
|
|
|
} else {
|
2015-12-27 22:15:09 +00:00
|
|
|
|
return None;
|
2015-12-27 09:22:53 +00:00
|
|
|
|
}
|
2016-01-04 04:26:12 +00:00
|
|
|
|
} else {
|
2015-12-27 22:15:09 +00:00
|
|
|
|
return None;
|
2015-12-27 09:22:53 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2015-12-27 22:15:09 +00:00
|
|
|
|
matched.reverse(); // reverse `matched`, so that it is in the same order as `methods`
|
|
|
|
|
Some(matched)
|
2015-12-27 09:22:53 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Get the name of the item the expression is in, if available.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn get_item_name(cx: &LateContext, expr: &Expr) -> Option<Name> {
|
2015-09-06 18:57:06 +00:00
|
|
|
|
let parent_id = cx.tcx.map.get_parent(expr.id);
|
|
|
|
|
match cx.tcx.map.find(parent_id) {
|
2016-02-03 14:39:22 +00:00
|
|
|
|
Some(Node::NodeItem(&Item{ ref name, .. })) |
|
|
|
|
|
Some(Node::NodeTraitItem(&TraitItem{ ref name, .. })) |
|
|
|
|
|
Some(Node::NodeImplItem(&ImplItem{ ref name, .. })) => Some(*name),
|
2015-09-06 18:57:06 +00:00
|
|
|
|
_ => None,
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Checks if a `let` decl is from a `for` loop desugaring.
|
2015-10-11 21:12:21 +00:00
|
|
|
|
pub fn is_from_for_desugar(decl: &Decl) -> bool {
|
|
|
|
|
if_let_chain! {
|
|
|
|
|
[
|
|
|
|
|
let DeclLocal(ref loc) = decl.node,
|
|
|
|
|
let Some(ref expr) = loc.init,
|
2015-10-16 23:03:05 +00:00
|
|
|
|
let ExprMatch(_, _, MatchSource::ForLoopDesugar) = expr.node
|
2015-10-11 21:12:21 +00:00
|
|
|
|
],
|
|
|
|
|
{ return true; }
|
|
|
|
|
};
|
|
|
|
|
false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Convert a span to a code snippet if available, otherwise use default.
|
|
|
|
|
///
|
|
|
|
|
/// # Example
|
|
|
|
|
/// ```
|
|
|
|
|
/// snippet(cx, expr.span, "..")
|
|
|
|
|
/// ```
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn snippet<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
|
2016-01-16 17:47:45 +00:00
|
|
|
|
cx.sess().codemap().span_to_snippet(span).map(From::from).unwrap_or_else(|_| Cow::Borrowed(default))
|
2015-08-11 13:07:21 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Convert a span to a code snippet. Returns `None` if not available.
|
2015-12-08 06:03:01 +00:00
|
|
|
|
pub fn snippet_opt<T: LintContext>(cx: &T, span: Span) -> Option<String> {
|
|
|
|
|
cx.sess().codemap().span_to_snippet(span).ok()
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// 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, "..")
|
|
|
|
|
/// ```
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn snippet_block<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
|
2015-08-12 11:14:14 +00:00
|
|
|
|
let snip = snippet(cx, span, default);
|
|
|
|
|
trim_multiline(snip, true)
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// 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.
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub fn expr_block<'a, T: LintContext>(cx: &T, expr: &Expr, option: Option<String>, default: &'a str) -> Cow<'a, str> {
|
2015-08-29 09:41:06 +00:00
|
|
|
|
let code = snippet_block(cx, expr.span, default);
|
2016-01-12 22:17:54 +00:00
|
|
|
|
let string = option.unwrap_or_default();
|
2015-08-29 09:41:06 +00:00
|
|
|
|
if let ExprBlock(_) = expr.node {
|
2015-09-27 07:39:42 +00:00
|
|
|
|
Cow::Owned(format!("{}{}", code, string))
|
|
|
|
|
} else if string.is_empty() {
|
2015-08-29 09:41:06 +00:00
|
|
|
|
Cow::Owned(format!("{{ {} }}", code))
|
2015-09-27 07:39:42 +00:00
|
|
|
|
} else {
|
|
|
|
|
Cow::Owned(format!("{{\n{};\n{}\n}}", code, string))
|
2015-08-29 09:41:06 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Trim indentation from a multiline string with possibility of ignoring the first line.
|
2015-08-13 17:50:00 +00:00
|
|
|
|
pub fn trim_multiline(s: Cow<str>, ignore_first: bool) -> Cow<str> {
|
2015-08-21 15:11:34 +00:00
|
|
|
|
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, ' ')
|
2015-08-13 07:57:30 +00:00
|
|
|
|
}
|
|
|
|
|
|
2015-08-13 17:50:00 +00:00
|
|
|
|
fn trim_multiline_inner(s: Cow<str>, ignore_first: bool, ch: char) -> Cow<str> {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
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);
|
2015-08-12 11:14:14 +00:00
|
|
|
|
if x > 0 {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
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"))
|
2015-08-12 11:14:14 +00:00
|
|
|
|
} else {
|
|
|
|
|
s
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Get a parent expressions if any – this is useful to constrain a lint.
|
2015-09-19 02:53:04 +00:00
|
|
|
|
pub fn get_parent_expr<'c>(cx: &'c LateContext, e: &Expr) -> Option<&'c Expr> {
|
2015-08-11 13:07:21 +00:00
|
|
|
|
let map = &cx.tcx.map;
|
2016-01-04 04:26:12 +00:00
|
|
|
|
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| {
|
2016-02-03 14:39:22 +00:00
|
|
|
|
if let Node::NodeExpr(parent) = node {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
Some(parent)
|
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
|
|
|
|
})
|
2015-07-09 15:02:21 +00:00
|
|
|
|
}
|
2015-07-16 06:53:02 +00:00
|
|
|
|
|
2015-10-26 22:49:37 +00:00
|
|
|
|
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 {
|
2016-02-03 14:39:22 +00:00
|
|
|
|
Node::NodeBlock(ref block) => Some(block),
|
|
|
|
|
Node::NodeItem(&Item{ node: ItemFn(_, _, _, _, _, ref block), .. }) => Some(block),
|
2016-01-04 04:26:12 +00:00
|
|
|
|
_ => None,
|
2015-10-26 22:49:37 +00:00
|
|
|
|
}
|
2016-01-04 04:26:12 +00:00
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
2015-10-26 22:49:37 +00:00
|
|
|
|
}
|
|
|
|
|
|
2015-12-31 20:39:03 +00:00
|
|
|
|
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
|
2016-01-04 04:26:12 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<'a> Deref for DiagnosticWrapper<'a> {
|
|
|
|
|
type Target = DiagnosticBuilder<'a>;
|
|
|
|
|
fn deref(&self) -> &DiagnosticBuilder<'a> {
|
|
|
|
|
&self.0
|
2016-01-04 04:26:12 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub fn span_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str) -> DiagnosticWrapper<'a> {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
let mut db = cx.struct_span_lint(lint, sp, msg);
|
2015-08-27 05:39:40 +00:00
|
|
|
|
if cx.current_level(lint) != Level::Allow {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
db.fileline_help(sp,
|
|
|
|
|
&format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
|
|
|
|
|
lint.name_lower()));
|
2015-08-27 05:39:40 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
DiagnosticWrapper(db)
|
2015-08-11 13:07:21 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub fn span_help_and_lint<'a, T: LintContext>(cx: &'a T, lint: &'static Lint, span: Span, msg: &str, help: &str)
|
|
|
|
|
-> DiagnosticWrapper<'a> {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
let mut db = cx.struct_span_lint(lint, span, msg);
|
2015-08-11 13:07:21 +00:00
|
|
|
|
if cx.current_level(lint) != Level::Allow {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
db.fileline_help(span,
|
|
|
|
|
&format!("{}\nfor further information visit \
|
|
|
|
|
https://github.com/Manishearth/rust-clippy/wiki#{}",
|
|
|
|
|
help,
|
|
|
|
|
lint.name_lower()));
|
2015-08-11 13:07:21 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
DiagnosticWrapper(db)
|
2015-07-26 14:53:11 +00:00
|
|
|
|
}
|
2015-08-11 18:57:21 +00:00
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
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> {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
let mut db = cx.struct_span_lint(lint, span, msg);
|
2015-09-02 06:19:47 +00:00
|
|
|
|
if cx.current_level(lint) != Level::Allow {
|
|
|
|
|
if note_span == span {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
db.fileline_note(note_span, note);
|
2015-09-02 06:19:47 +00:00
|
|
|
|
} else {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
db.span_note(note_span, note);
|
2015-09-02 06:19:47 +00:00
|
|
|
|
}
|
2016-01-04 04:26:12 +00:00
|
|
|
|
db.fileline_help(span,
|
|
|
|
|
&format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
|
|
|
|
|
lint.name_lower()));
|
2015-09-02 06:19:47 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
DiagnosticWrapper(db)
|
2015-09-02 06:19:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub fn span_lint_and_then<'a, T: LintContext, F>(cx: &'a T, lint: &'static Lint, sp: Span, msg: &str, f: F)
|
|
|
|
|
-> DiagnosticWrapper<'a>
|
2016-01-29 00:54:10 +00:00
|
|
|
|
where F: FnOnce(&mut DiagnosticWrapper)
|
2016-01-04 04:26:12 +00:00
|
|
|
|
{
|
2015-12-31 20:39:03 +00:00
|
|
|
|
let mut db = DiagnosticWrapper(cx.struct_span_lint(lint, sp, msg));
|
2015-12-08 16:28:35 +00:00
|
|
|
|
if cx.current_level(lint) != Level::Allow {
|
2015-12-31 20:39:03 +00:00
|
|
|
|
f(&mut db);
|
2016-01-04 04:26:12 +00:00
|
|
|
|
db.fileline_help(sp,
|
|
|
|
|
&format!("for further information visit https://github.com/Manishearth/rust-clippy/wiki#{}",
|
|
|
|
|
lint.name_lower()));
|
2015-12-08 16:28:35 +00:00
|
|
|
|
}
|
2015-12-31 20:39:03 +00:00
|
|
|
|
db
|
2015-12-08 16:28:35 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Return the base type for references and raw pointers.
|
2015-08-13 14:28:11 +00:00
|
|
|
|
pub fn walk_ptrs_ty(ty: ty::Ty) -> ty::Ty {
|
2015-08-11 18:57:21 +00:00
|
|
|
|
match ty.sty {
|
|
|
|
|
ty::TyRef(_, ref tm) | ty::TyRawPtr(ref tm) => walk_ptrs_ty(tm.ty),
|
2016-01-04 04:26:12 +00:00
|
|
|
|
_ => ty,
|
2015-08-11 18:57:21 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2015-08-12 05:48:00 +00:00
|
|
|
|
|
2016-01-12 22:17:54 +00:00
|
|
|
|
/// Return the base type for references and raw pointers, and count reference depth.
|
2015-08-25 16:38:08 +00:00
|
|
|
|
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),
|
2016-01-04 04:26:12 +00:00
|
|
|
|
_ => (ty, depth),
|
2015-08-25 16:38:08 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
inner(ty, 0)
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-14 19:58:32 +00:00
|
|
|
|
/// Check whether the given expression is a constant literal of the given value.
|
2016-01-04 04:26:12 +00:00
|
|
|
|
pub fn is_integer_literal(expr: &Expr, value: u64) -> bool {
|
2015-09-04 13:26:58 +00:00
|
|
|
|
// FIXME: use constant folding
|
|
|
|
|
if let ExprLit(ref spanned) = expr.node {
|
2016-02-12 17:35:44 +00:00
|
|
|
|
if let LitKind::Int(v, _) = spanned.node {
|
2015-09-04 13:26:58 +00:00
|
|
|
|
return v == value;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
false
|
|
|
|
|
}
|
|
|
|
|
|
2015-11-04 03:11:40 +00:00
|
|
|
|
pub fn is_adjusted(cx: &LateContext, e: &Expr) -> bool {
|
|
|
|
|
cx.tcx.tables.borrow().adjustments.get(&e.id).is_some()
|
|
|
|
|
}
|
|
|
|
|
|
2015-11-18 11:35:18 +00:00
|
|
|
|
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 {
|
2016-01-04 04:26:12 +00:00
|
|
|
|
LimitStack { stack: vec![limit] }
|
2015-11-18 11:35:18 +00:00
|
|
|
|
}
|
|
|
|
|
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;
|
2016-01-04 04:26:12 +00:00
|
|
|
|
parse_attrs(sess, attrs, name, |val| stack.push(val));
|
2015-11-18 11:35:18 +00:00
|
|
|
|
}
|
|
|
|
|
pub fn pop_attrs(&mut self, sess: &Session, attrs: &[ast::Attribute], name: &'static str) {
|
|
|
|
|
let stack = &mut self.stack;
|
2016-01-04 04:26:12 +00:00
|
|
|
|
parse_attrs(sess, attrs, name, |val| assert_eq!(stack.pop(), Some(val)));
|
2015-11-18 11:35:18 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
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;
|
2016-01-04 04:26:12 +00:00
|
|
|
|
if attr.is_sugared_doc {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2016-02-12 17:35:44 +00:00
|
|
|
|
if let ast::MetaItemKind::NameValue(ref key, ref value) = attr.value.node {
|
2015-11-18 11:35:18 +00:00
|
|
|
|
if *key == name {
|
2016-02-12 17:35:44 +00:00
|
|
|
|
if let LitKind::Str(ref s, _) = value.node {
|
2015-11-18 11:35:18 +00:00
|
|
|
|
if let Ok(value) = FromStr::from_str(s) {
|
|
|
|
|
f(value)
|
|
|
|
|
} else {
|
|
|
|
|
sess.span_err(value.span, "not a number");
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
unreachable!()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-01-03 14:49:25 +00:00
|
|
|
|
|
2016-01-29 21:19:14 +00:00
|
|
|
|
/// Return the pre-expansion span if is this comes from an expansion of the macro `name`.
|
2016-01-28 18:29:59 +00:00
|
|
|
|
pub fn is_expn_of(cx: &LateContext, mut span: Span, name: &str) -> Option<Span> {
|
|
|
|
|
loop {
|
2016-02-29 11:19:32 +00:00
|
|
|
|
let span_name_span = cx.tcx
|
|
|
|
|
.sess
|
|
|
|
|
.codemap()
|
|
|
|
|
.with_expn_info(span.expn_id, |expn| expn.map(|ei| (ei.callee.name(), ei.call_site)));
|
2016-01-30 12:48:39 +00:00
|
|
|
|
|
2016-02-01 10:28:39 +00:00
|
|
|
|
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,
|
|
|
|
|
}
|
2016-01-28 18:29:59 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2016-02-15 15:59:56 +00:00
|
|
|
|
|
|
|
|
|
/// Returns index of character after first CamelCase component of `s`
|
|
|
|
|
pub fn camel_case_until(s: &str) -> usize {
|
|
|
|
|
let mut iter = s.char_indices();
|
|
|
|
|
if let Some((_, first)) = iter.next() {
|
|
|
|
|
if !first.is_uppercase() {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
let mut up = true;
|
|
|
|
|
let mut last_i = 0;
|
|
|
|
|
for (i, c) in iter {
|
|
|
|
|
if up {
|
|
|
|
|
if c.is_lowercase() {
|
|
|
|
|
up = false;
|
|
|
|
|
} else {
|
|
|
|
|
return last_i;
|
|
|
|
|
}
|
|
|
|
|
} else if c.is_uppercase() {
|
|
|
|
|
up = true;
|
|
|
|
|
last_i = i;
|
|
|
|
|
} else if !c.is_lowercase() {
|
|
|
|
|
return i;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if up {
|
|
|
|
|
last_i
|
|
|
|
|
} else {
|
|
|
|
|
s.len()
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Returns index of last CamelCase component of `s`.
|
|
|
|
|
pub fn camel_case_from(s: &str) -> usize {
|
|
|
|
|
let mut iter = s.char_indices().rev();
|
|
|
|
|
if let Some((_, first)) = iter.next() {
|
|
|
|
|
if !first.is_lowercase() {
|
|
|
|
|
return s.len();
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
return s.len();
|
|
|
|
|
}
|
|
|
|
|
let mut down = true;
|
|
|
|
|
let mut last_i = s.len();
|
|
|
|
|
for (i, c) in iter {
|
|
|
|
|
if down {
|
|
|
|
|
if c.is_uppercase() {
|
|
|
|
|
down = false;
|
|
|
|
|
last_i = i;
|
|
|
|
|
} else if !c.is_lowercase() {
|
|
|
|
|
return last_i;
|
|
|
|
|
}
|
|
|
|
|
} else if c.is_lowercase() {
|
|
|
|
|
down = true;
|
|
|
|
|
} else {
|
|
|
|
|
return last_i;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
last_i
|
|
|
|
|
}
|
2016-03-07 15:31:38 +00:00
|
|
|
|
|
|
|
|
|
/// Represents a range akin to `ast::ExprKind::Range`.
|
|
|
|
|
pub struct UnsugaredRange<'a> {
|
|
|
|
|
pub start: Option<&'a Expr>,
|
|
|
|
|
pub end: Option<&'a Expr>,
|
|
|
|
|
pub limits: RangeLimits,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// Unsugar a `hir` range.
|
|
|
|
|
pub fn unsugar_range(expr: &Expr) -> Option<UnsugaredRange> {
|
|
|
|
|
// To be removed when ranges get stable.
|
|
|
|
|
fn unwrap_unstable(expr: &Expr) -> &Expr {
|
|
|
|
|
if let ExprBlock(ref block) = expr.node {
|
|
|
|
|
if block.rules == BlockCheckMode::PushUnstableBlock || block.rules == BlockCheckMode::PopUnstableBlock {
|
|
|
|
|
if let Some(ref expr) = block.expr {
|
|
|
|
|
return expr;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
expr
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fn get_field<'a>(name: &str, fields: &'a [Field]) -> Option<&'a Expr> {
|
|
|
|
|
let expr = &fields.iter()
|
|
|
|
|
.find(|field| field.name.node.as_str() == name)
|
|
|
|
|
.unwrap_or_else(|| panic!("missing {} field for range", name))
|
|
|
|
|
.expr;
|
|
|
|
|
|
|
|
|
|
Some(unwrap_unstable(expr))
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if let ExprStruct(ref path, ref fields, None) = unwrap_unstable(&expr).node {
|
|
|
|
|
if match_path(path, &RANGE_FROM_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: get_field("start", fields), end: None, limits: RangeLimits::HalfOpen })
|
|
|
|
|
} else if match_path(path, &RANGE_FULL_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: None, end: None, limits: RangeLimits::HalfOpen })
|
|
|
|
|
} else if match_path(path, &RANGE_INCLUSIVE_NON_EMPTY_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: get_field("start", fields), end: get_field("end", fields), limits: RangeLimits::Closed })
|
|
|
|
|
} else if match_path(path, &RANGE_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: get_field("start", fields), end: get_field("end", fields), limits: RangeLimits::HalfOpen })
|
|
|
|
|
} else if match_path(path, &RANGE_TO_INCLUSIVE_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: None, end: get_field("end", fields), limits: RangeLimits::Closed })
|
|
|
|
|
} else if match_path(path, &RANGE_TO_PATH) {
|
|
|
|
|
Some(UnsugaredRange { start: None, end: get_field("end", fields), limits: RangeLimits::HalfOpen })
|
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
None
|
|
|
|
|
}
|
|
|
|
|
}
|