ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-06 15:48:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove unneeded semicolons from the core library

Browse Source
This commit is contained in:
gingerBill
2021-08-31 22:21:13 +01:00
parent b176af2742
commit 251da264ed
187 changed files with 27227 additions and 27227 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/hash/hash.odin
+151 -151
View File
@@ -6,266 +6,266 @@ import "core:intrinsics"
@(optimization_mode="speed")
adler32 :: proc(data: []byte, seed := u32(1)) -> u32 #no_bounds_check {
ADLER_CONST :: 65521;
ADLER_CONST :: 65521
buffer := raw_data(data);
a, b: u64 = u64(seed) & 0xFFFF, u64(seed) >> 16;
buf := data[:];
buffer := raw_data(data)
a, b: u64 = u64(seed) & 0xFFFF, u64(seed) >> 16
buf := data[:]
for len(buf) != 0 && uintptr(buffer) & 7 != 0 {
a = (a + u64(buf[0]));
b = (b + a);
buffer = intrinsics.ptr_offset(buffer, 1);
buf = buf[1:];
a = (a + u64(buf[0]))
b = (b + a)
buffer = intrinsics.ptr_offset(buffer, 1)
buf = buf[1:]
}
for len(buf) > 7 {
count := min(len(buf), 5552);
count := min(len(buf), 5552)
for count > 7 {
a += u64(buf[0]); b += a;
a += u64(buf[1]); b += a;
a += u64(buf[2]); b += a;
a += u64(buf[3]); b += a;
a += u64(buf[4]); b += a;
a += u64(buf[5]); b += a;
a += u64(buf[6]); b += a;
a += u64(buf[7]); b += a;
a += u64(buf[0]); b += a
a += u64(buf[1]); b += a
a += u64(buf[2]); b += a
a += u64(buf[3]); b += a
a += u64(buf[4]); b += a
a += u64(buf[5]); b += a
a += u64(buf[6]); b += a
a += u64(buf[7]); b += a
buf = buf[8:];
count -= 8;
buf = buf[8:]
count -= 8
}
a %= ADLER_CONST;
b %= ADLER_CONST;
a %= ADLER_CONST
b %= ADLER_CONST
}
for len(buf) != 0 {
a = (a + u64(buf[0])) % ADLER_CONST;
b = (b + a) % ADLER_CONST;
buf = buf[1:];
a = (a + u64(buf[0])) % ADLER_CONST
b = (b + a) % ADLER_CONST
buf = buf[1:]
}
return (u32(b) << 16) | u32(a);
return (u32(b) << 16) | u32(a)
}
@(optimization_mode="speed")
djb2 :: proc(data: []byte) -> u32 {
hash: u32 = 5381;
hash: u32 = 5381
for b in data {
hash = (hash << 5) + hash + u32(b); // hash * 33 + u32(b)
hash = (hash << 5) + hash + u32(b) // hash * 33 + u32(b)
}
return hash;
return hash
}
@(optimization_mode="speed")
fnv32 :: proc(data: []byte) -> u32 {
h: u32 = 0x811c9dc5;
h: u32 = 0x811c9dc5
for b in data {
h = (h * 0x01000193) ~ u32(b);
h = (h * 0x01000193) ~ u32(b)
}
return h;
return h
}
@(optimization_mode="speed")
fnv64 :: proc(data: []byte) -> u64 {
h: u64 = 0xcbf29ce484222325;
h: u64 = 0xcbf29ce484222325
for b in data {
h = (h * 0x100000001b3) ~ u64(b);
h = (h * 0x100000001b3) ~ u64(b)
}
return h;
return h
}
@(optimization_mode="speed")
fnv32a :: proc(data: []byte) -> u32 {
h: u32 = 0x811c9dc5;
h: u32 = 0x811c9dc5
for b in data {
h = (h ~ u32(b)) * 0x01000193;
h = (h ~ u32(b)) * 0x01000193
}
return h;
return h
}
@(optimization_mode="speed")
fnv64a :: proc(data: []byte) -> u64 {
h: u64 = 0xcbf29ce484222325;
h: u64 = 0xcbf29ce484222325
for b in data {
h = (h ~ u64(b)) * 0x100000001b3;
h = (h ~ u64(b)) * 0x100000001b3
}
return h;
return h
}
@(optimization_mode="speed")
jenkins :: proc(data: []byte) -> u32 {
hash: u32 = 0;
hash: u32 = 0
for b in data {
hash += u32(b);
hash += hash << 10;
hash ~= hash >> 6;
hash += u32(b)
hash += hash << 10
hash ~= hash >> 6
}
hash += hash << 3;
hash ~= hash >> 11;
hash += hash << 15;
return hash;
hash += hash << 3
hash ~= hash >> 11
hash += hash << 15
return hash
}
@(optimization_mode="speed")
murmur32 :: proc(data: []byte) -> u32 {
c1_32: u32 : 0xcc9e2d51;
c2_32: u32 : 0x1b873593;
c1_32: u32 : 0xcc9e2d51
c2_32: u32 : 0x1b873593
h1: u32 = 0;
nblocks := len(data)/4;
p := raw_data(data);
p1 := mem.ptr_offset(p, 4*nblocks);
h1: u32 = 0
nblocks := len(data)/4
p := raw_data(data)
p1 := mem.ptr_offset(p, 4*nblocks)
for ; p < p1; p = mem.ptr_offset(p, 4) {
k1 := (cast(^u32)p)^;
k1 := (cast(^u32)p)^
k1 *= c1_32;
k1 = (k1 << 15) | (k1 >> 17);
k1 *= c2_32;
k1 *= c1_32
k1 = (k1 << 15) | (k1 >> 17)
k1 *= c2_32
h1 ~= k1;
h1 = (h1 << 13) | (h1 >> 19);
h1 = h1*5 + 0xe6546b64;
h1 ~= k1
h1 = (h1 << 13) | (h1 >> 19)
h1 = h1*5 + 0xe6546b64
}
tail := data[nblocks*4:];
k1: u32;
tail := data[nblocks*4:]
k1: u32
switch len(tail)&3 {
case 3:
k1 ~= u32(tail[2]) << 16;
fallthrough;
k1 ~= u32(tail[2]) << 16
fallthrough
case 2:
k1 ~= u32(tail[2]) << 8;
fallthrough;
k1 ~= u32(tail[2]) << 8
fallthrough
case 1:
k1 ~= u32(tail[0]);
k1 *= c1_32;
k1 = (k1 << 15) | (k1 >> 17) ;
k1 *= c2_32;
h1 ~= k1;
k1 ~= u32(tail[0])
k1 *= c1_32
k1 = (k1 << 15) | (k1 >> 17)
k1 *= c2_32
h1 ~= k1
}
h1 ~= u32(len(data));
h1 ~= u32(len(data))
h1 ~= h1 >> 16;
h1 *= 0x85ebca6b;
h1 ~= h1 >> 13;
h1 *= 0xc2b2ae35;
h1 ~= h1 >> 16;
h1 ~= h1 >> 16
h1 *= 0x85ebca6b
h1 ~= h1 >> 13
h1 *= 0xc2b2ae35
h1 ~= h1 >> 16
return h1;
return h1
}
@(optimization_mode="speed")
murmur64 :: proc(data: []byte) -> u64 {
SEED :: 0x9747b28c;
SEED :: 0x9747b28c
when size_of(int) == 8 {
m :: 0xc6a4a7935bd1e995;
r :: 47;
m :: 0xc6a4a7935bd1e995
r :: 47
h: u64 = SEED ~ (u64(len(data)) * m);
data64 := mem.slice_ptr(cast(^u64)raw_data(data), len(data)/size_of(u64));
h: u64 = SEED ~ (u64(len(data)) * m)
data64 := mem.slice_ptr(cast(^u64)raw_data(data), len(data)/size_of(u64))
for _, i in data64 {
k := data64[i];
k := data64[i]
k *= m;
k ~= k>>r;
k *= m;
k *= m
k ~= k>>r
k *= m
h ~= k;
h *= m;
h ~= k
h *= m
}
switch len(data)&7 {
case 7: h ~= u64(data[6]) << 48; fallthrough;
case 6: h ~= u64(data[5]) << 40; fallthrough;
case 5: h ~= u64(data[4]) << 32; fallthrough;
case 4: h ~= u64(data[3]) << 24; fallthrough;
case 3: h ~= u64(data[2]) << 16; fallthrough;
case 2: h ~= u64(data[1]) << 8; fallthrough;
case 7: h ~= u64(data[6]) << 48; fallthrough
case 6: h ~= u64(data[5]) << 40; fallthrough
case 5: h ~= u64(data[4]) << 32; fallthrough
case 4: h ~= u64(data[3]) << 24; fallthrough
case 3: h ~= u64(data[2]) << 16; fallthrough
case 2: h ~= u64(data[1]) << 8; fallthrough
case 1:
h ~= u64(data[0]);
h *= m;
h ~= u64(data[0])
h *= m
}
h ~= h>>r;
h *= m;
h ~= h>>r;
h ~= h>>r
h *= m
h ~= h>>r
return h;
return h
} else {
m :: 0x5bd1e995;
r :: 24;
m :: 0x5bd1e995
r :: 24
h1 := u32(SEED) ~ u32(len(data));
h2 := u32(SEED) >> 32;
data32 := mem.slice_ptr(cast(^u32)raw_data(data), len(data)/size_of(u32));
len := len(data);
i := 0;
h1 := u32(SEED) ~ u32(len(data))
h2 := u32(SEED) >> 32
data32 := mem.slice_ptr(cast(^u32)raw_data(data), len(data)/size_of(u32))
len := len(data)
i := 0
for len >= 8 {
k1, k2: u32;
k1 = data32[i]; i += 1;
k1 *= m;
k1 ~= k1>>r;
k1 *= m;
h1 *= m;
h1 ~= k1;
len -= 4;
k1, k2: u32
k1 = data32[i]; i += 1
k1 *= m
k1 ~= k1>>r
k1 *= m
h1 *= m
h1 ~= k1
len -= 4
k2 = data32[i]; i += 1;
k2 *= m;
k2 ~= k2>>r;
k2 *= m;
h2 *= m;
h2 ~= k2;
len -= 4;
k2 = data32[i]; i += 1
k2 *= m
k2 ~= k2>>r
k2 *= m
h2 *= m
h2 ~= k2
len -= 4
}
if len >= 4 {
k1: u32;
k1 = data32[i]; i += 1;
k1 *= m;
k1 ~= k1>>r;
k1 *= m;
h1 *= m;
h1 ~= k1;
len -= 4;
k1: u32
k1 = data32[i]; i += 1
k1 *= m
k1 ~= k1>>r
k1 *= m
h1 *= m
h1 ~= k1
len -= 4
}
// TODO(bill): Fix this
#no_bounds_check data8 := mem.slice_to_bytes(data32[i:])[:3];
#no_bounds_check data8 := mem.slice_to_bytes(data32[i:])[:3]
switch len {
case 3:
h2 ~= u32(data8[2]) << 16;
fallthrough;
h2 ~= u32(data8[2]) << 16
fallthrough
case 2:
h2 ~= u32(data8[1]) << 8;
fallthrough;
h2 ~= u32(data8[1]) << 8
fallthrough
case 1:
h2 ~= u32(data8[0]);
h2 *= m;
h2 ~= u32(data8[0])
h2 *= m
}
h1 ~= h2>>18;
h1 *= m;
h2 ~= h1>>22;
h2 *= m;
h1 ~= h2>>17;
h1 *= m;
h2 ~= h1>>19;
h2 *= m;
h1 ~= h2>>18
h1 *= m
h2 ~= h1>>22
h2 *= m
h1 ~= h2>>17
h1 *= m
h2 ~= h1>>19
h2 *= m
return u64(h1)<<32 | u64(h2);
return u64(h1)<<32 | u64(h2)
}
}
@(optimization_mode="speed")
sdbm :: proc(data: []byte) -> u32 {
hash: u32 = 0;
hash: u32 = 0
for b in data {
hash = u32(b) + (hash<<6) + (hash<<16) - hash;
hash = u32(b) + (hash<<6) + (hash<<16) - hash
}
return hash;
return hash
}