Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 223) sorted by relevance

123456789

/llvm-project-15.0.7/llvm/unittests/XRay/
H A DGraphTest.cpp95 EXPECT_FALSE(G.edges().empty()); in graphEdgeTester()
103 EXPECT_NE(G.edges().end(), in graphEdgeTester()
104 std::find_if(G.edges().begin(), G.edges().end(), Pred)); in graphEdgeTester()
108 for (auto &EV : G.edges()) { in graphEdgeTester()
193 EXPECT_TRUE(G.edges().empty()); in TEST()
195 EXPECT_EQ(G.edges().begin(), G.edges().end()); in TEST()
212 EXPECT_EQ(0u, G.edges().size()); in TEST()
214 EXPECT_TRUE(G.edges().empty()); in TEST()
216 EXPECT_EQ(G.edges().begin(), G.edges().end()); in TEST()
240 EXPECT_EQ(1u, G.edges().size()); in TEST()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/FunctionImport/
H A Dfuncimport_forcecold.ll1 ; Test to ensure that building summary with -force-summary-edges-cold
13 ; Next rebuild caller module summary with non-critical edges forced cold (which
14 ; should affect all edges in this test as we don't have any sample pgo).
16 ; RUN: opt -force-summary-edges-cold=all-non-critical -module-summary %s -o %t.bc
20 ; Next rebuild caller module summary with all edges forced cold.
22 ; RUN: opt -force-summary-edges-cold=all -module-summary %s -o %t.bc
H A Dfuncimport_forcecold_samplepgo.ll1 ; Test to ensure that building summary with -force-summary-edges-cold
13 ; Next rebuild caller module summary with only non-critical edges forced cold,
15 ; RUN: opt -force-summary-edges-cold=all-non-critical -module-summary %s -o %t.bc
19 ; Next rebuild caller module summary with all edges forced cold.
21 ; RUN: opt -force-summary-edges-cold=all -module-summary %s -o %t.bc
/llvm-project-15.0.7/llvm/test/ExecutionEngine/JITLink/X86/
H A DMachO_x86-64_self_relocation.test10 # WITHOUT-NEXT: edges
17 # CHECK-NEXT: edges
27 # WITHOUT-NEXT: edges
33 # CHECK-NEXT: edges
/llvm-project-15.0.7/mlir/unittests/Conversion/PDLToPDLInterp/
H A DRootOrderingTest.cpp49 void check(unsigned cost, const OptimalBranching::EdgeList &edges) { in check() argument
52 EXPECT_EQ(opt.preOrderTraversal({v, v + edges.size()}), edges); in check()
53 for (std::pair<Value, Value> edge : edges) in check()
/llvm-project-15.0.7/lld/MachO/
H A DExportTrie.cpp83 std::vector<Edge> edges; member
111 for (const Edge &edge : edges) { in updateOffset()
137 assert(edges.size() < 256); in writeTo()
138 *buf++ = edges.size(); in writeTo()
140 for (const Edge &edge : edges) { in writeTo()
204 node->edges.emplace_back(pivotSymbol->getName().slice(lastPos, pos), in sortAndBuild()
/llvm-project-15.0.7/llvm/test/tools/sancov/
H A Dignorelist.test20 STATS: all-edges: 9
21 STATS: cov-edges: 7
25 STATS-BLIST: all-edges: 8
26 STATS-BLIST: cov-edges: 6
H A Dstats.test4 CHECK: all-edges: 8
5 CHECK: cov-edges: 5
/llvm-project-15.0.7/llvm/lib/ExecutionEngine/JITLink/
H A Dx86_64.cpp80 for (auto &E : B->edges()) { in optimizeGOTAndStubAccesses()
99 auto &GOTTarget = GOTEntryBlock.edges().begin()->getTarget(); in optimizeGOTAndStubAccesses()
163 auto &GOTBlock = StubBlock.edges().begin()->getTarget().getBlock(); in optimizeGOTAndStubAccesses()
169 auto &GOTTarget = GOTBlock.edges().begin()->getTarget(); in optimizeGOTAndStubAccesses()
/llvm-project-15.0.7/llvm/test/Transforms/Inline/ML/
H A Dscc-dead-accounting.ll1 ; MRE for SCC splitting causing MLInlineAdvisor to lose track of edges
5 ; However, MLInlineAdvisor should still track the edges of foo and bar onPassExit
7 ; and as a result could gain/lose edges before the inliner sees it again
10 ; edges would increase but wouldn't be tracked
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h52 using edges = std::set<edge, ProfiledCallGraphEdgeComparer>; member
53 using iterator = edges::iterator;
54 using const_iterator = edges::const_iterator;
59 edges Edges;
/llvm-project-15.0.7/llvm/test/Transforms/Util/
H A DPR37334-break-crit-edges-require-dt.ll2 ; RUN: opt < %s -loop-sink -break-crit-edges -branch-prob -S -enable-new-pm=0 | FileCheck %s
3 ; RUN: opt < %s -loop-sink -break-crit-edges -lazy-block-freq -S -enable-new-pm=0 | FileCheck %s
4 ; RUN: opt < %s -loop-sink -break-crit-edges -lazy-branch-prob -S -enable-new-pm=0 | FileCheck %s
/llvm-project-15.0.7/llvm/test/Analysis/BlockFrequencyInfo/
H A Ddouble_exit.ll15 ; Pseudo-edges = exit
28 ; Pseudo-edges = outer.inc @ 1/5, exit @ 1/5
88 ; Pseudo-edges = exit
101 ; Pseudo-edges = outer.inc
114 ; Pseudo-edges = middle.inc @ 1/5, outer.inc @ 1/5
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp549 for (const Edge &E : G.edges()) { in elimMitigatedEdgesAndNodes()
554 for (const Edge &DE : Dest->edges()) in elimMitigatedEdgesAndNodes()
564 if (llvm::none_of(RootN.edges(), MachineGadgetGraph::isGadgetEdge)) in elimMitigatedEdgesAndNodes()
573 for (const Edge &E : N->edges()) { in elimMitigatedEdgesAndNodes()
583 for (const Edge &E : RootN.edges()) { in elimMitigatedEdgesAndNodes()
636 for (const Edge &E : Graph->edges()) { in hardenLoadsWithPlugin()
677 for (const Edge &E : Graph->edges()) in hardenLoadsWithHeuristic()
690 for (const Edge &E : N.edges()) { in hardenLoadsWithHeuristic()
696 for (const Edge &EgressEdge : N.edges()) in hardenLoadsWithHeuristic()
730 for (const Edge &E : N.edges()) { in insertFences()
[all …]
/llvm-project-15.0.7/llvm/unittests/ExecutionEngine/JITLink/
H A DLinkGraphTests.cpp84 auto &E1 = *B1.edges().begin(); in TEST()
576 EXPECT_EQ(llvm::size(B1.edges()), 2); in TEST()
577 if (size(B1.edges()) == 2) { in TEST()
578 auto *E1 = &*B1.edges().begin(); in TEST()
579 auto *E2 = &*(B1.edges().begin() + 1); in TEST()
586 EXPECT_EQ(llvm::size(B2.edges()), 2); in TEST()
587 if (size(B2.edges()) == 2) { in TEST()
588 auto *E1 = &*B2.edges().begin(); in TEST()
589 auto *E2 = &*(B2.edges().begin() + 1); in TEST()
/llvm-project-15.0.7/llvm/tools/llvm-jitlink/
H A Dllvm-jitlink-elf.cpp28 auto EItr = std::find_if(B.edges().begin(), B.edges().end(), in getFirstRelocationEdge()
30 if (EItr == B.edges().end()) in getFirstRelocationEdge()
H A Dllvm-jitlink-macho.cpp30 auto EItr = std::find_if(B.edges().begin(), B.edges().end(), in getFirstRelocationEdge()
32 if (EItr == B.edges().end()) in getFirstRelocationEdge()
H A Dllvm-jitlink-coff.cpp28 auto EItr = std::find_if(B.edges().begin(), B.edges().end(), in getFirstRelocationEdge()
30 if (EItr == B.edges().end()) in getFirstRelocationEdge()
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DCallGraph.cpp56 return llvm::any_of(edges, [](const Edge &edge) { return edge.isChild(); }); in hasChildren()
61 edges.insert({node, kind}); in addEdge()
162 it.second->edges.remove_if([node](const CallGraphNode::Edge &edge) { in eraseNode()
/llvm-project-15.0.7/llvm/docs/HistoricalNotes/
H A D2003-06-25-Reoptimizer1.txt7 back-edges and insert llvm_first_trigger() function call which takes
30 How do we keep track of which edges to instrument, and which edges are
34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
41 3) Mark BBs which end in edges that exit the hot region; we need to
/llvm-project-15.0.7/bolt/test/runtime/X86/
H A Dinstrumentation-dup-jts.s5 # we can split the edges correctly (each copy of the jump table may have
6 # different split edges). For this to happen, we need to correctly match
/llvm-project-15.0.7/llvm/test/Analysis/RegionInfo/
H A Doutgoing_edge.ll8 ; forward edges into the region and outgoing forward edges from the region.
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h111 iterator begin() const { return edges.begin(); } in begin()
112 iterator end() const { return edges.end(); } in end()
144 edges; variable
/llvm-project-15.0.7/llvm/docs/DependenceGraphs/
H A Dindex.rst114 …- DDG nodes and edges are completely disjoint from PDG nodes and edges allowing them to change eas…
119 …- There are some similarities between DDG nodes and edges compared to PDG nodes and edges, but the…
133 …ndency edges between nodes namely *loop dependency*, *flow-*, *anti-*, *output-*, and *input-* dep…
/llvm-project-15.0.7/mlir/lib/Transforms/
H A DViewOpGraph.cpp98 for (const std::string &edge : edges) in emitAllEdgeStmts()
100 edges.clear(); in emitAllEdgeStmts()
182 edges.push_back(strFromOs([&](raw_ostream &os) { in emitEdgeStmt()
308 std::vector<std::string> edges; member in __anon2ace0bc30211::PrintOpPass

123456789