From 3567e02fb0e8b978d770711e9df3e3db56b45d3c Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 16:30:09 +0000 Subject: [PATCH 01/16] An occurrence that survives the front end, and an ingest-wide index to join it to a file A fatal diagnostic on the native compile path now names the file and byte range it happened at, instead of a node nobody can find. Two independent defects had to be fixed, and either one alone leaves the line unchanged: 1. The front end DROPPED the occurrence. Measured on the specimen, parse stamps 91/125 nodes but normalize emerged with 1/12 -- sugar lowering and the namespace graft built their output with node_synthetic, so the node a diagnostic anchors on carried no identity to look up. These are carried-forward nodes in the SAME allocator scope, not cross-graph projections, so they take their source's occurrence outright (node_lowered_from); std.occurrence_identity says so directly -- "a carried-forward node gets no arm here". Producer-own marker atoms stay OccurrenceSynthetic: they stand for no authored text, and giving them a span would be a guess. 2. program_assembly could not JOIN an occurrence to a file. It dropped each file's SpanIndex before normalize and reset the allocator per file, so two files both minted occurrence #N. The fold now threads the allocator across reads and merges the per-file indices into one. The order matters: merging without seeding is the silent-wrongness arm -- file B's node resolving to a byte range in file A. occurrence_identity_scope_law already forbade the per-file reset. The index rides BESIDE the outcome (IngestAssembly, CompilerClosureEmitLocated) because a diagnostic needs its file exactly when the program did not assemble, and Outcome's Rejected arm carries no value. Census, from the same instrument before and after: normalize 1/12 -> 10/12 minted, resolve 1/12 -> 10/12; the 2 remaining are the producer markers, and all 10 links of the specimen's diagnostic chain now resolve. Co-Authored-By: Claude Opus 5 (1M context) --- fixtures/native_cli_door/door_probe.dag | 5 + src/v2/cli/compile_cli.dag | 17 +- src/v2/compiler/02_parse.dag | 85 +++++- src/v2/compiler/body_lowering_fold.dag | 68 +++-- src/v2/compiler/namespace_graft.dag | 35 ++- src/v2/compiler/program_assembly.dag | 191 ++++++++++++-- .../self_host/compiler_closure_emit.dag | 42 ++- src/v2/std/lens_verdict.dag | 53 ++++ src/v2/std/node.dag | 23 ++ src/v2/std/provenance.dag | 19 +- .../occurrence_file_attribution_test.dag | 246 ++++++++++++++++++ 11 files changed, 707 insertions(+), 77 deletions(-) create mode 100644 fixtures/native_cli_door/door_probe.dag create mode 100644 src/v2/test/claim/provenance/occurrence_file_attribution_test.dag diff --git a/fixtures/native_cli_door/door_probe.dag b/fixtures/native_cli_door/door_probe.dag new file mode 100644 index 00000000000..375317ea99d --- /dev/null +++ b/fixtures/native_cli_door/door_probe.dag @@ -0,0 +1,5 @@ +module fixture.native_cli_door.door_probe + +import v2.std.logic { Bool } + +fn door_probe_fn() -> Bool { true } diff --git a/src/v2/cli/compile_cli.dag b/src/v2/cli/compile_cli.dag index 26b0a9736b8..36ca673d3f8 100644 --- a/src/v2/cli/compile_cli.dag +++ b/src/v2/cli/compile_cli.dag @@ -5,14 +5,14 @@ import std.process { ExitSuccess, ProcessExit, exit_failure } import std.algebra { Cons, Empty, FreeMonoid } import v2.compiler.name_resolve { Admission, ResolutionSubject } import v2.compiler.self_host.compiler_closure_emit { - emit_compiler_import_closure_from_ingest + emit_compiler_import_closure_from_ingest_located } import v2.compiler.source_authority { SourceRootIngest } import v2.extdeps.languages.rust { rust_target_model } import v2.std.algebra { fold_list, length, list_reverse } import v2.std.compilers.lexing { symbol_lexeme } import v2.std.diagnostic { Accepted, Diagnostic, NonEmptyDiagnostics, Rejected } -import v2.std.lens_verdict { lens_verdict_diagnostic_locus_text } +import v2.std.lens_verdict { lens_verdict_diagnostic_locus_text_located } import v2.std.node { Symbol } import v2.std.qualified_name { qualified_name_from_dotted_string } import v2.std.text { String } @@ -301,11 +301,12 @@ fn v2_cli_run(plan: CliPlan, ingest: SourceRootIngest) -> CliRunOutcome { detail: "the source roots walked to zero .dag files; an empty closure is not an empty program" } } else { - match emit_compiler_import_closure_from_ingest( + let emitted = emit_compiler_import_closure_from_ingest_located( ingest: ingest, admission: v2_cli_closure_admission(entry: entry), target: rust_target_model() - ) { + ) + match emitted.outcome { Accepted { value: receipt, diagnostics: _ } => CliEmitted { text: receipt.source.carried, @@ -318,7 +319,13 @@ fn v2_cli_run(plan: CliPlan, ingest: SourceRootIngest) -> CliRunOutcome { reason: d.head.reason, detail: concat( concat("the closure did not emit; diagnostic chain: ", cli_diagnostic_chain(d: d)), - concat(" | FATAL AT ", lens_verdict_diagnostic_locus_text(d: cli_fatal_diagnostic(d: d))) + concat( + " | FATAL AT ", + lens_verdict_diagnostic_locus_text_located( + d: cli_fatal_diagnostic(d: d), + index: emitted.spans + ) + ) ) } } diff --git a/src/v2/compiler/02_parse.dag b/src/v2/compiler/02_parse.dag index b1bb04424e3..9756b80228f 100644 --- a/src/v2/compiler/02_parse.dag +++ b/src/v2/compiler/02_parse.dag @@ -165,9 +165,25 @@ type ParseProvenanceState { frame: List } +// THE ALLOCATOR RIDES BESIDE THE INDEX BECAUSE THEY ARE ONE FACT. `span_index` says where each +// occurrence this parse minted came from; `alloc` says which ids this parse consumed, so the NEXT +// parse in the same source graph can continue rather than restart. `std.occurrence_identity` +// `occurrence_identity_scope_law` names "module-local allocator reset" a FORBIDDEN identity input +// and requires that "a production source graph threads one allocator across every parsed source" -- +// a per-file reset makes two files' occurrence #3 the same value with different meanings, which is +// the meaning fork of DESIGN section 3 at the identity layer, and it is what makes the ingest-wide +// span index unbuildable: merging two files' indices would silently take one file's locus for the +// other file's node. Carrying the high-water mark here is what lets the assembly fold seed each +// file from the previous file's next id, so an occurrence id is unique across the whole ingest and +// the join from a node to its file is a LOOKUP. +// +// A STANDALONE PARSE IS STILL AN ISOLATED SCOPE, which the same law admits: the unseeded entry +// points below are projections that pass `occurrence_id_allocator_initial()`, so a caller that +// parses one file alone is unchanged, and only a caller assembling a source GRAPH threads the mark. type ParseArtifact { tree: ParseTree span_index: v2.std.provenance.SpanIndex + alloc: OccurrenceIdAllocator } data authored_parse_artifact_note: String = "The parse-layer twin of LexArtifact: the semantic parse result PLUS what the annotation channel captured, now bound to subjects. `authored_parse_semantic` is the erasure boundary — a consumer projecting through it sees exactly the ParseArtifact it saw before this channel existed, which is what lets every existing semantic consumer stay untouched while annotation-aware machinery reads the whole thing. @@ -754,14 +770,18 @@ fn parse_non_empty_diagnostics_to_list(ned: NonEmptyDiagnostics) -> List ParseProvenanceState { +fn parse_prov_seeded(seed: OccurrenceIdAllocator) -> ParseProvenanceState { ParseProvenanceState { - alloc: occurrence_id_allocator_initial(), + alloc: seed, index: span_index_empty(), frame: Empty } } +fn parse_prov_initial() -> ParseProvenanceState { + parse_prov_seeded(seed: occurrence_id_allocator_initial()) +} + fn parse_prov_replay_frame( base: v2.std.provenance.SpanIndex, incoming: v2.std.provenance.SpanIndex, @@ -3539,11 +3559,27 @@ fn parse_production_prepared_measured( validated: ValidatedGrammarRoot, analysis: GrammarFirstAnalysis, production_name: Symbol +) -> ParseProductionMeasured { + parse_production_prepared_measured_seeded( + tokens: tokens, + validated: validated, + analysis: analysis, + production_name: production_name, + seed: occurrence_id_allocator_initial() + ) +} + +fn parse_production_prepared_measured_seeded( + tokens: List, + validated: ValidatedGrammarRoot, + analysis: GrammarFirstAnalysis, + production_name: Symbol, + seed: OccurrenceIdAllocator ) -> ParseProductionMeasured { let root = validated.root match grammar_lookup_production(root: root, name: production_name) { Holds { value: production } => - let prov = parse_prov_initial() + let prov = parse_prov_seeded(seed: seed) let table = parse_table_for_production_analyzed(validated: validated, analysis: analysis, all_tokens: tokens) match parse_expr( expr: production.expression, @@ -3562,7 +3598,7 @@ fn parse_production_prepared_measured( ) ParseProductionMeasured { outcome: Accepted { - value: ParseArtifact { tree: stamped.node, span_index: stamped.prov.index }, + value: ParseArtifact { tree: stamped.node, span_index: stamped.prov.index, alloc: stamped.prov.alloc }, diagnostics: parse_diags_to_diagnostics(diags: diags) }, memo: parse_table_memo_stats(table: final_table) @@ -3674,6 +3710,20 @@ fn parse_module_prepared( ).outcome } +fn parse_module_prepared_seeded( + tokens: TokenStream, + prepared: PreparedGrammar, + validation_residue: Diagnostics, + seed: OccurrenceIdAllocator +) -> Outcome { + parse_module_prepared_measured_seeded( + tokens: tokens, + prepared: prepared, + validation_residue: validation_residue, + seed: seed + ).outcome +} + // A VOID GRAMMAR CONSULTS NO MEMO, so its accounting is empty rather than absent: the counters are // zero because nothing was looked up, which is an answer. Reporting no stats at all would make a // void parse indistinguishable from a parse whose stats were dropped. @@ -3681,6 +3731,26 @@ fn parse_module_prepared_measured( tokens: TokenStream, prepared: PreparedGrammar, validation_residue: Diagnostics +) -> ParseProductionMeasured { + parse_module_prepared_measured_seeded( + tokens: tokens, + prepared: prepared, + validation_residue: validation_residue, + seed: occurrence_id_allocator_initial() + ) +} + +// THE SEEDED DOOR, WHICH IS THE ONE AN INGEST USES. `seed` is the allocator the PREVIOUS file in +// the same source graph left behind, so this file's occurrence ids continue where that one stopped +// and no two files in one ingest mint the same id. The returned artifact carries the mark this +// parse reached, which is what lets the assembly fold thread it to the next read. The unseeded +// projection above is every other caller: one file, its own isolated scope, byte-identical to the +// fold it was before this parameter existed. +fn parse_module_prepared_measured_seeded( + tokens: TokenStream, + prepared: PreparedGrammar, + validation_residue: Diagnostics, + seed: OccurrenceIdAllocator ) -> ParseProductionMeasured { let ntok = token_stream_remaining_count(stream: tokens) match prepared { @@ -3688,7 +3758,7 @@ fn parse_module_prepared_measured( if ntok == 0 { ParseProductionMeasured { outcome: Accepted { - value: ParseArtifact { tree: grammar_to_node(grammar: VoidGrammar), span_index: span_index_empty() }, + value: ParseArtifact { tree: grammar_to_node(grammar: VoidGrammar), span_index: span_index_empty(), alloc: seed }, diagnostics: validation_residue }, memo: parse_memo_stats_empty() @@ -3704,11 +3774,12 @@ fn parse_module_prepared_measured( } } PreparedModeled { modeled: modeled } => - let measured = parse_production_prepared_measured( + let measured = parse_production_prepared_measured_seeded( tokens: token_stream_remaining(stream: tokens), validated: modeled.validated, analysis: modeled.analysis, - production_name: modeled.validated.root.start + production_name: modeled.validated.root.start, + seed: seed ) match measured.outcome { Accepted { value: artifact, diagnostics: parse_diags } => diff --git a/src/v2/compiler/body_lowering_fold.dag b/src/v2/compiler/body_lowering_fold.dag index 81a9e1b5196..362eb68d73c 100644 --- a/src/v2/compiler/body_lowering_fold.dag +++ b/src/v2/compiler/body_lowering_fold.dag @@ -93,6 +93,7 @@ import v2.std.node { is_empty_conj_root, match_arm_body, match_arm_pattern, + node_lowered_from, node_rebuild, node_synthetic, node_with_occurrence_id @@ -359,10 +360,18 @@ fn body_lower_resolved_type_binding(sym: Symbol) -> Symbol { } } -fn body_lower_type_atom_node(sym: Symbol) -> Node { - node_synthetic( +// THE SOURCE IS THE AUTHORED TYPE NAME, and it is a parameter rather than an omission. This atom is +// the lowered form of a type the author wrote -- `Bool` in `fn f() -> Bool` -- so it stands at that +// text's position and keeps that text's occurrence. Built synthetic, it was a node an +// `infer_grounding_not_derived` diagnostic anchors on with no occurrence to look up, which is how a +// fatal ends up naming no file at all. Every caller already holds the node it read the symbol from, +// so the source is supplied rather than searched for -- searching the tree for an equal node would +// be the plausible guess DESIGN section 5 forbids. +fn body_lower_type_atom_node(sym: Symbol, source: Node) -> Node { + node_lowered_from( kind: TypeNode { connective: Atom { identity: body_lower_resolved_type_binding(sym: sym) } }, - children: [] + children: [], + source: source ) } @@ -839,9 +848,10 @@ fn body_lower_operator_atom_optional(node: Node) -> Optional { optional_absent() } else if dag_lex_token_symbol(sym: id) && !body_lower_is_block_delimiter_token(id: id) { optional_present( - value: node_synthetic( + value: node_lowered_from( kind: TypeNode { connective: Atom { identity: id } }, - children: [] + children: [], + source: node ) ) } else { @@ -1070,7 +1080,7 @@ fn body_lower_type_atom_from_expr(node: Node) -> Optional { Present { value: captured } => match node_atom_identity_optional(node: captured) { Present { value: sym } => - optional_present(value: body_lower_type_atom_node(sym: sym)) + optional_present(value: body_lower_type_atom_node(sym: sym, source: captured)) Absent => match body_lower_qualified_name_production_spine_optional(node: node, captured: captured) { Present { value: spine } => Present { value: spine } @@ -1085,14 +1095,14 @@ fn body_lower_type_atom_from_expr(node: Node) -> Optional { Absent => match dag_binding_branded_atom_identity(node: node) { Present { value: binding } => - Present { value: body_lower_type_atom_node(sym: binding) } + Present { value: body_lower_type_atom_node(sym: binding, source: node) } Absent => match node_atom_identity_optional(node: node) { Present { value: sym } => if dag_lex_token_symbol(sym: sym) { optional_absent() } else { - optional_present(value: body_lower_type_atom_node(sym: sym)) + optional_present(value: body_lower_type_atom_node(sym: sym, source: node)) } Absent => match sugar_sequence_pair_optional(node: node) { @@ -1400,13 +1410,18 @@ fn body_lower_domain_from_param_list(param_list: Node) -> Optional { let edges = body_lower_collect_param_edges(sequence_capture: comma_spine) if count(edges) == 0 { Present { - value: node_synthetic(kind: TypeNode { connective: Conj }, children: []) + value: node_lowered_from( + kind: TypeNode { connective: Conj }, + children: [], + source: param_list + ) } } else { Present { - value: node_synthetic( + value: node_lowered_from( kind: TypeNode { connective: Conj }, - children: edges + children: edges, + source: param_list ) } } @@ -2080,9 +2095,10 @@ fn body_lower_reify_transform_body(body: Node) -> Outcome { Rejected { diagnostics: r } => Rejected { diagnostics: r } Accepted { value: children, diagnostics: d } => outcome_with_diagnostics( - value: node_synthetic( + value: node_lowered_from( kind: ComputationNode { behavior: Transform }, - children: children + children: children, + source: body ), diagnostics: d ) @@ -2091,12 +2107,16 @@ fn body_lower_reify_transform_body(body: Node) -> Outcome { } } -fn body_lower_fn_decl_named_member_wrap(arrow: Node, fn_name: Symbol) -> Node { - node_synthetic( +// The wrap stands at the same authored text as the arrow it wraps -- one `fn` declaration -- so it +// takes that declaration's occurrence rather than being a fresh anonymous node between the module +// body and the arrow. +fn body_lower_fn_decl_named_member_wrap(arrow: Node, fn_name: Symbol, source: Node) -> Node { + node_lowered_from( kind: TypeNode { connective: Conj }, children: [ Edge { label: Named { name: fn_name }, target: arrow } - ] + ], + source: source ) } @@ -2169,7 +2189,8 @@ fn body_lower_fn_decl_to_arrow(shell: Node) -> Outcome { match dag_surface_kw_then_ident_from_captured(captured: captured) { Absent => body_lower_wrapper_retained_shell(shell: shell) Present { value: fn_name } => - let arrow = node_synthetic( + let arrow = node_lowered_from( + source: shell, kind: TypeNode { connective: Arrow }, children: [ Edge { label: Positional, target: domain }, @@ -2184,7 +2205,8 @@ fn body_lower_fn_decl_to_arrow(shell: Node) -> Outcome { outcome_with_diagnostics( value: body_lower_fn_decl_named_member_wrap( arrow: arrow, - fn_name: fn_name + fn_name: fn_name, + source: shell ), diagnostics: diagnostics_merge(outer: bd0, inner: bd) ) @@ -3987,7 +4009,7 @@ fn body_lower_try_let_in_from_captured(captured: Node) -> Outcome outcome_accepted( value: optional_present( value: lower_bind( - key_binding: body_lower_type_atom_node(sym: key_binding), + key_binding: body_lower_type_atom_node(sym: key_binding, source: captured), value: value, body_binding: body_ref ) @@ -3999,7 +4021,7 @@ fn body_lower_try_let_in_from_captured(captured: Node) -> Outcome outcome_accepted( value: optional_present( value: lower_bind( - key_binding: body_lower_type_atom_node(sym: key_binding), + key_binding: body_lower_type_atom_node(sym: key_binding, source: captured), value: value, body_binding: body_ref ) @@ -4016,7 +4038,7 @@ fn body_lower_try_let_in_from_captured(captured: Node) -> Outcome outcome_accepted( value: optional_present( value: lower_bind( - key_binding: body_lower_type_atom_node(sym: key_binding), + key_binding: body_lower_type_atom_node(sym: key_binding, source: captured), value: value, body_binding: body_ref ) @@ -4028,7 +4050,7 @@ fn body_lower_try_let_in_from_captured(captured: Node) -> Outcome outcome_accepted( value: optional_present( value: lower_bind( - key_binding: body_lower_type_atom_node(sym: key_binding), + key_binding: body_lower_type_atom_node(sym: key_binding, source: captured), value: value, body_binding: body_ref ) @@ -4322,7 +4344,7 @@ fn body_lower_stmt_spine(spine: Node) -> Outcome { f: fn(body) { outcome_accepted( value: lower_bind( - key_binding: body_lower_type_atom_node(sym: key), + key_binding: body_lower_type_atom_node(sym: key, source: let_captured), value: value, body_binding: body ) diff --git a/src/v2/compiler/namespace_graft.dag b/src/v2/compiler/namespace_graft.dag index d934d1a6672..6680cd87890 100644 --- a/src/v2/compiler/namespace_graft.dag +++ b/src/v2/compiler/namespace_graft.dag @@ -608,7 +608,20 @@ fn namespace_graft_subtree_count_atom(n: Node, sym: Symbol) -> Int { // The body carries its identity projection first (namespace_graft_module_body_identity): // the producer marks where the spine ends. See the reader note beside // namespace_graft_node_is_module_body in v2.extdeps.languages.dag. -fn namespace_graft_build_body_conj(edges: List) -> Node { +// THE SPINE IS THE AUTHORED MODULE HEADER RE-SHAPED, NOT NEW MATERIAL. The graft rewrites +// `module a.b.c` plus the file's declarations into a containment spine, so every node it builds -- +// the body conj and each segment wrapper -- stands for text the author wrote at a real byte range +// in a real file. Built with no occurrence, the whole module-level spine was unattributable, which +// is what made a fatal anchored anywhere above a leaf report no file at all; every one of those +// nodes now carries the occurrence of the module node it was grafted FROM. It is a carry, not an +// invention: the source is the graft's own input, so nothing is searched for and nothing is guessed. +// +// THE TWO MARKER ATOMS DELIBERATELY STAY SYNTHETIC (namespace_graft_module_body_marker_node and +// the dag_surface_module atom below). They are the producer's own marks saying where the spine ends +// and what shape it is -- they stand for no authored text, so giving them the module's occurrence +// would attribute a compiler-internal node to a span the author wrote, which is the plausible guess +// DESIGN section 5 forbids rather than a preserved fact. +fn namespace_graft_build_body_conj(edges: List, source: Node) -> Node { Node { kind: TypeNode { connective: Conj }, children: concat( @@ -620,11 +633,11 @@ fn namespace_graft_build_body_conj(edges: List) -> Node { ], edges ), - occurrence_id: OccurrenceSynthetic + occurrence_id: source.occurrence_id } } -fn namespace_graft_wrap_segment(segment: Symbol, inner: Node) -> Node { +fn namespace_graft_wrap_segment(segment: Symbol, inner: Node, source: Node) -> Node { Node { kind: TypeNode { connective: Conj }, children: [ @@ -633,16 +646,16 @@ fn namespace_graft_wrap_segment(segment: Symbol, inner: Node) -> Node { target: inner } ], - occurrence_id: OccurrenceSynthetic + occurrence_id: source.occurrence_id } } -fn namespace_graft_fold_spine(qn: QualifiedName, body: Node) -> Node { +fn namespace_graft_fold_spine(qn: QualifiedName, body: Node, source: Node) -> Node { fold_list_right( xs: qn, empty: body, snoc: fn(inner, segment) { - namespace_graft_wrap_segment(segment: segment, inner: inner) + namespace_graft_wrap_segment(segment: segment, inner: inner, source: source) } ) } @@ -655,7 +668,7 @@ fn namespace_graft_atom_node(id: Symbol) -> Node { } } -fn namespace_graft_wrap_module_shell(captured: Node) -> Node { +fn namespace_graft_wrap_module_shell(captured: Node, source: Node) -> Node { Node { kind: TypeNode { connective: Conj }, children: [ @@ -668,7 +681,7 @@ fn namespace_graft_wrap_module_shell(captured: Node) -> Node { target: captured ) ], - occurrence_id: OccurrenceSynthetic + occurrence_id: source.occurrence_id } } @@ -747,9 +760,9 @@ fn module_header_containment_graft(root: Node) -> Outcome { correction: Unavailable { reason: ExternalContractUnknown } }) } else { - let body = namespace_graft_build_body_conj(edges: graft_body.edges) - let spine = namespace_graft_fold_spine(qn: qn, body: body) - outcome_accepted(value: namespace_graft_wrap_module_shell(captured: spine)) + let body = namespace_graft_build_body_conj(edges: graft_body.edges, source: root) + let spine = namespace_graft_fold_spine(qn: qn, body: body, source: root) + outcome_accepted(value: namespace_graft_wrap_module_shell(captured: spine, source: root)) } } } diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index 6e9e16c91e8..28b97cde736 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -11,6 +11,7 @@ import v2.compiler.source_authority { import v2.compiler.tokenize { tokenize } import v2.compiler.parse { ParseArtifact, + parse_module_prepared_seeded, ParseProductionMeasured, PreparedGrammar, parse_memo_stats_empty, @@ -47,6 +48,8 @@ import v2.std.diagnostic { outcome_rejected } import v2.std.node { Node } +import v2.std.provenance { SpanIndex, span_index_empty, span_index_merge } +import std.occurrence_identity { OccurrenceIdAllocator, occurrence_id_allocator_initial } import v2.std.text { String } type ProgramAssemblyFoldState @@ -71,10 +74,28 @@ type LocatedNormalizedTree { tree: NormalizedTree } +// THE TWO PROVENANCE FIELDS ARE WHY A DIAGNOSTIC CAN NAME A FILE, and they are one fact in two +// halves. `alloc` is the occurrence-id high-water mark reached so far, so the NEXT read is parsed +// seeded from it rather than restarting at zero -- which is what makes an occurrence id unique +// across the whole ingest instead of unique only within one file. `spans` is those ids' origins +// merged into ONE index; because the ids are ingest-unique the merge cannot collide, and because +// tokenize stamps each locus with the read's own compilation unit, every entry already names its +// file. Together they turn "which file is this occurrence from" into a LOOKUP. +// +// THE ORDER OF THOSE TWO SENTENCES IS THE WHOLE DESIGN. Merging per-file indices WITHOUT seeding +// would be the silent-wrongness arm: two files both mint occurrence #3, one entry overwrites or +// shadows the other, and a node from file B resolves to a byte range in file A -- a confident, +// plausible, wrong answer, which DESIGN section 5 forbids more strongly than no answer at all. +// `std.occurrence_identity` `occurrence_identity_scope_law` already said so ("a production source +// graph threads one allocator across every parsed source"; module-local reset is a FORBIDDEN +// identity input); the fold simply stopped obeying it. Seeding is not an optimization here, it is +// the precondition that makes the merge meaningful. type ProgramAssemblyLocatedFoldState = ProgramAssemblyLocatedFoldOk { located: FreeMonoid, - index: SourceRootIndex + index: SourceRootIndex, + alloc: OccurrenceIdAllocator, + spans: SpanIndex } | ProgramAssemblyLocatedFoldFailed { diagnostics: NonEmptyDiagnostics @@ -94,7 +115,7 @@ fn program_assembly_fold_state_from_located( match state { ProgramAssemblyLocatedFoldFailed { diagnostics: d } => ProgramAssemblyFoldFailed { diagnostics: d } - ProgramAssemblyLocatedFoldOk { located: located, index: idx } => + ProgramAssemblyLocatedFoldOk { located: located, index: idx, alloc: _, spans: _ } => ProgramAssemblyFoldOk { roots: list_map(xs: located, f: fn(item) { item.tree }), index: idx @@ -228,6 +249,54 @@ fn program_assembly_phase_token_count(tokens: Outcome) -> Int { } } +// THE SEEDED PER-FILE FRONT END, WHICH IS THE ONE THE INGEST FOLD USES. It differs from the +// projection below in exactly one respect: the occurrence ids it mints continue the ingest's count +// instead of restarting, and it hands back the artifact so the fold can read the mark it reached +// and the spans it recorded. Normalize is applied to the artifact's tree, so the normalized nodes +// carry occurrence ids drawn from the SAME ingest-wide sequence the span index is keyed by -- that +// agreement is what makes the later join a lookup rather than a search. +type ProgramAssemblySeededRead { + tree: NormalizedTree, + alloc: OccurrenceIdAllocator, + spans: SpanIndex +} + +fn program_assembly_read_to_normalized_root_seeded( + read: DagSourceReadWitness, + lm: LanguageModel, + prepared: PreparedGrammar, + residue: Diagnostics, + seed: OccurrenceIdAllocator +) -> Outcome { + bind_outcome( + o: bind_outcome( + o: program_assembly_phase_tokenize(read: read, lm: lm), + f: fn(token_stream) { + parse_module_prepared_seeded( + tokens: token_stream, + prepared: prepared, + validation_residue: residue, + seed: seed + ) + } + ), + f: fn(artifact) { + bind_outcome( + o: normalize(parse_tree: artifact.tree), + f: fn(tree) { + outcome_accepted( + value: ProgramAssemblySeededRead { + tree: tree, + alloc: artifact.alloc, + spans: artifact.span_index + } + ) + } + ) + } + ) +} + fn program_assembly_read_to_normalized_root_prepared( read: DagSourceReadWitness, lm: LanguageModel, @@ -269,17 +338,25 @@ fn program_assembly_fold_step( match state { ProgramAssemblyLocatedFoldFailed { diagnostics: d } => ProgramAssemblyLocatedFoldFailed { diagnostics: d } - ProgramAssemblyLocatedFoldOk { located: acc, index: idx } => - match program_assembly_read_to_normalized_root_prepared(read: read, lm: lm, prepared: prepared, residue: residue) { - Accepted { value: root, diagnostics: _ } => - match qualified_name_from_module_node(root: root.root) { + ProgramAssemblyLocatedFoldOk { located: acc, index: idx, alloc: seed, spans: spans } => + match program_assembly_read_to_normalized_root_seeded( + read: read, + lm: lm, + prepared: prepared, + residue: residue, + seed: seed + ) { + Accepted { value: produced, diagnostics: _ } => + match qualified_name_from_module_node(root: produced.tree.root) { Accepted { value: qn, diagnostics: _ } => ProgramAssemblyLocatedFoldOk { located: list_snoc_item( xs: acc, - item: LocatedNormalizedTree { path: read.artifact.file_path, tree: root } + item: LocatedNormalizedTree { path: read.artifact.file_path, tree: produced.tree } ), - index: source_root_index_insert(index: idx, module: qn, root: read.source_root) + index: source_root_index_insert(index: idx, module: qn, root: read.source_root), + alloc: produced.alloc, + spans: span_index_merge(base: spans, incoming: produced.spans) } Rejected { diagnostics: d } => ProgramAssemblyLocatedFoldFailed { diagnostics: d } @@ -324,7 +401,9 @@ fn program_assembly_fold_ingest_located( Empty => ProgramAssemblyLocatedFoldOk { located: program_assembly_empty_located_roots(), - index: source_root_index_empty() + index: source_root_index_empty(), + alloc: occurrence_id_allocator_initial(), + spans: span_index_empty() } _ => match prepare_grammar(grammar: lm.grammar) { @@ -335,7 +414,9 @@ fn program_assembly_fold_ingest_located( xs: ingest, empty: ProgramAssemblyLocatedFoldOk { located: program_assembly_empty_located_roots(), - index: source_root_index_empty() + index: source_root_index_empty(), + alloc: occurrence_id_allocator_initial(), + spans: span_index_empty() }, cons: fn(state, read) { program_assembly_fold_step(state: state, read: read, lm: lm, prepared: prepared, residue: residue) @@ -359,13 +440,35 @@ fn located_module_roots_from_source_root_ingest( lm: LanguageModel ) -> Outcome> { match program_assembly_fold_ingest_located(ingest: ingest, lm: lm) { - ProgramAssemblyLocatedFoldOk { located: located, index: _ } => + ProgramAssemblyLocatedFoldOk { located: located, index: _, alloc: _, spans: _ } => outcome_accepted(value: located) ProgramAssemblyLocatedFoldFailed { diagnostics: d } => Rejected { diagnostics: d } } } +// ONE FOLD, BOTH HALVES OF THE IDENTITY JOIN. A consumer that needs to relate a node back to the +// file it came from needs the per-file roots AND the index those roots' occurrences are keyed in, +// and taking them from two separate calls would parse the ingest twice for one question (DESIGN +// section 2) while leaving the two results free to disagree. They are one fold's output, so they are +// returned together. +type LocatedIngestRoots { + located: FreeMonoid, + spans: SpanIndex +} + +fn located_roots_and_spans_from_source_root_ingest( + ingest: SourceRootIngest, + lm: LanguageModel +) -> Outcome { + match program_assembly_fold_ingest_located(ingest: ingest, lm: lm) { + ProgramAssemblyLocatedFoldOk { located: located, index: _, alloc: _, spans: spans } => + outcome_accepted(value: LocatedIngestRoots { located: located, spans: spans }) + ProgramAssemblyLocatedFoldFailed { diagnostics: d } => + Rejected { diagnostics: d } + } +} + fn module_roots_from_source_root_ingest( ingest: SourceRootIngest, lm: LanguageModel @@ -395,26 +498,58 @@ fn assemble_program_from_module_roots( ) } +// THE SPANS RIDE BESIDE THE OUTCOME, NOT INSIDE IT, AND THAT IS THE WHOLE POINT. A diagnostic needs +// its file exactly when the program did NOT assemble, and `Outcome`'s Rejected arm carries no value +// -- so an index returned as part of the accepted program is an index that has evaporated precisely +// where it was wanted. This carrier holds both arms' worth: the span index the fold recorded before +// it stopped, and the outcome itself. It is the same stance `ParseProductionMeasured` already takes +// for memo counters one layer down, for the same reason. +// +// A REFUSED ASSEMBLY STILL CARRIES THE SPANS OF EVERY FILE IT GOT THROUGH, which is the honest +// answer rather than a convenient one: the fold is fail-closed and stops at the first refusing read, +// so the index covers exactly the reads that were parsed, and an occurrence from a file that was +// never reached is absent rather than fabricated. `span_index_lookup` refuses on absence, so the +// renderer degrades to "no file" instead of to a wrong file. +type IngestAssembly { + spans: SpanIndex, + program: Outcome +} + +fn assemble_program_from_ingest_located( + ingest: SourceRootIngest, + admission: Admission, + lm: LanguageModel +) -> IngestAssembly { + match program_assembly_fold_ingest_located(ingest: ingest, lm: lm) { + ProgramAssemblyLocatedFoldFailed { diagnostics: d } => + IngestAssembly { spans: span_index_empty(), program: Rejected { diagnostics: d } } + ProgramAssemblyLocatedFoldOk { located: located, index: idx, alloc: _, spans: spans } => + IngestAssembly { + spans: spans, + program: bind_outcome( + o: validate_module_roots(roots: list_map(xs: located, f: fn(item) { item.tree })), + f: fn(validated_roots) { + resolve_with_admission_grounded( + lm: lm, + roots: validated_roots.roots, + admission: admission, + index: idx, + active_roots: source_root_set_from_ingest(ingest: ingest) + ) + } + ) + } + } +} + fn assemble_program_from_ingest( ingest: SourceRootIngest, admission: Admission, lm: LanguageModel ) -> Outcome { - match program_assembly_fold_ingest(ingest: ingest, lm: lm) { - ProgramAssemblyFoldFailed { diagnostics: d } => - Rejected { diagnostics: d } - ProgramAssemblyFoldOk { roots: roots, index: idx } => - bind_outcome( - o: validate_module_roots(roots: roots), - f: fn(validated_roots) { - resolve_with_admission_grounded( - lm: lm, - roots: validated_roots.roots, - admission: admission, - index: idx, - active_roots: source_root_set_from_ingest(ingest: ingest) - ) - } - ) - } + assemble_program_from_ingest_located( + ingest: ingest, + admission: admission, + lm: lm + ).program } diff --git a/src/v2/compiler/self_host/compiler_closure_emit.dag b/src/v2/compiler/self_host/compiler_closure_emit.dag index 72018168fa7..22dfb501a87 100644 --- a/src/v2/compiler/self_host/compiler_closure_emit.dag +++ b/src/v2/compiler/self_host/compiler_closure_emit.dag @@ -2,7 +2,7 @@ module v2.compiler.self_host.compiler_closure_emit import v2.compiler.infer { infer } import v2.compiler.name_resolve { Admission } -import v2.compiler.program_assembly { assemble_program_from_ingest } +import v2.compiler.program_assembly { assemble_program_from_ingest_located } import v2.compiler.program_partition { emit_for_target } import v2.compiler.source_authority { SourceRootIngest } import extdeps.communication.medium { Medium } @@ -28,6 +28,7 @@ import v2.std.diagnostic { } import v2.std.compilers.target_model { TargetModel } import v2.std.node { Node } +import v2.std.provenance { SpanIndex } import v2.std.program_segment { partition_boundary_fail_closed, program_segment_whole_program @@ -85,14 +86,51 @@ fn compiler_closure_cyclic_diagnostic(root: Node) -> Diagnostic { } } +// THE LOCATED DOOR, WHICH IS WHAT A CLI NEEDS AND THE PLAIN ONE CANNOT GIVE. Everything after +// assembly -- infer, closure, emit -- refuses with diagnostics anchored on NODES, and a node names +// a file only through the ingest's span index. That index is produced by assembly and would be +// discarded here, so a caller rendering the refusal had nothing to join against; carrying it out +// beside the outcome is the difference between "FATAL AT " and a file and byte range. The +// unlocated entry point below is this one's `.outcome`, so there is one emit and no second path. +type CompilerClosureEmitLocated { + spans: SpanIndex, + outcome: Outcome +} + fn emit_compiler_import_closure_from_ingest( ingest: SourceRootIngest, admission: Admission, target: TargetModel ) -> Outcome { + emit_compiler_import_closure_from_ingest_located( + ingest: ingest, + admission: admission, + target: target + ).outcome +} + +fn emit_compiler_import_closure_from_ingest_located( + ingest: SourceRootIngest, + admission: Admission, + target: TargetModel +) -> CompilerClosureEmitLocated { let lm = dag_language_model() + let assembled = assemble_program_from_ingest_located(ingest: ingest, admission: admission, lm: lm) + CompilerClosureEmitLocated { + spans: assembled.spans, + outcome: emit_compiler_import_closure_from_assembled( + program: assembled.program, + target: target + ) + } +} + +fn emit_compiler_import_closure_from_assembled( + program: Outcome, + target: TargetModel +) -> Outcome { bind_outcome( - o: assemble_program_from_ingest(ingest: ingest, admission: admission, lm: lm), + o: program, f: fn(resolved) { bind_outcome( o: infer(tree: resolved), diff --git a/src/v2/std/lens_verdict.dag b/src/v2/std/lens_verdict.dag index 6b848791241..94037a37277 100644 --- a/src/v2/std/lens_verdict.dag +++ b/src/v2/std/lens_verdict.dag @@ -16,6 +16,9 @@ import v2.std.diagnostic { } import v2.std.integer { integer_int_to_decimal_string } import v2.std.node { Symbol } +import v2.std.provenance { SpanIndex, span_index_textual_locus_optional } +import v2.std.optional { Absent, Present } +import std.occurrence_identity { OccurrenceId, OccurrenceMinted, OccurrenceProjected, OccurrenceSynthetic } import v2.std.text { String } // LensVerdict is the shared fail-closed lattice for lenses that have not yet specialized to a @@ -80,6 +83,56 @@ fn lens_verdict_extent_text(e: Extent) -> String { } } +// THE LOCATED RENDERER: THE ONE PLACE A NODE ANCHOR BECOMES A FILE, AND IT IS A LOOKUP. +// +// A `NodeLocus` names the node a stage refused at, and a node carries an OCCURRENCE, not a +// position. The ingest's span index is keyed by exactly that occurrence and its entries already +// carry the compilation unit each token was read from, so the whole join is: read the node's +// occurrence, look it up, render the Textual locus the existing sibling below already renders. No +// tree is walked and no node is compared -- searching the program for a structurally equal node +// would be a plausible guess about which file an occurrence came from, which DESIGN section 5 +// forbids, and it is also the reason this takes an INDEX rather than a program. +// +// A DERIVED OCCURRENCE RESOLVES THROUGH ITS CAUSES, WHICH IS WHY INTERIOR NODES ANSWER AT ALL. +// `span_index_resolve_textual_locus` follows a `DerivedBy` origin to the ids it was derived from, +// so a production node minted over its captured children reports the span of the source those +// children came from. That is a recorded chain, not an inference. +// +// EVERY WAY OF NOT KNOWING RENDERS AS NOT KNOWING. A synthetic node has no occurrence; an +// occurrence absent from the index (a file the fold never reached, because assembly is fail-closed +// and stops at the first refusal) refuses at lookup; a chain that bottoms out in no textual origin +// refuses too. All three fall through to the unlocated text below, which says plainly that there is +// no file. None of them invents one. +fn lens_verdict_diagnostic_locus_text_located(d: Diagnostic, index: SpanIndex) -> String { + match d.at { + NodeLocus { anchor: a } => + match a.at.occurrence_id { + OccurrenceSynthetic => lens_verdict_diagnostic_locus_text(d: d) + OccurrenceMinted { id: id } => + lens_verdict_located_from_occurrence(d: d, index: index, id: id) + OccurrenceProjected { id: id, caused_by: _ } => + lens_verdict_located_from_occurrence(d: d, index: index, id: id) + } + _ => lens_verdict_diagnostic_locus_text(d: d) + } +} + +fn lens_verdict_located_from_occurrence( + d: Diagnostic, + index: SpanIndex, + id: OccurrenceId +) -> String { + match span_index_textual_locus_optional(index: index, id: id) { + Present { value: locus } => + match locus { + Textual { file: f, extent: e } => + concat(concat(symbol_lexeme(sym: f), " "), lens_verdict_extent_text(e: e)) + _ => lens_verdict_diagnostic_locus_text(d: d) + } + Absent => lens_verdict_diagnostic_locus_text(d: d) + } +} + fn lens_verdict_diagnostic_locus_text(d: Diagnostic) -> String { match d.at { Textual { file: f, extent: e } => diff --git a/src/v2/std/node.dag b/src/v2/std/node.dag index 39ca7d241ff..ac133a415f2 100644 --- a/src/v2/std/node.dag +++ b/src/v2/std/node.dag @@ -121,6 +121,29 @@ fn node_rebuild(n: Node, children: List) -> Node { ) } +// A LOWERED NODE IS NOT A SYNTHETIC ONE, and the difference is the whole reason a diagnostic can +// name a file. `node_synthetic` says "no authored origin exists"; this says "the authored origin is +// the node I am lowering, and the shape changed while the occurrence did not". The front end lowers +// an authored construct into its semantic form -- a type name into a type atom, a surface +// expression into its core node -- and the result stands FOR the same authored text at the same +// position, so it keeps that text's occurrence rather than losing it. `std.occurrence_identity` +// names this case explicitly and rules out the alternative: "a carried-forward node gets no arm +// here", i.e. OccurrenceProjected is for a node minted in a DIFFERENT allocator with a scoped +// cause, not for a same-graph lowering, which owns its source's occurrence outright. +// +// THE SOURCE'S IDENTITY IS TAKEN WHOLE, including OccurrenceSynthetic. Lowering a node that had no +// authored origin produces a node that still has none -- carrying "nothing" forward is the honest +// answer, and borrowing a NEIGHBOUR's occurrence to fill the gap would be the plausible guess +// DESIGN section 5 forbids. So this is never a way to manufacture attribution: it can only preserve +// attribution that the source already had. +fn node_lowered_from(kind: NodeKind, children: List, source: Node) -> Node { + node_with_occurrence_id( + kind: kind, + children: children, + occurrence_id: source.occurrence_id + ) +} + fn node_synthetic(kind: NodeKind, children: List) -> Node { node_with_occurrence_id( kind: kind, diff --git a/src/v2/std/provenance.dag b/src/v2/std/provenance.dag index 72f7891ec63..7035dfdb4eb 100644 --- a/src/v2/std/provenance.dag +++ b/src/v2/std/provenance.dag @@ -13,7 +13,7 @@ import v2.std.diagnostic { invariant_port_locus } import v2.std.node { Node, Symbol } -import v2.std.optional { Absent, Present } +import v2.std.optional { Absent, Optional, Present } import std.occurrence_identity { OccurrenceId } import v2.std.witness { Holds, Violates, Witness, witness_from_optional, witness_violates } @@ -130,6 +130,23 @@ fn span_index_resolve_textual_locus(index: SpanIndex, id: OccurrenceId) -> Witne } } +// THE OPTIONAL-SHAPED DOOR, FOR A CONSUMER THAT RENDERS RATHER THAN REFUSES. The Witness-returning +// resolver above is the authority and this is its projection: a renderer asking "does this +// occurrence have a source position" wants presence or absence, not a second diagnostic to fold +// into the one it is already rendering. Collapsing the refusal here loses nothing, because the only +// information in it is the absence this arm already reports. +// +// It exists as a projection rather than as a re-match on the index because the resolution RULE -- +// follow a DerivedBy or GeneratedBy origin to its causes, accept only a Textual locus -- is one +// fact, and a consumer re-deciding it would be a second authority for where an occurrence comes +// from (DESIGN section 3). +fn span_index_textual_locus_optional(index: SpanIndex, id: OccurrenceId) -> Optional { + match span_index_resolve_textual_locus(index: index, id: id) { + Holds { value: locus } => Present { value: locus } + Violates { diagnostic: _ } => Absent + } +} + fn node_artifact_provenance(node: Node, artifact: Artifact) -> NodeArtifactProvenance { NodeArtifactProvenance { node: node, artifact: artifact } } diff --git a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag new file mode 100644 index 00000000000..14d32f9c133 --- /dev/null +++ b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag @@ -0,0 +1,246 @@ +module v2.test.provenance.occurrence_file_attribution + +import v2.compiler.name_resolve { Admission, ResolutionSubject } +import v2.compiler.program_assembly { + IngestAssembly, + LocatedIngestRoots, + LocatedNormalizedTree, + assemble_program_from_ingest_located, + located_roots_and_spans_from_source_root_ingest +} +import v2.compiler.source_authority { DagSourceReadWitness } +import v2.extdeps.languages.dag { dag_language_model } +import v2.std.algebra { Empty, fold_list, length } +import v2.std.artifact { Artifact, SourceFile } +import v2.std.compilers.lexing { symbol_lexeme } +import v2.std.cross_tree.import_model { DagTree } +import v2.std.diagnostic { Accepted, ByteRange, Rejected, Textual, WholeFile } +import v2.std.live_tree { LiveTreeDisposition, SubstrateInputsOnly } +import v2.std.logic { Bool } +import v2.std.node { Node, Symbol } +import v2.compiler.normalized_tree { NormalizedTree } +import std.algebra { FreeMonoid } +import v2.std.diagnostic { Outcome } +import v2.std.optional { Absent, Optional, Present, optional_absent, optional_present } +import v2.std.provenance { SpanIndex, span_index_textual_locus_optional } +import v2.std.text { String } +import std.occurrence_identity { + OccurrenceId, + OccurrenceMinted, + OccurrenceProjected, + OccurrenceSynthetic +} +import extdeps.communication.medium { Lossless, Medium } + +data live_tree_disposition: LiveTreeDisposition = SubstrateInputsOnly + +// TWO FILES, DELIBERATELY IDENTICAL IN SHAPE. The two modules differ only in their name, so the two +// parses walk the same productions in the same order and mint the same ORDINALS as each other. That +// is the whole point of the pair: under a per-file allocator reset both files' roots are occurrence +// #N for the same N, so a merged span index answers one file's locus for the other file's node -- +// silently, plausibly and wrongly. Seeded from the ingest's running mark they are different ids, and +// each answers its own file. The claim below is therefore a discriminator and not a demonstration: +// delete the seeding and it reports one file twice. +data attribution_source_a: String = "module v2.test.fixture.attribution_a\n\nimport v2.std.logic { Bool }\n\nfn attribution_a_fn() -> Bool { true }\n" + +data attribution_source_b: String = "module v2.test.fixture.attribution_b\n\nimport v2.std.logic { Bool }\n\nfn attribution_b_fn() -> Bool { true }\n" + +fn attribution_read_a() -> DagSourceReadWitness { + DagSourceReadWitness { + source: Medium { carried: attribution_source_a, fidelity: Lossless }, + artifact: Artifact { + kind: SourceFile, + id: ^attribution_read_a, + file_path: "src/v2/test/fixture/attribution/attribution_a.dag" + }, + compilation_unit: ^attribution_file_a, + source_root: DagTree + } +} + +fn attribution_read_b() -> DagSourceReadWitness { + DagSourceReadWitness { + source: Medium { carried: attribution_source_b, fidelity: Lossless }, + artifact: Artifact { + kind: SourceFile, + id: ^attribution_read_b, + file_path: "src/v2/test/fixture/attribution/attribution_b.dag" + }, + compilation_unit: ^attribution_file_b, + source_root: DagTree + } +} + +// THE SUBJECT IS THE ASSEMBLY, ENTERED FOR REAL. The reads are SUPPLIED -- constructing a witness +// is cheaper and more precise than walking a source root, and the file identity under test is a +// field of the read, so supplying it is supplying the input rather than designing the answer +// (DESIGN section 3). What is NOT supplied is anything downstream: tokenize, parse, normalize, the +// graft and the assembly fold all run, and the span index these claims read is the one that fold +// actually built. +fn attribution_assembly() -> IngestAssembly { + assemble_program_from_ingest_located( + ingest: [attribution_read_a(), attribution_read_b()], + admission: Admission { + subject: ResolutionSubject { name: [^v2, ^test, ^fixture, ^attribution_a] }, + imports: Empty + }, + lm: dag_language_model() + ) +} + +fn attribution_occurrence_file(index: SpanIndex, node: Node) -> Optional { + match node.occurrence_id { + OccurrenceSynthetic => optional_absent() + OccurrenceMinted { id: id } => attribution_file_of_id(index: index, id: id) + OccurrenceProjected { id: id, caused_by: _ } => attribution_file_of_id(index: index, id: id) + } +} + +fn attribution_file_of_id(index: SpanIndex, id: OccurrenceId) -> Optional { + match span_index_textual_locus_optional(index: index, id: id) { + Absent => optional_absent() + Present { value: locus } => + match locus { + Textual { file: f, extent: _ } => optional_present(value: f) + _ => optional_absent() + } + } +} + +fn attribution_has_byte_range(index: SpanIndex, id: OccurrenceId) -> Bool { + match span_index_textual_locus_optional(index: index, id: id) { + Absent => false + Present { value: locus } => + match locus { + Textual { file: _, extent: ext } => + match ext { + ByteRange { start: s, end: e } => (s >= 0) && (e > s) + WholeFile => false + } + _ => false + } + } +} + +fn attribution_id_of(node: Node) -> Optional { + match node.occurrence_id { + OccurrenceSynthetic => optional_absent() + OccurrenceMinted { id: id } => optional_present(value: id) + OccurrenceProjected { id: id, caused_by: _ } => optional_present(value: id) + } +} + +fn attribution_roots() -> Outcome { + located_roots_and_spans_from_source_root_ingest( + ingest: [attribution_read_a(), attribution_read_b()], + lm: dag_language_model() + ) +} + +// THE DISCRIMINATOR. Each file's module root is looked up in the ONE ingest-wide span index and +// must report ITS OWN compilation unit -- not the other file's, and not nothing. Two conjuncts +// carry the two ways this can fail, and they fail differently on purpose: reporting the wrong file +// is the silent-wrongness arm an unseeded allocator produces, and reporting no file at all is the +// arm a dropped span carry produces. A claim that only checked "some file" would pass under the +// first and is the claim worth not writing. +test fn two_files_attribute_to_their_own_files_holds() -> Bool { + match attribution_roots() { + Rejected { diagnostics: _ } => false + Accepted { value: roots, diagnostics: _ } => + (length(xs: roots.located) == 2) + && attribution_root_names_file( + roots: roots, + path: "src/v2/test/fixture/attribution/attribution_a.dag", + expected: ^attribution_file_a + ) + && attribution_root_names_file( + roots: roots, + path: "src/v2/test/fixture/attribution/attribution_b.dag", + expected: ^attribution_file_b + ) + } +} + +// THE ROOT IS FOUND BY ITS PATH, WHICH IS THE IDENTITY JOIN THE FOLD ALREADY CARRIES, never by +// position in the list -- a positional pick would agree with a fold that had swapped the two files +// and would report the same verdict either way (DESIGN section 5: completeness is an identity join, +// not a count equality). +fn attribution_root_names_file( + roots: LocatedIngestRoots, + path: String, + expected: Symbol +) -> Bool { + match attribution_root_for_path(located: roots.located, path: path) { + Absent => false + Present { value: tree } => + match attribution_occurrence_file(index: roots.spans, node: tree.root) { + Absent => false + Present { value: file } => file == expected + } + } +} + +fn attribution_root_for_path( + located: FreeMonoid, + path: String +) -> Optional { + fold_list( + xs: located, + empty: optional_absent(), + cons: fn(acc, item) { + match acc { + Present { value: _ } => acc + Absent => + if item.path == path { + optional_present(value: item.tree) + } else { + optional_absent() + } + } + } + ) +} + +// THE TWO IDS MUST ACTUALLY DIFFER, which is the seeding fact stated directly rather than inferred +// from the lookup above. Without it a reader cannot tell whether the files attribute correctly +// because the ids are distinct or because the index happened to be filled in a forgiving order. +test fn two_files_mint_distinct_root_occurrences_holds() -> Bool { + match attribution_roots() { + Rejected { diagnostics: _ } => false + Accepted { value: roots, diagnostics: _ } => + match attribution_root_for_path(located: roots.located, path: "src/v2/test/fixture/attribution/attribution_a.dag") { + Absent => false + Present { value: tree_a } => + match attribution_root_for_path(located: roots.located, path: "src/v2/test/fixture/attribution/attribution_b.dag") { + Absent => false + Present { value: tree_b } => + match attribution_id_of(node: tree_a.root) { + Absent => false + Present { value: id_a } => + match attribution_id_of(node: tree_b.root) { + Absent => false + Present { value: id_b } => !(id_a == id_b) + } + } + } + } + } +} + +// THE BYTE RANGE, not merely the file. A locus that named a file with no extent would satisfy the +// claims above and would still leave the operator hunting through the file by hand, which is the +// state this package exists to end. +test fn attributed_occurrence_carries_a_byte_range_holds() -> Bool { + match attribution_roots() { + Rejected { diagnostics: _ } => false + Accepted { value: roots, diagnostics: _ } => + match attribution_root_for_path(located: roots.located, path: "src/v2/test/fixture/attribution/attribution_a.dag") { + Absent => false + Present { value: tree } => + match attribution_id_of(node: tree.root) { + Absent => false + Present { value: id } => attribution_has_byte_range(index: roots.spans, id: id) + } + } + } +} From 97675ab228178145344e365b64b47033cfb876c3 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 17:59:57 +0000 Subject: [PATCH 02/16] Move two annotations to module-item grain; delete the fixture nothing read The floor REFUSED on the previous head while the lane reported success: required-ci: floor refused: subject=deb9f1700d5edfae src/v2/compiler/program_assembly.dag:360:7: error: source annotation sits inside a declaration body. Only module-item grain is modeled required-ci: lane=witnesses phases_run=2 phases_failed=2 Two `//` blocks I added sat inside declaration bodies, which the annotation channel refuses (DESIGN 4c: annotations are module-item grain). Both facts are re-homed above the declarations they describe, so nothing is lost -- the failing-read merge point and the grammar-refusal empty index each now sit on their own fold. Every .dag file this branch touches is checked, not just the two lines the floor happened to name first. review 69628: fixtures/native_cli_door/door_probe.dag held the same source text the claim carries inline, and nothing read it -- the claim builds its read from the string and uses the path only as an identity. Two sources for one fact, free to drift (DESIGN 2), and an artifact with no consumer (DESIGN 6). Deleted; the claim's inline string is the single source, and the path stays as a value under test because it is what the rendered line must name. Co-Authored-By: Claude Opus 5 (1M context) --- fixtures/native_cli_door/door_probe.dag | 5 ----- src/v2/compiler/program_assembly.dag | 15 +++++++++------ .../occurrence_file_attribution_test.dag | 7 +++++++ 3 files changed, 16 insertions(+), 11 deletions(-) delete mode 100644 fixtures/native_cli_door/door_probe.dag diff --git a/fixtures/native_cli_door/door_probe.dag b/fixtures/native_cli_door/door_probe.dag deleted file mode 100644 index 375317ea99d..00000000000 --- a/fixtures/native_cli_door/door_probe.dag +++ /dev/null @@ -1,5 +0,0 @@ -module fixture.native_cli_door.door_probe - -import v2.std.logic { Bool } - -fn door_probe_fn() -> Bool { true } diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index 6ae6b3f1d8b..f3cf52d8891 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -339,6 +339,11 @@ fn program_assembly_read_to_normalized_root( } } +// THE FAILING READ'S OWN SPANS ARE MERGED IN BEFORE THE REFUSAL IS BUILT (`carried`), and that is +// the point of the repair review 69607 asked for: a file that parsed and then failed to normalize +// or graft is exactly the file whose diagnostic needs locating, and its index would otherwise be +// dropped one step before the renderer asked for it. Both refusing arms below -- the read's own +// refusal and the module-name derivation's -- carry it, so neither loses what was recorded. fn program_assembly_fold_step( state: ProgramAssemblyLocatedFoldState, read: DagSourceReadWitness, @@ -357,10 +362,6 @@ fn program_assembly_fold_step( residue: residue, seed: seed ) - // THE FAILING READ'S OWN SPANS ARE MERGED IN BEFORE THE REFUSAL IS BUILT, and that is the - // whole point of the repair: a file that parsed and then failed to normalize or graft is - // exactly the file whose diagnostic needs locating, and its index would otherwise be dropped - // one step before the renderer asked for it. let carried = span_index_merge(base: spans, incoming: result.spans) match result.produced { Accepted { value: tree, diagnostics: _ } => @@ -410,6 +411,10 @@ fn dag_prepared_grammar() -> Outcome { prepare_grammar(grammar: dag_grammar()) } +// THE GRAMMAR REFUSAL REPORTS AN EMPTY INDEX AND THAT IS AN ANSWER, NOT A DROP. An invalid grammar +// fails the whole assembly before any module is parsed, so no occurrence was ever minted and there +// is nothing recorded to carry -- which is a different fact from the per-read refusals above, where +// something WAS recorded and losing it was the defect. fn program_assembly_fold_ingest_located( ingest: SourceRootIngest, lm: LanguageModel @@ -425,8 +430,6 @@ fn program_assembly_fold_ingest_located( _ => match prepare_grammar(grammar: lm.grammar) { Rejected { diagnostics: d } => - // An invalid grammar fails the assembly before any module is parsed, so no occurrence was - // minted and there is no index to carry. Empty here is the answer, not a drop. ProgramAssemblyLocatedFoldFailed { diagnostics: d, spans: span_index_empty() } Accepted { value: prepared, diagnostics: residue } => fold_list( diff --git a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag index 5cbedbe8822..49d88a46aec 100644 --- a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag +++ b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag @@ -248,6 +248,13 @@ test fn attributed_occurrence_carries_a_byte_range_holds() -> Bool { // (v1.compiler.emit_rust emit_source_root_eval_driver_main_rs). A caret literal here would be a // different input wearing the specimen's name, and would have reported a mangled symbol while the // real path rendered correctly -- so this supplies the value the real walk supplies. +// +// THE PATH NAMES NO COMMITTED FILE, AND THAT IS DELIBERATE (review 69628). An earlier revision also +// committed `fixtures/native_cli_door/door_probe.dag` holding this same text. Nothing read it: the +// claim constructs its read from the string below and uses the path only as an identity, so the +// file was a second source for one fact, free to drift from this one -- DESIGN section 2's +// duplication test, and section 6's "new artifact with no final consumer". The string is the single +// source; the path is a value under test (it is what the rendered line must name), not a lookup. data door_probe_source: String = "module fixture.native_cli_door.door_probe\n\nimport v2.std.logic { Bool }\n\nfn door_probe_fn() -> Bool { true }\n" data door_probe_path: String = "fixtures/native_cli_door/door_probe.dag" From af7ba67339a2fac876ce16b42d10f57b4d51a39e Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 18:55:24 +0000 Subject: [PATCH 03/16] Seed the second ingest fold, and share the front end the claims rebuilt review 69644: v2.compiler.00_compile native_test_context_from_ingest folds over a WHOLE INGEST but called the unseeded per-file door, so every read restarted at occurrence #0 and the roots it accumulated carried ids that collided across files. My annotation on ParseArtifact asserted the corpus had no such caller. Both halves are fixed, and the route half is the one that mattered: the census in gunbc.compiler_frontend_program_status joins that route's refusals "to occurrence identity where an id is minted", which is an occurrence-keyed join over a key that was not unique in the scope it was joined across -- a silent wrong answer, not a missing one. - NativeTestContextFoldState carries alloc; the fold calls the seeded door. The mark advances on EVERY arm including refusing ones: a read that refused still consumed the ids it minted, so rolling back would reintroduce the collision one file later. - The annotation now states only what the door can know. An unseeded call STATES "fresh scope"; whether that holds is a fact about the caller. It names the two folds that thread the mark and admits it cannot catch a third. - Control: native_route_threads_the_occurrence_mark_across_files_holds. Floor at 97675ab2281: planned=416 executed=416 claims_failed=0 -- every claim passes. The one failing phase was a COST refusal on my own new claim (cpu 344ms vs a 302ms margin, 129385 eval steps vs 72300). Checked the lane's own discriminators first: not a nested membership scan, not contention at constant eval steps. It is one front end rebuilt per claim, seven claims each reading one field of it -- DESIGN 3's claim dominated by one call whose result shape is all it inspects. So the four shared producers are enrolled warm in floor_cross_claim_pure_producers_warm with the portability argument that roster requires; none carries a resolution context or a closure. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/00_compile.dag | 48 ++++++++++++---- src/v2/compiler/02_parse.dag | 14 ++++- .../occurrence_file_attribution_test.dag | 56 ++++++++++++++++++- src/v2/workflow/floor_pure_producer_share.dag | 31 ++++++++++ 4 files changed, 135 insertions(+), 14 deletions(-) diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index 47dedc02350..6cc5366e85b 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -36,7 +36,9 @@ import v2.compiler.name_resolve { resolve_with_admission_context_policy, resolve_with_admission } +import std.occurrence_identity { OccurrenceIdAllocator, occurrence_id_allocator_initial } import v2.compiler.program_assembly { + program_assembly_read_to_normalized_root_seeded, assemble_program_from_ingest, program_assembly_fold_ingest, program_assembly_read_to_normalized_root_prepared, @@ -1228,10 +1230,22 @@ type NativeTestPreparedModule { inferred: InferredTree } +// `alloc` IS THE OCCURRENCE-ID MARK THIS FOLD HAS REACHED, and it is here for the reason +// `std.occurrence_identity` `occurrence_identity_scope_law` gives: this fold walks a whole ingest, +// so it IS "a production source graph", and such a graph "threads one allocator across every parsed +// source" -- module-local allocator reset is a FORBIDDEN identity input. Before this field each +// read restarted at #0, so the roots this state accumulates carried ids that collided across files +// and the NativeTestContext could not tell two files' occurrence #3 apart. +// +// THAT IS NOT A LATENT PROBLEM HERE, IT IS A CONSUMED ONE: the SourceRootEval census +// (`gunbc.compiler_frontend_program_status`) joins this route's refusals "to occurrence identity +// where an id is minted", which is an occurrence-keyed join over a key that was not unique in the +// scope it was joined across -- a silent wrong answer rather than a missing one (DESIGN section 5). type NativeTestContextFoldState { roots: FreeMonoid index: SourceRootIndex file_refusals: FreeMonoid + alloc: OccurrenceIdAllocator } // The LAST diagnostic is the cause that actually refused the file; the head is the advisory @@ -1250,10 +1264,15 @@ fn native_test_file_refusal(path: Symbol, d: NonEmptyDiagnostics) -> NativeTestF // front end was entered -- as one composed call (native_test_context_from_ingest below) or phase // by phase with a clock between them (std.compiler_entry.SourceRootEvalDriver). Neither caller // changes what is absorbed. +// THE MARK ADVANCES ON EVERY ARM, INCLUDING THE REFUSING ONES. A read that refused still consumed +// the ids it minted before it stopped, so carrying the incoming mark forward regardless of outcome +// is what keeps the next file from reusing them -- rolling back to the pre-read mark on a refusal +// would reintroduce exactly the collision this field exists to prevent, one file later. fn native_test_context_absorb( state: NativeTestContextFoldState, read: DagSourceReadWitness, - root_outcome: Outcome + root_outcome: Outcome, + alloc: OccurrenceIdAllocator ) -> NativeTestContextFoldState { match root_outcome { Rejected { diagnostics: d } => @@ -1263,7 +1282,8 @@ fn native_test_context_absorb( file_refusals: list_snoc_item( xs: state.file_refusals, item: native_test_file_refusal(path: read.compilation_unit, d: d) - ) + ), + alloc: alloc } Accepted { value: root, diagnostics: _ } => match qualified_name_from_module_node(root: root.root) { @@ -1274,13 +1294,15 @@ fn native_test_context_absorb( file_refusals: list_snoc_item( xs: state.file_refusals, item: native_test_file_refusal(path: read.compilation_unit, d: d) - ) + ), + alloc: alloc } Accepted { value: qn, diagnostics: _ } => NativeTestContextFoldState { roots: list_snoc_item(xs: state.roots, item: root), index: source_root_index_insert(index: state.index, module: qn, root: read.source_root), - file_refusals: state.file_refusals + file_refusals: state.file_refusals, + alloc: alloc } } } @@ -1293,15 +1315,18 @@ fn native_test_context_fold_step( prepared: PreparedGrammar, residue: Diagnostics ) -> NativeTestContextFoldState { + let result = program_assembly_read_to_normalized_root_seeded( + read: read, + lm: lm, + prepared: prepared, + residue: residue, + seed: state.alloc + ) native_test_context_absorb( state: state, read: read, - root_outcome: program_assembly_read_to_normalized_root_prepared( - read: read, - lm: lm, - prepared: prepared, - residue: residue - ) + root_outcome: result.produced, + alloc: result.alloc ) } @@ -1338,7 +1363,8 @@ fn native_test_context_state_empty() -> NativeTestContextFoldState { NativeTestContextFoldState { roots: Empty, index: source_root_index_empty(), - file_refusals: Empty + file_refusals: Empty, + alloc: occurrence_id_allocator_initial() } } diff --git a/src/v2/compiler/02_parse.dag b/src/v2/compiler/02_parse.dag index 9756b80228f..cf14c9ac5f5 100644 --- a/src/v2/compiler/02_parse.dag +++ b/src/v2/compiler/02_parse.dag @@ -179,7 +179,19 @@ type ParseProvenanceState { // // A STANDALONE PARSE IS STILL AN ISOLATED SCOPE, which the same law admits: the unseeded entry // points below are projections that pass `occurrence_id_allocator_initial()`, so a caller that -// parses one file alone is unchanged, and only a caller assembling a source GRAPH threads the mark. +// parses one file alone is unchanged. +// +// WHAT THAT DOES NOT SAY, DELIBERATELY, IS THAT EVERY UNSEEDED CALLER PARSES ONE FILE. The door +// cannot enforce its own precondition: an unseeded call states "this is a fresh scope", and whether +// that is TRUE is a fact about the caller, not about this declaration. An earlier revision of this +// annotation claimed the corpus had no multi-file unseeded caller, and the corpus did have one +// (review 69644) -- prose asserting a property of code it cannot see, which is the same class as +// review 69607 against this branch. The obligation belongs to each fold that walks an ingest, and +// the two that do -- `v2.compiler.program_assembly` `program_assembly_fold_step` and +// `v2.compiler.00_compile` `native_test_context_fold_step` -- both thread the mark. A NEW ingest +// fold that calls the unseeded door is a defect this annotation cannot catch; making that +// structurally unwritable would mean a carrier that distinguishes "a scope" from "a file", which is +// a modeling change larger than this one and is not claimed here. type ParseArtifact { tree: ParseTree span_index: v2.std.provenance.SpanIndex diff --git a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag index 49d88a46aec..3aeba3b501a 100644 --- a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag +++ b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag @@ -1,6 +1,7 @@ module v2.test.provenance.occurrence_file_attribution import v2.compiler.name_resolve { Admission, ResolutionSubject } +import v2.compiler.compile { native_test_context_from_ingest } import v2.compiler.program_assembly { IngestAssembly, LocatedIngestRoots, @@ -28,8 +29,8 @@ import v2.std.live_tree { LiveTreeDisposition, SubstrateInputsOnly } import v2.std.logic { Bool } import v2.std.node { Node, Symbol } import v2.compiler.normalized_tree { NormalizedTree } -import std.algebra { FreeMonoid } -import v2.std.diagnostic { Outcome } +import std.algebra { Cons, Empty, FreeMonoid } +import v2.std.diagnostic { Outcome, outcome_accepted } import v2.std.optional { Absent, Optional, Present, optional_absent, optional_present } import v2.std.provenance { SpanIndex, span_index_textual_locus_optional } import v2.std.text { String } @@ -383,3 +384,54 @@ test fn refused_assembly_still_locates_the_files_it_parsed_holds() -> Bool { fn attribution_first_recorded_file(index: SpanIndex) -> Optional { attribution_file_of_id(index: index, id: OccurrenceId { value: 0 }) } + +// THE SECOND INGEST FOLD, WHICH HAD THE SAME DEFECT AND NO CLAIM (review 69644). +// `native_test_context_from_ingest` walks a whole ingest and so IS "a production source graph" in +// the sense `occurrence_identity_scope_law` uses, but it called the UNSEEDED per-file door, so every +// read restarted at #0 and the roots it accumulated carried ids that collided across files. The +// route now threads the mark; this is the claim that says so, because a fix to a second fold with +// evidence only over the first is a fix nobody can tell was made. +// +// THE SAME TWO IDENTICAL-SHAPE FIXTURES ARE REUSED ON PURPOSE: they mint the same ordinals as each +// other under a per-file reset, so distinct root occurrences here can only come from threading. +fn native_route_roots() -> Outcome> { + match native_test_context_from_ingest( + ingest: [attribution_read_a(), attribution_read_b()] + ) { + Rejected { diagnostics: d } => Rejected { diagnostics: d } + Accepted { value: context, diagnostics: _ } => + match context.resolution { + Rejected { diagnostics: d } => Rejected { diagnostics: d } + Accepted { value: ctx, diagnostics: _ } => outcome_accepted(value: ctx.roots.roots) + } + } +} + +test fn native_route_threads_the_occurrence_mark_across_files_holds() -> Bool { + match native_route_roots() { + Rejected { diagnostics: _ } => false + Accepted { value: roots, diagnostics: _ } => + (length(xs: roots) == 2) && native_route_roots_have_distinct_occurrences(roots: roots) + } +} + +// Compared pairwise by identity rather than by counting distinct values: two roots is the whole +// population here, and asserting they differ is the fact under test stated directly. +fn native_route_roots_have_distinct_occurrences(roots: FreeMonoid) -> Bool { + match roots { + Empty => false + Cons { head: first, tail: rest } => + match rest { + Empty => false + Cons { head: second, tail: _ } => + match attribution_id_of(node: first.root) { + Absent => false + Present { value: id_a } => + match attribution_id_of(node: second.root) { + Absent => false + Present { value: id_b } => !(id_a == id_b) + } + } + } + } +} diff --git a/src/v2/workflow/floor_pure_producer_share.dag b/src/v2/workflow/floor_pure_producer_share.dag index cdaf80683c4..0b3e83268dc 100644 --- a/src/v2/workflow/floor_pure_producer_share.dag +++ b/src/v2/workflow/floor_pure_producer_share.dag @@ -575,7 +575,38 @@ import v2.std.collection { List } // THE CLI TRAILING-TOKEN PROBE ROW: v2.test.cli.v2_native_cli drives v2_cli_run over a two-file // supplied ingest whose second file refuses at parse; two claims read one field each of the // CliRunOutcome. Stored value is a refused outcome (a Symbol and a String), portable. +// THE OCCURRENCE-ATTRIBUTION ROWS ARE THE SAME GROUND A FIFTH TIME, AND THE LEDGER NAMED THE ROW. +// v2.test.provenance.occurrence_file_attribution establishes that an occurrence resolves to a file +// and byte range; its seven claims each inspect ONE field of a value produced by driving the whole +// front end over a supplied two-file ingest -- which is DESIGN section 3's "a claim whose evaluation +// is dominated by ONE call whose RESULT SHAPE is all it inspects", and section 2's several demands +// for one computation identity with a shared ancestor. The front end each claim rebuilt is work no +// row is about. +// +// THE INSTRUMENT DECIDED THIS ROW RATHER THAN A PREFERENCE: the required floor on gunbc#11985 head +// 97675ab2281 refused +// `refused_assembly_still_locates_the_files_it_parsed_holds` ENROLMENT-MARGIN-REFUSED at +// observed_cpu_ms=344 against the 302ms margin, and COMPLETED-OVER-COST-REQUIREMENT at 129385 +// evaluator steps against the 72300-step new-witness budget. The lane's own guidance was checked +// before reducing anything: the cause is not a nested membership scan and not contention at +// constant eval steps -- it is one front end per claim, so the share point is the producer. +// +// THE STORED VALUES ARE PORTABLE, which is the publication rule this roster enforces. None carries +// a ResolutionContext or a closure: `attribution_roots` and `native_route_roots` carry normalized +// trees plus a SpanIndex (a Map of OccurrenceId to OriginEvent -- loci, symbols and nodes), +// `attribution_refused_assembly` carries a SpanIndex and an Outcome, and +// `door_probe_cli_detail` carries a String. `native_route_roots` deliberately publishes +// `ctx.roots.roots` and NOT the NativeTestContext it came from, for the reason census_probe_outcomes +// gives: the context is the origin-bound shape this roster refuses. +// +// WARM, NEVER CLAIM-FORCED, by the same ceiling arithmetic as every row above: the fill is a front +// end over two files, which is more than one claim's budget on this lane, so an in-fold first touch +// would die mid-flight and be abandoned un-stored exactly as prepare_grammar's did. data floor_cross_claim_pure_producers_warm: List = [ + "v2.test.provenance.occurrence_file_attribution.attribution_roots", + "v2.test.provenance.occurrence_file_attribution.attribution_refused_assembly", + "v2.test.provenance.occurrence_file_attribution.door_probe_cli_detail", + "v2.test.provenance.occurrence_file_attribution.native_route_roots", "v2.test.cli.v2_native_cli.cli_probe_trailing_outcome", "v2.test.claim.native_route.native_refusal_detail.ndp_resolutions", "v2.test.claim.native_census.whole_tree_census_resolve.census_probe_outcomes", From 71ea73074ff91e393b6fc504f1e398708e0c3562 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 20:39:32 +0000 Subject: [PATCH 04/16] Thread the mark through the EMITTED driver, and make the hand-off observable The side chat found that src/v1/05_emit_rust.dag renders native_test_context_absorb with 3 arguments while this branch made it 4. No .dag witness builds that path, so the floor stayed green. Arity was the shallow half. That emitted SourceRootEvalDriver OPEN-CODES the per-file sequence so a clock can sit between phases, and it called the UNSEEDED phase functions -- so fixing only the arity would COMPILE AND BE SILENTLY WRONG: every file seeded from the same unchanging value, ids colliding across files on the one route that actually runs, whose refusals gunbc.compiler_frontend_program_status joins to occurrence identity. The template's own comment predicted this: "Reordering these calls or dropping the merge that program_assembly_phase_parse_measured performs would change the context with nothing red." It is the filed row realization_respells_a_modeled_folds_sequencing_to_instrument_it, and this is its first real receipt -- the modeled fold moved and the respelling drifted, silently. - program_assembly_phase_parse_measured_seeded: the seeded phase the open-coded loop needs, since it cannot inherit the composition's internal threading. - program_assembly_measured_alloc: returns the SEED on a refused parse, never allocator_initial() -- the latter would rewind the whole ingest at the first bad file, silently, and only on the emitted route. - program_assembly_allocator_next: the mark as a scalar, following the convention the three memo counters already use. - The driver threads context_state.alloc through the loop and reports occurrence_seed / occurrence_next on its per-file JSON line, so the hand-off is read off the built binary rather than argued. Co-Authored-By: Claude Opus 5 (1M context) --- src/v1/05_emit_rust.dag | 27 +++++++++++-- src/v2/compiler/program_assembly.dag | 59 ++++++++++++++++++++++++++++ 2 files changed, 83 insertions(+), 3 deletions(-) diff --git a/src/v1/05_emit_rust.dag b/src/v1/05_emit_rust.dag index ce8fcb0e49a..27692a65c32 100644 --- a/src/v1/05_emit_rust.dag +++ b/src/v1/05_emit_rust.dag @@ -17124,7 +17124,9 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str "use ", crate_name, "::v2_compiler_program_assembly::\{", "\n", " program_assembly_measured_outcome, program_assembly_memo_hits,", "\n", " program_assembly_memo_lookup_calls, program_assembly_memo_misses,", "\n", - " program_assembly_phase_normalize, program_assembly_phase_parse_measured,", "\n", + " program_assembly_allocator_next, program_assembly_measured_alloc,", "\n", + " program_assembly_phase_normalize,", "\n", + " program_assembly_phase_parse_measured_seeded,", "\n", " program_assembly_phase_token_count, program_assembly_phase_tokenize,", "\n", "\};", "\n", "use ", crate_name, "::gunbc_witness_v2_native_route::\{", "\n", @@ -17596,13 +17598,21 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " // per-file constant. Counted outside every phase span so it prices none of them.", "\n", " let file_tokens = program_assembly_phase_token_count(tokens.clone());", "\n", " let parse_started = Instant::now();", "\n", - " let measured = program_assembly_phase_parse_measured(", "\n", + " // SEEDED FROM THE MARK THE CONTEXT HAS REACHED, because this loop IS a source graph:", "\n", + " // std.occurrence_identity occurrence_identity_scope_law requires one allocator threaded", "\n", + " // across every parsed source, and a per-file reset makes two files' occurrence #N the", "\n", + " // same value with different meanings. The modeled fold threads it internally; this", "\n", + " // respelling has to thread it explicitly or it keeps the reset the fold no longer has.", "\n", + " let file_seed = context_state.alloc.clone();", "\n", + " let file_seed_reported = file_seed.clone();", "\n", + " let measured = program_assembly_phase_parse_measured_seeded(", "\n", " tokens.clone(),", "\n", " front_end.prepared.clone(),", "\n", " // The residue field is an Optional whose inner type rides a recursion cycle, so the", "\n", " // emitted record BOXES it while the phase takes the option by value. Deref the box", "\n", " // rather than clone it; the sibling fields above are Rc and clone correctly.", "\n", " (*front_end.residue).clone(),", "\n", + " file_seed.clone(),", "\n", " );", "\n", " let file_parse_nanos = span_nanos(parse_started);", "\n", " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --", "\n", @@ -17611,6 +17621,10 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " let file_memo_hits = program_assembly_memo_hits(measured.clone());", "\n", " let file_memo_misses = program_assembly_memo_misses(measured.clone());", "\n", " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());", "\n", + " // Read BEFORE program_assembly_measured_outcome consumes `measured`. On a refused parse", "\n", + " // this returns the seed unchanged -- nothing minted, so nothing advanced.", "\n", + " let file_alloc = program_assembly_measured_alloc(measured.clone(), file_seed);", "\n", + " let file_alloc_reported = file_alloc.clone();", "\n", " let parsed = program_assembly_measured_outcome(measured);", "\n", " let normalize_started = Instant::now();", "\n", " let root = program_assembly_phase_normalize(parsed.clone());", "\n", @@ -17619,7 +17633,7 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " // that is not the front end, timed separately because a quadratic accumulator would", "\n", " // live here and nowhere else in this loop.", "\n", " let absorb_started = Instant::now();", "\n", - " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone());", "\n", + " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone(), file_alloc);", "\n", " let file_absorb_nanos = span_nanos(absorb_started);", "\n", " let file_nanos = span_nanos(file_started);", "\n", " tokenize_nanos += file_tokenize_nanos;", "\n", @@ -17649,6 +17663,13 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " \"memo_hits\": file_memo_hits,", "\n", " \"memo_misses\": file_memo_misses,", "\n", " \"memo_lookup_calls\": file_memo_lookups,", "\n", + " // THE THREADING, MADE OBSERVABLE. occurrence_seed is the mark this file was", "\n", + " // handed and occurrence_next the mark it reached, so a multi-file run shows", "\n", + " // one sequence continuing across files instead of each file restarting at 0.", "\n", + " // A REFUSED file reports next == seed: nothing was minted, so the mark HANDS", "\n", + " // OFF unchanged rather than rewinding, and the next file continues from it.", "\n", + " \"occurrence_seed\": program_assembly_allocator_next(file_seed_reported),", "\n", + " \"occurrence_next\": program_assembly_allocator_next(file_alloc_reported),", "\n", " \}),", "\n", " );", "\n", " \}", "\n", diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index f3cf52d8891..694612ad16c 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -12,6 +12,7 @@ import v2.compiler.tokenize { tokenize } import v2.compiler.parse { ParseArtifact, parse_module_prepared_seeded, + parse_module_prepared_measured_seeded, ParseProductionMeasured, PreparedGrammar, parse_memo_stats_empty, @@ -206,6 +207,64 @@ fn program_assembly_phase_parse_measured( } } +// THE SEEDED MEASURED PHASE, AND THE MARK READ BACK OUT AS A SCALAR. These two exist for the +// emitted `SourceRootEvalDriver`, which does not call the composed per-file fold: it open-codes the +// sequence so a clock can sit between the phases, which is admitted debt filed at +// `gunbc.recurring_failure_mode` `realization_respells_a_modeled_folds_sequencing_to_instrument_it`. +// That respelling is exactly why the driver needs its own seam -- it cannot inherit the threading +// the composition does internally, so the threading has to be reachable phase by phase or the +// driver silently keeps the per-file reset while the modeled fold no longer has it. +// +// THE FALLBACK ON A REFUSAL IS THE SEED ITSELF, NOT ZERO. A refused parse produces no artifact to +// read a mark from, and the honest answer is the mark the phase was HANDED: nothing after a refusal +// consumed an id, and returning `occurrence_id_allocator_initial()` there would silently rewind the +// whole ingest to the start, reintroducing across the refusal the collision this threading exists +// to prevent. +fn program_assembly_phase_parse_measured_seeded( + tokens: Outcome, + prepared: PreparedGrammar, + residue: Diagnostics, + seed: OccurrenceIdAllocator +) -> ParseProductionMeasured { + match tokens { + Rejected { diagnostics: d } => + ParseProductionMeasured { + outcome: Rejected { diagnostics: d }, + memo: parse_memo_stats_empty() + } + Accepted { value: token_stream, diagnostics: od } => + let measured = parse_module_prepared_measured_seeded( + tokens: token_stream, + prepared: prepared, + validation_residue: residue, + seed: seed + ) + ParseProductionMeasured { + outcome: bind_outcome_accepted(od: od, inner: measured.outcome), + memo: measured.memo + } + } +} + +// THE MARK AS A SCALAR, for the same reason the three memo counters above are read out one at a +// time: the driver prints scalars, and a record does not cross that boundary as one. This is what +// makes the emitted loop's threading OBSERVABLE from outside the binary -- the per-file line carries +// the mark it was handed and the mark it reached, so a run over several files shows one sequence +// continuing rather than a claim that it does. +fn program_assembly_allocator_next(alloc: OccurrenceIdAllocator) -> Int { + alloc.next_id +} + +fn program_assembly_measured_alloc( + measured: ParseProductionMeasured, + seed: OccurrenceIdAllocator +) -> OccurrenceIdAllocator { + match measured.outcome { + Rejected { diagnostics: _ } => seed + Accepted { value: artifact, diagnostics: _ } => artifact.alloc + } +} + fn program_assembly_phase_parse( tokens: Outcome, prepared: PreparedGrammar, From 0be7f11ccd60f521435489b8e4f36ad129dc0d61 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 23:52:15 +0000 Subject: [PATCH 05/16] Install the emitter delta into the stage0 mirror The regen round (claim_executor --regen-round-cost, invoked twice as its own refusal requires) regenerated and installed the mirror for the driver template change. One hunk, carrying only the threading symbols: program_assembly_phase_parse_measured_seeded, program_assembly_measured_alloc, program_assembly_allocator_next, and the occurrence_seed / occurrence_next report fields. The round also regenerated src/v1/stage0/src/std_measure.rs (+46 lines, GrainRounding and checked-arithmetic imports). That is main's own measure_grain_rounding work whose mirror had not been regenerated; it is not this lane's and is left to its owner rather than carried here. Co-Authored-By: Claude Opus 5 (1M context) --- src/v1/stage0/src/v1_compiler_emit_rust.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/v1/stage0/src/v1_compiler_emit_rust.rs b/src/v1/stage0/src/v1_compiler_emit_rust.rs index 1e28f650350..5a121dd52c7 100644 --- a/src/v1/stage0/src/v1_compiler_emit_rust.rs +++ b/src/v1/stage0/src/v1_compiler_emit_rust.rs @@ -38885,7 +38885,7 @@ pub fn emit_source_root_eval_driver_main_rs( crate::v1_compiler_emit_core_support::module_to_filename(pipeline_module.clone()); Rc::new(TextFile { path: v1_rt::concat(v1_rt::concat(rust_source_root(), "main".to_string()), rust_source_ext()), - content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_resolution, native_census_modules, native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_selected, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_phase_normalize, program_assembly_phase_parse_measured,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { diagnostics } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER DIAGNOSTIC, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), diagnostics.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_selected(ingest.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_prepared.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured performs would change the context with nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone());".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), + content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_resolution, native_census_modules, native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_selected, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_allocator_next, program_assembly_measured_alloc,".to_string()), "\n".to_string()), " program_assembly_phase_normalize,".to_string()), "\n".to_string()), " program_assembly_phase_parse_measured_seeded,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { diagnostics } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER DIAGNOSTIC, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), diagnostics.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_selected(ingest.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_prepared.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured performs would change the context with nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " // SEEDED FROM THE MARK THE CONTEXT HAS REACHED, because this loop IS a source graph:".to_string()), "\n".to_string()), " // std.occurrence_identity occurrence_identity_scope_law requires one allocator threaded".to_string()), "\n".to_string()), " // across every parsed source, and a per-file reset makes two files' occurrence #N the".to_string()), "\n".to_string()), " // same value with different meanings. The modeled fold threads it internally; this".to_string()), "\n".to_string()), " // respelling has to thread it explicitly or it keeps the reset the fold no longer has.".to_string()), "\n".to_string()), " let file_seed = context_state.alloc.clone();".to_string()), "\n".to_string()), " let file_seed_reported = file_seed.clone();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured_seeded(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " file_seed.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " // Read BEFORE program_assembly_measured_outcome consumes `measured`. On a refused parse".to_string()), "\n".to_string()), " // this returns the seed unchanged -- nothing minted, so nothing advanced.".to_string()), "\n".to_string()), " let file_alloc = program_assembly_measured_alloc(measured.clone(), file_seed);".to_string()), "\n".to_string()), " let file_alloc_reported = file_alloc.clone();".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone(), file_alloc);".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " // THE THREADING, MADE OBSERVABLE. occurrence_seed is the mark this file was".to_string()), "\n".to_string()), " // handed and occurrence_next the mark it reached, so a multi-file run shows".to_string()), "\n".to_string()), " // one sequence continuing across files instead of each file restarting at 0.".to_string()), "\n".to_string()), " // A REFUSED file reports next == seed: nothing was minted, so the mark HANDS".to_string()), "\n".to_string()), " // OFF unchanged rather than rewinding, and the next file continues from it.".to_string()), "\n".to_string()), " \"occurrence_seed\": program_assembly_allocator_next(file_seed_reported),".to_string()), "\n".to_string()), " \"occurrence_next\": program_assembly_allocator_next(file_alloc_reported),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), }) } } From c0b1d810ca1c9ce9822234b5f701e280e8ad5c62 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 00:37:03 +0000 Subject: [PATCH 06/16] Three annotations said more than the code does (review 69819) All three were mine, all three were false, and they are the class this package exists to correct -- prose asserting a behaviour the code does not have (DESIGN 4c), written by the author who had just corrected it elsewhere. - v2.compiler.compile native_test_context_absorb claimed "THE MARK ADVANCES ON EVERY ARM, INCLUDING THE REFUSING ONES". It does not. program_assembly_read_to_normalized_root_seeded returns alloc: seed on the tokenize/parse refusal arm -- the pre-read mark, i.e. the rollback the same paragraph said would reintroduce the collision. - program_assembly said "nothing after a refusal consumed an id". A refused parse HAS minted ids; parse_prov_seeded threads the allocator through the whole attempt. - program_assembly said a refused read reports an empty index because "no occurrence was minted". The index is empty because the artifact holding it does not exist on that arm, which is a weaker and true statement. WHAT IS NOT CHANGED, AND WHY. Advancing the mark on a parse refusal needs the mark the attempt reached, and ParseExprRejected carries no provenance state BY CONSTRUCTION: the parse core backtracks, so a failed branch's mints are abandoned by design. Recovering it means threading prov out of 35 construction sites in the parse core AND deciding what the allocator means across a backtrack -- a parse-core design question with its own owner and evidence bar, not a fold-threading detail. So the precondition is NAMED where the reuse happens instead of assumed. Reusing a refused parse's ids is sound exactly while nothing retains that parse's node loci. Today nothing does -- NativeTestFileRefusal carries three symbols and no Locus -- but gunbc#11965's remainder 1 proposes widening it. Widening it without first advancing this mark reopens the collision, and span_index_merge is base-wins, so the join would answer with a confident wrong file rather than refusing. That obligation now sits on the carrier. Claims re-run at this head: two_files_attribute_to_their_own_files, refused_assembly_still_locates_the_files_it_parsed, native_route_threads_the_occurrence_mark_across_files -- 3/3 PASS. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/00_compile.dag | 31 ++++++++++++++++++++++++---- src/v2/compiler/program_assembly.dag | 26 ++++++++++++++++------- 2 files changed, 46 insertions(+), 11 deletions(-) diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index 24550b40391..d30166a05fd 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -1276,10 +1276,33 @@ fn native_test_file_refusal(path: Symbol, d: NonEmptyDiagnostics) -> NativeTestF // front end was entered -- as one composed call (native_test_context_from_ingest below) or phase // by phase with a clock between them (std.compiler_entry.SourceRootEvalDriver). Neither caller // changes what is absorbed. -// THE MARK ADVANCES ON EVERY ARM, INCLUDING THE REFUSING ONES. A read that refused still consumed -// the ids it minted before it stopped, so carrying the incoming mark forward regardless of outcome -// is what keeps the next file from reusing them -- rolling back to the pre-read mark on a refusal -// would reintroduce exactly the collision this field exists to prevent, one file later. +// WHAT THIS ARM CARRIES, STATED AS THE CODE ACTUALLY BEHAVES (review 69819). Every arm stores the +// mark `program_assembly_read_to_normalized_root_seeded` returned, and that producer does NOT +// advance it uniformly: a read whose NORMALIZE or graft refused reports the mark its parse reached, +// while a read whose TOKENIZE or PARSE refused reports the mark it was HANDED. An earlier revision +// of this paragraph claimed the mark advances on every arm including the refusing ones. It does +// not, and that sentence was the same defect this package exists to correct -- prose asserting a +// behaviour the code does not have (DESIGN section 4c) -- written by the author who had just +// corrected it elsewhere. +// +// WHY THE PARSE-REFUSAL ARM DOES NOT ADVANCE, AND WHAT THAT COSTS. A refused parse has minted ids: +// `parse_prov_seeded` threads the allocator through the whole attempt. Those ids are reachable only +// from values the refusal discards -- `ParseExprRejected` carries no provenance state, by +// construction, because the parse core BACKTRACKS and a failed branch's mints are abandoned by +// design. So the mark the attempt reached is not recoverable here without threading provenance out +// of all 35 `ParseExprRejected` sites AND deciding what the allocator means across a backtrack, +// which is a change to the parse core and its own package, not a fold-threading detail. +// +// THE CONSTRAINT THAT MAKES THE CURRENT ARM SAFE, NAMED RATHER THAN ASSUMED. Reusing a refused +// parse's ids is sound exactly while nothing retains that parse's node loci. Today nothing does: +// `native_test_vocabulary` `NativeTestFileRefusal` keeps `path`, `head_reason` and `fatal_reason` +// -- three symbols, no `Locus`. That is a property of a carrier scheduled to change: gunbc#11965's +// named remainder 1 proposes widening it to carry the front end's loci. WIDENING IT WITHOUT FIRST +// ADVANCING THIS MARK REOPENS THE COLLISION -- a refused file's retained `NodeLocus` would carry an +// id the next file re-mints and records a span for, and `span_index_merge` is base-wins, so the +// join would answer with a confident wrong file rather than refusing (DESIGN section 5). Whoever +// widens that record owns this precondition, and it is written here because that is where the reuse +// happens. fn native_test_context_absorb( state: NativeTestContextFoldState, read: DagSourceReadWitness, diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index 694612ad16c..478e4067aac 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -215,11 +215,19 @@ fn program_assembly_phase_parse_measured( // the composition does internally, so the threading has to be reachable phase by phase or the // driver silently keeps the per-file reset while the modeled fold no longer has it. // -// THE FALLBACK ON A REFUSAL IS THE SEED ITSELF, NOT ZERO. A refused parse produces no artifact to -// read a mark from, and the honest answer is the mark the phase was HANDED: nothing after a refusal -// consumed an id, and returning `occurrence_id_allocator_initial()` there would silently rewind the -// whole ingest to the start, reintroducing across the refusal the collision this threading exists -// to prevent. +// THE FALLBACK ON A REFUSAL IS THE SEED ITSELF, NOT ZERO, AND NOT THE MARK THE ATTEMPT REACHED. +// Returning `occurrence_id_allocator_initial()` would silently rewind the whole ingest to the +// start, which is the collision this threading exists to prevent, at its worst. +// +// THE SEED IS A FLOOR, NOT A STATEMENT THAT NOTHING WAS MINTED (review 69819). A refused parse HAS +// minted ids -- `parse_prov_seeded` threads the allocator through the entire attempt -- and an +// earlier revision of this paragraph said "nothing after a refusal consumed an id", which was +// false. What is true is that the mark the attempt reached is not RECOVERABLE here: +// `ParseExprRejected` carries no provenance state, by construction, because the parse core +// backtracks and a failed branch's mints are abandoned by design. Reusing those ids is sound +// exactly while nothing retains a refused parse's node loci; the precondition and the carrier that +// would break it are named on `v2.compiler.compile` `native_test_context_absorb`, which is where +// the reuse actually happens. fn program_assembly_phase_parse_measured_seeded( tokens: Outcome, prepared: PreparedGrammar, @@ -326,8 +334,12 @@ type ProgramAssemblySeededRead { // index, and it is exactly the file whose diagnostic a reader needs located. Returning // Outcome<...> alone would discard that index on the arm where it matters most. // -// TOKENIZE OR PARSE REFUSING IS DIFFERENT AND REPORTS AN EMPTY INDEX HONESTLY: no occurrence was -// minted, so there is nothing to carry. Absence here is an answer, not a dropped value. +// TOKENIZE OR PARSE REFUSING REPORTS AN EMPTY INDEX, and the reason is that the artifact holding +// the index does not exist on that arm -- NOT that no occurrence was minted. A refused parse mints +// ids and records spans for them inside a `ParseProvenanceState` the refusal discards. Empty here +// is therefore "this producer cannot reach what was recorded", which `span_index_lookup` turns into +// a refusal at the join rather than a wrong locus -- the fail-closed arm. An earlier revision of +// this sentence claimed nothing was minted, which was a stronger and false claim (review 69819). type ProgramAssemblySeededReadResult { alloc: OccurrenceIdAllocator, spans: SpanIndex, From d87cbedceea6b55298d736006413a1a735ade7fb Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 01:26:06 +0000 Subject: [PATCH 07/16] Delete the orphaned unseeded composition; the template repeated the retracted sentence review 69837, both findings confirmed against the code. 1. ORPHANED UNSEEDED DOOR. Moving native_test_context_fold_step onto the seeded producer left program_assembly_read_to_normalized_root_prepared reachable only from program_assembly_read_to_normalized_root, which has no caller anywhere in the tree. A pub declaration with no call site in the closure (DESIGN 3c), and worse than inert: a surviving unseeded per-file composition is DESIGN 3's attractor, so the next fold needing a per-file front end answers in its vocabulary and silently reintroduces the reset. This branch's own 02_parse annotation already concedes no wall catches that. Both deleted; 00_compile's now-unused import removed. The seeded producer is the single per-file front end, and an isolated scope is requested by passing occurrence_id_allocator_initial() explicitly, which is a statement rather than a default. 2. THE EMITTED TEMPLATE REPEATED THE SENTENCE I HAD JUST RETRACTED TWICE. 05_emit_rust.dag rendered "nothing minted, so nothing advanced" and "nothing was minted" into the driver's own comments -- the exact claim corrected in program_assembly and 00_compile one commit earlier, left standing in a third site I also wrote. Both now say what is true: the arm returns the mark it was HANDED because ParseExprRejected carries no provenance state, not because nothing was minted. I fixed two sites and did not sweep for the third. This is the sixth prose-over-code defect on this branch and the second where the correction itself was incomplete, so the sweep is now part of the fix: every file this branch touches was grepped for the claim shape, and the only surviving hits are the corrections and one pre-existing unrelated line in 02_parse. Also repaired the template's citation of the deleted composition, which the deletion would otherwise have left naming nothing (DESIGN 3). NOT TOUCHED, flagged instead: dag/gunbc/type_reference_containment_binding.dag carries a NewlyExposedRustDiagnosticIdentity row citing the deleted declaration. That roster has no consumer and belongs to another lane, so its owner should retire the row rather than have me edit their ledger. Claims at this head: native_route_threads_the_occurrence_mark_across_files PASS. Co-Authored-By: Claude Opus 5 (1M context) --- src/v1/05_emit_rust.dag | 15 ++++++--- src/v2/compiler/00_compile.dag | 1 - src/v2/compiler/program_assembly.dag | 46 ++++++++++------------------ 3 files changed, 27 insertions(+), 35 deletions(-) diff --git a/src/v1/05_emit_rust.dag b/src/v1/05_emit_rust.dag index f5aa84d53b4..39f24887f12 100644 --- a/src/v1/05_emit_rust.dag +++ b/src/v1/05_emit_rust.dag @@ -17561,7 +17561,9 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " // themselves are v2.compiler.program_assembly declarations and each binds the previous", "\n", " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the", "\n", " // inter-phase diagnostic merge exist twice -- here and in the modeled composition", "\n", - " // program_assembly_read_to_normalized_root_prepared.", "\n", + " // program_assembly_read_to_normalized_root_seeded. (It named the UNSEEDED composition", "\n", + " // until that one was deleted for having no caller; the seeded producer is now the single", "\n", + " // modeled per-file front end, and this loop is still its second spelling.)", "\n", " //", "\n", " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):", "\n", " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.", "\n", @@ -17628,7 +17630,10 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " let file_memo_misses = program_assembly_memo_misses(measured.clone());", "\n", " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());", "\n", " // Read BEFORE program_assembly_measured_outcome consumes `measured`. On a refused parse", "\n", - " // this returns the seed unchanged -- nothing minted, so nothing advanced.", "\n", + " // this returns the seed unchanged. Not because nothing was minted -- a refused parse", "\n", + " // HAS minted ids -- but because ParseExprRejected carries no provenance state, so the", "\n", + " // mark the attempt reached is not recoverable. See the precondition on", "\n", + " // v2.compiler.compile native_test_context_absorb.", "\n", " let file_alloc = program_assembly_measured_alloc(measured.clone(), file_seed);", "\n", " let file_alloc_reported = file_alloc.clone();", "\n", " let parsed = program_assembly_measured_outcome(measured);", "\n", @@ -17672,8 +17677,10 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " // THE THREADING, MADE OBSERVABLE. occurrence_seed is the mark this file was", "\n", " // handed and occurrence_next the mark it reached, so a multi-file run shows", "\n", " // one sequence continuing across files instead of each file restarting at 0.", "\n", - " // A REFUSED file reports next == seed: nothing was minted, so the mark HANDS", "\n", - " // OFF unchanged rather than rewinding, and the next file continues from it.", "\n", + " // A REFUSED file reports next == seed. That is the mark it was HANDED, not a", "\n", + " // claim that nothing was minted: a refused parse mints ids that the refusal", "\n", + " // discards unrecoverably. The next file continues from the seed rather than", "\n", + " // rewinding to zero.", "\n", " \"occurrence_seed\": program_assembly_allocator_next(file_seed_reported),", "\n", " \"occurrence_next\": program_assembly_allocator_next(file_alloc_reported),", "\n", " \}),", "\n", diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index d30166a05fd..caf057e3284 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -51,7 +51,6 @@ import v2.compiler.program_assembly { program_assembly_read_to_normalized_root_seeded, assemble_program_from_ingest, program_assembly_fold_ingest, - program_assembly_read_to_normalized_root_prepared, ProgramAssemblyFoldState, ProgramAssemblyFoldOk, ProgramAssemblyFoldFailed diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index 478e4067aac..5dbf14d0662 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -379,36 +379,22 @@ fn program_assembly_read_to_normalized_root_seeded( } } -fn program_assembly_read_to_normalized_root_prepared( - read: DagSourceReadWitness, - lm: LanguageModel, - prepared: PreparedGrammar, - residue: Diagnostics -) -> Outcome { - program_assembly_phase_normalize( - parsed: program_assembly_phase_parse( - tokens: program_assembly_phase_tokenize(read: read, lm: lm), - prepared: prepared, - residue: residue - ) - ) -} - -fn program_assembly_read_to_normalized_root( - read: DagSourceReadWitness, - lm: LanguageModel -) -> Outcome { - match prepare_grammar(grammar: lm.grammar) { - Rejected { diagnostics: d } => Rejected { diagnostics: d } - Accepted { value: prepared, diagnostics: residue } => - program_assembly_read_to_normalized_root_prepared( - read: read, - lm: lm, - prepared: prepared, - residue: residue - ) - } -} +// THE UNSEEDED PER-FILE COMPOSITION IS DELETED, NOT RETAINED (review 69837). It was +// `program_assembly_read_to_normalized_root_prepared` and its nullary sibling +// `program_assembly_read_to_normalized_root`: a second per-file front-end composition that still +// performed the per-file allocator reset. This change moved its last real consumer +// (`v2.compiler.compile` `native_test_context_fold_step`) onto the seeded door, which left the pair +// reachable from nothing -- DESIGN section 3c's "a pub declaration with no call site in the +// closure". +// +// DELETED RATHER THAN LEFT STANDING, because a surviving unseeded composition is DESIGN section 3's +// attractor: while it stands, the next fold that needs a per-file front end answers in its +// vocabulary and silently reintroduces the reset. This module's own annotation on `02_parse` +// already concedes that hazard is real and that no wall catches it -- "a NEW ingest fold that calls +// the unseeded door is a defect this annotation cannot catch" -- so the honest move is to remove +// the door rather than document the trap beside it. The seeded producer above is now the single +// per-file front end, and a caller that wants an isolated scope seeds it with +// `occurrence_id_allocator_initial()` explicitly, which is a statement rather than a default. // THE FAILING READ'S OWN SPANS ARE MERGED IN BEFORE THE REFUSAL IS BUILT (`carried`), and that is // the point of the repair review 69607 asked for: a file that parsed and then failed to normalize From b5eed5e5df9b772eef1be9141187a6a358224578 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 02:09:21 +0000 Subject: [PATCH 08/16] Finish the deletion: the two orphaned parse phases and the citations it dangled review 69852, both findings confirmed. Both are consequences of my own deletion one commit earlier, which is the point worth stating: I removed the unseeded composition, checked ONE level of consumers, and declared it clean. - Deleting program_assembly_read_to_normalized_root_prepared orphaned its two callees. program_assembly_phase_parse had no caller but its own definition; program_assembly_phase_parse_measured was called only by it. The second is the UNSEEDED parse phase, so the argument I used to justify the previous deletion applied verbatim to something I left standing one layer down -- DESIGN 3's attractor, still reachable, still resetting per file. Both deleted. The bind_outcome reasoning the unseeded twin carried moves onto the seeded survivor rather than being deleted with it. - The deletion dangled two STRUCTURED citations, and they get different dispositions because they record different things: * recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it evidence re-pointed to ..._seeded. The class is unchanged and still live: the emitted driver still re-spells the fold, now against the seeded producer. Its dated specimen prose keeps the history and gains a note that the composition was deleted here. * type_reference_containment_binding's NewlyExposedRustDiagnosticIdentity row REMOVED, not re-pointed. Re-pointing would falsify -- the seeded producer never produced that E0308. The roster has no consumer anywhere, so nothing executable changes. If that census is historical rather than current, its owner should restore the row; I removed it because I am the one who made its subject stop existing. - Stale prose in the emitted template repaired (it named the deleted measured phase as what the loop performs). THE SWEEP IS PART OF THE FIX, because this is the second partial correction in two commits. All four deleted symbols were grepped tree-wide; every surviving hit is either a dated prose receipt in another lane's historical record, which correctly names what existed then, or this branch's own deletion note. Claims at this head: native_route_threads_the_occurrence_mark_across_files and cli_fatal_line_names_the_file_and_bytes -- both PASS. Co-Authored-By: Claude Opus 5 (1M context) --- ...eled_folds_sequencing_to_instrument_it.dag | 4 +- .../type_reference_containment_binding.dag | 1 - src/v1/05_emit_rust.dag | 3 +- src/v2/compiler/program_assembly.dag | 54 +++---------------- 4 files changed, 12 insertions(+), 50 deletions(-) diff --git a/dag/gunbc/recurring_failure_mode/realization_respells_a_modeled_folds_sequencing_to_instrument_it.dag b/dag/gunbc/recurring_failure_mode/realization_respells_a_modeled_folds_sequencing_to_instrument_it.dag index b72b9363a9e..4d3b24c6614 100644 --- a/dag/gunbc/recurring_failure_mode/realization_respells_a_modeled_folds_sequencing_to_instrument_it.dag +++ b/dag/gunbc/recurring_failure_mode/realization_respells_a_modeled_folds_sequencing_to_instrument_it.dag @@ -18,7 +18,7 @@ data realization_respells_a_modeled_folds_sequencing_to_instrument_it: Recurring "WHAT IS ALREADY SINGLE-AUTHORED, so the row is not read as wider than it is. Only the ordering and the inter-phase diagnostic merge are re-spelled. The absorbing half of the step -- the qualified-name read and the source-root index insertion -- stays one declaration that the driver calls (`v2.compiler.compile` `native_test_context_absorb`), the per-phase bodies are each one modeled declaration, and the unmeasured composition remains live and is executed by the SAME BINARY in its census mode, so the two spellings ship together rather than one replacing the other.", - "SPECIMEN, gunbc PR 11219 (perf item C instrument), 2026-09-13, found by review 65068 rather than by a mechanism. `v2.compiler.program_assembly` `program_assembly_read_to_normalized_root_prepared` composes tokenize, parse and normalize in one declaration, each phase binding the previous phase's `Outcome`. The emitted `std.compiler_entry.SourceRootEvalDriver` opens that sequence as a Rust `for` loop over the ingest -- `program_assembly_phase_tokenize`, then `program_assembly_phase_parse_measured`, then `program_assembly_measured_outcome`, then `program_assembly_phase_normalize`, then `native_test_context_absorb` -- so that each call can be bracketed by `Instant::now()`. The diff's own comment asserted the equivalence in prose; nothing executed it.", + "SPECIMEN, gunbc PR 11219 (perf item C instrument), 2026-09-13, found by review 65068 rather than by a mechanism. `v2.compiler.program_assembly` `program_assembly_read_to_normalized_root_prepared` composes tokenize, parse and normalize in one declaration, each phase binding the previous phase's `Outcome`. (That composition and its unseeded phases were DELETED by gunbc#11985, which threaded one occurrence allocator across the ingest and left them with no caller; the class is unchanged and its live instance is now the same loop re-spelling `program_assembly_read_to_normalized_root_seeded`, which the evidence below names.) The emitted `std.compiler_entry.SourceRootEvalDriver` opens that sequence as a Rust `for` loop over the ingest -- `program_assembly_phase_tokenize`, then `program_assembly_phase_parse_measured_seeded`, then `program_assembly_measured_outcome`, then `program_assembly_phase_normalize`, then `native_test_context_absorb` -- so that each call can be bracketed by `Instant::now()`. The diff's own comment asserted the equivalence in prose; nothing executed it.", "IT IS THE MODULE THAT OWNS THE ORDER THAT IS FORKED, AND AN EARLIER REVISION OF THIS ROW DID NOT REACH IT (review 65114). The row first argued only against `v2.compiler.program_assembly` `program_assembly_read_to_normalized_root_prepared`, the composition sitting beside the phases. The declared authority for the .dag front-end ORDER is `v2.compiler.staged_front_end`, whose own header names re-inlining its calls as the section-3 nickname class; a per-phase decomposition authored anywhere else is a second copy of THAT order, and saying so against the local composition understated the fork.", @@ -34,7 +34,7 @@ data realization_respells_a_modeled_folds_sequencing_to_instrument_it: Recurring ], evidence: [ - DeclarationRef { module_path: "v2.compiler.program_assembly", decl_name: "program_assembly_read_to_normalized_root_prepared", field: WholeDeclaration }, + DeclarationRef { module_path: "v2.compiler.program_assembly", decl_name: "program_assembly_read_to_normalized_root_seeded", field: WholeDeclaration }, DeclarationRef { module_path: "v2.compiler.staged_front_end", decl_name: "run_front_end_to", field: WholeDeclaration }, DeclarationRef { module_path: "v2.compiler.compile", decl_name: "native_test_context_absorb", field: WholeDeclaration }, ], diff --git a/dag/gunbc/type_reference_containment_binding.dag b/dag/gunbc/type_reference_containment_binding.dag index 139b05ec359..ce936006259 100644 --- a/dag/gunbc/type_reference_containment_binding.dag +++ b/dag/gunbc/type_reference_containment_binding.dag @@ -67,7 +67,6 @@ data type_reference_containment_binding_newly_exposed_string_identities: List, - prepared: PreparedGrammar, - residue: Diagnostics -) -> ParseProductionMeasured { - match tokens { - Rejected { diagnostics: d } => - ParseProductionMeasured { - outcome: Rejected { diagnostics: d }, - memo: parse_memo_stats_empty() - } - Accepted { value: token_stream, diagnostics: od } => - let measured = parse_module_prepared_measured( - tokens: token_stream, - prepared: prepared, - validation_residue: residue - ) - ParseProductionMeasured { - outcome: bind_outcome_accepted(od: od, inner: measured.outcome), - memo: measured.memo - } - } -} - // THE SEEDED MEASURED PHASE, AND THE MARK READ BACK OUT AS A SCALAR. These two exist for the // emitted `SourceRootEvalDriver`, which does not call the composed per-file fold: it open-codes the // sequence so a clock can sit between the phases, which is admitted debt filed at @@ -215,6 +181,14 @@ fn program_assembly_phase_parse_measured( // the composition does internally, so the threading has to be reachable phase by phase or the // driver silently keeps the per-file reset while the modeled fold no longer has it. // +// THE REJECTED-INPUT ARM REPRODUCES bind_outcome EXACTLY, and is spelled out rather than reused +// because bind_outcome cannot carry a second value out of the bound function: a Rejected token +// stream passes its diagnostics through untouched and reports empty accounting, because no parse +// ran -- an answer, not a missing measurement. The Accepted arm merges the incoming diagnostics +// through bind_outcome_accepted, which is what bind_outcome itself calls. (That reasoning arrived +// here with the unseeded twin this phase replaced; the twin is deleted, so the reasoning moves to +// the survivor rather than being deleted with it.) +// // THE FALLBACK ON A REFUSAL IS THE SEED ITSELF, NOT ZERO, AND NOT THE MARK THE ATTEMPT REACHED. // Returning `occurrence_id_allocator_initial()` would silently rewind the whole ingest to the // start, which is the collision this threading exists to prevent, at its worst. @@ -273,18 +247,6 @@ fn program_assembly_measured_alloc( } } -fn program_assembly_phase_parse( - tokens: Outcome, - prepared: PreparedGrammar, - residue: Diagnostics -) -> Outcome { - program_assembly_phase_parse_measured( - tokens: tokens, - prepared: prepared, - residue: residue - ).outcome -} - // The three counters, read out one at a time because the driver prints scalars and a record does // not cross that boundary as one. fn program_assembly_memo_hits(measured: ParseProductionMeasured) -> Int { From fb6b873e1d54183b0369863152757cb842b11fbe Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 07:26:32 +0000 Subject: [PATCH 09/16] One home for the occurrence-id projection; delete the carrier the restructure orphaned review 70027, both findings confirmed against the code. 1. ProgramAssemblySeededRead { tree, alloc, spans } was declared and never constructed, matched or imported. I introduced it, then restructured to ProgramAssemblySeededReadResult when the refusal arm had to carry spans, and left the original standing -- DESIGN 3c's "pub declaration with no call site in the closure". Its annotation described the seeded FUNCTION rather than the type, which is how it survived my own sweep. Deleted, and the reasoning folded onto the carrier that exists. 2. The same Node -> Optional projection was minted twice, arm for arm: lens_verdict_node_occurrence_id_optional for the renderer and attribution_id_of in the claim module. That is DESIGN 3's nickname, a second name for one concept -- and this PR argues against it in its own annotation on span_index_textual_locus_optional ("a consumer re-deciding it would be a second authority"). I wrote that sentence and then did the thing it forbids, two files away. Hoisted to v2.std.provenance as node_occurrence_id_optional. That module rather than v2.std.node because provenance owns the join this projection feeds, already imports Optional and Node, and -- the deciding fact -- BOTH consumers already import it, so neither gains a dependency. Putting it on v2.std.node would have added an Optional import to a load-bearing module for one accessor. Claims at this head: two_files_attribute_to_their_own_files, cli_fatal_line_names_the_file_and_bytes, native_route_threads_the_occurrence_mark_across_files -- 3/3 PASS. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/program_assembly.dag | 21 +++++++++--------- src/v2/std/lens_verdict.dag | 12 ++-------- src/v2/std/provenance.dag | 22 ++++++++++++++++++- .../occurrence_file_attribution_test.dag | 19 +++++----------- 4 files changed, 39 insertions(+), 35 deletions(-) diff --git a/src/v2/compiler/program_assembly.dag b/src/v2/compiler/program_assembly.dag index 2889ae604d4..4b3e45ba5cd 100644 --- a/src/v2/compiler/program_assembly.dag +++ b/src/v2/compiler/program_assembly.dag @@ -279,17 +279,16 @@ fn program_assembly_phase_token_count(tokens: Outcome) -> Int { } } -// THE SEEDED PER-FILE FRONT END, WHICH IS THE ONE THE INGEST FOLD USES. It differs from the -// projection below in exactly one respect: the occurrence ids it mints continue the ingest's count -// instead of restarting, and it hands back the artifact so the fold can read the mark it reached -// and the spans it recorded. Normalize is applied to the artifact's tree, so the normalized nodes -// carry occurrence ids drawn from the SAME ingest-wide sequence the span index is keyed by -- that -// agreement is what makes the later join a lookup rather than a search. -type ProgramAssemblySeededRead { - tree: NormalizedTree, - alloc: OccurrenceIdAllocator, - spans: SpanIndex -} +// THE SEEDED PER-FILE FRONT END, WHICH IS THE ONE THE INGEST FOLD USES. The occurrence ids it mints +// continue the ingest's count instead of restarting, and it hands back the mark it reached and the +// spans it recorded so the fold can thread them. Normalize is applied to the parse artifact's tree, +// so the normalized nodes carry occurrence ids drawn from the SAME ingest-wide sequence the span +// index is keyed by -- that agreement is what makes the later join a lookup rather than a search. +// +// (This paragraph described an earlier carrier, `ProgramAssemblySeededRead`, which the restructure +// to the three-field result below replaced and which survived as an unconstructed declaration -- +// DESIGN section 3c's "pub declaration with no call site in the closure", found by review 70027. +// The type is deleted and its reasoning folded here, onto the carrier that exists.) // THE SPANS SURVIVE THIS READ'S OWN REFUSAL, which is the same reason IngestAssembly exists one // layer up: a file that PARSED and then failed to normalize or graft has a fully recorded span diff --git a/src/v2/std/lens_verdict.dag b/src/v2/std/lens_verdict.dag index 9286eec38a5..1592a32ef8e 100644 --- a/src/v2/std/lens_verdict.dag +++ b/src/v2/std/lens_verdict.dag @@ -23,7 +23,7 @@ import extdeps.languages.json.emit { quote_json_string } import v2.std.node { Node, Symbol } import v2.std.grammar { node_atom_identity_optional } import v2.std.optional { Absent, Optional, Present, optional_absent, optional_present } -import v2.std.provenance { SpanIndex, span_index_empty, span_index_textual_locus_optional } +import v2.std.provenance { SpanIndex, node_occurrence_id_optional, span_index_empty, span_index_textual_locus_optional } import v2.std.qualified_name { qualified_name_to_dotted_string } import v2.std.text { String } @@ -139,7 +139,7 @@ fn lens_verdict_node_occurrence_text(node: Node) -> String { // a derivation chain that bottoms out in no textual origin all render exactly as they did before. // Nothing here can invent a file; it can only find one that was recorded. fn lens_verdict_node_occurrence_text_in_spans(node: Node, index: SpanIndex) -> String { - match lens_verdict_node_occurrence_id_optional(node: node) { + match node_occurrence_id_optional(node: node) { Absent => lens_verdict_node_occurrence_text(node: node) Present { value: id } => match span_index_textual_locus_optional(index: index, id: id) { @@ -154,14 +154,6 @@ fn lens_verdict_node_occurrence_text_in_spans(node: Node, index: SpanIndex) -> S } } -fn lens_verdict_node_occurrence_id_optional(node: Node) -> Optional { - match node.occurrence_id { - OccurrenceSynthetic => optional_absent() - OccurrenceMinted { id: id } => optional_present(value: id) - OccurrenceProjected { id: id, caused_by: _ } => optional_present(value: id) - } -} - // ONE `match d.at` FOR THE LOCUS TEXT, AND THE INDEX-FREE DOOR IS ITS PROJECTION. A caller without // a span index passes an empty one, every lookup finds nothing, and every arm renders exactly what // it rendered before -- so the two doors cannot disagree about a locus, because there is only one diff --git a/src/v2/std/provenance.dag b/src/v2/std/provenance.dag index 7035dfdb4eb..fc06bbd724f 100644 --- a/src/v2/std/provenance.dag +++ b/src/v2/std/provenance.dag @@ -14,7 +14,7 @@ import v2.std.diagnostic { } import v2.std.node { Node, Symbol } import v2.std.optional { Absent, Optional, Present } -import std.occurrence_identity { OccurrenceId } +import std.occurrence_identity { OccurrenceId, OccurrenceMinted, OccurrenceProjected, OccurrenceSynthetic } import v2.std.witness { Holds, Violates, Witness, witness_from_optional, witness_violates } type OriginEvent @@ -130,6 +130,26 @@ fn span_index_resolve_textual_locus(index: SpanIndex, id: OccurrenceId) -> Witne } } +// A NODE'S OCCURRENCE ID, IF IT HAS ONE. Both arms that carry an id answer with it and a synthetic +// node answers Absent -- which is the question every consumer of the span index asks first, because +// the index is keyed by OccurrenceId and a Node is what a diagnostic actually holds. +// +// IT LIVES HERE RATHER THAN AT EACH CONSUMER (review 70027). This diff first minted the same +// three-arm projection twice, arm for arm -- once in `v2.std.lens_verdict` for the renderer and +// once in the attribution claim -- which is DESIGN section 3's nickname: a second name for one +// concept, duplicating work at the meaning layer. That is the same reasoning the sibling below +// already states for the resolution rule ("a consumer re-deciding it would be a second authority"), +// and it applies to this projection for the same reason. The home is this module because the join +// it feeds is this module's: `NodeOccurrenceIdentity` is `v2.std.node`'s, `OccurrenceId` is +// `std.occurrence_identity`'s, and the place those two meet a SpanIndex is here. +fn node_occurrence_id_optional(node: Node) -> Optional { + match node.occurrence_id { + OccurrenceSynthetic => Absent + OccurrenceMinted { id: id } => Present { value: id } + OccurrenceProjected { id: id, caused_by: _ } => Present { value: id } + } +} + // THE OPTIONAL-SHAPED DOOR, FOR A CONSUMER THAT RENDERS RATHER THAN REFUSES. The Witness-returning // resolver above is the authority and this is its projection: a renderer asking "does this // occurrence have a source position" wants presence or absence, not a second diagnostic to fold diff --git a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag index 3aeba3b501a..7f6501dd2a0 100644 --- a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag +++ b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag @@ -32,7 +32,7 @@ import v2.compiler.normalized_tree { NormalizedTree } import std.algebra { Cons, Empty, FreeMonoid } import v2.std.diagnostic { Outcome, outcome_accepted } import v2.std.optional { Absent, Optional, Present, optional_absent, optional_present } -import v2.std.provenance { SpanIndex, span_index_textual_locus_optional } +import v2.std.provenance { SpanIndex, node_occurrence_id_optional, span_index_textual_locus_optional } import v2.std.text { String } import std.occurrence_identity { OccurrenceId, @@ -115,13 +115,6 @@ fn attribution_has_byte_range(index: SpanIndex, id: OccurrenceId) -> Bool { } } -fn attribution_id_of(node: Node) -> Optional { - match node.occurrence_id { - OccurrenceSynthetic => optional_absent() - OccurrenceMinted { id: id } => optional_present(value: id) - OccurrenceProjected { id: id, caused_by: _ } => optional_present(value: id) - } -} fn attribution_roots() -> Outcome { located_roots_and_spans_from_source_root_ingest( @@ -207,10 +200,10 @@ test fn two_files_mint_distinct_root_occurrences_holds() -> Bool { match attribution_root_for_path(located: roots.located, path: "src/v2/test/fixture/attribution/attribution_b.dag") { Absent => false Present { value: tree_b } => - match attribution_id_of(node: tree_a.root) { + match node_occurrence_id_optional(node: tree_a.root) { Absent => false Present { value: id_a } => - match attribution_id_of(node: tree_b.root) { + match node_occurrence_id_optional(node: tree_b.root) { Absent => false Present { value: id_b } => !(id_a == id_b) } @@ -230,7 +223,7 @@ test fn attributed_occurrence_carries_a_byte_range_holds() -> Bool { match attribution_root_for_path(located: roots.located, path: "src/v2/test/fixture/attribution/attribution_a.dag") { Absent => false Present { value: tree } => - match attribution_id_of(node: tree.root) { + match node_occurrence_id_optional(node: tree.root) { Absent => false Present { value: id } => attribution_has_byte_range(index: roots.spans, id: id) } @@ -424,10 +417,10 @@ fn native_route_roots_have_distinct_occurrences(roots: FreeMonoid false Cons { head: second, tail: _ } => - match attribution_id_of(node: first.root) { + match node_occurrence_id_optional(node: first.root) { Absent => false Present { value: id_a } => - match attribution_id_of(node: second.root) { + match node_occurrence_id_optional(node: second.root) { Absent => false Present { value: id_b } => !(id_a == id_b) } From 99a43e5f7c78b81157a8de1d083fdd6002791e95 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 12:55:52 +0000 Subject: [PATCH 10/16] Delete the third orphan this branch made the same way (review 70130) lens_verdict_diagnostic_located_text had no call site in the closure. Its only two consumers were inside lens_verdict_diagnostics_located_chain_text, and this diff rewrote that fold to call the _in_spans form -- so the rewrite orphaned it. Its neighbours lens_verdict_diagnostic_locus_text and ..._chain_text keep live consumers (11 and 3) and stay. Deleted rather than left standing for the reason this branch already applied twice: a surviving index-free door is DESIGN 3's attractor and is the one the next caller reaches for, silently re-introducing the unlocated render this package exists to remove. A caller with no index says so by passing span_index_empty(), which is a statement rather than a default. THE PATTERN, NAMED BECAUSE IT IS NOW THREE FOR THREE. Every orphan this branch produced was made by a REWRITE, not by an addition: - program_assembly_read_to_normalized_root_prepared (review 69837): its caller moved to the seeded door. - ProgramAssemblySeededRead (review 70027): the carrier was restructured into ProgramAssemblySeededReadResult. - this one: the chain fold moved to _in_spans. In each case I redirected a call site and left the old door standing. Redirecting a call site is a TWO-PART edit and I kept doing only the first part. Grepping for orphans at the end catches it; not creating it means checking the old door's remaining consumers at the moment the caller moves. The review's second, weaker finding does NOT hold and is not actioned: located_roots_and_spans_from_source_root_ingest is imported and called by v2.test.provenance.occurrence_file_attribution, and located_module_roots_from_source_root_ingest by v2.lens.module_graph. Both have live consumers; verified rather than assumed. Claims at this head: cli_fatal_line_names_the_file_and_bytes and two_files_attribute_to_their_own_files -- both PASS. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/std/lens_verdict.dag | 18 ++++++++++++++---- 1 file changed, 14 insertions(+), 4 deletions(-) diff --git a/src/v2/std/lens_verdict.dag b/src/v2/std/lens_verdict.dag index 1592a32ef8e..bef600ce058 100644 --- a/src/v2/std/lens_verdict.dag +++ b/src/v2/std/lens_verdict.dag @@ -188,10 +188,20 @@ fn lens_verdict_diagnostic_locus_text_in_spans(d: Diagnostic, index: SpanIndex) // ONE DIAGNOSTIC, LOCATED: "reason @ locus". The reason alone was what every boundary that // summarized a refusal kept, and the locus is what each of them dropped. -fn lens_verdict_diagnostic_located_text(d: Diagnostic) -> String { - lens_verdict_diagnostic_located_text_in_spans(d: d, index: span_index_empty()) -} - +// +// THE INDEX-FREE SIBLING OF THIS DOOR IS DELETED, NOT RETAINED (review 70130). `..._located_text` +// was consumed only by the chain fold below, which this change rewrote to call the `_in_spans` +// form -- so it became a declaration with no call site in the closure, DESIGN section 3c's +// mechanical tell, while its neighbours `lens_verdict_diagnostic_locus_text` and +// `..._chain_text` kept live consumers and therefore stay. +// +// DELETED RATHER THAN LEFT STANDING for the reason this branch already applied twice, to +// `program_assembly_read_to_normalized_root_prepared` (review 69837) and to the orphaned +// `ProgramAssemblySeededRead` carrier (review 70027): a surviving index-free door is DESIGN +// section 3's attractor, and it is the one the next caller reaches for -- silently re-introducing +// the unlocated render this package exists to remove. A caller that genuinely has no index says so +// by passing `span_index_empty()`, which is a statement rather than a default, exactly as the +// seeded producer argument goes. fn lens_verdict_diagnostic_located_text_in_spans(d: Diagnostic, index: SpanIndex) -> String { concat( symbol_lexeme(sym: d.reason), From 09abdff2a27915e39632fa575e57cf69573c979a Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 13:44:44 +0000 Subject: [PATCH 11/16] The consolidation missed a copy in its own file, and the annotation said it hadn't (review 70138) Two findings, both confirmed, and the first is the worst instance of this branch's recurring defect. 1. attribution_occurrence_file still open-coded the three-arm projection -- in the SAME FILE that imports node_occurrence_id_optional and uses it five times. I consolidated the projection, replaced attribution_id_of, missed the second copy beside it, and then wrote an annotation on the canonical home stating the consolidation was complete in both places. So the code duplicated the concept (DESIGN 3's nickname) and the prose asserted it did not (DESIGN 4c) -- in one change. Now calls the canonical helper. 2. compile_cli's annotation named lens_verdict_diagnostics_located_chain_text and lens_verdict_diagnostic_locus_text as what this module calls, while the same diff rewrote those imports to the _in_spans doors. Prose naming symbols its own code no longer uses. Corrected, and it now says why both are the _in_spans forms: they take the ingest's SpanIndex, which is the whole point of this package. CHECKED THE REST RATHER THAN THE TWO SITES NAMED. Every surviving three-arm match over NodeOccurrenceIdentity was classified: - parse_stamp_span_index_test, parse_memo_frame_replay_test, legacy_binding_delta: untouched by this branch, pre-existing. - 02_parse parse_minted_id_snoc: a fold step appending to a list, a different proposition. - lens_verdict_node_occurrence_text: renders DISTINCT TEXT per arm (from gunbc#11965), so it is a genuine per-arm fold and not a second spelling of the Optional projection. Only the copy I introduced was a duplicate. Claims at this head: two_files_attribute_to_their_own_files, refused_assembly_still_locates_the_files_it_parsed, cli_fatal_line_names_the_file_and_bytes -- 3/3 PASS. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/cli/compile_cli.dag | 14 ++++++++++---- .../occurrence_file_attribution_test.dag | 7 +++---- 2 files changed, 13 insertions(+), 8 deletions(-) diff --git a/src/v2/cli/compile_cli.dag b/src/v2/cli/compile_cli.dag index c61b004b398..15c4f41b019 100644 --- a/src/v2/cli/compile_cli.dag +++ b/src/v2/cli/compile_cli.dag @@ -293,10 +293,16 @@ type CliRunOutcome // `parse_grammar_choice_overlap_residue` for every entry tried; that is a grammar-global ADVISORY // and never the fatal. The fatal diagnostic is the last one, and `parse_g0_tokens_remain_diagnostic` // builds its locus from the first remaining token. The fatal pick is `v2.std.diagnostic` -// `diagnostics_fatal`, the chain is `lens_verdict_diagnostics_located_chain_text` (every link with -// its locus, so thirty-five advisories in front of the fatal each say where they are), and -// file+extent is `lens_verdict_diagnostic_locus_text` — none a second spelling here (DESIGN -// section 3). +// `diagnostics_fatal`, the chain is `lens_verdict_diagnostics_located_chain_text_in_spans` (every +// link with its locus, so thirty-five advisories in front of the fatal each say where they are), +// and file+extent is `lens_verdict_diagnostic_locus_text_in_spans` — none a second spelling here +// (DESIGN section 3). +// +// BOTH ARE THE `_in_spans` DOORS, WHICH IS THE POINT OF THIS PACKAGE: they take the ingest's +// SpanIndex, so a NodeLocus resolves to a file and byte range instead of rendering as an +// occurrence. An earlier revision of this paragraph named the index-free spellings, which this +// module stopped calling in the same diff -- prose naming symbols its own code does not use +// (review 70138). // THE EMPTY INGEST IS A REFUSAL AND NOT AN EMPTY PROGRAM, and this arm is the whole reason // `v2_cli_run` does not call the emitter first and ask questions after. diff --git a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag index 7f6501dd2a0..85e0caa715a 100644 --- a/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag +++ b/src/v2/test/claim/provenance/occurrence_file_attribution_test.dag @@ -82,10 +82,9 @@ fn attribution_read_b() -> DagSourceReadWitness { } fn attribution_occurrence_file(index: SpanIndex, node: Node) -> Optional { - match node.occurrence_id { - OccurrenceSynthetic => optional_absent() - OccurrenceMinted { id: id } => attribution_file_of_id(index: index, id: id) - OccurrenceProjected { id: id, caused_by: _ } => attribution_file_of_id(index: index, id: id) + match node_occurrence_id_optional(node: node) { + Absent => optional_absent() + Present { value: id } => attribution_file_of_id(index: index, id: id) } } From a534d6598973c3c45530429d1f6569198b62d52f Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 14:26:19 +0000 Subject: [PATCH 12/16] A blanket classification over a set that was not homogeneous (review 70147) When this branch deleted those symbols I DID grep tree-wide and found these exact sites, then classified them all as "dated prose receipts in other lanes' historical records, which correctly name what existed then". That was right for two and WRONG for the third: - dag/gunbc/compiler_frontend_program_status.dag:181 is PRESENT TENSE about the LIVE route -- "whose per-file native_test_context_fold_step reaches program_assembly_read_to_normalized_root_prepared and nothing further". This change made that route ..._seeded, so the row named a symbol that no longer resolves and described a hand-off that no longer happens. Corrected to the seeded producer. The error is not the missed site, it is the METHOD: I applied one disposition to a set without checking whether its members shared the property I was dispositioning on. Two were dated receipts; one was a live description that merely sat in the same grep output. That is the same shape as the inert counter this branch found earlier -- something that looks like it covers a population while actually testing one property of it. Also fixed, both dated receipts that name deleted symbols: - call_expression_erased_at_v2_body_lowering (the review's weaker case): deletion note added, matching the one already given to its sibling. - emitted_field_carrier_diverges_from_the_dag_type_authored_against, which names program_assembly_phase_parse. The review did NOT flag this one, but it fails the standard just applied to its sibling, so it is fixed here rather than in another round. All eight surviving mentions of the deleted symbols are now classified: three dated receipts carrying a deletion note, and five that are this branch's own deletion records, which legitimately name what was removed. Claims at this head: two_files_attribute_to_their_own_files and native_route_threads_the_occurrence_mark_across_files -- both PASS. Co-Authored-By: Claude Opus 5 (1M context) --- dag/gunbc/compiler_frontend_program_status.dag | 2 +- .../call_expression_erased_at_v2_body_lowering.dag | 2 +- ...ield_carrier_diverges_from_the_dag_type_authored_against.dag | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/dag/gunbc/compiler_frontend_program_status.dag b/dag/gunbc/compiler_frontend_program_status.dag index ce77ccd939d..c331e2189f9 100644 --- a/dag/gunbc/compiler_frontend_program_status.dag +++ b/dag/gunbc/compiler_frontend_program_status.dag @@ -178,7 +178,7 @@ fn missing_instrument_label(i: MissingInstrument) -> String { PhaseCargoExecutionFact => "a per-phase cargo-execution fact on gunbc.required_ci_phase_roster" ResolverBoundDeclaringIdentity => "the v2 resolver answering a qualified reference with an EXACT declaring identity by execution -- the binding's declaration containment path, not a leaf and not the authored spelling -- so that v2.compiler.repair_input_origin_roster derives RepairInputDeclared.declaring from that binding rather than from carrier_declaration_ref's spelling arm (XL-0's population; the roster producer itself exists and answers)" DeclaringIdentitySpellingCensus => "a declaring-identity spelling census that answers over XL-3's usable population on the production ingest route: QUALIFIED cross-module mentions (every position) and bare type names in FIELD position, joined to their declaring identity - the producer v2.compiler.declaring_identity_spelling_census spelling_census_from_ingest exists and answers over the bare same-module classes only, which is not that population (XL-3's population)" - ExactOccurrenceResidualCensus => "the exact occurrence and import-declaration residual an XL-2 rehearsal produces (XL-5's population): the typed import strip (std.import strip_import_statements, already built) applied to a throwaway tree, followed by the v2 production route -- ingest, graft, normalize, RESOLVE -- over every stripped module, its resolve refusals joined to occurrence identity where an id is minted and to module + path + locus structure where it is synthetic (the residual's ids are mixed, majority synthetic over the whole tree -- gunbc#11738's census-resolve run; a wave keyed on occurrence identity alone would cover a minority and report success on the rest). KNOWN NECESSARY prerequisites -- not an exhaustive set, and a fourth found by review is not the end of the list either -- each an undercount BY CONSTRUCTION rather than a missing producer file: (i) call callees and ARGUMENTS reach resolve (gunbc.recurring_failure_mode call_expression_erased_at_v2_body_lowering -- resolve fails OPEN for every dependent reached through a call, so its refusal roster cannot establish completeness over that population; the callee half is gunbc#11683's, the argument half is open); (ii) bare FIELD-position type names reach the containment tree (the grafting lane, namespace_cut_stage cause 4); (iii) a whole-tree v2 census that RESOLVES per module rather than stopping at normalize: the executing entry that omits resolve is the SourceRootEvalDriver's rendered census mode (v1.compiler.emit_rust emit_source_root_eval_driver_main_rs, run_census), which calls v2.compiler.compile native_test_context_from_ingest, whose per-file native_test_context_fold_step reaches program_assembly_read_to_normalized_root_prepared and nothing further -- resolve is native_test_resolve_module, reached only from adjudicate mode's prepare over universe modules (gunbc.witness.v2_native_route native_route_census is a fold over supplied verdict rows and is not that entry). AND ONE UNRESOLVED OBLIGATION THAT NONE OF THOSE DISCHARGES, occurrence completeness: v2.compiler.resolve resolve_children_homogeneous_scope (and resolve_transform_children, resolve_edges_first_outer_then_inner, resolve_bind_edges) returns a Rejected accumulator without visiting the remaining children, so a module with two independent post-cut refusals records the first and never observes the second -- a truthful MODULE-level refusal and an incomplete OCCURRENCE-level population -- and an earlier parse or normalize refusal blocks a whole module the same way. Running resolve once per module therefore does not establish that every affected occurrence was observed; the census must report every site or explicitly refuse completeness, and its discriminator is two independently failing sites in ONE module, each shown individually reachable by a control, both reported. The Step-0 canary (gunbc.namespace_step0_candidate_run over tools.multi_module_compile_fixture) is NOT this instrument, on a population ground rather than a version-number one: its carrier is a per-bucket diagnostic HISTOGRAM differential (gunbc.namespace_step0_canary_v2 Step0HistogramDifferential, whose arms include OccurrenceJoinUnavailable), so it cannot carry an exact occurrence residual whatever pipeline compiles it; a rehearsal that observes a proposed cut through the old implementation is admissible as a differential, and what it may not do is be the authority that still answers after the surgery" + ExactOccurrenceResidualCensus => "the exact occurrence and import-declaration residual an XL-2 rehearsal produces (XL-5's population): the typed import strip (std.import strip_import_statements, already built) applied to a throwaway tree, followed by the v2 production route -- ingest, graft, normalize, RESOLVE -- over every stripped module, its resolve refusals joined to occurrence identity where an id is minted and to module + path + locus structure where it is synthetic (the residual's ids are mixed, majority synthetic over the whole tree -- gunbc#11738's census-resolve run; a wave keyed on occurrence identity alone would cover a minority and report success on the rest). KNOWN NECESSARY prerequisites -- not an exhaustive set, and a fourth found by review is not the end of the list either -- each an undercount BY CONSTRUCTION rather than a missing producer file: (i) call callees and ARGUMENTS reach resolve (gunbc.recurring_failure_mode call_expression_erased_at_v2_body_lowering -- resolve fails OPEN for every dependent reached through a call, so its refusal roster cannot establish completeness over that population; the callee half is gunbc#11683's, the argument half is open); (ii) bare FIELD-position type names reach the containment tree (the grafting lane, namespace_cut_stage cause 4); (iii) a whole-tree v2 census that RESOLVES per module rather than stopping at normalize: the executing entry that omits resolve is the SourceRootEvalDriver's rendered census mode (v1.compiler.emit_rust emit_source_root_eval_driver_main_rs, run_census), which calls v2.compiler.compile native_test_context_from_ingest, whose per-file native_test_context_fold_step reaches program_assembly_read_to_normalized_root_seeded and nothing further -- resolve is native_test_resolve_module, reached only from adjudicate mode's prepare over universe modules (gunbc.witness.v2_native_route native_route_census is a fold over supplied verdict rows and is not that entry). AND ONE UNRESOLVED OBLIGATION THAT NONE OF THOSE DISCHARGES, occurrence completeness: v2.compiler.resolve resolve_children_homogeneous_scope (and resolve_transform_children, resolve_edges_first_outer_then_inner, resolve_bind_edges) returns a Rejected accumulator without visiting the remaining children, so a module with two independent post-cut refusals records the first and never observes the second -- a truthful MODULE-level refusal and an incomplete OCCURRENCE-level population -- and an earlier parse or normalize refusal blocks a whole module the same way. Running resolve once per module therefore does not establish that every affected occurrence was observed; the census must report every site or explicitly refuse completeness, and its discriminator is two independently failing sites in ONE module, each shown individually reachable by a control, both reported. The Step-0 canary (gunbc.namespace_step0_candidate_run over tools.multi_module_compile_fixture) is NOT this instrument, on a population ground rather than a version-number one: its carrier is a per-bucket diagnostic HISTOGRAM differential (gunbc.namespace_step0_canary_v2 Step0HistogramDifferential, whose arms include OccurrenceJoinUnavailable), so it cannot carry an exact occurrence residual whatever pipeline compiles it; a rehearsal that observes a proposed cut through the old implementation is admissible as a differential, and what it may not do is be the authority that still answers after the surgery" PersistedBehavioralReceipt => "a persisted behavioral receipt over a discriminating corpus" PersistedPromotionOutcome => "a persisted PromotionOutcome over a named candidate" SeedDeletionObservation => "an observation of the live tree that the v1 seed families (interpreter, cli_run, seed harness, interpreter floor) are ABSENT, read from the tree rather than from an authored roster" diff --git a/dag/gunbc/recurring_failure_mode/call_expression_erased_at_v2_body_lowering.dag b/dag/gunbc/recurring_failure_mode/call_expression_erased_at_v2_body_lowering.dag index 99911404b6f..d9ed74f4863 100644 --- a/dag/gunbc/recurring_failure_mode/call_expression_erased_at_v2_body_lowering.dag +++ b/dag/gunbc/recurring_failure_mode/call_expression_erased_at_v2_body_lowering.dag @@ -13,7 +13,7 @@ data call_expression_erased_at_v2_body_lowering: RecurringFailureMode = Recurrin "DISTINGUISHING FACTS, because two neighbouring rows look like this one and are not. `unresolved_callee_conflated_with_dispatched_elsewhere` is the v1 ExprCall-tail class: there the callee reaches the classifier and the miss is absorbed later. Here the callee never reaches resolve at all. And the earlier dated measurements (v2.test.claim.staged_front_end unbound_symbol_reason_note, v2.test.claim.dag_acceptance frontier_arm_note) attributed the silence to resolve. That was the wrong stage: resolve is correct over the tree it receives, and the tree has already lost the call. A wall authored in resolve would therefore be a decoration (DESIGN section 4b), because the undeclared-callee RED and the declared-callee positive control arrive as identical trees.", - "RECEIPT (2026-09-12, still-eagle-447, NAMESPACE XL-2 scoping). The normalized tree was dumped for five bodies via prepare_grammar, parse_module_prepared and normalize -- the calls v2.compiler.program_assembly program_assembly_read_to_normalized_root_prepared makes, and so the census route's own hand-off (v2.compiler.compile native_test_context_from_ingest). `{ k }` keeps `Atom:k`. `{ x }` over a parameter keeps `Atom:x`. `{ g(x: 1) }` with g declared, `{ zzz(x: 1) }` and `{ zzz(1) }` with zzz undeclared all become `Transform [ Atom:dag_token_lbrace ]`. The unprepared parse_module route (v2.compiler.staged_front_end run_front_end) dumps identically, so this is not a second lossy route beside a faithful one.", + "RECEIPT (2026-09-12, still-eagle-447, NAMESPACE XL-2 scoping). The normalized tree was dumped for five bodies via prepare_grammar, parse_module_prepared and normalize -- the calls v2.compiler.program_assembly program_assembly_read_to_normalized_root_prepared makes, and so the census route's own hand-off (v2.compiler.compile native_test_context_from_ingest). (That composition was DELETED by gunbc#11985, which threaded one occurrence allocator across the ingest and left it with no caller; the receipt is dated and its reading stands, but the live route is now program_assembly_read_to_normalized_root_seeded.) `{ k }` keeps `Atom:k`. `{ x }` over a parameter keeps `Atom:x`. `{ g(x: 1) }` with g declared, `{ zzz(x: 1) }` and `{ zzz(1) }` with zzz undeclared all become `Transform [ Atom:dag_token_lbrace ]`. The unprepared parse_module route (v2.compiler.staged_front_end run_front_end) dumps identically, so this is not a second lossy route beside a faithful one.", "EVIDENCE LEVEL, stated so the receipt is not read one rung high. The dumps ran the v2 .dag through the gunbc interpreter at main f9d37e43a1, and a structural node-count fold (not a printer) agrees: the parse tree grows with a call's arguments and nesting, while the normalized body of { g(x: 1) } is exactly one node larger than { k } -- the Transform and its lbrace atom -- and { g(x: h(y: 5)) } is no larger than that. A second named argument adds one node, so the lowering keeps something per extra argument, but none of the callee or argument content. That the natively emitted normalize behaves identically is not executed. The native route gives no contrary evidence: its receipt on the #10940 head (eager-raven-113, 2026-09-12) holds exactly one Passed identity, a literal-bodied smoke test, and every richer body refuses before or at eval (v2.compiler.infer node_grounding_frontier_note). So no route has been observed to lower a call faithfully.", diff --git a/dag/gunbc/recurring_failure_mode/emitted_field_carrier_diverges_from_the_dag_type_authored_against.dag b/dag/gunbc/recurring_failure_mode/emitted_field_carrier_diverges_from_the_dag_type_authored_against.dag index a7aab21206d..14ab765fab0 100644 --- a/dag/gunbc/recurring_failure_mode/emitted_field_carrier_diverges_from_the_dag_type_authored_against.dag +++ b/dag/gunbc/recurring_failure_mode/emitted_field_carrier_diverges_from_the_dag_type_authored_against.dag @@ -18,7 +18,7 @@ data emitted_field_carrier_diverges_from_the_dag_type_authored_against: Recurrin "THE RULE THE AUTHOR CANNOT SEE, stated because the obvious summary of it is WRONG. `v1.compiler.emit_rust` `needs_box_wrapping` boxes a field whose type is in `recursive_types`, and an OPTIONAL-cardinality field inherits that decision from its inner type by recursing with required cardinality; `rust_field_carrier_final_type` then renders `Box`. So it is NOT 'an Optional field boxes' -- whether it boxes depends on whether its inner type rides a recursion cycle, which is a property of the WHOLE CORPUS and not of the declaration. Two fields spelled with the same cardinality in the same record can take different carriers, and neither spelling says so.", - "SPECIMEN, gunbc PR 11206 (perf item C instrument, draft), 2026-09-12. A new carrier `v2.compiler.compile` `NativeTestFrontEnd` carries `residue: Diagnostics`, where `v2.std.diagnostic` `Diagnostics` is `Optional` and `NonEmptyDiagnostics` is recursive. The field emitted as `Box>>` while `v2.compiler.program_assembly` `program_assembly_phase_parse` takes `residue` by value, so the emitter template's `front_end.residue.clone()` cloned the Box: `error[E0308]: expected Option>, found Box>>` at `src/main.rs:407`, help `consider unboxing the value`. The sibling fields on the same carrier -- `lm: LanguageModel`, `prepared: PreparedGrammar` -- took `Rc<..>` and their `.clone()` was correct, which is exactly the per-field divergence this row names. Repair: `(*front_end.residue).clone()`.", + "SPECIMEN, gunbc PR 11206 (perf item C instrument, draft), 2026-09-12. A new carrier `v2.compiler.compile` `NativeTestFrontEnd` carries `residue: Diagnostics`, where `v2.std.diagnostic` `Diagnostics` is `Optional` and `NonEmptyDiagnostics` is recursive. The field emitted as `Box>>` while `v2.compiler.program_assembly` `program_assembly_phase_parse` takes `residue` by value, so the emitter template's `front_end.residue.clone()` cloned the Box (that phase was DELETED by gunbc#11985 with the unseeded composition it served; the receipt is dated and its reading stands, and the live phase is `program_assembly_phase_parse_measured_seeded`): `error[E0308]: expected Option>, found Box>>` at `src/main.rs:407`, help `consider unboxing the value`. The sibling fields on the same carrier -- `lm: LanguageModel`, `prepared: PreparedGrammar` -- took `Rc<..>` and their `.clone()` was correct, which is exactly the per-field divergence this row names. Repair: `(*front_end.residue).clone()`.", "WHAT DID NOT CATCH IT, each checked rather than assumed: `gunbc run` typechecked both changed modules under the whole `dag` + `src/v2` closure and was green; `cargo fmt --all --check` passed; `claim_executor --required-regen` regenerated the emitter's own projection and adjudicated it, reaching `first_generation_equal` on the file CONTAINING the defective template text, because regen compares emitted BYTES against the authority and never compiles the program those bytes describe.", From e691d4f5fdf1e306e55dfad6b5797657574728a7 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Wed, 23 Sep 2026 13:19:46 +0000 Subject: [PATCH 13/16] Regenerate the emitter mirror: restore the seeded driver threading the earlier merge dropped 37e9712de8c took main's v1_compiler_emit_rust.rs because regeneration was blocked by the PointerWidth E0573. That dropped this branch's rendered SourceRootEvalDriver threading, and emit-build refused with E0061: native_test_context_absorb called with 3 arguments against 4. With the E0573 fixed on main (#12089/#12100), the regen round runs again. This installs ONLY this file from its candidate, which carries both main's emitter changes and this branch's file_alloc argument. The candidate also drifts in six other mirrors (compiler_tests, emitted_population, std_integer, std_machine_constraints, v1_compiler_infer_resolve, v1_rt). They are not this branch's: v1_rt's drift would delete a hand-carried content-hash change, and infer_resolve's would delete a declared transient bootstrap patch. They are left for their owners. Co-Authored-By: Claude Opus 5.5 (1M context) --- src/v1/stage0/src/v1_compiler_emit_rust.rs | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/src/v1/stage0/src/v1_compiler_emit_rust.rs b/src/v1/stage0/src/v1_compiler_emit_rust.rs index 292df45daf3..e7579e4d19b 100644 --- a/src/v1/stage0/src/v1_compiler_emit_rust.rs +++ b/src/v1/stage0/src/v1_compiler_emit_rust.rs @@ -75,7 +75,6 @@ pub use crate::std_decl_ref::{DeclField, DeclarationRef}; use crate::std_induction::SubValueRelation::SubValueUnknown; pub use crate::std_induction::{InductiveField, SubValueRelation}; pub use crate::std_measure::millisecond_count; -pub use crate::std_measure::second; pub use crate::std_nat::Nat; pub use crate::std_occurrence_identity::NodeOccurrenceIdentity; use crate::std_occurrence_identity::NodeOccurrenceIdentity::OccurrenceSynthetic; @@ -117,7 +116,6 @@ pub use crate::std_target_representation::ExactBindingResolution; use crate::std_target_representation::ExactBindingResolution::{ ExactBindingAbsent, ExactBindingAmbiguous, ExactSourceIdentityUnavailable, ResolvedExactBinding, }; -pub use crate::std_types::NonEmptyStr; pub use crate::std_types::SourceSpan; pub use crate::std_types::{container_template_algebra, is_container_type, is_kernel_type}; use crate::v1_compiler_artifact::RenderTarget::Rust; @@ -127,7 +125,6 @@ use crate::v1_compiler_artifact::RustModuleRenderSelection::{ pub use crate::v1_compiler_artifact::{RenderTarget, RustModuleRenderSelection}; pub use crate::v1_compiler_closure_stub_v2_std_integer_rust::closure_stub_v2_std_integer_source; pub use crate::v1_compiler_closure_stub_v2_std_text_rust::closure_stub_v2_std_text_source; -pub use crate::v1_compiler_coercion::literal_suffix; pub use crate::v1_compiler_coercion::{ coerce_primitive_type, declaration_realization, declaration_realizes_natively_on_rust, is_copy, provenance_declares_structurally, realization_host_numeric_spelling, @@ -39239,7 +39236,7 @@ pub fn emit_source_root_eval_driver_main_rs( crate::v1_compiler_emit_core_support::module_to_filename(pipeline_module.clone()); Rc::new(TextFile { path: v1_rt::concat(v1_rt::concat(rust_source_root(), "main".to_string()), rust_source_ext()), - content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_completeness, native_census_module_resolution, native_census_modules,".to_string()), "\n".to_string()), " native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_of_facts, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_phase_normalize, program_assembly_phase_parse_measured,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { first, rest, .. } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER FAILURE CHAIN, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), first.clone(), rest.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " \"occurrence_completeness\": native_census_module_completeness(outcome.clone()),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " // The universe is derived FROM THE FACTS ALREADY BOUND, not from the ingest again:".to_string()), "\n".to_string()), " // the ingest-taking entry would re-run the whole-corpus discovery fold the line above".to_string()), "\n".to_string()), " // just paid for, and that fold is the phase the pattern does NOT narrow. See".to_string()), "\n".to_string()), " // v2.compiler.compile native_lane_universe_of_facts -- the pattern is threaded, so this".to_string()), "\n".to_string()), " // is the same entry a narrower pattern reaches, never a filter over a default universe.".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_of_facts(source_facts.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_prepared.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured performs would change the context with nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone());".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), + content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_completeness, native_census_module_resolution, native_census_modules,".to_string()), "\n".to_string()), " native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_of_facts, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_allocator_next, program_assembly_measured_alloc,".to_string()), "\n".to_string()), " program_assembly_phase_normalize,".to_string()), "\n".to_string()), " program_assembly_phase_parse_measured_seeded,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { first, rest, .. } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER FAILURE CHAIN, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), first.clone(), rest.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " \"occurrence_completeness\": native_census_module_completeness(outcome.clone()),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " // The universe is derived FROM THE FACTS ALREADY BOUND, not from the ingest again:".to_string()), "\n".to_string()), " // the ingest-taking entry would re-run the whole-corpus discovery fold the line above".to_string()), "\n".to_string()), " // just paid for, and that fold is the phase the pattern does NOT narrow. See".to_string()), "\n".to_string()), " // v2.compiler.compile native_lane_universe_of_facts -- the pattern is threaded, so this".to_string()), "\n".to_string()), " // is the same entry a narrower pattern reaches, never a filter over a default universe.".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_of_facts(source_facts.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_seeded. (It named the UNSEEDED composition".to_string()), "\n".to_string()), " // until that one was deleted for having no caller; the seeded producer is now the single".to_string()), "\n".to_string()), " // modeled per-file front end, and this loop is still its second spelling.)".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured_seeded performs would change the context with".to_string()), "\n".to_string()), " // nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " // SEEDED FROM THE MARK THE CONTEXT HAS REACHED, because this loop IS a source graph:".to_string()), "\n".to_string()), " // std.occurrence_identity occurrence_identity_scope_law requires one allocator threaded".to_string()), "\n".to_string()), " // across every parsed source, and a per-file reset makes two files' occurrence #N the".to_string()), "\n".to_string()), " // same value with different meanings. The modeled fold threads it internally; this".to_string()), "\n".to_string()), " // respelling has to thread it explicitly or it keeps the reset the fold no longer has.".to_string()), "\n".to_string()), " let file_seed = context_state.alloc.clone();".to_string()), "\n".to_string()), " let file_seed_reported = file_seed.clone();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured_seeded(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " file_seed.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " // Read BEFORE program_assembly_measured_outcome consumes `measured`. On a refused parse".to_string()), "\n".to_string()), " // this returns the seed unchanged. Not because nothing was minted -- a refused parse".to_string()), "\n".to_string()), " // HAS minted ids -- but because ParseExprRejected carries no provenance state, so the".to_string()), "\n".to_string()), " // mark the attempt reached is not recoverable. See the precondition on".to_string()), "\n".to_string()), " // v2.compiler.compile native_test_context_absorb.".to_string()), "\n".to_string()), " let file_alloc = program_assembly_measured_alloc(measured.clone(), file_seed);".to_string()), "\n".to_string()), " let file_alloc_reported = file_alloc.clone();".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone(), file_alloc);".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " // THE THREADING, MADE OBSERVABLE. occurrence_seed is the mark this file was".to_string()), "\n".to_string()), " // handed and occurrence_next the mark it reached, so a multi-file run shows".to_string()), "\n".to_string()), " // one sequence continuing across files instead of each file restarting at 0.".to_string()), "\n".to_string()), " // A REFUSED file reports next == seed. That is the mark it was HANDED, not a".to_string()), "\n".to_string()), " // claim that nothing was minted: a refused parse mints ids that the refusal".to_string()), "\n".to_string()), " // discards unrecoverably. The next file continues from the seed rather than".to_string()), "\n".to_string()), " // rewinding to zero.".to_string()), "\n".to_string()), " \"occurrence_seed\": program_assembly_allocator_next(file_seed_reported),".to_string()), "\n".to_string()), " \"occurrence_next\": program_assembly_allocator_next(file_alloc_reported),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), }) } } From 7dbd4f395ba1b2c1041ff531b34f7197f0e3b2fa Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Wed, 23 Sep 2026 13:56:34 +0000 Subject: [PATCH 14/16] =?UTF-8?q?floor=5Fpure=5Fproducer=5Fshare:=20name?= =?UTF-8?q?=20the=20instrument=20instead=20of=20transcribing=20its=20figur?= =?UTF-8?q?es=20(review=2070540,=20DESIGN=20=C2=A76)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Co-Authored-By: Claude Opus 5.5 (1M context) --- src/v2/workflow/floor_pure_producer_share.dag | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/src/v2/workflow/floor_pure_producer_share.dag b/src/v2/workflow/floor_pure_producer_share.dag index d3a6db1f729..c39d05ee4c0 100644 --- a/src/v2/workflow/floor_pure_producer_share.dag +++ b/src/v2/workflow/floor_pure_producer_share.dag @@ -612,11 +612,10 @@ import v2.std.collection { List } // for one computation identity with a shared ancestor. The front end each claim rebuilt is work no // row is about. // -// THE INSTRUMENT DECIDED THIS ROW RATHER THAN A PREFERENCE: the required floor on gunbc#11985 head -// 97675ab2281 refused -// `refused_assembly_still_locates_the_files_it_parsed_holds` ENROLMENT-MARGIN-REFUSED at -// observed_cpu_ms=344 against the 302ms margin, and COMPLETED-OVER-COST-REQUIREMENT at 129385 -// evaluator steps against the 72300-step new-witness budget. The lane's own guidance was checked +// THE INSTRUMENT DECIDED THIS ROW RATHER THAN A PREFERENCE: the required floor (the `witnesses` +// lane of `gunbc.witness_floor_workflow`) refused +// `refused_assembly_still_locates_the_files_it_parsed_holds` as both ENROLMENT-MARGIN-REFUSED and +// COMPLETED-OVER-COST-REQUIREMENT; re-derive the figures by running that lane on the claim. The lane's own guidance was checked // before reducing anything: the cause is not a nested membership scan and not contention at // constant eval steps -- it is one front end per claim, so the share point is the producer. // From 5d3e8a624754abf399029ee1ebe043261f796f17 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Wed, 23 Sep 2026 14:35:16 +0000 Subject: [PATCH 15/16] Emitter mirror: restore the three re-exports a stale seed dropped e691d4f5fdf was regenerated by a stale claim_executor (target/release rather than CARGO_TARGET_DIR), which omitted pub use of second, NonEmptyStr and literal_suffix. Regenerating with the current seed keeps them; the only remaining difference from main's mirror is this branch's driver threading. Co-Authored-By: Claude Opus 5.5 (1M context) --- src/v1/stage0/src/v1_compiler_emit_rust.rs | 3 +++ 1 file changed, 3 insertions(+) diff --git a/src/v1/stage0/src/v1_compiler_emit_rust.rs b/src/v1/stage0/src/v1_compiler_emit_rust.rs index e7579e4d19b..62780d202cb 100644 --- a/src/v1/stage0/src/v1_compiler_emit_rust.rs +++ b/src/v1/stage0/src/v1_compiler_emit_rust.rs @@ -75,6 +75,7 @@ pub use crate::std_decl_ref::{DeclField, DeclarationRef}; use crate::std_induction::SubValueRelation::SubValueUnknown; pub use crate::std_induction::{InductiveField, SubValueRelation}; pub use crate::std_measure::millisecond_count; +pub use crate::std_measure::second; pub use crate::std_nat::Nat; pub use crate::std_occurrence_identity::NodeOccurrenceIdentity; use crate::std_occurrence_identity::NodeOccurrenceIdentity::OccurrenceSynthetic; @@ -116,6 +117,7 @@ pub use crate::std_target_representation::ExactBindingResolution; use crate::std_target_representation::ExactBindingResolution::{ ExactBindingAbsent, ExactBindingAmbiguous, ExactSourceIdentityUnavailable, ResolvedExactBinding, }; +pub use crate::std_types::NonEmptyStr; pub use crate::std_types::SourceSpan; pub use crate::std_types::{container_template_algebra, is_container_type, is_kernel_type}; use crate::v1_compiler_artifact::RenderTarget::Rust; @@ -125,6 +127,7 @@ use crate::v1_compiler_artifact::RustModuleRenderSelection::{ pub use crate::v1_compiler_artifact::{RenderTarget, RustModuleRenderSelection}; pub use crate::v1_compiler_closure_stub_v2_std_integer_rust::closure_stub_v2_std_integer_source; pub use crate::v1_compiler_closure_stub_v2_std_text_rust::closure_stub_v2_std_text_source; +pub use crate::v1_compiler_coercion::literal_suffix; pub use crate::v1_compiler_coercion::{ coerce_primitive_type, declaration_realization, declaration_realizes_natively_on_rust, is_copy, provenance_declares_structurally, realization_host_numeric_spelling, From 56cdf4db23010c69fcec98f86df99acacd56f75d Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Wed, 23 Sep 2026 19:00:31 +0000 Subject: [PATCH 16/16] frontier_ingestion_probe: lex the source as the characters lex_walk_artifact declares The floor refused 991d84b44e at frontier_ingestion_probe classify_source_in and classify_source: lex_walk_artifact declares source as v2.std.text String (FreeMonoid), and both sites passed the primitive String they hold (filesystem content, string literals). Latent on main: this branch changes an interface in body_lowering_fold that body_lowering_refusal_scope_test reads, and the floor planner (#12130) re-plans an untouched reader of a changed interface, which compiles this module for the first time since the mismatch entered. The fix is at the owning link: pass chars(s: source), the builtin every other lex_walk_artifact caller already uses (annotation_channel_test, namespace_graft_body_dissolution_witness_test). The callee's signature is unchanged and nothing is coerced. Both importers pass locally: normalize_retention_contract_probe_test 22/22, body_lowering_refusal_scope_test 9/9. Co-Authored-By: Claude Opus 5.5 (1M context) --- dag/gunbc/instruments/frontier_ingestion_probe.dag | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/dag/gunbc/instruments/frontier_ingestion_probe.dag b/dag/gunbc/instruments/frontier_ingestion_probe.dag index cc0e9ed9605..932939339fa 100644 --- a/dag/gunbc/instruments/frontier_ingestion_probe.dag +++ b/dag/gunbc/instruments/frontier_ingestion_probe.dag @@ -255,7 +255,7 @@ fn classify_after_lex( } fn classify_source_in(world: FrontendWorld, source: String) -> FrontendStage { - match lex_walk_artifact(source: source, file: ^frontier_probe, rules: world.lex_rules) { + match lex_walk_artifact(source: chars(s: source), file: ^frontier_probe, rules: world.lex_rules) { v2.std.diagnostic.Rejected { diagnostics: _ } => LexRefused v2.std.diagnostic.Accepted { value: a, diagnostics: _ } => classify_after_lex(prepared: world.prepared, residue: world.validation_residue, artifact: a) @@ -276,7 +276,7 @@ fn classify_source_in(world: FrontendWorld, source: String) -> FrontendStage { // a stage by construction. fn classify_source(source: String) -> v2.std.diagnostic.Outcome { - match lex_walk_artifact(source: source, file: ^frontier_probe, rules: dag_lex_rules()) { + match lex_walk_artifact(source: chars(s: source), file: ^frontier_probe, rules: dag_lex_rules()) { v2.std.diagnostic.Rejected { diagnostics: _ } => Accepted { value: LexRefused, diagnostics: None } v2.std.diagnostic.Accepted { value: a, diagnostics: _ } =>