#[doc = r" Value read from the register"]
pub struct R {
bits: u32,
}
#[doc = r" Value to write to the register"]
pub struct W {
bits: u32,
}
impl super::CTRL {
#[doc = r" Modifies the contents of the register"]
#[inline]
pub fn modify<F>(&self, f: F)
where
for<'w> F: FnOnce(&R, &'w mut W) -> &'w mut W,
{
let bits = self.register.get();
let r = R { bits: bits };
let mut w = W { bits: bits };
f(&r, &mut w);
self.register.set(w.bits);
}
#[doc = r" Reads the contents of the register"]
#[inline]
pub fn read(&self) -> R {
R {
bits: self.register.get(),
}
}
#[doc = r" Writes to the register"]
#[inline]
pub fn write<F>(&self, f: F)
where
F: FnOnce(&mut W) -> &mut W,
{
let mut w = W::reset_value();
f(&mut w);
self.register.set(w.bits);
}
#[doc = r" Writes the reset value to the register"]
#[inline]
pub fn reset(&self) {
self.write(|w| w)
}
}
#[doc = r" Value of the field"]
pub struct DOWN_LR {
bits: bool,
}
impl DOWN_LR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct STOP_LR {
bits: bool,
}
impl STOP_LR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct HALT_LR {
bits: bool,
}
impl HALT_LR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct CLRCTR_LR {
bits: bool,
}
impl CLRCTR_LR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = "Possible values of the field `BIDIR_L`"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum BIDIR_LR {
#[doc = "The counter counts up to its limit condition, then is cleared to zero."]
CLEAR_TO_ZERO,
#[doc = "The counter counts up to its limit, then counts down to a limit condition or to 0."]
THE_COUNTER_COUNTS_U,
}
impl BIDIR_LR {
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
match *self {
BIDIR_LR::CLEAR_TO_ZERO => false,
BIDIR_LR::THE_COUNTER_COUNTS_U => true,
}
}
#[allow(missing_docs)]
#[doc(hidden)]
#[inline]
pub fn _from(value: bool) -> BIDIR_LR {
match value {
false => BIDIR_LR::CLEAR_TO_ZERO,
true => BIDIR_LR::THE_COUNTER_COUNTS_U,
}
}
#[doc = "Checks if the value of the field is `CLEAR_TO_ZERO`"]
#[inline]
pub fn is_clear_to_zero(&self) -> bool {
*self == BIDIR_LR::CLEAR_TO_ZERO
}
#[doc = "Checks if the value of the field is `THE_COUNTER_COUNTS_U`"]
#[inline]
pub fn is_the_counter_counts_u(&self) -> bool {
*self == BIDIR_LR::THE_COUNTER_COUNTS_U
}
}
#[doc = r" Value of the field"]
pub struct PRE_LR {
bits: u8,
}
impl PRE_LR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bits(&self) -> u8 {
self.bits
}
}
#[doc = r" Value of the field"]
pub struct DOWN_HR {
bits: bool,
}
impl DOWN_HR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct STOP_HR {
bits: bool,
}
impl STOP_HR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct HALT_HR {
bits: bool,
}
impl HALT_HR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = r" Value of the field"]
pub struct CLRCTR_HR {
bits: bool,
}
impl CLRCTR_HR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
self.bits
}
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
}
#[doc = "Possible values of the field `BIDIR_H`"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum BIDIR_HR {
#[doc = "The H counter counts up to its limit condition, then is cleared to zero."]
CLEAR_TO_ZERO,
#[doc = "The H counter counts up to its limit, then counts down to a limit condition or to 0."]
THE_H_COUNTER_COUNTS,
}
impl BIDIR_HR {
#[doc = r" Returns `true` if the bit is clear (0)"]
#[inline]
pub fn bit_is_clear(&self) -> bool {
!self.bit()
}
#[doc = r" Returns `true` if the bit is set (1)"]
#[inline]
pub fn bit_is_set(&self) -> bool {
self.bit()
}
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bit(&self) -> bool {
match *self {
BIDIR_HR::CLEAR_TO_ZERO => false,
BIDIR_HR::THE_H_COUNTER_COUNTS => true,
}
}
#[allow(missing_docs)]
#[doc(hidden)]
#[inline]
pub fn _from(value: bool) -> BIDIR_HR {
match value {
false => BIDIR_HR::CLEAR_TO_ZERO,
true => BIDIR_HR::THE_H_COUNTER_COUNTS,
}
}
#[doc = "Checks if the value of the field is `CLEAR_TO_ZERO`"]
#[inline]
pub fn is_clear_to_zero(&self) -> bool {
*self == BIDIR_HR::CLEAR_TO_ZERO
}
#[doc = "Checks if the value of the field is `THE_H_COUNTER_COUNTS`"]
#[inline]
pub fn is_the_h_counter_counts(&self) -> bool {
*self == BIDIR_HR::THE_H_COUNTER_COUNTS
}
}
#[doc = r" Value of the field"]
pub struct PRE_HR {
bits: u8,
}
impl PRE_HR {
#[doc = r" Value of the field as raw bits"]
#[inline]
pub fn bits(&self) -> u8 {
self.bits
}
}
#[doc = r" Proxy"]
pub struct _DOWN_LW<'a> {
w: &'a mut W,
}
impl<'a> _DOWN_LW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 0;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _STOP_LW<'a> {
w: &'a mut W,
}
impl<'a> _STOP_LW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 1;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _HALT_LW<'a> {
w: &'a mut W,
}
impl<'a> _HALT_LW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 2;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _CLRCTR_LW<'a> {
w: &'a mut W,
}
impl<'a> _CLRCTR_LW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 3;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = "Values that can be written to the field `BIDIR_L`"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum BIDIR_LW {
#[doc = "The counter counts up to its limit condition, then is cleared to zero."]
CLEAR_TO_ZERO,
#[doc = "The counter counts up to its limit, then counts down to a limit condition or to 0."]
THE_COUNTER_COUNTS_U,
}
impl BIDIR_LW {
#[allow(missing_docs)]
#[doc(hidden)]
#[inline]
pub fn _bits(&self) -> bool {
match *self {
BIDIR_LW::CLEAR_TO_ZERO => false,
BIDIR_LW::THE_COUNTER_COUNTS_U => true,
}
}
}
#[doc = r" Proxy"]
pub struct _BIDIR_LW<'a> {
w: &'a mut W,
}
impl<'a> _BIDIR_LW<'a> {
#[doc = r" Writes `variant` to the field"]
#[inline]
pub fn variant(self, variant: BIDIR_LW) -> &'a mut W {
{
self.bit(variant._bits())
}
}
#[doc = "The counter counts up to its limit condition, then is cleared to zero."]
#[inline]
pub fn clear_to_zero(self) -> &'a mut W {
self.variant(BIDIR_LW::CLEAR_TO_ZERO)
}
#[doc = "The counter counts up to its limit, then counts down to a limit condition or to 0."]
#[inline]
pub fn the_counter_counts_u(self) -> &'a mut W {
self.variant(BIDIR_LW::THE_COUNTER_COUNTS_U)
}
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 4;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _PRE_LW<'a> {
w: &'a mut W,
}
impl<'a> _PRE_LW<'a> {
#[doc = r" Writes raw bits to the field"]
#[inline]
pub unsafe fn bits(self, value: u8) -> &'a mut W {
const MASK: u8 = 255;
const OFFSET: u8 = 5;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _DOWN_HW<'a> {
w: &'a mut W,
}
impl<'a> _DOWN_HW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 16;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _STOP_HW<'a> {
w: &'a mut W,
}
impl<'a> _STOP_HW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 17;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _HALT_HW<'a> {
w: &'a mut W,
}
impl<'a> _HALT_HW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 18;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _CLRCTR_HW<'a> {
w: &'a mut W,
}
impl<'a> _CLRCTR_HW<'a> {
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 19;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = "Values that can be written to the field `BIDIR_H`"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum BIDIR_HW {
#[doc = "The H counter counts up to its limit condition, then is cleared to zero."]
CLEAR_TO_ZERO,
#[doc = "The H counter counts up to its limit, then counts down to a limit condition or to 0."]
THE_H_COUNTER_COUNTS,
}
impl BIDIR_HW {
#[allow(missing_docs)]
#[doc(hidden)]
#[inline]
pub fn _bits(&self) -> bool {
match *self {
BIDIR_HW::CLEAR_TO_ZERO => false,
BIDIR_HW::THE_H_COUNTER_COUNTS => true,
}
}
}
#[doc = r" Proxy"]
pub struct _BIDIR_HW<'a> {
w: &'a mut W,
}
impl<'a> _BIDIR_HW<'a> {
#[doc = r" Writes `variant` to the field"]
#[inline]
pub fn variant(self, variant: BIDIR_HW) -> &'a mut W {
{
self.bit(variant._bits())
}
}
#[doc = "The H counter counts up to its limit condition, then is cleared to zero."]
#[inline]
pub fn clear_to_zero(self) -> &'a mut W {
self.variant(BIDIR_HW::CLEAR_TO_ZERO)
}
#[doc = "The H counter counts up to its limit, then counts down to a limit condition or to 0."]
#[inline]
pub fn the_h_counter_counts(self) -> &'a mut W {
self.variant(BIDIR_HW::THE_H_COUNTER_COUNTS)
}
#[doc = r" Sets the field bit"]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r" Clears the field bit"]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r" Writes raw bits to the field"]
#[inline]
pub fn bit(self, value: bool) -> &'a mut W {
const MASK: bool = true;
const OFFSET: u8 = 20;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
#[doc = r" Proxy"]
pub struct _PRE_HW<'a> {
w: &'a mut W,
}
impl<'a> _PRE_HW<'a> {
#[doc = r" Writes raw bits to the field"]
#[inline]
pub unsafe fn bits(self, value: u8) -> &'a mut W {
const MASK: u8 = 255;
const OFFSET: u8 = 21;
self.w.bits &= !((MASK as u32) << OFFSET);
self.w.bits |= ((value & MASK) as u32) << OFFSET;
self.w
}
}
impl R {
#[doc = r" Value of the register as raw bits"]
#[inline]
pub fn bits(&self) -> u32 {
self.bits
}
#[doc = "Bit 0 - This bit is 1 when the L or unified counter is counting down. Hardware sets this bit when the counter limit is reached and BIDIR is 1. Hardware clears this bit when the counter is counting down and a limit condition occurs or when the counter reaches 0."]
#[inline]
pub fn down_l(&self) -> DOWN_LR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 0;
((self.bits >> OFFSET) & MASK as u32) != 0
};
DOWN_LR { bits }
}
#[doc = "Bit 1 - When this bit is 1 and HALT is 0, the L or unified counter does not run, but I/O events related to the counter can occur. If such an event matches the mask in the Start register, this bit is cleared and counting resumes."]
#[inline]
pub fn stop_l(&self) -> STOP_LR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 1;
((self.bits >> OFFSET) & MASK as u32) != 0
};
STOP_LR { bits }
}
#[doc = "Bit 2 - When this bit is 1, the L or unified counter does not run and no events can occur. A reset sets this bit. When the HALT_L bit is one, the STOP_L bit is cleared. If you want to remove the halt condition and keep the SCT in the stop condition (not running), then you can change the halt and stop condition with one single write to this register. Once set, only software can clear this bit to restore counter operation."]
#[inline]
pub fn halt_l(&self) -> HALT_LR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 2;
((self.bits >> OFFSET) & MASK as u32) != 0
};
HALT_LR { bits }
}
#[doc = "Bit 3 - Writing a 1 to this bit clears the L or unified counter. This bit always reads as 0."]
#[inline]
pub fn clrctr_l(&self) -> CLRCTR_LR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 3;
((self.bits >> OFFSET) & MASK as u32) != 0
};
CLRCTR_LR { bits }
}
#[doc = "Bit 4 - L or unified counter direction select"]
#[inline]
pub fn bidir_l(&self) -> BIDIR_LR {
BIDIR_LR::_from({
const MASK: bool = true;
const OFFSET: u8 = 4;
((self.bits >> OFFSET) & MASK as u32) != 0
})
}
#[doc = "Bits 5:12 - Specifies the factor by which the SCT clock is prescaled to produce the L or unified counter clock. The counter clock is clocked at the rate of the SCT clock divided by PRE_L+1. Clear the counter (by writing a 1 to the CLRCTR bit) whenever changing the PRE value."]
#[inline]
pub fn pre_l(&self) -> PRE_LR {
let bits = {
const MASK: u8 = 255;
const OFFSET: u8 = 5;
((self.bits >> OFFSET) & MASK as u32) as u8
};
PRE_LR { bits }
}
#[doc = "Bit 16 - This bit is 1 when the H counter is counting down. Hardware sets this bit when the counter limit is reached and BIDIR is 1. Hardware clears this bit when the counter is counting down and a limit condition occurs or when the counter reaches 0."]
#[inline]
pub fn down_h(&self) -> DOWN_HR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 16;
((self.bits >> OFFSET) & MASK as u32) != 0
};
DOWN_HR { bits }
}
#[doc = "Bit 17 - When this bit is 1 and HALT is 0, the H counter does not, run but I/O events related to the counter can occur. If such an event matches the mask in the Start register, this bit is cleared and counting resumes."]
#[inline]
pub fn stop_h(&self) -> STOP_HR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 17;
((self.bits >> OFFSET) & MASK as u32) != 0
};
STOP_HR { bits }
}
#[doc = "Bit 18 - When this bit is 1, the H counter does not run and no events can occur. A reset sets this bit. When the HALT_H bit is one, the STOP_H bit is cleared. If you want to remove the halt condition and keep the SCT in the stop condition (not running), then you can change the halt and stop condition with one single write to this register. Once set, this bit can only be cleared by software to restore counter operation."]
#[inline]
pub fn halt_h(&self) -> HALT_HR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 18;
((self.bits >> OFFSET) & MASK as u32) != 0
};
HALT_HR { bits }
}
#[doc = "Bit 19 - Writing a 1 to this bit clears the H counter. This bit always reads as 0."]
#[inline]
pub fn clrctr_h(&self) -> CLRCTR_HR {
let bits = {
const MASK: bool = true;
const OFFSET: u8 = 19;
((self.bits >> OFFSET) & MASK as u32) != 0
};
CLRCTR_HR { bits }
}
#[doc = "Bit 20 - Direction select"]
#[inline]
pub fn bidir_h(&self) -> BIDIR_HR {
BIDIR_HR::_from({
const MASK: bool = true;
const OFFSET: u8 = 20;
((self.bits >> OFFSET) & MASK as u32) != 0
})
}
#[doc = "Bits 21:28 - Specifies the factor by which the SCT clock is prescaled to produce the H counter clock. The counter clock is clocked at the rate of the SCT clock divided by PRELH+1. Clear the counter (by writing a 1 to the CLRCTR bit) whenever changing the PRE value."]
#[inline]
pub fn pre_h(&self) -> PRE_HR {
let bits = {
const MASK: u8 = 255;
const OFFSET: u8 = 21;
((self.bits >> OFFSET) & MASK as u32) as u8
};
PRE_HR { bits }
}
}
impl W {
#[doc = r" Reset value of the register"]
#[inline]
pub fn reset_value() -> W {
W { bits: 262148 }
}
#[doc = r" Writes raw bits to the register"]
#[inline]
pub unsafe fn bits(&mut self, bits: u32) -> &mut Self {
self.bits = bits;
self
}
#[doc = "Bit 0 - This bit is 1 when the L or unified counter is counting down. Hardware sets this bit when the counter limit is reached and BIDIR is 1. Hardware clears this bit when the counter is counting down and a limit condition occurs or when the counter reaches 0."]
#[inline]
pub fn down_l(&mut self) -> _DOWN_LW {
_DOWN_LW { w: self }
}
#[doc = "Bit 1 - When this bit is 1 and HALT is 0, the L or unified counter does not run, but I/O events related to the counter can occur. If such an event matches the mask in the Start register, this bit is cleared and counting resumes."]
#[inline]
pub fn stop_l(&mut self) -> _STOP_LW {
_STOP_LW { w: self }
}
#[doc = "Bit 2 - When this bit is 1, the L or unified counter does not run and no events can occur. A reset sets this bit. When the HALT_L bit is one, the STOP_L bit is cleared. If you want to remove the halt condition and keep the SCT in the stop condition (not running), then you can change the halt and stop condition with one single write to this register. Once set, only software can clear this bit to restore counter operation."]
#[inline]
pub fn halt_l(&mut self) -> _HALT_LW {
_HALT_LW { w: self }
}
#[doc = "Bit 3 - Writing a 1 to this bit clears the L or unified counter. This bit always reads as 0."]
#[inline]
pub fn clrctr_l(&mut self) -> _CLRCTR_LW {
_CLRCTR_LW { w: self }
}
#[doc = "Bit 4 - L or unified counter direction select"]
#[inline]
pub fn bidir_l(&mut self) -> _BIDIR_LW {
_BIDIR_LW { w: self }
}
#[doc = "Bits 5:12 - Specifies the factor by which the SCT clock is prescaled to produce the L or unified counter clock. The counter clock is clocked at the rate of the SCT clock divided by PRE_L+1. Clear the counter (by writing a 1 to the CLRCTR bit) whenever changing the PRE value."]
#[inline]
pub fn pre_l(&mut self) -> _PRE_LW {
_PRE_LW { w: self }
}
#[doc = "Bit 16 - This bit is 1 when the H counter is counting down. Hardware sets this bit when the counter limit is reached and BIDIR is 1. Hardware clears this bit when the counter is counting down and a limit condition occurs or when the counter reaches 0."]
#[inline]
pub fn down_h(&mut self) -> _DOWN_HW {
_DOWN_HW { w: self }
}
#[doc = "Bit 17 - When this bit is 1 and HALT is 0, the H counter does not, run but I/O events related to the counter can occur. If such an event matches the mask in the Start register, this bit is cleared and counting resumes."]
#[inline]
pub fn stop_h(&mut self) -> _STOP_HW {
_STOP_HW { w: self }
}
#[doc = "Bit 18 - When this bit is 1, the H counter does not run and no events can occur. A reset sets this bit. When the HALT_H bit is one, the STOP_H bit is cleared. If you want to remove the halt condition and keep the SCT in the stop condition (not running), then you can change the halt and stop condition with one single write to this register. Once set, this bit can only be cleared by software to restore counter operation."]
#[inline]
pub fn halt_h(&mut self) -> _HALT_HW {
_HALT_HW { w: self }
}
#[doc = "Bit 19 - Writing a 1 to this bit clears the H counter. This bit always reads as 0."]
#[inline]
pub fn clrctr_h(&mut self) -> _CLRCTR_HW {
_CLRCTR_HW { w: self }
}
#[doc = "Bit 20 - Direction select"]
#[inline]
pub fn bidir_h(&mut self) -> _BIDIR_HW {
_BIDIR_HW { w: self }
}
#[doc = "Bits 21:28 - Specifies the factor by which the SCT clock is prescaled to produce the H counter clock. The counter clock is clocked at the rate of the SCT clock divided by PRELH+1. Clear the counter (by writing a 1 to the CLRCTR bit) whenever changing the PRE value."]
#[inline]
pub fn pre_h(&mut self) -> _PRE_HW {
_PRE_HW { w: self }
}
}