org.teavm.common

Class GraphUtils

java.lang.Object

org.teavm.common.GraphUtils

public final class GraphUtils
extends Object

Author:

Alexey Andreev

Method Summary

Modifier and Type	Method and Description
static Graph	buildDominatorGraph(DominatorTree domTree, int sz)
static DominatorTree	buildDominatorTree(Graph graph)
static int[]	findBackEdges(Graph graph)
static int[][]	findDominanceFrontiers(Graph cfg, DominatorTree domTree)
static int[][]	findStronglyConnectedComponents(Graph graph, int[] start)
static int[][]	findStronglyConnectedComponents(Graph graph, int[] start, GraphNodeFilter filter)
static boolean	isIrreducible(Graph graph)
static void	splitIrreducibleGraph(Graph graph, int[] weights, GraphSplittingBackend backend)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

findBackEdges

public static int[] findBackEdges(Graph graph)

isIrreducible

public static boolean isIrreducible(Graph graph)

findStronglyConnectedComponents

public static int[][] findStronglyConnectedComponents(Graph graph,
                                                      int[] start)

findStronglyConnectedComponents

public static int[][] findStronglyConnectedComponents(Graph graph,
                                                      int[] start,
                                                      GraphNodeFilter filter)

buildDominatorTree

public static DominatorTree buildDominatorTree(Graph graph)

buildDominatorGraph

public static Graph buildDominatorGraph(DominatorTree domTree,
                                        int sz)

splitIrreducibleGraph

public static void splitIrreducibleGraph(Graph graph,
                                         int[] weights,
                                         GraphSplittingBackend backend)

findDominanceFrontiers

public static int[][] findDominanceFrontiers(Graph cfg,
                                             DominatorTree domTree)