Home
last modified time | relevance | path

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

/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h58 edges Edges; member
158 auto &Edges = ProfiledFunctions[CallerName]->Edges; variable
197 auto &Edges = Node.second->Edges; variable
/freebsd-src/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 __anon9c8882fb0111::Closure
H A DX86LoadValueInjectionLoadHardening.cpp627 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); hardenLoadsWithPlugin() local
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DAggressiveAntiDepBreaker.cpp257 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
804 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
H A DMachineBlockPlacement.cpp1017 getBestNonConflictingEdges(const MachineBasicBlock * BB,MutableArrayRef<SmallVector<MachineBlockPlacement::WeightedEdge,8>> Edges) getBestNonConflictingEdges() argument
1075 SmallVector<WeightedEdge, 8> Edges[2]; getBestTrellisSuccessor() local
1268 std::vector<MachineBasicBlock *> Edges; precomputeTriangleChains() member
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h165 EdgeListTy Edges; variable
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimplifyCFGPass.cpp228 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; iterativelySimplifyCFG() local
H A DJumpThreading.cpp527 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in findLoopHeaders() local
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DGCOV.h279 using Edges = SmallVector<GCOVArc *, 4>; variable
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h381 std::optional<EdgeSequence> Edges; global() variable
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h173 EdgeVector Edges; variable
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1025 sumEdgeCount(const ArrayRef<PGOUseEdge * > Edges) sumEdgeCount() argument
1240 setEdgeCount(DirectEdges & Edges,uint64_t Value) setEdgeCount() argument
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DModuleSummaryAnalysis.cpp534 __anon98c1b64d0202(const std::vector<const Instruction *> &Instrs, SetVector<ValueInfo, std::vector<ValueInfo>> &Edges, SmallPtrSet<const User *, 8> &Cache) computeFunctionSummary() argument
H A DLazyCallGraph.cpp60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp573 std::vector<std::vector<Edge>> Edges; global() member in __anoncacc37820111::MinCostMaxFlow
[all...]
H A DCodeLayout.cpp363 std::vector<std::pair<ChainT *, ChainEdge *>> Edges; member
/freebsd-src/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1579 std::vector<DisplayEdge> Edges; global() member in __anon834b46f82a11::DisplayNode
1752 std::vector<unsigned> Edges; global() member in __anon834b46f82a11::DotCfgDiffNode
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h356 std::vector<Edge> Edges; global() variable
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DMemProfContextDisambiguation.cpp755 allocTypesMatch(const std::vector<uint8_t> & InAllocTypes,const std::vector<std::shared_ptr<ContextEdge<DerivedCCG,FuncTy,CallTy>>> & Edges) allocTypesMatch() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp137 std::map<Node,NodeSet> Edges; member
/freebsd-src/contrib/llvm-project/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp7497 std::vector<FunctionSummary::EdgeTy> Edges = makeCallList( parseEntireSummary() local
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp4568 canReorderOperands(TreeEntry * UserTE,SmallVectorImpl<std::pair<unsigned,TreeEntry * >> & Edges,ArrayRef<TreeEntry * > ReorderableGathers,SmallVectorImpl<TreeEntry * > & GatherOps) canReorderOperands() argument