diff options
author | Mike Gabriel <mike.gabriel@das-netzwerkteam.de> | 2017-06-30 20:13:51 +0200 |
---|---|---|
committer | Mike Gabriel <mike.gabriel@das-netzwerkteam.de> | 2017-07-26 10:12:43 +0200 |
commit | f76c82403888bb498973ec974dbfd20e4edb02fe (patch) | |
tree | be0cb6c112d9d9fb46387fbd114727510197ddec /nxcomp/IntCache.cpp | |
parent | 9193d11eeeea933e293acd5e0f03fa4e9887186b (diff) | |
download | nx-libs-f76c82403888bb498973ec974dbfd20e4edb02fe.tar.gz nx-libs-f76c82403888bb498973ec974dbfd20e4edb02fe.tar.bz2 nx-libs-f76c82403888bb498973ec974dbfd20e4edb02fe.zip |
nxcomp: Switch to autoreconf.
Diffstat (limited to 'nxcomp/IntCache.cpp')
-rw-r--r-- | nxcomp/IntCache.cpp | 226 |
1 files changed, 0 insertions, 226 deletions
diff --git a/nxcomp/IntCache.cpp b/nxcomp/IntCache.cpp deleted file mode 100644 index 362412182..000000000 --- a/nxcomp/IntCache.cpp +++ /dev/null @@ -1,226 +0,0 @@ -/**************************************************************************/ -/* */ -/* Copyright (c) 2001, 2011 NoMachine (http://www.nomachine.com) */ -/* Copyright (c) 2008-2014 Oleksandr Shneyder <o.shneyder@phoca-gmbh.de> */ -/* Copyright (c) 2014-2016 Ulrich Sibiller <uli42@gmx.de> */ -/* Copyright (c) 2014-2016 Mihai Moldovan <ionic@ionic.de> */ -/* Copyright (c) 2011-2016 Mike Gabriel <mike.gabriel@das-netzwerkteam.de>*/ -/* Copyright (c) 2015-2016 Qindel Group (http://www.qindel.com) */ -/* */ -/* NXCOMP, NX protocol compression and NX extensions to this software */ -/* are copyright of the aforementioned persons and companies. */ -/* */ -/* Redistribution and use of the present software is allowed according */ -/* to terms specified in the file LICENSE.nxcomp which comes in the */ -/* source distribution. */ -/* */ -/* All rights reserved. */ -/* */ -/* NOTE: This software has received contributions from various other */ -/* contributors, only the core maintainers and supporters are listed as */ -/* copyright holders. Please contact us, if you feel you should be listed */ -/* as copyright holder, as well. */ -/* */ -/**************************************************************************/ - -#include <string.h> - -#include "Misc.h" -#include "IntCache.h" - -#define PANIC -#define WARNING -#undef TEST -#undef DEBUG -#undef DUMP - -IntCache::IntCache(unsigned int size) - - : size_(size), length_(0), buffer_(new unsigned int[size]), - lastDiff_(0), lastValueInserted_(0), predictedBlockSize_(0) -{ -} - -int IntCache::lookup(unsigned int &value, unsigned int &index, - unsigned int mask, unsigned int &sameDiff) -{ - for (unsigned int i = 0; i < length_; i++) - { - if (value == buffer_[i]) - { - index = i; - if (i) - { - unsigned int target = (i >> 1); - do - { - buffer_[i] = buffer_[i - 1]; - i--; - } - while (i > target); - buffer_[target] = value; - } - return 1; - } - } - unsigned int insertionPoint; - if (2 >= length_) - insertionPoint = length_; - else - insertionPoint = 2; - unsigned int start; - if (length_ >= size_) - start = size_ - 1; - else - { - start = length_; - length_++; - } - for (unsigned int k = start; k > insertionPoint; k--) - buffer_[k] = buffer_[k - 1]; - buffer_[insertionPoint] = value; - unsigned int diff = value - lastValueInserted_; - - lastValueInserted_ = (value & mask); - value = (diff & mask); - sameDiff = (value == lastDiff_); - if (!sameDiff) - { - lastDiff_ = value; - - unsigned int lastChangeIndex = 0; - unsigned int lastBitIsOne = (lastDiff_ & 0x1); - unsigned int j = 1; - for (unsigned int nextMask = 0x2; nextMask & mask; nextMask <<= 1) - { - unsigned int nextBitIsOne = (lastDiff_ & nextMask); - if (nextBitIsOne) - { - if (!lastBitIsOne) - { - lastChangeIndex = j; - lastBitIsOne = nextBitIsOne; - } - } - else - { - if (lastBitIsOne) - { - lastChangeIndex = j; - lastBitIsOne = nextBitIsOne; - } - } - j++; - } - predictedBlockSize_ = lastChangeIndex + 1; - if (predictedBlockSize_ < 2) - predictedBlockSize_ = 2; - } - return 0; -} - -void IntCache::insert(unsigned int &value, unsigned int mask) -{ - unsigned int insertionPoint; - if (2 >= length_) - insertionPoint = length_; - else - insertionPoint = 2; - unsigned int start; - if (length_ >= size_) - start = size_ - 1; - else - { - start = length_; - length_++; - } - for (unsigned int k = start; k > insertionPoint; k--) - buffer_[k] = buffer_[k - 1]; - if (lastDiff_ != value) - { - lastDiff_ = value; - unsigned int lastChangeIndex = 0; - unsigned int lastBitIsOne = (lastDiff_ & 0x1); - unsigned int j = 1; - for (unsigned int nextMask = 0x2; nextMask & mask; nextMask <<= 1) - { - unsigned int nextBitIsOne = (lastDiff_ & nextMask); - if (nextBitIsOne) - { - if (!lastBitIsOne) - { - lastChangeIndex = j; - lastBitIsOne = nextBitIsOne; - } - } - else - { - if (lastBitIsOne) - { - lastChangeIndex = j; - lastBitIsOne = nextBitIsOne; - } - } - j++; - } - predictedBlockSize_ = lastChangeIndex + 1; - if (predictedBlockSize_ < 2) - predictedBlockSize_ = 2; - } - lastValueInserted_ += value; - lastValueInserted_ &= mask; - buffer_[insertionPoint] = lastValueInserted_; - value = lastValueInserted_; -} - -void IntCache::push(unsigned int &value, unsigned int mask) -{ - // - // Using a memmove() appears to be slower. - // - // memmove((char *) &buffer_[1], (char *) &buffer_[0], - // sizeof(unsigned int) * (size_ - 1)); - // - // if (length_ < size_) - // { - // length_++; - // } - // - - unsigned int start; - - if (length_ >= size_) - { - start = size_ - 1; - } - else - { - start = length_; - - length_++; - } - - for (unsigned int k = start; k > 0; k--) - { - buffer_[k] = buffer_[k - 1]; - } - - value &= mask; - - buffer_[0] = value; -} - -void IntCache::dump() -{ - #ifdef DUMP - - *logofs << "IntCache: Dumping content of cache at " - << (void *) this << ":\n" << logofs_flush; - - for (unsigned int i = 0; i < length_; i++) - { - *logofs << "IntCache: [" << i << "][" << buffer_[i] << "]\n"; - } - - #endif -} |