org.sonar.python.checks.GraphQLDenialOfServiceCheck Maven / Gradle / Ivy
The newest version!
/*
* SonarQube Python Plugin
* Copyright (C) 2011-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.python.checks;
import java.util.HashSet;
import java.util.List;
import java.util.Locale;
import java.util.Optional;
import java.util.Set;
import org.sonar.check.Rule;
import org.sonar.plugins.python.api.PythonSubscriptionCheck;
import org.sonar.plugins.python.api.SubscriptionContext;
import org.sonar.plugins.python.api.symbols.Symbol;
import org.sonar.plugins.python.api.tree.Argument;
import org.sonar.plugins.python.api.tree.BaseTreeVisitor;
import org.sonar.plugins.python.api.tree.CallExpression;
import org.sonar.plugins.python.api.tree.Expression;
import org.sonar.plugins.python.api.tree.HasSymbol;
import org.sonar.plugins.python.api.tree.Name;
import org.sonar.plugins.python.api.tree.QualifiedExpression;
import org.sonar.plugins.python.api.tree.RegularArgument;
import org.sonar.plugins.python.api.tree.Tree;
import org.sonar.python.checks.utils.Expressions;
import org.sonar.python.checks.utils.GraphQLUtils;
import org.sonar.python.tree.TreeUtils;
@Rule(key="S6785")
public class GraphQLDenialOfServiceCheck extends PythonSubscriptionCheck {
private static final Set SAFE_VALIDATION_RULE_FQNS = Set.of("graphene.validation.DepthLimitValidator");
private static final List VALID_MIDDLEWARE_NAMES = List.of("DEPTH", "COST");
private static final String MESSAGE_DEPTH = "Change this code to limit the depth of GraphQL queries.";
private static final String MESSAGE_CIRCULAR = "This relationship creates circular references.";
private final Set circularReferences = new HashSet<>();
@Override
public void initialize(Context context) {
context.registerSyntaxNodeConsumer(Tree.Kind.FILE_INPUT, this::searchForCircularReferences);
context.registerSyntaxNodeConsumer(Tree.Kind.CALL_EXPR, this::checkGraphQLDepthLimit);
}
private void searchForCircularReferences(SubscriptionContext ctx) {
circularReferences.clear();
CircularRelationshipVisitor classVisitor = new CircularRelationshipVisitor(circularReferences);
ctx.syntaxNode().accept(classVisitor);
}
private void checkGraphQLDepthLimit(SubscriptionContext ctx) {
if (circularReferences.isEmpty()) {
// Query depth should only be limited if there are circular references in the database
return;
}
CallExpression callExpression = (CallExpression) ctx.syntaxNode();
List arguments = callExpression.arguments();
Optional.of(callExpression)
.map(CallExpression::callee)
.flatMap(TreeUtils.toOptionalInstanceOfMapper(QualifiedExpression.class))
.filter(GraphQLUtils::isCallToAsView)
.map(QualifiedExpression::qualifier)
.filter(HasSymbol.class::isInstance)
.map(HasSymbol.class::cast)
.map(HasSymbol::symbol)
.filter(GraphQLUtils::isOrExtendsGraphQLView)
.filter(fqn -> !hasSafeValidationRules(arguments))
.filter(fqn -> !hasSafeMiddlewares(arguments))
.ifPresent(fqn -> {
PreciseIssue preciseIssue = ctx.addIssue(callExpression.callee(), MESSAGE_DEPTH);
circularReferences.forEach(circularRef -> preciseIssue.secondary(circularRef, MESSAGE_CIRCULAR));
});
}
private static boolean hasSafeMiddlewares(List arguments) {
RegularArgument argument = TreeUtils.argumentByKeyword("middleware", arguments);
if (argument == null) {
return false;
}
Optional argumentValue = Expressions.ifNameGetSingleAssignedNonNameValue(argument.expression());
boolean isNotTupleNorListLiteral = argumentValue.filter(a -> a.is(Tree.Kind.LIST_LITERAL, Tree.Kind.TUPLE)).isEmpty();
return isNotTupleNorListLiteral || Expressions.expressionsFromListOrTuple(argumentValue.get()).stream().anyMatch(GraphQLDenialOfServiceCheck::isSafeMiddlewareName);
}
private static boolean hasSafeValidationRules(List arguments) {
RegularArgument argument = TreeUtils.argumentByKeyword("validation_rules", arguments);
if (argument == null) {
return false;
}
Optional argumentValue = Expressions.ifNameGetSingleAssignedNonNameValue(argument.expression());
boolean isNotTupleNorListLiteral = argumentValue.filter(a -> a.is(Tree.Kind.LIST_LITERAL, Tree.Kind.TUPLE)).isEmpty();
return isNotTupleNorListLiteral || Expressions.expressionsFromListOrTuple(argumentValue.get()).stream().anyMatch(GraphQLDenialOfServiceCheck::isSafeValidationRule);
}
private static boolean isSafeValidationRule(Expression value) {
return isSafeMiddlewareName(value) || GraphQLUtils.expressionFQNMatchPredicate(value, SAFE_VALIDATION_RULE_FQNS::contains);
}
private static boolean isSafeMiddlewareName(Expression value) {
return GraphQLUtils.expressionTypeOrNameMatchPredicate(value, name -> VALID_MIDDLEWARE_NAMES.stream().anyMatch(mwName -> name.toUpperCase(Locale.ROOT).contains(mwName)));
}
static class CircularRelationshipVisitor extends BaseTreeVisitor {
final Set circularReferences;
public CircularRelationshipVisitor(Set circularReferences) {
this.circularReferences = circularReferences;
}
@Override
public void visitCallExpression(CallExpression callExpression) {
TreeUtils.toOptionalInstanceOf(QualifiedExpression.class, callExpression.callee())
.filter(qualifiedExpression -> "relationship".equals(qualifiedExpression.name().name()))
.map(QualifiedExpression::qualifier)
.flatMap(TreeUtils.toOptionalInstanceOfMapper(Name.class))
.flatMap(Expressions::singleAssignedNonNameValue)
.flatMap(TreeUtils.toOptionalInstanceOfMapper(CallExpression.class))
.map(CallExpression::callee)
.filter(HasSymbol.class::isInstance)
.map(HasSymbol.class::cast)
.map(HasSymbol::symbol)
.map(Symbol::fullyQualifiedName)
.filter("flask_sqlalchemy.SQLAlchemy"::equals)
.ifPresent(s -> circularReferences.add(callExpression));
super.visitCallExpression(callExpression);
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy