cosmo-build 10.0.0

Build a Rust crate into a fat Actually Portable Executable from its build.rs — one file that runs on x86-64 and arm64
Documentation
//! SHA-256 (FIPS 180-4), just enough to verify the cosmocc download.
//!
//! This replaces the `sha2` crate. A build-dependency drags its whole dependency
//! graph into every consuming project's lockfile, and `sha2` is exactly the kind of
//! crate a project is likely to pin for its own reasons: the Zcash stack pins a
//! prerelease that no caret requirement can be written to match. Sixty lines of
//! bit-twiddling costs less than being unresolvable in that lockfile.

pub struct Sha256 {
   state: [u32; 8],
   buf: [u8; 64],
   buf_len: usize,
   total_len: u64,
}

const K: [u32; 64] = [
   0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
   0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
   0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
   0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
   0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
   0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
   0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
   0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
];

impl Sha256 {
   pub fn new() -> Self {
      Sha256 {
         state: [
            0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
         ],
         buf: [0; 64],
         buf_len: 0,
         total_len: 0,
      }
   }

   pub fn update(&mut self, mut data: &[u8]) {
      self.total_len += data.len() as u64;
      if self.buf_len > 0 {
         let take = (64 - self.buf_len).min(data.len());
         self.buf[self.buf_len..self.buf_len + take].copy_from_slice(&data[..take]);
         self.buf_len += take;
         data = &data[take..];
         if self.buf_len < 64 {
            return;   // still a partial block; the trailing copy below must not reset it
         }
         let block = self.buf;
         self.compress(&block);
         self.buf_len = 0;
      }
      while data.len() >= 64 {
         let (block, rest) = data.split_at(64);
         self.compress(block.try_into().unwrap());
         data = rest;
      }
      self.buf[..data.len()].copy_from_slice(data);
      self.buf_len = data.len();
   }

   pub fn finalize(mut self) -> [u8; 32] {
      let bits = self.total_len.wrapping_mul(8);
      self.update(&[0x80]);
      while self.buf_len != 56 {
         self.update(&[0]);
      }
      self.update(&bits.to_be_bytes());
      debug_assert_eq!(self.buf_len, 0);
      let mut out = [0u8; 32];
      for (i, w) in self.state.iter().enumerate() {
         out[i * 4..i * 4 + 4].copy_from_slice(&w.to_be_bytes());
      }
      out
   }

   fn compress(&mut self, block: &[u8; 64]) {
      let mut w = [0u32; 64];
      for i in 0..16 {
         w[i] = u32::from_be_bytes([block[i * 4], block[i * 4 + 1], block[i * 4 + 2], block[i * 4 + 3]]);
      }
      for i in 16..64 {
         let s0 = w[i - 15].rotate_right(7) ^ w[i - 15].rotate_right(18) ^ (w[i - 15] >> 3);
         let s1 = w[i - 2].rotate_right(17) ^ w[i - 2].rotate_right(19) ^ (w[i - 2] >> 10);
         w[i] = w[i - 16].wrapping_add(s0).wrapping_add(w[i - 7]).wrapping_add(s1);
      }
      let [mut a, mut b, mut c, mut d, mut e, mut f, mut g, mut h] = self.state;
      for i in 0..64 {
         let s1 = e.rotate_right(6) ^ e.rotate_right(11) ^ e.rotate_right(25);
         let ch = (e & f) ^ (!e & g);
         let t1 = h.wrapping_add(s1).wrapping_add(ch).wrapping_add(K[i]).wrapping_add(w[i]);
         let s0 = a.rotate_right(2) ^ a.rotate_right(13) ^ a.rotate_right(22);
         let maj = (a & b) ^ (a & c) ^ (b & c);
         let t2 = s0.wrapping_add(maj);
         h = g; g = f; f = e; e = d.wrapping_add(t1);
         d = c; c = b; b = a; a = t1.wrapping_add(t2);
      }
      for (s, v) in self.state.iter_mut().zip([a, b, c, d, e, f, g, h]) {
         *s = s.wrapping_add(v);
      }
   }
}

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

   fn hex(b: &[u8]) -> String {
      b.iter().map(|x| format!("{x:02x}")).collect()
   }

   #[test]
   fn known_answers() {
      let h = |s: &[u8]| { let mut d = Sha256::new(); d.update(s); hex(&d.finalize()) };
      assert_eq!(h(b""), "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855");
      assert_eq!(h(b"abc"), "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad");
      // 56 bytes: the padding must spill into a second block.
      assert_eq!(
         h(b"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"),
         "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1"
      );
   }

   #[test]
   fn split_updates_match_one_shot() {
      let data: Vec<u8> = (0..1000u32).map(|i| (i * 7 % 251) as u8).collect();
      let mut one = Sha256::new(); one.update(&data);
      let mut many = Sha256::new();
      for chunk in data.chunks(37) { many.update(chunk); }
      assert_eq!(one.finalize(), many.finalize());
   }
}