mirror of
https://github.com/qybaihe/bla.git
synced 2026-11-20 08:20:59 +08:00
perf(native): validate ELF64 section overlap with one sorted sweep (#187)
This commit is contained in:
@@ -308,21 +308,20 @@ export function validateElf64Layout(bytes: Buffer): Elf64LayoutSummary {
|
||||
});
|
||||
}
|
||||
|
||||
// Verify no two non-empty file-backed sections overlap in file range
|
||||
const fileBackedSections = sectionHeaders.filter(
|
||||
(sec) => sec.index >= 1 && sec.type !== 0 && sec.type !== 8 && sec.size > 0,
|
||||
);
|
||||
for (let i = 0; i < fileBackedSections.length; i++) {
|
||||
const a = fileBackedSections[i]!;
|
||||
const aEnd = a.offset + a.size;
|
||||
for (let j = i + 1; j < fileBackedSections.length; j++) {
|
||||
const b = fileBackedSections[j]!;
|
||||
const bEnd = b.offset + b.size;
|
||||
if (a.offset < bEnd && b.offset < aEnd) {
|
||||
throw new InvalidNativeBinaryError(
|
||||
`ELF64 sections ${a.index} and ${b.index} have overlapping file ranges`,
|
||||
);
|
||||
}
|
||||
// Verify no two non-empty file-backed sections overlap in file range.
|
||||
// Sort once and compare neighbours: the previous pairwise scan was O(n^2)
|
||||
// and kept a max-section-count ELF (~65k sections) busy for ~18s per call,
|
||||
// and validateElf64Layout runs several times per protection pass.
|
||||
const fileBackedSections = sectionHeaders
|
||||
.filter((sec) => sec.index >= 1 && sec.type !== 0 && sec.type !== 8 && sec.size > 0)
|
||||
.sort((a, b) => a.offset - b.offset || a.size - b.size);
|
||||
for (let i = 1; i < fileBackedSections.length; i++) {
|
||||
const prev = fileBackedSections[i - 1]!;
|
||||
const cur = fileBackedSections[i]!;
|
||||
if (prev.offset + prev.size > cur.offset) {
|
||||
throw new InvalidNativeBinaryError(
|
||||
`ELF64 sections ${prev.index} and ${cur.index} have overlapping file ranges`,
|
||||
);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,69 @@
|
||||
import { describe, expect, it } from "vitest";
|
||||
import { validateElf64Layout } from "../src/shields/formats/native.js";
|
||||
|
||||
const SHENT = 64;
|
||||
|
||||
interface ElfOptions {
|
||||
readonly sectionCount: number;
|
||||
/** Optional 1-based section index pair that will be given identical file ranges. */
|
||||
readonly overlap?: readonly [number, number];
|
||||
}
|
||||
|
||||
/** Minimal but structurally consistent ELF64 (ET_EXEC, no program headers). */
|
||||
function buildElf64(options: ElfOptions): Buffer {
|
||||
const shoff = 64;
|
||||
const shTableEnd = shoff + options.sectionCount * SHENT;
|
||||
const dataBytes = options.sectionCount; // one byte per file-backed section
|
||||
const total = shTableEnd + dataBytes;
|
||||
const b = Buffer.alloc(total, 0);
|
||||
|
||||
b.write("\u007fELF", 0, "latin1");
|
||||
b[4] = 2; // 64-bit
|
||||
b[5] = 1; // little endian
|
||||
b[6] = 1; // EV_CURRENT
|
||||
b.writeUInt16LE(2, 16); // e_type = ET_EXEC
|
||||
b.writeUInt16LE(62, 18); // e_machine = x86-64
|
||||
b.writeUInt32LE(1, 20); // e_version
|
||||
b.writeBigUInt64LE(0n, 24); // e_entry
|
||||
b.writeBigUInt64LE(0n, 32); // e_phoff
|
||||
b.writeBigUInt64LE(BigInt(shoff), 40); // e_shoff
|
||||
b.writeUInt16LE(64, 52); // e_ehsize
|
||||
b.writeUInt16LE(56, 54); // e_phentsize
|
||||
b.writeUInt16LE(0, 56); // e_phnum
|
||||
b.writeUInt16LE(SHENT, 58); // e_shentsize
|
||||
b.writeUInt16LE(options.sectionCount, 60); // e_shnum
|
||||
b.writeUInt16LE(0, 62); // e_shstrndx
|
||||
|
||||
for (let s = 1; s < options.sectionCount; s++) {
|
||||
const off = shoff + s * SHENT;
|
||||
const isOverlapLower = options.overlap !== undefined && s === options.overlap[0];
|
||||
const isOverlapUpper = options.overlap !== undefined && s === options.overlap[1];
|
||||
b.writeUInt32LE(s, off); // sh_name
|
||||
b.writeUInt32LE(1, off + 4); // sh_type = PROGBITS
|
||||
b.writeBigUInt64LE(BigInt(shTableEnd + (s - 1)), off + 24); // sh_offset
|
||||
b.writeBigUInt64LE(1n, off + 32); // sh_size
|
||||
if (isOverlapLower || isOverlapUpper) {
|
||||
// Both members of the pair share one file range.
|
||||
b.writeBigUInt64LE(BigInt(shTableEnd), off + 24);
|
||||
b.writeBigUInt64LE(1n, off + 32);
|
||||
}
|
||||
}
|
||||
return b;
|
||||
}
|
||||
|
||||
describe("ELF64 section-overlap validation", () => {
|
||||
it("handles a maximum-section-count file without quadratic work", () => {
|
||||
const elf = buildElf64({ sectionCount: 65_535 });
|
||||
const started = Date.now();
|
||||
const layout = validateElf64Layout(elf);
|
||||
const elapsed = Date.now() - started;
|
||||
|
||||
expect(layout.sectionHeaders).toHaveLength(65_535);
|
||||
expect(elapsed).toBeLessThan(10_000);
|
||||
});
|
||||
|
||||
it("still refuses overlapping file-backed sections", () => {
|
||||
const elf = buildElf64({ sectionCount: 64, overlap: [3, 7] });
|
||||
expect(() => validateElf64Layout(elf)).toThrow(/have overlapping file ranges/);
|
||||
});
|
||||
});
|
||||
Reference in New Issue
Block a user