z3rs 0.0.5

A pure-Rust port of the Z3 theorem prover, free of third-party and native dependencies
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220

//! Ported from `z3/src/util/hash.{h,cpp}` (Z3 4.17.0, MIT). See NOTICE.
//!
//! Bob Jenkins' hash (lookup2) and the small integer mixers Z3 uses throughout.
//! All arithmetic is `u32`/`u64` wrapping, matching C's unsigned overflow.
//!
//! Note on faithfulness: the 12-byte block reads use native-endian loads and the
//! trailing-byte reads use signed-`char` sign extension, exactly mirroring Z3's
//! `memcpy`/`char const*` behaviour, so on the same platform the hash values are
//! bit-identical to upstream (as in Z3, they are not stable across endianness or
//! `char` signedness).

/// Bob Jenkins' `mix` — reversibly mixes three 32-bit words.
///
/// Laid out one round-triple per line (matching the upstream macro), so it is
/// `rustfmt::skip`ped to keep it diffable against `z3/src/util/hash.h`.
#[rustfmt::skip]
#[inline]
fn mix(mut a: u32, mut b: u32, mut c: u32) -> (u32, u32, u32) {
    a = a.wrapping_sub(b); a = a.wrapping_sub(c); a ^= c >> 13;
    b = b.wrapping_sub(c); b = b.wrapping_sub(a); b ^= a << 8;
    c = c.wrapping_sub(a); c = c.wrapping_sub(b); c ^= b >> 13;
    a = a.wrapping_sub(b); a = a.wrapping_sub(c); a ^= c >> 12;
    b = b.wrapping_sub(c); b = b.wrapping_sub(a); b ^= a << 16;
    c = c.wrapping_sub(a); c = c.wrapping_sub(b); c ^= b >> 5;
    a = a.wrapping_sub(b); a = a.wrapping_sub(c); a ^= c >> 3;
    b = b.wrapping_sub(c); b = b.wrapping_sub(a); b ^= a << 10;
    c = c.wrapping_sub(a); c = c.wrapping_sub(b); c ^= b >> 15;
    (a, b, c)
}

/// Hash a single 32-bit value.
#[inline]
pub fn hash_u(a: u32) -> u32 {
    let a = a.wrapping_add(0x7ed5_5d16).wrapping_add(a << 12);
    let a = (a ^ 0xc761_c23c) ^ (a >> 19);
    let a = a.wrapping_add(0x1656_67b1).wrapping_add(a << 5);
    let a = a.wrapping_add(0xd3a2_646c) ^ (a << 9);
    let a = a.wrapping_add(0xfd70_46c5).wrapping_add(a << 3);
    (a ^ 0xb55a_4f09) ^ (a >> 16)
}

/// Hash a single 64-bit value down to 32 bits.
#[inline]
pub fn hash_ull(mut a: u64) -> u32 {
    a = (!a).wrapping_add(a << 18);
    a ^= a >> 31;
    a = a.wrapping_add((a << 2).wrapping_add(a << 4));
    a ^= a >> 11;
    a = a.wrapping_add(a << 6);
    a ^= a >> 22;
    a as u32
}

/// Combine two hash codes into one (order-sensitive).
#[inline]
pub fn combine_hash(mut h1: u32, mut h2: u32) -> u32 {
    h2 = h2.wrapping_sub(h1);
    h2 ^= h1 << 8;
    h1 = h1.wrapping_sub(h2);
    h2 ^= h1 << 16;
    h2 = h2.wrapping_sub(h1);
    h2 ^= h1 << 10;
    h2
}

/// Hash a pair of 32-bit values.
#[inline]
pub fn hash_u_u(a: u32, b: u32) -> u32 {
    combine_hash(hash_u(a), hash_u(b))
}

/// A tiny FNV-1a hasher implementing [`core::hash::Hasher`]. `core`/`alloc`
/// ship no concrete hasher, so this provides one for hashing arbitrary `Hash`
/// values in `no_std` (e.g. the AST hash-cons table).
pub struct FnvHasher(u64);

impl FnvHasher {
    const OFFSET: u64 = 0xcbf2_9ce4_8422_2325;
    const PRIME: u64 = 0x0000_0100_0000_01b3;

    /// A fresh hasher seeded with the FNV offset basis.
    #[inline]
    pub const fn new() -> FnvHasher {
        FnvHasher(Self::OFFSET)
    }
}

