/prebuilts/ndk/current/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
H A D | local_single_store_elim_pass.cpp | 160 auto edges = spvtools::CFA<ir::BasicBlock>::CalculateDominators( local 163 for (auto edge : edges)
|
/prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
H A D | local_single_store_elim_pass.cpp | 160 auto edges = spvtools::CFA<ir::BasicBlock>::CalculateDominators( local 163 for (auto edge : edges)
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/XRay/ |
H A D | Graph.h | 49 /// Usage Example Graph with weighted edges and vertices: 59 /// for(const auto &e : G.edges()){ 60 /// // Do something with the edges in the graph; 77 /// These objects are used to name edges and vertices in the graph. 86 /// This type is the value_type of all iterators which range over edges, 100 /// The type used for storing the edges entering a vertex. Indexed by 102 /// where the incoming edges are, the EdgeIdentifiers are stored in an 172 /// A const iterator type for iterating through the set of edges entering a 178 /// An iterator type for iterating through the set of edges leaving a vertex. 183 /// A const iterator type for iterating through the set of edges enterin 356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph 358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph [all...] |
/prebuilts/ndk/current/sources/third_party/shaderc/third_party/spirv-tools/source/ |
H A D | validate_cfg.cpp | 176 // Map a loop header to blocks with back-edges to the loop header. 184 << "Back-edges (" << _.getIdName(back_edge_block) << " -> " 274 // and find all back-edges. 290 auto edges = spvtools::CFA<libspirv::BasicBlock>::CalculateDominators( local 292 for (auto edge : edges) { 306 /// calculate back edges.
|
/prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
H A D | validate_cfg.cpp | 176 // Map a loop header to blocks with back-edges to the loop header. 184 << "Back-edges (" << _.getIdName(back_edge_block) << " -> " 274 // and find all back-edges. 290 auto edges = spvtools::CFA<libspirv::BasicBlock>::CalculateDominators( local 292 for (auto edge : edges) { 306 /// calculate back edges.
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
H A D | basic-block.h | 180 /* The edges into and out of the block. */ 300 /* Number of edges in this flow graph. */ 495 /* Number of edges in the compressed edge list. */ 574 /* Iterator object for edges. */ 683 vector of predecessor or successor edges. It must not be used when 883 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */ 898 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */ 915 find_fallthru_edge (vec<edge, va_gc> *edges) 920 FOR_EACH_EDGE (e, ei, edges) 914 find_fallthru_edge(vec<edge, va_gc> *edges) argument
|
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
H A D | test_set.py | 1695 """Graph, the vertices of which are edges of G, 1697 edges share a vertex.""" 1710 for v1, edges in G.items(): 1711 for v2 in edges: 1740 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1741 vertices2 = set(v for edges in g.values() for v in edges) 1760 for edges in cuboctahedron.values(): 1761 self.assertEqual(len(edges), 4) # each vertex connects to four other vertices 1762 othervertices = set(edge for edges i [all...] |
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
H A D | test_set.py | 1695 """Graph, the vertices of which are edges of G, 1697 edges share a vertex.""" 1710 for v1, edges in G.items(): 1711 for v2 in edges: 1740 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1741 vertices2 = set(v for edges in g.values() for v in edges) 1760 for edges in cuboctahedron.values(): 1761 self.assertEqual(len(edges), 4) # each vertex connects to four other vertices 1762 othervertices = set(edge for edges i [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
H A D | test_set.py | 1695 """Graph, the vertices of which are edges of G, 1697 edges share a vertex.""" 1710 for v1, edges in G.items(): 1711 for v2 in edges: 1740 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1741 vertices2 = set(v for edges in g.values() for v in edges) 1760 for edges in cuboctahedron.values(): 1761 self.assertEqual(len(edges), 4) # each vertex connects to four other vertices 1762 othervertices = set(edge for edges i [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
H A D | test_set.py | 1695 """Graph, the vertices of which are edges of G, 1697 edges share a vertex.""" 1710 for v1, edges in G.items(): 1711 for v2 in edges: 1740 self.assertEqual(len(edge), 3) # each vertex connects to three edges 1741 vertices2 = set(v for edges in g.values() for v in edges) 1760 for edges in cuboctahedron.values(): 1761 self.assertEqual(len(edges), 4) # each vertex connects to four other vertices 1762 othervertices = set(edge for edges i [all...] |
/prebuilts/tools/common/m2/repository/org/antlr/stringtemplate/3.2.1/ |
H A D | stringtemplate-3.2.1.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/stringtemplate/ org/antlr/stringtemplate/misc/ ... |
/prebuilts/tools/common/netbeans-visual/ |
H A D | org-openide-util.jar | META-INF/ META-INF/MANIFEST.MF org/ org/netbeans/ org/netbeans/modules/ org/netbeans/modules/openide/ ... |