| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | MaximumSpanningTree.h | 30 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 D | GCOVProfiling.cpp | 517 unsigned Edge = 0; local
525 Edge);
532 Builder.getInt64(Edge),
533 Builder.getInt64(Edge + 1));
547 Edge += Successors;
638 unsigned Edge = 0; local
647 Edge + i);
652 Edge += Successors;
|
| /freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
| H A D | BranchProbabilityInfo.h | 113 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo
123 DenseMap<Edge, uint32_t> Weights;
|
| H A D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver
132 std::set<Edge> KnownFeasibleEdges;
|
| H A D | LoopInfo.h | 205 /// Edge type.
206 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef in class:llvm::LoopBase
209 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
|
| H A D | LoopInfoImpl.h | 87 getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const {
95 ExitEdges.push_back(Edge(*BI, *I));
|
| /freebsd-9.3-release/contrib/llvm/lib/IR/ |
| H A D | GCOV.cpp | 143 for (size_t Edge = 0, End = Block.getNumEdges(); Edge < End; ++Edge) {
186 if (!Buff.readInt(Dummy)) return false; // Edge flag
|
| /freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
| H A D | CriticalAntiDepBreaker.cpp | 517 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) {
518 const SUnit *NextSU = Edge->getSUnit();
521 if (Edge->getKind() == SDep::Anti) {
522 AntiDepReg = Edge->getReg();
|
| H A D | AggressiveAntiDepBreaker.cpp | 794 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-9.3-release/contrib/llvm/lib/Analysis/ |
| H A D | BranchProbabilityInfo.cpp | 271 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
304 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
585 DenseMap<Edge, uint32_t>::const_iterator I =
599 DenseMap<Edge, uint32_t>::const_iterator MapI;
|
| H A D | SparsePropagation.cpp | 99 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
102 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
|
| /freebsd-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 2883 SDep Edge = PredSU->Succs[i];
2884 assert(!Edge.isAssignedRegDep());
2885 SUnit *SuccSU = Edge.getSUnit();
2887 Edge.setSUnit(PredSU);
2888 scheduleDAG->RemovePred(SuccSU, Edge);
2889 scheduleDAG->AddPred(SU, Edge);
2890 Edge.setSUnit(SU);
2891 scheduleDAG->AddPred(SuccSU, Edge);
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | SCCP.cpp | 205 typedef std::pair<BasicBlock*, BasicBlock*> Edge; typedef in class:__anon2672::SCCPSolver
206 DenseSet<Edge> KnownFeasibleEdges;
422 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
429 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
|
| H A D | GVN.cpp | 2613 std::pair<TerminatorInst*, unsigned> Edge = toSplit.pop_back_val(); local
2614 SplitCriticalEdge(Edge.first, Edge.second, this);
|
| /freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | MallocChecker.cpp | 2110 } else if (Optional<BlockEdge> Edge = ProgLoc.getAs<BlockEdge>()) {
2113 S = Edge->getSrc()->getTerminator();
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 2359 std::pair<BasicBlock*, BasicBlock*> Edge(Src, Dst);
2360 EdgeMaskCache::iterator ECEntryIt = MaskCache.find(Edge);
2380 MaskCache[Edge] = EdgeMask;
2384 MaskCache[Edge] = SrcMask;
|