mirror of
https://github.com/Ed94/Odin.git
synced 2026-07-13 14:51:26 -07:00
2357293e05
Just (ab)using reflect to victory is probably fine.
121 lines
2.9 KiB
Odin
121 lines
2.9 KiB
Odin
package crypto_hash
|
|
|
|
/*
|
|
Copyright 2021 zhibog
|
|
Made available under the BSD-3 license.
|
|
|
|
List of contributors:
|
|
zhibog, dotbmp: Initial implementation.
|
|
*/
|
|
|
|
import "core:io"
|
|
import "core:mem"
|
|
import "core:os"
|
|
|
|
// hash_bytes will hash the given input and return the computed digest
|
|
// in a newly allocated slice.
|
|
hash_string :: proc(algorithm: Algorithm, data: string, allocator := context.allocator) -> []byte {
|
|
return hash_bytes(algorithm, transmute([]byte)(data), allocator)
|
|
}
|
|
|
|
// hash_bytes will hash the given input and return the computed digest
|
|
// in a newly allocated slice.
|
|
hash_bytes :: proc(algorithm: Algorithm, data: []byte, allocator := context.allocator) -> []byte {
|
|
dst := make([]byte, DIGEST_SIZES[algorithm], allocator)
|
|
hash_bytes_to_buffer(algorithm, data, dst)
|
|
return dst
|
|
}
|
|
|
|
// hash_string_to_buffer will hash the given input and assign the
|
|
// computed digest to the third parameter. It requires that the
|
|
// destination buffer is at least as big as the digest size.
|
|
hash_string_to_buffer :: proc(algorithm: Algorithm, data: string, hash: []byte) {
|
|
hash_bytes_to_buffer(algorithm, transmute([]byte)(data), hash)
|
|
}
|
|
|
|
// hash_bytes_to_buffer will hash the given input and write the
|
|
// computed digest into the third parameter. It requires that the
|
|
// destination buffer is at least as big as the digest size.
|
|
hash_bytes_to_buffer :: proc(algorithm: Algorithm, data, hash: []byte) {
|
|
ctx: Context
|
|
|
|
init(&ctx, algorithm)
|
|
update(&ctx, data)
|
|
final(&ctx, hash)
|
|
}
|
|
|
|
// hash_stream will incrementally fully consume a stream, and return the
|
|
// computed digest in a newly allocated slice.
|
|
hash_stream :: proc(
|
|
algorithm: Algorithm,
|
|
s: io.Stream,
|
|
allocator := context.allocator,
|
|
) -> (
|
|
[]byte,
|
|
io.Error,
|
|
) {
|
|
ctx: Context
|
|
|
|
init(&ctx, algorithm)
|
|
|
|
buffer_size := block_size(&ctx) * 4
|
|
buf := make([]byte, buffer_size, context.temp_allocator)
|
|
defer {
|
|
mem.zero_explicit(raw_data(buf), buffer_size)
|
|
delete(buf, context.temp_allocator)
|
|
}
|
|
|
|
loop: for {
|
|
n, err := io.read(s, buf)
|
|
if n > 0 {
|
|
// XXX/yawning: Can io.read return n > 0 and EOF?
|
|
update(&ctx, buf[:n])
|
|
}
|
|
#partial switch err {
|
|
case .None:
|
|
case .EOF:
|
|
break loop
|
|
case:
|
|
return nil, err
|
|
}
|
|
}
|
|
|
|
dst := make([]byte, DIGEST_SIZES[algorithm], allocator)
|
|
final(&ctx, dst)
|
|
|
|
return dst, io.Error.None
|
|
}
|
|
|
|
// hash_file will read the file provided by the given handle and return the
|
|
// computed digest in a newly allocated slice.
|
|
hash_file :: proc(
|
|
algorithm: Algorithm,
|
|
hd: os.Handle,
|
|
load_at_once := false,
|
|
allocator := context.allocator,
|
|
) -> (
|
|
[]byte,
|
|
io.Error,
|
|
) {
|
|
if !load_at_once {
|
|
return hash_stream(algorithm, os.stream_from_handle(hd), allocator)
|
|
}
|
|
|
|
buf, ok := os.read_entire_file(hd, allocator)
|
|
if !ok {
|
|
return nil, io.Error.Unknown
|
|
}
|
|
defer delete(buf, allocator)
|
|
|
|
return hash_bytes(algorithm, buf, allocator), io.Error.None
|
|
}
|
|
|
|
hash :: proc {
|
|
hash_stream,
|
|
hash_file,
|
|
hash_bytes,
|
|
hash_string,
|
|
hash_bytes_to_buffer,
|
|
hash_string_to_buffer,
|
|
}
|