/* Copyright (C) 2000-2003 Constantin Kaplinsky. All Rights Reserved. * Copyright (C) 2011 D. R. Commander. All Rights Reserved. * Copyright 2014-2018 Pierre Ossman for Cendio AB * Copyright 2018 Peter Astrand for Cendio AB * * This is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This software is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this software; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, * USA. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace rfb; static LogWriter vlog("EncodeManager"); // Split each rectangle into smaller ones no larger than this area, // and no wider than this width. static const int SubRectMaxArea = 65536; static const int SubRectMaxWidth = 2048; // The size in pixels of either side of each block tested when looking // for solid blocks. static const int SolidSearchBlock = 16; // Don't bother with blocks smaller than this static const int SolidBlockMinArea = 2048; // How long we consider a region recently changed (in ms) static const int RecentChangeTimeout = 50; namespace rfb { enum EncoderClass { encoderRaw, encoderRRE, encoderHextile, encoderTight, encoderTightJPEG, encoderZRLE, encoderClassMax, }; enum EncoderType { encoderSolid, encoderBitmap, encoderBitmapRLE, encoderIndexed, encoderIndexedRLE, encoderFullColour, encoderTypeMax, }; struct RectInfo { int rleRuns; Palette palette; }; }; static const char *encoderClassName(EncoderClass klass) { switch (klass) { case encoderRaw: return "Raw"; case encoderRRE: return "RRE"; case encoderHextile: return "Hextile"; case encoderTight: return "Tight"; case encoderTightJPEG: return "Tight (JPEG)"; case encoderZRLE: return "ZRLE"; case encoderClassMax: break; } return "Unknown Encoder Class"; } static const char *encoderTypeName(EncoderType type) { switch (type) { case encoderSolid: return "Solid"; case encoderBitmap: return "Bitmap"; case encoderBitmapRLE: return "Bitmap RLE"; case encoderIndexed: return "Indexed"; case encoderIndexedRLE: return "Indexed RLE"; case encoderFullColour: return "Full Colour"; case encoderTypeMax: break; } return "Unknown Encoder Type"; } EncodeManager::EncodeManager(SConnection* conn_) : conn(conn_), recentChangeTimer(this) { StatsVector::iterator iter; encoders.resize(encoderClassMax, NULL); activeEncoders.resize(encoderTypeMax, encoderRaw); encoders[encoderRaw] = new RawEncoder(conn); encoders[encoderRRE] = new RREEncoder(conn); encoders[encoderHextile] = new HextileEncoder(conn); encoders[encoderTight] = new TightEncoder(conn); encoders[encoderTightJPEG] = new TightJPEGEncoder(conn); encoders[encoderZRLE] = new ZRLEEncoder(conn); updates = 0; memset(©Stats, 0, sizeof(copyStats)); stats.resize(encoderClassMax); for (iter = stats.begin();iter != stats.end();++iter) { StatsVector::value_type::iterator iter2; iter->resize(encoderTypeMax); for (iter2 = iter->begin();iter2 != iter->end();++iter2) memset(&*iter2, 0, sizeof(EncoderStats)); } } EncodeManager::~EncodeManager() { std::vector::iterator iter; logStats(); for (iter = encoders.begin();iter != encoders.end();iter++) delete *iter; } void EncodeManager::logStats() { size_t i, j; unsigned rects; unsigned long long pixels, bytes, equivalent; double ratio; char a[1024], b[1024]; rects = 0; pixels = bytes = equivalent = 0; vlog.info("Framebuffer updates: %u", updates); if (copyStats.rects != 0) { vlog.info(" %s:", "CopyRect"); rects += copyStats.rects; pixels += copyStats.pixels; bytes += copyStats.bytes; equivalent += copyStats.equivalent; ratio = (double)copyStats.equivalent / copyStats.bytes; siPrefix(copyStats.rects, "rects", a, sizeof(a)); siPrefix(copyStats.pixels, "pixels", b, sizeof(b)); vlog.info(" %s: %s, %s", "Copies", a, b); iecPrefix(copyStats.bytes, "B", a, sizeof(a)); vlog.info(" %*s %s (1:%g ratio)", (int)strlen("Copies"), "", a, ratio); } for (i = 0;i < stats.size();i++) { // Did this class do anything at all? for (j = 0;j < stats[i].size();j++) { if (stats[i][j].rects != 0) break; } if (j == stats[i].size()) continue; vlog.info(" %s:", encoderClassName((EncoderClass)i)); for (j = 0;j < stats[i].size();j++) { if (stats[i][j].rects == 0) continue; rects += stats[i][j].rects; pixels += stats[i][j].pixels; bytes += stats[i][j].bytes; equivalent += stats[i][j].equivalent; ratio = (double)stats[i][j].equivalent / stats[i][j].bytes; siPrefix(stats[i][j].rects, "rects", a, sizeof(a)); siPrefix(stats[i][j].pixels, "pixels", b, sizeof(b)); vlog.info(" %s: %s, %s", encoderTypeName((EncoderType)j), a, b); iecPrefix(stats[i][j].bytes, "B", a, sizeof(a)); vlog.info(" %*s %s (1:%g ratio)", (int)strlen(encoderTypeName((EncoderType)j)), "", a, ratio); } } ratio = (double)equivalent / bytes; siPrefix(rects, "rects", a, sizeof(a)); siPrefix(pixels, "pixels", b, sizeof(b)); vlog.info(" Total: %s, %s", a, b); iecPrefix(bytes, "B", a, sizeof(a)); vlog.info(" %s (1:%g ratio)", a, ratio); } bool EncodeManager::supported(int encoding) { switch (encoding) { case encodingRaw: case encodingRRE: case encodingHextile: case encodingZRLE: case encodingTight: return true; default: return false; } } bool EncodeManager::needsLosslessRefresh(const Region& req) { return !lossyRegion.intersect(req).is_empty(); } int EncodeManager::getNextLosslessRefresh(const Region& req) { // Do we have something we can send right away? if (!pendingRefreshRegion.intersect(req).is_empty()) return 0; assert(needsLosslessRefresh(req)); assert(recentChangeTimer.isStarted()); return recentChangeTimer.getNextTimeout(); } void EncodeManager::pruneLosslessRefresh(const Region& limits) { lossyRegion.assign_intersect(limits); pendingRefreshRegion.assign_intersect(limits); } void EncodeManager::writeUpdate(const UpdateInfo& ui, const PixelBuffer* pb, const RenderedCursor* renderedCursor) { doUpdate(true, ui.changed, ui.copied, ui.copy_delta, pb, renderedCursor); recentlyChangedRegion.assign_union(ui.changed); recentlyChangedRegion.assign_union(ui.copied); if (!recentChangeTimer.isStarted()) recentChangeTimer.start(RecentChangeTimeout); } void EncodeManager::writeLosslessRefresh(const Region& req, const PixelBuffer* pb, const RenderedCursor* renderedCursor, size_t maxUpdateSize) { doUpdate(false, getLosslessRefresh(req, maxUpdateSize), Region(), Point(), pb, renderedCursor); } bool EncodeManager::handleTimeout(Timer* t) { if (t == &recentChangeTimer) { // Any lossy region that wasn't recently updated can // now be scheduled for a refresh pendingRefreshRegion.assign_union(lossyRegion.subtract(recentlyChangedRegion)); recentlyChangedRegion.clear(); // Will there be more to do? (i.e. do we need another round) if (!lossyRegion.subtract(pendingRefreshRegion).is_empty()) return true; } return false; } void EncodeManager::doUpdate(bool allowLossy, const Region& changed_, const Region& copied, const Point& copyDelta, const PixelBuffer* pb, const RenderedCursor* renderedCursor) { int nRects; Region changed, cursorRegion; updates++; prepareEncoders(allowLossy); changed = changed_; if (!conn->client.supportsEncoding(encodingCopyRect)) changed.assign_union(copied); /* * We need to render the cursor seperately as it has its own * magical pixel buffer, so split it out from the changed region. */ if (renderedCursor != NULL) { cursorRegion = changed.intersect(renderedCursor->getEffectiveRect()); changed.assign_subtract(renderedCursor->getEffectiveRect()); } if (conn->client.supportsEncoding(pseudoEncodingLastRect)) nRects = 0xFFFF; else { nRects = copied.numRects(); nRects += computeNumRects(changed); nRects += computeNumRects(cursorRegion); } conn->writer()->writeFramebufferUpdateStart(nRects); if (conn->client.supportsEncoding(encodingCopyRect)) writeCopyRects(copied, copyDelta); /* * We start by searching for solid rects, which are then removed * from the changed region. */ if (conn->client.supportsEncoding(pseudoEncodingLastRect)) writeSolidRects(&changed, pb); writeRects(changed, pb); writeRects(cursorRegion, renderedCursor); conn->writer()->writeFramebufferUpdateEnd(); } void EncodeManager::prepareEncoders(bool allowLossy) { enum EncoderClass solid, bitmap, bitmapRLE; enum EncoderClass indexed, indexedRLE, fullColour; bool allowJPEG; rdr::S32 preferred; std::vector::iterator iter; solid = bitmap = bitmapRLE = encoderRaw; indexed = indexedRLE = fullColour = encoderRaw; allowJPEG = conn->client.pf().bpp >= 16; if (!allowLossy) { if (encoders[encoderTightJPEG]->losslessQuality == -1) allowJPEG = false; } // Try to respect the client's wishes preferred = conn->getPreferredEncoding(); switch (preferred) { case encodingRRE: // Horrible for anything high frequency and/or lots of colours bitmapRLE = indexedRLE = encoderRRE; break; case encodingHextile: // Slightly less horrible bitmapRLE = indexedRLE = fullColour = encoderHextile; break; case encodingTight: if (encoders[encoderTightJPEG]->isSupported() && allowJPEG) fullColour = encoderTightJPEG; else fullColour = encoderTight; indexed = indexedRLE = encoderTight; bitmap = bitmapRLE = encoderTight; break; case encodingZRLE: fullColour = encoderZRLE; bitmapRLE = indexedRLE = encoderZRLE; bitmap = indexed = encoderZRLE; break; } // Any encoders still unassigned? if (fullColour == encoderRaw) { if (encoders[encoderTightJPEG]->isSupported() && allowJPEG) fullColour = encoderTightJPEG; else if (encoders[encoderZRLE]->isSupported()) fullColour = encoderZRLE; else if (encoders[encoderTight]->isSupported()) fullColour = encoderTight; else if (encoders[encoderHextile]->isSupported()) fullColour = encoderHextile; } if (indexed == encoderRaw) { if (encoders[encoderZRLE]->isSupported()) indexed = encoderZRLE; else if (encoders[encoderTight]->isSupported()) indexed = encoderTight; else if (encoders[encoderHextile]->isSupported()) indexed = encoderHextile; } if (indexedRLE == encoderRaw) indexedRLE = indexed; if (bitmap == encoderRaw) bitmap = indexed; if (bitmapRLE == encoderRaw) bitmapRLE = bitmap; if (solid == encoderRaw) { if (encoders[encoderTight]->isSupported()) solid = encoderTight; else if (encoders[encoderRRE]->isSupported()) solid = encoderRRE; else if (encoders[encoderZRLE]->isSupported()) solid = encoderZRLE; else if (encoders[encoderHextile]->isSupported()) solid = encoderHextile; } // JPEG is the only encoder that can reduce things to grayscale if ((conn->client.subsampling == subsampleGray) && encoders[encoderTightJPEG]->isSupported() && allowLossy) { solid = bitmap = bitmapRLE = encoderTightJPEG; indexed = indexedRLE = fullColour = encoderTightJPEG; } activeEncoders[encoderSolid] = solid; activeEncoders[encoderBitmap] = bitmap; activeEncoders[encoderBitmapRLE] = bitmapRLE; activeEncoders[encoderIndexed] = indexed; activeEncoders[encoderIndexedRLE] = indexedRLE; activeEncoders[encoderFullColour] = fullColour; for (iter = activeEncoders.begin(); iter != activeEncoders.end(); ++iter) { Encoder *encoder; encoder = encoders[*iter]; encoder->setCompressLevel(conn->client.compressLevel); if (allowLossy) { encoder->setQualityLevel(conn->client.qualityLevel); encoder->setFineQualityLevel(conn->client.fineQualityLevel, conn->client.subsampling); } else { int level = __rfbmax(conn->client.qualityLevel, encoder->losslessQuality); encoder->setQualityLevel(level); encoder->setFineQualityLevel(-1, subsampleUndefined); } } } Region EncodeManager::getLosslessRefresh(const Region& req, size_t maxUpdateSize) { std::vector rects; Region refresh; size_t area; // We make a conservative guess at the compression ratio at 2:1 maxUpdateSize *= 2; // We will measure pixels, not bytes (assume 32 bpp) maxUpdateSize /= 4; area = 0; pendingRefreshRegion.intersect(req).get_rects(&rects); while (!rects.empty()) { size_t idx; Rect rect; // Grab a random rect so we don't keep damaging and restoring the // same rect over and over idx = rand() % rects.size(); rect = rects[idx]; // Add rects until we exceed the threshold, then include as much as // possible of the final rect if ((area + rect.area()) > maxUpdateSize) { // Use the narrowest axis to avoid getting to thin rects if (rect.width() > rect.height()) { int width = (maxUpdateSize - area) / rect.height(); rect.br.x = rect.tl.x + __rfbmax(1, width); } else { int height = (maxUpdateSize - area) / rect.width(); rect.br.y = rect.tl.y + __rfbmax(1, height); } refresh.assign_union(Region(rect)); break; } area += rect.area(); refresh.assign_union(Region(rect)); rects.erase(rects.begin() + idx); } return refresh; } int EncodeManager::computeNumRects(const Region& changed) { int numRects; std::vector rects; std::vector::const_iterator rect; numRects = 0; changed.get_rects(&rects); for (rect = rects.begin(); rect != rects.end(); ++rect) { int w, h, sw, sh; w = rect->width(); h = rect->height(); // No split necessary? if (((w*h) < SubRectMaxArea) && (w < SubRectMaxWidth)) { numRects += 1; continue; } if (w <= SubRectMaxWidth) sw = w; else sw = SubRectMaxWidth; sh = SubRectMaxArea / sw; // ceil(w/sw) * ceil(h/sh) numRects += (((w - 1)/sw) + 1) * (((h - 1)/sh) + 1); } return numRects; } Encoder *EncodeManager::startRect(const Rect& rect, int type) { Encoder *encoder; int klass, equiv; activeType = type; klass = activeEncoders[activeType]; beforeLength = conn->getOutStream()->length(); stats[klass][activeType].rects++; stats[klass][activeType].pixels += rect.area(); equiv = 12 + rect.area() * (conn->client.pf().bpp/8); stats[klass][activeType].equivalent += equiv; encoder = encoders[klass]; conn->writer()->startRect(rect, encoder->encoding); if ((encoder->flags & EncoderLossy) && ((encoder->losslessQuality == -1) || (encoder->getQualityLevel() < encoder->losslessQuality))) lossyRegion.assign_union(Region(rect)); else lossyRegion.assign_subtract(Region(rect)); // This was either a rect getting refreshed, or a rect that just got // new content. Either way we should not try to refresh it anymore. pendingRefreshRegion.assign_subtract(Region(rect)); return encoder; } void EncodeManager::endRect() { int klass; int length; conn->writer()->endRect(); length = conn->getOutStream()->length() - beforeLength; klass = activeEncoders[activeType]; stats[klass][activeType].bytes += length; } void EncodeManager::writeCopyRects(const Region& copied, const Point& delta) { std::vector rects; std::vector::const_iterator rect; Region lossyCopy; beforeLength = conn->getOutStream()->length(); copied.get_rects(&rects, delta.x <= 0, delta.y <= 0); for (rect = rects.begin(); rect != rects.end(); ++rect) { int equiv; copyStats.rects++; copyStats.pixels += rect->area(); equiv = 12 + rect->area() * (conn->client.pf().bpp/8); copyStats.equivalent += equiv; conn->writer()->writeCopyRect(*rect, rect->tl.x - delta.x, rect->tl.y - delta.y); } copyStats.bytes += conn->getOutStream()->length() - beforeLength; lossyCopy = lossyRegion; lossyCopy.translate(delta); lossyCopy.assign_intersect(copied); lossyRegion.assign_union(lossyCopy); // Stop any pending refresh as a copy is enough that we consider // this region to be recently changed pendingRefreshRegion.assign_subtract(copied); } void EncodeManager::writeSolidRects(Region *changed, const PixelBuffer* pb) { std::vector rects; std::vector::const_iterator rect; changed->get_rects(&rects); for (rect = rects.begin(); rect != rects.end(); ++rect) findSolidRect(*rect, changed, pb); } void EncodeManager::findSolidRect(const Rect& rect, Region *changed, const PixelBuffer* pb) { Rect sr; int dx, dy, dw, dh; // We start by finding a solid 16x16 block for (dy = rect.tl.y; dy < rect.br.y; dy += SolidSearchBlock) { dh = SolidSearchBlock; if (dy + dh > rect.br.y) dh = rect.br.y - dy; for (dx = rect.tl.x; dx < rect.br.x; dx += SolidSearchBlock) { // We define it like this to guarantee alignment rdr::U32 _buffer; rdr::U8* colourValue = (rdr::U8*)&_buffer; dw = SolidSearchBlock; if (dx + dw > rect.br.x) dw = rect.br.x - dx; pb->getImage(colourValue, Rect(dx, dy, dx+1, dy+1)); sr.setXYWH(dx, dy, dw, dh); if (checkSolidTile(sr, colourValue, pb)) { Rect erb, erp; Encoder *encoder; // We then try extending the area by adding more blocks // in both directions and pick the combination that gives // the largest area. sr.setXYWH(dx, dy, rect.br.x - dx, rect.br.y - dy); extendSolidAreaByBlock(sr, colourValue, pb, &erb); // Did we end up getting the entire rectangle? if (erb.equals(rect)) erp = erb; else { // Don't bother with sending tiny rectangles if (erb.area() < SolidBlockMinArea) continue; // Extend the area again, but this time one pixel // row/column at a time. extendSolidAreaByPixel(rect, erb, colourValue, pb, &erp); } // Send solid-color rectangle. encoder = startRect(erp, encoderSolid); if (encoder->flags & EncoderUseNativePF) { encoder->writeSolidRect(erp.width(), erp.height(), pb->getPF(), colourValue); } else { rdr::U32 _buffer2; rdr::U8* converted = (rdr::U8*)&_buffer2; conn->client.pf().bufferFromBuffer(converted, pb->getPF(), colourValue, 1); encoder->writeSolidRect(erp.width(), erp.height(), conn->client.pf(), converted); } endRect(); changed->assign_subtract(Region(erp)); // Search remaining areas by recursion // FIXME: Is this the best way to divide things up? // Left? (Note that we've already searched a SolidSearchBlock // pixels high strip here) if ((erp.tl.x != rect.tl.x) && (erp.height() > SolidSearchBlock)) { sr.setXYWH(rect.tl.x, erp.tl.y + SolidSearchBlock, erp.tl.x - rect.tl.x, erp.height() - SolidSearchBlock); findSolidRect(sr, changed, pb); } // Right? if (erp.br.x != rect.br.x) { sr.setXYWH(erp.br.x, erp.tl.y, rect.br.x - erp.br.x, erp.height()); findSolidRect(sr, changed, pb); } // Below? if (erp.br.y != rect.br.y) { sr.setXYWH(rect.tl.x, erp.br.y, rect.width(), rect.br.y - erp.br.y); findSolidRect(sr, changed, pb); } return; } } } } void EncodeManager::writeRects(const Region& changed, const PixelBuffer* pb) { std::vector rects; std::vector::const_iterator rect; changed.get_rects(&rects); for (rect = rects.begin(); rect != rects.end(); ++rect) { int w, h, sw, sh; Rect sr; w = rect->width(); h = rect->height(); // No split necessary? if (((w*h) < SubRectMaxArea) && (w < SubRectMaxWidth)) { writeSubRect(*rect, pb); continue; } if (w <= SubRectMaxWidth) sw = w; else sw = SubRectMaxWidth; sh = SubRectMaxArea / sw; for (sr.tl.y = rect->tl.y; sr.tl.y < rect->br.y; sr.tl.y += sh) { sr.br.y = sr.tl.y + sh; if (sr.br.y > rect->br.y) sr.br.y = rect->br.y; for (sr.tl.x = rect->tl.x; sr.tl.x < rect->br.x; sr.tl.x += sw) { sr.br.x = sr.tl.x + sw; if (sr.br.x > rect->br.x) sr.br.x = rect->br.x; writeSubRect(sr, pb); } } } } void EncodeManager::writeSubRect(const Rect& rect, const PixelBuffer *pb) { PixelBuffer *ppb; Encoder *encoder; struct RectInfo info; unsigned int divisor, maxColours; bool useRLE; EncoderType type; // FIXME: This is roughly the algorithm previously used by the Tight // encoder. It seems a bit backwards though, that higher // compression setting means spending less effort in building // a palette. It might be that they figured the increase in // zlib setting compensated for the loss. if (conn->client.compressLevel == -1) divisor = 2 * 8; else divisor = conn->client.compressLevel * 8; if (divisor < 4) divisor = 4; maxColours = rect.area()/divisor; // Special exception inherited from the Tight encoder if (activeEncoders[encoderFullColour] == encoderTightJPEG) { if ((conn->client.compressLevel != -1) && (conn->client.compressLevel < 2)) maxColours = 24; else maxColours = 96; } if (maxColours < 2) maxColours = 2; encoder = encoders[activeEncoders[encoderIndexedRLE]]; if (maxColours > encoder->maxPaletteSize) maxColours = encoder->maxPaletteSize; encoder = encoders[activeEncoders[encoderIndexed]]; if (maxColours > encoder->maxPaletteSize) maxColours = encoder->maxPaletteSize; ppb = preparePixelBuffer(rect, pb, true); if (!analyseRect(ppb, &info, maxColours)) info.palette.clear(); // Different encoders might have different RLE overhead, but // here we do a guess at RLE being the better choice if reduces // the pixel count by 50%. useRLE = info.rleRuns <= (rect.area() * 2); switch (info.palette.size()) { case 0: type = encoderFullColour; break; case 1: type = encoderSolid; break; case 2: if (useRLE) type = encoderBitmapRLE; else type = encoderBitmap; break; default: if (useRLE) type = encoderIndexedRLE; else type = encoderIndexed; } encoder = startRect(rect, type); if (encoder->flags & EncoderUseNativePF) ppb = preparePixelBuffer(rect, pb, false); encoder->writeRect(ppb, info.palette); endRect(); } bool EncodeManager::checkSolidTile(const Rect& r, const rdr::U8* colourValue, const PixelBuffer *pb) { switch (pb->getPF().bpp) { case 32: return checkSolidTile(r, *(const rdr::U32*)colourValue, pb); case 16: return checkSolidTile(r, *(const rdr::U16*)colourValue, pb); default: return checkSolidTile(r, *(const rdr::U8*)colourValue, pb); } } void EncodeManager::extendSolidAreaByBlock(const Rect& r, const rdr::U8* colourValue, const PixelBuffer *pb, Rect* er) { int dx, dy, dw, dh; int w_prev; Rect sr; int w_best = 0, h_best = 0; w_prev = r.width(); // We search width first, back off when we hit a different colour, // and restart with a larger height. We keep track of the // width/height combination that gives us the largest area. for (dy = r.tl.y; dy < r.br.y; dy += SolidSearchBlock) { dh = SolidSearchBlock; if (dy + dh > r.br.y) dh = r.br.y - dy; // We test one block here outside the x loop in order to break // the y loop right away. dw = SolidSearchBlock; if (dw > w_prev) dw = w_prev; sr.setXYWH(r.tl.x, dy, dw, dh); if (!checkSolidTile(sr, colourValue, pb)) break; for (dx = r.tl.x + dw; dx < r.tl.x + w_prev;) { dw = SolidSearchBlock; if (dx + dw > r.tl.x + w_prev) dw = r.tl.x + w_prev - dx; sr.setXYWH(dx, dy, dw, dh); if (!checkSolidTile(sr, colourValue, pb)) break; dx += dw; } w_prev = dx - r.tl.x; if (w_prev * (dy + dh - r.tl.y) > w_best * h_best) { w_best = w_prev; h_best = dy + dh - r.tl.y; } } er->tl.x = r.tl.x; er->tl.y = r.tl.y; er->br.x = er->tl.x + w_best; er->br.y = er->tl.y + h_best; } void EncodeManager::extendSolidAreaByPixel(const Rect& r, const Rect& sr, const rdr::U8* colourValue, const PixelBuffer *pb, Rect* er) { int cx, cy; Rect tr; // Try to extend the area upwards. for (cy = sr.tl.y - 1; cy >= r.tl.y; cy--) { tr.setXYWH(sr.tl.x, cy, sr.width(), 1); if (!checkSolidTile(tr, colourValue, pb)) break; } er->tl.y = cy + 1; // ... downwards. for (cy = sr.br.y; cy < r.br.y; cy++) { tr.setXYWH(sr.tl.x, cy, sr.width(), 1); if (!checkSolidTile(tr, colourValue, pb)) break; } er->br.y = cy; // ... to the left. for (cx = sr.tl.x - 1; cx >= r.tl.x; cx--) { tr.setXYWH(cx, er->tl.y, 1, er->height()); if (!checkSolidTile(tr, colourValue, pb)) break; } er->tl.x = cx + 1; // ... to the right. for (cx = sr.br.x; cx < r.br.x; cx++) { tr.setXYWH(cx, er->tl.y, 1, er->height()); if (!checkSolidTile(tr, colourValue, pb)) break; } er->br.x = cx; } PixelBuffer* EncodeManager::preparePixelBuffer(const Rect& rect, const PixelBuffer *pb, bool convert) { const rdr::U8* buffer; int stride; // Do wo need to convert the data? if (convert && !conn->client.pf().equal(pb->getPF())) { convertedPixelBuffer.setPF(conn->client.pf()); convertedPixelBuffer.setSize(rect.width(), rect.height()); buffer = pb->getBuffer(rect, &stride); convertedPixelBuffer.imageRect(pb->getPF(), convertedPixelBuffer.getRect(), buffer, stride); return &convertedPixelBuffer; } // Otherwise we still need to shift the coordinates. We have our own // abusive subclass of FullFramePixelBuffer for this. buffer = pb->getBuffer(rect, &stride); offsetPixelBuffer.update(pb->getPF(), rect.width(), rect.height(), buffer, stride); return &offsetPixelBuffer; } bool EncodeManager::analyseRect(const PixelBuffer *pb, struct RectInfo *info, int maxColours) { const rdr::U8* buffer; int stride; buffer = pb->getBuffer(pb->getRect(), &stride); switch (pb->getPF().bpp) { case 32: return analyseRect(pb->width(), pb->height(), (const rdr::U32*)buffer, stride, info, maxColours); case 16: return analyseRect(pb->width(), pb->height(), (const rdr::U16*)buffer, stride, info, maxColours); default: return analyseRect(pb->width(), pb->height(), (const rdr::U8*)buffer, stride, info, maxColours); } } void EncodeManager::OffsetPixelBuffer::update(const PixelFormat& pf, int width, int height, const rdr::U8* data_, int stride_) { format = pf; width_ = width; height_ = height; // Forced cast. We never write anything though, so it should be safe. data = (rdr::U8*)data_; stride = stride_; } // Preprocessor generated, optimised methods #define BPP 8 #include "EncodeManagerBPP.cxx" #undef BPP #define BPP 16 #include "EncodeManagerBPP.cxx" #undef BPP #define BPP 32 #include "EncodeManagerBPP.cxx" #undef BPP