Struct HandshakeHash

pub(crate) struct HandshakeHash {
    provider: &'static dyn Hash,
    ctx: Box<dyn Context>,
    client_auth: Option<Vec<u8>>,
}

This deals with keeping a running hash of the handshake payloads. This is computed by buffering initially. Once we know what hash function we need to use we switch to incremental hashing.

For client auth, we also need to buffer all the messages. This is disabled in cases where client auth is not possible.

Fields

provider: &'static dyn Hash

ctx: Box<dyn Context>

client_auth: Option<Vec<u8>>

buffer for client-auth.

Implementations

impl HandshakeHash

pub(crate) fn abandon_client_auth(&mut self)

We decided not to do client auth after all, so discard the transcript.

pub(crate) fn add_message(&mut self, m: &Message<'_>) -> &mut Self

Hash/buffer a handshake message.

pub(crate) fn add(&mut self, bytes: &[u8])

Hash/buffer an encoded handshake message.

fn add_raw(&mut self, buf: &[u8]) -> &mut Self

Hash or buffer a byte slice.

pub(crate) fn hash_given(&self, extra: &[u8]) -> Output

Get the hash value if we were to hash extra too, using hash function hash.

pub(crate) fn into_hrr_buffer(self) -> HandshakeHashBuffer

pub(crate) fn rollup_for_hrr(&mut self)

Take the current hash value, and encapsulate it in a ‘handshake_hash’ handshake message. Start this hash again, with that message at the front.

pub(crate) fn current_hash(&self) -> Output

Get the current hash value.

pub(crate) fn take_handshake_buf(&mut self) -> Option<Vec<u8>>

Takes this object’s buffer containing all handshake messages so far. This method only works once; it resets the buffer to empty.

pub(crate) fn algorithm(&self) -> HashAlgorithm

The hashing algorithm

Trait Implementations

impl Clone for HandshakeHash

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.