soot.jimple.toolkits.annotation.arraycheck.ExtendedHashMutableDirectedGraph Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of soot Show documentation

A Java Optimization Framework

There is a newer version: 4.6.0

package soot.jimple.toolkits.annotation.arraycheck;

/*-
 * #%L
 * Soot - a J*va Optimization Framework
 * %%
 * Copyright (C) 2000 Feng Qian
 * %%
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation, either version 2.1 of the
 * License, or (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Lesser Public License for more details.
 * 
 * You should have received a copy of the GNU General Lesser Public
 * License along with this program.  If not, see
 * .
 * #L%
 */

import java.util.Iterator;
import java.util.List;

import soot.toolkits.graph.HashMutableDirectedGraph;

/**
 * add skipNode method to direct all predecessor edges to successors.
 * 
 * override 'addEdge' to add node if the node was not in the graph
 * 
 */
class ExtendedHashMutableDirectedGraph extends HashMutableDirectedGraph {
  public ExtendedHashMutableDirectedGraph() {
  }

  /**
   * If nodes are not in the graph, add them into graph first.
   */
  public void addEdge(Object from, Object to) {
    if (!super.containsNode(from)) {
      super.addNode(from);
    }

    if (!super.containsNode(to)) {
      super.addNode(to);
    }

    super.addEdge(from, to);
  }

  /**
   * Add mutual edge to the graph. It should be optimized in the future.
   */
  public void addMutualEdge(Object from, Object to) {
    if (!super.containsNode(from)) {
      super.addNode(from);
    }

    if (!super.containsNode(to)) {
      super.addNode(to);
    }

    super.addEdge(from, to);
    super.addEdge(to, from);
  }

  /**
   * Bypass the in edge to out edge. Not delete the node
   */
  public void skipNode(Object node) {
    if (!super.containsNode(node)) {
      return;
    }

    Object[] preds = getPredsOf(node).toArray();
    Object[] succs = getSuccsOf(node).toArray();

    for (Object element : preds) {
      for (Object element0 : succs) {
        if (element != element0) {
          super.addEdge(element, element0);
        }
      }
    }

    for (Object element : preds) {
      super.removeEdge(element, node);
    }

    for (Object element : succs) {
      super.removeEdge(node, element);
    }

    super.removeNode(node);
  }

  public void mergeWith(ExtendedHashMutableDirectedGraph other) {
    List