mirror of
https://github.com/morluto/rea.git
synced 2026-11-14 10:43:30 +00:00
morluto
5044e20171
* test: focus configuration diagnostics on their owners Preserve shape errors, selected paths, recovery guidance, and unchanged-file behavior across parser, setup, and uninstall boundaries. * test: focus artifact and evidence checks on behavior Retain format, identity, malformed-input, and cleanup coverage while removing fixed prose and closing the admitted test source. * refactor(debugger): use configured session admission limits * test: focus evidence and diagnostics on behavior * fix(test): restore verifier export and formatting * test(config): verify debugger limit ranges * test(rizin): keep fixture executable authoritative * test(rizin): isolate debugger fixture environment
93 lines
3.3 KiB
TypeScript
93 lines
3.3 KiB
TypeScript
import { expect, it } from "vitest";
|
|
import {
|
|
readElfGnuHashSymbolCount,
|
|
readElfHashSymbolCount,
|
|
type ElfGnuHashCountWalk,
|
|
type ElfHashWordReader,
|
|
} from "./elfHashSymbolCount.js";
|
|
import { err, ok } from "./result.js";
|
|
|
|
const words =
|
|
(values: readonly number[]): ElfHashWordReader =>
|
|
(offset) => {
|
|
const value = values[offset / 4];
|
|
return value === undefined ? err("is outside the image") : ok(value);
|
|
};
|
|
|
|
const finish = (walk: ElfGnuHashCountWalk) => {
|
|
for (let step = walk.next(); ; step = walk.next())
|
|
if (step.done === true) return step.value;
|
|
};
|
|
|
|
/** nbuckets, symoffset, bloom words, shift, one 8-byte bloom word, buckets, chain. */
|
|
const gnuTable = (
|
|
buckets: readonly number[],
|
|
chain: readonly number[],
|
|
firstSymbol = 2,
|
|
) => [buckets.length, firstSymbol, 1, 0, 0, 0, ...buckets, ...chain];
|
|
|
|
it("reads nchain from a complete DT_HASH table", () => {
|
|
expect(readElfHashSymbolCount(words([1, 3, 0, 0, 0, 0]))).toEqual(ok(3));
|
|
expect(readElfHashSymbolCount(words([1]))).toEqual(
|
|
err({
|
|
kind: "malformed",
|
|
message: expect.stringMatching(/DT_HASH header.*outside/iu),
|
|
}),
|
|
);
|
|
expect(readElfHashSymbolCount(words([1, 3, 0]))).toEqual(
|
|
err({
|
|
kind: "malformed",
|
|
message: expect.stringMatching(/DT_HASH table.*outside/iu),
|
|
}),
|
|
);
|
|
expect(readElfHashSymbolCount(words([1, 9]), 8)).toEqual(
|
|
err({ kind: "budget", label: "DT_HASH symbol table", count: 9 }),
|
|
);
|
|
});
|
|
|
|
it("follows the last DT_GNU_HASH chain to its end", () => {
|
|
expect(
|
|
finish(readElfGnuHashSymbolCount(words(gnuTable([2, 3], [0, 0, 1])), 8)),
|
|
).toEqual(ok(5));
|
|
expect(
|
|
finish(readElfGnuHashSymbolCount(words(gnuTable([0], [])), 8)),
|
|
).toEqual(ok(null));
|
|
const narrow = [1, 1, 1, 0, 0, 1, 1];
|
|
expect(finish(readElfGnuHashSymbolCount(words(narrow), 4))).toEqual(ok(2));
|
|
});
|
|
|
|
it("rejects DT_GNU_HASH tables that do not describe a chain", () => {
|
|
const malformed = (values: readonly number[], reason: RegExp) =>
|
|
expect(finish(readElfGnuHashSymbolCount(words(values), 8))).toEqual(
|
|
err({ kind: "malformed", message: expect.stringMatching(reason) }),
|
|
);
|
|
malformed([1, 2, 1], /header.*outside/iu);
|
|
malformed([0, 2, 1, 0], /buckets.*malformed/iu);
|
|
malformed([1, 2, 0, 0], /buckets.*malformed/iu);
|
|
malformed([1, 2, 1, 0, 0, 0], /buckets.*outside/iu);
|
|
malformed(gnuTable([1], [1]), /bucket.*precedes.*symbol/iu);
|
|
malformed(gnuTable([2], [0]), /chain.*outside/iu);
|
|
});
|
|
|
|
it("applies a caller budget before walking each table", () => {
|
|
const budget = (values: readonly number[], maximum: number) =>
|
|
finish(readElfGnuHashSymbolCount(words(values), 8, maximum));
|
|
expect(budget([9, 0, 1, 0], 8)).toEqual(
|
|
err({ kind: "budget", label: "DT_GNU_HASH bucket table", count: 9 }),
|
|
);
|
|
expect(budget([1, 0, 9, 0], 8)).toEqual(
|
|
err({ kind: "budget", label: "DT_GNU_HASH bloom filter", count: 9 }),
|
|
);
|
|
expect(budget([1, 9, 1, 0], 8)).toEqual(
|
|
err({ kind: "budget", label: "DT_GNU_HASH symbol index", count: 9 }),
|
|
);
|
|
expect(budget(gnuTable([2], [0, 0, 0, 1]), 3)).toEqual(
|
|
err({ kind: "budget", label: "DT_GNU_HASH symbol table", count: 4 }),
|
|
);
|
|
});
|
|
|
|
it("yields between bounded steps so a driver can stop a long walk", () => {
|
|
const walk = readElfGnuHashSymbolCount(words(gnuTable([2], [1])), 8);
|
|
expect(walk.next().done).toBe(false);
|
|
});
|