Compare commits

...

1 Commits

Author SHA1 Message Date
coah
dec1ed043c zi8cgetc: GetZH 81 -> 83% (worker ca7cac87) 2026-10-01 03:18:12 +00:00
3 changed files with 230 additions and 72 deletions

View File

@@ -53,7 +53,7 @@ Progress
<!-- progress:start -->
| Decompiled | Matched | Linked | Data |
|:---:|:---:|:---:|:---:|
| 99.01% | 86.61% | 60.34% | 90.99% |
| 99.04% | 86.61% | 60.34% | 90.99% |
units 902/1027 complete, functions 12151/12563 matched.

View File

@@ -193,6 +193,7 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
ziWChar currentSpelling[64];
ziWChar countOutput[64];
ziWChar candidateWord[64];
int outputIndex;
ZiChinesePattern phraseMasks[6];
ZiChinesePattern phraseValues[6];
ziU16 seenOrdinals[8];
@@ -200,10 +201,9 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
ziWChar* currentWord;
ziU8* userEntries;
int phase;
int outputIndex;
ziU8* componentTable;
ziU8* record;
ziU8* componentCursor;
ziU8* componentTable;
ziU8* componentOrdinals;
ziU8* phoneticTable;
ziU8* records;
@@ -231,12 +231,12 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
ziU16 userIndex;
ziU16 userCount;
ziU16 candidateOrdinal;
ziU16 previousOrdinal;
ziU16 alternateCharacter;
ziU16 character;
ziU16 relatedOrdinal;
ziU16 isFirstCandidate;
ziU16 duplicateIndex;
ziU16 previousOrdinal;
ziU16 ordinalCount;
ziU16 remainingOrdinals;
ziU16 firstOrdinal;
@@ -325,13 +325,13 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
emittedWords = 0;
record = 0;
componentCursor = 0;
componentTable = 0;
componentOrdinals = 0;
phoneticTable = 0;
records = 0;
alternateTable = 0;
charsetTable = 0;
componentCharsetTable = 0;
componentTable = 0;
ordinalTable = 0;
phoneticGroups = 0;
phraseTable = 0;
@@ -451,7 +451,8 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
} else {
if (getMode == 10) getMode = 9;
for (index = 0; index < 6; ++index) {
match.arr1[index] = match.arrD[index] = 0;
match.arrD[index] = 0;
match.arr1[index] = 0;
}
if (elements[0] >= 'A' && elements[0] <= 'Y') {
match.arr1[0] = 31;
@@ -700,7 +701,7 @@ static int zi8InternalGetZH(ziGetParam* request, ZiChineseOptions* options, ziPt
getOptions != 1) firstPhoneticPass = 0;
if (getMode == 5) {
firstPhoneticPass = 1;
if (match.nSeg >= 2) goto engine_finish;
if (match.nSeg > 1) goto engine_finish;
}
if (getMode == 0 && request->elementCount) {
if (!(request->context & 0x10) &&
@@ -1022,30 +1023,9 @@ pud_candidate:
if (candidateOrdinal == 0xFFFF) goto pud_next;
record = records + candidateOrdinal * 12;
candidateStatus = 0;
if (getMode < 7) {
if (getMode == 0) {
if (match.arrD[0] == (record[0] & match.arr1[0]) &&
(match.count || (match.arrD[3] == (record[3] & match.arr1[3]) &&
match.arrD[2] == (record[2] & match.arr1[2]) &&
match.arrD[1] == (record[1] & match.arr1[1]))) &&
(ziU8)Zi8SecMatchChar(record, componentTable, &match, 0, work)) candidateStatus = 1;
} else if (getMode < 3) {
phraseOrdinal = Zi8GetPCode(phoneticTable, record);
candidateStatus = (phraseOrdinal & match.phon[0]) == match.phon2[0];
if (!candidateStatus && (record[0] & 0x80) && !requireFull &&
Zi8MatchAltSound(alternateTable, alternateCount, phoneticTable, candidateOrdinal,
match.phon[0], match.phon2[0], charset, work)) candidateStatus = 1;
}
} else if (getMode == 9) {
pud_phrase:
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[10] << 8 | record[11]);
index = phraseEntry[0] & 7;
if ((phraseEntry[0] & phraseMasks[index].bytes[0]) == phraseValues[index].bytes[0] &&
(phraseEntry[1] & phraseMasks[index].bytes[1]) == phraseValues[index].bytes[1] &&
(phraseEntry[2] & phraseMasks[index].bytes[2]) == phraseValues[index].bytes[2] &&
(phraseEntry[3] & phraseMasks[index].bytes[3]) == phraseValues[index].bytes[3]) candidateStatus = 1;
} else if (getMode < 9) {
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[10] << 8 | record[11]);
switch (getMode) {
case 7: case 8:
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
if ((phraseEntry[0] & 7) < match.length ||
match.arr1D[0] != (match.arr19[0] & phraseEntry[0]) ||
match.arr1D[1] != (match.arr19[1] & phraseEntry[1]) ||
@@ -1053,6 +1033,30 @@ pud_phrase:
match.arr1D[3] != (match.arr19[3] & phraseEntry[3])) {
if (getMode != 7) goto pud_phrase;
} else candidateStatus = 1;
break;
case 9:
pud_phrase:
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
index = phraseEntry[0] & 7;
if ((phraseEntry[0] & phraseMasks[index].bytes[0]) == phraseValues[index].bytes[0] &&
(phraseEntry[1] & phraseMasks[index].bytes[1]) == phraseValues[index].bytes[1] &&
(phraseEntry[2] & phraseMasks[index].bytes[2]) == phraseValues[index].bytes[2] &&
(phraseEntry[3] & phraseMasks[index].bytes[3]) == phraseValues[index].bytes[3]) candidateStatus = 1;
break;
case 0:
if (match.arrD[0] == (record[0] & match.arr1[0]) &&
(match.count || (match.arrD[3] == (record[3] & match.arr1[3]) &&
match.arrD[2] == (record[2] & match.arr1[2]) &&
match.arrD[1] == (record[1] & match.arr1[1]))) &&
(ziU8)Zi8SecMatchChar(record, componentTable, &match, 0, work)) candidateStatus = 1;
break;
case 1: case 2:
phraseOrdinal = Zi8GetPCode(phoneticTable, record);
candidateStatus = (phraseOrdinal & match.phon[0]) == match.phon2[0];
if (!candidateStatus && (record[0] & 0x80) && !requireFull &&
Zi8MatchAltSound(alternateTable, alternateCount, phoneticTable, candidateOrdinal,
match.phon[0], match.phon2[0], charset, work)) candidateStatus = 1;
break;
}
if (!candidateStatus) goto pud_next;
pud_accept:
@@ -1060,20 +1064,23 @@ pud_accept:
if (character == previousOrdinal) goto pud_next;
previousOrdinal = character;
if (candidateOrdinal == 0xFFFF) goto pud_charset;
if (!trackDuplicates) candidateStatus = Zi8IsDupWChar(candidateOrdinal, work);
else candidateStatus = Zi8SetFindCand(request->scratch, candidateOrdinal, work);
if (trackDuplicates) {
if ((ziU8)Zi8SetFindCand(request->scratch, candidateOrdinal, work)) goto pud_next;
} else if (Zi8IsDupWChar(candidateOrdinal, work)) goto pud_next;
} else {
emittedWords = 0;
for (index = wordLength; currentSpelling[index]; ++index, ++emittedWords) {}
if (!request->elementCount) {
if (prefixSearch) emittedWords = 1;
} else if ((getMode == 1 || getMode == 2) && match.nCand) emittedWords = match.nCand;
else if (getMode == 0 && match.nSeg > 1) emittedWords = match.nSeg;
else emittedWords = 1;
for (index = wordLength; currentSpelling[index];) {
++index;
++emittedWords;
}
if (request->elementCount) {
if ((getMode == 1 || getMode == 2) && match.nCand) emittedWords = match.nCand;
else if (getMode == 0 && match.nSeg > 1) emittedWords = match.nSeg;
else emittedWords = 1;
} else if (prefixSearch) emittedWords = 1;
currentSpelling[wordLength + emittedWords] = 0;
candidateStatus = Zi8IsDupWordW(currentSpelling + wordLength, emittedWords, work);
if (Zi8IsDupWordW(currentSpelling + wordLength, emittedWords, work)) goto pud_next;
}
if (candidateStatus) goto pud_next;
pud_charset:
if (charsetTable && wordSearchPhase) {
index = wordLength;
@@ -1093,21 +1100,18 @@ pud_charset:
if (getOptions == 5) {
if (totalResults >= options->maxResults) goto engine_finish;
} else {
if (!emitWords) output[emittedCount] = character;
else {
if (emitWords) {
++emittedCount;
for (index = wordLength; currentSpelling[index]; ++index) {
output[outputIndex] = currentSpelling[index];
++outputIndex;
output[outputIndex++] = currentSpelling[index];
}
output[outputIndex++] = ' ';
if (outputIndex > outputLimit) {
++emittedCount;
request->letters = emittedCount;
request->unk_0x20 = emittedCount;
goto engine_finish;
}
}
++emittedCount;
} else output[emittedCount++] = character;
if (emittedCount >= request->maxCandidates) {
request->letters = emittedCount;
request->unk_0x20 = emittedCount;
@@ -1146,7 +1150,7 @@ context_word_lookup:
ordinalIndex = Zi8Uni2Ord(request->currentWord[0], work);
if (ordinalIndex == 0xFFFF) goto context_results_done;
record = records + ordinalIndex * 12;
phoneticGroups = phraseTable + ((record[9] & 15) << 16 | record[11] | record[10] << 8);
phoneticGroups = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
if (((struct __zi8_work_data_s*)work)->unk_0x16) {
switch (phoneticGroups[0] & 7) {
case 2: phoneticGroups += 2; break;
@@ -1176,7 +1180,7 @@ context_word_lookup:
if (!remainingWordLength) break;
candidateOrdinal = (ziU16)phoneticGroups[1] << 8 | phoneticGroups[0];
phoneticGroups += 2;
if (phoneticGroups[-1] & 0x80) break;
if (candidateOrdinal & 0x8000) break;
character = Zi8Ord2Uni(candidateOrdinal, work);
++currentWord;
if (*currentWord != character) break;
@@ -1194,7 +1198,7 @@ context_word_lookup:
isFirstCandidate = ((ziU16)record[6] << 8) + record[7];
switch (getMode) {
case 7: case 8:
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[11] | record[10] << 8);
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
if ((phraseEntry[0] & 7) < match.length ||
match.arr1D[0] != (match.arr19[0] & phraseEntry[0]) ||
match.arr1D[1] != (match.arr19[1] & phraseEntry[1]) ||
@@ -1205,7 +1209,7 @@ context_word_lookup:
break;
case 9:
context_phrase_match:
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[11] | record[10] << 8);
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
index = phraseEntry[0] & 7;
if ((phraseEntry[0] & phraseMasks[index].bytes[0]) == phraseValues[index].bytes[0] &&
(phraseEntry[1] & phraseMasks[index].bytes[1]) == phraseValues[index].bytes[1] &&
@@ -1287,11 +1291,11 @@ context_phrase_match:
frequencyTable += 2;
output[outputIndex + emittedWords++] = Zi8Ord2Uni(character & 0x7FFF, work);
} while (!(character & 0x8000));
if (!request->elementCount) {
if (prefixSearch) emittedWords = 1;
} else if ((getMode == 1 || getMode == 2) && match.nCand) emittedWords = match.nCand;
else if (getMode == 0 && match.nSeg > 1) emittedWords = match.nSeg;
else emittedWords = 1;
if (request->elementCount) {
if ((getMode == 1 || getMode == 2) && match.nCand) emittedWords = match.nCand;
else if (getMode == 0 && match.nSeg > 1) emittedWords = match.nSeg;
else emittedWords = 1;
} else if (prefixSearch) emittedWords = 1;
if (Zi8IsDupWordW(output + outputIndex, emittedWords, work)) goto context_phrase_next;
}
if (!skipCount) {
@@ -1452,8 +1456,7 @@ character_range_start:
candidateCount = recordCount;
firstOrdinal = 0;
rangeIndex = Zi8GetTableCount(1, 16, work);
if (Zi8GetFormatVersion(1, work) < 4 || !rangeIndex || elements[0] == 0xEF00) phase = 0xFF;
else {
if (Zi8GetFormatVersion(1, work) >= 4 && rangeIndex && elements[0] != 0xEF00) {
phoneticGroups = Zi8GetTableAddress(1, 16, work);
rangeIndex = 0;
rangeCount = 0;
@@ -1476,15 +1479,15 @@ character_range_start:
case 0xEF0A: rangeIndex = 24; rangeCount = 4; break;
case 0xEF0B: rangeIndex = 20; rangeCount = 14; break;
}
if (!(request->context & 0x40)) phase = 2;
else phase = 0xFF;
if (request->context & 0x40) phase = 0xFF;
else phase = 2;
break;
case 2: rangeIndex = 4; rangeCount = 6; phase = 0xFF; break;
}
firstOrdinal = (ziU16)phoneticGroups[rangeIndex + 1] << 8 | phoneticGroups[rangeIndex];
firstOrdinal = phoneticGroups[rangeIndex] | (ziU16)phoneticGroups[rangeIndex + 1] << 8;
record += firstOrdinal * 12;
candidateCount = (phoneticGroups[rangeCount] | (ziU16)phoneticGroups[rangeCount + 1] << 8) - firstOrdinal;
}
} else phase = 0xFF;
remainingOrdinals = candidateCount;
while (1) {
if (match.count) {
@@ -1495,7 +1498,7 @@ character_range_start:
if (!Zi8ExactMatchNextChar(record, match.arr19[0], match.arr1D[0], match.arr19[1], match.arr1D[1],
match.arr19[2], match.arr1D[2], match.arr19[3], match.arr1D[3],
&candidateCount, &record, &candidateOrdinal, work)) goto character_range_done;
if ((match.field22 || match.length > 7) &&
if ((match.field22 || match.length >= 8) &&
(ziU8)Zi8SecMatchChar(record, componentTable, &match, &candidateOrdinal, work) != 2) goto character_range_next;
}
ordinalIndex = remainingOrdinals - candidateCount + firstOrdinal - 1;
@@ -1763,8 +1766,8 @@ special_tone_limit:
}
user_character_search:
if (((struct __zi8_work_data_s*)work)->unk_0x12C && (getMode != 0 || !firstPhoneticPass) &&
!options->countOnly && (match.nCand < 2 || (getMode != 1 && getMode != 2)) &&
Zi8GetZHuwdPtr(&userEntries, &userCount, work) && (getMode != 0 || match.nSeg < 2)) {
!options->countOnly && (match.nCand <= 1 || (getMode != 1 && getMode != 2)) &&
Zi8GetZHuwdPtr(&userEntries, &userCount, work) && (getMode != 0 || match.nSeg <= 1)) {
for (userIndex = 0; userIndex < userCount; ++userIndex) {
candidateOrdinal = (userEntries[1] & 0x7F) << 8 | userEntries[2];
record = records + candidateOrdinal * 12;
@@ -1913,13 +1916,13 @@ character_pass_done:
component_phase:
firstOrdinal = 0;
if (!phoneticRetry) goto component_retry;
if (!filteringMode || match.nSeg < 2) goto cangjie_components;
if (!filteringMode || match.nSeg <= 1) goto cangjie_components;
filteringMode = 5;
goto filtered_search;
cangjie_components:
record = records;
candidateCount = recordCount;
if (match.length < 2 || Zi8GetFormatVersion(1, work) < 4 ||
if (match.length <= 1 || Zi8GetFormatVersion(1, work) < 4 ||
!Zi8GetTableCount(1, 16, work) || elements[0] == 0xEF00 || getMode == 5) phase = 0xFF;
else {
rangeIndex = 0;
@@ -2184,7 +2187,7 @@ frequency_component_limit:
goto engine_finish;
}
if (!matchComponent) {
if (!options->countOnly && match.nCand < 2 &&
if (!options->countOnly && match.nCand <= 1 &&
(match.first != match.phon[0] || match.first2 != match.phon2[0])) {
switchedPhonetic = 1;
phoneticMask = match.phon[0];
@@ -2436,7 +2439,7 @@ engine_finish:
++outputIndex;
}
request->letters = emittedCount;
if (!totalResults && !request->firstCandidate && getMode == 1 && match.nCand >= 2 &&
if (!totalResults && !request->firstCandidate && getMode == 1 && match.nCand > 1 &&
(match.phon2[match.nCand - 1] & 0xFFF8) == 0x7600) {
match.phon[match.nCand - 1] = (match.phon[match.nCand - 1] & 7) + 0x7FF8;
match.phon2[match.nCand - 1] = (match.phon2[match.nCand - 1] & 7) + 0x398;
@@ -2506,7 +2509,7 @@ filtered_search:
} else {
if (getMode != 9) {
if (getMode > 8) goto filtered_accept;
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[11] | record[10] << 8);
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
if (match.length <= (phraseEntry[0] & 7) &&
match.arr1D[0] == (match.arr19[0] & phraseEntry[0]) &&
match.arr1D[1] == (match.arr19[1] & phraseEntry[1]) &&
@@ -2514,7 +2517,7 @@ filtered_search:
match.arr1D[3] == (match.arr19[3] & phraseEntry[3])) goto filtered_accept;
if (getMode == 7) goto filtered_next;
}
phraseEntry = phraseTable + ((record[9] & 15) << 16 | record[11] | record[10] << 8);
phraseEntry = phraseTable + ((record[9] & 15) << 16 | (record[11] | record[10] << 8));
rangeCount = phraseEntry[0] & 7;
if ((phraseEntry[0] & phraseMasks[rangeCount].bytes[0]) != phraseValues[rangeCount].bytes[0] ||
(phraseEntry[1] & phraseMasks[rangeCount].bytes[1]) != phraseValues[rangeCount].bytes[1] ||

View File

@@ -397,3 +397,158 @@ forbidden patterns added (net, per file): 0
readability warnings (net, per file; must be 0 in the final result): 0
GATE PASS
```
## First non-register divergence matching, 2026-10-01
Fresh branch agent/w1001/getzh-r3 from origin/main ea8d4d3b. Baseline engine fuzzy 81.362686%, 10676/10676 instructions, first non-register divergence at function +000c: target addi/save helper versus individual GPR saves. Baseline unit exact functions 5/8, matched code 4168/47816, data 96/536.
The strict divergence metric compares instructions in address order after replacing GPR names other than stack r1. It preserves opcodes, immediates, stack offsets, call names and function-relative branch destinations. No prologue instructions are skipped. Retention requires a later first divergence or higher engine fuzzy score and a passing quick gate. Candidate sources, builds, pool checks, full ctxdiff, normalized alignment and gate evidence are retained in /tmp/sol-med-zi8-r3.
- e00: declare component dictionary before record cursor. First non-register divergence +000c -> +000c; fuzzy 81.362686% -> 81.378980%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- e01: declare component dictionary after phrase table. First non-register divergence +000c -> +000c; fuzzy 81.378980% -> 81.362870%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e02: declare component dictionary after scalar phase. First non-register divergence +000c -> +000c; fuzzy 81.378980% -> 81.388725%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- e03: initialize component dictionary before scalar cursors. First non-register divergence +000c -> +000c; fuzzy 81.388725% -> 81.347694%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e04: initialize component dictionary after charset pointers. First non-register divergence +000c -> +000c; fuzzy 81.388725% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- e05: initialize component dictionary after charset entry. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.348350%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e06: declare spelling buffer after match count buffer. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e07: declare match parameters after candidate buffers. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e08: declare word mask buffers before candidate buffers. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e09: initialize charset flags in their declarations. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e10: initialize component dictionary in its declaration. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.346756%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- e11: declare candidate status as an integer boolean. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 80.740166%; deficit 0 -> -3; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- t00: assign component dictionary before advancing table cursor. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389100%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- t01: derive component cursor from dictionary origin. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.117744%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- t02: retain component origin after advancing shared cursor. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.316315%; deficit 0 -> -3; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- b00: separate word mask zero assignments in source order. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.367744%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- b01: materialize packed mask tag before component shifts. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.369610%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- b02: group the second packed component and mask tag. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.370550%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- b03: evaluate high component before low packed component. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.388350%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- b04: zero phrase pattern entries in ascending index order. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 80.938090%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- b05: restore target pud mode switch block order. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 82.174126%; deficit 0 -> -6; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- b06: restore target pud word output count placement. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.455605%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- b07: address oem segment fields before row stride. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.335610%; deficit 0 -> 8; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- b08: address pud segment fields before row stride. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.283066%; deficit 0 -> 8; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- b09: combine low phrase offset bytes in pud decoding. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.170006%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- b10: use explicit retry capacity selection. First non-register divergence +000c -> +0000; fuzzy 81.389280% -> 81.056760%; deficit 0 -> -12; frame 0x4f0; data 72; rejected and restored (no first-divergence or score improvement).
- b11: omit redundant initial engine match state reloads. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.116990%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- p00: switch pud modes using their promoted integer value. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 82.174126%; deficit 0 -> -6; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- p01: order pud dispatch and decode phrase offset low bytes first. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 82.420200%; deficit 0 -> -5; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- p02: restore pud dispatch with component segment indexing. First non-register divergence +000c -> +0000; fuzzy 81.389280% -> 82.454290%; deficit 0 -> 5; frame 0x4f0; data 72; rejected and restored (quick gate failed).
- f00: spell charset helper result as an explicit byte. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- f01: promote charset helper result before masking. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- f02: test charset mask before helper result operand. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- f03: spell charset helper bit tests as nonzero comparisons. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- f04: preserve byte charset count in explicit halfword assignment. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.252250%; deficit 0 -> -3; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- f05: assign component charset count in its table guard. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.384224%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- f06: use target greater-than-one bound for component mode. First non-register divergence +000c -> +000c; fuzzy 81.389280% -> 81.389850%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- p03: branch directly on pud duplicate helper results. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 81.241005%; deficit 0 -> -4; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- p04: restore pud switch and separate duplicate exits. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.367836%; deficit 0 -> -7; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- p05: restore pud switch duplicate exits and offset load order. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.478645%; deficit 0 -> -6; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- p06: restore pud switch duplicate exits and emission ordering. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.536810%; deficit 0 -> 5; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- p07: restore pud switch duplicates offsets and emission order. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.536810%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- s00: separate oem component spelling scan increments. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 81.295810%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- s01: separate each oem spelling scan increment statement. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 81.152020%; deficit 0 -> 4; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- s02: separate pud spelling scan increment statements. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 81.295425%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- q00-initial: use pud input-present branch before prefix word length. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 81.143030%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- q01: restore pud blocks and input-present length branch. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.570160%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- q02: restore pud blocks and separate spelling scan increments. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.533350%; deficit 0 -> 3; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- q03: restore pud blocks with direct length and scan statements. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.556670%; deficit 0 -> 3; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- q04: restore pud blocks and separate prefix pattern clearing. First non-register divergence +000c -> +000c; fuzzy 81.389850% -> 82.482956%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- q00-after-pud-blocks: use pud input-present branch before prefix word length. First non-register divergence +000c -> +000c; fuzzy 82.482956% -> 82.517700%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- h00: group low context dictionary phrase offset bytes. First non-register divergence +000c -> +000c; fuzzy 82.517700% -> 82.667660%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- h01: load context input match block before direct ordinal lookup. First non-register divergence +000c -> +000c; fuzzy 82.667660% -> 82.763400%; deficit 0 -> 6; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- h02: use context input-present word length branch. First non-register divergence +000c -> +000c; fuzzy 82.667660% -> 82.866330%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- h03: copy context characters before advancing word count. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.767426%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- h04: postincrement context character output count. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.746254%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- h05: evaluate context end-of-word flag after cursor update. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.919630%; deficit 0 -> 2; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- h06: address context component fields before segment stride. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 83.127580%; deficit 0 -> 11; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- h07: test context word bound before duplicate increment. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.852750%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- r00: test range exhaustion before decrementing candidate count. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.731080%; deficit 0 -> 9; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- k00: use range success branches before rejection cursor cleanup. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.873830%; deficit 0 -> -4; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- k01: share range secondary failure cursor advancement. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.873360%; deficit 0 -> -4; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- k02: advance range cursor on rejected primary pattern. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.790184%; deficit 0 -> -5; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- k03: use target eight-character range validation bound. First non-register divergence +000c -> +000c; fuzzy 82.866330% -> 82.866900%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- k04: decode range ordinal low bytes before high-byte shifts. First non-register divergence +000c -> +000c; fuzzy 82.866900% -> 82.895935%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- j00: emit valid character range phase before exhaustion phase. First non-register divergence +000c -> +000c; fuzzy 82.895935% -> 83.079620%; deficit 0 -> -2; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- j01: use range context-present terminal phase branch. First non-register divergence +000c -> +000c; fuzzy 82.895935% -> 82.896590%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- m00: restore valid range phase and context end-flag load order. First non-register divergence +000c -> +000c; fuzzy 82.896590% -> 83.194830%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- m01: restore range success cleanup and oem scan statements. First non-register divergence +000c -> +000c; fuzzy 82.896590% -> 83.121300%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- m02: restore range success cleanup and pud scan statements. First non-register divergence +000c -> +000c; fuzzy 82.896590% -> 83.001880%; deficit 0 -> -3; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- m03: restore valid range phase and omit redundant engine reloads. First non-register divergence +000c -> +0000; fuzzy 82.896590% -> 83.093666%; deficit 0 -> 12; frame 0x4f0; data 72; rejected and restored (quick gate failed).
- m04: restore context match-first block and range rejection cleanup. First non-register divergence +000c -> +000c; fuzzy 82.896590% -> 83.187805%; deficit 0 -> 1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- m05: restore range phase and context flag with pud scan statements. First non-register divergence +000c -> +000c; fuzzy 82.896590% -> 83.197830%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l00: group user dictionary phrase offset low bytes. First non-register divergence +000c -> +000c; fuzzy 83.197830% -> 83.209350%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (quick gate failed).
- l01: group global dictionary phrase offset low bytes. First non-register divergence +000c -> +000c; fuzzy 83.197830% -> 83.175720%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l02: group component phrase offset low bytes. First non-register divergence +000c -> +000c; fuzzy 83.197830% -> 83.172910%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l03: group filtered dictionary phrase offset low bytes. First non-register divergence +000c -> +000c; fuzzy 83.197830% -> 83.217964%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l04: branch directly on user duplicate helper results. First non-register divergence +000c -> +000c; fuzzy 83.217964% -> 83.177410%; deficit 0 -> -1; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- l05: use target one-syllable bound in user candidate guard. First non-register divergence +000c -> +000c; fuzzy 83.217964% -> 83.218530%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l06: use target one-segment bound in user component guard. First non-register divergence +000c -> +000c; fuzzy 83.218530% -> 83.219090%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l07: use target one-segment bound before filtered components. First non-register divergence +000c -> +000c; fuzzy 83.219090% -> 83.219650%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l08: use target component phase minimum length comparison. First non-register divergence +000c -> +000c; fuzzy 83.219650% -> 83.220215%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l09: address component segment fields before row stride. First non-register divergence +000c -> +0000; fuzzy 83.220215% -> 83.124760%; deficit 0 -> 10; frame 0x4f0; data 72; rejected and restored (no first-divergence or score improvement).
- l13: decode phonetic pair ordinals with low bytes first. First non-register divergence +000c -> +000c; fuzzy 83.220215% -> 83.068280%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l14: branch directly on phonetic pair duplicate rejection. First non-register divergence +000c -> +000c; fuzzy 83.220215% -> 83.220215%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l15: use target one-syllable bound on final phonetic retry. First non-register divergence +000c -> +000c; fuzzy 83.220215% -> 83.220770%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- l16: use target phonetic retry count comparison order. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 83.217780%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l17: compare candidate retry capacity before emitted count. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 83.217780%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- l18: address filtered component fields before segment stride. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 82.662890%; deficit 0 -> 6; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- l19: branch directly on filtered duplicate rejection. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 83.086460%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- n00: separate frequency seen-ordinal equality from loop bound. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 83.220770%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- n01: use target single-candidate phonetic fallback bound. First non-register divergence +000c -> +000c; fuzzy 83.220770% -> 83.221340%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- n02: decode component ordinal low byte before high byte. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.014430%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- n03: use target component-frequency comparison order. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.221340%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak00: restore component dictionary declaration beside its cursor. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.194360%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak01: restore component dictionary initialization before ordinals. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.220770%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak02: use a typed chinese work pointer for the private engine. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.009650%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak03: name the chinese work field view once for engine accesses. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 82.274350%; deficit 0 -> -97; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- tiebreak04: initialize component table alongside its declaration. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.179470%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak05: initialize the ordinal count after remaining range count. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.221340%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- tiebreak06: declare previous ordinal beside candidate ordinal. First non-register divergence +000c -> +000c; fuzzy 83.221340% -> 83.221530%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- tiebreak07: declare word output cursor beside candidate word buffer. First non-register divergence +000c -> +000c; fuzzy 83.221530% -> 83.237540%; deficit 0 -> 0; frame 0x4e0; data 96; kept (quick gate pass).
- u00: put punctuation character scan before word duplicate helper. First non-register divergence +000c -> +000c; fuzzy 83.237540% -> 83.237360%; deficit 0 -> 2; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
- u01: separate punctuation equality test from scan bound. First non-register divergence +000c -> +000c; fuzzy 83.237540% -> 83.156140%; deficit 0 -> 0; frame 0x4e0; data 96; rejected and restored (no first-divergence or score improvement).
- u02: restore punctuation duplicate block and equality branch order. First non-register divergence +000c -> +000c; fuzzy 83.237540% -> 83.210380%; deficit 0 -> 2; frame 0x4e0; data 24; rejected and restored (no first-divergence or score improvement).
### First-divergence round audit
105 distinct source candidates compiled and were measured in this round. Twenty-one improvements passed the quick gate and were committed separately. Each retained step raised engine fuzzy matching, preserved zero instruction deficit, kept 96 matched data bytes, and preserved all five instruction-exact functions. Twenty-four higher-scoring candidates failed the gate because the changed engine size or save metadata regressed matched exception data; all were restored. Transform assertions and temporary script construction failures are excluded from the compiled attempt count.
The first strict non-register divergence remains +000c: four individual source GPR stores versus target addi/_savegpr_27. The source restores those four registers individually at the end; the target uses _restgpr_27. Entry declaration/initialization experiments e00-e11, table assignment variants t00-t02, and final tiebreak00-tiebreak07 did not restore the target helper sequence. Register names are ignored in the strict metric, while immediates, stack offsets, opcodes, call names and function-relative branch destinations remain significant. No prologue instructions were excluded, and no later offset is claimed.
Retained structural repairs include the greater-than-one component guard at target +1850; PUD switch cases in target order, phrase offset load order, direct duplicate rejection branches, word count/output cursor order and input-present length selection; context phrase offset decoding and input-present length selection; context end-of-word tests from the decoded ordinal; valid character range phase before exhaustion, context phase branch direction, ordinal byte decode order and eight-character validation bound; one-candidate/one-segment comparisons in user, component and phonetic fallback guards; and filtered phrase offset decoding. PUD scan increments now use separate statements, eliminating an extra comma-expression store. Prefix array clearing uses two ordinary assignments, and final local declaration ordering retains measured improvements.
The successful PUD repair combined the previously gate-failing PUD blocks with separate prefix mask/value assignments; the successful range repair combined valid-phase block order, decoded context end flags and separate PUD scan increments. These changes restore actual operations and branch forms from the target. They add no dummy objects, padding, forced sections, inline assembly, volatile/register declarations, address-pinned labels or string blobs.
The final engine has 10676/10676 instructions, frame 0x4e0, fuzzy 81.362686% -> 83.237540%, first non-register divergence +000c -> +000c. Unit exact functions remain 5/8, matched code 4168/47816 and matched data 96/536. No new instruction-exact function was added. Remaining differences include GPR save/restore form, local stack offsets, register allocation and displaced branch bodies. The separate exact-function-count completion criterion is still unmet.
The complete final block map is /tmp/sol-med-zi8-r3/map.md and map.json, containing 1796 target and 1790 source blocks with instruction counts and calls. Target/source calls remain 168/166; the net call count difference consists only of _savegpr_27/_restgpr_27. final.ctxdiff retains every direct instruction difference. Trial sources, builds, disassemblies, normalized alignments, measurements and gate outputs are in the same directory. The reused q00 trial name was qualified as q00-initial and q00-after-pud-blocks; q00-initial was reconstructed from f06.c, rebuilt and remeasured to its recorded 81.143030%/10676 instructions, then the final source was restored. No trial evidence is counted twice.
The two smaller unmatched functions remain untouched: ZiMatchZHSpelling 98.801650%, 121/121 instructions with 29 register differences; Zi8GetElementCount 99.347824%, 115/115 instructions with thirteen register differences. Their three distinct successful-build attempts each remain logged as s04/s06/s07 and s01/s02/s03 in the previous block-map round. All R0-R16 ranges retain the three-attempt coverage audit above, with 105 further measured engine candidates in this round. This is partial matching progress, not unit completion.
Whitespace-only PUD switch cleanup preserved the final score, count, frame and divergence metric. The final clean gate follows.
```
full build: ok
main.dol sha1: 26116613f624061ba99c8d1a299aaa6efa85670d
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] pool: IDENTICAL
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] objdiff: code 4168/47816 data 96/536 functions 5/8 fuzzy 85.0112 linked code 0
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] instruction-exact functions: 5/8
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section .data size 392 match None
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section .sbss2 size 8 match 100.0
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section .sdata2 size 16 match 100.0
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section .text size 47816 match 85.01121
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section extab size 48 match 97.91667
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] section extabindex size 72 match 100.0
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] below 100: ZiMatchZHSpelling 98.80165
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] below 100: zi8InternalGetZH 83.23754
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] below 100: Zi8GetElementCount 99.347824
[libs/RVLMiddleware/eZiText/src/clib/zi8cgetc] baseline: code 4168/47816 data 96 functions 5 fuzzy 83.3368
regressions vs baseline: 0
global matched_code_percent: 86.47570 -> 86.47570
global fuzzy_match_percent: 98.99276 -> 99.01949
global complete_code_percent: 60.34391 -> 60.34391
global matched_data_percent: 90.98895 -> 90.98895
forbidden patterns added (net, per file): 0
readability warnings (net, per file; must be 0 in the final result): 0
GATE PASS
```