Home
last modified time | relevance | path

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

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DDirectedGraph.h77 explicit DGNode(EdgeType &E) : Edges() { Edges.insert(&E); } in DGNode()
80 explicit DGNode(const DGNode<NodeType, EdgeType> &N) : Edges(N.Edges) {} in DGNode()
81 DGNode(DGNode<NodeType, EdgeType> &&N) : Edges(std::move(N.Edges)) {} in DGNode()
84 Edges = N.Edges;
88 Edges = std::move(N.Edges);
97 const_iterator begin() const { return Edges.begin(); } in begin()
98 const_iterator end() const { return Edges.end(); } in end()
99 iterator begin() { return Edges.begin(); } in begin()
100 iterator end() { return Edges.end(); } in end()
101 const EdgeType &front() const { return *Edges.front(); } in front()
[all …]
/third_party/glslang/Test/baseResults/
Dhlsl.hull.6.tesc.out7 …antHS(struct-VSOutput-vf4-vf31[1];u1;f1[2]; ( temp structure{ temp 4-element array of float Edges})
15 0:19 Edges: direct index for structure ( temp 4-element array of float)
16 0:19 'Factors' ( temp structure{ temp 4-element array of float Edges})
25 0:20 Edges: direct index for structure ( temp 4-element array of float)
26 0:20 'Factors' ( temp structure{ temp 4-element array of float Edges})
35 0:21 Edges: direct index for structure ( temp 4-element array of float)
36 0:21 'Factors' ( temp structure{ temp 4-element array of float Edges})
45 0:22 Edges: direct index for structure ( temp 4-element array of float)
46 0:22 'Factors' ( temp structure{ temp 4-element array of float Edges})
68 0:27 'Factors' ( temp structure{ temp 4-element array of float Edges})
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
DGraph.h112 EdgeMapT Edges;
254 : M(G.Edges), A(A), NL(isOut ? G.OutNeighbors : G.InNeighbors) {} in InOutEdgeView()
321 iterator begin() { return G.Edges.begin(); } in begin()
322 iterator end() { return G.Edges.end(); } in end()
323 const_iterator cbegin() const { return G.Edges.cbegin(); } in cbegin()
324 const_iterator cend() const { return G.Edges.cend(); } in cend()
325 const_iterator begin() const { return G.Edges.begin(); } in begin()
326 const_iterator end() const { return G.Edges.end(); } in end()
327 size_type size() const { return G.Edges.size(); } in size()
328 bool empty() const { return G.Edges.empty(); } in empty()
[all …]
/third_party/glslang/Test/
Dhlsl.hull.6.tesc11 float Edges[4] : SV_TessFactor;
19 Factors.Edges[0] = 2.5;
20 Factors.Edges[1] = 4.25;
21 Factors.Edges[2] = 5.75;
22 Factors.Edges[3] = 7.5;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.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 …]
DBlockFrequencyInfoImpl.h603 std::deque<const IrrNode *> Edges;
609 iterator pred_begin() const { return Edges.begin(); }
610 iterator succ_begin() const { return Edges.begin() + NumIn; }
612 iterator succ_end() const { return Edges.end(); }
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_btree_test.cc167 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
171 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
279 EXPECT_THAT(tree->Edges(), ElementsAre()); in TEST()
287 EXPECT_THAT(tree->Edges(), ElementsAre()); in TEST()
354 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 EXPECT_THAT(tree->Edges(), ElementsAre(leaf)); in TEST()
379 EXPECT_THAT(result->Edges(), ElementsAreArray(flats)); in TEST_P()
397 EXPECT_THAT(result->Edges(), ElementsAreArray(flats)); in TEST_P()
424 EXPECT_THAT(result->Edges(), ElementsAreArray(flats)); in TEST_P()
438 absl::Span<CordRep* const> edges = result->Edges(); in TEST_P()
[all …]
Dcord_rep_btree.h255 inline absl::Span<CordRep* const> Edges() const;
256 inline absl::Span<CordRep* const> Edges(size_t begin, size_t end) const;
543 inline absl::Span<CordRep* const> CordRepBtree::Edges() const { in Edges() function
547 inline absl::Span<CordRep* const> CordRepBtree::Edges(size_t begin, in Edges() function
632 for (CordRep* rep : Edges()) CordRep::Ref(rep); in Copy()
643 for (CordRep* edge : tree->Edges()) CordRep::Ref(edge); in CopyToEndFrom()
654 for (CordRep* edge : tree->Edges()) CordRep::Ref(edge); in CopyBeginTo()
Dcord_rep_btree.cc89 for (CordRep* edge : node->Edges()) { in DumpAll()
352 for (CordRep* edge : tree->Edges(begin, end)) { in DestroyLeaf()
360 for (CordRep* edge : tree->Edges(begin, end)) { in DestroyNonLeaf()
387 for (CordRep* edge : tree->Edges()) { in IsValid()
399 for (CordRep* edge : tree->Edges()) { in IsValid()
453 for (CordRep* r : Edges(begin() + shift, back() + shift)) { in SetEdge()
615 result.tree->Add<edge_type>(src->Edges()); in Merge()
620 for (CordRep* edge : src->Edges()) CordRep::Ref(edge); in Merge()
801 for (CordRep* r : node->Edges(front.index + 1, back.index)) { in SubTree()
Dcord_rep_btree_navigator_test.cc250 EXPECT_THAT(pos.edge, Eq(tree->Edges()[1])); in TEST()
265 EXPECT_THAT(nav.Current(), Eq(tree1->Edges().front())); in TEST()
270 EXPECT_THAT(nav.Current(), Eq(tree1->Edges().front())); in TEST()
Dcordz_info.cc241 for (CordRep* edge : tree->Edges()) { in AnalyzeBtree()
245 for (CordRep* edge : tree->Edges()) { in AnalyzeBtree()
Dcordz_info_statistics_test.cc152 for (CordRep*edge : rep->btree()->Edges()) { in FairShareImpl()
513 mem_size += SizeOf(tree->Edges().back()->btree()); in TEST()
520 ref.Ref(tree->Edges().front(), 4); in TEST()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h173 EdgeVector Edges; variable
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
212 Edges[EId] = std::move(E); in addConstructedEdge()
214 EId = Edges.size(); in addConstructedEdge()
215 Edges.push_back(std::move(E)); in addConstructedEdge()
263 : CurEId(CurEId), EndEId(G.Edges.size()), FreeEdgeIds(G.FreeEdgeIds) { in EdgeItr()
306 EdgeItr end() const { return EdgeItr(G.Edges.size(), G); } in end()
308 bool empty() const { return G.Edges.empty(); } in empty()
311 return G.Edges.size() - G.FreeEdgeIds.size(); in size()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLazyCallGraph.cpp44 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
49 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
57 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge() argument
65 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
69 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
73 assert(!Edges && "Must not have already populated the edges for this node!"); in populateSlow()
78 Edges = EdgeSequence(); in populateSlow()
107 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc39 using Edges = std::vector<Edge>; typedef
50 static bool IsReachable(Edges *edges, int from, int to, in IsReachable()
67 static void PrintEdges(Edges *edges) { in PrintEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure()
136 static void CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, in CheckEdges()
176 static int RandomEdge(RandomEngine* rng, Edges *edges) { in RandomEdge()
182 static int EdgeIndex(Edges *edges, int from, int to) { in EdgeIndex()
194 Edges edges; // from, to in TEST()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
DToposortStructs.cpp26 using Edges = std::unordered_set<T>; typedef
29 using Graph = std::unordered_map<T, Edges<T>>;
38 Edges<const TStructure *> &es = g[s]; in BuildGraphImpl()
47 Edges<const TStructure *> &ez = g[z]; in BuildGraphImpl()
102 const Edges<T> &en = enIter->second; in Toposort()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/JITLink/
DJITLink.h226 Edges.push_back(Edge(K, Offset, Target, Addend)); in addEdge()
231 void addEdge(const Edge &E) { Edges.push_back(E); } in addEdge()
235 return make_range(Edges.begin(), Edges.end()); in edges()
240 return make_range(Edges.begin(), Edges.end()); in edges()
244 size_t edges_size() const { return Edges.size(); } in edges_size()
247 bool edges_empty() const { return Edges.empty(); } in edges_empty()
251 void removeEdge(const_edge_iterator I) { Edges.erase(I); } in removeEdge()
261 std::vector<Edge> Edges; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DMachineBlockPlacement.cpp513 MutableArrayRef<SmallVector<WeightedEdge, 8>> Edges);
951 Edges) { in getBestNonConflictingEdges() argument
961 llvm::stable_sort(Edges[0], Cmp); in getBestNonConflictingEdges()
962 llvm::stable_sort(Edges[1], Cmp); in getBestNonConflictingEdges()
963 auto BestA = Edges[0].begin(); in getBestNonConflictingEdges()
964 auto BestB = Edges[1].begin(); in getBestNonConflictingEdges()
1009 SmallVector<WeightedEdge, 8> Edges[2]; in getBestTrellisSuccessor() local
1021 Edges[SuccIndex].push_back({EdgeFreq, SuccPred, Succ}); in getBestTrellisSuccessor()
1028 std::tie(BestA, BestB) = getBestNonConflictingEdges(BB, Edges); in getBestTrellisSuccessor()
1200 std::vector<MachineBasicBlock *> Edges; in precomputeTriangleChains() member
[all …]
DAggressiveAntiDepBreaker.cpp265 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep *> &Edges) { in AntiDepEdges() argument
271 Edges.push_back(&*P); in AntiDepEdges()
832 std::vector<const SDep *> Edges; in BreakAntiDependencies() local
834 AntiDepEdges(PathSU, Edges); in BreakAntiDependencies()
850 for (unsigned i = 0, e = Edges.size(); i != e; ++i) { in BreakAntiDependencies()
851 const SDep *Edge = Edges[i]; in BreakAntiDependencies()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
DX86DomainReassignment.cpp303 DenseSet<unsigned> Edges; member in __anon54349ac00111::Closure
333 bool empty() const { return Edges.empty(); } in empty()
336 return Edges.insert(Reg).second; in insertEdge()
341 return iterator_range<const_edge_iterator>(Edges.begin(), Edges.end()); in edges()
355 for (unsigned Reg : Edges) { in dump()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ProfileData/
DGCOV.h309 SmallVector<std::unique_ptr<GCOVEdge>, 16> Edges; variable
325 using Edges = SmallVector<GCOVEdge *, 4>; variable
369 static uint64_t getCycleCount(const Edges &Path);
373 Edges &Path, BlockVector &Blocked,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/
DGCOV.cpp188 Edges.push_back(std::make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); in readGCNO()
189 GCOVEdge *Edge = Edges.back().get(); in readGCNO()
447 uint64_t GCOVBlock::getCycleCount(const Edges &Path) { in getCycleCount()
477 Edges &Path, BlockVector &Blocked, in lookForCircuit()
527 Edges Path; in getCyclesCount()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DModuleSummaryIndex.h558 makeDummyFunctionSummary(std::vector<FunctionSummary::EdgeTy> Edges) {
565 std::vector<ValueInfo>(), std::move(Edges),
1061 std::vector<FunctionSummary::EdgeTy> Edges;
1066 Edges.push_back(std::make_pair(P.first, CalleeInfo{}));
1068 if (Edges.empty()) {
1072 auto CallGraphRoot = FunctionSummary::makeDummyFunctionSummary(Edges);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.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