| /openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 59 edges Edges; member
147 auto &Edges = ProfiledFunctions[CallerName].Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 62 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 D | X86DomainReassignment.cpp | 302 DenseSet<Register> Edges; member in __anon73142a400111::Closure
|
| H A D | X86LoadValueInjectionLoadHardening.cpp | 628 auto Edges = std::make_unique<unsigned int[]>(Graph->edges_size()); in hardenLoadsWithPlugin() local
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/GlobalISel/ |
| H A D | GIMatchDag.h | 78 EdgesVec Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | AggressiveAntiDepBreaker.cpp | 258 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges()
813 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
|
| H A D | MachineBlockPlacement.cpp | 1018 Edges) { in getBestNonConflictingEdges()
1076 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1269 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | DirectedGraph.h | 165 EdgeListTy Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | SimplifyCFGPass.cpp | 228 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
|
| H A D | JumpThreading.cpp | 620 SmallVector<std::pair<const BasicBlock*,const BasicBlock*>, 32> Edges; in findLoopHeaders() local
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ProfileData/ |
| H A D | GCOV.h | 275 using Edges = SmallVector<GCOVArc *, 4>; variable
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 381 std::optional<EdgeSequence> Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 173 EdgeVector Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | ModuleSummaryAnalysis.cpp | 486 SmallPtrSet<const User *, 8> &Cache) { in computeFunctionSummary()
|
| H A D | LazyCallGraph.cpp | 60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 1016 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount()
1211 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 572 std::vector<std::vector<Edge>> Edges; member in __anon16945f270111::MinCostMaxFlow
|
| H A D | CodeLayout.cpp | 330 std::vector<std::pair<Chain *, ChainEdge *>> Edges; member in __anone35372fe0111::Chain
|
| /openbsd-src/gnu/llvm/llvm/lib/Passes/ |
| H A D | StandardInstrumentations.cpp | 1325 std::vector<DisplayEdge> Edges; member in __anon0dac999d2511::DisplayNode
1498 std::vector<unsigned> Edges; member in __anon0dac999d2511::DotCfgDiffNode
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/ExecutionEngine/JITLink/ |
| H A D | JITLink.h | 351 std::vector<Edge> Edges; variable
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAGHVX.cpp | 137 std::map<Node,NodeSet> Edges; member
|
| /openbsd-src/gnu/llvm/llvm/lib/Bitcode/Reader/ |
| H A D | BitcodeReader.cpp | 7445 std::vector<FunctionSummary::EdgeTy> Edges = makeCallList( in parseEntireSummary() local
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 4345 TreeEntry *UserTE, SmallVectorImpl<std::pair<unsigned, TreeEntry *>> &Edges, in canReorderOperands()
|