2018-10-06 11:18:06 -05:00
|
|
|
// Copyright 2014-2018 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2018-09-15 02:21:58 -05:00
|
|
|
use crate::rustc::hir::intravisit as visit;
|
2018-11-27 14:14:15 -06:00
|
|
|
use crate::rustc::hir::*;
|
2018-09-15 02:21:58 -05:00
|
|
|
use crate::rustc::lint::{LateContext, LateLintPass, LintArray, LintPass};
|
|
|
|
use crate::rustc::middle::expr_use_visitor::*;
|
|
|
|
use crate::rustc::middle::mem_categorization::{cmt_, Categorization};
|
|
|
|
use crate::rustc::ty::layout::LayoutOf;
|
2018-11-27 14:14:15 -06:00
|
|
|
use crate::rustc::ty::{self, Ty};
|
2018-09-15 02:21:58 -05:00
|
|
|
use crate::rustc::util::nodemap::NodeSet;
|
2018-11-27 14:14:15 -06:00
|
|
|
use crate::rustc::{declare_tool_lint, lint_array};
|
2018-09-15 02:21:58 -05:00
|
|
|
use crate::syntax::ast::NodeId;
|
|
|
|
use crate::syntax::source_map::Span;
|
2018-05-30 03:15:50 -05:00
|
|
|
use crate::utils::span_lint;
|
2015-12-04 04:12:53 -06:00
|
|
|
|
2016-07-10 08:23:50 -05:00
|
|
|
pub struct Pass {
|
|
|
|
pub too_large_for_stack: u64,
|
|
|
|
}
|
2015-12-04 04:12:53 -06:00
|
|
|
|
2016-08-06 02:55:04 -05:00
|
|
|
/// **What it does:** Checks for usage of `Box<T>` where an unboxed `T` would
|
|
|
|
/// work fine.
|
2015-12-12 21:38:58 -06:00
|
|
|
///
|
2016-08-06 02:55:04 -05:00
|
|
|
/// **Why is this bad?** This is an unnecessary allocation, and bad for
|
|
|
|
/// performance. It is only necessary to allocate if you wish to move the box
|
|
|
|
/// into something.
|
2015-12-12 21:38:58 -06:00
|
|
|
///
|
2016-08-06 02:55:04 -05:00
|
|
|
/// **Known problems:** None.
|
2015-12-12 21:38:58 -06:00
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// fn main() {
|
|
|
|
/// let x = Box::new(1);
|
|
|
|
/// foo(*x);
|
|
|
|
/// println!("{}", *x);
|
|
|
|
/// }
|
2015-12-14 14:17:11 -06:00
|
|
|
/// ```
|
2018-03-28 08:24:26 -05:00
|
|
|
declare_clippy_lint! {
|
2016-08-06 03:18:36 -05:00
|
|
|
pub BOXED_LOCAL,
|
2018-03-28 08:24:26 -05:00
|
|
|
perf,
|
2016-08-06 03:18:36 -05:00
|
|
|
"using `Box<T>` where unnecessary"
|
2016-02-05 17:13:29 -06:00
|
|
|
}
|
2015-12-04 04:12:53 -06:00
|
|
|
|
2018-07-23 06:01:12 -05:00
|
|
|
fn is_non_trait_box(ty: Ty<'_>) -> bool {
|
2017-02-03 04:52:13 -06:00
|
|
|
ty.is_box() && !ty.boxed_ty().is_trait()
|
2015-12-28 08:12:57 -06:00
|
|
|
}
|
|
|
|
|
2016-12-22 07:16:07 -06:00
|
|
|
struct EscapeDelegate<'a, 'tcx: 'a> {
|
2017-06-10 21:34:47 -05:00
|
|
|
cx: &'a LateContext<'a, 'tcx>,
|
2015-12-04 04:12:53 -06:00
|
|
|
set: NodeSet,
|
2016-07-10 08:23:50 -05:00
|
|
|
too_large_for_stack: u64,
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
|
|
|
|
2016-06-10 09:17:20 -05:00
|
|
|
impl LintPass for Pass {
|
2015-12-04 04:12:53 -06:00
|
|
|
fn get_lints(&self) -> LintArray {
|
|
|
|
lint_array!(BOXED_LOCAL)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-07 06:13:40 -06:00
|
|
|
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Pass {
|
2016-12-21 03:25:14 -06:00
|
|
|
fn check_fn(
|
2016-12-21 05:14:54 -06:00
|
|
|
&mut self,
|
|
|
|
cx: &LateContext<'a, 'tcx>,
|
|
|
|
_: visit::FnKind<'tcx>,
|
2017-01-03 22:40:42 -06:00
|
|
|
_: &'tcx FnDecl,
|
|
|
|
body: &'tcx Body,
|
2016-12-21 05:14:54 -06:00
|
|
|
_: Span,
|
2017-08-09 02:30:56 -05:00
|
|
|
node_id: NodeId,
|
2016-12-21 03:25:14 -06:00
|
|
|
) {
|
2018-10-15 13:20:50 -05:00
|
|
|
// If the method is an impl for a trait, don't warn
|
2018-12-07 18:56:03 -06:00
|
|
|
let parent_id = cx.tcx.hir().get_parent(node_id);
|
|
|
|
let parent_node = cx.tcx.hir().find(parent_id);
|
2018-10-15 13:20:50 -05:00
|
|
|
|
|
|
|
if let Some(Node::Item(item)) = parent_node {
|
|
|
|
if let ItemKind::Impl(_, _, _, _, Some(..), _, _) = item.node {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-12-04 04:12:53 -06:00
|
|
|
let mut v = EscapeDelegate {
|
2018-03-15 10:07:15 -05:00
|
|
|
cx,
|
2018-11-21 06:29:23 -06:00
|
|
|
set: NodeSet::default(),
|
2016-07-10 08:23:50 -05:00
|
|
|
too_large_for_stack: self.too_large_for_stack,
|
2015-12-04 04:12:53 -06:00
|
|
|
};
|
2016-05-12 12:11:13 -05:00
|
|
|
|
2018-12-07 18:56:03 -06:00
|
|
|
let fn_def_id = cx.tcx.hir().local_def_id(node_id);
|
2017-09-04 09:10:36 -05:00
|
|
|
let region_scope_tree = &cx.tcx.region_scope_tree(fn_def_id);
|
2017-10-19 11:27:58 -05:00
|
|
|
ExprUseVisitor::new(&mut v, cx.tcx, cx.param_env, region_scope_tree, cx.tables, None).consume_body(body);
|
2016-05-12 12:11:13 -05:00
|
|
|
|
2015-12-04 04:12:53 -06:00
|
|
|
for node in v.set {
|
2017-08-09 02:30:56 -05:00
|
|
|
span_lint(
|
|
|
|
cx,
|
|
|
|
BOXED_LOCAL,
|
2018-12-07 18:56:03 -06:00
|
|
|
cx.tcx.hir().span(node),
|
2017-08-09 02:30:56 -05:00
|
|
|
"local variable doesn't need to be boxed here",
|
|
|
|
);
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-06-10 21:34:47 -05:00
|
|
|
impl<'a, 'tcx> Delegate<'tcx> for EscapeDelegate<'a, 'tcx> {
|
2018-05-06 07:05:41 -05:00
|
|
|
fn consume(&mut self, _: NodeId, _: Span, cmt: &cmt_<'tcx>, mode: ConsumeMode) {
|
2015-12-04 04:12:53 -06:00
|
|
|
if let Categorization::Local(lid) = cmt.cat {
|
2017-06-04 16:28:01 -05:00
|
|
|
if let Move(DirectRefMove) = mode {
|
|
|
|
// moved out or in. clearly can't be localized
|
|
|
|
self.set.remove(&lid);
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2018-05-06 07:05:41 -05:00
|
|
|
fn matched_pat(&mut self, _: &Pat, _: &cmt_<'tcx>, _: MatchMode) {}
|
|
|
|
fn consume_pat(&mut self, consume_pat: &Pat, cmt: &cmt_<'tcx>, _: ConsumeMode) {
|
2018-12-07 18:56:03 -06:00
|
|
|
let map = &self.cx.tcx.hir();
|
2016-02-01 05:35:01 -06:00
|
|
|
if map.is_argument(consume_pat.id) {
|
|
|
|
// Skip closure arguments
|
2018-08-28 06:13:42 -05:00
|
|
|
if let Some(Node::Expr(..)) = map.find(map.get_parent_node(consume_pat.id)) {
|
2016-02-01 05:35:01 -06:00
|
|
|
return;
|
|
|
|
}
|
2016-07-10 08:23:50 -05:00
|
|
|
if is_non_trait_box(cmt.ty) && !self.is_large_box(cmt.ty) {
|
2015-12-28 08:12:57 -06:00
|
|
|
self.set.insert(consume_pat.id);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
2015-12-04 04:12:53 -06:00
|
|
|
if let Categorization::Rvalue(..) = cmt.cat {
|
2018-07-03 03:52:59 -05:00
|
|
|
let id = map.hir_to_node_id(cmt.hir_id);
|
2018-08-28 06:13:42 -05:00
|
|
|
if let Some(Node::Stmt(st)) = map.find(map.get_parent_node(id)) {
|
2018-07-12 03:53:53 -05:00
|
|
|
if let StmtKind::Decl(ref decl, _) = st.node {
|
2018-07-16 08:07:39 -05:00
|
|
|
if let DeclKind::Local(ref loc) = decl.node {
|
2015-12-04 04:12:53 -06:00
|
|
|
if let Some(ref ex) = loc.init {
|
2018-07-12 02:30:57 -05:00
|
|
|
if let ExprKind::Box(..) = ex.node {
|
2016-07-10 08:23:50 -05:00
|
|
|
if is_non_trait_box(cmt.ty) && !self.is_large_box(cmt.ty) {
|
2015-12-04 04:12:53 -06:00
|
|
|
// let x = box (...)
|
|
|
|
self.set.insert(consume_pat.id);
|
|
|
|
}
|
|
|
|
// TODO Box::new
|
|
|
|
// TODO vec![]
|
|
|
|
// TODO "foo".to_owned() and friends
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if let Categorization::Local(lid) = cmt.cat {
|
|
|
|
if self.set.contains(&lid) {
|
|
|
|
// let y = x where x is known
|
|
|
|
// remove x, insert y
|
|
|
|
self.set.insert(consume_pat.id);
|
|
|
|
self.set.remove(&lid);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2018-11-27 14:14:15 -06:00
|
|
|
fn borrow(
|
|
|
|
&mut self,
|
|
|
|
_: NodeId,
|
|
|
|
_: Span,
|
|
|
|
cmt: &cmt_<'tcx>,
|
|
|
|
_: ty::Region<'_>,
|
|
|
|
_: ty::BorrowKind,
|
|
|
|
loan_cause: LoanCause,
|
|
|
|
) {
|
2015-12-04 04:12:53 -06:00
|
|
|
if let Categorization::Local(lid) = cmt.cat {
|
2017-06-04 16:28:01 -05:00
|
|
|
match loan_cause {
|
|
|
|
// x.foo()
|
|
|
|
// Used without autodereffing (i.e. x.clone())
|
|
|
|
LoanCause::AutoRef |
|
2015-12-04 04:12:53 -06:00
|
|
|
|
2017-06-04 16:28:01 -05:00
|
|
|
// &x
|
|
|
|
// foo(&x) where no extra autoreffing is happening
|
|
|
|
LoanCause::AddrOf |
|
|
|
|
|
|
|
|
// `match x` can move
|
|
|
|
LoanCause::MatchDiscriminant => {
|
|
|
|
self.set.remove(&lid);
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
2017-06-04 16:28:01 -05:00
|
|
|
|
2015-12-04 04:12:53 -06:00
|
|
|
// do nothing for matches, etc. These can't escape
|
2017-06-04 16:28:01 -05:00
|
|
|
_ => {}
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fn decl_without_init(&mut self, _: NodeId, _: Span) {}
|
2018-05-06 07:05:41 -05:00
|
|
|
fn mutate(&mut self, _: NodeId, _: Span, _: &cmt_<'tcx>, _: MutateMode) {}
|
2015-12-04 04:12:53 -06:00
|
|
|
}
|
2016-07-10 08:23:50 -05:00
|
|
|
|
2017-06-10 21:34:47 -05:00
|
|
|
impl<'a, 'tcx> EscapeDelegate<'a, 'tcx> {
|
2017-06-10 21:57:25 -05:00
|
|
|
fn is_large_box(&self, ty: Ty<'tcx>) -> bool {
|
2016-07-10 08:23:50 -05:00
|
|
|
// Large types need to be boxed to avoid stack
|
|
|
|
// overflows.
|
2017-02-03 04:52:13 -06:00
|
|
|
if ty.is_box() {
|
2018-02-09 07:22:41 -06:00
|
|
|
self.cx.layout_of(ty.boxed_ty()).ok().map_or(0, |l| l.size.bytes()) > self.too_large_for_stack
|
2017-06-10 21:34:47 -05:00
|
|
|
} else {
|
|
|
|
false
|
2016-07-10 08:23:50 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|