| #![allow(dead_code, non_snake_case, non_camel_case_types, non_upper_case_globals)] |
| #[repr(C)] |
| #[derive(Copy, Clone, Debug, Default, Eq, Hash, Ord, PartialEq, PartialOrd)] |
| pub struct __BindgenBitfieldUnit<Storage> { |
| storage: Storage, |
| } |
| impl<Storage> __BindgenBitfieldUnit<Storage> { |
| #[inline] |
| pub const fn new(storage: Storage) -> Self { |
| Self { storage } |
| } |
| } |
| impl<Storage> __BindgenBitfieldUnit<Storage> |
| where |
| Storage: AsRef<[u8]> + AsMut<[u8]>, |
| { |
| #[inline] |
| fn extract_bit(byte: u8, index: usize) -> bool { |
| let bit_index = if cfg!(target_endian = "big") { |
| 7 - (index % 8) |
| } else { |
| index % 8 |
| }; |
| let mask = 1 << bit_index; |
| byte & mask == mask |
| } |
| #[inline] |
| pub fn get_bit(&self, index: usize) -> bool { |
| debug_assert!(index / 8 < self.storage.as_ref().len()); |
| let byte_index = index / 8; |
| let byte = self.storage.as_ref()[byte_index]; |
| Self::extract_bit(byte, index) |
| } |
| #[inline] |
| pub unsafe fn raw_get_bit(this: *const Self, index: usize) -> bool { |
| debug_assert!(index / 8 < core::mem::size_of::<Storage>()); |
| let byte_index = index / 8; |
| let byte = unsafe { |
| *(core::ptr::addr_of!((*this).storage) as *const u8) |
| .offset(byte_index as isize) |
| }; |
| Self::extract_bit(byte, index) |
| } |
| #[inline] |
| fn change_bit(byte: u8, index: usize, val: bool) -> u8 { |
| let bit_index = if cfg!(target_endian = "big") { |
| 7 - (index % 8) |
| } else { |
| index % 8 |
| }; |
| let mask = 1 << bit_index; |
| if val { byte | mask } else { byte & !mask } |
| } |
| #[inline] |
| pub fn set_bit(&mut self, index: usize, val: bool) { |
| debug_assert!(index / 8 < self.storage.as_ref().len()); |
| let byte_index = index / 8; |
| let byte = &mut self.storage.as_mut()[byte_index]; |
| *byte = Self::change_bit(*byte, index, val); |
| } |
| #[inline] |
| pub unsafe fn raw_set_bit(this: *mut Self, index: usize, val: bool) { |
| debug_assert!(index / 8 < core::mem::size_of::<Storage>()); |
| let byte_index = index / 8; |
| let byte = unsafe { |
| (core::ptr::addr_of_mut!((*this).storage) as *mut u8) |
| .offset(byte_index as isize) |
| }; |
| unsafe { *byte = Self::change_bit(*byte, index, val) }; |
| } |
| #[inline] |
| pub fn get(&self, bit_offset: usize, bit_width: u8) -> u64 { |
| debug_assert!(bit_width <= 64); |
| debug_assert!(bit_offset / 8 < self.storage.as_ref().len()); |
| debug_assert!( |
| (bit_offset + (bit_width as usize)) / 8 <= self.storage.as_ref().len(), |
| ); |
| if bit_width == 0 { |
| return 0; |
| } |
| let mut val = 0u64; |
| let storage = self.storage.as_ref(); |
| let start_byte = bit_offset / 8; |
| let bit_shift = bit_offset % 8; |
| let bytes_needed = (bit_width as usize + bit_shift + 7) / 8; |
| if cfg!(target_endian = "big") { |
| for i in 0..bytes_needed { |
| val |= (storage[start_byte + i].reverse_bits() as u64) << (i * 8); |
| } |
| } else { |
| for i in 0..bytes_needed { |
| val |= (storage[start_byte + i] as u64) << (i * 8); |
| } |
| } |
| val >>= bit_shift; |
| if bit_width < 64 { |
| val &= (1u64 << bit_width) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - bit_width as usize); |
| } |
| val |
| } |
| #[inline] |
| pub unsafe fn raw_get(this: *const Self, bit_offset: usize, bit_width: u8) -> u64 { |
| debug_assert!(bit_width <= 64); |
| debug_assert!(bit_offset / 8 < core::mem::size_of::<Storage>()); |
| debug_assert!( |
| (bit_offset + (bit_width as usize)) / 8 <= core::mem::size_of::<Storage>(), |
| ); |
| if bit_width == 0 { |
| return 0; |
| } |
| let mut val = 0u64; |
| let start_byte = bit_offset / 8; |
| let bit_shift = bit_offset % 8; |
| let bytes_needed = (bit_width as usize + bit_shift + 7) / 8; |
| let storage_ptr = unsafe { core::ptr::addr_of!((*this).storage) as *const u8 }; |
| if cfg!(target_endian = "big") { |
| for i in 0..bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte.reverse_bits() as u64) << (i * 8); |
| } |
| } else { |
| for i in 0..bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte as u64) << (i * 8); |
| } |
| } |
| val >>= bit_shift; |
| if bit_width < 64 { |
| val &= (1u64 << bit_width) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - bit_width as usize); |
| } |
| val |
| } |
| #[inline] |
| pub fn set(&mut self, bit_offset: usize, bit_width: u8, val: u64) { |
| debug_assert!(bit_width <= 64); |
| debug_assert!(bit_offset / 8 < self.storage.as_ref().len()); |
| debug_assert!( |
| (bit_offset + (bit_width as usize)) / 8 <= self.storage.as_ref().len(), |
| ); |
| if bit_width == 0 { |
| return; |
| } |
| let mut val = val; |
| if bit_width < 64 { |
| val &= (1u64 << bit_width) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - bit_width as usize); |
| } |
| let storage = self.storage.as_mut(); |
| let start_byte = bit_offset / 8; |
| let bit_shift = bit_offset % 8; |
| let bytes_needed = (bit_width as usize + bit_shift + 7) / 8; |
| val <<= bit_shift; |
| let field_mask = if bit_width as usize + bit_shift >= 64 { |
| !0u64 << bit_shift |
| } else { |
| ((1u64 << bit_width) - 1) << bit_shift |
| }; |
| for i in 0..bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| if cfg!(target_endian = "big") { |
| let byte = storage[start_byte + i].reverse_bits(); |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| storage[start_byte + i] = new_byte.reverse_bits(); |
| } else { |
| storage[start_byte + i] = (storage[start_byte + i] & !byte_mask) |
| | (byte_val & byte_mask); |
| } |
| } |
| } |
| #[inline] |
| pub unsafe fn raw_set(this: *mut Self, bit_offset: usize, bit_width: u8, val: u64) { |
| debug_assert!(bit_width <= 64); |
| debug_assert!(bit_offset / 8 < core::mem::size_of::<Storage>()); |
| debug_assert!( |
| (bit_offset + (bit_width as usize)) / 8 <= core::mem::size_of::<Storage>(), |
| ); |
| if bit_width == 0 { |
| return; |
| } |
| let mut val = val; |
| if bit_width < 64 { |
| val &= (1u64 << bit_width) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - bit_width as usize); |
| } |
| let start_byte = bit_offset / 8; |
| let bit_shift = bit_offset % 8; |
| let bytes_needed = (bit_width as usize + bit_shift + 7) / 8; |
| val <<= bit_shift; |
| let field_mask = if bit_width as usize + bit_shift >= 64 { |
| !0u64 << bit_shift |
| } else { |
| ((1u64 << bit_width) - 1) << bit_shift |
| }; |
| let storage_ptr = unsafe { core::ptr::addr_of_mut!((*this).storage) as *mut u8 }; |
| for i in 0..bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| let byte_ptr = unsafe { storage_ptr.add(start_byte + i) }; |
| if cfg!(target_endian = "big") { |
| let byte = unsafe { (*byte_ptr).reverse_bits() }; |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| unsafe { *byte_ptr = new_byte.reverse_bits() }; |
| } else { |
| unsafe { *byte_ptr = (*byte_ptr & !byte_mask) | (byte_val & byte_mask) }; |
| } |
| } |
| } |
| } |
| /// Const-generic methods for efficient bitfield access when offset and width |
| /// are known at compile time. |
| impl<const N: usize> __BindgenBitfieldUnit<[u8; N]> { |
| /// Get a field using const generics for compile-time optimization. |
| /// Uses native word size operations when the field fits in usize. |
| #[inline] |
| pub const fn get_const<const BIT_OFFSET: usize, const BIT_WIDTH: u8>(&self) -> u64 { |
| debug_assert!(BIT_WIDTH <= 64); |
| debug_assert!(BIT_OFFSET / 8 < N); |
| debug_assert!((BIT_OFFSET + (BIT_WIDTH as usize)) / 8 <= N); |
| if BIT_WIDTH == 0 { |
| return 0; |
| } |
| let start_byte = BIT_OFFSET / 8; |
| let bit_shift = BIT_OFFSET % 8; |
| let bytes_needed = (BIT_WIDTH as usize + bit_shift + 7) / 8; |
| if BIT_WIDTH as usize + bit_shift <= usize::BITS as usize { |
| let mut val = 0usize; |
| if cfg!(target_endian = "big") { |
| let mut i = 0; |
| while i < bytes_needed { |
| val |
| |= (self.storage[start_byte + i].reverse_bits() as usize) |
| << (i * 8); |
| i += 1; |
| } |
| } else { |
| let mut i = 0; |
| while i < bytes_needed { |
| val |= (self.storage[start_byte + i] as usize) << (i * 8); |
| i += 1; |
| } |
| } |
| val >>= bit_shift; |
| val &= (1usize << BIT_WIDTH) - 1; |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (usize::BITS as usize - BIT_WIDTH as usize); |
| } |
| val as u64 |
| } else { |
| let mut val = 0u64; |
| if cfg!(target_endian = "big") { |
| let mut i = 0; |
| while i < bytes_needed { |
| val |
| |= (self.storage[start_byte + i].reverse_bits() as u64) |
| << (i * 8); |
| i += 1; |
| } |
| } else { |
| let mut i = 0; |
| while i < bytes_needed { |
| val |= (self.storage[start_byte + i] as u64) << (i * 8); |
| i += 1; |
| } |
| } |
| val >>= bit_shift; |
| if BIT_WIDTH < 64 { |
| val &= (1u64 << BIT_WIDTH) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - BIT_WIDTH as usize); |
| } |
| val |
| } |
| } |
| /// Set a field using const generics for compile-time optimization. |
| /// Uses native word size operations when the field fits in usize. |
| #[inline] |
| pub fn set_const<const BIT_OFFSET: usize, const BIT_WIDTH: u8>(&mut self, val: u64) { |
| debug_assert!(BIT_WIDTH <= 64); |
| debug_assert!(BIT_OFFSET / 8 < N); |
| debug_assert!((BIT_OFFSET + (BIT_WIDTH as usize)) / 8 <= N); |
| if BIT_WIDTH == 0 { |
| return; |
| } |
| let start_byte = BIT_OFFSET / 8; |
| let bit_shift = BIT_OFFSET % 8; |
| let bytes_needed = (BIT_WIDTH as usize + bit_shift + 7) / 8; |
| if BIT_WIDTH as usize + bit_shift <= usize::BITS as usize { |
| let mut val = val as usize; |
| val &= (1usize << BIT_WIDTH) - 1; |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (usize::BITS as usize - BIT_WIDTH as usize); |
| } |
| val <<= bit_shift; |
| let field_mask = ((1usize << BIT_WIDTH) - 1) << bit_shift; |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| if cfg!(target_endian = "big") { |
| let byte = self.storage[start_byte + i].reverse_bits(); |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| self.storage[start_byte + i] = new_byte.reverse_bits(); |
| } else { |
| self.storage[start_byte + i] = (self.storage[start_byte + i] |
| & !byte_mask) | (byte_val & byte_mask); |
| } |
| i += 1; |
| } |
| } else { |
| let mut val = val; |
| if BIT_WIDTH < 64 { |
| val &= (1u64 << BIT_WIDTH) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - BIT_WIDTH as usize); |
| } |
| val <<= bit_shift; |
| let field_mask = if BIT_WIDTH as usize + bit_shift >= 64 { |
| !0u64 << bit_shift |
| } else { |
| ((1u64 << BIT_WIDTH) - 1) << bit_shift |
| }; |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| if cfg!(target_endian = "big") { |
| let byte = self.storage[start_byte + i].reverse_bits(); |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| self.storage[start_byte + i] = new_byte.reverse_bits(); |
| } else { |
| self.storage[start_byte + i] = (self.storage[start_byte + i] |
| & !byte_mask) | (byte_val & byte_mask); |
| } |
| i += 1; |
| } |
| } |
| } |
| /// Raw pointer get using const generics for compile-time optimization. |
| /// Uses native word size operations when the field fits in usize. |
| #[inline] |
| pub const unsafe fn raw_get_const<const BIT_OFFSET: usize, const BIT_WIDTH: u8>( |
| this: *const Self, |
| ) -> u64 { |
| debug_assert!(BIT_WIDTH <= 64); |
| debug_assert!(BIT_OFFSET / 8 < N); |
| debug_assert!((BIT_OFFSET + (BIT_WIDTH as usize)) / 8 <= N); |
| if BIT_WIDTH == 0 { |
| return 0; |
| } |
| let start_byte = BIT_OFFSET / 8; |
| let bit_shift = BIT_OFFSET % 8; |
| let bytes_needed = (BIT_WIDTH as usize + bit_shift + 7) / 8; |
| let storage_ptr = unsafe { core::ptr::addr_of!((*this).storage) as *const u8 }; |
| if BIT_WIDTH as usize + bit_shift <= usize::BITS as usize { |
| let mut val = 0usize; |
| if cfg!(target_endian = "big") { |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte.reverse_bits() as usize) << (i * 8); |
| i += 1; |
| } |
| } else { |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte as usize) << (i * 8); |
| i += 1; |
| } |
| } |
| val >>= bit_shift; |
| val &= (1usize << BIT_WIDTH) - 1; |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (usize::BITS as usize - BIT_WIDTH as usize); |
| } |
| val as u64 |
| } else { |
| let mut val = 0u64; |
| if cfg!(target_endian = "big") { |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte.reverse_bits() as u64) << (i * 8); |
| i += 1; |
| } |
| } else { |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte = unsafe { *storage_ptr.add(start_byte + i) }; |
| val |= (byte as u64) << (i * 8); |
| i += 1; |
| } |
| } |
| val >>= bit_shift; |
| if BIT_WIDTH < 64 { |
| val &= (1u64 << BIT_WIDTH) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - BIT_WIDTH as usize); |
| } |
| val |
| } |
| } |
| /// Raw pointer set using const generics for compile-time optimization. |
| /// Uses native word size operations when the field fits in usize. |
| #[inline] |
| pub unsafe fn raw_set_const<const BIT_OFFSET: usize, const BIT_WIDTH: u8>( |
| this: *mut Self, |
| val: u64, |
| ) { |
| debug_assert!(BIT_WIDTH <= 64); |
| debug_assert!(BIT_OFFSET / 8 < N); |
| debug_assert!((BIT_OFFSET + (BIT_WIDTH as usize)) / 8 <= N); |
| if BIT_WIDTH == 0 { |
| return; |
| } |
| let start_byte = BIT_OFFSET / 8; |
| let bit_shift = BIT_OFFSET % 8; |
| let bytes_needed = (BIT_WIDTH as usize + bit_shift + 7) / 8; |
| let storage_ptr = this.cast::<[u8; N]>().cast::<u8>(); |
| if BIT_WIDTH as usize + bit_shift <= usize::BITS as usize { |
| let mut val = val as usize; |
| val &= (1usize << BIT_WIDTH) - 1; |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (usize::BITS as usize - BIT_WIDTH as usize); |
| } |
| val <<= bit_shift; |
| let field_mask = ((1usize << BIT_WIDTH) - 1) << bit_shift; |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| let byte_ptr = unsafe { storage_ptr.add(start_byte + i) }; |
| if cfg!(target_endian = "big") { |
| let byte = unsafe { (*byte_ptr).reverse_bits() }; |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| unsafe { *byte_ptr = new_byte.reverse_bits() }; |
| } else { |
| unsafe { |
| *byte_ptr = (*byte_ptr & !byte_mask) | (byte_val & byte_mask) |
| }; |
| } |
| i += 1; |
| } |
| } else { |
| let mut val = val; |
| if BIT_WIDTH < 64 { |
| val &= (1u64 << BIT_WIDTH) - 1; |
| } |
| if cfg!(target_endian = "big") { |
| val = val.reverse_bits() >> (64 - BIT_WIDTH as usize); |
| } |
| val <<= bit_shift; |
| let field_mask = if BIT_WIDTH as usize + bit_shift >= 64 { |
| !0u64 << bit_shift |
| } else { |
| ((1u64 << BIT_WIDTH) - 1) << bit_shift |
| }; |
| let mut i = 0; |
| while i < bytes_needed { |
| let byte_val = (val >> (i * 8)) as u8; |
| let byte_mask = (field_mask >> (i * 8)) as u8; |
| let byte_ptr = unsafe { storage_ptr.add(start_byte + i) }; |
| if cfg!(target_endian = "big") { |
| let byte = unsafe { (*byte_ptr).reverse_bits() }; |
| let new_byte = (byte & !byte_mask) | (byte_val & byte_mask); |
| unsafe { *byte_ptr = new_byte.reverse_bits() }; |
| } else { |
| unsafe { |
| *byte_ptr = (*byte_ptr & !byte_mask) | (byte_val & byte_mask) |
| }; |
| } |
| i += 1; |
| } |
| } |
| } |
| } |
| pub type U8 = ::std::os::raw::c_uchar; |
| pub type U16 = ::std::os::raw::c_ushort; |
| #[repr(C)] |
| #[derive(Debug, Default, Copy, Clone)] |
| pub struct V56AMDY { |
| pub _bindgen_align: [u16; 0], |
| pub _bitfield_1: __BindgenBitfieldUnit<[u8; 2usize]>, |
| pub MADK: U8, |
| pub MABR: U8, |
| pub _bitfield_2: __BindgenBitfieldUnit<[u8; 3usize]>, |
| pub _rB_: U8, |
| } |
| #[allow(clippy::unnecessary_operation, clippy::identity_op)] |
| const _: () = { |
| ["Size of V56AMDY"][::std::mem::size_of::<V56AMDY>() - 8usize]; |
| ["Alignment of V56AMDY"][::std::mem::align_of::<V56AMDY>() - 2usize]; |
| ["Offset of field: V56AMDY::MADK"][::std::mem::offset_of!(V56AMDY, MADK) - 2usize]; |
| ["Offset of field: V56AMDY::MABR"][::std::mem::offset_of!(V56AMDY, MABR) - 3usize]; |
| ["Offset of field: V56AMDY::_rB_"][::std::mem::offset_of!(V56AMDY, _rB_) - 7usize]; |
| }; |
| impl V56AMDY { |
| #[inline] |
| pub fn MADZ(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_1.get_const::<0usize, 10u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MADZ(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_1.set_const::<0usize, 10u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MADZ_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_get_const::< |
| 0usize, |
| 10u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_1)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MADZ_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_set_const::< |
| 0usize, |
| 10u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_1), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MAI0(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_1.get_const::<10usize, 2u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MAI0(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_1.set_const::<10usize, 2u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MAI0_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_get_const::< |
| 10usize, |
| 2u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_1)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MAI0_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_set_const::< |
| 10usize, |
| 2u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_1), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MAI1(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_1.get_const::<12usize, 2u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MAI1(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_1.set_const::<12usize, 2u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MAI1_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_get_const::< |
| 12usize, |
| 2u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_1)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MAI1_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_set_const::< |
| 12usize, |
| 2u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_1), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MAI2(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_1.get_const::<14usize, 2u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MAI2(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_1.set_const::<14usize, 2u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MAI2_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_get_const::< |
| 14usize, |
| 2u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_1)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MAI2_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 2usize], |
| >>::raw_set_const::< |
| 14usize, |
| 2u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_1), val as u64) |
| } |
| } |
| #[inline] |
| pub fn new_bitfield_1( |
| MADZ: U16, |
| MAI0: U16, |
| MAI1: U16, |
| MAI2: U16, |
| ) -> __BindgenBitfieldUnit<[u8; 2usize]> { |
| let mut __bindgen_bitfield_unit: __BindgenBitfieldUnit<[u8; 2usize]> = Default::default(); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 0usize, |
| 10u8, |
| >({ |
| let MADZ: u16 = unsafe { ::std::mem::transmute(MADZ) }; |
| MADZ as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 10usize, |
| 2u8, |
| >({ |
| let MAI0: u16 = unsafe { ::std::mem::transmute(MAI0) }; |
| MAI0 as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 12usize, |
| 2u8, |
| >({ |
| let MAI1: u16 = unsafe { ::std::mem::transmute(MAI1) }; |
| MAI1 as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 14usize, |
| 2u8, |
| >({ |
| let MAI2: u16 = unsafe { ::std::mem::transmute(MAI2) }; |
| MAI2 as u64 |
| }); |
| __bindgen_bitfield_unit |
| } |
| #[inline] |
| pub fn MATH(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<0usize, 10u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MATH(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<0usize, 10u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MATH_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 0usize, |
| 10u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MATH_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 0usize, |
| 10u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MATE(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<10usize, 4u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MATE(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<10usize, 4u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MATE_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 10usize, |
| 4u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MATE_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 10usize, |
| 4u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MATW(&self) -> U16 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<14usize, 2u8>() as u16) |
| } |
| } |
| #[inline] |
| pub fn set_MATW(&mut self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<14usize, 2u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MATW_raw(this: *const Self) -> U16 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 14usize, |
| 2u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u16, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MATW_raw(this: *mut Self, val: U16) { |
| unsafe { |
| let val: u16 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 14usize, |
| 2u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MASW(&self) -> U8 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<16usize, 4u8>() as u8) |
| } |
| } |
| #[inline] |
| pub fn set_MASW(&mut self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<16usize, 4u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MASW_raw(this: *const Self) -> U8 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 16usize, |
| 4u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u8, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MASW_raw(this: *mut Self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 16usize, |
| 4u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MABW(&self) -> U8 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<20usize, 3u8>() as u8) |
| } |
| } |
| #[inline] |
| pub fn set_MABW(&mut self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<20usize, 3u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MABW_raw(this: *const Self) -> U8 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 20usize, |
| 3u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u8, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MABW_raw(this: *mut Self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 20usize, |
| 3u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn MAXN(&self) -> U8 { |
| unsafe { |
| ::std::mem::transmute(self._bitfield_2.get_const::<23usize, 1u8>() as u8) |
| } |
| } |
| #[inline] |
| pub fn set_MAXN(&mut self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| self._bitfield_2.set_const::<23usize, 1u8>(val as u64) |
| } |
| } |
| #[inline] |
| pub unsafe fn MAXN_raw(this: *const Self) -> U8 { |
| unsafe { |
| ::std::mem::transmute( |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_get_const::< |
| 23usize, |
| 1u8, |
| >(::std::ptr::addr_of!((*this)._bitfield_2)) as u8, |
| ) |
| } |
| } |
| #[inline] |
| pub unsafe fn set_MAXN_raw(this: *mut Self, val: U8) { |
| unsafe { |
| let val: u8 = ::std::mem::transmute(val); |
| <__BindgenBitfieldUnit< |
| [u8; 3usize], |
| >>::raw_set_const::< |
| 23usize, |
| 1u8, |
| >(::std::ptr::addr_of_mut!((*this)._bitfield_2), val as u64) |
| } |
| } |
| #[inline] |
| pub fn new_bitfield_2( |
| MATH: U16, |
| MATE: U16, |
| MATW: U16, |
| MASW: U8, |
| MABW: U8, |
| MAXN: U8, |
| ) -> __BindgenBitfieldUnit<[u8; 3usize]> { |
| let mut __bindgen_bitfield_unit: __BindgenBitfieldUnit<[u8; 3usize]> = Default::default(); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 0usize, |
| 10u8, |
| >({ |
| let MATH: u16 = unsafe { ::std::mem::transmute(MATH) }; |
| MATH as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 10usize, |
| 4u8, |
| >({ |
| let MATE: u16 = unsafe { ::std::mem::transmute(MATE) }; |
| MATE as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 14usize, |
| 2u8, |
| >({ |
| let MATW: u16 = unsafe { ::std::mem::transmute(MATW) }; |
| MATW as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 16usize, |
| 4u8, |
| >({ |
| let MASW: u8 = unsafe { ::std::mem::transmute(MASW) }; |
| MASW as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 20usize, |
| 3u8, |
| >({ |
| let MABW: u8 = unsafe { ::std::mem::transmute(MABW) }; |
| MABW as u64 |
| }); |
| __bindgen_bitfield_unit |
| .set_const::< |
| 23usize, |
| 1u8, |
| >({ |
| let MAXN: u8 = unsafe { ::std::mem::transmute(MAXN) }; |
| MAXN as u64 |
| }); |
| __bindgen_bitfield_unit |
| } |
| } |
