Lines Matching refs:algorithm

36         algorithm: MessageDigest,  in from()
38         let salt = zero_pad_salt(salt, algorithm);  in from()
39         let tree = generate_hash_tree(input, input_size, &salt, block_size, algorithm)?;  in from()
46             hash_one_block(&data, &salt, block_size, algorithm)?.as_ref().to_vec()  in from()
49             hash_one_block(first_block, &salt, block_size, algorithm)?.as_ref().to_vec()  in from()
70     algorithm: MessageDigest,  in generate_hash_tree()
72     let digest_size = algorithm.size();  in generate_hash_tree()
90                 let h = hash_one_block(&a_block, salt, block_size, algorithm)?;  in generate_hash_tree()
104                 let h = hash_one_block(data, salt, block_size, algorithm)?;  in generate_hash_tree()
118     algorithm: MessageDigest,  in hash_one_block()
120     let mut ctx = Hasher::new(algorithm)?;  in hash_one_block()
181 fn zero_pad_salt(salt: &[u8], algorithm: MessageDigest) -> Vec<u8> {  in zero_pad_salt()
185         let padded_len = round_to_multiple(salt.len(), algorithm.block_size());  in zero_pad_salt()