Thanks for using Compiler Explorer
Sponsors
Jakt
C++
Ada
Analysis
Android Java
Android Kotlin
Assembly
C
C3
Carbon
C++ (Circle)
CIRCT
Clean
CMake
CMakeScript
COBOL
C++ for OpenCL
MLIR
Cppx
Cppx-Blue
Cppx-Gold
Cpp2-cppfront
Crystal
C#
CUDA C++
D
Dart
Elixir
Erlang
Fortran
F#
Go
Haskell
HLSL
Hook
Hylo
ispc
Java
Julia
Kotlin
LLVM IR
LLVM MIR
Modula-2
Nim
Objective-C
Objective-C++
OCaml
OpenCL C
Pascal
Pony
Python
Racket
Ruby
Rust
Snowball
Scala
Solidity
Spice
Swift
LLVM TableGen
Toit
TypeScript Native
V
Vala
Visual Basic
WASM
Zig
Javascript
GIMPLE
zig source #1
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Verbose demangling
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
zig 0.10.0
zig 0.11.0
zig 0.12.0
zig 0.12.1
zig 0.13.0
zig 0.2.0
zig 0.3.0
zig 0.4.0
zig 0.5.0
zig 0.6.0
zig 0.7.0
zig 0.7.1
zig 0.8.0
zig 0.9.0
zig trunk
Options
Source code
const std = @import("std"); pub const Wyhash = struct { const secret = [_]u64{ 0xa0761d6478bd642f, 0xe7037ed1a0b428db, 0x8ebc6af09c88c6e3, 0x589965cc75374cc3, }; a: u64, b: u64, state: [3]u64, total_len: usize, buf: [48]u8, buf_len: usize, pub fn init(seed: u64) Wyhash { var self = Wyhash{ .a = undefined, .b = undefined, .state = undefined, .total_len = 0, .buf = undefined, .buf_len = 0, }; self.state[0] = seed ^ mix(seed ^ secret[0], secret[1]); self.state[1] = self.state[0]; self.state[2] = self.state[0]; return self; } // This is subtly different from other hash function update calls. Wyhash requires the last // full 48-byte block to be run through final1 if is exactly aligned to 48-bytes. pub fn update(self: *Wyhash, input: []const u8) void { self.total_len += input.len; if (input.len <= 48 - self.buf_len) { @memcpy(self.buf[self.buf_len..][0..input.len], input); self.buf_len += input.len; return; } var i: usize = 0; if (self.buf_len > 0) { i = 48 - self.buf_len; @memcpy(self.buf[self.buf_len..][0..i], input[0..i]); self.round(&self.buf); self.buf_len = 0; } while (i + 48 < input.len) : (i += 48) { self.round(input[i..][0..48]); } const remaining_bytes = input[i..]; if (remaining_bytes.len < 16 and i >= 48) { const rem = 16 - remaining_bytes.len; @memcpy(self.buf[self.buf.len - rem ..], input[i - rem .. i]); } @memcpy(self.buf[0..remaining_bytes.len], remaining_bytes); self.buf_len = remaining_bytes.len; } pub fn final(self: *Wyhash) u64 { var input: []const u8 = self.buf[0..self.buf_len]; var newSelf = self.shallowCopy(); // ensure idempotency if (self.total_len <= 16) { newSelf.smallKey(input); } else { var offset: usize = 0; if (self.buf_len < 16) { var scratch: [16]u8 = undefined; const rem = 16 - self.buf_len; @memcpy(scratch[0..rem], self.buf[self.buf.len - rem ..][0..rem]); @memcpy(scratch[rem..][0..self.buf_len], self.buf[0..self.buf_len]); // Same as input but with additional bytes preceeding start in case of a short buffer input = &scratch; offset = rem; } newSelf.final0(); newSelf.final1(input, offset); } return newSelf.final2(); } // Copies the core wyhash state but not any internal buffers. inline fn shallowCopy(self: *Wyhash) Wyhash { return .{ .a = self.a, .b = self.b, .state = self.state, .total_len = self.total_len, .buf = undefined, .buf_len = undefined, }; } inline fn smallKey(self: *Wyhash, input: []const u8) void { std.debug.assert(input.len <= 16); if (input.len >= 4) { const end = input.len - 4; const quarter = (input.len >> 3) << 2; self.a = (read(4, input[0..]) << 32) | read(4, input[quarter..]); self.b = (read(4, input[end..]) << 32) | read(4, input[end - quarter ..]); } else if (input.len > 0) { self.a = (@as(u64, input[0]) << 16) | (@as(u64, input[input.len >> 1]) << 8) | input[input.len - 1]; self.b = 0; } else { self.a = 0; self.b = 0; } } inline fn round(self: *Wyhash, input: *const [48]u8) void { inline for (0..3) |i| { const a = read(8, input[8 * (2 * i) ..]); const b = read(8, input[8 * (2 * i + 1) ..]); self.state[i] = mix(a ^ secret[i + 1], b ^ self.state[i]); } } inline fn read(comptime bytes: usize, data: []const u8) u64 { std.debug.assert(bytes <= 8); const T = std.meta.Int(.unsigned, 8 * bytes); return @as(u64, std.mem.readInt(T, data[0..bytes], .little)); } inline fn mum(a: *u64, b: *u64) void { const x = @as(u128, a.*) *% b.*; a.* = @as(u64, @truncate(x)); b.* = @as(u64, @truncate(x >> 64)); } inline fn mix(a_: u64, b_: u64) u64 { var a = a_; var b = b_; mum(&a, &b); return a ^ b; } inline fn final0(self: *Wyhash) void { self.state[0] ^= self.state[1] ^ self.state[2]; } // input_lb must be at least 16-bytes long (in shorter key cases the smallKey function will be // used instead). We use an index into a slice to for comptime processing as opposed to if we // used pointers. inline fn final1(self: *Wyhash, input_lb: []const u8, start_pos: usize) void { std.debug.assert(input_lb.len >= 16); std.debug.assert(input_lb.len - start_pos <= 48); const input = input_lb[start_pos..]; var i: usize = 0; while (i + 16 < input.len) : (i += 16) { self.state[0] = mix(read(8, input[i..]) ^ secret[1], read(8, input[i + 8 ..]) ^ self.state[0]); } self.a = read(8, input_lb[input_lb.len - 16 ..][0..8]); self.b = read(8, input_lb[input_lb.len - 8 ..][0..8]); } inline fn final2(self: *Wyhash) u64 { self.a ^= secret[1]; self.b ^= self.state[0]; mum(&self.a, &self.b); return mix(self.a ^ secret[0] ^ self.total_len, self.b ^ secret[1]); } pub fn hash(seed: u64, input: []const u8) u64 { var self = Wyhash.init(seed); if (input.len <= 16) { self.smallKey(input); } else { var i: usize = 0; if (input.len >= 48) { while (i + 48 < input.len) : (i += 48) { self.round(input[i..][0..48]); } self.final0(); } self.final1(input, i); } self.total_len = input.len; return self.final2(); } }; export fn directHash(seed: u64, input: [*]const u8, len: usize) u64 { return Wyhash.hash(seed, input[0..len]); } export fn iterHash(seed: u64, input: [*]const u8, len: usize) u64 { var s = Wyhash.init(seed); s.update(input[0..len]); return s.final(); }
zig source #2
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Verbose demangling
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
zig 0.10.0
zig 0.11.0
zig 0.12.0
zig 0.12.1
zig 0.13.0
zig 0.2.0
zig 0.3.0
zig 0.4.0
zig 0.5.0
zig 0.6.0
zig 0.7.0
zig 0.7.1
zig 0.8.0
zig 0.9.0
zig trunk
Options
Source code
const std = @import("std"); export fn dotprod(a: *[64]@Vector(4, u32), b: *[64]@Vector(4, u32)) u32 { var res = @as(@Vector(4, u32), @splat(0)); var i: usize = 0; while (i < 64) : (i += 4) { inline for (0..4) |j| { res += a[i+j] * b[i+j]; } } return @reduce(.Add, res); }
Become a Patron
Sponsor on GitHub
Donate via PayPal
Source on GitHub
Mailing list
Installed libraries
Wiki
Report an issue
How it works
Contact the author
CE on Mastodon
About the author
Statistics
Changelog
Version tree