pub fn update32<'b, X>(&mut self, data: X)
        where X: IntoIterator<Item = &'b u32> {
        assert!((self.ptr & 3) == 0);
        let mut ptr = self.ptr;
        for &v in data {
            unsafe {
                while self.sha.function_reg_1.read().fifo_in_full().bit() {
                    atomic::compiler_fence(Ordering::SeqCst)
                }
                self.sha.data_in.write(|w| w.bits(v));
            }
            ptr += 4;
        }
        self.ptr = ptr;
    }
/** Update SHA256 computation with new data (32 bit little-endian, must be four-aligned in
     * the data stream). This is roughly two times faster than byte by byte using `update`.
     */
Update SHA256 computation with new data (32 bit little-endian, must be four-aligned in
the data stream). This is roughly two times faster than byte by byte using `update`.
Update SHA256 computation with new data ( 32 bit little - endian must be four - aligned in the data stream ) . This is roughly two times faster than byte by byte using ` update ` .
pub fn update32<'b, X>(&mut self, data: X)
        where X: IntoIterator<Item = &'b u32> {
        assert!((self.ptr & 3) == 0);
        let mut ptr = self.ptr;
        for &v in data {
            unsafe {
                while self.sha.function_reg_1.read().fifo_in_full().bit() {
                    atomic::compiler_fence(Ordering::SeqCst)
                }
                self.sha.data_in.write(|w| w.bits(v));
            }
            ptr += 4;
        }
        self.ptr = ptr;
    }
pub fn update32 < ' b , X > ( & mut self , data : X ) where X : IntoIterator < Item = & ' b u32 > { assert ! ( ( self ptr 3 ) 0 ) ; let mut ptr = self . ptr ; for & v in data { unsafe { while self . sha . function_reg_1 . read ( ) . fifo_in_full ( ) . bit ( ) { atomic :: compiler_fence ( Ordering :: SeqCst ) } self . sha . data_in . write ( | w | w . bits ( v ) ) ; } ptr += 4 ; } self . ptr = ptr ; }
Update SHA256 computation with new data (32 bit little-endian, must be four-aligned in
 the data stream).
Update SHA256 computation with new data ( 32 bit little - endian must be four - aligned in the data stream ) .
&mut self
data
X
&mut self
data
X