File size: 16,288 Bytes
849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e c32e207 849e09e 7fce319 849e09e c32e207 849e09e 8ec75f5 849e09e 7fce319 849e09e c32e207 849e09e 7fce319 849e09e 1b25f46 849e09e 7fce319 849e09e 1b25f46 849e09e 1b25f46 849e09e bba2621 849e09e 7fce319 849e09e 7fce319 849e09e 7fce319 849e09e 8ec75f5 849e09e 1b25f46 849e09e 7fce319 8ec75f5 849e09e 1b25f46 849e09e 7fce319 849e09e 7fce319 849e09e | 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 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 | /*
* ============================================================
* NanoMind — Optimized GPT-2 Inference Engine v2.0
* ============================================================
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <immintrin.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#ifdef _WIN32
#include <windows.h>
static double get_ms() {
LARGE_INTEGER f, c;
QueryPerformanceFrequency(&f); QueryPerformanceCounter(&c);
return (double)c.QuadPart / f.QuadPart * 1000.0;
}
#else
#include <sys/time.h>
static double get_ms() {
struct timeval tv; gettimeofday(&tv, NULL);
return tv.tv_sec * 1000.0 + tv.tv_usec / 1000.0;
}
#endif
static thread_local uint64_t tl_rng_state = 0;
static inline float rng_float() {
if (!tl_rng_state) {
tl_rng_state = (uint64_t)get_ms() ^ (uint64_t)(uintptr_t)&tl_rng_state;
if (!tl_rng_state) tl_rng_state = 0xDEADBEEFCAFEBABEULL;
}
tl_rng_state ^= tl_rng_state << 13;
tl_rng_state ^= tl_rng_state >> 7;
tl_rng_state ^= tl_rng_state << 17;
return (float)(tl_rng_state >> 11) * (1.0f / (float)(1ULL << 53));
}
struct Config { int n_layer, n_head, n_embd, block_size, vocab_size; };
struct Weights {
float *wte, *wpe;
float **ln1_w, **ln1_b, **c_attn_w, **c_attn_b;
float **c_proj_w, **c_proj_b, **ln2_w, **ln2_b;
float **fc_w, **fc_b, **mlp_proj_w, **mlp_proj_b;
float *ln_f_w, *ln_f_b, *lm_head_w;
};
static Config cfg;
static Weights W;
static float* g_data = nullptr;
struct Session {
float* k_cache = nullptr;
float* v_cache = nullptr;
int pos = 0;
double last_use = 0.0;
};
static const int MAX_SESSIONS = 20;
static std::unordered_map<std::string, Session> g_sessions;
static float *g_x, *g_buf, *g_qkv, *g_attn_buf;
static float *g_ff, *g_logits, *g_tmp_out;
static std::pair<float,int>* g_topk_pairs = nullptr;
static void layer_norm(float* out, const float* x, const float* w, const float* b, int N) {
__m256 vsum = _mm256_setzero_ps();
for (int i = 0; i < N; i += 8)
vsum = _mm256_add_ps(vsum, _mm256_loadu_ps(x + i));
float tmp[8]; _mm256_storeu_ps(tmp, vsum);
float mean = (tmp[0]+tmp[1]+tmp[2]+tmp[3]+tmp[4]+tmp[5]+tmp[6]+tmp[7]) / (float)N;
__m256 vmean = _mm256_set1_ps(mean);
__m256 vvar = _mm256_setzero_ps();
for (int i = 0; i < N; i += 8) {
__m256 d = _mm256_sub_ps(_mm256_loadu_ps(x + i), vmean);
vvar = _mm256_fmadd_ps(d, d, vvar);
}
_mm256_storeu_ps(tmp, vvar);
float var = (tmp[0]+tmp[1]+tmp[2]+tmp[3]+tmp[4]+tmp[5]+tmp[6]+tmp[7]) / (float)N;
__m256 vsc = _mm256_set1_ps(1.f / sqrtf(var + 1e-5f));
for (int i = 0; i < N; i += 8) {
__m256 d = _mm256_sub_ps(_mm256_loadu_ps(x + i), vmean);
__m256 norm = _mm256_mul_ps(d, vsc);
__m256 result = _mm256_fmadd_ps(norm, _mm256_loadu_ps(w + i), _mm256_loadu_ps(b + i));
_mm256_storeu_ps(out + i, result);
}
float sc = 1.f / sqrtf(var + 1e-5f);
for (int i = (N & ~7); i < N; i++)
out[i] = (x[i] - mean) * sc * w[i] + b[i];
}
static void matmul_vec(float* __restrict__ out, const float* __restrict__ mat,
const float* __restrict__ x, int M, int K) {
const int OMP_THRESHOLD = 64;
if (M < OMP_THRESHOLD) {
for (int i = 0; i < M; i++) {
const float* row = mat + (long long)i * K;
__m256 acc = _mm256_setzero_ps();
int j = 0;
for (; j <= K-8; j += 8)
acc = _mm256_fmadd_ps(_mm256_loadu_ps(row+j), _mm256_loadu_ps(x+j), acc);
float t[8]; _mm256_storeu_ps(t, acc);
float s = t[0]+t[1]+t[2]+t[3]+t[4]+t[5]+t[6]+t[7];
for (; j < K; j++) s += row[j] * x[j];
out[i] = s;
}
return;
}
#pragma omp parallel for schedule(static)
for (int i = 0; i < M; i++) {
const float* row = mat + (long long)i * K;
__m256 acc = _mm256_setzero_ps();
int j = 0;
for (; j <= K-8; j += 8)
acc = _mm256_fmadd_ps(_mm256_loadu_ps(row+j), _mm256_loadu_ps(x+j), acc);
float t[8]; _mm256_storeu_ps(t, acc);
float s = t[0]+t[1]+t[2]+t[3]+t[4]+t[5]+t[6]+t[7];
for (; j < K; j++) s += row[j] * x[j];
out[i] = s;
}
}
static inline float dot_avx2(const float* __restrict__ a, const float* __restrict__ b, int n) {
__m256 acc = _mm256_setzero_ps();
int i = 0;
for (; i <= n-8; i += 8)
acc = _mm256_fmadd_ps(_mm256_loadu_ps(a+i), _mm256_loadu_ps(b+i), acc);
float tmp[8]; _mm256_storeu_ps(tmp, acc);
float s = tmp[0]+tmp[1]+tmp[2]+tmp[3]+tmp[4]+tmp[5]+tmp[6]+tmp[7];
for (; i < n; i++) s += a[i]*b[i];
return s;
}
static inline void weighted_acc_avx2(float* __restrict__ out, const float* __restrict__ v, float w, int n) {
__m256 wv = _mm256_set1_ps(w);
int i = 0;
for (; i <= n-8; i += 8)
_mm256_storeu_ps(out+i, _mm256_fmadd_ps(wv, _mm256_loadu_ps(v+i), _mm256_loadu_ps(out+i)));
for (; i < n; i++) out[i] += w * v[i];
}
static inline void add_bias(float* x, const float* b, int N) {
#pragma omp parallel for
for (int i = 0; i < N; i++) x[i] += b[i];
}
static inline void residual_add(float* x, const float* y, int N) {
#pragma omp parallel for
for (int i = 0; i < N; i++) x[i] += y[i];
}
static void gelu_inplace(float* x, int N) {
const __m256 scale = _mm256_set1_ps(12102203.0f);
const __m256 vbias = _mm256_set1_ps(1064807168.0f);
const __m256 neg_c = _mm256_set1_ps(-1.702f);
const __m256 vone = _mm256_set1_ps(1.0f);
const __m256 vtwo = _mm256_set1_ps(2.0f);
const __m256 vlo = _mm256_set1_ps(-88.0f);
const __m256 vhi = _mm256_set1_ps(88.0f);
int i = 0;
for (; i <= N-8; i += 8) {
__m256 v = _mm256_loadu_ps(x + i);
__m256 t = _mm256_mul_ps(neg_c, v);
t = _mm256_max_ps(t, vlo);
t = _mm256_min_ps(t, vhi);
__m256i ti = _mm256_cvttps_epi32(_mm256_fmadd_ps(t, scale, vbias));
__m256 et = _mm256_castsi256_ps(ti);
__m256 denom = _mm256_add_ps(vone, et);
__m256 r = _mm256_rcp_ps(denom);
r = _mm256_mul_ps(r, _mm256_fnmadd_ps(denom, r, vtwo));
_mm256_storeu_ps(x + i, _mm256_mul_ps(v, r));
}
for (; i < N; i++) {
float v = x[i];
x[i] = v / (1.0f + expf(-1.702f * v));
}
}
static void softmax_inplace(float* x, int N) {
float mx = x[0];
for (int i = 1; i < N; i++) if (x[i] > mx) mx = x[i];
float s = 0.f;
for (int i = 0; i < N; i++) { x[i] = expf(x[i]-mx); s += x[i]; }
for (int i = 0; i < N; i++) x[i] /= s;
}
static void forward(int token_id, int pos, float* k_cache, float* v_cache) {
const int C = cfg.n_embd, H = cfg.n_head, hs = C / H;
float* te = W.wte + (long long)token_id * C;
float* pe = W.wpe + (long long)pos * C;
#pragma omp parallel for
for (int i = 0; i < C; i++) g_x[i] = te[i] + pe[i];
for (int l = 0; l < cfg.n_layer; l++) {
layer_norm(g_buf, g_x, W.ln1_w[l], W.ln1_b[l], C);
matmul_vec(g_qkv, W.c_attn_w[l], g_buf, 3*C, C);
add_bias(g_qkv, W.c_attn_b[l], 3*C);
float* q = g_qkv;
float* k = g_qkv + C;
float* v = g_qkv + 2*C;
float* kc = k_cache + (long long)l * cfg.block_size * C;
float* vc = v_cache + (long long)l * cfg.block_size * C;
memcpy(kc + (long long)pos*C, k, C*sizeof(float));
memcpy(vc + (long long)pos*C, v, C*sizeof(float));
#pragma omp parallel for schedule(static)
for (int h = 0; h < H; h++) {
float* qh = q + h*hs;
float scale = 1.f / sqrtf((float)hs);
float* attn = g_attn_buf + h*cfg.block_size;
for (int t = 0; t <= pos; t++) {
float* kh = kc + (long long)t*C + h*hs;
attn[t] = dot_avx2(qh, kh, hs) * scale;
}
softmax_inplace(attn, pos+1);
float* oh = g_buf + h*hs;
memset(oh, 0, hs*sizeof(float));
for (int t = 0; t <= pos; t++) {
float* vh = vc + (long long)t*C + h*hs;
weighted_acc_avx2(oh, vh, attn[t], hs);
}
}
matmul_vec(g_tmp_out, W.c_proj_w[l], g_buf, C, C);
add_bias(g_tmp_out, W.c_proj_b[l], C);
residual_add(g_x, g_tmp_out, C);
layer_norm(g_buf, g_x, W.ln2_w[l], W.ln2_b[l], C);
matmul_vec(g_ff, W.fc_w[l], g_buf, 4*C, C);
add_bias(g_ff, W.fc_b[l], 4*C);
gelu_inplace(g_ff, 4*C);
matmul_vec(g_tmp_out, W.mlp_proj_w[l], g_ff, C, 4*C);
add_bias(g_tmp_out, W.mlp_proj_b[l], C);
residual_add(g_x, g_tmp_out, C);
}
layer_norm(g_buf, g_x, W.ln_f_w, W.ln_f_b, C);
matmul_vec(g_logits, W.lm_head_w, g_buf, cfg.vocab_size, C);
}
static void map_weights(float* data, long wbytes) {
float* p = data;
float* end = data + wbytes / sizeof(float);
const int C = cfg.n_embd, L = cfg.n_layer;
W.wte = p; p += (long long)cfg.vocab_size * C;
W.wpe = p; p += (long long)cfg.block_size * C;
#define ARR(f) W.f = (float**)malloc(L*sizeof(float*))
ARR(ln1_w); ARR(ln1_b); ARR(c_attn_w); ARR(c_attn_b);
ARR(c_proj_w); ARR(c_proj_b); ARR(ln2_w); ARR(ln2_b);
ARR(fc_w); ARR(fc_b); ARR(mlp_proj_w); ARR(mlp_proj_b);
#undef ARR
for (int l = 0; l < L; l++) {
W.ln1_w[l] = p; p += C;
W.ln1_b[l] = p; p += C;
W.c_attn_w[l] = p; p += 3LL*C*C;
W.c_attn_b[l] = p; p += 3LL*C;
W.c_proj_w[l] = p; p += 1LL*C*C;
W.c_proj_b[l] = p; p += C;
W.ln2_w[l] = p; p += C;
W.ln2_b[l] = p; p += C;
W.fc_w[l] = p; p += 4LL*C*C;
W.fc_b[l] = p; p += 4LL*C;
W.mlp_proj_w[l] = p; p += 1LL*C*4*C;
W.mlp_proj_b[l] = p; p += C;
}
W.ln_f_w = p; p += C;
W.ln_f_b = p; p += C;
W.lm_head_w = p; p += (long long)cfg.vocab_size * C;
if (p > end) {
long long needed = (p - data) * (long long)sizeof(float);
long long got = (end - data) * (long long)sizeof(float);
fprintf(stderr, "FATAL: model.bin too small — need %lld bytes, got %lld.\n", needed, got);
fflush(stderr);
printf("ERROR model_truncated\n"); fflush(stdout);
exit(1);
}
}
static long long kv_bytes() {
return (long long)cfg.n_layer * cfg.block_size * cfg.n_embd * sizeof(float);
}
static void free_session(Session& s) {
free(s.k_cache); free(s.v_cache);
s.k_cache = nullptr; s.v_cache = nullptr; s.pos = 0;
}
static void evict_oldest() {
if (g_sessions.empty()) return;
std::string oid; double ot = 1e300;
for (auto& kv : g_sessions)
if (kv.second.last_use < ot) { ot = kv.second.last_use; oid = kv.first; }
free_session(g_sessions[oid]);
g_sessions.erase(oid);
}
static Session& get_or_create(const std::string& id) {
auto it = g_sessions.find(id);
if (it != g_sessions.end()) { it->second.last_use = get_ms(); return it->second; }
if ((int)g_sessions.size() >= MAX_SESSIONS) evict_oldest();
Session s;
long long nb = kv_bytes();
s.k_cache = (float*)calloc(nb, 1);
s.v_cache = (float*)calloc(nb, 1);
s.pos = 0;
s.last_use = get_ms();
g_sessions[id] = s;
return g_sessions[id];
}
static int sample_topk(float temperature, int top_k) {
for (int v = 0; v < cfg.vocab_size; v++) g_logits[v] /= temperature;
int K = std::min(top_k, cfg.vocab_size);
for (int v = 0; v < cfg.vocab_size; v++) g_topk_pairs[v] = {g_logits[v], v};
std::partial_sort(g_topk_pairs, g_topk_pairs + K, g_topk_pairs + cfg.vocab_size,
[](const auto& a, const auto& b){ return a.first > b.first; });
float sum = 0.f;
for (int j = 0; j < K; j++) { g_topk_pairs[j].first = expf(g_topk_pairs[j].first); sum += g_topk_pairs[j].first; }
for (int j = 0; j < K; j++) g_topk_pairs[j].first /= sum;
float r = rng_float(), cum = 0.f;
int best = g_topk_pairs[0].second;
for (int j = 0; j < K; j++) {
cum += g_topk_pairs[j].first;
if (r < cum) { best = g_topk_pairs[j].second; break; }
}
return best;
}
static std::vector<std::string> split(const std::string& s, char d) {
std::vector<std::string> out; std::string cur;
for (char c : s) { if (c==d){out.push_back(cur);cur.clear();}else cur+=c; }
out.push_back(cur); return out;
}
static std::vector<int> parse_ints(const std::string& s) {
std::vector<int> out;
for (auto& t : split(s,',')) if (!t.empty()) out.push_back(atoi(t.c_str()));
return out;
}
static void handle_request(const std::string& line) {
auto parts = split(line, '|');
if (parts.size() < 7) { printf("ERROR bad_request_format\n"); fflush(stdout); return; }
std::string sess_id = parts[1];
auto new_tokens = parse_ints(parts[2]);
int max_new = atoi(parts[3].c_str());
float temp = (float)atof(parts[4].c_str());
int top_k = atoi(parts[5].c_str());
auto stop_list = parse_ints(parts[6]);
temp = std::max(temp, 0.01f);
top_k = std::clamp(top_k, 1, cfg.vocab_size);
max_new = std::max(max_new, 1);
std::unordered_set<int> stop_ids(stop_list.begin(), stop_list.end());
stop_ids.insert(50256);
Session& sess = get_or_create(sess_id);
for (int tok : new_tokens) {
if (sess.pos >= cfg.block_size) { printf("ERROR context_window_full\n"); fflush(stdout); return; }
forward(tok, sess.pos, sess.k_cache, sess.v_cache);
sess.pos++;
}
double t0 = get_ms();
int gen = 0;
for (int i = 0; i < max_new; i++) {
if (sess.pos >= cfg.block_size) break;
int next = sample_topk(temp, top_k);
printf("TOKEN %d %.2f\n", next, get_ms()-t0);
fflush(stdout);
gen++;
if (stop_ids.count(next)) break;
forward(next, sess.pos, sess.k_cache, sess.v_cache);
sess.pos++;
}
printf("DONE %d %.2f\n", gen, get_ms()-t0);
fflush(stdout);
}
static void handle_reset(const std::string& line) {
auto parts = split(line, '|');
if (parts.size() >= 2) {
auto it = g_sessions.find(parts[1]);
if (it != g_sessions.end()) { free_session(it->second); g_sessions.erase(it); }
}
printf("RESET_OK\n"); fflush(stdout);
}
int main() {
FILE* f = fopen("model.bin", "rb");
if (!f) { printf("ERROR model.bin_not_found\n"); fflush(stdout); return 1; }
fread(&cfg, sizeof(int), 5, f);
fseek(f, 0, SEEK_END); long fsize = ftell(f);
fseek(f, 5*(long)sizeof(int), SEEK_SET);
long wbytes = fsize - 5*(long)sizeof(int);
g_data = (float*)malloc(wbytes);
if (!g_data) { printf("ERROR oom\n"); fflush(stdout); return 1; }
fread(g_data, 1, wbytes, f);
fclose(f);
map_weights(g_data, wbytes);
const int C = cfg.n_embd;
g_x = (float*)malloc(C * sizeof(float));
g_buf = (float*)malloc(C * sizeof(float));
g_qkv = (float*)malloc(3*C * sizeof(float));
g_attn_buf = (float*)malloc((long long)cfg.n_head * cfg.block_size * sizeof(float));
g_ff = (float*)malloc(4*C * sizeof(float));
g_logits = (float*)malloc((long long)cfg.vocab_size * sizeof(float));
g_tmp_out = (float*)malloc(C * sizeof(float));
g_topk_pairs = (std::pair<float,int>*)malloc((long long)cfg.vocab_size * sizeof(std::pair<float,int>));
printf("READY\n"); fflush(stdout);
std::string line;
while (std::getline(std::cin, line)) {
if (!line.empty() && line.back()=='\r') line.pop_back();
if (line.empty()) continue;
if (line == "QUIT") break;
else if (line.rfind("RESET|", 0)==0) handle_reset(line);
else if (line.rfind("REQUEST|", 0)==0) handle_request(line);
else { printf("ERROR unknown_cmd\n"); fflush(stdout); }
}
for (auto& kv : g_sessions) free_session(kv.second);
free(g_data);
free(g_x); free(g_buf); free(g_qkv); free(g_attn_buf);
free(g_ff); free(g_logits); free(g_tmp_out); free(g_topk_pairs);
return 0;
} |