org.jetbrains.kotlin.fir.resolve.dfa.FirDataFlowAnalyzer.kt Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of kotlin-compiler-embeddable Show documentation
Show all versions of kotlin-compiler-embeddable Show documentation
the Kotlin compiler embeddable
/*
* Copyright 2010-2023 JetBrains s.r.o. and Kotlin Programming Language contributors.
* Use of this source code is governed by the Apache 2.0 license that can be found in the license/LICENSE.txt file.
*/
package org.jetbrains.kotlin.fir.resolve.dfa
import kotlinx.collections.immutable.toPersistentSet
import org.jetbrains.kotlin.config.LanguageFeature
import org.jetbrains.kotlin.contracts.description.LogicOperationKind
import org.jetbrains.kotlin.contracts.description.canBeRevisited
import org.jetbrains.kotlin.descriptors.Modality
import org.jetbrains.kotlin.fir.*
import org.jetbrains.kotlin.fir.contracts.description.ConeConditionalEffectDeclaration
import org.jetbrains.kotlin.fir.contracts.description.ConeReturnsEffectDeclaration
import org.jetbrains.kotlin.fir.declarations.*
import org.jetbrains.kotlin.fir.declarations.impl.FirDefaultPropertyAccessor
import org.jetbrains.kotlin.fir.expressions.*
import org.jetbrains.kotlin.fir.references.FirControlFlowGraphReference
import org.jetbrains.kotlin.fir.references.symbol
import org.jetbrains.kotlin.fir.references.toResolvedPropertySymbol
import org.jetbrains.kotlin.fir.resolve.*
import org.jetbrains.kotlin.fir.resolve.calls.ImplicitReceiverValue
import org.jetbrains.kotlin.fir.resolve.calls.candidate
import org.jetbrains.kotlin.fir.resolve.dfa.cfg.*
import org.jetbrains.kotlin.fir.resolve.substitution.ConeSubstitutor
import org.jetbrains.kotlin.fir.resolve.substitution.ConeSubstitutorByMap
import org.jetbrains.kotlin.fir.resolve.substitution.chain
import org.jetbrains.kotlin.fir.resolve.transformers.body.resolve.FirAbstractBodyResolveTransformer
import org.jetbrains.kotlin.fir.resolve.transformers.unwrapAnonymousFunctionExpression
import org.jetbrains.kotlin.fir.scopes.getFunctions
import org.jetbrains.kotlin.fir.scopes.impl.toConeType
import org.jetbrains.kotlin.fir.scopes.unsubstitutedScope
import org.jetbrains.kotlin.fir.symbols.FirBasedSymbol
import org.jetbrains.kotlin.fir.symbols.impl.FirClassSymbol
import org.jetbrains.kotlin.fir.symbols.impl.FirPropertySymbol
import org.jetbrains.kotlin.fir.symbols.impl.FirRegularClassSymbol
import org.jetbrains.kotlin.fir.symbols.impl.FirTypeParameterSymbol
import org.jetbrains.kotlin.fir.types.*
import org.jetbrains.kotlin.name.ClassId
import org.jetbrains.kotlin.name.StandardClassIds
import org.jetbrains.kotlin.types.ConstantValueKind
import org.jetbrains.kotlin.types.SmartcastStability
import org.jetbrains.kotlin.util.OperatorNameConventions
class DataFlowAnalyzerContext(session: FirSession) {
val graphBuilder = ControlFlowGraphBuilder()
internal val variableAssignmentAnalyzer = FirLocalVariableAssignmentAnalyzer()
var variableStorage = VariableStorageImpl(session)
private set
private var assignmentCounter = 0
fun newAssignmentIndex(): Int {
return assignmentCounter++
}
fun reset() {
graphBuilder.reset()
variableAssignmentAnalyzer.reset()
variableStorage = variableStorage.clear()
}
}
@OptIn(DfaInternals::class)
abstract class FirDataFlowAnalyzer(
protected val components: FirAbstractBodyResolveTransformer.BodyResolveTransformerComponents,
private val context: DataFlowAnalyzerContext,
) {
companion object {
fun createFirDataFlowAnalyzer(
components: FirAbstractBodyResolveTransformer.BodyResolveTransformerComponents,
dataFlowAnalyzerContext: DataFlowAnalyzerContext,
): FirDataFlowAnalyzer =
object : FirDataFlowAnalyzer(components, dataFlowAnalyzerContext) {
override val receiverStack: PersistentImplicitReceiverStack
get() = components.implicitReceiverStack as PersistentImplicitReceiverStack
private val visibilityChecker = components.session.visibilityChecker
private val typeContext = components.session.typeContext
override fun receiverUpdated(symbol: FirBasedSymbol<*>, info: TypeStatement?) {
val index = receiverStack.getReceiverIndex(symbol) ?: return
val originalType = receiverStack.getOriginalType(index)
receiverStack.replaceReceiverType(index, info.smartCastedType(typeContext, originalType))
}
override val logicSystem: LogicSystem =
object : LogicSystem(components.session.typeContext) {
override val variableStorage: VariableStorageImpl
get() = dataFlowAnalyzerContext.variableStorage
override fun ConeKotlinType.isAcceptableForSmartcast(): Boolean {
if (this.isNullableNothing) return false
return when (this) {
is ConeClassLikeType -> {
val symbol =
fullyExpandedType(components.session).lookupTag.toSymbol(components.session) ?: return false
val declaration = symbol.fir as? FirRegularClass ?: return true
visibilityChecker.isClassLikeVisible(
declaration,
components.session,
components.context.file,
components.context.containers,
)
}
is ConeTypeParameterType -> true
is ConeFlexibleType -> lowerBound.isAcceptableForSmartcast() && upperBound.isAcceptableForSmartcast()
is ConeIntersectionType -> intersectedTypes.all { it.isAcceptableForSmartcast() }
is ConeDefinitelyNotNullType -> original.isAcceptableForSmartcast()
else -> false
}
}
}
}
}
protected abstract val logicSystem: LogicSystem
protected abstract val receiverStack: Iterable>
protected abstract fun receiverUpdated(symbol: FirBasedSymbol<*>, info: TypeStatement?)
private val graphBuilder get() = context.graphBuilder
private val variableStorage get() = context.variableStorage
private val any = components.session.builtinTypes.anyType.type
private val nullableNothing = components.session.builtinTypes.nullableNothingType.type
// ----------------------------------- Requests -----------------------------------
/**
* When variable access resolution encounters a variable access which has smartcast information, assignments associated with that
* variable are checked to determine variable stability, and therefore smartcast stability. These assignments are tracked by
* [FirLocalVariableAssignmentAnalyzer], which knows how each assignment may limit variable stability, like assignments within or after
* a non-in-place lambda body. So for a given lexical scope (function body, lambda body, and even local class init) and a given
* variable, [FirLocalVariableAssignmentAnalyzer] knows all associated assignments (past and/or future) which could limit stability.
*
* When [targetTypes] are provided, all assignments are checked for the specified variable access expression:
* 1. If there are no assignments, the variable is always considered **stable**.
* 2. If there is an unresolved assignment type, the variable is considered **unstable**.
* 3. If any resolved assignment type is not a subtype of all [targetTypes], the variable is considered **unstable**.
* 4. If none of the previous conditions are true, the variable is considered **stable**.
*
* When [targetTypes] are **not** provided, **any** assignments cause the variable to be considered **unstable**.
*
* @param expression The variable access expression.
* @param targetTypes Smartcast target types (optional: see function description).
*
* @see [getTypeUsingSmartcastInfo]
* @see [FirLocalVariableAssignmentAnalyzer.isAccessToUnstableLocalVariable]
* @see [FirLocalVariableAssignmentAnalyzer.isStableType]
*/
private fun isAccessToUnstableLocalVariable(expression: FirElement, targetTypes: Set?): Boolean =
context.variableAssignmentAnalyzer.isAccessToUnstableLocalVariable(expression, targetTypes, components.session)
private fun RealVariable.getStability(flow: Flow, fir: FirElement, targetTypes: Set?): SmartcastStability =
getStability(flow, components.session).let {
if (it == SmartcastStability.CAPTURED_VARIABLE && !isAccessToUnstableLocalVariable(fir, targetTypes))
SmartcastStability.STABLE_VALUE
else it
}
/**
* Retrieve smartcast type information [FirDataFlowAnalyzer] may have for the specified variable access expression. Type information
* is **stateful** and changes as the FIR tree is navigated by [FirDataFlowAnalyzer].
*
* @param expression The variable access expression.
*/
open fun getTypeUsingSmartcastInfo(expression: FirExpression): Pair>? {
val flow = currentSmartCastPosition ?: return null
val variable = getRealVariableWithoutUnwrappingAlias(flow, expression) ?: return null
val types = flow.getTypeStatement(variable)?.exactType?.ifEmpty { null } ?: return null
return variable.getStability(flow, expression, types) to types.toMutableList()
}
fun returnExpressionsOfAnonymousFunctionOrNull(function: FirAnonymousFunction): Collection? =
graphBuilder.returnExpressionsOfAnonymousFunction(function)
fun returnExpressionsOfAnonymousFunction(function: FirAnonymousFunction): Collection =
returnExpressionsOfAnonymousFunctionOrNull(function)
?: error("anonymous function ${function.render()} not analyzed")
// ----------------------------------- Named function -----------------------------------
fun enterFunction(function: FirFunction) {
if (function is FirDefaultPropertyAccessor) return
val assignedInside = context.variableAssignmentAnalyzer.enterFunction(function)
val (localFunctionNode, functionEnterNode) = if (function is FirAnonymousFunction) {
null to graphBuilder.enterAnonymousFunction(function)
} else {
graphBuilder.enterFunction(function)
}
localFunctionNode?.mergeIncomingFlow()
functionEnterNode.mergeIncomingFlow { _, flow ->
/*
* Anonymous functions which can be revisited, either in-place or not in-place, are treated as repeatable statements. This
* causes any assignments to local variables within the anonymous function body to clear type statements for those local
* variables.
*/
if (function is FirAnonymousFunction && function.invocationKind?.canBeRevisited() != false) {
enterRepeatableStatement(flow, assignedInside)
}
}
}
fun exitFunction(function: FirFunction): FirControlFlowGraphReference? {
if (function is FirDefaultPropertyAccessor) return null
context.variableAssignmentAnalyzer.exitFunction()
if (function is FirAnonymousFunction) {
val (functionExitNode, postponedLambdaExitNode, graph) = graphBuilder.exitAnonymousFunction(function)
functionExitNode.mergeIncomingFlow()
postponedLambdaExitNode?.mergeIncomingFlow()
resetSmartCastPosition() // roll back to state before function
return FirControlFlowGraphReferenceImpl(graph)
}
val (node, graph) = graphBuilder.exitFunction(function)
node.mergeIncomingFlow()
graph.completePostponedNodes()
if (!graphBuilder.isTopLevel) {
for (valueParameter in function.valueParameters) {
variableStorage.removeRealVariable(valueParameter.symbol)
}
}
val info = DataFlowInfo(variableStorage)
resetSmartCastPosition()
return FirControlFlowGraphReferenceImpl(graph, info)
}
// ----------------------------------- Anonymous function -----------------------------------
fun enterAnonymousFunctionExpression(anonymousFunctionExpression: FirAnonymousFunctionExpression) {
graphBuilder.enterAnonymousFunctionExpression(anonymousFunctionExpression)?.mergeIncomingFlow()
}
// ----------------------------------- Files ------------------------------------------
fun enterFile(file: FirFile, buildGraph: Boolean) {
graphBuilder.enterFile(file, buildGraph)?.mergeIncomingFlow()
}
fun exitFile(): ControlFlowGraph? {
val (node, graph) = graphBuilder.exitFile()
if (node != null) {
node.mergeIncomingFlow()
} else {
resetSmartCastPosition()
}
graph?.completePostponedNodes()
return graph
}
// ----------------------------------- Classes -----------------------------------
fun enterClass(klass: FirClass, buildGraph: Boolean) {
val (outerNode, enterNode) = graphBuilder.enterClass(klass, buildGraph)
outerNode?.mergeIncomingFlow()
enterNode?.mergeIncomingFlow()
context.variableAssignmentAnalyzer.enterClass(klass)
}
fun exitClass(): ControlFlowGraph? {
context.variableAssignmentAnalyzer.exitClass()
val (node, graph) = graphBuilder.exitClass()
if (node != null) {
node.mergeIncomingFlow()
} else {
resetSmartCastPosition() // to state before class initialization
}
graph?.completePostponedNodes()
return graph
}
fun exitAnonymousObjectExpression(anonymousObjectExpression: FirAnonymousObjectExpression) {
graphBuilder.exitAnonymousObjectExpression(anonymousObjectExpression)?.mergeIncomingFlow()
}
// ----------------------------------- Scripts ------------------------------------------
fun enterScript(script: FirScript, buildGraph: Boolean) {
graphBuilder.enterScript(script, buildGraph)?.mergeIncomingFlow()
}
fun exitScript(): ControlFlowGraph? {
val (node, graph) = graphBuilder.exitScript()
node?.mergeIncomingFlow()
graph?.completePostponedNodes()
return graph
}
// ----------------------------------- Code Fragment ------------------------------------------
fun enterCodeFragment(codeFragment: FirCodeFragment) {
graphBuilder.enterCodeFragment(codeFragment).mergeIncomingFlow { _, flow ->
val smartCasts = codeFragment.codeFragmentContext?.smartCasts.orEmpty()
for ((originalRealVariable, exactTypes) in smartCasts) {
val realVariable = variableStorage.getOrPut(originalRealVariable.identifier) { originalRealVariable }
val typeStatement = PersistentTypeStatement(realVariable, exactTypes.toPersistentSet())
flow.addTypeStatement(typeStatement)
}
}
}
fun exitCodeFragment(): ControlFlowGraph {
val (node, graph) = graphBuilder.exitCodeFragment()
node.mergeIncomingFlow()
graph.completePostponedNodes()
return graph
}
// ----------------------------------- Value parameters (and it's defaults) -----------------------------------
fun enterValueParameter(valueParameter: FirValueParameter) {
val (outerNode, innerNode) = graphBuilder.enterValueParameter(valueParameter) ?: return
outerNode.mergeIncomingFlow()
innerNode.mergeIncomingFlow()
}
fun exitValueParameter(valueParameter: FirValueParameter): ControlFlowGraph? {
val (innerNode, outerNode, graph) = graphBuilder.exitValueParameter(valueParameter) ?: return null
innerNode.mergeIncomingFlow()
outerNode.mergeIncomingFlow()
graph.completePostponedNodes()
return graph
}
// ----------------------------------- Property -----------------------------------
fun enterProperty(property: FirProperty) {
graphBuilder.enterProperty(property)?.mergeIncomingFlow()
}
fun exitProperty(property: FirProperty): ControlFlowGraph? {
val (node, graph) = graphBuilder.exitProperty(property) ?: return null
node.mergeIncomingFlow()
graph.completePostponedNodes()
return graph
}
// ----------------------------------- Field -----------------------------------
fun enterField(field: FirField) {
graphBuilder.enterField(field)?.mergeIncomingFlow()
}
fun exitField(field: FirField): ControlFlowGraph? {
val (node, graph) = graphBuilder.exitField(field) ?: return null
node.mergeIncomingFlow()
graph.completePostponedNodes()
return graph
}
// ----------------------------------- Delegate -----------------------------------
fun enterDelegateExpression() {
graphBuilder.enterDelegateExpression()
}
fun exitDelegateExpression(fir: FirExpression) {
graphBuilder.exitDelegateExpression(fir).mergeIncomingFlow()
}
// ----------------------------------- Block -----------------------------------
fun enterBlock(block: FirBlock) {
graphBuilder.enterBlock(block).mergeIncomingFlow()
}
fun exitBlock(block: FirBlock) {
graphBuilder.exitBlock(block).mergeIncomingFlow()
}
// ----------------------------------- Operator call -----------------------------------
fun exitTypeOperatorCall(typeOperatorCall: FirTypeOperatorCall) {
graphBuilder.exitTypeOperatorCall(typeOperatorCall).mergeIncomingFlow { _, flow ->
if (typeOperatorCall.operation !in FirOperation.TYPES) return@mergeIncomingFlow
addTypeOperatorStatements(flow, typeOperatorCall)
}
}
private fun addTypeOperatorStatements(flow: MutableFlow, typeOperatorCall: FirTypeOperatorCall) {
val type = typeOperatorCall.conversionTypeRef.coneType
val operandVariable = getOrCreateVariableIfRealAndStable(flow, typeOperatorCall.argument) ?: return
when (val operation = typeOperatorCall.operation) {
FirOperation.IS, FirOperation.NOT_IS -> {
val isType = operation == FirOperation.IS
when (type) {
// x is Nothing? <=> x == null
nullableNothing -> processEqNull(flow, typeOperatorCall, typeOperatorCall.argument, isType)
// x is Any <=> x != null
any -> processEqNull(flow, typeOperatorCall, typeOperatorCall.argument, !isType)
else -> {
val expressionVariable = variableStorage.createSynthetic(typeOperatorCall)
if (operandVariable.isReal()) {
flow.addImplication((expressionVariable eq isType) implies (operandVariable typeEq type))
}
if (!type.canBeNull(components.session)) {
// x is (T & Any) => x != null
flow.addImplication((expressionVariable eq isType) implies (operandVariable notEq null))
} else if (type.isMarkedNullable) {
// x !is T? => x != null
flow.addImplication((expressionVariable eq !isType) implies (operandVariable notEq null))
} // else probably a type parameter, so which implication is correct depends on instantiation
}
}
}
FirOperation.AS -> {
if (operandVariable.isReal()) {
flow.addTypeStatement(operandVariable typeEq type)
}
if (!type.canBeNull(components.session)) {
flow.commitOperationStatement(operandVariable notEq null)
} else {
val expressionVariable = variableStorage.createSynthetic(typeOperatorCall)
flow.addImplication((expressionVariable notEq null) implies (operandVariable notEq null))
flow.addImplication((expressionVariable eq null) implies (operandVariable eq null))
}
}
FirOperation.SAFE_AS -> {
val expressionVariable = variableStorage.createSynthetic(typeOperatorCall)
flow.addImplication((expressionVariable notEq null) implies (operandVariable notEq null))
if (operandVariable.isReal()) {
flow.addImplication((expressionVariable notEq null) implies (operandVariable typeEq type))
}
}
else -> throw IllegalStateException()
}
}
fun exitComparisonExpressionCall(comparisonExpression: FirComparisonExpression) {
graphBuilder.exitComparisonExpression(comparisonExpression).mergeIncomingFlow()
}
fun exitEqualityOperatorLhs() {
graphBuilder.exitEqualityOperatorLhs()
}
fun exitEqualityOperatorCall(equalityOperatorCall: FirEqualityOperatorCall) {
val (lhsExitNode, node) = graphBuilder.exitEqualityOperatorCall(equalityOperatorCall)
val operation = equalityOperatorCall.operation
val leftOperand = equalityOperatorCall.arguments[0]
val rightOperand = equalityOperatorCall.arguments[1]
/*
* This unwrapping is needed for cases like
* when (true) {
* s != null -> s.length
* }
*
* FirWhenSubjectExpression may be only in the lhs of equality operator call
* by how is FIR for when branches is built, so there is no need to unwrap
* right argument
*/
val leftConst = when (leftOperand) {
is FirWhenSubjectExpression -> leftOperand.whenRef.value.subject
else -> leftOperand
} as? FirLiteralExpression<*>
val rightConst = rightOperand as? FirLiteralExpression<*>
val leftIsNullConst = leftConst?.kind == ConstantValueKind.Null
val rightIsNullConst = rightConst?.kind == ConstantValueKind.Null
val leftIsNull = leftIsNullConst || leftOperand.resolvedType.isNullableNothing && !rightIsNullConst
val rightIsNull = rightIsNullConst || rightOperand.resolvedType.isNullableNothing && !leftIsNullConst
node.mergeIncomingFlow { _, flow ->
when {
leftConst != null && rightConst != null -> return@mergeIncomingFlow
leftIsNull || rightIsNull -> {
if (leftIsNull) processEqNull(flow, equalityOperatorCall, rightOperand, operation.isEq())
if (rightIsNull) processEqNull(flow, equalityOperatorCall, leftOperand, operation.isEq())
}
leftConst != null -> processEqConst(flow, equalityOperatorCall, rightOperand, leftConst, operation.isEq())
rightConst != null -> processEqConst(flow, equalityOperatorCall, leftOperand, rightConst, operation.isEq())
else -> processEq(flow, lhsExitNode.flow, equalityOperatorCall, leftOperand, rightOperand, operation)
}
}
}
private fun processEqConst(
flow: MutableFlow,
expression: FirEqualityOperatorCall,
operand: FirExpression,
const: FirLiteralExpression<*>,
isEq: Boolean,
) {
if (const.kind == ConstantValueKind.Null) {
return processEqNull(flow, expression, operand, isEq)
}
val operandVariable = getOrCreateVariableIfRealAndStable(flow, operand) ?: return
val expressionVariable = variableStorage.createSynthetic(expression)
if (const.kind == ConstantValueKind.Boolean && operand.resolvedType.isBooleanOrNullableBoolean) {
val expected = (const.value as Boolean)
flow.addImplication((expressionVariable eq isEq) implies (operandVariable eq expected))
if (operand.resolvedType.isBoolean) {
flow.addImplication((expressionVariable eq !isEq) implies (operandVariable eq !expected))
}
} else {
// expression == non-null const -> expression != null
flow.addImplication((expressionVariable eq isEq) implies (operandVariable notEq null))
}
// We can imply type information if the constant is the left operand and is a supported primitive type.
if (operandVariable is RealVariable && const == expression.arguments[0] && isSmartcastPrimitive(const.resolvedType.classId)) {
flow.addImplication((expressionVariable eq isEq) implies (operandVariable typeEq const.resolvedType))
}
}
private fun processEqNull(flow: MutableFlow, expression: FirExpression, operand: FirExpression, isEq: Boolean) {
val operandVariable = getOrCreateVariableIfRealAndStable(flow, operand) ?: return
val expressionVariable = variableStorage.createSynthetic(expression)
flow.addImplication((expressionVariable eq isEq) implies (operandVariable eq null))
flow.addImplication((expressionVariable eq !isEq) implies (operandVariable notEq null))
}
private fun processEq(
flow: MutableFlow,
lhsExitFlow: PersistentFlow,
expression: FirExpression,
leftOperand: FirExpression,
rightOperand: FirExpression,
operation: FirOperation,
) {
val isEq = operation.isEq()
val leftOperandType = leftOperand.resolvedType
val rightOperandType = rightOperand.resolvedType
val leftIsNullable = leftOperandType.isMarkedNullable
val rightIsNullable = rightOperandType.isMarkedNullable
if (leftIsNullable && rightIsNullable) {
// The logic system is not complex enough to express a second level of implications this creates:
// if either `== null` then this creates the same implications as a constant null comparison,
// otherwise the same as if the corresponding `...IsNullable` is false.
return
}
// Only consider the LHS variable if it has not been reassigned in the RHS.
val leftOperandVariable = getOrCreateVariableIfRealAndStable(flow, leftOperand)
.takeIf { isSameValueIn(lhsExitFlow, leftOperand, flow) }
val rightOperandVariable = getOrCreateVariableIfRealAndStable(flow, rightOperand)
if (leftOperandVariable == null && rightOperandVariable == null) return
val expressionVariable = variableStorage.createSynthetic(expression)
if (leftIsNullable || rightIsNullable) {
// `a == b:Any` => `a != null`; the inverse is not true - we don't know when `a` *is* `null`
val nullableOperand = if (leftIsNullable) leftOperandVariable else rightOperandVariable
if (nullableOperand != null) {
flow.addImplication((expressionVariable eq isEq) implies (nullableOperand notEq null))
}
}
if (leftOperandVariable !is RealVariable && rightOperandVariable !is RealVariable) return
if (operation == FirOperation.EQ || operation == FirOperation.NOT_EQ) {
if (hasOverriddenEquals(leftOperandType)) return
}
if (leftOperandVariable is RealVariable) {
flow.addImplication((expressionVariable eq isEq) implies (leftOperandVariable typeEq rightOperandType))
}
if (rightOperandVariable is RealVariable) {
flow.addImplication((expressionVariable eq isEq) implies (rightOperandVariable typeEq leftOperandType))
}
}
private fun hasOverriddenEquals(type: ConeKotlinType): Boolean {
val session = components.session
val symbolsForType = collectSymbolsForType(type, session)
if (symbolsForType.any { it.hasEqualsOverride(session, checkModality = true) }) return true
val superTypes = lookupSuperTypes(
symbolsForType,
lookupInterfaces = false,
deep = true,
session,
substituteTypes = false
)
val superClassSymbols = superTypes.mapNotNull {
it.fullyExpandedType(session).toSymbol(session) as? FirRegularClassSymbol
}
return superClassSymbols.any { it.hasEqualsOverride(session, checkModality = false) }
}
private fun FirClassSymbol<*>.hasEqualsOverride(session: FirSession, checkModality: Boolean): Boolean {
val status = resolvedStatus
if (checkModality && status.modality != Modality.FINAL) return true
if (status.isExpect) return true
if (isSmartcastPrimitive(classId)) return false
when (classId) {
StandardClassIds.Any -> return false
// Float and Double effectively had non-trivial `equals` semantics while they don't have explicit overrides (see KT-50535)
StandardClassIds.Float, StandardClassIds.Double -> return true
}
// When the class belongs to a different module, "equals" contract might be changed without re-compilation
// But since we had such behavior in FE1.0, it might be too strict to prohibit it now, especially once there's a lot of cases
// when different modules belong to a single project, so they're totally safe (see KT-50534)
// if (moduleData != session.moduleData) {
// return true
// }
val ownerTag = this.toLookupTag()
return this.unsubstitutedScope(
session, components.scopeSession, withForcedTypeCalculator = false, memberRequiredPhase = FirResolvePhase.STATUS
).getFunctions(OperatorNameConventions.EQUALS).any {
!it.isSubstitutionOrIntersectionOverride && it.fir.isEquals(session) && ownerTag.isRealOwnerOf(it)
}
}
/**
* Determines if type smart-casting to the specified [ClassId] can be performed when values are
* compared via equality. Because this is determined using the ClassId, only standard built-in
* types are considered.
*/
private fun isSmartcastPrimitive(classId: ClassId?): Boolean {
return when (classId) {
// Support other primitives as well: KT-62246.
StandardClassIds.String,
-> true
else -> false
}
}
// ----------------------------------- Jump -----------------------------------
fun enterJump(jump: FirJump<*>) {
graphBuilder.enterJump(jump)
}
fun exitJump(jump: FirJump<*>) {
graphBuilder.exitJump(jump).mergeIncomingFlow()
}
// ----------------------------------- Check not null call -----------------------------------
fun enterCheckNotNullCall() {
graphBuilder.enterCall()
}
fun exitCheckNotNullCall(checkNotNullCall: FirCheckNotNullCall, callCompleted: Boolean) {
graphBuilder.exitCheckNotNullCall(checkNotNullCall, callCompleted).mergeIncomingFlow { _, flow ->
val argumentVariable = getOrCreateVariableIfRealAndStable(flow, checkNotNullCall.argument) ?: return@mergeIncomingFlow
flow.commitOperationStatement(argumentVariable notEq null)
}
}
// ----------------------------------- When -----------------------------------
fun enterWhenExpression(whenExpression: FirWhenExpression) {
graphBuilder.enterWhenExpression(whenExpression).mergeIncomingFlow()
}
fun enterWhenBranchCondition(whenBranch: FirWhenBranch) {
graphBuilder.enterWhenBranchCondition(whenBranch).mergeWhenBranchEntryFlow()
}
private fun CFGNode<*>.mergeWhenBranchEntryFlow() = mergeIncomingFlow { _, flow ->
val previousConditionExitNode = previousNodes.singleOrNull() as? WhenBranchConditionExitNode ?: return@mergeIncomingFlow
val previousCondition = previousConditionExitNode.fir.condition
if (!previousCondition.resolvedType.isBoolean) return@mergeIncomingFlow
val previousConditionVariable = getVariableIfStable(flow, previousCondition) ?: return@mergeIncomingFlow
flow.commitOperationStatement(previousConditionVariable eq false)
}
fun exitWhenBranchCondition(whenBranch: FirWhenBranch) {
val (conditionExitNode, resultEnterNode) = graphBuilder.exitWhenBranchCondition(whenBranch)
conditionExitNode.mergeIncomingFlow()
resultEnterNode.mergeIncomingFlow { _, flow ->
// If the condition is invalid, don't generate smart casts to Any or Boolean.
if (whenBranch.condition.resolvedType.isBoolean) {
val conditionVariable = getVariableIfStable(flow, whenBranch.condition) ?: return@mergeIncomingFlow
flow.commitOperationStatement(conditionVariable eq true)
}
}
}
fun exitWhenBranchResult(whenBranch: FirWhenBranch) {
graphBuilder.exitWhenBranchResult(whenBranch).mergeIncomingFlow()
}
fun exitWhenExpression(whenExpression: FirWhenExpression, callCompleted: Boolean) {
val (whenExitNode, syntheticElseNode) = graphBuilder.exitWhenExpression(whenExpression, callCompleted)
syntheticElseNode?.mergeWhenBranchEntryFlow()
whenExitNode.mergeIncomingFlow()
}
fun exitWhenSubjectExpression(expression: FirWhenSubjectExpression) {
graphBuilder.exitWhenSubjectExpression(expression).mergeIncomingFlow()
}
// ----------------------------------- While Loop -----------------------------------
fun enterWhileLoop(loop: FirLoop) {
val assignedInside = context.variableAssignmentAnalyzer.enterLoop(loop)
val (loopEnterNode, loopConditionEnterNode) = graphBuilder.enterWhileLoop(loop)
loopEnterNode.mergeIncomingFlow()
loopConditionEnterNode.mergeIncomingFlow { _, flow -> enterRepeatableStatement(flow, assignedInside) }
}
fun exitWhileLoopCondition(loop: FirLoop) {
val (loopConditionExitNode, loopBlockEnterNode) = graphBuilder.exitWhileLoopCondition(loop)
loopConditionExitNode.mergeIncomingFlow()
loopBlockEnterNode.mergeIncomingFlow { _, flow ->
if (loop.condition.resolvedType.isBoolean) {
val conditionVariable = getVariableIfStable(flow, loop.condition) ?: return@mergeIncomingFlow
flow.commitOperationStatement(conditionVariable eq true)
}
}
}
fun exitWhileLoop(loop: FirLoop) {
val assignedInside = context.variableAssignmentAnalyzer.exitLoop()
val (conditionEnterNode, blockExitNode, exitNode) = graphBuilder.exitWhileLoop(loop)
blockExitNode.mergeIncomingFlow()
exitNode.mergeIncomingFlow { path, flow ->
processWhileLoopExit(path, flow, exitNode, conditionEnterNode, assignedInside)
processLoopExit(flow, exitNode, exitNode.firstPreviousNode as LoopConditionExitNode)
}
}
private fun processWhileLoopExit(
path: FlowPath,
flow: MutableFlow,
node: LoopExitNode,
conditionEnterNode: LoopConditionEnterNode,
reassigned: Set,
) {
if (reassigned.isEmpty()) return
val possiblyChangedVariables = variableStorage.realVariables.values.filter { it.identifier.symbol in reassigned }
if (possiblyChangedVariables.isEmpty()) return
// While analyzing the loop we might have added some backwards jumps to `conditionEnterNode` which weren't
// there at the time its flow was computed - which is why we erased all information about `possiblyChangedVariables`
// from it. Now that we have those edges, we can restore type information for the code after the loop.
val conditionEnterFlow = conditionEnterNode.getFlow(path)
val loopEnterAndContinueFlows = conditionEnterNode.previousLiveNodes.map { it.getFlow(path) }
val conditionExitAndBreakFlows = node.previousLiveNodes.map { it.getFlow(path) }
possiblyChangedVariables.forEach { variable ->
// The statement about `variable` in `conditionEnterFlow` should be empty, so to obtain the new statement
// we can simply add the now-known input to whatever was inferred from nothing so long as the value is the same.
val toAdd = logicSystem.or(loopEnterAndContinueFlows.map { it.getTypeStatement(variable) ?: return@forEach })
?.takeIf { it.isNotEmpty } ?: return@forEach
val newStatement = logicSystem.or(conditionExitAndBreakFlows.map {
val atExit = it.getTypeStatement(variable)
if (logicSystem.isSameValueIn(conditionEnterFlow, it, variable)) {
logicSystem.and(atExit, toAdd)
} else {
atExit ?: return@forEach
}
}) ?: return@forEach
flow.addTypeStatement(newStatement)
}
}
private fun processLoopExit(flow: MutableFlow, node: LoopExitNode, conditionExitNode: LoopConditionExitNode) {
if (conditionExitNode.isDead || node.previousNodes.count { !it.isDead } > 1) return
if (conditionExitNode.fir.resolvedType.isBoolean) {
val variable = getVariableIfStable(flow, conditionExitNode.fir) ?: return
flow.commitOperationStatement(variable eq false)
}
}
private fun enterRepeatableStatement(flow: MutableFlow, reassigned: Set) {
if (reassigned.isEmpty()) return
val possiblyChangedVariables = variableStorage.realVariables.values.filter { it.identifier.symbol in reassigned }
for (variable in possiblyChangedVariables) {
logicSystem.recordNewAssignment(flow, variable, context.newAssignmentIndex())
}
}
// ----------------------------------- Do while Loop -----------------------------------
fun enterDoWhileLoop(loop: FirLoop) {
val assignedInside = context.variableAssignmentAnalyzer.enterLoop(loop)
val (loopEnterNode, loopBlockEnterNode) = graphBuilder.enterDoWhileLoop(loop)
loopEnterNode.mergeIncomingFlow { _, flow -> enterRepeatableStatement(flow, assignedInside) }
loopBlockEnterNode.mergeIncomingFlow()
}
fun enterDoWhileLoopCondition(loop: FirLoop) {
val (loopBlockExitNode, loopConditionEnterNode) = graphBuilder.enterDoWhileLoopCondition(loop)
loopBlockExitNode.mergeIncomingFlow()
loopConditionEnterNode.mergeIncomingFlow()
}
fun exitDoWhileLoop(loop: FirLoop) {
context.variableAssignmentAnalyzer.exitLoop()
val (loopConditionExitNode, loopExitNode) = graphBuilder.exitDoWhileLoop(loop)
loopConditionExitNode.mergeIncomingFlow()
loopExitNode.mergeIncomingFlow { _, flow ->
processLoopExit(flow, loopExitNode, loopConditionExitNode)
}
}
// ----------------------------------- Try-catch-finally -----------------------------------
fun enterTryExpression(tryExpression: FirTryExpression) {
val (tryExpressionEnterNode, tryMainBlockEnterNode) = graphBuilder.enterTryExpression(tryExpression)
tryExpressionEnterNode.mergeIncomingFlow()
tryMainBlockEnterNode.mergeIncomingFlow()
}
fun exitTryMainBlock() {
graphBuilder.exitTryMainBlock().mergeIncomingFlow()
}
fun enterCatchClause(catch: FirCatch) {
graphBuilder.enterCatchClause(catch).mergeIncomingFlow()
}
fun exitCatchClause(catch: FirCatch) {
graphBuilder.exitCatchClause(catch).mergeIncomingFlow()
}
fun enterFinallyBlock() {
val node = graphBuilder.enterFinallyBlock()
node.mergeIncomingFlow()
node.createAlternateFlows()
}
fun exitFinallyBlock() {
graphBuilder.exitFinallyBlock().mergeIncomingFlow()
}
fun exitTryExpression(callCompleted: Boolean) {
graphBuilder.exitTryExpression(callCompleted).mergeIncomingFlow()
}
// ----------------------------------- Resolvable call -----------------------------------
fun exitQualifiedAccessExpression(qualifiedAccessExpression: FirQualifiedAccessExpression) {
graphBuilder.exitQualifiedAccessExpression(qualifiedAccessExpression).mergeIncomingFlow { _, flow ->
processConditionalContract(flow, qualifiedAccessExpression, callArgsExit = null)
}
}
fun exitSmartCastExpression(smartCastExpression: FirSmartCastExpression) {
graphBuilder.exitSmartCastExpression(smartCastExpression).mergeIncomingFlow()
}
fun enterSafeCallAfterNullCheck(safeCall: FirSafeCallExpression) {
graphBuilder.enterSafeCall(safeCall).mergeIncomingFlow { _, flow ->
val receiverVariable = getOrCreateVariableIfRealAndStable(flow, safeCall.receiver) ?: return@mergeIncomingFlow
flow.commitOperationStatement(receiverVariable notEq null)
}
}
fun exitSafeCall(safeCall: FirSafeCallExpression) {
val node = graphBuilder.exitSafeCall()
node.mergeIncomingFlow { path, flow ->
// If there is only 1 previous node, then this is LHS of `a?.b ?: c`; then the null-case
// edge from `a` goes directly to `c` and this node's flow already assumes `b` executed.
if (node.previousNodes.size < 2) return@mergeIncomingFlow
// Otherwise if the result is non-null, then `b` executed, which implies `a` is not null
// and every statement from `b` holds.
val expressionVariable = getOrCreateVariableIfStable(flow, safeCall) ?: return@mergeIncomingFlow
val previousFlow = node.lastPreviousNode.getFlow(path)
flow.addAllConditionally(expressionVariable notEq null, previousFlow)
/*
* If we have some implication about rhs of safe call in the previous flow, then we can expand them to the whole
* safe call variable
*
* a?.foo() // original call
* subj.foo() // rhs of safe call
*
* previousFlow:
* - subj.foo() == True -> X_1
* - subj.foo() == False -> X_2
* - subj.foo() != Null -> X_3
* - subj.foo() == Null -> X_4
*
* flow:
* - a?.foo() == True -> X_1
* - a?.foo() == False -> X_2
* - a?.foo() != Null -> X_3
*
* Note that we don't pass implication with 'subj.foo() == Null' in the condition because there are two different ways
* why `a?.foo()` may be `null` -- it's either `a` is `null` or `subj.foo()` is `null`, and we can't differentiate between
* them
*
* Also, an implementation note: in the following lines we use `expressionVariable` made on safe call expression when looking
* for implications from previous flow in the subject, because VariableStorage doesn't differ between the whole safe call
* and synthetically generated selector, see [variableStorage.getOrCreate] implementation
*/
previousFlow.implications[expressionVariable]?.forEach {
if (it.condition.operation != Operation.EqNull) {
flow.addImplication(it)
}
}
}
}
fun exitResolvedQualifierNode(resolvedQualifier: FirResolvedQualifier) {
graphBuilder.exitResolvedQualifierNode(resolvedQualifier).mergeIncomingFlow()
}
fun enterCallArguments(call: FirStatement, arguments: List) {
val lambdas = arguments.mapNotNull { it.unwrapAnonymousFunctionExpression() }
graphBuilder.enterCall(lambdas.mapTo(mutableSetOf()) { it.symbol })
context.variableAssignmentAnalyzer.enterFunctionCall(lambdas)
graphBuilder.enterCallArguments(call, lambdas)?.mergeIncomingFlow()
}
fun exitCallArguments() {
val (splitNode, exitNode) = graphBuilder.exitCallArguments()
splitNode?.mergeIncomingFlow()
if (exitNode != null) {
exitNode.mergeIncomingFlow()
// Reset implicit receivers back to their state *before* call arguments but after explicit receiver
// as tower resolve will use receiver types to lookup functions after call arguments have been processed.
// TODO(KT-64094): Consider moving logic to tower resolution instead.
resetSmartCastPositionTo(exitNode.explicitReceiverExitNode.flow)
}
}
fun exitCallExplicitReceiver() {
graphBuilder.exitCallExplicitReceiver()
}
fun exitFunctionCall(functionCall: FirFunctionCall, callCompleted: Boolean) {
context.variableAssignmentAnalyzer.exitFunctionCall(callCompleted)
val node = graphBuilder.exitFunctionCall(functionCall, callCompleted)
node.mergeIncomingFlow { _, flow ->
val callArgsExit = node.previousNodes.singleOrNull { it is FunctionCallArgumentsExitNode }
processConditionalContract(flow, functionCall, callArgsExit?.flow)
}
}
fun exitDelegatedConstructorCall(call: FirDelegatedConstructorCall, callCompleted: Boolean) {
context.variableAssignmentAnalyzer.exitFunctionCall(callCompleted)
graphBuilder.exitDelegatedConstructorCall(call, callCompleted).mergeIncomingFlow()
}
fun enterStringConcatenationCall() {
graphBuilder.enterCall()
}
fun exitStringConcatenationCall(call: FirStringConcatenationCall) {
graphBuilder.exitStringConcatenationCall(call).mergeIncomingFlow()
}
private fun FirStatement.orderedArguments(callee: FirFunction): Array? {
fun FirQualifiedAccessExpression.firstReceiver(): FirExpression? {
val candidate = candidate()
// Processing case with a candidate might be necessary for PCLA, because even top-level calls might be not fully completed
if (candidate != null) {
return candidate.chosenExtensionReceiverExpression() ?: candidate.dispatchReceiverExpression()
}
return extensionReceiver ?: dispatchReceiver
}
val receiver = when (this) {
is FirQualifiedAccessExpression -> firstReceiver()
is FirVariableAssignment -> (lValue as? FirQualifiedAccessExpression)?.firstReceiver()
else -> null
}
return when (this) {
is FirFunctionCall -> {
// Processing case with a candidate might be necessary for PCLA, because even top-level calls might be not fully completed
val argumentToParameter = resolvedArgumentMapping ?: candidate()?.argumentMapping ?: return null
val parameterToArgument = argumentToParameter.entries.associate { it.value to it.key.unwrapArgument() }
Array(callee.valueParameters.size + 1) { i ->
if (i > 0) parameterToArgument[callee.valueParameters[i - 1]] else receiver
}
}
is FirQualifiedAccessExpression -> arrayOf(receiver)
is FirVariableAssignment -> arrayOf(receiver, rValue)
else -> return null
}
}
private fun processConditionalContract(
flow: MutableFlow,
qualifiedAccess: FirStatement,
callArgsExit: PersistentFlow?,
) {
// contracts has no effect on non-body resolve stages
if (!components.transformer.baseTransformerPhase.isBodyResolve) return
val callee = when (qualifiedAccess) {
is FirFunctionCall -> qualifiedAccess.calleeReference.symbol?.fir as? FirSimpleFunction
is FirQualifiedAccessExpression -> qualifiedAccess.calleeReference.symbol?.let { it.fir as? FirProperty }?.getter
is FirVariableAssignment -> qualifiedAccess.calleeReference?.symbol?.let { it.fir as? FirProperty }?.setter
else -> null
} ?: return
if (callee.symbol.callableId == StandardClassIds.Callables.not) {
// Special hardcoded contract for Boolean.not():
// returns(true) implies (this == false)
// returns(false) implies (this == true)
return exitBooleanNot(flow, qualifiedAccess as FirFunctionCall)
}
val originalFunction = callee.originalIfFakeOverride()
val contractDescription = (originalFunction?.symbol ?: callee.symbol).resolvedContractDescription ?: return
val conditionalEffects = contractDescription.effects.mapNotNull { it.effect as? ConeConditionalEffectDeclaration }
if (conditionalEffects.isEmpty()) return
val arguments = qualifiedAccess.orderedArguments(callee) ?: return
val argumentVariables = Array(arguments.size) { i ->
arguments[i]?.let { argument ->
getOrCreateVariableIfRealAndStable(flow, argument)
// Only apply contract information to argument if it has not been reassigned in a lambda.
.takeIf { callArgsExit == null || isSameValueIn(callArgsExit, argument, flow) }
}
}
if (argumentVariables.all { it == null }) return
val typeParameters = callee.typeParameters
val typeArgumentsSubstitutor = if (typeParameters.isNotEmpty() && qualifiedAccess is FirQualifiedAccessExpression) {
@Suppress("UNCHECKED_CAST")
val substitutionFromArguments = typeParameters.zip(qualifiedAccess.typeArguments).map { (typeParameterRef, typeArgument) ->
typeParameterRef.symbol to typeArgument.toConeTypeProjection().type
}.filter { it.second != null }.toMap() as Map
ConeSubstitutorByMap.create(substitutionFromArguments, components.session)
} else {
ConeSubstitutor.Empty
}
val substitutor = if (originalFunction == null) {
typeArgumentsSubstitutor
} else {
val map = originalFunction.symbol.typeParameterSymbols.zip(typeParameters.map { it.symbol.toConeType() }).toMap()
ConeSubstitutorByMap.create(map, components.session).chain(typeArgumentsSubstitutor)
}
for (conditionalEffect in conditionalEffects) {
val effect = conditionalEffect.effect as? ConeReturnsEffectDeclaration ?: continue
val operation = effect.value.toOperation()
val statements =
logicSystem.approveContractStatement(conditionalEffect.condition, argumentVariables, substitutor) {
logicSystem.approveOperationStatement(flow, it, removeApprovedOrImpossible = operation == null)
} ?: continue // TODO: do what if the result is known to be false?
if (operation == null) {
flow.addAllStatements(statements)
} else {
val functionCallVariable = getOrCreateVariableIfStable(flow, qualifiedAccess)
if (functionCallVariable != null) {
flow.addAllConditionally(OperationStatement(functionCallVariable, operation), statements)
}
}
}
}
fun exitLiteralExpression(literalExpression: FirLiteralExpression<*>) {
if (literalExpression.isResolved) return
graphBuilder.exitLiteralExpression(literalExpression).mergeIncomingFlow()
}
fun exitLocalVariableDeclaration(variable: FirProperty, hadExplicitType: Boolean) {
graphBuilder.exitVariableDeclaration(variable).mergeIncomingFlow { _, flow ->
val initializer = variable.initializer ?: return@mergeIncomingFlow
exitVariableInitialization(flow, initializer, variable, assignmentLhs = null, hadExplicitType)
}
}
fun exitVariableAssignment(assignment: FirVariableAssignment) {
val property = assignment.calleeReference?.toResolvedPropertySymbol()?.fir
if (property != null && property.isLocal) {
context.variableAssignmentAnalyzer.visitAssignment(property, assignment.rValue.resolvedType)
}
graphBuilder.exitVariableAssignment(assignment).mergeIncomingFlow { _, flow ->
property ?: return@mergeIncomingFlow
if (property.isLocal || property.isVal) {
exitVariableInitialization(flow, assignment.rValue, property, assignment.lValue, hasExplicitType = false)
} else {
val variable = getRealVariableWithoutUnwrappingAlias(flow, assignment)
if (variable != null) {
logicSystem.recordNewAssignment(flow, variable, context.newAssignmentIndex())
}
}
processConditionalContract(flow, assignment, callArgsExit = null)
}
}
private fun exitVariableInitialization(
flow: MutableFlow,
initializer: FirExpression,
property: FirProperty,
assignmentLhs: FirExpression?,
hasExplicitType: Boolean,
) {
val propertyVariable = getOrCreateRealVariableWithoutUnwrappingAliasForPropertyInitialization(
flow, property.symbol, assignmentLhs ?: property
) ?: return
val isAssignment = assignmentLhs != null
if (isAssignment) {
logicSystem.recordNewAssignment(flow, propertyVariable, context.newAssignmentIndex())
}
val stability = propertyVariable.getStability(flow, components.session)
if (stability == SmartcastStability.STABLE_VALUE || stability == SmartcastStability.CAPTURED_VARIABLE) {
val initializerVariable = getOrCreateIfRealWithoutUnwrappingAlias(flow, initializer)
if (!hasExplicitType && initializerVariable is RealVariable &&
initializerVariable.getStability(flow, initializer, targetTypes = null) == SmartcastStability.STABLE_VALUE
) {
// val a = ...
// val b = a
// if (b != null) { /* a != null */ }
logicSystem.addLocalVariableAlias(flow, propertyVariable, flow.unwrapVariable(initializerVariable))
} else if (initializerVariable != null && !(property.isLocal && property.isVar)) {
// Case 1:
// val b = x is String // initializer is synthetic, condition is boolean
// if (b) { /* x is String */ }
// Case 2:
// val b = x?.foo() // initializer is synthetic, condition is on nullability
// if (b != null) { /* x != null */ }
// Case 3:
// val b = x?.foo // if `foo` is mutable, then initializer is real, but unstable
// if (b != null) { /* x != null, but re-reading x.foo could produce null */ }
val unwrappedVariable =
if (initializerVariable is RealVariable) flow.unwrapVariable(initializerVariable) else initializerVariable
val translateAll = components.session.languageVersionSettings.supportsFeature(LanguageFeature.DfaBooleanVariables)
logicSystem.translateVariableFromConditionInStatements(flow, unwrappedVariable, propertyVariable) {
it.takeIf { translateAll || it.condition.operation == Operation.EqNull || it.condition.operation == Operation.NotEqNull }
}
}
}
if (isAssignment) {
// `propertyVariable` can be an alias to `initializerVariable`, in which case this will add
// a redundant type statement which is fine...probably
flow.addTypeStatement(flow.unwrapVariable(propertyVariable) typeEq initializer.resolvedType)
}
}
fun exitThrowExceptionNode(throwExpression: FirThrowExpression) {
graphBuilder.exitThrowExceptionNode(throwExpression).mergeIncomingFlow()
}
// ----------------------------------- Boolean operators -----------------------------------
fun enterBinaryLogicExpression(binaryLogicExpression: FirBinaryLogicExpression) {
graphBuilder.enterBinaryLogicExpression(binaryLogicExpression).mergeIncomingFlow()
}
fun exitLeftBinaryLogicExpressionArgument(binaryLogicExpression: FirBinaryLogicExpression) {
val (leftExitNode, rightEnterNode) = graphBuilder.exitLeftBinaryLogicExpressionArgument(binaryLogicExpression)
leftExitNode.mergeIncomingFlow()
rightEnterNode.mergeIncomingFlow { _, flow ->
val leftOperandVariable = getVariableIfStable(flow, binaryLogicExpression.leftOperand) ?: return@mergeIncomingFlow
val isAnd = binaryLogicExpression.kind == LogicOperationKind.AND
flow.commitOperationStatement(leftOperandVariable eq isAnd)
}
}
fun exitBinaryLogicExpression(binaryLogicExpression: FirBinaryLogicExpression) {
graphBuilder.exitBinaryLogicExpression(binaryLogicExpression).mergeBinaryLogicOperatorFlow()
}
private fun AbstractBinaryExitNode.mergeBinaryLogicOperatorFlow() = mergeIncomingFlow { path, flow ->
val isAnd = fir.kind == LogicOperationKind.AND
val flowFromLeft = leftOperandNode.getFlow(path)
val flowFromRight = rightOperandNode.getFlow(path)
val leftVariable = getVariableIfStable(flowFromLeft, fir.leftOperand)
val leftIsBoolean = leftVariable != null && fir.leftOperand.resolvedType.isBoolean
if (!leftOperandNode.isDead && rightOperandNode.isDead) {
// If the right operand does not terminate, then we know that the value of the entire expression
// has to be saturating (true for or, false for and), and it has to be produced by the left operand.
if (leftIsBoolean) {
// Not checking for reassignments is safe since RHS did not execute.
flow.commitOperationStatement(leftVariable!! eq !isAnd)
}
} else {
val rightVariable = getVariableIfStable(flowFromRight, fir.rightOperand)
val rightIsBoolean = rightVariable != null && fir.rightOperand.resolvedType.isBoolean
val operatorVariable = variableStorage.createSynthetic(fir)
// If `left && right` is true, then both are evaluated to true. If `left || right` is false, then both are false.
// Approved type statements for RHS already contain everything implied by the corresponding value of LHS.
val bothEvaluated = operatorVariable eq isAnd
flow.addAllConditionally(bothEvaluated, flowFromRight)
if (rightIsBoolean) {
flow.addAllConditionally(bothEvaluated, logicSystem.approveOperationStatement(flowFromRight, rightVariable!! eq isAnd))
}
// If `left && right` is false, then either `left` is false, or both were evaluated and `right` is false.
// If `left || right` is true, then either `left` is true, or both were evaluated and `right` is true.
if (leftIsBoolean && rightIsBoolean) {
flow.addAllConditionally(
operatorVariable eq !isAnd,
logicSystem.orForTypeStatements(
// Not checking for reassignments is safe since we will only take statements that are also true in RHS
// (so they're true regardless of whether the variable ends up being reassigned or not).
logicSystem.approveOperationStatement(flowFromLeft, leftVariable!! eq !isAnd),
// TODO: and(approved from right, ...)? FE1.0 doesn't seem to handle that correctly either. KT-59690
// if (x is A || whatever(x as B)) { /* x is (A | B) */ }
logicSystem.approveOperationStatement(flowFromRight, rightVariable!! eq !isAnd),
)
)
}
}
}
private fun exitBooleanNot(flow: MutableFlow, expression: FirFunctionCall) {
val argumentVariable = getVariableIfStable(
flow,
// Processing case with a candidate might be necessary for PCLA, because even top-level calls might be not fully completed
expression.candidate()?.dispatchReceiverExpression() ?: expression.dispatchReceiver!!
) ?: return
val expressionVariable = variableStorage.createSynthetic(expression)
// Alternatively: (expression == true => argument == false) && (expression == false => argument == true)
// Which implementation is faster and/or consumes less memory is an open question.
logicSystem.translateVariableFromConditionInStatements(flow, argumentVariable, expressionVariable) {
when (it.condition.operation) {
Operation.EqTrue -> expressionVariable eq false implies it.effect
Operation.EqFalse -> expressionVariable eq true implies it.effect
// `argumentVariable eq/notEq null` shouldn't exist since `argumentVariable` is presumably `Boolean`
else -> null
}
}
}
// ----------------------------------- Annotations -----------------------------------
fun enterAnnotation() {
graphBuilder.enterFakeExpression().mergeIncomingFlow()
}
fun exitAnnotation() {
graphBuilder.exitFakeExpression()
}
// ----------------------------------- Init block -----------------------------------
fun enterInitBlock(initBlock: FirAnonymousInitializer) {
graphBuilder.enterInitBlock(initBlock).mergeIncomingFlow()
}
fun exitInitBlock(): ControlFlowGraph {
val (node, controlFlowGraph) = graphBuilder.exitInitBlock()
node.mergeIncomingFlow()
controlFlowGraph.completePostponedNodes()
return controlFlowGraph
}
// ----------------------------------- Contract description -----------------------------------
fun enterContractDescription() {
graphBuilder.enterFakeExpression().mergeIncomingFlow()
}
fun exitContractDescription() {
graphBuilder.exitFakeExpression()
}
// ----------------------------------- Elvis -----------------------------------
fun enterElvis(elvisExpression: FirElvisExpression) {
graphBuilder.enterElvis(elvisExpression)
}
fun exitElvisLhs(elvisExpression: FirElvisExpression) {
val (lhsExitNode, lhsIsNotNullNode, rhsEnterNode) = graphBuilder.exitElvisLhs(elvisExpression)
lhsExitNode.mergeIncomingFlow()
fun getLhsVariable(path: FlowPath): DataFlowVariable? =
getOrCreateVariableIfRealAndStable(lhsExitNode.getFlow(path), elvisExpression.lhs)
lhsIsNotNullNode.mergeIncomingFlow { path, flow ->
getLhsVariable(path)?.let { flow.commitOperationStatement(it notEq null) }
}
rhsEnterNode.mergeIncomingFlow { path, flow ->
getLhsVariable(path)?.let { flow.commitOperationStatement(it eq null) }
}
}
fun exitElvis(elvisExpression: FirElvisExpression, isLhsNotNull: Boolean, callCompleted: Boolean) {
val node = graphBuilder.exitElvis(isLhsNotNull, callCompleted)
node.mergeIncomingFlow { path, flow ->
// If LHS is never null, then the edge from RHS is dead and this node's flow already contains
// all statements from LHS unconditionally.
if (isLhsNotNull) return@mergeIncomingFlow
val elvisVariable by lazy { variableStorage.createSynthetic(elvisExpression) }
// If (x ?: null) != null then x != null
@OptIn(UnresolvedExpressionTypeAccess::class) // Lambdas can have unresolved type here, see KT-61837
if (elvisExpression.rhs.coneTypeOrNull?.isNullableNothing == true) {
val lhsVariable = getOrCreateVariableIfRealAndStable(flow, elvisExpression.lhs)
if (lhsVariable != null) {
flow.addImplication((elvisVariable notEq null) implies (lhsVariable notEq null))
}
}
// If (null ?: x) != null then x != null
@OptIn(UnresolvedExpressionTypeAccess::class) // Lambdas can have unresolved type here, see KT-61837
if (elvisExpression.lhs.coneTypeOrNull?.isNullableNothing == true) {
val rhsVariable = getOrCreateVariableIfRealAndStable(flow, elvisExpression.rhs)
if (rhsVariable != null) {
flow.addImplication((elvisVariable notEq null) implies (rhsVariable notEq null))
}
}
// For any predicate P(x), if P(v) != P(u ?: v) then u != null. In general this requires two levels of
// implications, but for constant v the logic system can handle some basic cases of P(x).
val rhs = (elvisExpression.rhs as? FirLiteralExpression<*>)?.value as? Boolean
if (rhs != null) {
flow.addAllConditionally(elvisVariable eq !rhs, node.firstPreviousNode.getFlow(path))
}
}
}
// Callable reference
fun exitCallableReference(callableReferenceAccess: FirCallableReferenceAccess) {
graphBuilder.exitCallableReference(callableReferenceAccess).mergeIncomingFlow()
}
fun exitGetClassCall(getClassCall: FirGetClassCall) {
graphBuilder.exitGetClassCall(getClassCall).mergeIncomingFlow()
}
// ------------------------------------------------------ Utils ------------------------------------------------------
// The data flow state from which type statements are taken during expression resolution.
// Should normally be equal to `graphBuilder.lastNode`, but one exception is between exiting call
// arguments and exiting the call itself, where smart casting does not use information from the arguments.
private var currentSmartCastPosition: Flow? = null
private fun CFGNode<*>.buildDefaultFlow(
builder: (FlowPath, MutableFlow) -> Unit,
): MutableFlow {
val previousFlows = mutableListOf()
val statementFlows = mutableListOf()
for (node in previousNodes) {
val edge = edgeFrom(node)
if (!usedInDfa(edge)) continue
// `MergePostponedLambdaExitsNode` nodes form a parallel data flow graph. We never compute
// data flow for any of them until reaching a completed call.
if (node is MergePostponedLambdaExitsNode && !node.flowInitialized) node.mergeIncomingFlow()
// For CFGNodes that are the end of alternate flows, use the alternate flow associated with the edge label.
val flow = if (node is FinallyBlockExitNode) {
val alternatePath = FlowPath.CfgEdge(edge.label, node.fir)
node.getAlternateFlow(alternatePath) ?: node.flow
} else {
node.flow
}
previousFlows.add(flow)
if (edge.label != PostponedPath) {
statementFlows.add(flow)
}
}
val result = logicSystem.joinFlow(previousFlows, statementFlows, isUnion)
if (graphBuilder.lastNodeOrNull == this) {
if (currentSmartCastPosition == null || currentSmartCastPosition != previousFlows.singleOrNull()) {
// Force-update the receiver stack as merging multiple flows might have changed receivers' type statements.
resetSmartCastPositionTo(result)
} else {
// Receiver stack should already be up-to-date, only need to swap the flow for explicit lookups.
currentSmartCastPosition = result
}
}
builder(FlowPath.Default, result)
return result
}
private fun CFGNode<*>.buildAlternateFlow(
path: FlowPath.CfgEdge,
builder: (FlowPath, MutableFlow) -> Unit,
): MutableFlow {
val alternateFlowStart = this is FinallyBlockEnterNode
val previousFlows = mutableListOf()
val statementFlows = mutableListOf()
for (node in previousNodes) {
val edge = edgeFrom(node)
if (!usedInDfa(edge)) continue
// For CFGNodes that cause alternate flow paths to be created, only edges with matching labels should be merged. However, when
// an alternate flow is being propagated through one of these CFGNodes - i.e., when the FirElements do not match - only
// NormalPath edges should be merged.
if (alternateFlowStart) {
if (path.fir == this.fir && edge.label != path.label) {
continue
} else if (path.fir != this.fir && edge.label != NormalPath) {
continue
}
}
val flow = node.getAlternateFlow(path) ?: node.flow
previousFlows.add(flow)
if (edge.label != PostponedPath) {
statementFlows.add(flow)
}
}
val result = logicSystem.joinFlow(previousFlows, statementFlows, isUnion)
builder(path, result)
return result
}
// Generally when calling some method on `graphBuilder`, one of the nodes it returns is the new `lastNode`.
// In that case `mergeIncomingFlow` will automatically ensure consistency once called on that node.
@OptIn(CfgInternals::class)
private fun CFGNode<*>.mergeIncomingFlow(
builder: (FlowPath, MutableFlow) -> Unit = { _, _ -> },
) {
// Always build the default flow path for all nodes.
val mutableDefaultFlow = buildDefaultFlow(builder)
val defaultFlow = mutableDefaultFlow.freeze().also { this.flow = it }
if (currentSmartCastPosition === mutableDefaultFlow) {
currentSmartCastPosition = defaultFlow
}
// Propagate alternate flows from previous nodes.
propagateAlternateFlows(builder)
}
@OptIn(CfgInternals::class)
private fun CFGNode<*>.propagateAlternateFlows(
builder: (FlowPath, MutableFlow) -> Unit,
) {
val propagatedPaths = mutableSetOf()
for (node in previousNodes) {
if (node.alternateFlowPaths.isEmpty()) continue
val edge = edgeFrom(node)
// Only propagate alternate flows which originate along a normal path edge and are used in DFA.
if (edge.label != NormalPath || !usedInDfa(edge)) continue
for (path in node.alternateFlowPaths) {
// If the source node is the end of alternate flows, do not propagate the alternate flows which have ended.
if (path !is FlowPath.CfgEdge || !graphBuilder.withinFinallyBlock(path.fir)) continue
if (propagatedPaths.add(path)) {
addAlternateFlow(path, buildAlternateFlow(path, builder).freeze())
}
}
}
}
@OptIn(CfgInternals::class)
private fun CFGNode<*>.createAlternateFlows(
builder: (FlowPath, MutableFlow) -> Unit = { _, _ -> },
) {
val createdLabels = mutableSetOf()
for (node in previousNodes) {
val edge = edgeFrom(node)
if (edge.label == UncaughtExceptionPath || !usedInDfa(edge)) continue
if (createdLabels.add(edge.label)) {
val path = FlowPath.CfgEdge(edge.label, this.fir)
addAlternateFlow(path, buildAlternateFlow(path, builder).freeze())
}
}
}
private fun CFGNode<*>.getFlow(path: FlowPath): PersistentFlow {
return when (path) {
FlowPath.Default -> flow
else -> getAlternateFlow(path) ?: error("no alternate flow for $path")
}
}
private fun ControlFlowGraph.completePostponedNodes() {
for (subGraph in subGraphs) {
subGraph.completePostponedNodes()
}
for (node in nodes) {
if (node !is ClassExitNode && !node.flowInitialized) {
node.mergeIncomingFlow()
}
}
}
// In rare cases (like after exiting functions) after adding more nodes `graphBuilder` will revert the current
// state to a previously created node, so none of the nodes it returned are `lastNode` and `mergeIncomingFlow`
// will not ensure the smart cast position is auto-advanced. In that case an explicit call to `resetSmartCastPosition`
// is needed to roll back to that previously created node's state.
private fun resetSmartCastPosition() {
resetSmartCastPositionTo(graphBuilder.lastNodeOrNull?.flow)
}
// This method can be used to change the smart cast state to some node that is not the one at which the graph
// builder is currently stopped. This is temporary: adding any more nodes to the graph will restart tracking
// of the current position in the graph.
private fun resetSmartCastPositionTo(flow: Flow?) {
val previous = currentSmartCastPosition
if (previous == flow) return
receiverStack.forEach {
variableStorage.getLocalVariable(it.boundSymbol)?.let { variable ->
val newStatement = flow?.getTypeStatement(variable)
if (newStatement != previous?.getTypeStatement(variable)) {
receiverUpdated(it.boundSymbol, newStatement)
}
}
}
currentSmartCastPosition = flow
}
private fun isSameValueIn(other: PersistentFlow, fir: FirElement, original: MutableFlow): Boolean {
val variable = getRealVariableWithoutUnwrappingAlias(other, fir)
return variable == null || logicSystem.isSameValueIn(other, original, variable)
}
private fun MutableFlow.addImplication(statement: Implication) {
logicSystem.addImplication(this, statement)
}
private fun MutableFlow.addTypeStatement(info: TypeStatement) {
val newStatement = logicSystem.addTypeStatement(this, info) ?: return
if (newStatement.variable.isThisReference && this === currentSmartCastPosition) {
receiverUpdated(newStatement.variable.identifier.symbol, newStatement)
}
}
private fun MutableFlow.addAllStatements(statements: TypeStatements) {
statements.values.forEach { addTypeStatement(it) }
}
private fun MutableFlow.addAllConditionally(condition: OperationStatement, statements: TypeStatements) {
statements.values.forEach { addImplication(condition implies it) }
}
private fun MutableFlow.addAllConditionally(condition: OperationStatement, from: Flow) {
from.knownVariables.forEach {
// Only add the statement if this variable is not aliasing another in `this` (but it could be aliasing in `from`).
if (unwrapVariable(it) == it) addImplication(condition implies (from.getTypeStatement(it) ?: return@forEach))
}
}
private fun MutableFlow.commitOperationStatement(statement: OperationStatement) {
addAllStatements(logicSystem.approveOperationStatement(this, statement, removeApprovedOrImpossible = true))
}
private fun getVariableIfStable(flow: Flow, fir: FirElement): DataFlowVariable? {
return variableStorage.get(fir, unwrapAlias = { variable, element -> variable.unwrapIfStable(flow, element) })
}
private fun getOrCreateVariableIfRealAndStable(flow: Flow, fir: FirElement): DataFlowVariable? {
return variableStorage.getOrCreateIfReal(fir, unwrapAlias = { variable, element -> variable.unwrapIfStable(flow, element) })
}
private fun getOrCreateVariableIfStable(flow: Flow, fir: FirElement): DataFlowVariable? {
return variableStorage.getOrCreate(fir, unwrapAlias = { variable, element -> variable.unwrapIfStable(flow, element) })
}
private fun getRealVariableWithoutUnwrappingAlias(flow: Flow, fir: FirElement): RealVariable? {
return variableStorage.getRealVariableWithoutUnwrappingAlias(
fir, unwrapAlias = { variable, element -> variable.unwrapIfStable(flow, element) }
)
}
private fun getOrCreateIfRealWithoutUnwrappingAlias(flow: Flow, fir: FirElement): DataFlowVariable? {
val realFir = fir.unwrapElement()
return variableStorage.getOrCreateIfReal(realFir, unwrapAlias = { variable, element ->
// Do not unwrap the variable representing 'fir', but unwrap everything else.
if (element !== realFir) variable.unwrapIfStable(flow, element) else variable
})
}
private fun getOrCreateRealVariableWithoutUnwrappingAliasForPropertyInitialization(
flow: Flow,
symbol: FirBasedSymbol<*>,
fir: FirElement,
): RealVariable? {
return variableStorage.getOrCreateRealVariableWithoutUnwrappingAliasForPropertyInitialization(
symbol, fir, unwrap = { variable, element -> variable.unwrapIfStable(flow, element) }
)
}
private fun RealVariable.unwrapIfStable(flow: Flow, fir: FirElement): RealVariable? {
val unwrapped = flow.unwrapVariable(this)
if (unwrapped != this && getStability(flow, fir, targetTypes = null) != SmartcastStability.STABLE_VALUE) return null
return unwrapped
}
}