mirror of
https://github.com/morluto/rea.git
synced 2026-11-16 19:53:50 +00:00
* fix(elf): keep compressed storage out of decoded metadata facts * fix(elf): admit compressed string tables the profile does not read SHF_COMPRESSED string tables are rejected only when they name sections or symbols. An unreferenced string table is not decoded, so it no longer makes an otherwise analyzable ELF unsupported. * fix(elf): keep requirement names when verdef declares no entries A compressed GNU version-definition section with sh_info 0 has no definitions to decode. Skipping it leaves requirement names in place instead of clearing them as an unread compressed table. * fix(elf): skip empty version requirements before storage reads * fix(elf): skip empty compressed version-requirement tables A GNU verneed section with sh_info 0 has no requirement records. Reading its compressed bytes was a version failure and partial coverage; the declared count now skips that read. * fix(mips): distinguish compressed metadata storage (#9959) * fix(elf): note a missing symbol table only when a relocation needs it A sectionless image with direct DT_INIT and DT_FINI no longer becomes incomplete solely because DT_SYMTAB does not match a decoded table. The same note remains when a dynamic relocation asks for a symbol. --------- Co-authored-by: Cursor Agent <cursoragent@cursor.com>
93 lines
2.7 KiB
TypeScript
93 lines
2.7 KiB
TypeScript
import { expect, it } from "vitest";
|
|
import { readElfSectionHeader } from "./elfSectionHeader.js";
|
|
|
|
const formats = [
|
|
{ bits: 32, littleEndian: false },
|
|
{ bits: 32, littleEndian: true },
|
|
{ bits: 64, littleEndian: false },
|
|
{ bits: 64, littleEndian: true },
|
|
] as const;
|
|
|
|
it.each(formats)(
|
|
"preserves exact ELF$bits section and section-zero fields (littleEndian=$littleEndian)",
|
|
({ bits, littleEndian }) => {
|
|
const wide = bits === 64;
|
|
const length = wide ? 64 : 40;
|
|
const backing = Buffer.alloc(length + 19, 0xa5);
|
|
const bytes = backing.subarray(7, 7 + length);
|
|
const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
|
|
const values = wide
|
|
? [
|
|
0xffffffffffffffffn,
|
|
0xfedcba9876543210n,
|
|
0x8000000000000001n,
|
|
0x123456789abcdef0n,
|
|
0x8888888888888888n,
|
|
0x7777777777777777n,
|
|
]
|
|
: [
|
|
0xffffffffn,
|
|
0xfedcba98n,
|
|
0x80000001n,
|
|
0x12345678n,
|
|
0x88888888n,
|
|
0x77777777n,
|
|
];
|
|
view.setUint32(0, 0xfedcba98, littleEndian);
|
|
view.setUint32(4, 0x89abcdef, littleEndian);
|
|
view.setUint32(wide ? 40 : 24, 0xffffffff, littleEndian);
|
|
view.setUint32(wide ? 44 : 28, 0x80000001, littleEndian);
|
|
const offsets = wide ? [8, 16, 24, 32, 48, 56] : [8, 12, 16, 20, 32, 36];
|
|
values.forEach((value, index) => {
|
|
if (wide) view.setBigUint64(offsets[index]!, value, littleEndian);
|
|
else view.setUint32(offsets[index]!, Number(value), littleEndian);
|
|
});
|
|
const before = Buffer.from(backing);
|
|
const parsed = readElfSectionHeader(
|
|
backing.subarray(7),
|
|
bits,
|
|
littleEndian,
|
|
);
|
|
expect(backing.equals(before)).toBe(true);
|
|
backing.fill(0);
|
|
expect(parsed).toEqual({
|
|
ok: true,
|
|
value: {
|
|
nameOffset: 0xfedcba98,
|
|
type: 0x89abcdef,
|
|
flags: values[0],
|
|
compressed: true,
|
|
address: values[1],
|
|
offset: values[2],
|
|
size: values[3],
|
|
link: 0xffffffff,
|
|
info: 0x80000001,
|
|
alignment: values[4],
|
|
entrySize: values[5],
|
|
},
|
|
});
|
|
},
|
|
);
|
|
|
|
it.each(formats)(
|
|
"refuses each incomplete ELF$bits section (littleEndian=$littleEndian)",
|
|
({ bits, littleEndian }) => {
|
|
const length = bits === 64 ? 64 : 40;
|
|
const backing = Buffer.alloc(length + 7);
|
|
for (let observed = 0; observed < length; observed++)
|
|
expect(
|
|
readElfSectionHeader(
|
|
backing.subarray(7, 7 + observed),
|
|
bits,
|
|
littleEndian,
|
|
),
|
|
).toEqual({
|
|
ok: false,
|
|
error: {
|
|
kind: "malformed",
|
|
message: expect.stringContaining("truncated"),
|
|
},
|
|
});
|
|
},
|
|
);
|