Home
last modified time | relevance | path

Searched defs:Edges (Results 1 – 24 of 24) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h158 auto &Edges = ProfiledFunctions[CallerName]->Edges; variable
59 edges Edges; global() member
197 auto &Edges = Node.second.Edges; global() variable
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h62 const Edge *Edges; variable
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph()
289 std::unique_ptr<Edge[]> Edges; variable
H A DX86DomainReassignment.cpp301 DenseSet<Register> Edges; member in __anond9661d290111::Closure
H A DX86LoadValueInjectionLoadHardening.cpp626 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
/freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchDag.h
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DAggressiveAntiDepBreaker.cpp257 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges()
804 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
H A DMachineBlockPlacement.cpp1022 Edges) { in getBestNonConflictingEdges()
1080 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1273 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h165 EdgeListTy Edges; variable
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp233 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
H A DJumpThreading.cpp527 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in findLoopHeaders() local
/freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h279 using Edges = SmallVector<GCOVArc *, 4>; variable
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h381 std::optional<EdgeSequence> Edges; variable
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
1164 ArrayRef<std::pair<Node *, Node *>> Edges) { in removeInternalRefEdges() argument
H A DModuleSummaryAnalysis.cpp575 SmallPtrSet<const User *, 8> &Cache) { in computeFunctionSummary()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h173 EdgeVector Edges; variable
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp290 auto *Edges = getEdgesWithAllocInfo(); in getContextIds() local
306 auto *Edges = getEdgesWithAllocInfo(); in computeAllocType() local
324 auto *Edges = getEdgesWithAllocInfo(); in emptyContextIds() local
834 &Edges) { in allocTypesMatch()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1076 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount()
1294 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp338 std::vector<std::pair<ChainT *, ChainEdge *>> Edges; global() member
[all...]
H A DSampleProfileInference.cpp573 std::vector<std::vector<Edge>> Edges; member in __anon5aecd1f00111::MinCostMaxFlow
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1672 std::vector<DisplayEdge> Edges; member in __anon94a753662a11::DisplayNode
1845 std::vector<unsigned> Edges; member in __anon94a753662a11::DotCfgDiffNode
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h357 std::vector<Edge> Edges; variable
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp137 std::map<Node,NodeSet> Edges; member
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp7812 std::vector<FunctionSummary::EdgeTy> Edges = makeCallList( in parseEntireSummary() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp5495 TreeEntry *UserTE, SmallVectorImpl<std::pair<unsigned, TreeEntry *>> &Edges, in canReorderOperands() argument