#include "llvm/Transforms/Instrumentation/Graph.h"
#include "llvm/Pass.h"
#include "llvm/Module.h"
-#include "llvm/InstrTypes.h"
#include "llvm/iTerminators.h"
+#include "Support/Statistic.h"
#include <algorithm>
-#include <iostream>
-#include <sstream>
-#include <vector>
//using std::list;
using std::map;
vector<Edge >& be,
vector<Edge >& stDummy,
vector<Edge >& exDummy,
- int numPaths, int MethNo){
+ int numPaths, int MethNo,
+ Value *threshold){
//Given a graph: with exit->root edge, do the following in seq:
//1. get back edges
for(map<Edge, getEdgeCode *>::iterator MI=codeInsertions.begin(),
ME=codeInsertions.end(); MI!=ME; ++MI){
Edge ed=MI->first;
- insertBB(ed, MI->second, rInst, countInst, numPaths, MethNo);
+ insertBB(ed, MI->second, rInst, countInst, numPaths, MethNo, threshold);
}
}