org.evosuite.coverage.cbranch.CBranchSuiteFitness 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 .
*/
/**
*
*/
package org.evosuite.coverage.cbranch;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import org.evosuite.Properties;
import org.evosuite.ga.archive.Archive;
import org.evosuite.setup.CallContext;
import org.evosuite.testcase.ExecutableChromosome;
import org.evosuite.testcase.TestChromosome;
import org.evosuite.testcase.execution.ExecutionResult;
import org.evosuite.testsuite.AbstractTestSuiteChromosome;
import org.evosuite.testsuite.TestSuiteFitnessFunction;
/**
* Context Branch criterion, force the generation of test cases that directly
* invoke the method where the branch is, i.e., do not consider covered a branch
* if it is covered by invoking other methods.
*
* @author Gordon Fraser, mattia
*
*/
// TODO: Archive handling could be improved to use branchIds and thus reduce
// the overhead of calculating the fitness function
// TODO fix count goal, when a suite executes a branch only one time we should
// return 0.5 and not the distance.
public class CBranchSuiteFitness extends TestSuiteFitnessFunction {
private static final long serialVersionUID = -4745892521350308986L;
private final List branchGoals;
private final Map>> contextGoalsMap;
private final Map> privateMethodsGoalsMap;
private final Map> methodsMap;
private final Map privateMethodsMethodsMap;
private final Set toRemoveGoals = new LinkedHashSet<>();
private final Set removedGoals = new LinkedHashSet<>();
public CBranchSuiteFitness() {
contextGoalsMap = new LinkedHashMap<>();
privateMethodsGoalsMap = new LinkedHashMap<>();
methodsMap = new LinkedHashMap<>();
privateMethodsMethodsMap = new LinkedHashMap<>();
CBranchFitnessFactory factory = new CBranchFitnessFactory();
branchGoals = factory.getCoverageGoals();
for (CBranchTestFitness goal : branchGoals) {
if(Properties.TEST_ARCHIVE)
Archive.getArchiveInstance().addTarget(goal);
if (goal.getBranchGoal() != null && goal.getBranchGoal().getBranch() != null) {
int branchId = goal.getBranchGoal().getBranch().getActualBranchId();
// if private method do not consider context
if (goal.getContext().isEmpty()) {
Set tempInSet = privateMethodsGoalsMap.get(branchId);
if (tempInSet == null) {
privateMethodsGoalsMap.put(branchId, tempInSet = new LinkedHashSet<>());
}
tempInSet.add(goal);
} else {
// if public method consider context
Map> innermap = contextGoalsMap
.get(branchId);
if (innermap == null) {
contextGoalsMap.put(branchId, innermap = new LinkedHashMap<>());
}
Set tempInSet = innermap.get(goal.getContext());
if (tempInSet == null) {
innermap.put(goal.getContext(), tempInSet = new LinkedHashSet<>());
}
tempInSet.add(goal);
}
} else {
String methodName = goal.getTargetClass() + "." + goal.getTargetMethod();
// if private method do not consider context
if (goal.getContext().isEmpty()) {
privateMethodsMethodsMap.put(methodName, goal);
} else {
// if public method consider context
Map innermap = methodsMap.get(methodName);
if (innermap == null) {
methodsMap.put(methodName, innermap = new LinkedHashMap<>());
}
innermap.put(goal.getContext(), goal);
}
}
logger.info("Context goal: " + goal.toString());
}
}
// private Map getDefaultDistanceMap() {
// Map distanceMap = new
// HashMap();
// for (CBranchTestFitness goal : branchGoals)
// distanceMap.put(goal, 1.0);
// return distanceMap;
// }
private CBranchTestFitness getContextGoal(String classAndMethodName, CallContext context) {
if (privateMethodsMethodsMap.containsKey(classAndMethodName)) {
return privateMethodsMethodsMap.get(classAndMethodName);
} else if (methodsMap.get(classAndMethodName) == null
|| methodsMap.get(classAndMethodName).get(context) == null)
return null;
else
return methodsMap.get(classAndMethodName).get(context);
}
private CBranchTestFitness getContextGoal(Integer branchId, CallContext context, boolean value) {
if (privateMethodsGoalsMap.containsKey(branchId)) {
for (CBranchTestFitness cBranchTestFitness : privateMethodsGoalsMap.get(branchId)) {
if (cBranchTestFitness.getValue() == value) {
return cBranchTestFitness;
}
}
} else if (contextGoalsMap.get(branchId) == null
|| contextGoalsMap.get(branchId).get(context) == null)
return null;
else
for (CBranchTestFitness cBranchTestFitness : contextGoalsMap.get(branchId).get(context)) {
if (cBranchTestFitness.getValue() == value) {
return cBranchTestFitness;
}
}
return null;
}
/*
* (non-Javadoc)
*
* @see
* org.evosuite.ga.FitnessFunction#getFitness(org.evosuite.ga.Chromosome)
*/
@Override
public double getFitness(AbstractTestSuiteChromosome extends ExecutableChromosome> suite) {
double fitness = 0.0; // branchFitness.getFitness(suite);
List results = runTestSuite(suite);
Map distanceMap = new LinkedHashMap<>();
Map callCounter = new LinkedHashMap<>();
Map branchCounter = new LinkedHashMap<>();
for (ExecutionResult result : results) {
if (result.hasTimeout() || result.hasTestException()) {
continue;
}
// Determine minimum branch distance for each branch in each context
assert (result.getTrace().getTrueDistancesContext().keySet().size() == result
.getTrace().getFalseDistancesContext().keySet().size());
TestChromosome test = new TestChromosome();
test.setTestCase(result.test);
test.setLastExecutionResult(result);
test.setChanged(false);
for (Integer branchId : result.getTrace().getTrueDistancesContext().keySet()) {
Map trueMap = result.getTrace().getTrueDistancesContext()
.get(branchId);
Map falseMap = result.getTrace().getFalseDistancesContext()
.get(branchId);
for (CallContext context : trueMap.keySet()) {
CBranchTestFitness goalT = getContextGoal(branchId, context, true);
if (goalT == null)
continue;
double distanceT = normalize(trueMap.get(context));
if (distanceMap.get(goalT) == null || distanceMap.get(goalT) > distanceT) {
distanceMap.put(goalT, distanceT);
}
if (Double.compare(distanceT, 0.0) == 0) {
if(removedGoals.contains(goalT))
continue;
test.getTestCase().addCoveredGoal(goalT);
toRemoveGoals.add(goalT);
}
if(Properties.TEST_ARCHIVE) {
Archive.getArchiveInstance().updateArchive(goalT, test, distanceT);
}
}
for (CallContext context : falseMap.keySet()) {
CBranchTestFitness goalF = getContextGoal(branchId, context, false);
if (goalF == null)
continue;
double distanceF = normalize(falseMap.get(context));
if (distanceMap.get(goalF) == null || distanceMap.get(goalF) > distanceF) {
distanceMap.put(goalF, distanceF);
}
if (Double.compare(distanceF, 0.0) == 0) {
if(removedGoals.contains(goalF))
continue;
test.getTestCase().addCoveredGoal(goalF);
toRemoveGoals.add(goalF);
}
if(Properties.TEST_ARCHIVE) {
Archive.getArchiveInstance().updateArchive(goalF, test, distanceF);
}
}
}
for (Entry> entry : result.getTrace()
.getPredicateContextExecutionCount().entrySet()) {
for (Entry value : entry.getValue().entrySet()) {
int count = value.getValue();
CBranchTestFitness goalT = getContextGoal(entry.getKey(), value.getKey(), true);
if (goalT != null) {
if (branchCounter.get(goalT.getGenericContextBranchIdentifier()) == null
|| branchCounter.get(goalT.getGenericContextBranchIdentifier()) < count) {
branchCounter.put(goalT.getGenericContextBranchIdentifier(), count);
}
} else {
CBranchTestFitness goalF = getContextGoal(entry.getKey(), value.getKey(),
false);
if (goalF != null) {
if (branchCounter.get(goalF.getGenericContextBranchIdentifier()) == null
|| branchCounter.get(goalF.getGenericContextBranchIdentifier()) < count) {
branchCounter.put(goalF.getGenericContextBranchIdentifier(), count);
}
} else
continue;
}
}
}
for (Entry> entry : result.getTrace()
.getMethodContextCount().entrySet()) {
for (Entry value : entry.getValue().entrySet()) {
CBranchTestFitness goal = getContextGoal(entry.getKey(), value.getKey());
if (goal == null)
continue;
int count = value.getValue();
if (callCounter.get(goal.hashCode()) == null
|| callCounter.get(goal.hashCode()) < count) {
callCounter.put(goal.hashCode(), count);
}
if (count > 0) {
if(removedGoals.contains(goal))
continue;
test.getTestCase().addCoveredGoal(goal);
toRemoveGoals.add(goal);
}
if (Properties.TEST_ARCHIVE) {
Archive.getArchiveInstance().updateArchive(goal, test, count == 0 ? 1.0 : 0.0);
}
}
}
}
int numCoveredGoals = removedGoals.size();
for (CBranchTestFitness goal : branchGoals) {
if(removedGoals.contains(goal))
continue;
Double distance = distanceMap.get(goal);
if (distance == null)
distance = 1.0;
if (goal.getBranch() == null) {
Integer count = callCounter.get(goal.hashCode());
if (count == null || count == 0) {
fitness += 1;
} else {
numCoveredGoals++;
}
} else {
Integer count = branchCounter.get(goal.getGenericContextBranchIdentifier());
if (count == null || count == 0)
fitness += 1;
else if (count == 1)
fitness += 0.5;
else {
if (Double.compare(distance, 0.0) == 0) {
numCoveredGoals++;
}
fitness += distance;
}
}
}
if (!branchGoals.isEmpty()) {
suite.setCoverage(this, (double) numCoveredGoals / (double) branchGoals.size());
} else {
suite.setCoverage(this, 1);
}
suite.setNumOfCoveredGoals(this, numCoveredGoals);
suite.setNumOfNotCoveredGoals(this, branchGoals.size() - numCoveredGoals);
updateIndividual(this, suite, fitness);
return fitness;
}
@Override
public boolean updateCoveredGoals() {
if (!Properties.TEST_ARCHIVE) {
return false;
}
for (CBranchTestFitness goal : this.toRemoveGoals) {
this.removedGoals.add(goal);
}
this.toRemoveGoals.clear();
logger.info("Current state of archive: " + Archive.getArchiveInstance().toString());
return true;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy