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
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
// Copyright 2018-2019 Cryptape Technologies LLC.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.

//! Define public methods about bits and bytes.

use crate::fixed_uint::UintConstructor;
use crate::utils;
use quote::quote;

impl UintConstructor {
    pub fn defun_pub_basic(&self) {
        self.defun_pub_bits_ops();
        self.defun_pub_bytes_ops();
        self.defun_pub_arith_ops();
        self.defun_pub_mem_ops();
    }

    fn defun_pub_bits_ops(&self) {
        let bits_size = &self.ts.bits_size;
        let unit_bits_size = &self.ts.unit_bits_size;
        let loop_unit_amount = &utils::pure_uint_list_to_ts(0..self.info.unit_amount);
        let loop_unit_amount_rev = &utils::pure_uint_list_to_ts((0..self.info.unit_amount).rev());
        let loop_unit_bits_size = &vec![unit_bits_size; self.info.unit_amount as usize];
        let part = quote!(
            /// Return the count of bits.
            #[inline]
            pub const fn count_bits() -> u64 {
                #bits_size
            }
            /// Return a specific bit, or return None when overlows.
            #[inline]
            pub fn bit(&self, index: usize) -> Option<bool> {
                if index >= #bits_size {
                    None
                } else {
                    let inner = self.inner();
                    let unit_idx = index / #unit_bits_size;
                    let bit_idx = index % #unit_bits_size;
                    Some(inner[unit_idx] & (1 << bit_idx) != 0)
                }
            }
            /// Set a specific bit.
            /// Return false when overflows.
            #[inline]
            pub fn set_bit(&mut self, index: usize, value: bool) -> bool {
                if index >= #bits_size {
                    false
                } else {
                    let inner = self.mut_inner();
                    let unit_idx = index / #unit_bits_size;
                    let bit_idx = index % #unit_bits_size;
                    if value {
                        inner[unit_idx] |= 1 << bit_idx;
                    } else {
                        inner[unit_idx] &= !(1 << bit_idx);
                    }
                    true
                }
            }
            /// Return the highest bit which is one.
            #[inline]
            pub fn highest_one(&self) -> Option<usize> {
                let inner = self.inner();
                #({
                    let idx = #loop_unit_amount_rev;
                    let v = inner[idx];
                    if v != 0 {
                        let x = #loop_unit_bits_size * (idx + 1) - 1;
                        let y = v.leading_zeros() as usize;
                        return Some(x - y);
                    }
                })*
                None
            }
            /// Return the lowest bit which is one.
            #[inline]
            pub fn lowest_one(&self) -> Option<usize> {
                let inner = self.inner();
                #({
                    let idx = #loop_unit_amount;
                    let v = inner[idx];
                    if v != 0 {
                        let x = #loop_unit_bits_size * idx;
                        let y = v.trailing_zeros() as usize;
                        return Some(x + y);
                    }
                })*
                None
            }
        );
        self.defun(part);
    }

    fn defun_pub_bytes_ops(&self) {
        let bytes_size = &self.ts.bytes_size;
        let unit_bytes_size = &self.ts.unit_bytes_size;
        let unit_suffix = &self.ts.unit_suffix;
        let loop_unit_amount = &utils::pure_uint_list_to_ts(0..self.info.unit_amount);
        let loop_unit_amount_rev = &utils::pure_uint_list_to_ts((0..self.info.unit_amount).rev());
        let loop_unit_bytes_size = &vec![unit_bytes_size; self.info.unit_amount as usize];
        let part = quote!(
            /// Return the count of bytes.
            #[inline]
            pub const fn count_bytes() -> u64 {
                #bytes_size
            }
            /// Return a specific byte, or return None when overlows.
            #[inline]
            pub fn byte(&self, index: usize) -> Option<u8> {
                if index >= #bytes_size {
                    None
                } else {
                    let inner = self.inner();
                    let unit_bytes_size = #unit_bytes_size;
                    let unit_idx = index / unit_bytes_size;
                    let byte_idx = index % unit_bytes_size;
                    let v = (inner[unit_idx] >> (8 * byte_idx)) & 0xff;
                    Some(v as u8)
                }
            }
            /// Set a specific byte.
            /// Return false when overflows;
            #[inline]
            pub fn set_byte(&mut self, index: usize, byte: u8) -> bool {
                if index >= #bytes_size {
                    false
                } else {
                    let inner = self.mut_inner();
                    let unit_bytes_size = #unit_bytes_size;
                    let unit_idx = index / unit_bytes_size;
                    let byte_idx = index % unit_bytes_size;
                    inner[unit_idx] &= !((0xff as #unit_suffix) << (8 * byte_idx));
                    inner[unit_idx] |= (byte as #unit_suffix) << (8 * byte_idx);
                    true
                }
            }
            /// Return the highest byte which is nonzero.
            #[inline]
            pub fn highest_nonzero_byte(&self) -> Option<usize> {
                let inner = self.inner();
                #({
                    let idx: usize = #loop_unit_amount_rev;
                    let v = inner[idx];
                    if v != 0 {
                        let x = #loop_unit_bytes_size * (idx + 1) - 1;
                        let y = v.leading_zeros() as usize;
                        return Some(x - y / 8);
                    }
                })*
                None
            }
            /// Return the lowest byte which is nonzero.
            #[inline]
            pub fn lowest_nonzero_byte(&self) -> Option<usize> {
                let inner = self.inner();
                #({
                    let idx: usize = #loop_unit_amount;
                    let v = inner[idx];
                    if v != 0 {
                        let x = #loop_unit_bytes_size * idx;
                        let y = v.trailing_zeros() as usize;
                        return Some(x + y / 8);
                    }
                })*
                None
            }
        );
        self.defun(part);
    }

    fn defun_pub_arith_ops(&self) {
        let name = &self.ts.name;
        let part = quote!(
            /// Calculates the multiplication of `self` and `other`.
            ///
            /// Returns a tuple: `(low, high)`,
            /// `low` is the low part of the multiplication,
            /// `high` is the low part of the multiplication.
            ///
            /// The multiplication is equal to `(high << Self::count_bits()) + low`.
            #[inline]
            pub fn complete_mul(&self, other: &Self) -> (Self, Self) {
                self._full_mul(other)
            }
            /// Calculates both the quotient and the remainder when `self` is divided by `other`.
            ///
            /// Returns a tuple: `(quotient, remainder)`.
            ///
            /// The `self` is equal to `quotient * other + remainder`.
            #[inline]
            pub fn complete_div(&self, other: &Self) -> (Self, Self) {
                if let Some(ret) = self._div_with_rem(other) {
                    ret
                } else {
                    panic!("{}: the divisor is zero", stringify!(#name));
                }
            }
        );
        self.defun(part);
    }

    fn defun_pub_mem_ops(&self) {
        let bytes_size = &self.ts.bytes_size;
        let part = quote!(
            /// Return the size used by this type in bytes, actually.
            ///
            /// This size is greater than or equal to the bytes of this fixed type.
            #[inline]
            pub const fn size_of() -> usize {
                #bytes_size
            }
        );
        self.defun(part);
    }
}