From 6ecf31be95caef87cdda8b9bae5884de53585e3e Mon Sep 17 00:00:00 2001 From: Christopher Williams Date: Thu, 24 Sep 2026 09:32:08 -0400 Subject: [PATCH] =?UTF-8?q?phase11:=20merge=2011=20=E2=80=94=20worker=20C'?= =?UTF-8?q?s=200x8009F3A8=20(268=20B)=20->=20512=20bodies=20/=20521=20regi?= =?UTF-8?q?ons?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Worker C's measured dispatch finding is the most useful strategic result of the phase: across its 15 above-ceiling rows, 'does the body contain a repeated block?' has out-performed 'how big is it?' SIX TO ZERO. Every one of its six matches is a repetitive or mechanically-determined body (struct assignment, repeated identical block, record initialiser, transposition, repeated bounds check); every one of its nine near-misses is tie-break-dense (long straight-line call sequence, pointer-walk loop, table walk). Worker D's rows say the same thing from the other side: its 700 B and 1232 B bodies cost 3 and 2 spellings while its 248 B body cost 4. Also confirms cookbook 44's stated limit directly: the && chain and eight separate if(...) goto fail; statements compile IDENTICALLY here, so the distinguishing fact is 'one combined condition with one trailing assignment', not the operator. --- config/regions.tsv | 1 + 1 file changed, 1 insertion(+) diff --git a/config/regions.tsv b/config/regions.tsv index ec1c66e..2efcc2f 100644 --- a/config/regions.tsv +++ b/config/regions.tsv @@ -348,6 +348,7 @@ 0x8009D8A0 0x8009D8E0 src/func_8009D8A0.c 0x8009E8D0 0x8009E95C src/func_8009E8D0.c 0x8009F0E8 0x8009F120 src/func_8009F0E8.c +0x8009F3A8 0x8009F4B4 src/func_8009F3A8.c 0x8009F5AC 0x8009F6A0 src/func_8009F5AC.c 0x8009F6A0 0x8009F798 src/func_8009F6A0.c 0x800A2F20 0x800A2F44 src/func_800A2F20.c