| /external/rust/crates/glam/src/ |
| D | f32.rs | 9 #[cfg(all(feature = "core-simd", not(feature = "scalar-math")))] 14 feature = "core-simd", 18 feature = "scalar-math" 24 not(any(feature = "core-simd", feature = "scalar-math")) 30 not(any(feature = "core-simd", feature = "scalar-math")) 36 feature = "core-simd", 40 feature = "scalar-math" 46 not(any(feature = "core-simd", feature = "scalar-math")) 52 not(any(feature = "core-simd", feature = "scalar-math")) 56 #[cfg(all(feature = "core-simd", not(feature = "scalar-math")))] [all …]
|
| /external/rust/crates/glam/.github/workflows/ |
| D | ci.yml | 7 runs-on: ubuntu-latest 9 - uses: actions/checkout@v2 11 - uses: actions-rs/toolchain@v1 17 - name: rustfmt 18 run: cargo fmt -- --check --color always 21 - run: cargo fetch 22 - name: cargo clippy 23 run: cargo clippy --workspace --all-targets --all-features -- -D warnings 26 - name: codegen 27 run: cargo run --release -p codegen -- --check [all …]
|
| /external/angle/build/rust/std/ |
| D | gnrt_config.toml | 2 # Use of this source code is governed by a BSD-style license that can be 5 # Provides per-crate and overall configuration options to gnrt. 7 # Most commonly needed configuration options can be found in the top-level doc 11 # to per-crate options). 21 # TODO(https://github.com/rust-lang/cargo/issues/10801): remove workaround once 23 remove_crates = ['allocator-api2'] 28 [all-crates] 51 [crate.core] 54 extra_src_roots = ['../../portable-simd/crates/core_simd', '../../stdarch/crates/core_arch'] 60 # TODO(https://github.com/rust-lang/cargo/issues/10801): remove workaround once [all …]
|
| /external/cronet/build/rust/std/ |
| D | gnrt_config.toml | 2 # Use of this source code is governed by a BSD-style license that can be 5 # Provides per-crate and overall configuration options to gnrt. 7 # Most commonly needed configuration options can be found in the top-level doc 11 # to per-crate options). 21 # TODO(https://github.com/rust-lang/cargo/issues/10801): remove workaround once 23 remove_crates = ['allocator-api2'] 28 [all-crates] 51 [crate.core] 54 extra_src_roots = ['../../portable-simd/crates/core_simd', '../../stdarch/crates/core_arch'] 60 # TODO(https://github.com/rust-lang/cargo/issues/10801): remove workaround once [all …]
|
| /external/rust/crates/glam/ |
| D | README.md | 3 [![Build Status]][github-ci] [![Coverage Status]][coveralls.io] 41 ### SIMD subsection 44 types use 128-bit wide SIMD vector types for storage on `x86`, `x86_64` and 48 `Mat3A`, `Affine2` and `Affine3A`. However, the use of SIMD generally results 54 [mathbench]: https://github.com/bitshifter/mathbench-rs 56 ### Enabling SIMD 58 SIMD is supported on `x86`, `x86_64` and `wasm32` targets. 61 * To enable `SSE2` on `x86` targets add `-C target-feature=+sse2` to 63 * To enable `simd128` on `wasm32` targets add `-C target-feature=+simd128` to 65 * Experimental [portable simd] support can be enabled with the `core-simd` [all …]
|
| D | CHANGELOG.md | 8 ## [0.25.0] - 2023-12-19 13 target architecture has SIMD support in glam. Previously this was inconsistent 15 SIMD is not available. `Vec4` will continue to use `BVec4` as a mask type when 16 the `scalar-math` feature is used. 24 * Updated the `core-simd` implementation to build on latest nightly. 45 ## [0.24.2] - 2023-09-23 65 ## [0.24.1] - 2023-06-24 76 * Added `test` and `set` methods to `bool` vector types for testing and setting 81 ## [0.24.0] - 2023-04-24 109 ## [0.23.0] - 2023-02-22 [all …]
|
| D | Cargo.toml.orig | 7 repository = "https://github.com/bitshifter/glam-rs" 9 license = "MIT OR Apache-2.0" 11 categories = ["game-engines", "no-std"] 12 rust-version = "1.58.1" 15 maintenance = { status = "actively-developed" } 24 debug-glam-assert = [] 26 glam-assert = [] 29 scalar-math = [] 34 # Enables platform specific optimizations that might speed-up certain operations. 36 # and will likely break cross-platform determinism. [all …]
|
| /external/angle/build/rust/std/rules/ |
| D | BUILD.gn | 2 # Use of this source code is governed by a BSD-style license that can be 11 …crate_root = "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lib.rs" 13 …"//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/builtin_split_dwarf… 14 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/function.rs", 15 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lazy.rs", 16 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lib.rs", 21 # Unit tests skipped. Generate with --with-tests to include them. 27 "A cross-platform symbolication library written in Rust, using `gimli`" 28 library_configs -= [ "//build/config/compiler:chromium_code" ] 30 executable_configs -= [ "//build/config/compiler:chromium_code" ] [all …]
|
| /external/cronet/build/rust/std/rules/ |
| D | BUILD.gn | 2 # Use of this source code is governed by a BSD-style license that can be 11 …crate_root = "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lib.rs" 13 …"//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/builtin_split_dwarf… 14 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/function.rs", 15 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lazy.rs", 16 "//third_party/rust-toolchain/lib/rustlib/src/rust/vendor/addr2line-0.21.0/src/lib.rs", 21 # Unit tests skipped. Generate with --with-tests to include them. 27 "A cross-platform symbolication library written in Rust, using `gimli`" 28 library_configs -= [ "//build/config/compiler:chromium_code" ] 30 executable_configs -= [ "//build/config/compiler:chromium_code" ] [all …]
|
| /external/skia/modules/canvaskit/ |
| D | README.md | 4 test dependencies. Recent installations of Node have npm as well. 12 script in `//bin/activate-emsdk` (or `//tools/git-sync-deps` which also calls activate-emsdk). 25 can fail with errors about SSL certificates. <https://github.com/emscripten-core/emsdk/pull/273> 27 See also <https://github.com/emscripten-core/emscripten/issues/9036#issuecomment-532092743> 38 make local-example 46 For example, building a stripped-down version of CanvasKit with no text support or 51 Such a stripped-down version is about half the size of the default release build. 62 To run unit tests and compute test coverage on a debug gpu build 66 make test-continuous 69 This reads karma.conf.js, and opens a Chrome browser and begins running all the test [all …]
|
| /external/rust/crates/gdbstub_arch/src/x86/reg/ |
| D | id.rs | 1 use core::num::NonZeroUsize; 7 /// Floating-point control register 9 /// Floating-point status register 21 /// Floating-point opcode 26 fn from_u8(val: u8) -> Option<Self> { in from_u8() 63 fn from_u8(val: u8) -> Option<Self> { in from_u8() 79 /// 32-bit x86 core + SSE register identifier. 81 /// Source: <https://github.com/bminor/binutils-gdb/blob/master/gdb/features/i386/32bit-core.xml> 82 /// Additionally: <https://github.com/bminor/binutils-gdb/blob/master/gdb/features/i386/32bit-sse.x… 112 /// SIMD Registers: XMM0 through XMM7 [all …]
|
| /external/rust/crates/glam/src/bool/coresimd/ |
| D | bvec3a.rs | 4 use core::fmt; 5 use core::ops::*; 7 use core::simd::*; 15 /// A 3-dimensional SIMD vector mask. 34 pub const fn new(x: bool, y: bool, z: bool) -> Self { in new() 46 pub const fn splat(v: bool) -> Self { in splat() 56 pub fn bitmask(self) -> u32 { in bitmask() 63 pub fn any(self) -> bool { in any() 70 pub fn all(self) -> bool { in all() 79 pub fn test(&self, index: usize) -> bool { in test() method [all …]
|
| D | bvec4a.rs | 4 use core::fmt; 5 use core::ops::*; 7 use core::simd::*; 15 /// A 4-dimensional SIMD vector mask. 34 pub const fn new(x: bool, y: bool, z: bool, w: bool) -> Self { in new() 51 pub const fn splat(v: bool) -> Self { in splat() 61 pub fn bitmask(self) -> u32 { in bitmask() 68 pub fn any(self) -> bool { in any() 75 pub fn all(self) -> bool { in all() 84 pub fn test(&self, index: usize) -> bool { in test() method [all …]
|
| /external/rust/crates/memchr/src/arch/x86_64/sse2/ |
| D | packedpair.rs | 2 A 128-bit vector implementation of the "packed pair" SIMD algorithm. 4 The "packed pair" algorithm is based on the [generic SIMD] algorithm. The main 8 [generic SIMD]: http://0x80.pl/articles/simd-strfind.html#first-and-last 11 use core::arch::x86_64::__m128i; 15 /// A "packed pair" finder that uses 128-bit vector operations. 34 pub fn new(needle: &[u8]) -> Option<Finder> { in new() 46 pub fn with_pair(needle: &[u8], pair: Pair) -> Option<Finder> { in with_pair() 65 unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { in with_pair_impl() 83 pub fn is_available() -> bool { in is_available() 100 pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option<usize> { in find() [all …]
|
| /external/rust/crates/memchr/src/arch/wasm32/simd128/ |
| D | packedpair.rs | 2 A 128-bit vector implementation of the "packed pair" SIMD algorithm. 4 The "packed pair" algorithm is based on the [generic SIMD] algorithm. The main 8 [generic SIMD]: http://0x80.pl/articles/simd-strfind.html#first-and-last 11 use core::arch::wasm32::v128; 15 /// A "packed pair" finder that uses 128-bit vector operations. 34 pub fn new(needle: &[u8]) -> Option<Finder> { in new() 46 pub fn with_pair(needle: &[u8], pair: Pair) -> Option<Finder> { in with_pair() 65 unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { in with_pair_impl() 83 pub fn is_available() -> bool { in is_available() 100 pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option<usize> { in find() [all …]
|
| /external/rust/crates/memchr/src/arch/aarch64/neon/ |
| D | packedpair.rs | 2 A 128-bit vector implementation of the "packed pair" SIMD algorithm. 4 The "packed pair" algorithm is based on the [generic SIMD] algorithm. The main 8 [generic SIMD]: http://0x80.pl/articles/simd-strfind.html#first-and-last 11 use core::arch::aarch64::uint8x16_t; 15 /// A "packed pair" finder that uses 128-bit vector operations. 25 /// A "packed pair" finder that uses 128-bit vector operations. 41 pub fn new(needle: &[u8]) -> Option<Finder> { in new() 53 pub fn with_pair(needle: &[u8], pair: Pair) -> Option<Finder> { in with_pair() 72 unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { in with_pair_impl() 90 pub fn is_available() -> bool { in is_available() [all …]
|
| /external/libjpeg-turbo/ |
| D | ChangeLog.md | 6 1. The SIMD dispatchers in libjpeg-turbo 2.1.4 and prior stored the list of 7 supported SIMD instruction sets in a global variable, which caused an innocuous 10 libjpeg-turbo 2.1.5 included an undocumented attempt to fix this race condition 11 by making the SIMD support variable thread-local. However, that caused another 13 `jpeg_read_*()` or `jpeg_write_*()` was called in a second thread, the SIMD 17 CPUs that do not support them, an illegal instruction error occurred. The SIMD 18 dispatchers now ensure that the SIMD support variable is initialized before 27 1. Fixed issues in the build system whereby, when using the Ninja Multi-Config 28 CMake generator, a static build of libjpeg-turbo (a build in which 34 specially-crafted malformed 12-bit-per-component JPEG image into a progressive [all …]
|
| /external/rust/crates/memchr/src/arch/x86_64/avx2/ |
| D | packedpair.rs | 2 A 256-bit vector implementation of the "packed pair" SIMD algorithm. 4 The "packed pair" algorithm is based on the [generic SIMD] algorithm. The main 8 [generic SIMD]: http://0x80.pl/articles/simd-strfind.html#first-and-last 11 use core::arch::x86_64::{__m128i, __m256i}; 15 /// A "packed pair" finder that uses 256-bit vector operations. 37 pub fn new(needle: &[u8]) -> Option<Finder> { in new() 49 pub fn with_pair(needle: &[u8], pair: Pair) -> Option<Finder> { in with_pair() 68 unsafe fn with_pair_impl(needle: &[u8], pair: Pair) -> Finder { in with_pair_impl() 87 pub fn is_available() -> bool { in is_available() 118 pub fn find(&self, haystack: &[u8], needle: &[u8]) -> Option<usize> { in find() [all …]
|
| /external/rust/crates/memchr/ |
| D | Cargo.toml | 14 rust-version = "1.61" 29 Provides extremely fast (uses SIMD on x86_64, aarch64 and wasm32) routines for 46 rustdoc-args = ["--generate-link-to-definition"] 54 [profile.test] 55 opt-level = 3 66 [dependencies.core] 69 package = "rustc-std-workspace-core" 75 [dev-dependencies.quickcheck] 77 default-features = false 84 rustc-dep-of-std = [ [all …]
|
| D | Cargo.toml.orig | 6 Provides extremely fast (uses SIMD on x86_64, aarch64 and wasm32) routines for 17 rust-version = "1.61" 55 rustc-dep-of-std = ['core', 'compiler_builtins'] 62 core = { version = '1.0.0', optional = true, package = 'rustc-std-workspace-core' } 65 [dev-dependencies] 66 quickcheck = { version = "1.0.3", default-features = false } 74 [profile.test] 75 opt-level = 3 79 rustdoc-args = ["--generate-link-to-definition"]
|
| /external/rust/crates/memchr/src/arch/all/packedpair/ |
| D | mod.rs | 5 The "packed pair" algorithm is based on the [generic SIMD] algorithm. The main 9 good of a job keeping the search for candidates inside a SIMD hot path. It 12 [generic SIMD]: http://0x80.pl/articles/simd-strfind.html#first-and-last 45 pub fn new(needle: &[u8]) -> Option<Finder> { in new() 56 pub fn with_pair(needle: &[u8], pair: Pair) -> Option<Finder> { in with_pair() 69 pub fn find_prefilter(&self, haystack: &[u8]) -> Option<usize> { in find_prefilter() 107 pub fn pair(&self) -> &Pair { in pair() 149 pub fn new(needle: &[u8]) -> Option<Pair> { in new() 166 ) -> Option<Pair> { in with_ranker() 176 core::mem::swap(&mut rare1, &mut rare2); in with_ranker() [all …]
|
| /external/rust/crates/memchr/src/ |
| D | lib.rs | 8 * The top-level module provides routines for searching for 1, 2 or 3 bytes 12 * The [`memmem`] sub-module provides forward and reverse substring search 16 is exactly what you want when searching either UTF-8 or arbitrary bytes. 49 This example shows how to use the [`memmem`] sub-module to find occurrences of 87 fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> { 93 core library already provides them? 96 fn search(haystack: &str, needle: &str) -> Option<usize> { 108 * **Latency**: For this, think about it as, "given a tiny haystack---just a 109 few bytes---how long does it take to determine if a byte is in it?" 123 useful because Rust's core library doesn't actually expose any substring [all …]
|
| /external/rust/crates/zeroize/ |
| D | CHANGELOG.md | 7 ## 1.6.0 (2023-03-26) 9 - Impl `Zeroize` for `core::num::Wrapping` ([#818]) 10 - Impl `Zeroize` for `str` and `Box<str>` ([#842]) 13 - 2021 edition upgrade; MSRV 1.56 ([#869]) 19 ## 1.5.7 (2022-07-20) 21 - Optional `serde` support ([#780]) 25 ## 1.5.6 (2022-06-29) 27 - `#[inline(always)]` annotations ([#772]) 28 - `#[ignore]` attribute on flaky CString test ([#776]) 31 - Factor integration tests into `tests/` ([#771]) [all …]
|
| /external/rust/crates/aho-corasick/src/packed/teddy/ |
| D | README.md | 1 Teddy is a SIMD accelerated multiple substring matching algorithm. The name 2 and the core ideas in the algorithm were learned from the [Hyperscan][1_u] 14 recently, with the introduction of various SIMD instructions, has this been 22 do substring search with a Boyer-Moore (or Two-Way) variant and a well placed 26 and even fewer for packed multiple substring matching. Ben-Kiki et al. [2] 28 and hand-waves performance. There is other theoretical work done by Bille [3] 44 presumably because of how the algorithm uses certain SIMD instructions. This 59 the high throughput/latency time of PCMPESTRI and therefore chooses other SIMD 82 1. Teddy's core algorithm scans the haystack in 16 (for SSE, or 32 for AVX) 84 of bytes in a SIMD vector. [all …]
|
| /external/pffft/ |
| D | README.md | 9 license is BSD-like. 13 real vectors, utilizing the PFFFT library. The license is BSD-like. 17 It is work in progress - also the API! 27 West") is probably the first name that comes to mind -- I guess that 28 99% of open-source projects that need a FFT do use FFTW, and are happy 32 GNU GPL , which means that it cannot be used in non open-source 37 but it is larger as it deals with multi-dimensional transforms. This 43 [here](http://www.fftw.org/speed/opteron-2.2GHz-32bit/). It is however not 46 advantage of the SSE SIMD instructions available on Intel CPUs, 50 a 4-fold performance improvement. [all …]
|