Home
last modified time | relevance | path

Searched defs:Edge (Results 1 – 25 of 50) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/lld/MachO/
DExportTrie.cpp52 struct Edge { struct
53 Edge(StringRef s, TrieNode *node) : substring(s), child(node) {} in Edge() function
55 StringRef substring;
56 struct TrieNode *child;
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h390 struct Edge { struct
404 Edge edges_[BV::kSize * 32]; argument
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp216 struct Edge { struct
219 const BasicBlock *SrcBB;
220 const BasicBlock *DestBB;
221 uint64_t Weight;
222 BasicBlock *Place = nullptr;
223 uint32_t SrcNumber, DstNumber;
224 bool InMST = false;
225 bool Removed = false;
226 bool IsCritical = false;
228 Edge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W = 1) in Edge() argument
[all …]
DMaximumSpanningTree.h29 typedef std::pair<const T*, const T*> Edge; typedef
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/
DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf()
55 unsigned EndIdx, unsigned Edge) { in insertInternalNode()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/LTO/
DSummaryBasedOptimizations.cpp53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
76 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
DModuleSummaryIndex.cpp377 struct Edge { struct
378 uint64_t SrcMod;
379 int Hotness;
380 GlobalValue::GUID Src;
381 GlobalValue::GUID Dst;
/freebsd-12-stable/contrib/llvm-project/lld/ELF/
DCallGraphSort.cpp55 struct Edge { struct
56 int from;
57 uint64_t weight;
/freebsd-12-stable/contrib/llvm-project/lld/COFF/
DCallGraphSort.cpp27 struct Edge { struct
28 int from;
29 uint64_t weight;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DDDGPrinter.cpp130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes()
DCFLGraph.h61 struct Edge { struct
66 using EdgeList = std::vector<Edge>; argument
DDomTreeUpdater.cpp257 auto Edge = std::make_pair(U.getFrom(), U.getTo()); in applyUpdatesPermissive() local
DCFLSteensAliasAnalysis.cpp219 for (auto &Edge : ValueInfo.getNodeInfoAtLevel(I).Edges) in buildSetsFrom() local
DDependenceGraphBuilder.cpp396 EdgeType &Edge = N->back(); in simplify() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
DSyntheticCountsPropagation.cpp109 const CallGraphNode::CallRecord &Edge) { in run()
DFunctionImport.cpp392 for (auto &Edge : Summary.calls()) { in computeImportForFunction() local
738 for (auto &Edge : FS->calls()) in ComputeCrossModuleImport() local
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/
DGCOV.h287 void addSrcEdge(GCOVArc *Edge) { pred.push_back(Edge); } in addSrcEdge()
289 void addDstEdge(GCOVArc *Edge) { succ.push_back(Edge); } in addDstEdge()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
DLazyCallGraph.h1212 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function
1213 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
DBranchProbabilityInfo.h318 using Edge = std::pair<const BasicBlock *, unsigned>; variable
DSparsePropagation.h129 using Edge = std::pair<BasicBlock *, BasicBlock *>; variable
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
DLoopPeel.cpp609 for (auto Edge : ExitEdges) in cloneLoopBlocks() local
703 for (auto Edge : ExitEdges) { in peelLoop() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/
DTargetLoweringObjectFile.cpp180 for (const auto &Edge : CFGProfile->operands()) { in emitCGProfileMetadata() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/X86/
DX86LoadValueInjectionLoadHardening.cpp121 using Edge = typename GraphT::Edge; typedef
152 using Edge = MachineGadgetGraph::Edge; typedef in __anonf47691290111::X86LoadValueInjectionLoadHardeningPass
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ProfileData/
DGCOV.cpp411 for (const GCOVArc *Edge : pred) in print() local
417 for (const GCOVArc *Edge : succ) { in print() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DCriticalAntiDepBreaker.cpp559 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local

12