File size: 30,189 Bytes
4e23b01 | 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 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 | // src/codec.ts
//
// Binary record format shared by the WAL and the snapshot.
//
// Frame (little-endian):
//
// off size field
// 0 2 magic = 0x4D 0x44 ("MD") — sync marker
// 2 1 type — 1 = SET, 2 = DEL (tombstone), 3 = BATCH
// 3 1 flags — reserved (0)
// 4 2 keyLen — uint16, key length in bytes (max 64 KiB)
// 6 4 valLen — uint32, value length in bytes (0 for DEL)
// 10 4 metaLen — uint32, optional metadata length in bytes (0 if none)
// 14 8 expireAt — int64, ms since epoch; 0 = no expiry
// 22 keyLen key
// 22+k valLen value
// 22+k+v metaLen meta — optional metadata blob (used for dt columns, etc.)
// 22+k+v+m 4 crc32 — CRC-32 TRAILER over [type .. meta]
//
// The fixed-size header (22 bytes) lets a reader compute the full frame length
// (22 + keyLen + valLen + metaLen + 4) before reading the payload.
import fs from 'node:fs';
import { crc32 } from './crc32.ts';
export const MAGIC = Buffer.from([0x4d, 0x44]); // "MD"
export const TYPE_SET = 1;
export const TYPE_DEL = 2;
export const TYPE_BATCH = 3;
export const HEADER_SIZE = 22; // bytes before the payload (key)
export const CRC_SIZE = 4;
export const MAX_KEY_LEN = 0xffff; // uint16
export const MAX_VAL_LEN = 0xffffffff; // uint32
/** A decoded record frame. */
export interface Frame {
type: number;
key: Buffer;
value: Buffer;
meta: Buffer | null;
expireAt: number;
}
export interface EncodeFrameInput {
type: number;
key: Buffer;
value?: Buffer | null;
meta?: Buffer | null;
expireAt?: number | bigint;
}
/** A single op inside a BATCH frame body. */
export interface BatchOp {
type: number;
key: Buffer;
value: Buffer | null;
meta: Buffer | null;
expireAt: number;
}
export interface ParseResult {
frames: Frame[];
corruptRanges: [number, number][];
eofOffset: number;
}
/** A frame scanned for recovery in valueMode:'disk'. The value is reported as an
* absolute file offset/length instead of being copied into memory. */
export interface FrameRef {
type: number;
key: Buffer;
meta: Buffer | null;
expireAt: number;
frameOff: number;
valueOff: number;
valLen: number;
frameLen: number;
}
export interface ScanFrameRefsResult {
frames: FrameRef[];
corruptRanges: [number, number][];
eofOffset: number;
}
/** A BATCH sub-op scanned for recovery in valueMode:'disk'. */
export interface BatchOpRef {
type: number;
key: Buffer;
meta: Buffer | null;
expireAt: number;
valueOff: number;
valLen: number;
}
export class CorruptFrameError extends Error {
readonly offset: number;
constructor(message: string, offset: number) {
super(message);
this.name = 'CorruptFrameError';
this.offset = offset; // absolute byte offset in the stream where the bad frame starts
}
}
const EMPTY: Buffer = Buffer.alloc(0);
/**
* Encode one record into a single Buffer.
*/
export function encodeFrame({
type,
key,
value = null,
meta = null,
expireAt = 0,
}: EncodeFrameInput): Buffer {
if (!Buffer.isBuffer(key)) throw new TypeError('key must be a Buffer');
if (key.length > MAX_KEY_LEN) throw new RangeError('key too large');
const val: Buffer = value ?? EMPTY;
const met: Buffer = meta ?? EMPTY;
if (type === TYPE_SET && !Buffer.isBuffer(val)) throw new TypeError('value must be a Buffer for SET');
if (!Buffer.isBuffer(met)) throw new TypeError('meta must be a Buffer');
if (val.length > MAX_VAL_LEN) throw new RangeError('value too large');
if (met.length > MAX_VAL_LEN) throw new RangeError('meta too large');
const frame = Buffer.allocUnsafe(HEADER_SIZE + key.length + val.length + met.length + CRC_SIZE);
let o = 0;
MAGIC.copy(frame, o); o += 2;
frame.writeUInt8(type, o); o += 1;
frame.writeUInt8(0, o); o += 1; // flags
frame.writeUInt16LE(key.length, o); o += 2;
frame.writeUInt32LE(val.length, o); o += 4;
frame.writeUInt32LE(met.length, o); o += 4;
frame.writeBigInt64LE(BigInt(expireAt ?? 0), o); o += 8;
key.copy(frame, o); o += key.length;
val.copy(frame, o); o += val.length;
met.copy(frame, o); o += met.length;
// CRC trailer over everything after magic, before the crc field.
const c = crc32(frame.subarray(2, o));
frame.writeUInt32LE(c, o);
return frame;
}
/**
* Encode a list of ops into a batch body (used as the `value` of a TYPE_BATCH
* frame). The whole body is protected by the outer frame's CRC, so a batch is
* one atomic unit: it either applies fully or is skipped entirely on recovery.
*
* Body layout:
* count(2) | [ op(1) | keyLen(2) | valLen(4) | metaLen(4) | expireAt(8) |
* key | value | meta ] ...
*/
const SUB_HEADER = 1 + 2 + 4 + 4 + 8;
export function encodeBatchOps(ops: BatchOp[]): Buffer {
let total = 2;
for (const op of ops) {
// Encode-side assertion mirroring the strict decode validation: a batch
// body only ever carries SET/DEL sub-ops (review #9).
if (op.type !== TYPE_SET && op.type !== TYPE_DEL) {
throw new RangeError(`batch op type must be SET or DEL, got ${op.type}`);
}
total += SUB_HEADER + op.key.length + (op.value ? op.value.length : 0) + (op.meta ? op.meta.length : 0);
}
const body = Buffer.allocUnsafe(total);
let o = 0;
body.writeUInt16LE(ops.length, o); o += 2;
for (const op of ops) {
const key = op.key;
const val: Buffer = op.value ?? EMPTY;
const met: Buffer = op.meta ?? EMPTY;
body.writeUInt8(op.type, o); o += 1;
body.writeUInt16LE(key.length, o); o += 2;
body.writeUInt32LE(val.length, o); o += 4;
body.writeUInt32LE(met.length, o); o += 4;
body.writeBigInt64LE(BigInt(op.expireAt ?? 0), o); o += 8;
key.copy(body, o); o += key.length;
val.copy(body, o); o += val.length;
met.copy(body, o); o += met.length;
}
return body;
}
export function decodeBatchOps(body: Buffer): BatchOp[] {
const ops: BatchOp[] = [];
let o = 0;
if (body.length < 2) throw new RangeError('batch body truncated: op count');
const count = body.readUInt16LE(o); o += 2;
for (let i = 0; i < count; i++) {
if (o + SUB_HEADER > body.length) throw new RangeError('batch op header truncated');
const type = body.readUInt8(o); o += 1;
if (type !== TYPE_SET && type !== TYPE_DEL) throw new RangeError(`batch op has unknown type ${type}`);
const keyLen = body.readUInt16LE(o); o += 2;
const valLen = body.readUInt32LE(o); o += 4;
const metaLen = body.readUInt32LE(o); o += 4;
const expireAt = Number(body.readBigInt64LE(o)); o += 8;
if (o + keyLen + valLen + metaLen > body.length) throw new RangeError('batch op payload truncated');
const key = Buffer.from(body.subarray(o, o + keyLen)); o += keyLen;
const value = Buffer.from(body.subarray(o, o + valLen)); o += valLen;
const meta = metaLen ? Buffer.from(body.subarray(o, o + metaLen)) : null; o += metaLen;
ops.push({ type, key, value, meta, expireAt });
}
// All-or-nothing structure check: a valid batch body ends exactly after its
// last op — trailing bytes mean the body is malformed (review #9).
if (o !== body.length) throw new RangeError(`batch body has ${body.length - o} trailing byte(s)`);
return ops;
}
/**
* Streaming frame parser. Feed it arbitrary chunks (e.g. from a file read
* stream); it yields whole frames and buffers partial trailing bytes for the
* next feed(). Tracks absolute stream offset so a corrupt frame can be located
* and the file truncated there.
*/
export class FrameParser {
private pending: Buffer = EMPTY;
private offset = 0; // absolute offset of the next byte to be consumed
*feed(chunk: Buffer): Generator<Frame> {
let buf: Buffer = this.pending.length ? Buffer.concat([this.pending, chunk]) : chunk;
let pos = 0;
while (true) {
if (buf.length - pos < HEADER_SIZE) break;
if (buf[pos] !== MAGIC[0] || buf[pos + 1] !== MAGIC[1]) {
const next = buf.indexOf(MAGIC, pos + 1);
if (next === -1) throw new CorruptFrameError('magic not found', this.offset + pos);
pos = next;
continue;
}
const type = buf.readUInt8(pos + 2);
const keyLen = buf.readUInt16LE(pos + 4);
const valLen = buf.readUInt32LE(pos + 6);
const metaLen = buf.readUInt32LE(pos + 10);
const frameLen = HEADER_SIZE + keyLen + valLen + metaLen + CRC_SIZE;
if (buf.length - pos < frameLen) break; // incomplete payload/crc, wait for more
const storedCrc = buf.readUInt32LE(pos + frameLen - CRC_SIZE);
const computedCrc = crc32(buf.subarray(pos + 2, pos + frameLen - CRC_SIZE));
if (storedCrc !== computedCrc) {
throw new CorruptFrameError(`crc mismatch at offset ${this.offset + pos}`, this.offset + pos);
}
const expireAt = Number(buf.readBigInt64LE(pos + 14));
const keyStart = pos + HEADER_SIZE;
const key = buf.subarray(keyStart, keyStart + keyLen);
const value = buf.subarray(keyStart + keyLen, keyStart + keyLen + valLen);
const metaStart = keyStart + keyLen + valLen;
const meta = metaLen ? buf.subarray(metaStart, metaStart + metaLen) : null;
yield {
type,
key: Buffer.from(key),
value: Buffer.from(value),
meta: meta ? Buffer.from(meta) : null,
expireAt,
};
pos += frameLen;
this.offset += frameLen;
}
this.pending = pos < buf.length ? Buffer.from(buf.subarray(pos)) : EMPTY;
}
/**
* Signal end-of-stream. If any bytes are still buffered (a partial frame),
* they are a torn tail left by a crash: throw CorruptFrameError at the offset
* where valid data ends, so recovery can truncate the file there. Returns the
* clean EOF offset (total valid bytes) when there is no leftover.
*/
finish(): number {
if (this.pending.length > 0) {
const off = this.offset;
const n = this.pending.length;
this.pending = EMPTY;
throw new CorruptFrameError(`torn tail: ${n} trailing byte(s)`, off);
}
return this.offset;
}
}
/**
* Try to read and validate one frame at `pos`.
* @returns the parsed frame + its byte length, or null when there is no valid,
* complete frame at `pos` (no magic, incomplete, insane length, or CRC mismatch).
*/
function readFrameAt(buf: Buffer, pos: number): { frame: Frame; frameLen: number } | null {
if (buf.length - pos < HEADER_SIZE) return null;
if (buf[pos] !== MAGIC[0] || buf[pos + 1] !== MAGIC[1]) return null;
const keyLen = buf.readUInt16LE(pos + 4);
const valLen = buf.readUInt32LE(pos + 6);
const metaLen = buf.readUInt32LE(pos + 10);
if (keyLen > MAX_KEY_LEN) return null;
const frameLen = HEADER_SIZE + keyLen + valLen + metaLen + CRC_SIZE;
if (frameLen < HEADER_SIZE + CRC_SIZE) return null; // length overflow
if (buf.length - pos < frameLen) return null; // incomplete
const stored = buf.readUInt32LE(pos + frameLen - CRC_SIZE);
const computed = crc32(buf.subarray(pos + 2, pos + frameLen - CRC_SIZE));
if (stored !== computed) return null; // bad crc
const expireAt = Number(buf.readBigInt64LE(pos + 14));
const keyStart = pos + HEADER_SIZE;
const key = buf.subarray(keyStart, keyStart + keyLen);
const value = buf.subarray(keyStart + keyLen, keyStart + keyLen + valLen);
const metaStart = keyStart + keyLen + valLen;
const meta = metaLen ? buf.subarray(metaStart, metaStart + metaLen) : null;
return {
frame: {
type: buf.readUInt8(pos + 2),
key: Buffer.from(key),
value: Buffer.from(value),
meta: meta ? Buffer.from(meta) : null,
expireAt,
},
frameLen,
};
}
const CRC_CHUNK = 1 << 20;
const MAGIC_SCAN_CHUNK = 1 << 20;
/** Corruption-resync candidate budget (stage 6): resynchronization validates
* every magic-looking position until one parses as a full frame, so a file
* dense in fake magic bytes costs O(candidates x frame-verification) and can
* occupy the scanner super-linearly. After this many candidate validations
* across one scan the rest of the file is given up as corrupt (the
* conservative strict-mode outcome) instead of burning unbounded time. */
export const DEFAULT_RESYNC_CANDIDATE_BUDGET = 65536;
function readExactSync(fd: number, buf: Buffer, pos: number): void {
let got = 0;
while (got < buf.length) {
const r = fs.readSync(fd, buf, got, buf.length - got, pos + got);
if (r === 0) throw new Error('codec: short read past EOF');
got += r;
}
}
function readFrameRefAt(fd: number, pos: number, size: number): FrameRef | null {
if (size - pos < HEADER_SIZE) return null;
const header = Buffer.allocUnsafe(HEADER_SIZE);
readExactSync(fd, header, pos);
if (header[0] !== MAGIC[0] || header[1] !== MAGIC[1]) return null;
const type = header.readUInt8(2);
const keyLen = header.readUInt16LE(4);
const valLen = header.readUInt32LE(6);
const metaLen = header.readUInt32LE(10);
if (keyLen > MAX_KEY_LEN) return null;
const frameLen = HEADER_SIZE + keyLen + valLen + metaLen + CRC_SIZE;
if (frameLen < HEADER_SIZE + CRC_SIZE) return null; // length overflow
if (size - pos < frameLen) return null; // incomplete
let crc = 0;
let crcPos = pos + 2;
let crcLeft = frameLen - CRC_SIZE - 2;
while (crcLeft > 0) {
const len = Math.min(CRC_CHUNK, crcLeft);
const buf = Buffer.allocUnsafe(len);
readExactSync(fd, buf, crcPos);
crc = crc32(buf, crc);
crcPos += len;
crcLeft -= len;
}
const storedCrcBuf = Buffer.allocUnsafe(CRC_SIZE);
readExactSync(fd, storedCrcBuf, pos + frameLen - CRC_SIZE);
if (storedCrcBuf.readUInt32LE(0) !== crc) return null;
const keyStart = pos + HEADER_SIZE;
const valueOff = keyStart + keyLen;
const metaStart = valueOff + valLen;
const key = Buffer.allocUnsafe(keyLen);
if (keyLen) readExactSync(fd, key, keyStart);
let meta: Buffer | null = null;
if (metaLen) {
meta = Buffer.allocUnsafe(metaLen);
readExactSync(fd, meta, metaStart);
}
return {
type,
key,
meta,
expireAt: Number(header.readBigInt64LE(14)),
frameOff: pos,
valueOff,
valLen,
frameLen,
};
}
function findMagicSync(fd: number, start: number, size: number): number {
const buf = Buffer.allocUnsafe(MAGIC_SCAN_CHUNK);
let pos = start;
while (pos < size) {
const len = Math.min(MAGIC_SCAN_CHUNK, size - pos);
const n = fs.readSync(fd, buf, 0, len, pos);
if (n === 0) return -1;
const idx = buf.subarray(0, n).indexOf(MAGIC);
if (idx >= 0) return pos + idx;
if (n < MAGIC.length) break;
pos += n - (MAGIC.length - 1);
}
return -1;
}
/** Scan an open snapshot/WAL fd into frame refs without copying values.
* `startOffset` restricts the scan to [startOffset, EOF) — used by replica
* catch-up, which resumes at a known frame boundary.
* `maxResyncCandidates` bounds the corruption-resync candidate validations
* (see DEFAULT_RESYNC_CANDIDATE_BUDGET); on exhaustion the remaining bytes
* are reported as one final corrupt range (the strict outcome for the tail). */
export function scanFrameRefsFd(
fd: number,
{
onCorrupt = 'resync',
startOffset = 0,
maxResyncCandidates = DEFAULT_RESYNC_CANDIDATE_BUDGET,
}: { onCorrupt?: 'resync' | 'strict'; startOffset?: number; maxResyncCandidates?: number } = {},
): ScanFrameRefsResult {
const size = fs.fstatSync(fd).size;
const frames: FrameRef[] = [];
const corruptRanges: [number, number][] = [];
let pos = startOffset;
let resyncCandidates = 0;
while (pos < size) {
const r = readFrameRefAt(fd, pos, size);
if (r) {
frames.push(r);
pos += r.frameLen;
continue;
}
if (onCorrupt === 'strict') {
corruptRanges.push([pos, size]);
break;
}
const badStart = pos;
let resume = -1;
let scan = pos + 1;
while (scan < size - 1) {
scan = findMagicSync(fd, scan, size);
if (scan === -1) break;
if (resyncCandidates++ >= maxResyncCandidates) break;
if (readFrameRefAt(fd, scan, size)) {
resume = scan;
break;
}
scan++;
}
corruptRanges.push([badStart, resume === -1 ? size : resume]);
if (resume === -1) break;
pos = resume;
}
return { frames, corruptRanges, eofOffset: pos };
}
/** Scan a snapshot/WAL file into frame refs without copying values. */
export function scanFrameRefsFile(
filePath: string,
opts: { onCorrupt?: 'resync' | 'strict' } = {},
): ScanFrameRefsResult {
const fd = fs.openSync(filePath, 'r');
try {
return scanFrameRefsFd(fd, opts);
} finally {
fs.closeSync(fd);
}
}
// ---- async sequential scanner (stage 6) -------------------------------------
//
// The async counterpart of scanFrameRefsFd: recovery scans run off the event
// loop's critical path. The file is read through a forward sequential window
// (one positioned read per ASYNC_SCAN_WINDOW bytes for the common all-small-
// frames case); frames larger than the window fall back to chunked positioned
// reads so a huge value never sits wholly in RAM. CRC is computed per
// CRC_CHUNK slice, the scanner yields to the event loop every
// SCAN_YIELD_BYTES, and an optional AbortSignal cancels between slices.
const ASYNC_SCAN_WINDOW = 1 << 22; // 4 MiB sequential read window
const SCAN_YIELD_BYTES = 1 << 23; // yield + cancel check every 8 MiB scanned
const yieldToLoop = (): Promise<void> => new Promise((r) => setImmediate(r));
function scanAbortError(): Error {
const err = new Error('frame scan aborted');
err.name = 'AbortError';
return err;
}
/** Promise wrapper over fs.read (the callback API keeps using the libuv
* thread pool for a plain fd; fs.promises has no fd-level read). */
function readAt(fd: number, buf: Buffer, bufOff: number, len: number, pos: number): Promise<number> {
return new Promise((resolve, reject) => {
fs.read(fd, buf, bufOff, len, pos, (err, bytesRead) => (err ? reject(err) : resolve(bytesRead)));
});
}
async function readExactAsync(fd: number, buf: Buffer, pos: number): Promise<void> {
let got = 0;
while (got < buf.length) {
const bytesRead = await readAt(fd, buf, got, buf.length - got, pos + got);
if (bytesRead === 0) throw new Error('codec: short read past EOF');
got += bytesRead;
}
}
/** Async twin of readFrameRefAt (chunked positioned reads; values are never
* copied — only header, key and meta bytes land in RAM). */
async function readFrameRefAtAsync(fd: number, pos: number, size: number): Promise<FrameRef | null> {
if (size - pos < HEADER_SIZE) return null;
const header = Buffer.allocUnsafe(HEADER_SIZE);
await readExactAsync(fd, header, pos);
if (header[0] !== MAGIC[0] || header[1] !== MAGIC[1]) return null;
const type = header.readUInt8(2);
const keyLen = header.readUInt16LE(4);
const valLen = header.readUInt32LE(6);
const metaLen = header.readUInt32LE(10);
if (keyLen > MAX_KEY_LEN) return null;
const frameLen = HEADER_SIZE + keyLen + valLen + metaLen + CRC_SIZE;
if (frameLen < HEADER_SIZE + CRC_SIZE) return null;
if (size - pos < frameLen) return null;
let crc = 0;
let crcPos = pos + 2;
let crcLeft = frameLen - CRC_SIZE - 2;
while (crcLeft > 0) {
const len = Math.min(CRC_CHUNK, crcLeft);
const buf = Buffer.allocUnsafe(len);
await readExactAsync(fd, buf, crcPos);
crc = crc32(buf, crc);
crcPos += len;
crcLeft -= len;
}
const storedCrcBuf = Buffer.allocUnsafe(CRC_SIZE);
await readExactAsync(fd, storedCrcBuf, pos + frameLen - CRC_SIZE);
if (storedCrcBuf.readUInt32LE(0) !== crc) return null;
const keyStart = pos + HEADER_SIZE;
const valueOff = keyStart + keyLen;
const metaStart = valueOff + valLen;
const key = Buffer.allocUnsafe(keyLen);
if (keyLen) await readExactAsync(fd, key, keyStart);
let meta: Buffer | null = null;
if (metaLen) {
meta = Buffer.allocUnsafe(metaLen);
await readExactAsync(fd, meta, metaStart);
}
return {
type,
key,
meta,
expireAt: Number(header.readBigInt64LE(14)),
frameOff: pos,
valueOff,
valLen,
frameLen,
};
}
/** The buffered-window frame parse: identical validation to readFrameRefAt,
* but served from the sequential window when the whole frame is inside it.
* Returns the ref, null (invalid at pos), or 'window' when the frame does
* not fit the current window (caller refills or falls back to positioned
* reads). */
function parseFrameRefInWindow(
win: Buffer,
winStart: number,
winLen: number,
pos: number,
size: number,
): FrameRef | null | 'window' {
const avail = winStart + winLen - pos;
if (avail < HEADER_SIZE) return null; // caller only asks when pos < end
if (size - pos < HEADER_SIZE) return null;
const o = pos - winStart;
if (win[o] !== MAGIC[0] || win[o + 1] !== MAGIC[1]) return null;
const type = win.readUInt8(o + 2);
const keyLen = win.readUInt16LE(o + 4);
const valLen = win.readUInt32LE(o + 6);
const metaLen = win.readUInt32LE(o + 10);
if (keyLen > MAX_KEY_LEN) return null;
const frameLen = HEADER_SIZE + keyLen + valLen + metaLen + CRC_SIZE;
if (frameLen < HEADER_SIZE + CRC_SIZE) return null;
if (size - pos < frameLen) return null;
if (avail < frameLen) return 'window';
// The whole frame is in the window: validate the CRC per CRC_CHUNK slice
// (the slices also bound the per-slice CPU run between yield checks).
let crc = 0;
let crcPos = o + 2;
let crcLeft = frameLen - CRC_SIZE - 2;
while (crcLeft > 0) {
const len = Math.min(CRC_CHUNK, crcLeft);
crc = crc32(win.subarray(crcPos, crcPos + len), crc);
crcPos += len;
crcLeft -= len;
}
if (win.readUInt32LE(o + frameLen - CRC_SIZE) !== crc) return null;
const keyStart = o + HEADER_SIZE;
const valueOff = pos + HEADER_SIZE + keyLen;
const metaStart = keyStart + keyLen + valLen;
const key = Buffer.from(win.subarray(keyStart, keyStart + keyLen));
const meta = metaLen ? Buffer.from(win.subarray(metaStart, metaStart + metaLen)) : null;
return { type, key, meta, expireAt: Number(win.readBigInt64LE(o + 14)), frameOff: pos, valueOff, valLen, frameLen };
}
/** Async sequential scan of an open snapshot/WAL fd into frame refs without
* copying values. Semantics match scanFrameRefsFd exactly (same corrupt
* ranges, same eofOffset), with three additions: periodic event-loop yields,
* AbortSignal cancellation (throws an 'AbortError'), and the resync
* candidate budget shared with the sync scanner. */
export async function scanFrameRefsFdAsync(
fd: number,
{
onCorrupt = 'resync',
startOffset = 0,
endOffset,
signal,
maxResyncCandidates = DEFAULT_RESYNC_CANDIDATE_BUDGET,
}: {
onCorrupt?: 'resync' | 'strict';
startOffset?: number;
/** Scan only [startOffset, endOffset) of the file (the stage-6 worker
* pins its source to a WAL checkpoint; a live writer may have appended
* past it). Defaults to the file's current size. */
endOffset?: number;
signal?: AbortSignal;
maxResyncCandidates?: number;
} = {},
): Promise<ScanFrameRefsResult> {
const size = Math.min(fs.fstatSync(fd).size, endOffset ?? Number.POSITIVE_INFINITY);
const frames: FrameRef[] = [];
const corruptRanges: [number, number][] = [];
const win = Buffer.allocUnsafe(ASYNC_SCAN_WINDOW);
let winStart = startOffset; // absolute offset of win[0]
let winLen = 0; // valid bytes in the window
let pos = startOffset;
let sinceYield = 0;
let resyncCandidates = 0;
const throwIfAborted = (): void => {
if (signal?.aborted) throw scanAbortError();
};
/** Read the window covering `pos`: the leftover suffix is compacted when
* it overlaps, otherwise the window restarts at pos. */
const fillWindow = async (at: number): Promise<void> => {
const end = winStart + winLen;
if (at >= winStart && at < end) {
const keep = end - at;
win.copyWithin(0, at - winStart, at - winStart + keep);
winStart = at;
winLen = keep;
} else {
winStart = at;
winLen = 0;
}
while (winLen < win.length && winStart + winLen < size) {
const bytesRead = await readAt(fd, win, winLen, Math.min(win.length - winLen, size - winStart - winLen), winStart + winLen);
if (bytesRead === 0) break;
winLen += bytesRead;
}
};
/** Parse the frame at `pos`, refilling the window or falling back to
* chunked positioned reads for a frame larger than the window. */
const frameAt = async (at: number): Promise<FrameRef | null> => {
if (at < winStart || at + HEADER_SIZE > winStart + winLen) await fillWindow(at);
let r = parseFrameRefInWindow(win, winStart, winLen, at, size);
if (r !== 'window') return r;
// The frame spans past the window: refilling can only help while the
// whole frame still fits one window; larger frames take the positioned
// path so their value bytes never sit in RAM.
if (at - winStart > 0) {
await fillWindow(at);
r = parseFrameRefInWindow(win, winStart, winLen, at, size);
if (r !== 'window') return r;
}
return readFrameRefAtAsync(fd, at, size);
};
const tick = async (advanced: number): Promise<void> => {
sinceYield += advanced;
if (sinceYield >= SCAN_YIELD_BYTES) {
sinceYield = 0;
throwIfAborted();
await yieldToLoop();
}
};
throwIfAborted();
while (pos < size) {
const r = await frameAt(pos);
if (r) {
frames.push(r);
pos += r.frameLen;
await tick(r.frameLen);
continue;
}
if (onCorrupt === 'strict') {
corruptRanges.push([pos, size]);
break;
}
const badStart = pos;
let resume = -1;
let scan = pos + 1;
while (scan < size - 1) {
// Find the next magic from the current window contents (refilling as
// the scan position moves forward), then validate the candidate.
if (scan < winStart || scan >= winStart + winLen) await fillWindow(scan);
const idx = win.indexOf(MAGIC, scan - winStart);
const found = idx === -1 ? -1 : winStart + idx;
if (found === -1) {
// No magic in the remaining window: if the window reached EOF the
// resync is over, otherwise jump straight to the next window (the
// last MAGIC.length - 1 bytes may hold a partial magic).
const end = winStart + winLen;
if (end >= size) {
scan = size;
break;
}
scan = Math.max(end - (MAGIC.length - 1), scan + 1);
await tick(ASYNC_SCAN_WINDOW);
continue;
}
scan = found;
if (scan >= size - 1) break;
if (resyncCandidates++ >= maxResyncCandidates) {
scan = size;
break;
}
const candidate = await frameAt(scan);
if (candidate) {
resume = scan;
break;
}
scan++;
}
corruptRanges.push([badStart, resume === -1 ? size : resume]);
if (resume === -1) break;
pos = resume;
}
throwIfAborted();
return { frames, corruptRanges, eofOffset: pos };
}
/** Scan BATCH body op refs without copying op values. `bodyOff` is the absolute
* file offset where the BATCH body (the outer frame's value) starts.
* Strictly validated (review #9): sub-op types must be SET/DEL, every op must
* stay in bounds, and the body must end exactly after its last op — a
* violation throws, so the caller (frameToOps) skips the whole batch instead
* of half-applying it. */
export function scanBatchOpRefs(body: Buffer, bodyOff: number): BatchOpRef[] {
const ops: BatchOpRef[] = [];
let o = 0;
if (body.length < 2) throw new RangeError('batch body truncated: op count');
const count = body.readUInt16LE(o);
o += 2;
for (let i = 0; i < count; i++) {
if (o + SUB_HEADER > body.length) throw new RangeError('batch op header truncated');
const type = body.readUInt8(o);
o += 1;
if (type !== TYPE_SET && type !== TYPE_DEL) throw new RangeError(`batch op has unknown type ${type}`);
const keyLen = body.readUInt16LE(o);
o += 2;
const valLen = body.readUInt32LE(o);
o += 4;
const metaLen = body.readUInt32LE(o);
o += 4;
const expireAt = Number(body.readBigInt64LE(o));
o += 8;
if (o + keyLen + valLen + metaLen > body.length) throw new RangeError('batch op payload truncated');
const key = Buffer.from(body.subarray(o, o + keyLen));
const valueOff = bodyOff + o + keyLen;
o += keyLen + valLen;
const meta = metaLen ? Buffer.from(body.subarray(o, o + metaLen)) : null;
o += metaLen;
ops.push({ type, key, valueOff, valLen, meta, expireAt });
}
if (o !== body.length) throw new RangeError(`batch body has ${body.length - o} trailing byte(s)`);
return ops;
}
/**
* Parse a complete buffer into frames, with configurable corruption handling.
*
* - onCorrupt = 'resync' (default): a bad/incomplete frame is skipped and the
* parser resynchronizes to the next valid frame. Only the corrupted bytes are
* lost; everything after the next valid frame is recovered.
* - onCorrupt = 'strict': stop at the first bad frame and treat the entire tail
* as lost. Frames before the first bad frame are kept.
*/
export function parseBuffer(
buf: Buffer,
{ onCorrupt = 'resync' }: { onCorrupt?: 'resync' | 'strict' } = {},
): ParseResult {
const frames: Frame[] = [];
const corruptRanges: [number, number][] = [];
let pos = 0;
while (pos < buf.length) {
const r = readFrameAt(buf, pos);
if (r) {
frames.push(r.frame);
pos += r.frameLen;
continue;
}
if (onCorrupt === 'strict') {
corruptRanges.push([pos, buf.length]);
break;
}
// Resync: scan forward for the next frame that validates.
const badStart = pos;
let resume = -1;
let scan = pos + 1;
while (scan < buf.length - 1) {
scan = buf.indexOf(MAGIC, scan);
if (scan === -1) break;
if (readFrameAt(buf, scan)) {
resume = scan;
break;
}
scan++;
}
corruptRanges.push([badStart, resume === -1 ? buf.length : resume]);
if (resume === -1) break;
pos = resume;
}
return { frames, corruptRanges, eofOffset: pos };
}
|