eslint-plugin-sonarjs
Version:
SonarJS rules for ESLint
98 lines • 3.99 kB
JavaScript
;
/*
* eslint-plugin-sonarjs
* Copyright (C) 2018 SonarSource SA
* mailto:info AT sonarsource DOT com
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
// https://jira.sonarsource.com/browse/RSPEC-4144
const equivalence_1 = require("../utils/equivalence");
const locations_1 = require("../utils/locations");
const nodes_1 = require("../utils/nodes");
const message = (line) => `Update this function so that its implementation is not identical to the one on line ${line}.`;
const rule = {
meta: {
type: "problem",
schema: [
{
enum: ["sonar-runtime"],
},
],
},
create(context) {
const functions = [];
return {
FunctionDeclaration(node) {
visitFunction(node);
},
FunctionExpression(node) {
visitFunction(node);
},
ArrowFunctionExpression(node) {
visitFunction(node);
},
"Program:exit"() {
processFunctions();
},
};
function visitFunction(node) {
if (isBigEnough(node.body)) {
functions.push({ function: node, parent: nodes_1.getParent(context) });
}
}
function processFunctions() {
if (functions.length < 2) {
return;
}
for (let i = 1; i < functions.length; i++) {
const duplicatingFunction = functions[i].function;
for (let j = 0; j < i; j++) {
const originalFunction = functions[j].function;
if (equivalence_1.areEquivalent(duplicatingFunction.body, originalFunction.body, context.getSourceCode()) &&
originalFunction.loc) {
const loc = locations_1.getMainFunctionTokenLocation(duplicatingFunction, functions[i].parent, context);
const originalFunctionLoc = locations_1.getMainFunctionTokenLocation(originalFunction, functions[j].parent, context);
const secondaryLocations = [
locations_1.issueLocation(originalFunctionLoc, originalFunctionLoc, "Original implementation"),
];
locations_1.report(context, {
message: message(String(originalFunction.loc.start.line)),
loc,
}, secondaryLocations);
break;
}
}
}
}
function isBigEnough(node) {
const tokens = context.getSourceCode().getTokens(node);
if (tokens.length > 0 && tokens[0].value === "{") {
tokens.shift();
}
if (tokens.length > 0 && tokens[tokens.length - 1].value === "}") {
tokens.pop();
}
if (tokens.length > 0) {
const firstLine = tokens[0].loc.start.line;
const lastLine = tokens[tokens.length - 1].loc.end.line;
return lastLine - firstLine > 1;
}
return false;
}
},
};
module.exports = rule;
//# sourceMappingURL=no-identical-functions.js.map