     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67

    //! LLVM's simd platform intrinsics
    //!
    //! TODO: should use `link_llvm_intrinsic` instead: issue #112

    extern "platform-intrinsic" {
        pub fn simd_eq<T, U>(x: T, y: T) -> U;
        pub fn simd_ne<T, U>(x: T, y: T) -> U;
        pub fn simd_lt<T, U>(x: T, y: T) -> U;
        pub fn simd_le<T, U>(x: T, y: T) -> U;
        pub fn simd_gt<T, U>(x: T, y: T) -> U;
        pub fn simd_ge<T, U>(x: T, y: T) -> U;

        pub fn simd_shuffle2<T, U>(x: T, y: T, idx: [u32; 2]) -> U;
        pub fn simd_shuffle4<T, U>(x: T, y: T, idx: [u32; 4]) -> U;
        pub fn simd_shuffle8<T, U>(x: T, y: T, idx: [u32; 8]) -> U;
        pub fn simd_shuffle16<T, U>(x: T, y: T, idx: [u32; 16]) -> U;
        pub fn simd_shuffle32<T, U>(x: T, y: T, idx: [u32; 32]) -> U;
        pub fn simd_shuffle64<T, U>(x: T, y: T, idx: [u32; 64]) -> U;
        pub fn simd_shuffle128<T, U>(x: T, y: T, idx: [u32; 128]) -> U;

        pub fn simd_insert<T, U>(x: T, idx: u32, val: U) -> T;
        pub fn simd_extract<T, U>(x: T, idx: u32) -> U;

        pub fn simd_cast<T, U>(x: T) -> U;

        pub fn simd_add<T>(x: T, y: T) -> T;
        pub fn simd_sub<T>(x: T, y: T) -> T;
        pub fn simd_mul<T>(x: T, y: T) -> T;
        pub fn simd_div<T>(x: T, y: T) -> T;
        pub fn simd_rem<T>(x: T, y: T) -> T;
        pub fn simd_shl<T>(x: T, y: T) -> T;
        pub fn simd_shr<T>(x: T, y: T) -> T;
        pub fn simd_and<T>(x: T, y: T) -> T;
        pub fn simd_or<T>(x: T, y: T) -> T;
        pub fn simd_xor<T>(x: T, y: T) -> T;

        pub fn simd_reduce_add_unordered<T, U>(x: T) -> U;
        pub fn simd_reduce_mul_unordered<T, U>(x: T) -> U;
        pub fn simd_reduce_add_ordered<T, U>(x: T, acc: U) -> U;
        pub fn simd_reduce_mul_ordered<T, U>(x: T, acc: U) -> U;
        pub fn simd_reduce_min<T, U>(x: T) -> U;
        pub fn simd_reduce_max<T, U>(x: T) -> U;
        pub fn simd_reduce_min_nanless<T, U>(x: T) -> U;
        pub fn simd_reduce_max_nanless<T, U>(x: T) -> U;
        pub fn simd_reduce_and<T, U>(x: T) -> U;
        pub fn simd_reduce_or<T, U>(x: T) -> U;
        pub fn simd_reduce_xor<T, U>(x: T) -> U;
        pub fn simd_reduce_all<T>(x: T) -> bool;
        pub fn simd_reduce_any<T>(x: T) -> bool;

        pub fn simd_select<M, T>(m: M, a: T, b: T) -> T;
        #[cfg(not(stage0))]
        pub fn simd_select_bitmask<M, T>(m: M, a: T, b: T) -> T;

        pub fn simd_fmin<T>(a: T, b: T) -> T;
        pub fn simd_fmax<T>(a: T, b: T) -> T;

        pub fn simd_fsqrt<T>(a: T) -> T;
        pub fn simd_fma<T>(a: T, b: T, c: T) -> T;
    }

    // incorrect, but compiles until the bootstrap compiler is updated
    #[cfg(stage0)]
    pub fn simd_select_bitmask<M, T>(m: M, a: T, b: T) -> T {
        drop((m, b));
        a
    }

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g., `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g., `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g., `str,u8` or `String,struct:Vec,test`)