Use blint for linting, rather than in-tree tool
(Blint is the in-tree tool factored into its own npm package.)
This commit is contained in:
Marijn Haverbeke
parent
78e06acf0d
commit
643d9c05a3
15
bin/lint
15
bin/lint
|
|
@ -1,16 +1,3 @@
|
|||
#!/usr/bin/env node
|
||||
|
||||
var lint = require("../test/lint/lint"),
|
||||
path = require("path");
|
||||
|
||||
if (process.argv.length > 2) {
|
||||
lint.checkDir(process.argv[2]);
|
||||
} else {
|
||||
process.chdir(path.resolve(__dirname, ".."));
|
||||
lint.checkDir("lib");
|
||||
lint.checkDir("mode");
|
||||
lint.checkDir("addon");
|
||||
lint.checkDir("keymap");
|
||||
}
|
||||
|
||||
process.exit(lint.success() ? 0 : 1);
|
||||
process.exit(require("../test/lint").ok ? 0 : 1);
|
||||
|
|
|
|||
|
|
@ -8,7 +8,8 @@
|
|||
"directories": {"lib": "./lib"},
|
||||
"scripts": {"test": "node ./test/run.js"},
|
||||
"devDependencies": {"node-static": "0.6.0",
|
||||
"phantomjs": "1.9.2-5"},
|
||||
"phantomjs": "1.9.2-5",
|
||||
"blint": "^0.1.0"},
|
||||
"bugs": "http://github.com/codemirror/CodeMirror/issues",
|
||||
"keywords": ["JavaScript", "CodeMirror", "Editor"],
|
||||
"homepage": "http://codemirror.net",
|
||||
|
|
|
|||
|
|
@ -0,0 +1,11 @@
|
|||
var blint = require("blint");
|
||||
|
||||
["mode", "lib", "addon", "keymap"].forEach(function(dir) {
|
||||
blint.checkDir(dir, {
|
||||
browser: true,
|
||||
allowedGlobals: ["CodeMirror", "define", "test", "requirejs"],
|
||||
blob: "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: http:\/\/codemirror.net\/LICENSE\n\n"
|
||||
});
|
||||
});
|
||||
|
||||
module.exports = {ok: blint.success()};
|
||||
1782
test/lint/acorn.js
1782
test/lint/acorn.js
File diff suppressed because it is too large
Load Diff
|
|
@ -1,166 +0,0 @@
|
|||
/*
|
||||
Simple linter, based on the Acorn [1] parser module
|
||||
|
||||
All of the existing linters either cramp my style or have huge
|
||||
dependencies (Closure). So here's a very simple, non-invasive one
|
||||
that only spots
|
||||
|
||||
- missing semicolons and trailing commas
|
||||
- variables or properties that are reserved words
|
||||
- assigning to a variable you didn't declare
|
||||
- access to non-whitelisted globals
|
||||
(use a '// declare global: foo, bar' comment to declare extra
|
||||
globals in a file)
|
||||
|
||||
[1]: https://github.com/marijnh/acorn/
|
||||
*/
|
||||
|
||||
var topAllowedGlobals = Object.create(null);
|
||||
("Error RegExp Number String Array Function Object Math Date undefined " +
|
||||
"parseInt parseFloat Infinity NaN isNaN " +
|
||||
"window document navigator prompt alert confirm console " +
|
||||
"screen FileReader Worker postMessage importScripts " +
|
||||
"setInterval clearInterval setTimeout clearTimeout " +
|
||||
"CodeMirror " +
|
||||
"test exports require module define requirejs")
|
||||
.split(" ").forEach(function(n) { topAllowedGlobals[n] = true; });
|
||||
|
||||
var fs = require("fs"), acorn = require("./acorn.js"), walk = require("./walk.js");
|
||||
|
||||
var scopePasser = walk.make({
|
||||
ScopeBody: function(node, prev, c) { c(node, node.scope); }
|
||||
});
|
||||
|
||||
var cBlob = /^\/\/ CodeMirror, copyright \(c\) by Marijn Haverbeke and others\n\/\/ Distributed under an MIT license: http:\/\/codemirror.net\/LICENSE\n\n/;
|
||||
|
||||
function checkFile(fileName) {
|
||||
var file = fs.readFileSync(fileName, "utf8"), notAllowed;
|
||||
if (notAllowed = file.match(/[\x00-\x08\x0b\x0c\x0e-\x19\uFEFF\t]|[ \t]\n/)) {
|
||||
var msg;
|
||||
if (notAllowed[0] == "\t") msg = "Found tab character";
|
||||
else if (notAllowed[0].indexOf("\n") > -1) msg = "Trailing whitespace";
|
||||
else msg = "Undesirable character " + notAllowed[0].charCodeAt(0);
|
||||
var info = acorn.getLineInfo(file, notAllowed.index);
|
||||
fail(msg + " at line " + info.line + ", column " + info.column, {source: fileName});
|
||||
}
|
||||
|
||||
if (!cBlob.test(file))
|
||||
fail("Missing license blob", {source: fileName});
|
||||
|
||||
var globalsSeen = Object.create(null);
|
||||
|
||||
try {
|
||||
var parsed = acorn.parse(file, {
|
||||
locations: true,
|
||||
ecmaVersion: 3,
|
||||
strictSemicolons: true,
|
||||
allowTrailingCommas: false,
|
||||
forbidReserved: "everywhere",
|
||||
sourceFile: fileName
|
||||
});
|
||||
} catch (e) {
|
||||
fail(e.message, {source: fileName});
|
||||
return;
|
||||
}
|
||||
|
||||
var scopes = [];
|
||||
|
||||
walk.simple(parsed, {
|
||||
ScopeBody: function(node, scope) {
|
||||
node.scope = scope;
|
||||
scopes.push(scope);
|
||||
}
|
||||
}, walk.scopeVisitor, {vars: Object.create(null)});
|
||||
|
||||
var ignoredGlobals = Object.create(null);
|
||||
|
||||
function inScope(name, scope) {
|
||||
for (var cur = scope; cur; cur = cur.prev)
|
||||
if (name in cur.vars) return true;
|
||||
}
|
||||
function checkLHS(node, scope) {
|
||||
if (node.type == "Identifier" && !(node.name in ignoredGlobals) &&
|
||||
!inScope(node.name, scope)) {
|
||||
ignoredGlobals[node.name] = true;
|
||||
fail("Assignment to global variable", node.loc);
|
||||
}
|
||||
}
|
||||
|
||||
walk.simple(parsed, {
|
||||
UpdateExpression: function(node, scope) {checkLHS(node.argument, scope);},
|
||||
AssignmentExpression: function(node, scope) {checkLHS(node.left, scope);},
|
||||
Identifier: function(node, scope) {
|
||||
if (node.name == "arguments") return;
|
||||
// Mark used identifiers
|
||||
for (var cur = scope; cur; cur = cur.prev)
|
||||
if (node.name in cur.vars) {
|
||||
cur.vars[node.name].used = true;
|
||||
return;
|
||||
}
|
||||
globalsSeen[node.name] = node.loc;
|
||||
},
|
||||
FunctionExpression: function(node) {
|
||||
if (node.id) fail("Named function expression", node.loc);
|
||||
},
|
||||
ForStatement: function(node) {
|
||||
checkReusedIndex(node);
|
||||
},
|
||||
MemberExpression: function(node) {
|
||||
if (node.object.type == "Identifier" && node.object.name == "console" && !node.computed)
|
||||
fail("Found console." + node.property.name, node.loc);
|
||||
},
|
||||
DebuggerStatement: function(node) {
|
||||
fail("Found debugger statement", node.loc);
|
||||
}
|
||||
}, scopePasser);
|
||||
|
||||
function checkReusedIndex(node) {
|
||||
if (!node.init || node.init.type != "VariableDeclaration") return;
|
||||
var name = node.init.declarations[0].id.name;
|
||||
walk.recursive(node.body, null, {
|
||||
Function: function() {},
|
||||
VariableDeclaration: function(node, st, c) {
|
||||
for (var i = 0; i < node.declarations.length; i++)
|
||||
if (node.declarations[i].id.name == name)
|
||||
fail("redefined loop variable", node.declarations[i].id.loc);
|
||||
walk.base.VariableDeclaration(node, st, c);
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
var allowedGlobals = Object.create(topAllowedGlobals), m;
|
||||
if (m = file.match(/\/\/ declare global:\s+(.*)/))
|
||||
m[1].split(/,\s*/g).forEach(function(n) { allowedGlobals[n] = true; });
|
||||
for (var glob in globalsSeen)
|
||||
if (!(glob in allowedGlobals))
|
||||
fail("Access to global variable " + glob + ". Add a '// declare global: " + glob +
|
||||
"' comment or add this variable in test/lint/lint.js.", globalsSeen[glob]);
|
||||
|
||||
for (var i = 0; i < scopes.length; ++i) {
|
||||
var scope = scopes[i];
|
||||
for (var name in scope.vars) {
|
||||
var info = scope.vars[name];
|
||||
if (!info.used && info.type != "catch clause" && info.type != "function name" && name.charAt(0) != "_")
|
||||
fail("Unused " + info.type + " " + name, info.node.loc);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
var failed = false;
|
||||
function fail(msg, pos) {
|
||||
if (pos.start) msg += " (" + pos.start.line + ":" + pos.start.column + ")";
|
||||
console.log(pos.source + ": " + msg);
|
||||
failed = true;
|
||||
}
|
||||
|
||||
function checkDir(dir) {
|
||||
fs.readdirSync(dir).forEach(function(file) {
|
||||
var fname = dir + "/" + file;
|
||||
if (/\.js$/.test(file)) checkFile(fname);
|
||||
else if (fs.lstatSync(fname).isDirectory()) checkDir(fname);
|
||||
});
|
||||
}
|
||||
|
||||
exports.checkDir = checkDir;
|
||||
exports.checkFile = checkFile;
|
||||
exports.success = function() { return !failed; };
|
||||
|
|
@ -1,313 +0,0 @@
|
|||
// AST walker module for Mozilla Parser API compatible trees
|
||||
|
||||
(function(mod) {
|
||||
if (typeof exports == "object" && typeof module == "object") return mod(exports); // CommonJS
|
||||
if (typeof define == "function" && define.amd) return define(["exports"], mod); // AMD
|
||||
mod((this.acorn || (this.acorn = {})).walk = {}); // Plain browser env
|
||||
})(function(exports) {
|
||||
"use strict";
|
||||
|
||||
// A simple walk is one where you simply specify callbacks to be
|
||||
// called on specific nodes. The last two arguments are optional. A
|
||||
// simple use would be
|
||||
//
|
||||
// walk.simple(myTree, {
|
||||
// Expression: function(node) { ... }
|
||||
// });
|
||||
//
|
||||
// to do something with all expressions. All Parser API node types
|
||||
// can be used to identify node types, as well as Expression,
|
||||
// Statement, and ScopeBody, which denote categories of nodes.
|
||||
//
|
||||
// The base argument can be used to pass a custom (recursive)
|
||||
// walker, and state can be used to give this walked an initial
|
||||
// state.
|
||||
exports.simple = function(node, visitors, base, state) {
|
||||
if (!base) base = exports.base;
|
||||
function c(node, st, override) {
|
||||
var type = override || node.type, found = visitors[type];
|
||||
base[type](node, st, c);
|
||||
if (found) found(node, st);
|
||||
}
|
||||
c(node, state);
|
||||
};
|
||||
|
||||
// A recursive walk is one where your functions override the default
|
||||
// walkers. They can modify and replace the state parameter that's
|
||||
// threaded through the walk, and can opt how and whether to walk
|
||||
// their child nodes (by calling their third argument on these
|
||||
// nodes).
|
||||
exports.recursive = function(node, state, funcs, base) {
|
||||
var visitor = funcs ? exports.make(funcs, base) : base;
|
||||
function c(node, st, override) {
|
||||
visitor[override || node.type](node, st, c);
|
||||
}
|
||||
c(node, state);
|
||||
};
|
||||
|
||||
function makeTest(test) {
|
||||
if (typeof test == "string")
|
||||
return function(type) { return type == test; };
|
||||
else if (!test)
|
||||
return function() { return true; };
|
||||
else
|
||||
return test;
|
||||
}
|
||||
|
||||
function Found(node, state) { this.node = node; this.state = state; }
|
||||
|
||||
// Find a node with a given start, end, and type (all are optional,
|
||||
// null can be used as wildcard). Returns a {node, state} object, or
|
||||
// undefined when it doesn't find a matching node.
|
||||
exports.findNodeAt = function(node, start, end, test, base, state) {
|
||||
test = makeTest(test);
|
||||
try {
|
||||
if (!base) base = exports.base;
|
||||
var c = function(node, st, override) {
|
||||
var type = override || node.type;
|
||||
if ((start == null || node.start <= start) &&
|
||||
(end == null || node.end >= end))
|
||||
base[type](node, st, c);
|
||||
if (test(type, node) &&
|
||||
(start == null || node.start == start) &&
|
||||
(end == null || node.end == end))
|
||||
throw new Found(node, st);
|
||||
};
|
||||
c(node, state);
|
||||
} catch (e) {
|
||||
if (e instanceof Found) return e;
|
||||
throw e;
|
||||
}
|
||||
};
|
||||
|
||||
// Find the innermost node of a given type that contains the given
|
||||
// position. Interface similar to findNodeAt.
|
||||
exports.findNodeAround = function(node, pos, test, base, state) {
|
||||
test = makeTest(test);
|
||||
try {
|
||||
if (!base) base = exports.base;
|
||||
var c = function(node, st, override) {
|
||||
var type = override || node.type;
|
||||
if (node.start > pos || node.end < pos) return;
|
||||
base[type](node, st, c);
|
||||
if (test(type, node)) throw new Found(node, st);
|
||||
};
|
||||
c(node, state);
|
||||
} catch (e) {
|
||||
if (e instanceof Found) return e;
|
||||
throw e;
|
||||
}
|
||||
};
|
||||
|
||||
// Find the outermost matching node after a given position.
|
||||
exports.findNodeAfter = function(node, pos, test, base, state) {
|
||||
test = makeTest(test);
|
||||
try {
|
||||
if (!base) base = exports.base;
|
||||
var c = function(node, st, override) {
|
||||
if (node.end < pos) return;
|
||||
var type = override || node.type;
|
||||
if (node.start >= pos && test(type, node)) throw new Found(node, st);
|
||||
base[type](node, st, c);
|
||||
};
|
||||
c(node, state);
|
||||
} catch (e) {
|
||||
if (e instanceof Found) return e;
|
||||
throw e;
|
||||
}
|
||||
};
|
||||
|
||||
// Find the outermost matching node before a given position.
|
||||
exports.findNodeBefore = function(node, pos, test, base, state) {
|
||||
test = makeTest(test);
|
||||
if (!base) base = exports.base;
|
||||
var max;
|
||||
var c = function(node, st, override) {
|
||||
if (node.start > pos) return;
|
||||
var type = override || node.type;
|
||||
if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))
|
||||
max = new Found(node, st);
|
||||
base[type](node, st, c);
|
||||
};
|
||||
c(node, state);
|
||||
return max;
|
||||
};
|
||||
|
||||
// Used to create a custom walker. Will fill in all missing node
|
||||
// type properties with the defaults.
|
||||
exports.make = function(funcs, base) {
|
||||
if (!base) base = exports.base;
|
||||
var visitor = {};
|
||||
for (var type in base) visitor[type] = base[type];
|
||||
for (var type in funcs) visitor[type] = funcs[type];
|
||||
return visitor;
|
||||
};
|
||||
|
||||
function skipThrough(node, st, c) { c(node, st); }
|
||||
function ignore(_node, _st, _c) {}
|
||||
|
||||
// Node walkers.
|
||||
|
||||
var base = exports.base = {};
|
||||
base.Program = base.BlockStatement = function(node, st, c) {
|
||||
for (var i = 0; i < node.body.length; ++i)
|
||||
c(node.body[i], st, "Statement");
|
||||
};
|
||||
base.Statement = skipThrough;
|
||||
base.EmptyStatement = ignore;
|
||||
base.ExpressionStatement = function(node, st, c) {
|
||||
c(node.expression, st, "Expression");
|
||||
};
|
||||
base.IfStatement = function(node, st, c) {
|
||||
c(node.test, st, "Expression");
|
||||
c(node.consequent, st, "Statement");
|
||||
if (node.alternate) c(node.alternate, st, "Statement");
|
||||
};
|
||||
base.LabeledStatement = function(node, st, c) {
|
||||
c(node.body, st, "Statement");
|
||||
};
|
||||
base.BreakStatement = base.ContinueStatement = ignore;
|
||||
base.WithStatement = function(node, st, c) {
|
||||
c(node.object, st, "Expression");
|
||||
c(node.body, st, "Statement");
|
||||
};
|
||||
base.SwitchStatement = function(node, st, c) {
|
||||
c(node.discriminant, st, "Expression");
|
||||
for (var i = 0; i < node.cases.length; ++i) {
|
||||
var cs = node.cases[i];
|
||||
if (cs.test) c(cs.test, st, "Expression");
|
||||
for (var j = 0; j < cs.consequent.length; ++j)
|
||||
c(cs.consequent[j], st, "Statement");
|
||||
}
|
||||
};
|
||||
base.ReturnStatement = function(node, st, c) {
|
||||
if (node.argument) c(node.argument, st, "Expression");
|
||||
};
|
||||
base.ThrowStatement = function(node, st, c) {
|
||||
c(node.argument, st, "Expression");
|
||||
};
|
||||
base.TryStatement = function(node, st, c) {
|
||||
c(node.block, st, "Statement");
|
||||
if (node.handler) c(node.handler.body, st, "ScopeBody");
|
||||
if (node.finalizer) c(node.finalizer, st, "Statement");
|
||||
};
|
||||
base.WhileStatement = function(node, st, c) {
|
||||
c(node.test, st, "Expression");
|
||||
c(node.body, st, "Statement");
|
||||
};
|
||||
base.DoWhileStatement = base.WhileStatement;
|
||||
base.ForStatement = function(node, st, c) {
|
||||
if (node.init) c(node.init, st, "ForInit");
|
||||
if (node.test) c(node.test, st, "Expression");
|
||||
if (node.update) c(node.update, st, "Expression");
|
||||
c(node.body, st, "Statement");
|
||||
};
|
||||
base.ForInStatement = function(node, st, c) {
|
||||
c(node.left, st, "ForInit");
|
||||
c(node.right, st, "Expression");
|
||||
c(node.body, st, "Statement");
|
||||
};
|
||||
base.ForInit = function(node, st, c) {
|
||||
if (node.type == "VariableDeclaration") c(node, st);
|
||||
else c(node, st, "Expression");
|
||||
};
|
||||
base.DebuggerStatement = ignore;
|
||||
|
||||
base.FunctionDeclaration = function(node, st, c) {
|
||||
c(node, st, "Function");
|
||||
};
|
||||
base.VariableDeclaration = function(node, st, c) {
|
||||
for (var i = 0; i < node.declarations.length; ++i) {
|
||||
var decl = node.declarations[i];
|
||||
if (decl.init) c(decl.init, st, "Expression");
|
||||
}
|
||||
};
|
||||
|
||||
base.Function = function(node, st, c) {
|
||||
c(node.body, st, "ScopeBody");
|
||||
};
|
||||
base.ScopeBody = function(node, st, c) {
|
||||
c(node, st, "Statement");
|
||||
};
|
||||
|
||||
base.Expression = skipThrough;
|
||||
base.ThisExpression = ignore;
|
||||
base.ArrayExpression = function(node, st, c) {
|
||||
for (var i = 0; i < node.elements.length; ++i) {
|
||||
var elt = node.elements[i];
|
||||
if (elt) c(elt, st, "Expression");
|
||||
}
|
||||
};
|
||||
base.ObjectExpression = function(node, st, c) {
|
||||
for (var i = 0; i < node.properties.length; ++i)
|
||||
c(node.properties[i].value, st, "Expression");
|
||||
};
|
||||
base.FunctionExpression = base.FunctionDeclaration;
|
||||
base.SequenceExpression = function(node, st, c) {
|
||||
for (var i = 0; i < node.expressions.length; ++i)
|
||||
c(node.expressions[i], st, "Expression");
|
||||
};
|
||||
base.UnaryExpression = base.UpdateExpression = function(node, st, c) {
|
||||
c(node.argument, st, "Expression");
|
||||
};
|
||||
base.BinaryExpression = base.AssignmentExpression = base.LogicalExpression = function(node, st, c) {
|
||||
c(node.left, st, "Expression");
|
||||
c(node.right, st, "Expression");
|
||||
};
|
||||
base.ConditionalExpression = function(node, st, c) {
|
||||
c(node.test, st, "Expression");
|
||||
c(node.consequent, st, "Expression");
|
||||
c(node.alternate, st, "Expression");
|
||||
};
|
||||
base.NewExpression = base.CallExpression = function(node, st, c) {
|
||||
c(node.callee, st, "Expression");
|
||||
if (node.arguments) for (var i = 0; i < node.arguments.length; ++i)
|
||||
c(node.arguments[i], st, "Expression");
|
||||
};
|
||||
base.MemberExpression = function(node, st, c) {
|
||||
c(node.object, st, "Expression");
|
||||
if (node.computed) c(node.property, st, "Expression");
|
||||
};
|
||||
base.Identifier = base.Literal = ignore;
|
||||
|
||||
// A custom walker that keeps track of the scope chain and the
|
||||
// variables defined in it.
|
||||
function makeScope(prev, isCatch) {
|
||||
return {vars: Object.create(null), prev: prev, isCatch: isCatch};
|
||||
}
|
||||
function normalScope(scope) {
|
||||
while (scope.isCatch) scope = scope.prev;
|
||||
return scope;
|
||||
}
|
||||
exports.scopeVisitor = exports.make({
|
||||
Function: function(node, scope, c) {
|
||||
var inner = makeScope(scope);
|
||||
for (var i = 0; i < node.params.length; ++i)
|
||||
inner.vars[node.params[i].name] = {type: "argument", node: node.params[i]};
|
||||
if (node.id) {
|
||||
var decl = node.type == "FunctionDeclaration";
|
||||
(decl ? normalScope(scope) : inner).vars[node.id.name] =
|
||||
{type: decl ? "function" : "function name", node: node.id};
|
||||
}
|
||||
c(node.body, inner, "ScopeBody");
|
||||
},
|
||||
TryStatement: function(node, scope, c) {
|
||||
c(node.block, scope, "Statement");
|
||||
if (node.handler) {
|
||||
var inner = makeScope(scope, true);
|
||||
inner.vars[node.handler.param.name] = {type: "catch clause", node: node.handler.param};
|
||||
c(node.handler.body, inner, "ScopeBody");
|
||||
}
|
||||
if (node.finalizer) c(node.finalizer, scope, "Statement");
|
||||
},
|
||||
VariableDeclaration: function(node, scope, c) {
|
||||
var target = normalScope(scope);
|
||||
for (var i = 0; i < node.declarations.length; ++i) {
|
||||
var decl = node.declarations[i];
|
||||
target.vars[decl.id.name] = {type: "var", node: decl.id};
|
||||
if (decl.init) c(decl.init, scope, "Expression");
|
||||
}
|
||||
}
|
||||
});
|
||||
|
||||
});
|
||||
|
|
@ -1,13 +1,6 @@
|
|||
#!/usr/bin/env node
|
||||
|
||||
var lint = require("./lint/lint");
|
||||
|
||||
lint.checkDir("mode");
|
||||
lint.checkDir("lib");
|
||||
lint.checkDir("addon");
|
||||
lint.checkDir("keymap");
|
||||
|
||||
var ok = lint.success();
|
||||
var ok = require("./lint").ok;
|
||||
|
||||
var files = new (require('node-static').Server)();
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue