/rust/registry/src/index.crates.io-1949cf8c6b5b557f/pxfm-0.1.27/src/bits.rs
Line | Count | Source |
1 | | /* |
2 | | * // Copyright (c) Radzivon Bartoshyk 6/2025. All rights reserved. |
3 | | * // |
4 | | * // Redistribution and use in source and binary forms, with or without modification, |
5 | | * // are permitted provided that the following conditions are met: |
6 | | * // |
7 | | * // 1. Redistributions of source code must retain the above copyright notice, this |
8 | | * // list of conditions and the following disclaimer. |
9 | | * // |
10 | | * // 2. Redistributions in binary form must reproduce the above copyright notice, |
11 | | * // this list of conditions and the following disclaimer in the documentation |
12 | | * // and/or other materials provided with the distribution. |
13 | | * // |
14 | | * // 3. Neither the name of the copyright holder nor the names of its |
15 | | * // contributors may be used to endorse or promote products derived from |
16 | | * // this software without specific prior written permission. |
17 | | * // |
18 | | * // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
19 | | * // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
20 | | * // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
21 | | * // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE |
22 | | * // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
23 | | * // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
24 | | * // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
25 | | * // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
26 | | * // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
27 | | * // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | | */ |
29 | | |
30 | | #[inline] |
31 | 0 | pub(crate) const fn get_exponent_f32(x: f32) -> i32 { |
32 | 0 | let bits = x.to_bits(); |
33 | 0 | (((bits >> 23) & 0xFF) as i32).wrapping_sub(127) |
34 | 0 | } |
35 | | |
36 | | // #[inline] |
37 | | // pub(crate) const fn mantissa_f32(x: f32) -> u32 { |
38 | | // x.to_bits() & ((1u32 << 23) - 1) |
39 | | // } |
40 | | |
41 | | #[inline] |
42 | 0 | pub(crate) const fn mantissa_f64(x: f64) -> u64 { |
43 | 0 | x.to_bits() & ((1u64 << 52) - 1) |
44 | 0 | } |
45 | | |
46 | | #[inline] |
47 | 0 | pub(crate) const fn get_exponent_f64(x: f64) -> i64 { |
48 | 0 | ((x.to_bits() as i64 & EXP_MASK as i64) >> 52).wrapping_sub(1023) |
49 | 0 | } |
50 | | |
51 | | #[inline] |
52 | 0 | pub(crate) const fn biased_exponent_f64(x: f64) -> i64 { |
53 | 0 | (x.to_bits() as i64 & EXP_MASK as i64) >> 52 |
54 | 0 | } |
55 | | |
56 | | #[inline] |
57 | 0 | pub(crate) const fn mask_trailing_ones(len: u64) -> u64 { |
58 | 0 | if len >= 64 { |
59 | 0 | u64::MAX |
60 | | } else { |
61 | 0 | (1u64 << len).wrapping_sub(1) |
62 | | } |
63 | 0 | } |
64 | | |
65 | | pub(crate) const EXP_MASK: u64 = mask_trailing_ones(11) << 52; |
66 | | |
67 | | #[inline] |
68 | 0 | pub(crate) fn set_exponent_f64(x: u64, new_exp: u64) -> u64 { |
69 | 0 | let encoded_mask = new_exp.wrapping_shl(52) & EXP_MASK; |
70 | 0 | x ^ ((x ^ encoded_mask) & EXP_MASK) |
71 | 0 | } |
72 | | |
73 | | #[inline] |
74 | 0 | pub(crate) const fn min_normal_f32(sign: bool) -> f32 { |
75 | 0 | let sign_bit = if sign { 1u32 << 31 } else { 0 }; |
76 | 0 | let exponent = 1u32 << 23; |
77 | 0 | f32::from_bits(sign_bit | exponent) |
78 | 0 | } |