Home
last modified time | relevance | path

Searched refs:Edges (Results 1 – 25 of 50) sorted by relevance

12

/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/XRay/
DGraph.h113 EdgeMapT Edges;
255 : M(G.Edges), A(A), NL(isOut ? G.OutNeighbors : G.InNeighbors) {} in InOutEdgeView()
322 iterator begin() { return G.Edges.begin(); } in begin()
323 iterator end() { return G.Edges.end(); } in end()
324 const_iterator cbegin() const { return G.Edges.cbegin(); } in cbegin()
325 const_iterator cend() const { return G.Edges.cend(); } in cend()
326 const_iterator begin() const { return G.Edges.begin(); } in begin()
327 const_iterator end() const { return G.Edges.end(); } in end()
328 size_type size() const { return G.Edges.size(); } in size()
329 bool empty() const { return G.Edges.empty(); } in empty()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DLazyCallGraph.h258 iterator begin() { return iterator(Edges.begin(), Edges.end()); } in begin()
259 iterator end() { return iterator(Edges.end(), Edges.end()); } in end()
261 Edge &operator[](int i) { return Edges[i]; }
264 auto &E = Edges[EdgeIndexMap.find(&N)->second];
273 auto &E = Edges[EI->second]; in lookup()
278 return call_iterator(Edges.begin(), Edges.end()); in call_begin()
280 call_iterator call_end() { return call_iterator(Edges.end(), Edges.end()); } in call_end()
287 for (auto &E : Edges) in empty()
295 VectorT Edges;
343 bool isPopulated() const { return Edges.hasValue(); } in isPopulated()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll6 ; CHECK-LABEL: Edges in function: f
54 ; CHECK-LABEL: Edges in function: test0
67 ; CHECK-LABEL: Edges in function: test1
111 ; CHECK-LABEL: Edges in function: test2
131 ; CHECK-LABEL: Edges in function: test3_aa1
143 ; CHECK-LABEL: Edges in function: test3_aa2
155 ; CHECK-LABEL: Edges in function: test3_ab1
167 ; CHECK-LABEL: Edges in function: test3_ab2
179 ; CHECK-LABEL: Edges in function: test3_ac1
191 ; CHECK-LABEL: Edges in function: test3_ac2
[all …]
Dnon-leaf-intrinsics.ll11 ; CHECK: Edges in function: calls_statepoint
20 ; CHECK: Edges in function: calls_patchpoint
/external/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll6 ; CHECK-LABEL: Edges in function: f
54 ; CHECK-LABEL: Edges in function: test0
67 ; CHECK-LABEL: Edges in function: test1
111 ; CHECK-LABEL: Edges in function: test2
131 ; CHECK-LABEL: Edges in function: test3_aa1
143 ; CHECK-LABEL: Edges in function: test3_aa2
155 ; CHECK-LABEL: Edges in function: test3_ab1
167 ; CHECK-LABEL: Edges in function: test3_ab2
179 ; CHECK-LABEL: Edges in function: test3_ac1
191 ; CHECK-LABEL: Edges in function: test3_ac2
[all …]
Dnon-leaf-intrinsics.ll11 ; CHECK: Edges in function: calls_statepoint
20 ; CHECK: Edges in function: calls_patchpoint
/external/bcc/tools/
Ddeadlock_detector_example.txt269 Mutexes: 0, Edges: 0
270 Mutexes: 532, Edges: 411
271 Mutexes: 735, Edges: 675
272 Mutexes: 1118, Edges: 1278
273 Mutexes: 1666, Edges: 2185
274 Mutexes: 2056, Edges: 2694
275 Mutexes: 2245, Edges: 2906
276 Mutexes: 2656, Edges: 3479
277 Mutexes: 2813, Edges: 3785
290 Mutexes: 0, Edges: 0
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h188 EdgeVector Edges; variable
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
225 Edges[EId] = std::move(E); in addConstructedEdge()
227 EId = Edges.size(); in addConstructedEdge()
228 Edges.push_back(std::move(E)); in addConstructedEdge()
280 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
320 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
321 bool empty() const { return G.Edges.empty(); } in empty()
323 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h174 EdgeVector Edges; variable
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
213 Edges[EId] = std::move(E); in addConstructedEdge()
215 EId = Edges.size(); in addConstructedEdge()
216 Edges.push_back(std::move(E)); in addConstructedEdge()
264 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
307 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
309 bool empty() const { return G.Edges.empty(); } in empty()
312 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h207 mutable EdgeVectorT Edges; variable
240 return edge_iterator(Edges.begin(), Edges.end()); in begin()
242 edge_iterator end() const { return edge_iterator(Edges.end(), Edges.end()); } in end()
244 const Edge &operator[](int i) const { return Edges[i]; }
247 return Edges[EdgeIndexMap.find(&F)->second];
252 return call_edge_iterator(Edges.begin(), Edges.end()); in call_begin()
255 return call_edge_iterator(Edges.end(), Edges.end()); in call_end()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DLazyCallGraph.cpp45 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
50 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
66 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
74 assert(!Edges && "Must not have already populated the edges for this node!"); in populateSlow()
79 Edges = EdgeSequence(); in populateSlow()
108 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
[all …]
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles_test.cc40 typedef std::vector<Edge> Edges; typedef
43 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
68 static void PrintEdges(Edges *edges) { in PrintEdges()
92 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges, in PrintTransitiveClosure()
123 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, in CheckTransitiveClosure()
146 static void CheckEdges(Nodes *nodes, Edges *edges, in CheckEdges()
183 static int RandomEdge(std::mt19937 *rnd, Edges *edges) { in RandomEdge()
189 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
200 Edges edges; // from, to in TEST()
/external/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp137 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
138 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
140 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in iterativelySimplifyCFG()
141 LoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second)); in iterativelySimplifyCFG()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp153 SmallVector<std::pair<const BasicBlock *, const BasicBlock *>, 32> Edges; in iterativelySimplifyCFG() local
154 FindFunctionBackedges(F, Edges); in iterativelySimplifyCFG()
156 for (unsigned i = 0, e = Edges.size(); i != e; ++i) in iterativelySimplifyCFG()
157 LoopHeaders.insert(const_cast<BasicBlock *>(Edges[i].second)); in iterativelySimplifyCFG()
/external/llvm/test/Transforms/GCOVProfiling/
Dreturn-block.ll77 ; RETURN-LAST: Destination Edges
78 ; RETURN-SECOND-NOT: Destination Edges
81 ; RETURN-LAST-NOT: Destination Edges
82 ; RETURN-SECOND: Destination Edges
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/GCOVProfiling/
Dreturn-block.ll78 ; RETURN-LAST: Destination Edges
79 ; RETURN-SECOND-NOT: Destination Edges
82 ; RETURN-LAST-NOT: Destination Edges
83 ; RETURN-SECOND: Destination Edges
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
37 EdgeIndexMap.insert({&F, Edges.size()}).second) { in addEdge()
39 Edges.emplace_back(LazyCallGraph::Edge(F, EK)); in addEdge()
45 SmallVectorImpl<LazyCallGraph::Edge> &Edges, in findReferences() argument
51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref); in findReferences()
81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call); in Node()
93 findReferences(Worklist, Visited, Edges, EdgeIndexMap); in Node()
100 EdgeIndexMap.insert({&Target, Edges.size()}); in insertEdgeInternal()
101 Edges.emplace_back(Target, EK); in insertEdgeInternal()
105 EdgeIndexMap.insert({&TargetN.getFunction(), Edges.size()}); in insertEdgeInternal()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DMachineBlockPlacement.cpp495 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
931 Edges) { in getBestNonConflictingEdges() argument
941 std::stable_sort(Edges[0].begin(), Edges[0].end(), Cmp); in getBestNonConflictingEdges()
942 std::stable_sort(Edges[1].begin(), Edges[1].end(), Cmp); in getBestNonConflictingEdges()
943 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
944 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
989 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1001 Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ}); in getBestTrellisSuccessor()
1008 std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges); in getBestTrellisSuccessor()
1134 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
[all …]
DAggressiveAntiDepBreaker.cpp266 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
272 Edges.push_back(&*P); in AntiDepEdges()
833 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
835 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
851 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
852 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/X86/
DX86DomainReassignment.cpp308 DenseSet<unsigned> Edges; member in __anondbe5f26e0111::Closure
338 bool empty() const { return Edges.empty(); } in empty()
341 return Edges.insert(Reg).second; in insertEdge()
346 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end()); in edges()
360 for (unsigned Reg : Edges) { in dump()
/external/swiftshader/third_party/llvm-7.0/llvm/test/ThinLTO/X86/
Ddot-dumper.ll30 ; CLUSTER0-NEXT: // Edges:
40 ; CLUSTER1-NEXT: // Edges:
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DModuleSummaryIndex.h475 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
481 std::move(Edges), std::vector<GlobalValue::GUID>(),
854 std::vector<FunctionSummary::EdgeTy> Edges;
859 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
861 if (Edges.empty()) {
865 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
/external/llvm/lib/CodeGen/
DAggressiveAntiDepBreaker.cpp252 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) { in AntiDepEdges() argument
258 Edges.push_back(&*P); in AntiDepEdges()
815 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
817 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
833 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
834 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
/external/llvm/lib/Transforms/Instrumentation/
DPGOInstrumentation.cpp447 static uint64_t sumEdgeCount(const ArrayRef<PGOUseEdge *> Edges) { in sumEdgeCount() argument
449 for (auto &E : Edges) { in sumEdgeCount()
511 void setEdgeCount(DirectEdges &Edges, uint64_t Value);
571 void PGOUseFunc::setEdgeCount(DirectEdges &Edges, uint64_t Value) { in setEdgeCount() argument
572 for (auto &E : Edges) { in setEdgeCount()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonISelDAGToDAGHVX.cpp131 std::map<Node,NodeSet> Edges; member
172 Edges[I].insert(PC); in build()
183 NodeSet &Is = Edges[I]; in build()
195 NodeSet &Ns = Edges[Q[I]]; in color()
206 NodeSet &Ns = Edges[N]; in color()
214 for (auto E : Edges) { in color()
227 for (auto E : Edges) { in color()
235 NodeSet &Ns = Edges[N]; in color()
246 NodeSet &Cs = Edges[C]; in color()
253 Edges[M].insert(C); in color()
[all …]

12