2012-12-03 18:48:01 -06:00
|
|
|
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2012-12-23 16:41:37 -06:00
|
|
|
use driver::session;
|
2012-09-04 13:54:36 -05:00
|
|
|
use middle::ty;
|
2013-04-12 00:09:54 -05:00
|
|
|
use middle::pat_util;
|
2012-09-04 13:54:36 -05:00
|
|
|
use util::ppaux::{ty_to_str};
|
2012-12-23 16:41:37 -06:00
|
|
|
|
2013-04-03 08:28:36 -05:00
|
|
|
use core::hashmap::HashMap;
|
2013-02-22 23:37:37 -06:00
|
|
|
use std::smallintmap::SmallIntMap;
|
2012-12-23 16:41:37 -06:00
|
|
|
use syntax::attr;
|
|
|
|
use syntax::codemap::span;
|
2013-01-30 11:56:33 -06:00
|
|
|
use syntax::codemap;
|
2013-04-30 00:15:17 -05:00
|
|
|
use syntax::{ast, visit, ast_util};
|
2012-12-23 16:41:37 -06:00
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/**
|
|
|
|
* A 'lint' check is a kind of miscellaneous constraint that a user _might_
|
|
|
|
* want to enforce, but might reasonably want to permit as well, on a
|
|
|
|
* module-by-module basis. They contrast with static constraints enforced by
|
|
|
|
* other phases of the compiler, which are generally required to hold in order
|
|
|
|
* to compile the program at all.
|
|
|
|
*
|
2013-05-07 01:07:00 -05:00
|
|
|
* The lint checking is all consolidated into one pass which runs just before
|
|
|
|
* translation to LLVM bytecode. Throughout compilation, lint warnings can be
|
|
|
|
* added via the `add_lint` method on the Session structure. This requires a
|
|
|
|
* span and an id of the node that the lint is being added to. The lint isn't
|
|
|
|
* actually emitted at that time because it is unknown what the actual lint
|
2013-05-09 12:22:26 -05:00
|
|
|
* level at that location is.
|
2012-07-04 16:53:12 -05:00
|
|
|
*
|
2013-05-09 12:22:26 -05:00
|
|
|
* To actually emit lint warnings/errors, a separate pass is used just before
|
|
|
|
* translation. A context keeps track of the current state of all lint levels.
|
|
|
|
* Upon entering a node of the ast which can modify the lint settings, the
|
|
|
|
* previous lint state is pushed onto a stack and the ast is then recursed upon.
|
|
|
|
* As the ast is traversed, this keeps track of the current lint level for all
|
|
|
|
* lint attributes.
|
2013-05-07 01:07:00 -05:00
|
|
|
*
|
2013-05-09 12:22:26 -05:00
|
|
|
* At each node of the ast which can modify lint attributes, all known lint
|
|
|
|
* passes are also applied. Each lint pass is a visit::vt<()> structure. These
|
|
|
|
* visitors are constructed via the lint_*() functions below. There are also
|
|
|
|
* some lint checks which operate directly on ast nodes (such as @ast::item),
|
|
|
|
* and those are organized as check_item_*(). Each visitor added to the lint
|
|
|
|
* context is modified to stop once it reaches a node which could alter the lint
|
|
|
|
* levels. This means that everything is looked at once and only once by every
|
|
|
|
* lint pass.
|
|
|
|
*
|
|
|
|
* With this all in place, to add a new lint warning, all you need to do is to
|
|
|
|
* either invoke `add_lint` on the session at the appropriate time, or write a
|
|
|
|
* lint pass in this module which is just an ast visitor. The context used when
|
|
|
|
* traversing the ast has a `span_lint` method which only needs the span of the
|
|
|
|
* item that's being warned about.
|
2012-07-04 16:53:12 -05:00
|
|
|
*/
|
2012-04-12 19:30:52 -05:00
|
|
|
|
2013-03-20 10:40:02 -05:00
|
|
|
#[deriving(Eq)]
|
2013-01-30 15:44:24 -06:00
|
|
|
pub enum lint {
|
2012-01-19 19:56:05 -06:00
|
|
|
ctypes,
|
2012-04-12 19:30:52 -05:00
|
|
|
unused_imports,
|
2012-04-26 15:47:13 -05:00
|
|
|
while_true,
|
|
|
|
path_statement,
|
2012-07-14 15:55:41 -05:00
|
|
|
implicit_copies,
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
unrecognized_lint,
|
2012-05-29 18:22:22 -05:00
|
|
|
non_implicitly_copyable_typarams,
|
2012-08-07 09:14:44 -05:00
|
|
|
deprecated_pattern,
|
2012-08-24 13:04:07 -05:00
|
|
|
non_camel_case_types,
|
2012-10-24 11:21:57 -05:00
|
|
|
type_limits,
|
2012-12-14 21:07:20 -06:00
|
|
|
default_methods,
|
2013-04-09 00:31:10 -05:00
|
|
|
unused_unsafe,
|
2012-08-24 13:04:07 -05:00
|
|
|
|
2012-08-28 20:25:41 -05:00
|
|
|
managed_heap_memory,
|
|
|
|
owned_heap_memory,
|
|
|
|
heap_memory,
|
|
|
|
|
2013-04-09 12:16:27 -05:00
|
|
|
unused_variable,
|
|
|
|
dead_assignment,
|
2013-04-12 00:09:54 -05:00
|
|
|
unused_mut,
|
2013-05-18 02:07:28 -05:00
|
|
|
unnecessary_allocation,
|
2012-01-19 02:50:51 -06:00
|
|
|
}
|
|
|
|
|
2013-03-14 13:22:51 -05:00
|
|
|
pub fn level_to_str(lv: level) -> &'static str {
|
2012-08-06 14:34:08 -05:00
|
|
|
match lv {
|
2013-01-05 21:33:37 -06:00
|
|
|
allow => "allow",
|
|
|
|
warn => "warn",
|
|
|
|
deny => "deny",
|
|
|
|
forbid => "forbid"
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-20 10:40:02 -05:00
|
|
|
#[deriving(Eq)]
|
2013-01-30 15:44:24 -06:00
|
|
|
pub enum level {
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
allow, warn, deny, forbid
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
|
|
|
|
2013-02-19 01:40:42 -06:00
|
|
|
struct LintSpec {
|
|
|
|
lint: lint,
|
2013-03-14 13:22:51 -05:00
|
|
|
desc: &'static str,
|
2013-02-19 01:40:42 -06:00
|
|
|
default: level
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
2012-08-27 18:26:35 -05:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
pub type LintDict = HashMap<~str, LintSpec>;
|
|
|
|
|
|
|
|
enum AttributedNode<'self> {
|
|
|
|
Item(@ast::item),
|
|
|
|
Method(&'self ast::method),
|
|
|
|
Crate(@ast::crate),
|
|
|
|
}
|
2012-04-12 19:30:52 -05:00
|
|
|
|
2013-05-09 12:22:26 -05:00
|
|
|
#[deriving(Eq)]
|
|
|
|
enum LintSource {
|
|
|
|
Node(span),
|
|
|
|
Default,
|
|
|
|
CommandLine
|
|
|
|
}
|
|
|
|
|
2013-05-07 02:28:58 -05:00
|
|
|
static lint_table: &'static [(&'static str, LintSpec)] = &[
|
|
|
|
("ctypes",
|
|
|
|
LintSpec {
|
|
|
|
lint: ctypes,
|
|
|
|
desc: "proper use of core::libc types in foreign modules",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("unused_imports",
|
|
|
|
LintSpec {
|
|
|
|
lint: unused_imports,
|
|
|
|
desc: "imports that are never used",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("while_true",
|
|
|
|
LintSpec {
|
|
|
|
lint: while_true,
|
|
|
|
desc: "suggest using loop { } instead of while(true) { }",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("path_statement",
|
|
|
|
LintSpec {
|
|
|
|
lint: path_statement,
|
|
|
|
desc: "path statements with no effect",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("unrecognized_lint",
|
|
|
|
LintSpec {
|
|
|
|
lint: unrecognized_lint,
|
|
|
|
desc: "unrecognized lint attribute",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("non_implicitly_copyable_typarams",
|
|
|
|
LintSpec {
|
|
|
|
lint: non_implicitly_copyable_typarams,
|
|
|
|
desc: "passing non implicitly copyable types as copy type params",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("implicit_copies",
|
|
|
|
LintSpec {
|
|
|
|
lint: implicit_copies,
|
|
|
|
desc: "implicit copies of non implicitly copyable data",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("deprecated_pattern",
|
|
|
|
LintSpec {
|
|
|
|
lint: deprecated_pattern,
|
|
|
|
desc: "warn about deprecated uses of pattern bindings",
|
|
|
|
default: allow
|
|
|
|
}),
|
|
|
|
|
|
|
|
("non_camel_case_types",
|
|
|
|
LintSpec {
|
|
|
|
lint: non_camel_case_types,
|
|
|
|
desc: "types, variants and traits should have camel case names",
|
|
|
|
default: allow
|
|
|
|
}),
|
|
|
|
|
|
|
|
("managed_heap_memory",
|
|
|
|
LintSpec {
|
|
|
|
lint: managed_heap_memory,
|
|
|
|
desc: "use of managed (@ type) heap memory",
|
|
|
|
default: allow
|
|
|
|
}),
|
|
|
|
|
|
|
|
("owned_heap_memory",
|
|
|
|
LintSpec {
|
|
|
|
lint: owned_heap_memory,
|
|
|
|
desc: "use of owned (~ type) heap memory",
|
|
|
|
default: allow
|
|
|
|
}),
|
|
|
|
|
|
|
|
("heap_memory",
|
|
|
|
LintSpec {
|
|
|
|
lint: heap_memory,
|
|
|
|
desc: "use of any (~ type or @ type) heap memory",
|
|
|
|
default: allow
|
|
|
|
}),
|
|
|
|
|
|
|
|
("type_limits",
|
|
|
|
LintSpec {
|
|
|
|
lint: type_limits,
|
|
|
|
desc: "comparisons made useless by limits of the types involved",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("default_methods",
|
|
|
|
LintSpec {
|
|
|
|
lint: default_methods,
|
|
|
|
desc: "allow default methods",
|
|
|
|
default: deny
|
|
|
|
}),
|
|
|
|
|
|
|
|
("unused_unsafe",
|
|
|
|
LintSpec {
|
|
|
|
lint: unused_unsafe,
|
|
|
|
desc: "unnecessary use of an `unsafe` block",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("unused_variable",
|
|
|
|
LintSpec {
|
|
|
|
lint: unused_variable,
|
|
|
|
desc: "detect variables which are not used in any way",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("dead_assignment",
|
|
|
|
LintSpec {
|
|
|
|
lint: dead_assignment,
|
|
|
|
desc: "detect assignments that will never be read",
|
|
|
|
default: warn
|
|
|
|
}),
|
|
|
|
|
|
|
|
("unused_mut",
|
|
|
|
LintSpec {
|
|
|
|
lint: unused_mut,
|
|
|
|
desc: "detect mut variables which don't need to be mutable",
|
|
|
|
default: warn
|
|
|
|
}),
|
2013-05-18 02:07:28 -05:00
|
|
|
|
|
|
|
("unnecessary_allocation",
|
|
|
|
LintSpec {
|
|
|
|
lint: unnecessary_allocation,
|
|
|
|
desc: "detects unnecessary allocations that can be eliminated",
|
|
|
|
default: warn
|
|
|
|
}),
|
2013-05-07 02:28:58 -05:00
|
|
|
];
|
|
|
|
|
2012-04-19 20:04:41 -05:00
|
|
|
/*
|
|
|
|
Pass names should not contain a '-', as the compiler normalizes
|
|
|
|
'-' to '_' in command-line flags
|
|
|
|
*/
|
2013-02-19 01:40:42 -06:00
|
|
|
pub fn get_lint_dict() -> LintDict {
|
2013-04-03 08:28:36 -05:00
|
|
|
let mut map = HashMap::new();
|
2013-05-07 20:42:47 -05:00
|
|
|
for lint_table.each|&(k, v)| {
|
2013-05-07 02:28:58 -05:00
|
|
|
map.insert(k.to_str(), v);
|
2013-03-22 21:26:41 -05:00
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
return map;
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
|
|
|
|
2013-02-19 01:40:42 -06:00
|
|
|
struct Context {
|
2013-04-30 00:15:17 -05:00
|
|
|
// All known lint modes (string versions)
|
|
|
|
dict: @LintDict,
|
|
|
|
// Current levels of each lint warning
|
2013-05-09 12:22:26 -05:00
|
|
|
curr: SmallIntMap<(level, LintSource)>,
|
2013-04-30 00:15:17 -05:00
|
|
|
// context we're checking in (used to access fields like sess)
|
|
|
|
tcx: ty::ctxt,
|
|
|
|
// When recursing into an attributed node of the ast which modifies lint
|
|
|
|
// levels, this stack keeps track of the previous lint levels of whatever
|
|
|
|
// was modified.
|
2013-05-09 12:22:26 -05:00
|
|
|
lint_stack: ~[(lint, level, LintSource)],
|
2013-05-07 01:07:00 -05:00
|
|
|
// Each of these visitors represents a lint pass. A number of the lint
|
|
|
|
// attributes are registered by adding a visitor to iterate over the ast.
|
|
|
|
// Others operate directly on @ast::item structures (or similar). Finally,
|
|
|
|
// others still are added to the Session object via `add_lint`, and these
|
|
|
|
// are all passed with the lint_session visitor.
|
|
|
|
visitors: ~[visit::vt<()>],
|
2012-07-11 17:00:40 -05:00
|
|
|
}
|
2012-01-21 11:20:22 -06:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
impl Context {
|
2013-02-19 01:40:42 -06:00
|
|
|
fn get_level(&self, lint: lint) -> level {
|
2013-04-30 00:15:17 -05:00
|
|
|
match self.curr.find(&(lint as uint)) {
|
2013-05-09 12:22:26 -05:00
|
|
|
Some(&(lvl, _)) => lvl,
|
2013-04-30 00:15:17 -05:00
|
|
|
None => allow
|
|
|
|
}
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
|
|
|
|
2013-05-09 12:22:26 -05:00
|
|
|
fn get_source(&self, lint: lint) -> LintSource {
|
|
|
|
match self.curr.find(&(lint as uint)) {
|
|
|
|
Some(&(_, src)) => src,
|
|
|
|
None => Default
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn set_level(&mut self, lint: lint, level: level, src: LintSource) {
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
if level == allow {
|
2013-02-22 23:37:37 -06:00
|
|
|
self.curr.remove(&(lint as uint));
|
2012-04-12 19:30:52 -05:00
|
|
|
} else {
|
2013-05-09 12:22:26 -05:00
|
|
|
self.curr.insert(lint as uint, (level, src));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn lint_to_str(&self, lint: lint) -> ~str {
|
|
|
|
for self.dict.each |k, v| {
|
|
|
|
if v.lint == lint {
|
|
|
|
return copy *k;
|
|
|
|
}
|
2012-04-12 19:30:52 -05:00
|
|
|
}
|
2013-05-09 12:22:26 -05:00
|
|
|
fail!("unregistered lint %?", lint);
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn span_lint(&self, lint: lint, span: span, msg: &str) {
|
2013-05-09 12:22:26 -05:00
|
|
|
let (level, src) = match self.curr.find(&(lint as uint)) {
|
|
|
|
Some(&pair) => pair,
|
|
|
|
None => { return; }
|
|
|
|
};
|
|
|
|
if level == allow { return; }
|
|
|
|
|
|
|
|
let mut note = None;
|
|
|
|
let msg = match src {
|
|
|
|
Default | CommandLine => {
|
|
|
|
fmt!("%s [-%c %s%s]", msg, match level {
|
|
|
|
warn => 'W', deny => 'D', forbid => 'F',
|
|
|
|
allow => fail!()
|
|
|
|
}, str::replace(self.lint_to_str(lint), "_", "-"),
|
|
|
|
if src == Default { " (default)" } else { "" })
|
|
|
|
},
|
|
|
|
Node(src) => {
|
|
|
|
note = Some(src);
|
|
|
|
msg.to_str()
|
|
|
|
}
|
|
|
|
};
|
|
|
|
match level {
|
|
|
|
warn => { self.tcx.sess.span_warn(span, msg); }
|
|
|
|
deny | forbid => { self.tcx.sess.span_err(span, msg); }
|
|
|
|
allow => fail!(),
|
|
|
|
}
|
|
|
|
|
|
|
|
for note.each |&span| {
|
|
|
|
self.tcx.sess.span_note(span, "lint level defined here");
|
|
|
|
}
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
|
|
|
|
2012-07-04 16:53:12 -05:00
|
|
|
/**
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
* Merge the lints specified by any lint attributes into the
|
2012-07-04 16:53:12 -05:00
|
|
|
* current lint context, call the provided function, then reset the
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
* lints in effect to their previous state.
|
2012-07-04 16:53:12 -05:00
|
|
|
*/
|
2013-04-30 00:15:17 -05:00
|
|
|
fn with_lint_attrs(@mut self, attrs: &[ast::attribute], f: &fn()) {
|
|
|
|
// Parse all of the lint attributes, and then add them all to the
|
|
|
|
// current dictionary of lint information. Along the way, keep a history
|
|
|
|
// of what we changed so we can roll everything back after invoking the
|
|
|
|
// specified closure
|
|
|
|
let mut pushed = 0u;
|
2013-05-07 01:07:00 -05:00
|
|
|
for each_lint(self.tcx.sess, attrs) |meta, level, lintname| {
|
2013-04-30 00:15:17 -05:00
|
|
|
let lint = match self.dict.find(lintname) {
|
2012-08-20 14:23:37 -05:00
|
|
|
None => {
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
self.span_lint(
|
2013-04-30 00:15:17 -05:00
|
|
|
unrecognized_lint,
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
meta.span,
|
2012-08-22 19:24:52 -05:00
|
|
|
fmt!("unknown `%s` attribute: `%s`",
|
2013-02-14 09:34:21 -06:00
|
|
|
level_to_str(level), *lintname));
|
2013-04-30 00:15:17 -05:00
|
|
|
loop
|
2012-04-12 19:30:52 -05:00
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
Some(lint) => { lint.lint }
|
|
|
|
};
|
Nomenclature fixes in the lint checker. Fewer double-negatives.
New style is allow(foo), warn(foo), deny(foo) and forbid(foo),
mirrored by -A foo, -W foo, -D foo and -F foo on command line.
These replace -W no-foo, -W foo, -W err-foo, respectively.
Forbid is new, and means "deny, and you can't override it".
2012-07-26 19:08:21 -05:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
let now = self.get_level(lint);
|
|
|
|
if now == forbid && level != forbid {
|
|
|
|
self.tcx.sess.span_err(meta.span,
|
|
|
|
fmt!("%s(%s) overruled by outer forbid(%s)",
|
|
|
|
level_to_str(level),
|
|
|
|
*lintname, *lintname));
|
2013-05-07 01:07:00 -05:00
|
|
|
loop;
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|
2012-04-12 19:30:52 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
if now != level {
|
2013-05-09 12:22:26 -05:00
|
|
|
let src = self.get_source(lint);
|
|
|
|
self.lint_stack.push((lint, now, src));
|
2013-05-07 01:07:00 -05:00
|
|
|
pushed += 1;
|
2013-05-09 12:22:26 -05:00
|
|
|
self.set_level(lint, level, Node(meta.span));
|
2013-05-07 01:07:00 -05:00
|
|
|
}
|
2012-05-31 21:07:00 -05:00
|
|
|
}
|
2012-01-21 11:20:22 -06:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
f();
|
2012-06-04 18:07:54 -05:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
// rollback
|
|
|
|
for pushed.times {
|
2013-05-09 12:22:26 -05:00
|
|
|
let (lint, lvl, src) = self.lint_stack.pop();
|
|
|
|
self.set_level(lint, lvl, src);
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
2012-06-04 18:07:54 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn add_lint(&mut self, v: visit::vt<()>) {
|
|
|
|
self.visitors.push(item_stopping_visitor(v));
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn process(&self, n: AttributedNode) {
|
2013-04-30 00:15:17 -05:00
|
|
|
match n {
|
2013-05-07 01:07:00 -05:00
|
|
|
Item(it) => {
|
|
|
|
for self.visitors.each |v| {
|
|
|
|
visit::visit_item(it, (), *v);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Crate(c) => {
|
|
|
|
for self.visitors.each |v| {
|
|
|
|
visit::visit_crate(c, (), *v);
|
|
|
|
}
|
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
// Can't use visit::visit_method_helper because the
|
|
|
|
// item_stopping_visitor has overridden visit_fn(&fk_method(... ))
|
|
|
|
// to be a no-op, so manually invoke visit_fn.
|
2013-05-07 01:07:00 -05:00
|
|
|
Method(m) => {
|
|
|
|
let fk = visit::fk_method(copy m.ident, &m.generics, m);
|
|
|
|
for self.visitors.each |v| {
|
|
|
|
visit::visit_fn(&fk, &m.decl, &m.body, m.span, m.id,
|
|
|
|
(), *v);
|
|
|
|
}
|
|
|
|
}
|
2012-06-04 18:07:54 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
pub fn each_lint(sess: session::Session,
|
|
|
|
attrs: &[ast::attribute],
|
|
|
|
f: &fn(@ast::meta_item, level, &~str) -> bool) -> bool
|
|
|
|
{
|
|
|
|
for [allow, warn, deny, forbid].each |&level| {
|
|
|
|
let level_name = level_to_str(level);
|
|
|
|
let attrs = attr::find_attrs_by_name(attrs, level_name);
|
|
|
|
for attrs.each |attr| {
|
|
|
|
let meta = attr.node.value;
|
|
|
|
let metas = match meta.node {
|
|
|
|
ast::meta_list(_, ref metas) => metas,
|
|
|
|
_ => {
|
|
|
|
sess.span_err(meta.span, ~"malformed lint attribute");
|
|
|
|
loop;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
for metas.each |meta| {
|
|
|
|
match meta.node {
|
|
|
|
ast::meta_word(lintname) => {
|
|
|
|
if !f(*meta, level, lintname) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => {
|
2013-04-30 00:15:17 -05:00
|
|
|
sess.span_err(meta.span, ~"malformed lint attribute");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
return true;
|
2012-06-04 18:07:54 -05:00
|
|
|
}
|
|
|
|
|
2012-05-31 20:24:00 -05:00
|
|
|
// Take a visitor, and modify it so that it will not proceed past subitems.
|
|
|
|
// This is used to make the simple visitors used for the lint passes
|
|
|
|
// not traverse into subitems, since that is handled by the outer
|
|
|
|
// lint visitor.
|
2013-04-30 00:15:17 -05:00
|
|
|
fn item_stopping_visitor<E: Copy>(v: visit::vt<E>) -> visit::vt<E> {
|
|
|
|
visit::mk_vt(@visit::Visitor {
|
|
|
|
visit_item: |_i, _e, _v| { },
|
|
|
|
visit_fn: |fk, fd, b, s, id, e, v| {
|
|
|
|
match *fk {
|
|
|
|
visit::fk_method(*) => {}
|
|
|
|
_ => visit::visit_fn(fk, fd, b, s, id, e, v)
|
|
|
|
}
|
|
|
|
},
|
|
|
|
.. **(ty_stopping_visitor(v))})
|
2013-03-05 19:43:37 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
fn ty_stopping_visitor<E>(v: visit::vt<E>) -> visit::vt<E> {
|
|
|
|
visit::mk_vt(@visit::Visitor {visit_ty: |_t, _e, _v| { },.. **v})
|
2012-05-31 20:24:00 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_while_true(cx: @mut Context) -> visit::vt<()> {
|
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_expr: |e: @ast::expr| {
|
|
|
|
match e.node {
|
|
|
|
ast::expr_while(cond, _) => {
|
|
|
|
match cond.node {
|
|
|
|
ast::expr_lit(@codemap::spanned {
|
|
|
|
node: ast::lit_bool(true), _}) =>
|
|
|
|
{
|
|
|
|
cx.span_lint(while_true, e.span,
|
|
|
|
"denote infinite loops with \
|
|
|
|
loop { ... }");
|
2013-01-08 16:00:45 -06:00
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
_ => ()
|
2012-04-19 20:04:41 -05:00
|
|
|
}
|
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
},
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2012-10-24 10:20:54 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_type_limits(cx: @mut Context) -> visit::vt<()> {
|
2013-03-22 13:09:13 -05:00
|
|
|
fn is_valid<T:cmp::Ord>(binop: ast::binop, v: T,
|
2012-10-24 11:21:57 -05:00
|
|
|
min: T, max: T) -> bool {
|
|
|
|
match binop {
|
|
|
|
ast::lt => v <= max,
|
|
|
|
ast::le => v < max,
|
|
|
|
ast::gt => v >= min,
|
|
|
|
ast::ge => v > min,
|
|
|
|
ast::eq | ast::ne => v >= min && v <= max,
|
2013-02-11 21:26:38 -06:00
|
|
|
_ => fail!()
|
2012-10-24 11:21:57 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-22 13:09:13 -05:00
|
|
|
fn rev_binop(binop: ast::binop) -> ast::binop {
|
2012-10-24 11:21:57 -05:00
|
|
|
match binop {
|
|
|
|
ast::lt => ast::gt,
|
|
|
|
ast::le => ast::ge,
|
|
|
|
ast::gt => ast::lt,
|
|
|
|
ast::ge => ast::le,
|
|
|
|
_ => binop
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-17 10:47:51 -05:00
|
|
|
// for int & uint, be conservative with the warnings, so that the
|
|
|
|
// warnings are consistent between 32- and 64-bit platforms
|
2013-03-22 13:09:13 -05:00
|
|
|
fn int_ty_range(int_ty: ast::int_ty) -> (i64, i64) {
|
2012-10-24 11:21:57 -05:00
|
|
|
match int_ty {
|
2013-05-17 10:47:51 -05:00
|
|
|
ast::ty_i => (i64::min_value, i64::max_value),
|
2012-10-24 11:21:57 -05:00
|
|
|
ast::ty_char => (u32::min_value as i64, u32::max_value as i64),
|
|
|
|
ast::ty_i8 => (i8::min_value as i64, i8::max_value as i64),
|
|
|
|
ast::ty_i16 => (i16::min_value as i64, i16::max_value as i64),
|
|
|
|
ast::ty_i32 => (i32::min_value as i64, i32::max_value as i64),
|
|
|
|
ast::ty_i64 => (i64::min_value, i64::max_value)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-22 13:09:13 -05:00
|
|
|
fn uint_ty_range(uint_ty: ast::uint_ty) -> (u64, u64) {
|
2012-10-24 11:21:57 -05:00
|
|
|
match uint_ty {
|
2013-05-17 10:47:51 -05:00
|
|
|
ast::ty_u => (u64::min_value, u64::max_value),
|
2012-10-24 11:21:57 -05:00
|
|
|
ast::ty_u8 => (u8::min_value as u64, u8::max_value as u64),
|
|
|
|
ast::ty_u16 => (u16::min_value as u64, u16::max_value as u64),
|
|
|
|
ast::ty_u32 => (u32::min_value as u64, u32::max_value as u64),
|
|
|
|
ast::ty_u64 => (u64::min_value, u64::max_value)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn check_limits(cx: @mut Context, binop: ast::binop, l: &ast::expr,
|
2012-10-24 11:21:57 -05:00
|
|
|
r: &ast::expr) -> bool {
|
2013-01-10 12:59:58 -06:00
|
|
|
let (lit, expr, swap) = match (&l.node, &r.node) {
|
|
|
|
(&ast::expr_lit(_), _) => (l, r, true),
|
|
|
|
(_, &ast::expr_lit(_)) => (r, l, false),
|
2012-10-24 11:21:57 -05:00
|
|
|
_ => return true
|
|
|
|
};
|
|
|
|
// Normalize the binop so that the literal is always on the RHS in
|
|
|
|
// the comparison
|
2013-04-30 00:15:17 -05:00
|
|
|
let norm_binop = if swap {
|
2012-10-24 11:21:57 -05:00
|
|
|
rev_binop(binop)
|
|
|
|
} else {
|
|
|
|
binop
|
|
|
|
};
|
2013-04-30 00:15:17 -05:00
|
|
|
match ty::get(ty::expr_ty(cx.tcx, @/*bad*/copy *expr)).sty {
|
2012-10-24 11:21:57 -05:00
|
|
|
ty::ty_int(int_ty) => {
|
|
|
|
let (min, max) = int_ty_range(int_ty);
|
|
|
|
let lit_val: i64 = match lit.node {
|
|
|
|
ast::expr_lit(@li) => match li.node {
|
|
|
|
ast::lit_int(v, _) => v,
|
|
|
|
ast::lit_uint(v, _) => v as i64,
|
|
|
|
ast::lit_int_unsuffixed(v) => v,
|
|
|
|
_ => return true
|
|
|
|
},
|
2013-02-11 21:26:38 -06:00
|
|
|
_ => fail!()
|
2012-10-24 11:21:57 -05:00
|
|
|
};
|
|
|
|
is_valid(norm_binop, lit_val, min, max)
|
|
|
|
}
|
|
|
|
ty::ty_uint(uint_ty) => {
|
|
|
|
let (min, max): (u64, u64) = uint_ty_range(uint_ty);
|
|
|
|
let lit_val: u64 = match lit.node {
|
|
|
|
ast::expr_lit(@li) => match li.node {
|
|
|
|
ast::lit_int(v, _) => v as u64,
|
|
|
|
ast::lit_uint(v, _) => v,
|
|
|
|
ast::lit_int_unsuffixed(v) => v as u64,
|
|
|
|
_ => return true
|
|
|
|
},
|
2013-02-11 21:26:38 -06:00
|
|
|
_ => fail!()
|
2012-10-24 11:21:57 -05:00
|
|
|
};
|
|
|
|
is_valid(norm_binop, lit_val, min, max)
|
|
|
|
}
|
|
|
|
_ => true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-22 13:09:13 -05:00
|
|
|
fn is_comparison(binop: ast::binop) -> bool {
|
2012-10-24 11:21:57 -05:00
|
|
|
match binop {
|
|
|
|
ast::eq | ast::lt | ast::le |
|
|
|
|
ast::ne | ast::ge | ast::gt => true,
|
|
|
|
_ => false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-01-08 08:21:19 -06:00
|
|
|
let visit_expr: @fn(@ast::expr) = |e| {
|
|
|
|
match e.node {
|
|
|
|
ast::expr_binary(ref binop, @ref l, @ref r) => {
|
|
|
|
if is_comparison(*binop)
|
|
|
|
&& !check_limits(cx, *binop, l, r) {
|
2013-04-30 00:15:17 -05:00
|
|
|
cx.span_lint(type_limits, e.span,
|
|
|
|
"comparison is useless due to type limits");
|
2012-10-24 11:21:57 -05:00
|
|
|
}
|
|
|
|
}
|
2013-01-08 08:21:19 -06:00
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_expr: visit_expr,
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2012-04-19 20:04:41 -05:00
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn check_item_default_methods(cx: @mut Context, item: @ast::item) {
|
2013-03-20 00:17:42 -05:00
|
|
|
match item.node {
|
|
|
|
ast::item_trait(_, _, ref methods) => {
|
2012-12-14 21:07:20 -06:00
|
|
|
for methods.each |method| {
|
|
|
|
match *method {
|
|
|
|
ast::required(*) => {}
|
|
|
|
ast::provided(*) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
cx.span_lint(default_methods, item.span,
|
|
|
|
"default methods are experimental");
|
2012-12-14 21:07:20 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn check_item_ctypes(cx: @mut Context, it: @ast::item) {
|
|
|
|
|
|
|
|
fn check_foreign_fn(cx: @mut Context, decl: &ast::fn_decl) {
|
2012-06-30 18:19:07 -05:00
|
|
|
let tys = vec::map(decl.inputs, |a| a.ty );
|
2012-09-18 23:41:13 -05:00
|
|
|
for vec::each(vec::append_one(tys, decl.output)) |ty| {
|
2012-08-06 14:34:08 -05:00
|
|
|
match ty.node {
|
2012-08-03 21:59:04 -05:00
|
|
|
ast::ty_path(_, id) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
match cx.tcx.def_map.get_copy(&id) {
|
2012-08-03 21:59:04 -05:00
|
|
|
ast::def_prim_ty(ast::ty_int(ast::ty_i)) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
cx.span_lint(ctypes, ty.span,
|
2013-04-30 11:47:52 -05:00
|
|
|
"found rust type `int` in foreign module, while \
|
2012-03-12 22:04:27 -05:00
|
|
|
libc::c_int or libc::c_long should be used");
|
2012-02-06 08:29:56 -06:00
|
|
|
}
|
2012-08-03 21:59:04 -05:00
|
|
|
ast::def_prim_ty(ast::ty_uint(ast::ty_u)) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
cx.span_lint(ctypes, ty.span,
|
2013-04-30 11:47:52 -05:00
|
|
|
"found rust type `uint` in foreign module, while \
|
2012-03-12 22:04:27 -05:00
|
|
|
libc::c_uint or libc::c_ulong should be used");
|
2012-02-06 08:29:56 -06:00
|
|
|
}
|
2012-08-03 21:59:04 -05:00
|
|
|
_ => ()
|
2012-02-06 08:29:56 -06:00
|
|
|
}
|
2012-01-19 02:50:51 -06:00
|
|
|
}
|
2012-08-03 21:59:04 -05:00
|
|
|
_ => ()
|
2012-01-19 02:50:51 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-06 14:34:08 -05:00
|
|
|
match it.node {
|
2013-03-13 21:25:28 -05:00
|
|
|
ast::item_foreign_mod(ref nmod) if !nmod.abis.is_intrinsic() => {
|
2012-06-30 18:19:07 -05:00
|
|
|
for nmod.items.each |ni| {
|
2013-03-08 19:44:37 -06:00
|
|
|
match ni.node {
|
2013-02-18 00:20:36 -06:00
|
|
|
ast::foreign_item_fn(ref decl, _, _) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
check_foreign_fn(cx, decl);
|
2012-04-12 19:30:52 -05:00
|
|
|
}
|
2013-01-24 20:49:51 -06:00
|
|
|
// FIXME #4622: Not implemented.
|
|
|
|
ast::foreign_item_const(*) => {}
|
2012-01-19 02:50:51 -06:00
|
|
|
}
|
|
|
|
}
|
2012-04-12 19:30:52 -05:00
|
|
|
}
|
2012-08-03 21:59:04 -05:00
|
|
|
_ => {/* nothing to do */ }
|
2012-01-19 02:50:51 -06:00
|
|
|
}
|
|
|
|
}
|
2012-01-21 11:20:22 -06:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn check_type_for_lint(cx: @mut Context, lint: lint, span: span, ty: ty::t) {
|
|
|
|
if cx.get_level(lint) == allow { return }
|
2012-08-28 20:25:41 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
let mut n_box = 0;
|
|
|
|
let mut n_uniq = 0;
|
|
|
|
ty::fold_ty(cx.tcx, ty, |t| {
|
|
|
|
match ty::get(t).sty {
|
|
|
|
ty::ty_box(_) => n_box += 1,
|
|
|
|
ty::ty_uniq(_) => n_uniq += 1,
|
|
|
|
_ => ()
|
|
|
|
};
|
|
|
|
t
|
|
|
|
});
|
2013-04-30 00:15:17 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
if n_uniq > 0 && lint != managed_heap_memory {
|
|
|
|
let s = ty_to_str(cx.tcx, ty);
|
|
|
|
let m = ~"type uses owned (~ type) pointers: " + s;
|
|
|
|
cx.span_lint(lint, span, m);
|
|
|
|
}
|
2012-08-28 20:25:41 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
if n_box > 0 && lint != owned_heap_memory {
|
|
|
|
let s = ty_to_str(cx.tcx, ty);
|
|
|
|
let m = ~"type uses managed (@ type) pointers: " + s;
|
|
|
|
cx.span_lint(lint, span, m);
|
2012-08-28 20:25:41 -05:00
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
}
|
2012-08-28 20:25:41 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn check_type(cx: @mut Context, span: span, ty: ty::t) {
|
|
|
|
for [managed_heap_memory, owned_heap_memory, heap_memory].each |lint| {
|
|
|
|
check_type_for_lint(cx, *lint, span, ty);
|
2012-08-28 20:25:41 -05:00
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
}
|
2012-08-28 20:25:41 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn check_item_heap(cx: @mut Context, it: @ast::item) {
|
|
|
|
match it.node {
|
|
|
|
ast::item_fn(*) |
|
|
|
|
ast::item_ty(*) |
|
|
|
|
ast::item_enum(*) |
|
|
|
|
ast::item_struct(*) => check_type(cx, it.span,
|
|
|
|
ty::node_id_to_type(cx.tcx,
|
|
|
|
it.id)),
|
|
|
|
_ => ()
|
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
// If it's a struct, we also have to check the fields' types
|
|
|
|
match it.node {
|
|
|
|
ast::item_struct(struct_def, _) => {
|
|
|
|
for struct_def.fields.each |struct_field| {
|
|
|
|
check_type(cx, struct_field.span,
|
|
|
|
ty::node_id_to_type(cx.tcx,
|
|
|
|
struct_field.node.id));
|
2013-01-28 20:34:32 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => ()
|
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
}
|
2013-01-28 20:34:32 -06:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_heap(cx: @mut Context) -> visit::vt<()> {
|
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_expr: |e| {
|
|
|
|
let ty = ty::expr_ty(cx.tcx, e);
|
|
|
|
check_type(cx, e.span, ty);
|
|
|
|
},
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2012-08-28 20:25:41 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_path_statement(cx: @mut Context) -> visit::vt<()> {
|
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_stmt: |s| {
|
|
|
|
match s.node {
|
|
|
|
ast::stmt_semi(
|
|
|
|
@ast::expr { node: ast::expr_path(_), _ },
|
|
|
|
_
|
|
|
|
) => {
|
|
|
|
cx.span_lint(path_statement, s.span,
|
|
|
|
"path statement with no effect");
|
2013-01-08 16:00:45 -06:00
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
},
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2012-04-26 15:47:13 -05:00
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn check_item_non_camel_case_types(cx: @mut Context, it: @ast::item) {
|
2012-07-18 18:18:02 -05:00
|
|
|
fn is_camel_case(cx: ty::ctxt, ident: ast::ident) -> bool {
|
|
|
|
let ident = cx.sess.str_of(ident);
|
2013-03-28 20:39:09 -05:00
|
|
|
assert!(!ident.is_empty());
|
2013-02-16 12:35:05 -06:00
|
|
|
let ident = ident_without_trailing_underscores(*ident);
|
2012-08-15 16:54:33 -05:00
|
|
|
let ident = ident_without_leading_underscores(ident);
|
2012-08-08 17:05:49 -05:00
|
|
|
char::is_uppercase(str::char_at(ident, 0)) &&
|
2012-07-31 20:58:03 -05:00
|
|
|
!ident.contains_char('_')
|
|
|
|
}
|
|
|
|
|
2013-03-25 15:21:04 -05:00
|
|
|
fn ident_without_trailing_underscores<'r>(ident: &'r str) -> &'r str {
|
2012-08-15 16:54:33 -05:00
|
|
|
match str::rfind(ident, |c| c != '_') {
|
2013-03-21 06:36:21 -05:00
|
|
|
Some(idx) => str::slice(ident, 0, idx + 1),
|
2013-02-16 12:35:05 -06:00
|
|
|
None => ident, // all underscores
|
2012-08-15 16:54:33 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-25 15:21:04 -05:00
|
|
|
fn ident_without_leading_underscores<'r>(ident: &'r str) -> &'r str {
|
2012-08-15 16:54:33 -05:00
|
|
|
match str::find(ident, |c| c != '_') {
|
2013-03-21 06:36:21 -05:00
|
|
|
Some(idx) => str::slice(ident, idx, ident.len()),
|
2013-02-16 12:35:05 -06:00
|
|
|
None => ident // all underscores
|
2012-08-08 17:05:49 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
fn check_case(cx: @mut Context, ident: ast::ident, span: span) {
|
|
|
|
if !is_camel_case(cx.tcx, ident) {
|
|
|
|
cx.span_lint(non_camel_case_types, span,
|
|
|
|
"type, variant, or trait should have \
|
|
|
|
a camel case identifier");
|
2012-07-31 20:58:03 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-06 14:34:08 -05:00
|
|
|
match it.node {
|
2013-02-16 12:36:09 -06:00
|
|
|
ast::item_ty(*) | ast::item_struct(*) |
|
|
|
|
ast::item_trait(*) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
check_case(cx, it.ident, it.span)
|
2012-07-31 20:58:03 -05:00
|
|
|
}
|
2013-02-16 12:36:09 -06:00
|
|
|
ast::item_enum(ref enum_definition, _) => {
|
2013-04-30 00:15:17 -05:00
|
|
|
check_case(cx, it.ident, it.span);
|
2013-02-16 12:36:09 -06:00
|
|
|
for enum_definition.variants.each |variant| {
|
2013-04-30 00:15:17 -05:00
|
|
|
check_case(cx, variant.node.name, variant.span);
|
2013-02-16 12:36:09 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => ()
|
2012-07-31 20:58:03 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_unused_unsafe(cx: @mut Context) -> visit::vt<()> {
|
2013-04-09 00:31:10 -05:00
|
|
|
let visit_expr: @fn(@ast::expr) = |e| {
|
|
|
|
match e.node {
|
|
|
|
ast::expr_block(ref blk) if blk.node.rules == ast::unsafe_blk => {
|
2013-04-30 00:15:17 -05:00
|
|
|
if !cx.tcx.used_unsafe.contains(&blk.node.id) {
|
|
|
|
cx.span_lint(unused_unsafe, blk.span,
|
|
|
|
"unnecessary `unsafe` block");
|
2013-04-09 00:31:10 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_expr: visit_expr,
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2013-04-09 00:31:10 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_unused_mut(cx: @mut Context) -> visit::vt<()> {
|
2013-04-12 00:09:54 -05:00
|
|
|
let check_pat: @fn(@ast::pat) = |p| {
|
|
|
|
let mut used = false;
|
|
|
|
let mut bindings = 0;
|
2013-04-30 00:15:17 -05:00
|
|
|
do pat_util::pat_bindings(cx.tcx.def_map, p) |_, id, _, _| {
|
|
|
|
used = used || cx.tcx.used_mut_nodes.contains(&id);
|
2013-04-12 00:09:54 -05:00
|
|
|
bindings += 1;
|
|
|
|
}
|
|
|
|
if !used {
|
|
|
|
let msg = if bindings == 1 {
|
2013-04-30 11:47:52 -05:00
|
|
|
"variable does not need to be mutable"
|
2013-04-12 00:09:54 -05:00
|
|
|
} else {
|
2013-04-30 11:47:52 -05:00
|
|
|
"variables do not need to be mutable"
|
2013-04-12 00:09:54 -05:00
|
|
|
};
|
2013-04-30 00:15:17 -05:00
|
|
|
cx.span_lint(unused_mut, p.span, msg);
|
2013-04-12 00:09:54 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
let visit_fn_decl: @fn(&ast::fn_decl) = |fd| {
|
|
|
|
for fd.inputs.each |arg| {
|
|
|
|
if arg.is_mutbl {
|
|
|
|
check_pat(arg.pat);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
2013-04-30 00:15:17 -05:00
|
|
|
visit_local: |l| {
|
|
|
|
if l.node.is_mutbl {
|
|
|
|
check_pat(l.node.pat);
|
|
|
|
}
|
|
|
|
},
|
|
|
|
visit_fn: |_, fd, _, _, _| visit_fn_decl(fd),
|
|
|
|
visit_ty_method: |tm| visit_fn_decl(&tm.decl),
|
|
|
|
visit_struct_method: |sm| visit_fn_decl(&sm.decl),
|
|
|
|
visit_trait_method: |tm| {
|
|
|
|
match *tm {
|
|
|
|
ast::required(ref tm) => visit_fn_decl(&tm.decl),
|
|
|
|
ast::provided(m) => visit_fn_decl(&m.decl),
|
|
|
|
}
|
|
|
|
},
|
|
|
|
.. *visit::default_simple_visitor()
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
fn lint_session(cx: @mut Context) -> visit::vt<()> {
|
|
|
|
ast_util::id_visitor(|id| {
|
2013-04-30 00:15:17 -05:00
|
|
|
match cx.tcx.sess.lints.pop(&id) {
|
|
|
|
None => {},
|
|
|
|
Some(l) => {
|
|
|
|
do vec::consume(l) |_, (lint, span, msg)| {
|
|
|
|
cx.span_lint(lint, span, msg)
|
2013-04-12 00:09:54 -05:00
|
|
|
}
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
})
|
2012-07-25 08:41:56 -05:00
|
|
|
}
|
|
|
|
|
2013-05-18 02:07:28 -05:00
|
|
|
fn lint_unnecessary_allocations(cx: @mut Context) -> visit::vt<()> {
|
|
|
|
// If the expression `e` has an allocated type, but `t` dictates that it's
|
|
|
|
// something like a slice (doesn't need allocation), emit a warning with the
|
|
|
|
// specified span.
|
|
|
|
//
|
|
|
|
// Currently, this only applies to string and vector literals with sigils in
|
|
|
|
// front. Those can have the sigil removed to get a borrowed pointer
|
|
|
|
// automatically.
|
|
|
|
fn check(cx: @mut Context, e: @ast::expr, t: ty::t) {
|
|
|
|
match e.node {
|
|
|
|
ast::expr_vstore(e2, ast::expr_vstore_uniq) |
|
|
|
|
ast::expr_vstore(e2, ast::expr_vstore_box) => {
|
|
|
|
match e2.node {
|
|
|
|
ast::expr_lit(@codemap::spanned{
|
|
|
|
node: ast::lit_str(*), _}) |
|
|
|
|
ast::expr_vec(*) => {}
|
|
|
|
_ => return
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
_ => return
|
|
|
|
}
|
|
|
|
|
|
|
|
match ty::get(t).sty {
|
|
|
|
ty::ty_estr(ty::vstore_slice(*)) |
|
|
|
|
ty::ty_evec(_, ty::vstore_slice(*)) => {
|
|
|
|
cx.span_lint(unnecessary_allocation,
|
|
|
|
e.span, "unnecessary allocation, the sigil can be \
|
|
|
|
removed");
|
|
|
|
}
|
|
|
|
|
|
|
|
_ => ()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
let visit_expr: @fn(@ast::expr) = |e| {
|
|
|
|
match e.node {
|
|
|
|
ast::expr_call(c, ref args, _) => {
|
|
|
|
let t = ty::node_id_to_type(cx.tcx, c.id);
|
|
|
|
let s = ty::ty_fn_sig(t);
|
|
|
|
for vec::each2(*args, s.inputs) |e, t| {
|
|
|
|
check(cx, *e, *t);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ast::expr_method_call(_, _, _, ref args, _) => {
|
|
|
|
let t = ty::node_id_to_type(cx.tcx, e.callee_id);
|
|
|
|
let s = ty::ty_fn_sig(t);
|
|
|
|
for vec::each2(*args, s.inputs) |e, t| {
|
|
|
|
check(cx, *e, *t);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => {}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
visit::mk_simple_visitor(@visit::SimpleVisitor {
|
|
|
|
visit_expr: visit_expr,
|
|
|
|
.. *visit::default_simple_visitor()
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
2013-01-30 15:44:24 -06:00
|
|
|
pub fn check_crate(tcx: ty::ctxt, crate: @ast::crate) {
|
2013-04-30 00:15:17 -05:00
|
|
|
let cx = @mut Context {
|
|
|
|
dict: @get_lint_dict(),
|
|
|
|
curr: SmallIntMap::new(),
|
|
|
|
tcx: tcx,
|
|
|
|
lint_stack: ~[],
|
2013-05-07 01:07:00 -05:00
|
|
|
visitors: ~[],
|
2013-04-30 00:15:17 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
// Install defaults.
|
|
|
|
for cx.dict.each_value |spec| {
|
2013-05-09 12:22:26 -05:00
|
|
|
cx.set_level(spec.lint, spec.default, Default);
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
// Install command-line options, overriding defaults.
|
|
|
|
for tcx.sess.opts.lint_opts.each |&(lint, level)| {
|
2013-05-09 12:22:26 -05:00
|
|
|
cx.set_level(lint, level, CommandLine);
|
2013-04-30 00:15:17 -05:00
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
// Register each of the lint passes with the context
|
|
|
|
cx.add_lint(lint_while_true(cx));
|
|
|
|
cx.add_lint(lint_path_statement(cx));
|
|
|
|
cx.add_lint(lint_heap(cx));
|
|
|
|
cx.add_lint(lint_type_limits(cx));
|
|
|
|
cx.add_lint(lint_unused_unsafe(cx));
|
|
|
|
cx.add_lint(lint_unused_mut(cx));
|
|
|
|
cx.add_lint(lint_session(cx));
|
2013-05-18 02:07:28 -05:00
|
|
|
cx.add_lint(lint_unnecessary_allocations(cx));
|
2013-05-07 01:07:00 -05:00
|
|
|
|
2013-04-30 00:15:17 -05:00
|
|
|
// type inference doesn't like this being declared below, we need to tell it
|
|
|
|
// what the type of this first function is...
|
|
|
|
let visit_item:
|
|
|
|
@fn(@ast::item, @mut Context, visit::vt<@mut Context>) =
|
|
|
|
|it, cx, vt| {
|
|
|
|
do cx.with_lint_attrs(it.attrs) {
|
|
|
|
check_item_ctypes(cx, it);
|
|
|
|
check_item_non_camel_case_types(cx, it);
|
|
|
|
check_item_default_methods(cx, it);
|
|
|
|
check_item_heap(cx, it);
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
cx.process(Item(it));
|
2013-04-30 00:15:17 -05:00
|
|
|
visit::visit_item(it, cx, vt);
|
|
|
|
}
|
|
|
|
};
|
2012-04-12 19:30:52 -05:00
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
// Actually perform the lint checks (iterating the ast)
|
2013-04-30 00:15:17 -05:00
|
|
|
do cx.with_lint_attrs(crate.node.attrs) {
|
2013-05-07 01:07:00 -05:00
|
|
|
cx.process(Crate(crate));
|
2013-04-30 00:15:17 -05:00
|
|
|
|
|
|
|
visit::visit_crate(crate, cx, visit::mk_vt(@visit::Visitor {
|
|
|
|
visit_item: visit_item,
|
|
|
|
visit_fn: |fk, decl, body, span, id, cx, vt| {
|
|
|
|
match *fk {
|
|
|
|
visit::fk_method(_, _, m) => {
|
|
|
|
do cx.with_lint_attrs(m.attrs) {
|
2013-05-07 01:07:00 -05:00
|
|
|
cx.process(Method(m));
|
2013-04-30 00:15:17 -05:00
|
|
|
visit::visit_fn(fk, decl, body, span, id, cx, vt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
_ => {
|
|
|
|
visit::visit_fn(fk, decl, body, span, id, cx, vt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
},
|
|
|
|
.. *visit::default_visitor()
|
|
|
|
}));
|
|
|
|
}
|
|
|
|
|
2013-05-07 01:07:00 -05:00
|
|
|
// If we missed any lints added to the session, then there's a bug somewhere
|
|
|
|
// in the iteration code.
|
2013-04-30 00:15:17 -05:00
|
|
|
for tcx.sess.lints.each |_, v| {
|
|
|
|
for v.each |t| {
|
|
|
|
match *t {
|
|
|
|
(lint, span, ref msg) =>
|
|
|
|
tcx.sess.span_bug(span, fmt!("unprocessed lint %?: %s",
|
|
|
|
lint, *msg))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-05-07 01:07:00 -05:00
|
|
|
|
2012-04-12 19:30:52 -05:00
|
|
|
tcx.sess.abort_if_errors();
|
2012-01-21 11:20:22 -06:00
|
|
|
}
|