blob: c601dac5d76e804b2a9956e29a2607d6eda7ec2f [file] [log] [blame]
Eugene Klyuchnikov771eb102015-11-27 11:27:11 +01001/* Copyright 2013 Google Inc. All Rights Reserved.
2
Eugene Klyuchnikov24ffa782015-12-11 11:11:51 +01003 Distributed under MIT license.
Eugene Klyuchnikov771eb102015-11-27 11:27:11 +01004 See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
5*/
6
Eugene Kliuchnikov352b0b22016-06-03 11:19:23 +02007/* This class models a sequence of literals and a backward reference copy. */
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +02008
9#ifndef BROTLI_ENC_COMMAND_H_
10#define BROTLI_ENC_COMMAND_H_
11
Eugene Kliuchnikov02829182016-06-03 10:51:04 +020012#include "../common/types.h"
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010013#include "./fast_log.h"
Lode Vandevenne6511d6b2015-08-28 16:09:23 +020014#include "./prefix.h"
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +020015
16namespace brotli {
17
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010018static uint32_t kInsBase[] = { 0, 1, 2, 3, 4, 5, 6, 8, 10, 14, 18, 26, 34, 50,
19 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594 };
20static uint32_t kInsExtra[] = { 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4,
21 5, 5, 6, 7, 8, 9, 10, 12, 14, 24 };
22static uint32_t kCopyBase[] = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 18, 22, 30,
23 38, 54, 70, 102, 134, 198, 326, 582, 1094, 2118 };
24static uint32_t kCopyExtra[] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3,
25 4, 4, 5, 5, 6, 7, 8, 9, 10, 24 };
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010026
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010027static inline uint16_t GetInsertLengthCode(size_t insertlen) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010028 if (insertlen < 6) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010029 return static_cast<uint16_t>(insertlen);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010030 } else if (insertlen < 130) {
31 insertlen -= 2;
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010032 uint32_t nbits = Log2FloorNonZero(insertlen) - 1u;
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010033 return static_cast<uint16_t>((nbits << 1) + (insertlen >> nbits) + 2);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010034 } else if (insertlen < 2114) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010035 return static_cast<uint16_t>(Log2FloorNonZero(insertlen - 66) + 10);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010036 } else if (insertlen < 6210) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010037 return 21u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010038 } else if (insertlen < 22594) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010039 return 22u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010040 } else {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010041 return 23u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010042 }
43}
44
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010045static inline uint16_t GetCopyLengthCode(size_t copylen) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010046 if (copylen < 10) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010047 return static_cast<uint16_t>(copylen - 2);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010048 } else if (copylen < 134) {
49 copylen -= 6;
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010050 uint32_t nbits = Log2FloorNonZero(copylen) - 1u;
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010051 return static_cast<uint16_t>((nbits << 1) + (copylen >> nbits) + 4);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010052 } else if (copylen < 2118) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010053 return static_cast<uint16_t>(Log2FloorNonZero(copylen - 70) + 12);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010054 } else {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010055 return 23u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010056 }
57}
58
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010059static inline uint16_t CombineLengthCodes(
60 uint16_t inscode, uint16_t copycode, bool use_last_distance) {
61 uint16_t bits64 =
62 static_cast<uint16_t>((copycode & 0x7u) | ((inscode & 0x7u) << 3));
63 if (use_last_distance && inscode < 8 && copycode < 16) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010064 return (copycode < 8) ? bits64 : (bits64 | 64);
65 } else {
Eugene Kliuchnikov352b0b22016-06-03 11:19:23 +020066 /* "To convert an insert-and-copy length code to an insert length code and
67 a copy length code, the following table can be used" */
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010068 static const uint16_t cells[9] = { 128u, 192u, 384u, 256u, 320u, 512u,
69 448u, 576u, 640u };
70 return cells[(copycode >> 3) + 3 * (inscode >> 3)] | bits64;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010071 }
72}
73
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010074static inline void GetLengthCode(size_t insertlen, size_t copylen,
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010075 bool use_last_distance,
Zoltan Szabadkab820c392016-03-15 10:50:16 +010076 uint16_t* code) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010077 uint16_t inscode = GetInsertLengthCode(insertlen);
78 uint16_t copycode = GetCopyLengthCode(copylen);
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010079 *code = CombineLengthCodes(inscode, copycode, use_last_distance);
Zoltan Szabadkab820c392016-03-15 10:50:16 +010080}
81
82static inline uint32_t GetInsertBase(uint16_t inscode) {
83 return kInsBase[inscode];
84}
85
86static inline uint32_t GetInsertExtra(uint16_t inscode) {
87 return kInsExtra[inscode];
88}
89
90static inline uint32_t GetCopyBase(uint16_t copycode) {
91 return kCopyBase[copycode];
92}
93
94static inline uint32_t GetCopyExtra(uint16_t copycode) {
95 return kCopyExtra[copycode];
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010096}
97
98struct Command {
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +020099 // distance_code is e.g. 0 for same-as-last short code, or 16 for offset 1.
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100100 Command(size_t insertlen, size_t copylen, size_t copylen_code,
101 size_t distance_code)
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100102 : insert_len_(static_cast<uint32_t>(insertlen)) {
103 copy_len_ = static_cast<uint32_t>(
104 copylen | ((copylen_code ^ copylen) << 24));
Lode Vandevenne6511d6b2015-08-28 16:09:23 +0200105 // The distance prefix and extra bits are stored in this Command as if
106 // npostfix and ndirect were 0, they are only recomputed later after the
107 // clustering if needed.
108 PrefixEncodeCopyDistance(distance_code, 0, 0, &dist_prefix_, &dist_extra_);
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +0100109 GetLengthCode(insertlen, copylen_code, dist_prefix_ == 0,
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100110 &cmd_prefix_);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100111 }
112
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100113 explicit Command(size_t insertlen)
114 : insert_len_(static_cast<uint32_t>(insertlen))
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100115 , copy_len_(4 << 24), dist_extra_(0), dist_prefix_(16) {
116 GetLengthCode(insertlen, 4, dist_prefix_ == 0, &cmd_prefix_);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100117 }
118
Eugene Kliuchnikov25e37962016-02-29 14:41:24 +0100119 uint32_t DistanceCode(void) const {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100120 if (dist_prefix_ < 16) {
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +0200121 return dist_prefix_;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100122 }
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100123 uint32_t nbits = dist_extra_ >> 24;
124 uint32_t extra = dist_extra_ & 0xffffff;
125 uint32_t prefix = dist_prefix_ - 12 - 2 * nbits;
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +0200126 return (prefix << nbits) + extra + 12;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100127 }
128
Eugene Kliuchnikov25e37962016-02-29 14:41:24 +0100129 uint32_t DistanceContext(void) const {
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100130 uint32_t r = cmd_prefix_ >> 6;
131 uint32_t c = cmd_prefix_ & 7;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100132 if ((r == 0 || r == 2 || r == 4 || r == 7) && (c <= 2)) {
133 return c;
134 }
135 return 3;
136 }
137
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100138 inline uint32_t copy_len(void) const {
139 return copy_len_ & 0xFFFFFF;
140 }
141
142 inline uint32_t copy_len_code(void) const {
143 return (copy_len_ & 0xFFFFFF) ^ (copy_len_ >> 24);
144 }
145
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100146 uint32_t insert_len_;
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100147 /* Stores copy_len in low 24 bits and copy_len XOR copy_code in high 8 bit. */
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100148 uint32_t copy_len_;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100149 uint32_t dist_extra_;
Zoltan Szabadka14d6ae72016-01-26 11:25:53 +0100150 uint16_t cmd_prefix_;
151 uint16_t dist_prefix_;
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +0200152};
153
154} // namespace brotli
155
Eugene Kliuchnikov352b0b22016-06-03 11:19:23 +0200156#endif /* BROTLI_ENC_COMMAND_H_ */