/third_party/optimized-routines/string/aarch64/ |
D | memchr.S | 36 #define vend v6 macro 81 addp vend.16b, vhas_chr1.16b, vhas_chr2.16b /* 256->128 */ 82 addp vend.16b, vend.16b, vend.16b /* 128->64 */ 83 mov synd, vend.d[0] 101 orr vend.16b, vhas_chr1.16b, vhas_chr2.16b 102 addp vend.2d, vend.2d, vend.2d 103 mov synd, vend.d[0] 111 addp vend.16b, vhas_chr1.16b, vhas_chr2.16b /* 256->128 */ 112 addp vend.16b, vend.16b, vend.16b /* 128->64 */ 113 mov synd, vend.d[0]
|
D | strnlen.S | 31 #define vend v3 macro 55 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 80 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 88 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 94 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 96 mov synd, vend.d[0]
|
D | strchr-mte.S | 32 #define vend v6 macro 60 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */ 80 umaxp vend.16b, vhas_nul.16b, vhas_nul.16b 87 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */ 92 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */
|
D | strrchr-mte.S | 35 #define vend v5 macro 62 addp vend.16b, vhas_nul.16b, vhas_nul.16b 76 umaxp vend.16b, vhas_nul.16b, vhas_nul.16b 83 addp vend.16b, vhas_nul.16b, vhas_nul.16b 107 umaxp vend.16b, vhas_nul.16b, vhas_nul.16b 113 addp vend.16b, vhas_nul.16b, vhas_nul.16b
|
D | strlen-mte.S | 29 #define vend v3 macro 50 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */ 64 umaxp vend.16b, vhas_nul.16b, vhas_nul.16b 69 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */
|
D | memchr-mte.S | 33 #define vend v4 macro 58 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 84 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 93 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 98 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */
|
D | memrchr.S | 35 #define vend v4 macro 61 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 85 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 94 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 99 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */
|
D | strchrnul-mte.S | 31 #define vend v5 macro 54 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */ 69 umaxp vend.16b, vhas_chr.16b, vhas_chr.16b 74 addp vend.16b, vhas_chr.16b, vhas_chr.16b /* 128->64 */
|
D | strcpy-mte.S | 36 #define vend v3 macro 67 addp vend.16b, vhas_nul.16b, vhas_nul.16b 75 addp vend.16b, vhas_nul.16b, vhas_nul.16b 143 umaxp vend.16b, vhas_nul.16b, vhas_nul.16b 148 addp vend.16b, vhas_nul.16b, vhas_nul.16b /* 128->64 */
|
/third_party/boost/boost/graph/ |
D | sequential_vertex_coloring.hpp | 64 typename GraphTraits::vertex_iterator v, vend; in sequential_vertex_coloring() local 65 for (boost::tie(v, vend) = vertices(G); v != vend; ++v) in sequential_vertex_coloring() 72 typename GraphTraits::adjacency_iterator v, vend; in sequential_vertex_coloring() local 76 for (boost::tie(v, vend) = adjacent_vertices(current, G); v != vend; in sequential_vertex_coloring()
|
D | smallest_last_ordering.hpp | 70 typename GraphTraits::vertex_iterator v, vend; in smallest_last_vertex_ordering() local 71 for (boost::tie(v, vend) = vertices(G); v != vend; ++v) in smallest_last_vertex_ordering() 97 typename GraphTraits::adjacency_iterator v, vend; in smallest_last_vertex_ordering() local 98 for (boost::tie(v, vend) = adjacent_vertices(node, G); v != vend; ++v) in smallest_last_vertex_ordering()
|
D | incremental_components.hpp | 95 typename graph_traits< VertexListGraph >::vertex_iterator v, vend; in initialize_incremental_components() local 96 for (boost::tie(v, vend) = vertices(G); v != vend; ++v) in initialize_incremental_components()
|
D | minimum_degree_ordering.hpp | 362 typename graph_traits< Graph >::vertex_iterator v, vend; in mmd_impl() local 364 for (boost::tie(v, vend) = vertices(G); v != vend; ++v, ++vid) in mmd_impl() 370 for (boost::tie(v, vend) = vertices(G); v != vend; ++v) in mmd_impl()
|
/third_party/boost/libs/graph/example/ |
D | min_max_paths.cpp | 91 graph_traits< Graph >::vertex_iterator vi, vend; in main() local 92 for (boost::tie(vi, vend) = vertices(G); vi != vend; ++vi) in main() 99 for (boost::tie(vi, vend) = vertices(G); vi != vend; ++vi) in main()
|
D | dijkstra-no-color-map-example.cpp | 59 graph_traits< graph_t >::vertex_iterator vi, vend; in main() local 60 for (boost::tie(vi, vend) = vertices(g); vi != vend; ++vi) in main()
|
D | dijkstra-example.cpp | 55 graph_traits< graph_t >::vertex_iterator vi, vend; in main() local 56 for (boost::tie(vi, vend) = vertices(g); vi != vend; ++vi) in main()
|
D | dijkstra-example-listS.cpp | 70 graph_traits< graph_t >::vertex_iterator vi, vend; in main() local 71 for (boost::tie(vi, vend) = vertices(g); vi != vend; ++vi) in main()
|
/third_party/boost/boost/graph/distributed/ |
D | strong_components.hpp | 202 vertex_iterator vstart, vend; in fleischer_hendrickson_pinar_strong_components() local 210 for( boost::tie(vstart, vend) = vertices(g); vstart != vend; vstart++ ) in fleischer_hendrickson_pinar_strong_components() 234 ls_vertex_iterator vstart, vend; in fleischer_hendrickson_pinar_strong_components() local 235 for( boost::tie(vstart,vend) = vertices(ls); vstart != vend; vstart++ ) in fleischer_hendrickson_pinar_strong_components() 477 for( boost::tie(vstart, vend) = vertices(g); vstart != vend; vstart++ ) { in fleischer_hendrickson_pinar_strong_components() 714 for( boost::tie(vstart, vend) = vertices(g); vstart != vend; vstart++ ) in fleischer_hendrickson_pinar_strong_components() 739 vertex_iterator vstart, vend; in build_reverse_graph() local 744 for( boost::tie(vstart, vend) = vertices(g); vstart != vend; vstart++ ) in build_reverse_graph() 762 for( boost::tie(vstart, vend) = vertices(g); vstart != vend; vstart++ ) in build_reverse_graph() 811 vertex_iterator vstart, vend; in number_components() local [all …]
|
/third_party/FreeBSD/sys/dev/usb/ |
D | usbdi.h | 318 #define USB_VENDOR(vend) \ argument 319 .match_flag_vendor = 1, .idVendor = (vend) 324 #define USB_VP(vend,prod) \ argument 325 USB_VENDOR(vend), USB_PRODUCT(prod) 327 #define USB_VPI(vend,prod,info) \ argument 328 USB_VENDOR(vend), USB_PRODUCT(prod), USB_DRIVER_INFO(info)
|
/third_party/boost/libs/graph/doc/ |
D | minimum_degree_ordering.w | 92 typename graph_traits<Graph>::vertex_iterator v, vend; 93 for (tie(v, vend) = vertices(G); v != vend; ++v, ++vid) 100 for (tie(v, vend) = vertices(G); v != vend; ++v) {
|
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
D | usb.h | 54 #define USB_DEVICE(vend,prod) \ argument 55 .match_flags = USB_DEVICE_ID_MATCH_DEVICE, .idVendor = (vend), \
|
/third_party/flutter/flutter/packages/flutter/lib/src/scheduler/ |
D | ticker.dart | 17 /// An interface implemented by classes that can vend [Ticker] objects.
|
/third_party/flutter/skia/third_party/externals/icu/source/data/lang/ |
D | sk.txt | 518 ve{"vendčina"}
|
/third_party/icu/icu4c/source/data/lang/ |
D | sk.txt | 520 ve{"vendčina"}
|
/third_party/skia/third_party/externals/icu/source/data/lang/ |
D | sk.txt | 520 ve{"vendčina"}
|