TurboRLE: include

trle_.h

@@ -0,0 +1,66 @@
+/**
+    Copyright (C) powturbo 2015-2019
+    GPL v2 License
+
+    This program 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 program 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 program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+    - email    : powturbo [AT] gmail.com
+    - github   : https://github.com/powturbo
+    - homepage : https://sites.google.com/site/powturbo/
+    - twitter  : https://twitter.com/powturbo
+
+    TurboRLE - "Most efficient and fastest Run Length Encoding"
+**/
+//------------------------- Variable Byte ( see https://github.com/powturbo/TurboPFor )-----------------------------------------------------
+#include "conf.h"
+#define TMIN 3
+
+#define VL_SIZE 32
+#define VL_MAX 0xff
+#define VL_B2 4
+#define VL_B3 3
+#define VL_BA3 (VL_MAX - (VL_SIZE/8 - 3))
+#define VL_BA2 (VL_BA3 - (1<<VL_B3))  
+
+#define VL_OFS1 (VL_BA2 - (1<<VL_B2))
+#define VL_OFS2 (VL_OFS1 + (1 << ( 8+VL_B2)))
+#define VL_OFS3 (VL_OFS2 + (1 << (16+VL_B3)))
+
+#define _vlput32(_op_, _x_, _act_) {\
+  if(likely((_x_) < VL_OFS1)){ *_op_++ = (_x_);																	 _act_;}\
+  else if  ((_x_) < VL_OFS2) { ctou16(_op_) = bswap16((VL_OFS1<<8)+((_x_)-VL_OFS1));             _op_  += 2;     _act_;}\
+  else if  ((_x_) < VL_OFS3) { *_op_++ = VL_BA2 + (((_x_) -= VL_OFS2) >> 16); ctou16(_op_) = (_x_); _op_  += 2;  _act_;}\
+  else { unsigned _b = (bsr32((_x_))+7)/8; *_op_++ = VL_BA3 + (_b - 3); ctou32(_op_) = (_x_); _op_  += _b; _act_;}\
+}
+
+#define _vlget32(_ip_, _x_, _act_) do { _x_ = *_ip_++;\
+       if(likely(_x_ < VL_OFS1)) { _act_ ;}\
+  else if(likely(_x_ < VL_BA2))  { _x_ = ((_x_<<8) + (*_ip_)) + (VL_OFS1 - (VL_OFS1 <<  8)); _ip_++; _act_;} \
+  else if(likely(_x_ < VL_BA3))  { _x_ = ctou16(_ip_) + ((_x_ - VL_BA2 ) << 16) + VL_OFS2; _ip_ += 2; _act_;}\
+  else { unsigned _b = _x_-VL_BA3; _x_ = ctou32(_ip_) & ((1u << 8 * _b << 24) - 1); _ip_ += 3 + _b; _act_;}\
+} while(0)
+
+#define vlput32(_op_, _x_) { register unsigned  _x = _x_; _vlput32(_op_, _x, ;); }
+#define vlget32(_ip_, _x_) _vlget32(_ip_, _x_, ;)
+
+#define vlzput(_op_, _x_, _m_, _rmap_) do { if(unlikely((_x_) < _m_)) *_op_++ = _rmap_[_x_]; else { unsigned _xi = (_x_) - _m_; *_op_++ = _rmap_[_m_]; vlput32(_op_, _xi); } } while(0)
+#define vlzget(_ip_, _x_, _m_, _e_) { _x_ = _e_; if(unlikely(_x_ == _m_)) { vlget32(_ip_,_x_ ); _x_+=_m_; } }
+
+#define BITS 8
+#define BIT_SET(  p, n) (p[(n)/BITS] |=  (0x80>>((n)%BITS)))
+#define BIT_CLEAR(p, n) (p[(n)/BITS] &= ~(0x80>>((n)%BITS)))
+#define BIT_ISSET(p, n) (p[(n)/BITS] &   (0x80>>((n)%BITS)))
+
+#define TRLEVER2