All Downloads are FREE. Search and download functionalities are using the official Maven repository.

.kotlin.kotlin-compiler.1.3.11.source-code.ControlFlowGraph.kt Maven / Gradle / Ivy

There is a newer version: 2.1.0-Beta1
Show newest version
/*
 * Copyright 2010-2014 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.common

import org.jetbrains.org.objectweb.asm.tree.AbstractInsnNode
import org.jetbrains.org.objectweb.asm.tree.InsnList
import org.jetbrains.org.objectweb.asm.tree.MethodNode
import org.jetbrains.org.objectweb.asm.tree.analysis.BasicValue


class ControlFlowGraph private constructor(private val insns: InsnList) {
    private val edges: Array> = Array(insns.size()) { arrayListOf() }

    fun getSuccessorsIndices(insn: AbstractInsnNode): List = getSuccessorsIndices(insns.indexOf(insn))
    fun getSuccessorsIndices(index: Int): List = edges[index]

    companion object {
        @JvmStatic
        fun build(node: MethodNode): ControlFlowGraph {
            val graph = ControlFlowGraph(node.instructions)

            fun addEdge(from: Int, to: Int) {
                graph.edges[from].add(to)
            }

            object : MethodAnalyzer("fake", node, OptimizationBasicInterpreter()) {
                override fun visitControlFlowEdge(insn: Int, successor: Int): Boolean {
                    addEdge(insn, successor)
                    return true
                }

                override fun visitControlFlowExceptionEdge(insn: Int, successor: Int): Boolean {
                    addEdge(insn, successor)
                    return true
                }
            }.analyze()

            return graph
        }
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy