Searched refs:Edge (Results 1 - 23 of 23) sorted by relevance

/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DProfileDataLoader.h43 // The profiling information defines an Edge by its source and sink basic
45 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileDataT
48 typedef DenseMap<Edge, unsigned> EdgeWeights;
58 /// getFunction() - Returns the Function for an Edge.
59 static const FType *getFunction(Edge e) {
62 && "A ProfileData::Edge can not be between two functions");
63 assert(e.second && "A ProfileData::Edge must have a real sink");
67 /// getEdge() - Creates an Edge between two BasicBlocks.
68 static Edge getEdge(const BType *Src, const BType *Dest) {
69 return Edge(Sr
[all...]
H A DProfileInfo.h58 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileInfoT
59 typedef std::pair<Edge, double> EdgeWeight;
60 typedef std::map<Edge, double> EdgeWeights;
87 // getFunction() - Returns the Function for an Edge, checking for validity.
88 static const FType* getFunction(Edge e) {
93 llvm_unreachable("Invalid ProfileInfo::Edge");
96 // getEdge() - Creates an Edge from two BasicBlocks.
97 static Edge getEdge(const BType *Src, const BType *Dest) {
112 double getEdgeWeight(Edge e) const {
123 void setEdgeWeight(Edge
[all...]
H A DBranchProbabilityInfo.h113 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo
123 DenseMap<Edge, uint32_t> Weights;
H A DSparsePropagation.h131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver
132 std::set<Edge> KnownFeasibleEdges;
H A DLoopInfo.h203 /// Edge type.
204 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef in class:llvm::LoopBase
207 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
H A DLoopInfoImpl.h97 getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const {
110 ExitEdges.push_back(Edge(*BI, *I));
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DProfileEstimatorPass.cpp38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) {
102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n");
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) {
106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":"
134 Edge edge = getEdge(*bbi,BB);
158 SmallVector<Edge, 8> ExitEdges;
159 SmallVector<Edge, 8> Edges;
183 std::set<Edge> ProcessedExit
[all...]
H A DProfileInfoLoaderPass.cpp42 std::set<Edge> SpanningTree;
64 virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, double &);
65 virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);
97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc,
126 Edge tocalc;
132 void LoaderPass::readEdge(ProfileInfo::Edge e,
143 DEBUG(dbgs() << "--Read Edge Counter for " << e
200 for (std::set<Edge>
[all...]
H A DProfileInfo.cpp75 Edge e = getEdge(0, BB);
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ);
282 divertFlow(const Edge
[all...]
H A DProfileDataLoaderPass.cpp65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge,
94 ProfileData &PB, ProfileData::Edge e,
102 DEBUG(dbgs() << "-- Read Edge Counter for " << e
152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s));
154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight "
H A DProfileVerifierPass.cpp86 double ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge);
105 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
120 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi);
201 double ProfileVerifierPassT<FType, BType>::ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge E) {
204 dbgs() << "Edge " << E << " in Function "
206 ASSERTMESSAGE("Edge has missing value");
210 dbgs() << "Edge " << E << " in Function "
212 ASSERTMESSAGE("Edge has negative value");
H A DBranchProbabilityInfo.cpp196 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
229 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
492 DenseMap<Edge, uint32_t>::const_iterator I =
506 DenseMap<Edge, uint32_t>::const_iterator MapI;
H A DSparsePropagation.cpp99 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
102 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h30 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
H A DOptimalEdgeProfiling.cpp11 // Edge profiling can give a reasonable approximation of the hot paths through a
49 return "Optimal Edge Profiler";
68 inline static void printEdgeCounter(ProfileInfo::Edge e,
71 DEBUG(dbgs() << "--Edge Counter for " << (e) << " in " \
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry);
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0);
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ);
H A DGCOVProfiling.cpp495 unsigned Edge = 0; local
504 Edge);
510 Builder.getInt64(Edge),
511 Builder.getInt64(Edge + 1));
524 Edge += Successors;
616 unsigned Edge = 0; local
625 Edge + i);
630 Edge += Successors;
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DCriticalAntiDepBreaker.cpp517 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) {
518 const SUnit *NextSU = Edge->getSUnit();
521 if (Edge->getKind() == SDep::Anti) {
522 AntiDepReg = Edge->getReg();
H A DAggressiveAntiDepBreaker.cpp794 const SDep *Edge = Edges[i];
795 SUnit *NextSU = Edge->getSUnit();
797 if ((Edge->getKind() != SDep::Anti) &&
798 (Edge->getKind() != SDep::Output)) continue;
800 unsigned AntiDepReg = Edge->getReg();
/freebsd-10.0-release/contrib/llvm/tools/llvm-prof/
H A Dllvm-prof.cpp105 std::vector<std::pair<ProfileInfo::Edge, double> > SuccCounts;
152 std::map<ProfileInfo::Edge, unsigned> EdgeFreqs;
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp2882 SDep Edge = PredSU->Succs[i];
2883 assert(!Edge.isAssignedRegDep());
2884 SUnit *SuccSU = Edge.getSUnit();
2886 Edge.setSUnit(PredSU);
2887 scheduleDAG->RemovePred(SuccSU, Edge);
2888 scheduleDAG->AddPred(SU, Edge);
2889 Edge.setSUnit(SU);
2890 scheduleDAG->AddPred(SuccSU, Edge);
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DSCCP.cpp205 typedef std::pair<BasicBlock*, BasicBlock*> Edge; typedef in class:__anon2667::SCCPSolver
206 DenseSet<Edge> KnownFeasibleEdges;
422 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
429 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
H A DGVN.cpp2552 std::pair<TerminatorInst*, unsigned> Edge = toSplit.pop_back_val(); local
2553 SplitCriticalEdge(Edge.first, Edge.second, this);
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
H A DMallocChecker.cpp2074 } else if (Optional<BlockEdge> Edge = ProgLoc.getAs<BlockEdge>()) {
2077 S = Edge->getSrc()->getTerminator();

Completed in 315 milliseconds