Home
last modified time | relevance | path

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

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/X86/
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
DX86DomainReassignment.cpp301 DenseSet<Register> Edges; member in __anone7cb3d410111::Closure
DX86LoadValueInjectionLoadHardening.cpp629 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp218 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
DJumpThreading.cpp610 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in findLoopHeaders() local
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
DGIMatchDag.h79 EdgesVec Edges; variable
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/
DDirectedGraph.h164 EdgeListTy Edges; variable
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DAggressiveAntiDepBreaker.cpp259 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges()
824 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
DMachineBlockPlacement.cpp986 Edges) { in getBestNonConflictingEdges()
1044 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1237 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/
DGCOV.h279 using Edges = SmallVector<GCOVArc *, 4>; variable
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
DLazyCallGraph.h384 Optional<EdgeSequence> Edges; variable
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DCFLGraph.h69 EdgeList Edges, ReverseEdges; member
DModuleSummaryAnalysis.cpp395 SmallPtrSet<const User *, 8> &Cache) { in computeFunctionSummary()
DLazyCallGraph.cpp63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
DGraph.h173 EdgeVector Edges; variable
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
DPGOInstrumentation.cpp1045 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount()
1237 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
DJITLink.h339 std::vector<Edge> Edges; variable
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
DHexagonISelDAGToDAGHVX.cpp131 std::map<Node,NodeSet> Edges; member
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
DAttributorAttributes.cpp9478 const SetVector<Function *> &Edges = AAEdges.getOptimisticEdges(); in canReach() local
9502 const SetVector<Function *> &Edges = AAEdges.getOptimisticEdges(); in updateImpl() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Bitcode/Reader/
DBitcodeReader.cpp6354 std::vector<FunctionSummary::EdgeTy> Edges = makeCallList( in parseEntireSummary() local