org.sonar.java.checks.RedundantModifierCheck Maven / Gradle / Ivy
/*
* SonarQube Java
* Copyright (C) 2012-2024 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 Sonar Source-Available License Version 1, as published by SonarSource SA.
*
* 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 Sonar Source-Available License for more details.
*
* You should have received a copy of the Sonar Source-Available License
* along with this program; if not, see https://sonarsource.com/license/ssal/
*/
package org.sonar.java.checks;
import java.util.Arrays;
import java.util.List;
import org.sonar.check.Rule;
import org.sonar.java.model.ModifiersUtils;
import org.sonar.plugins.java.api.IssuableSubscriptionVisitor;
import org.sonar.plugins.java.api.tree.ClassTree;
import org.sonar.plugins.java.api.tree.MethodTree;
import org.sonar.plugins.java.api.tree.Modifier;
import org.sonar.plugins.java.api.tree.ModifierKeywordTree;
import org.sonar.plugins.java.api.tree.ModifiersTree;
import org.sonar.plugins.java.api.tree.Tree;
import org.sonar.plugins.java.api.tree.VariableTree;
@Rule(key = "S2333")
public class RedundantModifierCheck extends IssuableSubscriptionVisitor {
@Override
public List nodesToVisit() {
return Arrays.asList(Tree.Kind.INTERFACE, Tree.Kind.ANNOTATION_TYPE, Tree.Kind.CLASS, Tree.Kind.ENUM, Tree.Kind.RECORD);
}
@Override
public void visitNode(Tree tree) {
ClassTree classTree = (ClassTree) tree;
if (classTree.is(Tree.Kind.RECORD)) {
checkRedundantModifiers(classTree.modifiers(), Modifier.FINAL);
}
for (Tree member : classTree.members()) {
switch (member.kind()) {
case METHOD:
checkMethod((MethodTree) member, classTree);
break;
case VARIABLE:
checkVariable((VariableTree) member, classTree);
break;
case CONSTRUCTOR:
if (tree.is(Tree.Kind.ENUM)) {
checkRedundantModifiers(((MethodTree) member).modifiers(), Modifier.PRIVATE);
}
break;
case INTERFACE:
ClassTree nestedClass = (ClassTree) member;
checkNestedInterface(nestedClass, classTree);
checkNestedType(nestedClass, classTree);
break;
case CLASS:
checkNestedType((ClassTree) member, classTree);
break;
default:
// Do nothing for others members
}
}
}
private void checkMethod(MethodTree methodTree, ClassTree classTree) {
ModifiersTree modifiers = methodTree.modifiers();
if (isInterfaceOrAnnotation(classTree)) {
checkRedundantModifiers(modifiers, Modifier.ABSTRACT, Modifier.PUBLIC);
} else if (classTree.is(Tree.Kind.RECORD) || ModifiersUtils.hasModifier(classTree.modifiers(), Modifier.FINAL)) {
checkRedundantModifiers(modifiers, Modifier.FINAL);
}
}
private void checkVariable(VariableTree variableTree, ClassTree classTree) {
if (isInterfaceOrAnnotation(classTree)) {
ModifiersTree modifiers = variableTree.modifiers();
checkRedundantModifiers(modifiers, Modifier.PUBLIC, Modifier.STATIC, Modifier.FINAL);
}
}
private void checkNestedType(ClassTree nested, ClassTree classTree) {
if (isInterfaceOrAnnotation(classTree)) {
ModifiersTree modifiers = nested.modifiers();
checkRedundantModifiers(modifiers, Modifier.PUBLIC, Modifier.STATIC);
}
}
private void checkNestedInterface(ClassTree nested, ClassTree classTree) {
if (classTree.is(Tree.Kind.CLASS, Tree.Kind.ENUM)) {
checkRedundantModifiers(nested.modifiers(), Modifier.STATIC);
}
}
private static boolean isInterfaceOrAnnotation(Tree tree) {
return tree.is(Tree.Kind.INTERFACE, Tree.Kind.ANNOTATION_TYPE);
}
private void checkRedundantModifiers(ModifiersTree modifiersTree, Modifier... modifiers) {
for (Modifier modifier : modifiers) {
ModifierKeywordTree foundModifier = ModifiersUtils.getModifier(modifiersTree, modifier);
if (foundModifier != null) {
reportIssue(foundModifier, String.format("\"%s\" is redundant in this context.", foundModifier.keyword().text()));
}
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy