Something went wrong. Try again.
A fork of https://github.com/crosspoint-reader/crosspoint-reader
Something went wrong. Try again.
16 kB · 481 lines
C++
at master
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482#include "FontDecompressor.h"
#include <Arduino.h>#include <Logging.h>#include <Utf8.h>
#include <cstdlib>
FontDecompressor::~FontDecompressor() { deinit(); }
bool FontDecompressor::init() { clearCache(); return true;}
void FontDecompressor::deinit() { freePageBuffer(); freeHotGroup();}
void FontDecompressor::clearCache() { freePageBuffer(); freeHotGroup();}
void FontDecompressor::freePageBuffer() { for (uint8_t s = 0; s < pageSlotCount; s++) { free(pageSlots[s].buffer); free(pageSlots[s].glyphs); pageSlots[s] = {}; } pageSlotCount = 0;}
void FontDecompressor::freeHotGroup() { hotGroup.clear(); hotGroup.shrink_to_fit(); hotGroupFont = nullptr; hotGroupIndex = UINT16_MAX; hotGlyphBuf.clear(); hotGlyphBuf.shrink_to_fit();}
uint16_t FontDecompressor::getGroupIndex(const EpdFontData* fontData, uint32_t glyphIndex) { // O(1) path for frequency-grouped fonts with glyphToGroup mapping if (fontData->glyphToGroup != nullptr) { return fontData->glyphToGroup[glyphIndex]; }
// Contiguous-group fonts: linear scan for (uint16_t i = 0; i < fontData->groupCount; i++) { uint32_t first = fontData->groups[i].firstGlyphIndex; if (glyphIndex >= first && glyphIndex < first + fontData->groups[i].glyphCount) { return i; } } return fontData->groupCount; // sentinel = not found}
bool FontDecompressor::decompressGroup(const EpdFontData* fontData, uint16_t groupIndex, uint8_t* outBuf, uint32_t outSize) { const EpdFontGroup& group = fontData->groups[groupIndex];
const uint32_t tDecomp = millis(); inflateReader.init(false); inflateReader.setSource(&fontData->bitmap[group.compressedOffset], group.compressedSize); if (!inflateReader.read(outBuf, outSize)) { stats.decompressTimeMs += millis() - tDecomp; LOG_ERR("FDC", "Decompression failed for group %u", groupIndex); return false; } stats.decompressTimeMs += millis() - tDecomp; return true;}
// --- Byte-aligned helpers ---
uint32_t FontDecompressor::getAlignedOffset(const EpdFontData* fontData, uint16_t groupIndex, uint32_t glyphIndex) { uint32_t offset = 0;
auto accumGlyph = [&](const EpdGlyph& g) { if (g.width > 0 && g.height > 0) { offset += ((g.width + 3) / 4) * g.height; } };
if (fontData->glyphToGroup) { // Frequency-grouped: scan glyphs before glyphIndex that belong to this group for (uint32_t i = 0; i < glyphIndex; i++) { if (fontData->glyphToGroup[i] == groupIndex) { accumGlyph(fontData->glyph[i]); } } } else { // Contiguous-group: sum aligned sizes of preceding glyphs in the group const EpdFontGroup& group = fontData->groups[groupIndex]; for (uint32_t i = group.firstGlyphIndex; i < glyphIndex; i++) { accumGlyph(fontData->glyph[i]); } }
return offset;}
void FontDecompressor::compactSingleGlyph(const uint8_t* alignedSrc, uint8_t* packedDst, uint8_t width, uint8_t height) { if (width == 0 || height == 0) return; const uint32_t rowStride = (width + 3) / 4; if (width % 4 == 0) { memcpy(packedDst, alignedSrc, rowStride * height); return; } uint8_t outByte = 0, outBits = 0; uint32_t writeIdx = 0; for (uint8_t y = 0; y < height; y++) { for (uint8_t x = 0; x < width; x++) { outByte = (outByte << 2) | ((alignedSrc[y * rowStride + x / 4] >> ((3 - (x % 4)) * 2)) & 0x3); outBits += 2; if (outBits == 8) { packedDst[writeIdx++] = outByte; outByte = 0; outBits = 0; } } } if (outBits > 0) packedDst[writeIdx] = outByte << (8 - outBits);}
// --- getBitmap: page buffer → hot group → decompress ---
const uint8_t* FontDecompressor::getBitmap(const EpdFontData* fontData, const EpdGlyph* glyph, uint32_t glyphIndex) { const uint32_t tStart = micros(); stats.getBitmapCalls++;
if (!fontData->groups || fontData->groupCount == 0) { stats.getBitmapTimeUs += micros() - tStart; return &fontData->bitmap[glyph->dataOffset]; }
// Check page buffer slots (populated by prewarmCache — one slot per font style) for (uint8_t s = 0; s < pageSlotCount; s++) { const auto& slot = pageSlots[s]; if (slot.fontData != fontData || slot.glyphCount == 0) continue;
int left = 0, right = slot.glyphCount - 1; while (left <= right) { int mid = left + (right - left) / 2; if (slot.glyphs[mid].glyphIndex == glyphIndex) { if (slot.glyphs[mid].bufferOffset != UINT32_MAX) { stats.cacheHits++; stats.getBitmapTimeUs += micros() - tStart; return &slot.buffer[slot.glyphs[mid].bufferOffset]; } break; // Not extracted during prewarm; fall through to hot-group path } if (slot.glyphs[mid].glyphIndex < glyphIndex) left = mid + 1; else right = mid - 1; } break; // Found the right slot but glyph wasn't in it; don't check other slots }
// Fallback: hot group slot uint16_t groupIndex = getGroupIndex(fontData, glyphIndex); if (groupIndex >= fontData->groupCount) { LOG_ERR("FDC", "Glyph %u not found in any group", glyphIndex); stats.getBitmapTimeUs += micros() - tStart; return nullptr; }
// Check if hot group already has this group decompressed — if not, decompress it if (!(!hotGroup.empty() && hotGroupFont == fontData && hotGroupIndex == groupIndex)) { stats.cacheMisses++; const EpdFontGroup& group = fontData->groups[groupIndex];
hotGroup.resize(group.uncompressedSize); if (hotGroup.empty()) { LOG_ERR("FDC", "Failed to allocate %u bytes for hot group %u", group.uncompressedSize, groupIndex); hotGroupFont = nullptr; hotGroupIndex = UINT16_MAX; stats.getBitmapTimeUs += micros() - tStart; return nullptr; }
if (!decompressGroup(fontData, groupIndex, hotGroup.data(), group.uncompressedSize)) { hotGroup.clear(); hotGroup.shrink_to_fit(); hotGroupFont = nullptr; hotGroupIndex = UINT16_MAX; stats.getBitmapTimeUs += micros() - tStart; return nullptr; }
hotGroupFont = fontData; hotGroupIndex = groupIndex; stats.hotGroupBytes = group.uncompressedSize; } else { stats.cacheHits++; }
// Compact just the requested glyph from byte-aligned data into scratch buffer if (glyph->dataLength > hotGlyphBuf.size()) { hotGlyphBuf.resize(glyph->dataLength); } if (hotGlyphBuf.empty()) { stats.getBitmapTimeUs += micros() - tStart; return nullptr; }
uint32_t alignedOff = getAlignedOffset(fontData, groupIndex, glyphIndex); compactSingleGlyph(&hotGroup[alignedOff], hotGlyphBuf.data(), glyph->width, glyph->height); stats.getBitmapTimeUs += micros() - tStart; return hotGlyphBuf.data();}
// --- Prewarm: pre-decompress glyph bitmaps for a page of text ---
int32_t FontDecompressor::findGlyphIndex(const EpdFontData* fontData, uint32_t codepoint) { const EpdUnicodeInterval* intervals = fontData->intervals; const int count = fontData->intervalCount;
if (count == 0) return -1;
// Binary search int left = 0; int right = count - 1;
while (left <= right) { const int mid = left + (right - left) / 2; const EpdUnicodeInterval* interval = &intervals[mid];
if (codepoint < interval->first) { right = mid - 1; } else if (codepoint > interval->last) { left = mid + 1; } else { return static_cast<int32_t>(interval->offset + (codepoint - interval->first)); } }
return -1;}
int FontDecompressor::prewarmCache(const EpdFontData* fontData, const char* utf8Text) { if (!fontData || !fontData->groups || !utf8Text) return 0;
// Allocate the next available slot (caller must call freePageBuffer/clearCache to reset) if (pageSlotCount >= MAX_PAGE_SLOTS) { LOG_ERR("FDC", "All %u page buffer slots full, cannot prewarm fontData=%p", MAX_PAGE_SLOTS, (void*)fontData); return -1; } PageSlot& slot = pageSlots[pageSlotCount];
// Step 1: Collect unique glyph indices needed for this page uint32_t neededGlyphs[MAX_PAGE_GLYPHS]; uint16_t glyphCount = 0; bool glyphCapWarned = false;
const unsigned char* p = reinterpret_cast<const unsigned char*>(utf8Text); while (*p) { uint32_t cp = utf8NextCodepoint(&p); if (cp == 0) break;
int32_t glyphIdx = findGlyphIndex(fontData, cp); if (glyphIdx < 0) continue;
// Deduplicate bool found = false; for (uint16_t i = 0; i < glyphCount; i++) { if (neededGlyphs[i] == static_cast<uint32_t>(glyphIdx)) { found = true; break; } } if (!found) { if (glyphCount < MAX_PAGE_GLYPHS) { neededGlyphs[glyphCount++] = static_cast<uint32_t>(glyphIdx); } else if (!glyphCapWarned) { LOG_DBG("FDC", "Glyph cap (%u) reached during prewarm; excess glyphs will use hot-group fallback", MAX_PAGE_GLYPHS); glyphCapWarned = true; } } }
if (glyphCount == 0) return 0;
// Step 2: Compute total buffer size and collect unique groups uint32_t totalBytes = 0; uint16_t neededGroups[128]; uint8_t groupCount = 0; bool groupCapWarned = false;
for (uint16_t i = 0; i < glyphCount; i++) { totalBytes += fontData->glyph[neededGlyphs[i]].dataLength; uint16_t gi = getGroupIndex(fontData, neededGlyphs[i]); bool found = false; for (uint8_t j = 0; j < groupCount; j++) { if (neededGroups[j] == gi) { found = true; break; } } if (!found) { if (groupCount < 128) { neededGroups[groupCount++] = gi; } else if (!groupCapWarned) { LOG_DBG("FDC", "Group cap (128) reached during prewarm; some groups will use hot-group fallback"); groupCapWarned = true; } } }
stats.uniqueGroupsAccessed = groupCount;
// Step 3: Allocate page buffer and lookup table for this slot slot.buffer = static_cast<uint8_t*>(malloc(totalBytes)); slot.glyphs = static_cast<PageGlyphEntry*>(malloc(glyphCount * sizeof(PageGlyphEntry))); if (!slot.buffer || !slot.glyphs) { LOG_ERR("FDC", "Failed to allocate page buffer (%u bytes, %u glyphs)", totalBytes, glyphCount); free(slot.buffer); free(slot.glyphs); slot = {}; return glyphCount; } stats.pageBufferBytes += totalBytes; stats.pageGlyphsBytes += glyphCount * sizeof(PageGlyphEntry);
slot.fontData = fontData; slot.glyphCount = glyphCount; pageSlotCount++;
// Initialize lookup entries (bufferOffset = UINT32_MAX means not yet extracted) for (uint16_t i = 0; i < glyphCount; i++) { slot.glyphs[i] = {neededGlyphs[i], UINT32_MAX, 0}; }
// Sort by glyphIndex for binary search in getBitmap() for (uint16_t i = 1; i < glyphCount; i++) { PageGlyphEntry key = slot.glyphs[i]; int j = i - 1; while (j >= 0 && slot.glyphs[j].glyphIndex > key.glyphIndex) { slot.glyphs[j + 1] = slot.glyphs[j]; j--; } slot.glyphs[j + 1] = key; }
// Step 3b: Pre-scan to compute each needed glyph's byte-aligned offset within its group. // This avoids recomputing aligned offsets per group during extraction in step 4. uint32_t groupAlignedTracker[128] = {}; // running byte-aligned offset for each needed group
if (fontData->glyphToGroup) { // Frequency-grouped: single O(totalGlyphs) pass through glyphToGroup const auto& lastInterval = fontData->intervals[fontData->intervalCount - 1]; const uint32_t totalGlyphs = lastInterval.offset + (lastInterval.last - lastInterval.first + 1);
for (uint32_t i = 0; i < totalGlyphs; i++) { const uint16_t gi = fontData->glyphToGroup[i]; // Find this glyph's group position in neededGroups uint8_t gpPos = groupCount; for (uint8_t j = 0; j < groupCount; j++) { if (neededGroups[j] == gi) { gpPos = j; break; } } if (gpPos == groupCount) continue; // not a needed group
const EpdGlyph& glyph = fontData->glyph[i];
// Binary search in sorted slot.glyphs to find if glyph i is needed int left = 0, right = (int)slot.glyphCount - 1; while (left <= right) { const int mid = left + (right - left) / 2; if (slot.glyphs[mid].glyphIndex == i) { slot.glyphs[mid].alignedOffset = groupAlignedTracker[gpPos]; break; } if (slot.glyphs[mid].glyphIndex < i) left = mid + 1; else right = mid - 1; }
if (glyph.width > 0 && glyph.height > 0) { groupAlignedTracker[gpPos] += ((glyph.width + 3) / 4) * glyph.height; } } } else { // Contiguous-group: iterate each needed group's glyphs directly for (uint8_t g = 0; g < groupCount; g++) { const EpdFontGroup& group = fontData->groups[neededGroups[g]]; uint32_t alignedOff = 0; for (uint16_t j = 0; j < group.glyphCount; j++) { const uint32_t glyphI = group.firstGlyphIndex + j; const EpdGlyph& glyph = fontData->glyph[glyphI];
int left = 0, right = (int)slot.glyphCount - 1; while (left <= right) { const int mid = left + (right - left) / 2; if (slot.glyphs[mid].glyphIndex == glyphI) { slot.glyphs[mid].alignedOffset = alignedOff; break; } if (slot.glyphs[mid].glyphIndex < glyphI) left = mid + 1; else right = mid - 1; }
if (glyph.width > 0 && glyph.height > 0) { alignedOff += ((glyph.width + 3) / 4) * glyph.height; } } } }
// Step 4: For each unique group, decompress to temp buffer and extract needed glyphs uint32_t writeOffset = 0; int missed = 0;
for (uint8_t g = 0; g < groupCount; g++) { uint16_t groupIdx = neededGroups[g]; const EpdFontGroup& group = fontData->groups[groupIdx];
auto* tempBuf = static_cast<uint8_t*>(malloc(group.uncompressedSize)); if (!tempBuf) { LOG_ERR("FDC", "Failed to allocate temp buffer (%u bytes) for group %u", group.uncompressedSize, groupIdx); missed++; continue; } if (group.uncompressedSize > stats.peakTempBytes) { stats.peakTempBytes = group.uncompressedSize; }
if (!decompressGroup(fontData, groupIdx, tempBuf, group.uncompressedSize)) { free(tempBuf); missed++; continue; }
// Extract needed glyphs directly from the byte-aligned temp buffer, compacting on the fly. // alignedOffset was pre-computed in step 3b — no full-group compact scan needed. for (uint16_t i = 0; i < slot.glyphCount; i++) { if (slot.glyphs[i].bufferOffset != UINT32_MAX) continue; // already extracted if (getGroupIndex(fontData, slot.glyphs[i].glyphIndex) != groupIdx) continue;
const EpdGlyph& glyph = fontData->glyph[slot.glyphs[i].glyphIndex]; compactSingleGlyph(&tempBuf[slot.glyphs[i].alignedOffset], &slot.buffer[writeOffset], glyph.width, glyph.height); slot.glyphs[i].bufferOffset = writeOffset; writeOffset += glyph.dataLength; }
free(tempBuf); }
LOG_DBG("FDC", "Prewarm: %u glyphs in %u bytes from %u groups (%d missed)", glyphCount, writeOffset, groupCount, missed);
return missed;}
// --- Stats ---
void FontDecompressor::resetStats() { stats = Stats{}; }
void FontDecompressor::logStats(const char* label) { const uint32_t total = stats.cacheHits + stats.cacheMisses; LOG_DBG("FDC", "[%s] hits=%lu misses=%lu (%.1f%% hit rate)", label, stats.cacheHits, stats.cacheMisses, total > 0 ? 100.0f * stats.cacheHits / total : 0.0f); LOG_DBG("FDC", "[%s] decompress=%lums groups_accessed=%u", label, stats.decompressTimeMs, stats.uniqueGroupsAccessed); LOG_DBG("FDC", "[%s] mem: pageBuf=%lu pageGlyphs=%lu hotGroup=%lu peakTemp=%lu", label, stats.pageBufferBytes, stats.pageGlyphsBytes, stats.hotGroupBytes, stats.peakTempBytes); if (stats.getBitmapCalls > 0) { LOG_DBG("FDC", "[%s] getBitmap: %lu calls, %luus total, %luus/call avg", label, stats.getBitmapCalls, stats.getBitmapTimeUs, stats.getBitmapTimeUs / stats.getBitmapCalls); } resetStats();}