org.evosuite.graphs.cfg.ActualControlFlowGraph Maven / Gradle / Ivy
The newest version!
/**
* Copyright (C) 2010-2018 Gordon Fraser, Andrea Arcuri and EvoSuite
* contributors
*
* This file is part of EvoSuite.
*
* EvoSuite 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 3.0 of the License, or
* (at your option) any later version.
*
* EvoSuite 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
* Lesser Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with EvoSuite. If not, see {
private static Logger logger = LoggerFactory.getLogger(ActualControlFlowGraph.class);
private RawControlFlowGraph rawGraph;
private BytecodeInstruction entryPoint;
private Set exitPoints;
private Set branches;
private Set branchTargets;
private Set joins;
private Set joinSources;
/**
*
* Constructor for ActualControlFlowGraph.
*
*
* @param rawGraph
* a {@link org.evosuite.graphs.cfg.RawControlFlowGraph} object.
*/
public ActualControlFlowGraph(RawControlFlowGraph rawGraph) {
super(rawGraph.getClassName(), rawGraph.getMethodName(),
rawGraph.getMethodAccess());
this.rawGraph = rawGraph;
fillSets();
computeGraph();
}
// "revert" constructor ... for now ... TODO
/**
*
* Constructor for ActualControlFlowGraph.
*
*
* @param toRevert
* a {@link org.evosuite.graphs.cfg.ActualControlFlowGraph}
* object.
*/
protected ActualControlFlowGraph(ActualControlFlowGraph toRevert) {
super(toRevert.className, toRevert.methodName, toRevert.access,
toRevert.computeReverseJGraph());
}
/**
*
* computeReverseCFG
*
*
* @return a {@link org.evosuite.graphs.cfg.ActualControlFlowGraph} object.
*/
public ActualControlFlowGraph computeReverseCFG() {
// TODO: this must be possible to "pre implement" in EvoSuiteGraph for
// all sub class of EvoSuiteGraph
return new ActualControlFlowGraph(this);
}
// initialization
private void fillSets() {
setEntryPoint(rawGraph.determineEntryPoint());
setExitPoints(rawGraph.determineExitPoints());
setBranches(rawGraph.determineBranches());
setBranchTargets();
setJoins(rawGraph.determineJoins());
setJoinSources();
}
private void setEntryPoint(BytecodeInstruction entryPoint) {
if (entryPoint == null)
throw new IllegalArgumentException("null given");
if (!belongsToMethod(entryPoint))
throw new IllegalArgumentException(
"entry point does not belong to this CFGs method");
this.entryPoint = entryPoint;
}
private void setExitPoints(Set exitPoints) {
if (exitPoints == null)
throw new IllegalArgumentException("null given");
this.exitPoints = new HashSet();
for (BytecodeInstruction exitPoint : exitPoints) {
if (!belongsToMethod(exitPoint))
throw new IllegalArgumentException(
"exit point does not belong to this CFGs method");
if (!exitPoint.canBeExitPoint())
throw new IllegalArgumentException(
"unexpected exitPoint byteCode instruction type: "
+ exitPoint.getInstructionType());
this.exitPoints.add(exitPoint);
}
}
private void setJoins(Set joins) {
if (joins == null)
throw new IllegalArgumentException("null given");
this.joins = new HashSet();
for (BytecodeInstruction join : joins) {
if (!belongsToMethod(join))
throw new IllegalArgumentException(
"join does not belong to this CFGs method");
this.joins.add(join);
}
}
private void setJoinSources() {
if (joins == null)
throw new IllegalStateException(
"expect joins to be set before setting of joinSources");
if (rawGraph == null)
throw new IllegalArgumentException("null given");
this.joinSources = new HashSet();
for (BytecodeInstruction join : joins)
for (ControlFlowEdge joinEdge : rawGraph.incomingEdgesOf(join))
joinSources.add(rawGraph.getEdgeSource(joinEdge));
}
private void setBranches(Set branches) {
if (branches == null)
throw new IllegalArgumentException("null given");
this.branches = new HashSet();
for (BytecodeInstruction branch : branches) {
if (!belongsToMethod(branch))
throw new IllegalArgumentException(
"branch does not belong to this CFGs method");
// if (!branch.isActualBranch()) // TODO this happens if your in a
// try-catch ... handle!
// throw new IllegalArgumentException(
// "unexpected branch byteCode instruction type: "
// + branch.getInstructionType());
// TODO the following doesn't work at this point
// because the BranchPool is not yet filled yet
// BUT one could fill the pool right now and drop further analysis
// later
// way cooler, because then filling of the BranchPool is unrelated
// to
// BranchInstrumentation - then again that instrumentation is needed
// anyways i guess
// if (!BranchPool.isKnownAsBranch(instruction))
// throw new IllegalStateException(
// "expect BranchPool to know all branching instructions: "
// + instruction.toString());
this.branches.add(branch);
}
}
private void setBranchTargets() {
if (branches == null)
throw new IllegalStateException(
"expect branches to be set before setting of branchTargets");
if (rawGraph == null)
throw new IllegalArgumentException("null given");
this.branchTargets = new HashSet();
for (BytecodeInstruction branch : branches)
for (ControlFlowEdge branchEdge : rawGraph.outgoingEdgesOf(branch))
branchTargets.add(rawGraph.getEdgeTarget(branchEdge));
}
private Set getInitiallyKnownInstructions() {
Set r = new HashSet();
r.add(entryPoint);
r.addAll(exitPoints);
r.addAll(branches);
r.addAll(branchTargets);
r.addAll(joins);
r.addAll(joinSources);
return r;
}
// compute actual CFG from RawControlFlowGraph
private void computeGraph() {
computeNodes();
computeEdges();
// TODO: Need to make that compatible with Testability Transformation
// checkSanity();
addAuxiliaryBlocks();
}
private void addAuxiliaryBlocks() {
// TODO clean up mess: exit-/entry- POINTs versus BLOCKs
EntryBlock entry = new EntryBlock(className, methodName);
ExitBlock exit = new ExitBlock(className, methodName);
addBlock(entry);
addBlock(exit);
addEdge(entry, exit);
addEdge(entry, this.entryPoint.getBasicBlock());
for (BytecodeInstruction exitPoint : this.exitPoints) {
addEdge(exitPoint.getBasicBlock(), exit);
}
}
private void computeNodes() {
Set nodes = getInitiallyKnownInstructions();
for (BytecodeInstruction node : nodes) {
if (knowsInstruction(node))
continue;
BasicBlock nodeBlock = rawGraph.determineBasicBlockFor(node);
addBlock(nodeBlock);
}
logger.debug(vertexCount() + " BasicBlocks");
}
private void computeEdges() {
for (BasicBlock block : vertexSet()) {
computeIncomingEdgesFor(block);
computeOutgoingEdgesFor(block);
}
logger.debug(edgeCount() + " ControlFlowEdges");
}
private void computeIncomingEdgesFor(BasicBlock block) {
if (isEntryPoint(block))
return;
BytecodeInstruction blockStart = block.getFirstInstruction();
Set rawIncomings = rawGraph.incomingEdgesOf(blockStart);
for (ControlFlowEdge rawIncoming : rawIncomings) {
BytecodeInstruction incomingStart = rawGraph.getEdgeSource(rawIncoming);
addRawEdge(incomingStart, block, rawIncoming);
}
}
private void computeOutgoingEdgesFor(BasicBlock block) {
if (isExitPoint(block))
return;
BytecodeInstruction blockEnd = block.getLastInstruction();
Set rawOutgoings = rawGraph.outgoingEdgesOf(blockEnd);
for (ControlFlowEdge rawOutgoing : rawOutgoings) {
BytecodeInstruction outgoingEnd = rawGraph.getEdgeTarget(rawOutgoing);
addRawEdge(block, outgoingEnd, rawOutgoing);
}
}
// internal graph handling
/**
*
* addBlock
*
*
* @param nodeBlock
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
*/
protected void addBlock(BasicBlock nodeBlock) {
if (nodeBlock == null)
throw new IllegalArgumentException("null given");
logger.debug("Adding block: " + nodeBlock.getName());
if (containsVertex(nodeBlock))
throw new IllegalArgumentException("block already added before");
if (!addVertex(nodeBlock))
throw new IllegalStateException(
"internal error while addind basic block to CFG");
// for (BasicBlock test : graph.vertexSet()) {
// logger.debug("experimental self-equals on " + test.getName());
// if (nodeBlock.equals(test))
// logger.debug("true");
// else
// logger.debug("false");
// if (!containsBlock(test))
// throw new IllegalStateException("wtf");
//
// logger.debug("experimental equals on " + test.getName() + " with "
// + nodeBlock.getName());
// if (test.equals(nodeBlock))
// logger.debug("true");
// else
// logger.debug("false");
//
// logger.debug("experimental dual-equal");
// if (nodeBlock.equals(test))
// logger.debug("true");
// else
// logger.debug("false");
//
// }
if (!containsVertex(nodeBlock))
throw new IllegalStateException(
"expect graph to contain the given block on returning of addBlock()");
logger.debug(".. succeeded. nodeCount: " + vertexCount());
}
/**
*
* addRawEdge
*
*
* @param src
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @param target
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @param origEdge
* a {@link org.evosuite.graphs.cfg.ControlFlowEdge} object.
*/
protected void addRawEdge(BytecodeInstruction src, BasicBlock target,
ControlFlowEdge origEdge) {
BasicBlock srcBlock = src.getBasicBlock();
if (srcBlock == null)
throw new IllegalStateException(
"when adding an edge to a CFG it is expected to know both the src- and the target-instruction");
addRawEdge(srcBlock, target, origEdge);
}
/**
*
* addRawEdge
*
*
* @param src
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @param target
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @param origEdge
* a {@link org.evosuite.graphs.cfg.ControlFlowEdge} object.
*/
protected void addRawEdge(BasicBlock src, BytecodeInstruction target,
ControlFlowEdge origEdge) {
BasicBlock targetBlock = target.getBasicBlock();
if (targetBlock == null)
throw new IllegalStateException(
"when adding an edge to a CFG it is expected to know both the src- and the target-instruction");
addRawEdge(src, targetBlock, origEdge);
}
/**
*
* addRawEdge
*
*
* @param src
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @param target
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @param origEdge
* a {@link org.evosuite.graphs.cfg.ControlFlowEdge} object.
*/
protected void addRawEdge(BasicBlock src, BasicBlock target, ControlFlowEdge origEdge) {
if (src == null || target == null)
throw new IllegalArgumentException("null given");
logger.debug("Adding edge from " + src.getName() + " to " + target.getName());
if (containsEdge(src, target)) {
logger.debug("edge already contained in CFG");
// sanity check
ControlFlowEdge current = getEdge(src, target);
if (current == null)
throw new IllegalStateException(
"expect getEdge() not to return null on parameters on which containsEdge() retruned true");
if (current.getBranchExpressionValue()
&& !origEdge.getBranchExpressionValue())
throw new IllegalStateException(
"if this rawEdge was handled before i expect the old edge to have same branchExpressionValue set");
if (current.getBranchInstruction() == null) {
if (origEdge.getBranchInstruction() != null)
throw new IllegalStateException(
"if this rawEdge was handled before i expect the old edge to have same branchInstruction set");
} else if (origEdge.getBranchInstruction() == null
|| !current.getBranchInstruction().equals(origEdge.getBranchInstruction()))
throw new IllegalStateException(
"if this rawEdge was handled before i expect the old edge to have same branchInstruction set");
return;
}
ControlFlowEdge e = new ControlFlowEdge(origEdge);
if (!super.addEdge(src, target, e))
throw new IllegalStateException("internal error while adding edge to CFG");
logger.debug(".. succeeded, edgeCount: " + edgeCount());
}
// convenience methods to switch between BytecodeInstructons and BasicBlocks
/**
* If the given instruction is known to this graph, the BasicBlock holding
* that instruction is returned. Otherwise null will be returned.
*
* @param instruction
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @return a {@link org.evosuite.graphs.cfg.BasicBlock} object.
*/
public BasicBlock getBlockOf(BytecodeInstruction instruction) {
if (instruction == null)
throw new IllegalArgumentException("null given");
if (instruction.hasBasicBlockSet())
return instruction.getBasicBlock();
for (BasicBlock block : vertexSet())
if (block.containsInstruction(instruction)) {
instruction.setBasicBlock(block);
return block;
}
logger.debug("unknown instruction " + instruction.toString());
return null;
}
/**
* Checks whether this graph knows the given instruction. That is there is a
* BasicBlock in this graph's vertexSet containing the given instruction.
*
* @param instruction
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @return a boolean.
*/
public boolean knowsInstruction(BytecodeInstruction instruction) {
if (instruction == null)
throw new IllegalArgumentException("null given");
if (instruction.hasBasicBlockSet())
return containsVertex(instruction.getBasicBlock());
for (BasicBlock block : vertexSet())
if (block.containsInstruction(instruction))
return true;
return false;
}
/**
*
* getDistance
*
*
* @param v1
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @param v2
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @return a int.
*/
public int getDistance(BytecodeInstruction v1, BytecodeInstruction v2) {
if (v1 == null || v2 == null)
throw new IllegalArgumentException("null given");
if (!knowsInstruction(v1) || !knowsInstruction(v2))
throw new IllegalArgumentException("instructions not contained in this CFG");
BasicBlock b1 = v1.getBasicBlock();
BasicBlock b2 = v2.getBasicBlock();
if (b1 == null || b2 == null)
throw new IllegalStateException(
"expect CFG to contain the BasicBlock for each instruction knowsInstruction() returns true on");
return getDistance(b1, b2);
}
/**
*
* isDirectSuccessor
*
*
* @param v1
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @param v2
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @return a boolean.
*/
public boolean isDirectSuccessor(BytecodeInstruction v1, BytecodeInstruction v2) {
if (v1 == null || v2 == null)
throw new IllegalArgumentException("null given");
if (!knowsInstruction(v1) || !knowsInstruction(v2))
throw new IllegalArgumentException("instructions not contained in this CFG");
BasicBlock b1 = v1.getBasicBlock();
BasicBlock b2 = v2.getBasicBlock();
if (b1 == null || b2 == null)
throw new IllegalStateException(
"expect CFG to contain the BasicBlock for each instruction knowsInstruction() returns true on");
return isDirectSuccessor(b1, b2);
}
// retrieve information about the CFG
/**
*
* isEntryPoint
*
*
* @param block
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @return a boolean.
*/
public boolean isEntryPoint(BasicBlock block) {
if (block == null)
throw new IllegalArgumentException("null given");
if (block.containsInstruction(entryPoint)) {
// // sanity check
// if (!block.getFirstInstruction().equals(entryPoint)) {
// logger.error("entryPoint: "+entryPoint.toString());
// logger.error("current block: "+block.explain());
// throw new IllegalStateException(
// "expect entryPoint of a method to be the first instruction from the entryBlock of that method");
// }
return true;
}
return false;
}
/**
*
* isExitPoint
*
*
* @param block
* a {@link org.evosuite.graphs.cfg.BasicBlock} object.
* @return a boolean.
*/
public boolean isExitPoint(BasicBlock block) {
if (block == null)
throw new IllegalArgumentException("null given");
for (BytecodeInstruction exitPoint : exitPoints)
if (block.containsInstruction(exitPoint)) {
// // sanity check
// if (!block.getLastInstruction().equals(exitPoint))
// throw new IllegalStateException(
// "expect exitPoints of a method to be the last instruction from an exitBlock of that method");
return true;
}
return false;
}
/**
*
* belongsToMethod
*
*
* @param instruction
* a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
* @return a boolean.
*/
public boolean belongsToMethod(BytecodeInstruction instruction) {
if (instruction == null)
throw new IllegalArgumentException("null given");
if (!className.equals(instruction.getClassName()))
return false;
if (!methodName.equals(instruction.getMethodName()))
return false;
return true;
}
// sanity checks
/**
*
* checkSanity
*
*/
public void checkSanity() {
logger.debug("checking sanity of CFG for " + methodName);
if (isEmpty())
throw new IllegalStateException("a CFG must contain at least one element");
for (BytecodeInstruction initInstruction : getInitiallyKnownInstructions()) {
if (!knowsInstruction(initInstruction))
throw new IllegalStateException(
"expect CFG to contain all initially known instructions");
}
logger.debug(".. all initInstructions contained");
// checkNodeSanity();
checkInstructionsContainedOnceConstraint();
logger.debug(".. CFG sanity ensured");
}
private void checkInstructionsContainedOnceConstraint() {
for (BytecodeInstruction ins : rawGraph.vertexSet()) {
if (!knowsInstruction(ins))
throw new IllegalStateException(
"expect all instructions ins underlying RawCFG to be known by Actual CFG");
BasicBlock insBlock = ins.getBasicBlock();
if (insBlock == null)
throw new IllegalStateException(
"expect ActualCFG.getBlockOf() to return non-null BasicBlocks for all instructions it knows");
for (BasicBlock block : vertexSet()) {
if (!block.equals(insBlock) && block.containsInstruction(ins))
throw new IllegalStateException(
"expect ActualCFG to contain exactly one BasicBlock for each original bytecode instruction, not more!");
}
}
}
void checkNodeSanity() {
// ensure graph is connected and isEntry and isExitBlock() work as
// expected
for (BasicBlock node : vertexSet()) {
checkEntryExitPointConstraint(node);
checkSingleCFGNodeConstraint(node);
checkNodeMinimalityConstraint(node);
}
logger.debug("..all node constraints ensured");
}
void checkEntryExitPointConstraint(BasicBlock node) {
// exit point constraint
int out = outDegreeOf(node);
if (!isExitPoint(node) && out == 0)
throw new IllegalStateException(
"expect nodes without outgoing edges to be exitBlocks: "
+ node.toString());
// entry point constraint
int in = inDegreeOf(node);
if (!isEntryPoint(node) && in == 0)
throw new IllegalStateException(
"expect nodes without incoming edges to be the entryBlock: "
+ node.toString());
}
void checkSingleCFGNodeConstraint(BasicBlock node) {
int in = inDegreeOf(node);
int out = outDegreeOf(node);
if (in + out == 0 && vertexCount() != 1)
throw new IllegalStateException(
"node with neither child nor parent only allowed if CFG consists of a single block: "
+ node.toString());
if (vertexCount() == 1 && !(isEntryPoint(node) && isExitPoint(node)))
throw new IllegalStateException(
"if a CFG consists of a single basic block that block must be both entry and exitBlock: "
+ node.toString());
}
void checkNodeMinimalityConstraint(BasicBlock node) {
if (hasNPartentsMChildren(node, 1, 1)) {
for (BasicBlock child : getChildren(node))
if (hasNPartentsMChildren(child, 1, 1))
throw new IllegalStateException(
"whenever a node has exactly one child and one parent, it is expected that the same is true for either of those");
for (BasicBlock parent : getParents(node))
if (hasNPartentsMChildren(parent, 1, 1))
throw new IllegalStateException(
"whenever a node has exactly one child and one parent, it is expected that the same is true for either of those");
}
}
// inherited from ControlFlowGraph
/** {@inheritDoc} */
@Override
public boolean containsInstruction(BytecodeInstruction v) {
if (v == null)
return false;
for (BasicBlock block : vertexSet())
if (block.containsInstruction(v))
return true;
return false;
}
/** {@inheritDoc} */
@Override
public BytecodeInstruction getInstruction(int instructionId) {
BytecodeInstruction searchedFor = BytecodeInstructionPool.getInstance(rawGraph.getClassLoader()).getInstruction(className,
methodName,
instructionId);
if (containsInstruction(searchedFor))
return searchedFor;
return null;
}
// @Override
// public BytecodeInstruction getBranch(int branchId) {
//
// Branch searchedFor = BranchPool.getBranch(branchId);
// if (searchedFor == null)
// return null;
//
// if (containsInstruction(searchedFor.getInstruction()))
// return searchedFor.getInstruction();
//
// // TODO more sanity checks?
//
// return null;
// }
/**
*
* Getter for the field entryPoint.
*
*
* @return a {@link org.evosuite.graphs.cfg.BytecodeInstruction} object.
*/
public BytecodeInstruction getEntryPoint() {
return entryPoint;
}
/**
*
* Getter for the field exitPoints.
*
*
* @return a {@link java.util.Set} object.
*/
public Set getExitPoints() {
return new HashSet(exitPoints);
}
/**
*
* Getter for the field branches.
*
*
* @return a {@link java.util.Set} object.
*/
public Set getBranches() {
return new HashSet(branches);
}
/**
*
* Getter for the field joins.
*
*
* @return a {@link java.util.Set} object.
*/
public Set getJoins() {
return new HashSet(joins);
}
/** {@inheritDoc} */
@Override
public String getCFGType() {
return "ACFG";
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy