| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 114 for (auto &Edge : Edges[Src]) { in run() local
387 for (auto &Edge : Edges[Src]) { in findAugmentingDAG() local
511 for (auto &Edge : Edges[Src]) { in identifyShortestEdges() local
551 struct Edge { struct in __anon1fb2f5b80111::MinCostMaxFlow
553 int64_t Cost;
555 int64_t Capacity;
557 int64_t Flow;
559 uint64_t Dst;
561 uint64_t RevEdgeIndex;
565 bool OnShortestPath;
[all …]
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | ExportTrie.cpp | 52 struct Edge { struct
53 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge() argument
55 StringRef substring;
56 struct TrieNode *child;
|
| H A D | SectionPriorities.cpp | 43 struct Edge { struct
44 int from;
45 uint64_t weight;
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector.h | 390 struct Edge { struct
404 Edge edges_[BV::kSize * 32]; argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | GCOVProfiling.cpp | 178 struct Edge { struct
181 const BasicBlock *SrcBB;
182 const BasicBlock *DestBB;
183 uint64_t Weight;
184 BasicBlock *Place = nullptr;
185 uint32_t SrcNumber, DstNumber;
186 bool InMST = false;
187 bool Removed = false;
188 bool IsCritical = false;
190 Edge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W = 1) in Edge() function
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/LTO/ |
| H A D | SummaryBasedOptimizations.cpp | 53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
76 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | MemProfContextDisambiguation.cpp | 813 for (auto &Edge : CallerEdges) { in addOrUpdateCallerEdge() local
830 auto Edge = *EI; in removeNoneTypeCalleeEdges() local
1061 auto Edge = *EI; in connectNewNode() local
1116 for (auto &Edge : CallerEdges) { in assignStackNodesPostOrder() local
1688 auto Edge = *EI; in handleCallsitesWithMultipleTargets() local
1731 auto Edge = *EI; in calleesMatch() local
2091 for (auto &Edge : CalleeEdges) in print() local
2094 for (auto &Edge : CallerEdges) in print() local
2166 const auto &Edge = *EI; in checkNode() local
2182 const auto &Edge = *EI; in checkNode() local
[all …]
|
| H A D | SyntheticCountsPropagation.cpp | 103 const CallGraphNode::CallRecord &Edge) { in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 52 unsigned StartIdx, unsigned Edge) { in insertLeaf()
63 unsigned Edge) { in insertInternalNode()
|
| /freebsd/contrib/llvm-project/lld/COFF/ |
| H A D | CallGraphSort.cpp | 28 struct Edge { struct
29 int from;
30 uint64_t weight;
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ModuleSummaryIndex.cpp | 395 struct Edge { struct
396 uint64_t SrcMod;
397 int Hotness;
398 GlobalValue::GUID Src;
399 GlobalValue::GUID Dst;
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDGPrinter.cpp | 130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes()
|
| H A D | DomTreeUpdater.cpp | 257 auto Edge = std::make_pair(U.getFrom(), U.getTo()); in applyUpdatesPermissive() local
|
| H A D | DependenceGraphBuilder.cpp | 397 EdgeType &Edge = N->back(); in simplify() local
|
| /freebsd/contrib/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 40 struct Edge { struct
41 int from;
42 uint64_t weight;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | SCCIterator.h | 276 bool unionGroups(const EdgeType *Edge) { in unionGroups()
351 for (const auto *Edge : MSTEdges) in scc_member_iterator() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
| H A D | GCOV.h | 287 void addSrcEdge(GCOVArc *Edge) { pred.push_back(Edge); } in addSrcEdge()
289 void addDstEdge(GCOVArc *Edge) { succ.push_back(Edge); } in addDstEdge()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BranchProbabilityInfo.h | 328 using Edge = std::pair<const BasicBlock *, unsigned>; variable
|
| H A D | SparsePropagation.h | 131 using Edge = std::pair<BasicBlock *, BasicBlock *>; variable
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileInference.h | 124 using Edge = std::pair<const BasicBlockT *, const BasicBlockT *>; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 231 for (const auto &Edge : Edges) in iterativelySimplifyCFG() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 120 using Edge = typename GraphT::Edge; typedef
151 using Edge = MachineGadgetGraph::Edge; typedef in __anonefcbe3d90111::X86LoadValueInjectionLoadHardeningPass
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ |
| H A D | TargetLoweringObjectFile.cpp | 178 for (const auto &Edge : CFGProfile->operands()) { in emitCGProfileMetadata() local
|
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | GCOV.cpp | 446 for (const GCOVArc *Edge : pred) in print() local
452 for (const GCOVArc *Edge : succ) { in print() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CriticalAntiDepBreaker.cpp | 554 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
|