impl Default for FnvHasher {
    #[inline]
    fn default() -> FnvHasher {
        FnvHasher::new()
    }
}

impl core::hash::Hasher for FnvHasher {
    #[inline]
    fn finish(&self) -> u64 {
        self.0
    }
    #[inline]
    fn write(&mut self, bytes: &[u8]) {
        let mut h = self.0;
        for &b in bytes {
            h ^= b as u64;
            h = h.wrapping_mul(Self::PRIME);
        }
        self.0 = h;
    }
}

/// Hash any [`Hash`](core::hash::Hash) value to a 32-bit code via FNV-1a.
pub fn fnv_hash<T: core::hash::Hash>(value: &T) -> u32 {
    use core::hash::Hasher;
    let mut h = FnvHasher::new();
    value.hash(&mut h);
    h.finish() as u32
}

#[inline]
fn read_u32(data: &[u8]) -> u32 {
    // Mirrors Z3's `memcpy(&n, s, 4)`: a native-endian load of 4 bytes.
    u32::from_ne_bytes([data[0], data[1], data[2], data[3]])
}

/// Bob Jenkins' string hash, seeded with `init_value`.
///
/// This is the workhorse hash used for symbols and byte-keyed tables.
pub fn string_hash(data: &[u8], init_value: u32) -> u32 {
    let length = data.len() as u32;
    let mut a = 0x9e37_79b9u32;
    let mut b = 0x9e37_79b9u32;
    let mut c = init_value;

    let mut off = 0usize;
    let mut len = length;
    while len >= 12 {
        a = a.wrapping_add(read_u32(&data[off..]));
        b = b.wrapping_add(read_u32(&data[off + 4..]));
        c = c.wrapping_add(read_u32(&data[off + 8..]));
        (a, b, c) = mix(a, b, c);
        off += 12;
        len -= 12;
    }

    c = c.wrapping_add(length);
    // Trailing 0..=11 bytes; sign-extend each like a signed `char`.
    let sb = |i: usize| data[off + i] as i8 as i32 as u32;
    // Fall-through switch: a length `len` runs every case `<= len`.
    if len >= 11 {
        c = c.wrapping_add(sb(10) << 24);
    }
    if len >= 10 {
        c = c.wrapping_add(sb(9) << 16);
    }
    if len >= 9 {
        c = c.wrapping_add(sb(8) << 8);
    }
    if len >= 8 {
        b = b.wrapping_add(sb(7) << 24);
    }
    if len >= 7 {
        b = b.wrapping_add(sb(6) << 16);
    }
    if len >= 6 {
        b = b.wrapping_add(sb(5) << 8);
    }
    if len >= 5 {
        b = b.wrapping_add(sb(4));
    }
    if len >= 4 {
        a = a.wrapping_add(sb(3) << 24);
    }
    if len >= 3 {
        a = a.wrapping_add(sb(2) << 16);
    }
    if len >= 2 {
        a = a.wrapping_add(sb(1) << 8);
    }
    if len >= 1 {
        a = a.wrapping_add(sb(0));
    }

    (_, _, c) = mix(a, b, c);
    c
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn deterministic_and_seed_sensitive() {
        assert_eq!(string_hash(b"hello", 17), string_hash(b"hello", 17));
        assert_ne!(string_hash(b"hello", 17), string_hash(b"hellp", 17));
        assert_ne!(string_hash(b"hello", 17), string_hash(b"hello", 18));
    }

    #[test]
    fn handles_long_keys_past_the_12_byte_block() {
        // >12 bytes exercises the main loop and the tail.
        let a = string_hash(b"the quick brown fox", 0);
        let b = string_hash(b"the quick brown fox", 0);
        assert_eq!(a, b);
        assert_ne!(a, string_hash(b"the quick brown fex", 0));
    }

    #[test]
    fn empty_key_is_init_dependent() {
        assert_ne!(string_hash(b"", 0), string_hash(b"", 1));
    }

    #[test]
    fn integer_mixers_are_stable() {
        assert_eq!(hash_u(0), hash_u(0));
        assert_ne!(hash_u(1), hash_u(2));
        assert_eq!(hash_u_u(3, 4), combine_hash(hash_u(3), hash_u(4)));
        assert_ne!(hash_u_u(3, 4), hash_u_u(4, 3));
        assert_eq!(hash_ull(0), hash_ull(0));
    }
}