aboutsummaryrefslogtreecommitdiff
path: root/nxcomp/TextCompressor.cpp
diff options
context:
space:
mode:
authorMike Gabriel <mike.gabriel@das-netzwerkteam.de>2011-11-19 15:59:16 +0100
committerMike Gabriel <mike.gabriel@das-netzwerkteam.de>2011-11-19 15:59:16 +0100
commita48361b11a5abb5a345dac5ec83a8f56c4d50b74 (patch)
treea16fb870a072450bb45ee09ac4df9887bfa7f98e /nxcomp/TextCompressor.cpp
parent9997e13bb583de4012914006c7507839a4e11227 (diff)
parent232dfc41d41390bfffa75ec2ed065c109fa03a0e (diff)
downloadnx-libs-a48361b11a5abb5a345dac5ec83a8f56c4d50b74.tar.gz
nx-libs-a48361b11a5abb5a345dac5ec83a8f56c4d50b74.tar.bz2
nx-libs-a48361b11a5abb5a345dac5ec83a8f56c4d50b74.zip
Merge branch 'nxcomp'
Diffstat (limited to 'nxcomp/TextCompressor.cpp')
-rw-r--r--nxcomp/TextCompressor.cpp77
1 files changed, 77 insertions, 0 deletions
diff --git a/nxcomp/TextCompressor.cpp b/nxcomp/TextCompressor.cpp
new file mode 100644
index 000000000..16131222c
--- /dev/null
+++ b/nxcomp/TextCompressor.cpp
@@ -0,0 +1,77 @@
+/**************************************************************************/
+/* */
+/* Copyright (c) 2001, 2010 NoMachine, http://www.nomachine.com/. */
+/* */
+/* NXCOMP, NX protocol compression and NX extensions to this software */
+/* are copyright of NoMachine. Redistribution and use of the present */
+/* software is allowed according to terms specified in the file LICENSE */
+/* which comes in the source distribution. */
+/* */
+/* Check http://www.nomachine.com/licensing.html for applicability. */
+/* */
+/* NX and NoMachine are trademarks of Medialogic S.p.A. */
+/* */
+/* All rights reserved. */
+/* */
+/**************************************************************************/
+
+#include "TextCompressor.h"
+
+#include "EncodeBuffer.h"
+#include "DecodeBuffer.h"
+
+//
+// The compression obtained by this class is
+// very poor. In newer versions the text is
+// simply appended to the encode buffer and
+// compressed by leveraging the final stream
+// compression.
+//
+
+void
+TextCompressor::encodeChar(unsigned char ch, EncodeBuffer& encodeBuffer)
+{
+ // encode each successive character of text using
+ // a predictive model where most of the last 3 characters
+ // (low order 7 bits of the previous character, plus the
+ // low order 5 bits of the character before that, plus
+ // the low order 3 bits of the character before that)
+ // are used to find the right cache...
+
+ CharCache& cache = cache_[key_ % cacheSize_];
+ if ((key_ >= 128) && (cache.getSize() == 0))
+ {
+ // 3rd-order model doesn't have any statistics yet,
+ // so use the 1st-order one instead
+ CharCache& cache2 = cache_[(key_ & 0x7f) % cacheSize_];
+ encodeBuffer.encodeCachedValue((unsigned int) ch, 8, cache2);
+ cache.insert(ch);
+ }
+ else
+ {
+ encodeBuffer.encodeCachedValue((unsigned int) ch, 8, cache);
+ }
+
+ key_ = (((key_ & 0x1f) << 7) | ((key_ & 0x380) << 5) | (ch & 0x7f));
+}
+
+
+unsigned char
+TextCompressor::decodeChar(DecodeBuffer& decodeBuffer)
+{
+ unsigned char nextChar;
+ CharCache& cache = cache_[key_ % cacheSize_];
+ if ((key_ >= 128) && (cache.getSize() == 0))
+ {
+ CharCache& cache2 = cache_[(key_ & 0x7f) % cacheSize_];
+ decodeBuffer.decodeCachedValue(nextChar, 8, cache2);
+ cache.insert(nextChar);
+ }
+ else
+ {
+ decodeBuffer.decodeCachedValue(nextChar, 8, cache);
+ }
+
+ key_ = (((key_ & 0x1f) << 7) | ((key_ & 0x380) << 5) | (nextChar & 0x7f));
+ return nextChar;
+}