org.sonar.java.checks.NonShortCircuitLogicCheck Maven / Gradle / Ivy
The newest version!
/*
* SonarQube Java
* Copyright (C) 2012 SonarSource
* [email protected]
*
* 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 02
*/
package org.sonar.java.checks;
import com.google.common.collect.ImmutableList;
import com.google.common.collect.ImmutableMap;
import org.sonar.api.server.rule.RulesDefinition;
import org.sonar.check.Priority;
import org.sonar.check.Rule;
import org.sonar.plugins.java.api.tree.BinaryExpressionTree;
import org.sonar.plugins.java.api.tree.ExpressionTree;
import org.sonar.plugins.java.api.tree.Tree;
import org.sonar.plugins.java.api.tree.Tree.Kind;
import org.sonar.squidbridge.annotations.ActivatedByDefault;
import org.sonar.squidbridge.annotations.SqaleConstantRemediation;
import org.sonar.squidbridge.annotations.SqaleSubCharacteristic;
import java.util.List;
import java.util.Map;
@Rule(
key = "S2178",
name = "Short-circuit logic should be used in boolean contexts",
tags = {"bug"},
priority = Priority.CRITICAL)
@ActivatedByDefault
@SqaleSubCharacteristic(RulesDefinition.SubCharacteristics.LOGIC_RELIABILITY)
@SqaleConstantRemediation("5min")
public class NonShortCircuitLogicCheck extends SubscriptionBaseVisitor {
private static final Map REPLACEMENTS =
ImmutableMap.of(
"&", "&&",
"|", "||");
@Override
public List nodesToVisit() {
return ImmutableList.of(Tree.Kind.AND, Tree.Kind.OR);
}
@Override
public void visitNode(Tree tree) {
BinaryExpressionTree binaryExpressionTree = (BinaryExpressionTree) tree;
if (isBoolean(binaryExpressionTree.leftOperand())) {
String operator = binaryExpressionTree.operatorToken().text();
String replacement = REPLACEMENTS.get(operator);
addIssue(tree, "Correct this \"" + operator + "\" to \"" + replacement + "\".");
}
}
private boolean isBoolean(ExpressionTree expression) {
return expression.symbolType().is("boolean") || expression.symbolType().is("java.lang.Boolean");
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy