org.teavm.common.DefaultDominatorTree Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of teavm-core Show documentation

TeaVM compiler and SPI

There is a newer version: 0.2.8

/*
 *  Copyright 2013 Alexey Andreev.
 *
 *  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.teavm.common;

import java.util.Arrays;

class DefaultDominatorTree implements DominatorTree {
    private LCATree lcaTree;
    private int[] indexes;
    private int[] nodes;

    public DefaultDominatorTree(int[] dominators, int[] vertices) {
        lcaTree = new LCATree(dominators.length + 1);
        indexes = new int[dominators.length + 1];
        nodes = new int[dominators.length + 1];
        Arrays.fill(nodes, -1);
        for (int i = 0; i < dominators.length; ++i) {
            int v = vertices[i];
            if (v < 0) {
                continue;
            }
            int dom = indexes[dominators[v] + 1];
            int node = lcaTree.addNode(dom);
            indexes[v + 1] = node;
            nodes[node] = v;
        }
    }

    @Override
    public boolean directlyDominates(int a, int b) {
        a = indexes[a + 1];
        b = indexes[b + 1];
        return lcaTree.lcaOf(a, b) == a;
    }

    @Override
    public int commonDominatorOf(int a, int b) {
        return nodes[lcaTree.lcaOf(indexes[a + 1], indexes[b + 1])];
    }

    @Override
    public boolean dominates(int a, int b) {
        a = indexes[a + 1];
        b = indexes[b + 1];
        return lcaTree.lcaOf(a, b) == a;
    }

    @Override
    public int immediateDominatorOf(int a) {
        int result = lcaTree.parentOf(indexes[a + 1]);
        return result >= 0 ? nodes[result] : -1;
    }

    @Override
    public int levelOf(int a) {
        int index = indexes[a + 1];
        return lcaTree.depthOf(index);
    }
}