Method optimize

src/main/java/org/dynjs/ir/representations/CFG.java:410–442

()

    }

    private void optimize() {
        List<Edge> toRemove = new ArrayList<Edge>();

        for (BasicBlock b : graph.allData()) {
            boolean noExceptions = true;
            for (Instruction i : b.getInstructions()) {
                if (i.canRaiseException()) {
                    noExceptions = false;
                    break;
                }
            }

            if (noExceptions) {
                for (Edge<BasicBlock> e : graph.findVertexFor(b).getOutgoingEdgesOfType(EdgeType.EXCEPTION)) {
                    BasicBlock source = e.getSource().getData();
                    BasicBlock destination = e.getDestination().getData();
                    toRemove.add(e);

                    if (rescuerMap.get(source) == destination) rescuerMap.remove(source);
                }
            }
        }

        if (!toRemove.isEmpty()) {
            for (Edge edge: toRemove) {
                graph.removeEdge(edge);
            }
        }

        deleteOrphanedBlocks(graph);

        collapseStraightLineBBs();
    }

    public int outDegree(BasicBlock b) {
        return graph.findVertexFor(b).outDegree();