| /minix3/external/bsd/llvm/dist/llvm/lib/Analysis/ |
| H A D | CFLAliasAnalysis.cpp | 119 struct Edge { struct
121 Value *From;
124 Value *To;
127 EdgeType Weight;
132 StratifiedAttrs AdditionalAttrs;
134 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) in Edge() function
560 struct Edge { struct in __anon27e61d590111::WeightedBidirectionalGraph
561 EdgeTypeT Weight;
562 Node Other;
564 Edge(const EdgeTypeT &W, const Node &N) in Edge() argument
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | BranchProbabilityInfo.h | 121 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
|
| H A D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
|
| H A D | LoopInfo.h | 209 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
|
| H A D | GCOVProfiling.cpp | 615 unsigned Edge = 0; in emitProfileArcs() local
736 unsigned Edge = 0; in buildEdgeLookupTable() local
|
| /minix3/external/bsd/llvm/dist/llvm/lib/IR/ |
| H A D | GCOV.cpp | 159 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
365 const GCOVEdge *Edge = *I; in dump() local
373 const GCOVEdge *Edge = *I; in dump() local
699 const GCOVEdge *Edge = *I; in printBranchInfo() local
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/ |
| H A D | GCOV.h | 317 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge()
321 void addDstEdge(GCOVEdge *Edge) { in addDstEdge()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
| H A D | CriticalAntiDepBreaker.cpp | 540 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
|
| H A D | AggressiveAntiDepBreaker.cpp | 812 const SDep *Edge = Edges[i]; in BreakAntiDependencies() local
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | SampleProfile.cpp | 68 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef
|
| H A D | SCCP.cpp | 206 typedef std::pair<BasicBlock*, BasicBlock*> Edge; typedef in __anon4dbf262f0211::SCCPSolver
|
| H A D | GVN.cpp | 2660 std::pair<TerminatorInst*, unsigned> Edge = toSplit.pop_back_val(); in splitCriticalEdges() local
|
| /minix3/external/bsd/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | MallocChecker.cpp | 2370 } else if (Optional<BlockEdge> Edge = ProgLoc.getAs<BlockEdge>()) { in VisitNode() local
|
| H A D | RetainCountChecker.cpp | 2353 if (Optional<BlockEdge> Edge = P.getAs<BlockEdge>()) { in CFRefLeakReport() local
|
| /minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 2884 SDep Edge = PredSU->Succs[i]; in PrescheduleNodesWithMultipleUses() local
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 3024 std::pair<BasicBlock*, BasicBlock*> Edge(Src, Dst); in createEdgeMask() local
|