mirror of
https://github.com/jamesstringer90/appsandbox.git
synced 2026-10-22 02:52:49 -05:00
James Stringer
0d4897dd6b
Run Windows 11 ARM64 guests on macOS over QEMU+HVF, with an ivshmem shared-memory transport carrying every guest channel (agent control, display/VDD, input, audio, clipboard, SSH, 9P) - no guest networking required. - tools/transport: one guest transport API, two backends (PC AF_HYPERV, Mac ivshmem); SPSC ring with an acquire-barrier fix for SSH integrity - tools/ivshmem: our own KMDF ivshmem BAR-mapping driver (no third party) - src/backend_mac: Mac-host ivshmem transport, QEMU VM lifecycle, IDD display consumer, agent/SSH proxies, ISO->disk patcher, Windows create - tools/agent + channel EXEs + tools/vdd: wired to asb_transport - tools/agent_win: staged guest payload (interim, pending JIT pull) - vendor/qemu-ivshmem: vendored QEMU 11.0.1 fork (ivshmem-plain) + LGPL source mirror for the self-contained app bundle - tools/sign/make-release.ps1: use the host-native ARM64 MSBuild so the WDK driver ApiValidator runs (the x86 validator fails on ARM64)
69 lines
2.5 KiB
C
69 lines
2.5 KiB
C
/* sha1.c -- RFC 3174 SHA-1. See sha1.h. */
|
|
|
|
#include "sha1.h"
|
|
#include <string.h>
|
|
|
|
static uint32_t rol(uint32_t v, int b) { return (v << b) | (v >> (32 - b)); }
|
|
|
|
static void sha1_block(sha1_ctx *c, const uint8_t *p) {
|
|
uint32_t w[80];
|
|
for (int i = 0; i < 16; i++)
|
|
w[i] = ((uint32_t)p[i*4] << 24) | ((uint32_t)p[i*4+1] << 16) |
|
|
((uint32_t)p[i*4+2] << 8) | p[i*4+3];
|
|
for (int i = 16; i < 80; i++)
|
|
w[i] = rol(w[i-3] ^ w[i-8] ^ w[i-14] ^ w[i-16], 1);
|
|
|
|
uint32_t a = c->h[0], b = c->h[1], d = c->h[2], e = c->h[3], f = c->h[4];
|
|
for (int i = 0; i < 80; i++) {
|
|
uint32_t k, t;
|
|
if (i < 20) { t = (b & d) | (~b & e); k = 0x5A827999; }
|
|
else if (i < 40) { t = b ^ d ^ e; k = 0x6ED9EBA1; }
|
|
else if (i < 60) { t = (b & d) | (b & e) | (d & e); k = 0x8F1BBCDC; }
|
|
else { t = b ^ d ^ e; k = 0xCA62C1D6; }
|
|
uint32_t tmp = rol(a, 5) + t + f + k + w[i];
|
|
f = e; e = d; d = rol(b, 30); b = a; a = tmp;
|
|
}
|
|
c->h[0] += a; c->h[1] += b; c->h[2] += d; c->h[3] += e; c->h[4] += f;
|
|
}
|
|
|
|
void sha1_init(sha1_ctx *c) {
|
|
c->h[0] = 0x67452301; c->h[1] = 0xEFCDAB89; c->h[2] = 0x98BADCFE;
|
|
c->h[3] = 0x10325476; c->h[4] = 0xC3D2E1F0;
|
|
c->total = 0; c->buflen = 0;
|
|
}
|
|
|
|
void sha1_update(sha1_ctx *c, const void *data, size_t len) {
|
|
const uint8_t *p = data;
|
|
c->total += len;
|
|
if (c->buflen) {
|
|
size_t need = 64 - c->buflen;
|
|
size_t take = len < need ? len : need;
|
|
memcpy(c->buf + c->buflen, p, take);
|
|
c->buflen += take; p += take; len -= take;
|
|
if (c->buflen == 64) { sha1_block(c, c->buf); c->buflen = 0; }
|
|
}
|
|
while (len >= 64) { sha1_block(c, p); p += 64; len -= 64; }
|
|
if (len) { memcpy(c->buf, p, len); c->buflen = len; }
|
|
}
|
|
|
|
void sha1_final(sha1_ctx *c, uint8_t out[20]) {
|
|
uint64_t bits = c->total * 8;
|
|
uint8_t pad = 0x80;
|
|
sha1_update(c, &pad, 1);
|
|
uint8_t z = 0;
|
|
while (c->buflen != 56) sha1_update(c, &z, 1);
|
|
uint8_t lenbe[8];
|
|
for (int i = 0; i < 8; i++) lenbe[i] = (uint8_t)(bits >> (56 - 8*i));
|
|
sha1_update(c, lenbe, 8); /* triggers the final block */
|
|
for (int i = 0; i < 5; i++) {
|
|
out[i*4] = (uint8_t)(c->h[i] >> 24);
|
|
out[i*4+1] = (uint8_t)(c->h[i] >> 16);
|
|
out[i*4+2] = (uint8_t)(c->h[i] >> 8);
|
|
out[i*4+3] = (uint8_t)(c->h[i]);
|
|
}
|
|
}
|
|
|
|
void sha1(const void *data, size_t len, uint8_t out[20]) {
|
|
sha1_ctx c; sha1_init(&c); sha1_update(&c, data, len); sha1_final(&c, out);
|
|
}
|