mirror of
https://github.com/morluto/rea.git
synced 2026-11-08 15:56:35 +00:00
* fix(reference): report entries beyond the path limit as I/O failures Reference-source traversal joins each child onto the root path. A valid tree whose nested entries exceed the platform's absolute path limit (PATH_MAX 1024 on macOS) makes lstat fail with ENAMETOOLONG. The reader's filesystem error allow-list lacked that code, so filesystemFailureDetail returned undefined and the native rejection escaped both readReferenceSource and importReferenceSource instead of becoming the existing failed `io` entry. Add ENAMETOOLONG to the allow-list, matching the JavaScript application reader's list. Readable siblings stay in the graph and the unreachable entry is recorded with its OS message. Fixes #2652 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * test(reference): assert the imported graph keeps readable and failed entries Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * fix(process): report no remaining time after a provider deadline fires Node timers can fire while performance.now() is still a fraction of a millisecond short of the monotonic deadline. ProviderStartupDeadline then reported interruption "timeout" and an aborted signal while remainingMs() returned ceil(0.x) = 1, so polling loops guarded by remainingMs() > 0 (Hopper and Ghidra startup) could run past an elapsed deadline, and the real-timer test "aborts a bounded wait when its real monotonic deadline expires" failed intermittently in CI (expected 1 to be 0). Once the deadline's own timer has classified a timeout, report zero remaining time. A deterministic regression test fires the timer with the monotonic clock 0.4 ms short of the deadline. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> * fix(reference): preserve path limit entry uncertainty * fix(reference): preserve unknown entry failures and identity * fix(reference): type unknown-kind exclusions and keep them out of symlink counts The metadata-failure path offers "unknown" to exclusion predicates, but the predicate type only admitted concrete kinds, which broke the build. Directory-only secret and ignore rules now also match an unknown-kind entry (it may be a directory), and the summary counts unknown entries separately instead of as symlinks. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com> Co-authored-by: morluto <76467478+morluto@users.noreply.github.com> Co-authored-by: Codex <codex@users.noreply.github.com>
96 lines
2.7 KiB
TypeScript
96 lines
2.7 KiB
TypeScript
import {
|
|
createHistoricalSourceManifest,
|
|
type HistoricalSourceGraph,
|
|
} from "./referenceSourceGraph.js";
|
|
|
|
type Entry = HistoricalSourceGraph["entries"][number];
|
|
|
|
const outlineEntry = (entry: Entry) => {
|
|
if (entry.kind !== "file") return entry;
|
|
return {
|
|
path: entry.path,
|
|
kind: entry.kind,
|
|
language: entry.language,
|
|
size: entry.size,
|
|
content_state: entry.content_state,
|
|
classifications: entry.classifications,
|
|
limitations: entry.limitations,
|
|
};
|
|
};
|
|
|
|
/** Project one committed inventory without rereading or reinterpreting source. */
|
|
export const createHistoricalSourceSummary = (
|
|
graph: HistoricalSourceGraph,
|
|
outlineDepth: number,
|
|
) => {
|
|
const manifest = createHistoricalSourceManifest(graph);
|
|
const counts = {
|
|
entries: graph.entries.length,
|
|
files: 0,
|
|
directories: 0,
|
|
symlinks: 0,
|
|
unknown: 0,
|
|
relationships: graph.relationships.length,
|
|
parse_failures: graph.parse_failures.length,
|
|
exclusions: graph.exclusions.length,
|
|
};
|
|
const contentStates = {
|
|
hashed: 0,
|
|
"redacted-secret": 0,
|
|
excluded: 0,
|
|
unreadable: 0,
|
|
unknown: 0,
|
|
};
|
|
const treeStates = {
|
|
enumerated: 0,
|
|
partial: 0,
|
|
excluded: 0,
|
|
unreadable: 0,
|
|
unknown: 0,
|
|
};
|
|
let knownBytes = 0n;
|
|
let unknownSizeFiles = 0;
|
|
const outline: ReturnType<typeof outlineEntry>[] = [];
|
|
for (const entry of graph.entries) {
|
|
if (entry.kind === "file") {
|
|
counts.files += 1;
|
|
contentStates[entry.content_state] += 1;
|
|
if (entry.size === null) unknownSizeFiles += 1;
|
|
else knownBytes += BigInt(entry.size);
|
|
} else if (entry.kind === "directory") {
|
|
counts.directories += 1;
|
|
treeStates[entry.tree_state] += 1;
|
|
} else if (entry.kind === "symlink") counts.symlinks += 1;
|
|
else counts.unknown += 1;
|
|
// Canonical entries already use Unicode code-point order; filtering preserves it.
|
|
if (entry.path.split("/").length <= outlineDepth)
|
|
outline.push(outlineEntry(entry));
|
|
}
|
|
return {
|
|
schema: "HistoricalSourceSummary" as const,
|
|
authority: graph.authority,
|
|
root_alias: graph.root_alias,
|
|
manifest,
|
|
inventory_state: graph.inventory_state,
|
|
provenance: graph.provenance,
|
|
vcs: graph.vcs,
|
|
languages: graph.languages,
|
|
manifests: graph.manifests,
|
|
counts,
|
|
file_content_states: contentStates,
|
|
directory_tree_states: treeStates,
|
|
file_sizes: {
|
|
// Decimal text keeps large totals exact; this covers only known inventoried sizes.
|
|
known_bytes: knownBytes.toString(),
|
|
unknown_file_count: unknownSizeFiles,
|
|
},
|
|
exclusions: graph.exclusions,
|
|
limitations: graph.limitations,
|
|
outline: {
|
|
depth: outlineDepth,
|
|
entries: outline,
|
|
omitted_entry_count: graph.entries.length - outline.length,
|
|
},
|
|
};
|
|
};
|