org.jetbrains.kotlin.codegen.optimization.fixStack.FixStackContext.kt Maven / Gradle / Ivy
/*
* Copyright 2010-2015 JetBrains s.r.o.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.jetbrains.kotlin.codegen.optimization.fixStack
import com.intellij.util.SmartList
import com.intellij.util.containers.SmartHashSet
import com.intellij.util.containers.Stack
import org.jetbrains.kotlin.codegen.inline.InlineCodegenUtil
import org.jetbrains.kotlin.codegen.optimization.common.InsnSequence
import org.jetbrains.kotlin.codegen.optimization.common.findPreviousOrNull
import org.jetbrains.kotlin.codegen.optimization.common.hasOpcode
import org.jetbrains.kotlin.codegen.optimization.fixStack.forEachPseudoInsn
import org.jetbrains.kotlin.codegen.pseudoInsns.PseudoInsn
import org.jetbrains.kotlin.codegen.pseudoInsns.parsePseudoInsnOrNull
import org.jetbrains.org.objectweb.asm.Opcodes
import org.jetbrains.org.objectweb.asm.tree.*
import java.util.*
import kotlin.properties.Delegates
internal class FixStackContext(val methodNode: MethodNode) {
val breakContinueGotoNodes = linkedSetOf()
val fakeAlwaysTrueIfeqMarkers = arrayListOf()
val fakeAlwaysFalseIfeqMarkers = arrayListOf()
val saveStackNodesForTryStartLabel = hashMapOf()
val saveStackMarkerForRestoreMarker = hashMapOf()
val restoreStackMarkersForSaveMarker = hashMapOf>()
val openingInlineMethodMarker = hashMapOf()
var consistentInlineMarkers: Boolean = true; private set
init {
insertTryCatchBlocksMarkers(methodNode)
val inlineMarkersStack = Stack()
InsnSequence(methodNode.instructions).forEach { insnNode ->
val pseudoInsn = parsePseudoInsnOrNull(insnNode)
when {
pseudoInsn == PseudoInsn.FIX_STACK_BEFORE_JUMP ->
visitFixStackBeforeJump(insnNode)
pseudoInsn == PseudoInsn.FAKE_ALWAYS_TRUE_IFEQ ->
visitFakeAlwaysTrueIfeq(insnNode)
pseudoInsn == PseudoInsn.FAKE_ALWAYS_FALSE_IFEQ ->
visitFakeAlwaysFalseIfeq(insnNode)
pseudoInsn == PseudoInsn.SAVE_STACK_BEFORE_TRY ->
visitSaveStackBeforeTry(insnNode)
pseudoInsn == PseudoInsn.RESTORE_STACK_IN_TRY_CATCH ->
visitRestoreStackInTryCatch(insnNode)
InlineCodegenUtil.isBeforeInlineMarker(insnNode) -> {
inlineMarkersStack.push(insnNode)
}
InlineCodegenUtil.isAfterInlineMarker(insnNode) -> {
assert(inlineMarkersStack.isNotEmpty()) { "Mismatching after inline method marker at ${indexOf(insnNode)}" }
openingInlineMethodMarker[insnNode] = inlineMarkersStack.pop()
}
}
}
if (inlineMarkersStack.isNotEmpty()) {
consistentInlineMarkers = false
}
}
private fun visitFixStackBeforeJump(insnNode: AbstractInsnNode) {
val next = insnNode.next
assert(next.opcode == Opcodes.GOTO) { "${indexOf(insnNode)}: should be followed by GOTO" }
breakContinueGotoNodes.add(next as JumpInsnNode)
}
private fun visitFakeAlwaysTrueIfeq(insnNode: AbstractInsnNode) {
assert(insnNode.next.opcode == Opcodes.IFEQ) { "${indexOf(insnNode)}: should be followed by IFEQ" }
fakeAlwaysTrueIfeqMarkers.add(insnNode)
}
private fun visitFakeAlwaysFalseIfeq(insnNode: AbstractInsnNode) {
assert(insnNode.next.opcode == Opcodes.IFEQ) { "${indexOf(insnNode)}: should be followed by IFEQ" }
fakeAlwaysFalseIfeqMarkers.add(insnNode)
}
private fun visitSaveStackBeforeTry(insnNode: AbstractInsnNode) {
val tryStartLabel = insnNode.next
assert(tryStartLabel is LabelNode) { "${indexOf(insnNode)}: save should be followed by a label" }
saveStackNodesForTryStartLabel[tryStartLabel as LabelNode] = insnNode
}
private fun visitRestoreStackInTryCatch(insnNode: AbstractInsnNode) {
val restoreLabel = insnNode.findPreviousOrNull { it.hasOpcode() }!!.findPreviousOrNull { it is LabelNode || it.hasOpcode() }!!
if (restoreLabel !is LabelNode) {
throw AssertionError("${indexOf(insnNode)}: restore should be preceded by a catch block label")
}
val saveNodes = findMatchingSaveNodes(insnNode, restoreLabel)
if (saveNodes.isEmpty()) {
throw AssertionError("${indexOf(insnNode)}: in handler ${indexOf(restoreLabel)} restore is not matched with save")
}
else if (saveNodes.size > 1) {
throw AssertionError("${indexOf(insnNode)}: in handler ${indexOf(restoreLabel)} restore is matched with several saves")
}
val saveNode = saveNodes.first()
saveStackMarkerForRestoreMarker[insnNode] = saveNode
restoreStackMarkersForSaveMarker.getOrPut(saveNode, { SmartList() }).add(insnNode)
}
private fun findMatchingSaveNodes(insnNode: AbstractInsnNode, restoreLabel: LabelNode): List {
val saveNodes = SmartHashSet()
methodNode.tryCatchBlocks.forEach { tcb ->
if (restoreLabel == tcb.start || restoreLabel == tcb.handler) {
saveStackNodesForTryStartLabel[tcb.start]?.let { saveNodes.add(it) }
}
}
return SmartList(saveNodes)
}
private fun indexOf(node: AbstractInsnNode) = methodNode.instructions.indexOf(node)
fun hasAnyMarkers(): Boolean =
breakContinueGotoNodes.isNotEmpty() ||
fakeAlwaysTrueIfeqMarkers.isNotEmpty() ||
fakeAlwaysFalseIfeqMarkers.isNotEmpty() ||
saveStackNodesForTryStartLabel.isNotEmpty() ||
openingInlineMethodMarker.isNotEmpty()
fun isAnalysisRequired(): Boolean =
breakContinueGotoNodes.isNotEmpty() ||
saveStackNodesForTryStartLabel.isNotEmpty() ||
openingInlineMethodMarker.isNotEmpty()
}