Initial commit: SUB-OS 64-Bit Production Monolithic Operating System with LazyBox userland suite

This commit is contained in:
subhobhai943 committed 2026-08-16 21:23:52 +05:30
commit cd9c786d14
88 files changed
+7132

No files matched your search

+35
View File
@@ -0,0 +1,35 @@
#include <crypto/crypto.h>
static uint32_t crc32_table[256];
static bool table_computed = false;
static void make_crc32_table(void) {
uint32_t c;
for (uint32_t n = 0; n < 256; n++) {
c = n;
for (int k = 0; k < 8; k++) {
if (c & 1) {
c = 0xEDB88320L ^ (c >> 1);
} else {
c = c >> 1;
}
}
crc32_table[n] = c;
}
table_computed = true;
}
uint32_t crc32(uint32_t crc, const void* buf, size_t size) {
if (!table_computed) {
make_crc32_table();
}
const uint8_t* p = (const uint8_t*)buf;
crc = crc ^ 0xFFFFFFFF;
while (size--) {
crc = crc32_table[(crc ^ *p++) & 0xFF] ^ (crc >> 8);
}
return crc ^ 0xFFFFFFFF;
}
+186
View File
@@ -0,0 +1,186 @@
#include <crypto/crypto.h>
#include <lib/string.h>
#include <lib/printf.h>
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
#define FF(a, b, c, d, x, s, ac) { \
(a) += F((b), (c), (d)) + (x) + (uint32_t)(ac); \
(a) = ROTATE_LEFT((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) { \
(a) += G((b), (c), (d)) + (x) + (uint32_t)(ac); \
(a) = ROTATE_LEFT((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) { \
(a) += H((b), (c), (d)) + (x) + (uint32_t)(ac); \
(a) = ROTATE_LEFT((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) { \
(a) += I((b), (c), (d)) + (x) + (uint32_t)(ac); \
(a) = ROTATE_LEFT((a), (s)); \
(a) += (b); \
}
static void md5_transform(uint32_t state[4], const uint8_t block[64]) {
uint32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
for (int i = 0, j = 0; j < 64; i++, j += 4) {
x[i] = ((uint32_t)block[j]) | (((uint32_t)block[j + 1]) << 8) |
(((uint32_t)block[j + 2]) << 16) | (((uint32_t)block[j + 3]) << 24);
}
// Round 1
FF(a, b, c, d, x[0], 7, 0xd76aa478);
FF(d, a, b, c, x[1], 12, 0xe8c7b756);
FF(c, d, a, b, x[2], 17, 0x242070db);
FF(b, c, d, a, x[3], 22, 0xc1bdceee);
FF(a, b, c, d, x[4], 7, 0xf57c0faf);
FF(d, a, b, c, x[5], 12, 0x4787c62a);
FF(c, d, a, b, x[6], 17, 0xa8304613);
FF(b, c, d, a, x[7], 22, 0xfd469501);
FF(a, b, c, d, x[8], 7, 0x698098d8);
FF(d, a, b, c, x[9], 12, 0x8b44f7af);
FF(c, d, a, b, x[10], 17, 0xffff5bb1);
FF(b, c, d, a, x[11], 22, 0x895cd7be);
FF(a, b, c, d, x[12], 7, 0x6b901122);
FF(d, a, b, c, x[13], 12, 0xfd987193);
FF(c, d, a, b, x[14], 17, 0xa679438e);
FF(b, c, d, a, x[15], 22, 0x49b40821);
// Round 2
GG(a, b, c, d, x[1], 5, 0xf61e2562);
GG(d, a, b, c, x[6], 9, 0xc040b340);
GG(c, d, a, b, x[11], 14, 0x265e5a51);
GG(b, c, d, a, x[0], 20, 0xe9b6c7aa);
GG(a, b, c, d, x[5], 5, 0xd62f105d);
GG(d, a, b, c, x[10], 9, 0x02441453);
GG(c, d, a, b, x[15], 14, 0xd8a1e681);
GG(b, c, d, a, x[4], 20, 0xe7d3fbc8);
GG(a, b, c, d, x[9], 5, 0x21e1cde6);
GG(d, a, b, c, x[14], 9, 0xc33707d6);
GG(c, d, a, b, x[3], 14, 0xf4d50d87);
GG(b, c, d, a, x[8], 20, 0x455a14ed);
GG(a, b, c, d, x[13], 5, 0xa9e3e905);
GG(d, a, b, c, x[2], 9, 0xfcefa3f8);
GG(c, d, a, b, x[7], 14, 0x676f02d9);
GG(b, c, d, a, x[12], 20, 0x8d2a4c8a);
// Round 3
HH(a, b, c, d, x[5], 4, 0xfffa3942);
HH(d, a, b, c, x[8], 11, 0x8771f681);
HH(c, d, a, b, x[11], 16, 0x6d9d6122);
HH(b, c, d, a, x[14], 23, 0xfde5380c);
HH(a, b, c, d, x[1], 4, 0xa4beea44);
HH(d, a, b, c, x[4], 11, 0x4bdecfa9);
HH(c, d, a, b, x[7], 16, 0xf6bb4b60);
HH(b, c, d, a, x[10], 23, 0xbebfbc70);
HH(a, b, c, d, x[13], 4, 0x289b7ec6);
HH(d, a, b, c, x[0], 11, 0xeaa127fa);
HH(c, d, a, b, x[3], 16, 0xd4ef3085);
HH(b, c, d, a, x[6], 23, 0x04881d05);
HH(a, b, c, d, x[9], 4, 0xd9d4d039);
HH(d, a, b, c, x[12], 11, 0xe6db99e5);
HH(c, d, a, b, x[15], 16, 0x1fa27cf8);
HH(b, c, d, a, x[2], 23, 0xc4ac5665);
// Round 4
II(a, b, c, d, x[0], 6, 0xf4292244);
II(d, a, b, c, x[7], 10, 0x432aff97);
II(c, d, a, b, x[14], 15, 0xab9423a7);
II(b, c, d, a, x[5], 21, 0xfc93a039);
II(a, b, c, d, x[12], 6, 0x655b59c3);
II(d, a, b, c, x[3], 10, 0x8f0ccc92);
II(c, d, a, b, x[10], 15, 0xffeff47d);
II(b, c, d, a, x[1], 21, 0x85845dd1);
II(a, b, c, d, x[8], 6, 0x6fa87e4f);
II(d, a, b, c, x[15], 10, 0xfe2ce6e0);
II(c, d, a, b, x[6], 15, 0xa3014314);
II(b, c, d, a, x[13], 21, 0x4e0811a1);
II(a, b, c, d, x[4], 6, 0xf7537e82);
II(d, a, b, c, x[11], 10, 0xbd3af235);
II(c, d, a, b, x[2], 15, 0x2ad7d2bb);
II(b, c, d, a, x[9], 21, 0xeb86d391);
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
}
void md5_init(md5_ctx_t* ctx) {
ctx->count[0] = ctx->count[1] = 0;
ctx->state[0] = 0x67452301;
ctx->state[1] = 0xefcdab89;
ctx->state[2] = 0x98badcfe;
ctx->state[3] = 0x10325476;
}
void md5_update(md5_ctx_t* ctx, const void* input, size_t input_len) {
uint32_t i, index, part_len;
const uint8_t* buf = (const uint8_t*)input;
index = (uint32_t)((ctx->count[0] >> 3) & 0x3F);
if ((ctx->count[0] += ((uint32_t)input_len << 3)) < ((uint32_t)input_len << 3)) {
ctx->count[1]++;
}
ctx->count[1] += ((uint32_t)input_len >> 29);
part_len = 64 - index;
if (input_len >= part_len) {
memcpy(&ctx->buffer[index], buf, part_len);
md5_transform(ctx->state, ctx->buffer);
for (i = part_len; i + 63 < input_len; i += 64) {
md5_transform(ctx->state, &buf[i]);
}
index = 0;
} else {
i = 0;
}
memcpy(&ctx->buffer[index], &buf[i], input_len - i);
}
void md5_final(uint8_t digest[16], md5_ctx_t* ctx) {
static const uint8_t PADDING[64] = { 0x80 };
uint8_t bits[8];
uint32_t index, pad_len;
for (int i = 0; i < 4; i++) {
bits[i] = (uint8_t)((ctx->count[0] >> (i * 8)) & 0xFF);
bits[i + 4] = (uint8_t)((ctx->count[1] >> (i * 8)) & 0xFF);
}
index = (uint32_t)((ctx->count[0] >> 3) & 0x3F);
pad_len = (index < 56) ? (56 - index) : (120 - index);
md5_update(ctx, PADDING, pad_len);
md5_update(ctx, bits, 8);
for (int i = 0; i < 4; i++) {
digest[i] = (uint8_t)((ctx->state[0] >> (i * 8)) & 0xFF);
digest[i + 4] = (uint8_t)((ctx->state[1] >> (i * 8)) & 0xFF);
digest[i + 8] = (uint8_t)((ctx->state[2] >> (i * 8)) & 0xFF);
digest[i + 12] = (uint8_t)((ctx->state[3] >> (i * 8)) & 0xFF);
}
}
void md5_string(const char* str, char output[33]) {
md5_ctx_t ctx;
uint8_t digest[16];
md5_init(&ctx);
md5_update(&ctx, str, strlen(str));
md5_final(digest, &ctx);
for (int i = 0; i < 16; i++) {
sprintf(output + i * 2, "%02x", digest[i]);
}
output[32] = '\0';
}
+43
View File
@@ -0,0 +1,43 @@
#include <crypto/crypto.h>
#include <arch/x86_64/pit.h>
static uint64_t prng_s[2] = { 0x8a5cd789635d2dffULL, 0x121fd2155c472f96ULL };
void prng_seed(uint64_t seed1, uint64_t seed2) {
if (seed1 == 0 && seed2 == 0) {
seed1 = 0x8a5cd789635d2dffULL ^ pit_get_ticks();
seed2 = 0x121fd2155c472f96ULL ^ (pit_get_ticks() << 32);
}
prng_s[0] = seed1;
prng_s[1] = seed2;
}
uint64_t prng_rand64(void) {
uint64_t s1 = prng_s[0];
const uint64_t s0 = prng_s[1];
prng_s[0] = s0;
s1 ^= s1 << 23;
prng_s[1] = s1 ^ s0 ^ (s1 >> 17) ^ (s0 >> 26);
return prng_s[1] + s0;
}
uint32_t prng_rand32(void) {
return (uint32_t)(prng_rand64() & 0xFFFFFFFF);
}
void prng_get_bytes(void* buf, size_t len) {
uint8_t* p = (uint8_t*)buf;
while (len >= 8) {
uint64_t r = prng_rand64();
*(uint64_t*)p = r;
p += 8;
len -= 8;
}
if (len > 0) {
uint64_t r = prng_rand64();
uint8_t* r_bytes = (uint8_t*)&r;
for (size_t i = 0; i < len; i++) {
p[i] = r_bytes[i];
}
}
}
+141
View File
@@ -0,0 +1,141 @@
#include <crypto/crypto.h>
#include <lib/string.h>
#include <lib/printf.h>
#define DBL_INT_ADD(a, b, c) if ((a) > 0xFFFFFFFF - (c)) ++(b); (a) += (c);
#define ROTRIGHT(a, b) (((a) >> (b)) | ((a) << (32 - (b))))
#define CH(x, y, z) (((x) & (y)) ^ (~(x) & (z)))
#define MAJ(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
#define EP0(x) (ROTRIGHT(x, 2) ^ ROTRIGHT(x, 13) ^ ROTRIGHT(x, 22))
#define EP1(x) (ROTRIGHT(x, 6) ^ ROTRIGHT(x, 11) ^ ROTRIGHT(x, 25))
#define SIG0(x) (ROTRIGHT(x, 7) ^ ROTRIGHT(x, 18) ^ ((x) >> 3))
#define SIG1(x) (ROTRIGHT(x, 17) ^ ROTRIGHT(x, 19) ^ ((x) >> 10))
static const uint32_t k[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
};
static void sha256_transform(sha256_ctx_t* ctx, const uint8_t data[]) {
uint32_t a, b, c, d, e, f, g, h, i, j, t1, t2, m[64];
for (i = 0, j = 0; i < 16; ++i, j += 4)
m[i] = (data[j] << 24) | (data[j + 1] << 16) | (data[j + 2] << 8) | (data[j + 3]);
for (; i < 64; ++i)
m[i] = SIG1(m[i - 2]) + m[i - 7] + SIG0(m[i - 15]) + m[i - 16];
a = ctx->state[0];
b = ctx->state[1];
c = ctx->state[2];
d = ctx->state[3];
e = ctx->state[4];
f = ctx->state[5];
g = ctx->state[6];
h = ctx->state[7];
for (i = 0; i < 64; ++i) {
t1 = h + EP1(e) + CH(e, f, g) + k[i] + m[i];
t2 = EP0(a) + MAJ(a, b, c);
h = g;
g = f;
f = e;
e = d + t1;
d = c;
c = b;
b = a;
a = t1 + t2;
}
ctx->state[0] += a;
ctx->state[1] += b;
ctx->state[2] += c;
ctx->state[3] += d;
ctx->state[4] += e;
ctx->state[5] += f;
ctx->state[6] += g;
ctx->state[7] += h;
}
void sha256_init(sha256_ctx_t* ctx) {
ctx->datalen = 0;
ctx->bitlen = 0;
ctx->state[0] = 0x6a09e667;
ctx->state[1] = 0xbb67ae85;
ctx->state[2] = 0x3c6ef372;
ctx->state[3] = 0xa54ff53a;
ctx->state[4] = 0x510e527f;
ctx->state[5] = 0x9b05688c;
ctx->state[6] = 0x1f83d9ab;
ctx->state[7] = 0x5be0cd19;
}
void sha256_update(sha256_ctx_t* ctx, const void* data, size_t len) {
const uint8_t* p = (const uint8_t*)data;
for (size_t i = 0; i < len; ++i) {
ctx->buffer[ctx->datalen] = p[i];
ctx->datalen++;
if (ctx->datalen == 64) {
sha256_transform(ctx, ctx->buffer);
ctx->bitlen += 512;
ctx->datalen = 0;
}
}
}
void sha256_final(uint8_t hash[32], sha256_ctx_t* ctx) {
size_t i = ctx->datalen;
if (ctx->datalen < 56) {
ctx->buffer[i++] = 0x80;
while (i < 56)
ctx->buffer[i++] = 0x00;
} else {
ctx->buffer[i++] = 0x80;
while (i < 64)
ctx->buffer[i++] = 0x00;
sha256_transform(ctx, ctx->buffer);
memset(ctx->buffer, 0, 56);
}
ctx->bitlen += ctx->datalen * 8;
ctx->buffer[63] = (uint8_t)(ctx->bitlen);
ctx->buffer[62] = (uint8_t)(ctx->bitlen >> 8);
ctx->buffer[61] = (uint8_t)(ctx->bitlen >> 16);
ctx->buffer[60] = (uint8_t)(ctx->bitlen >> 24);
ctx->buffer[59] = (uint8_t)(ctx->bitlen >> 32);
ctx->buffer[58] = (uint8_t)(ctx->bitlen >> 40);
ctx->buffer[57] = (uint8_t)(ctx->bitlen >> 48);
ctx->buffer[56] = (uint8_t)(ctx->bitlen >> 56);
sha256_transform(ctx, ctx->buffer);
for (i = 0; i < 4; ++i) {
hash[i] = (uint8_t)((ctx->state[0] >> (24 - i * 8)) & 0x000000ff);
hash[i + 4] = (uint8_t)((ctx->state[1] >> (24 - i * 8)) & 0x000000ff);
hash[i + 8] = (uint8_t)((ctx->state[2] >> (24 - i * 8)) & 0x000000ff);
hash[i + 12] = (uint8_t)((ctx->state[3] >> (24 - i * 8)) & 0x000000ff);
hash[i + 16] = (uint8_t)((ctx->state[4] >> (24 - i * 8)) & 0x000000ff);
hash[i + 20] = (uint8_t)((ctx->state[5] >> (24 - i * 8)) & 0x000000ff);
hash[i + 24] = (uint8_t)((ctx->state[6] >> (24 - i * 8)) & 0x000000ff);
hash[i + 28] = (uint8_t)((ctx->state[7] >> (24 - i * 8)) & 0x000000ff);
}
}
void sha256_string(const char* str, char output[65]) {
sha256_ctx_t ctx;
uint8_t hash[32];
sha256_init(&ctx);
sha256_update(&ctx, str, strlen(str));
sha256_final(hash, &ctx);
for (int i = 0; i < 32; i++) {
sprintf(output + i * 2, "%02x", hash[i]);
}
output[64] = '\0';
}