org.sonar.java.checks.ModifiersOrderCheck Maven / Gradle / Ivy
/*
* SonarQube Java
* Copyright (C) 2012-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.
*/
package org.sonar.java.checks;
import com.google.common.collect.ImmutableList;
import com.google.common.collect.Sets;
import org.sonar.check.Rule;
import org.sonar.java.RspecKey;
import org.sonar.plugins.java.api.IssuableSubscriptionVisitor;
import org.sonar.plugins.java.api.JavaFileScannerContext;
import org.sonar.plugins.java.api.tree.Modifier;
import org.sonar.plugins.java.api.tree.ModifierKeywordTree;
import org.sonar.plugins.java.api.tree.ModifierTree;
import org.sonar.plugins.java.api.tree.ModifiersTree;
import org.sonar.plugins.java.api.tree.Tree;
import org.sonar.plugins.java.api.tree.Tree.Kind;
import java.util.List;
import java.util.ListIterator;
import java.util.Set;
@Rule(key = "ModifiersOrderCheck")
@RspecKey("S1124")
public class ModifiersOrderCheck extends IssuableSubscriptionVisitor {
private Set alreadyReported = Sets.newHashSet();
@Override
public void scanFile(JavaFileScannerContext context) {
alreadyReported.clear();
super.scanFile(context);
}
@Override
public List nodesToVisit() {
return ImmutableList.of(Kind.MODIFIERS);
}
@Override
public void visitNode(Tree tree) {
if (!alreadyReported.contains(tree)) {
alreadyReported.add(tree);
ModifierTree badlyOrderedModifier = getFirstBadlyOrdered((ModifiersTree) tree);
if (badlyOrderedModifier != null) {
reportIssue(badlyOrderedModifier, "Reorder the modifiers to comply with the Java Language Specification.");
}
}
}
private static ModifierTree getFirstBadlyOrdered(ModifiersTree modifiersTree) {
ListIterator modifiersIterator = modifiersTree.listIterator();
skipAnnotations(modifiersIterator);
Modifier[] modifiers = Modifier.values();
int modifierIndex = 0;
while (modifiersIterator.hasNext()){
ModifierTree modifier = modifiersIterator.next();
if (modifier.is(Kind.ANNOTATION)) {
break;
}
ModifierKeywordTree mkt = (ModifierKeywordTree) modifier;
for (; modifierIndex < modifiers.length && !mkt.modifier().equals(modifiers[modifierIndex]); modifierIndex++) {
// We're just interested in the final value of modifierIndex
}
if (modifierIndex == modifiers.length) {
return modifier;
}
}
return testOnlyAnnotationsAreLeft(modifiersIterator);
}
/**
* Move iterator on the first element which is not an annotation
*/
private static void skipAnnotations(ListIterator modifiersIterator) {
while (modifiersIterator.hasNext() && modifiersIterator.next().is(Kind.ANNOTATION)) {
// skip modifiers which are annotations
}
if (modifiersIterator.hasNext()) {
modifiersIterator.previous();
}
}
private static ModifierTree testOnlyAnnotationsAreLeft(ListIterator modifiersIterator) {
while (modifiersIterator.hasNext()) {
ModifierTree modifier = modifiersIterator.next();
if (!modifier.is(Kind.ANNOTATION)) {
modifiersIterator.previous();
if (modifiersIterator.hasPrevious()) {
return modifiersIterator.previous();
}
}
}
return null;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy