blob: 031be59b761c94fe3366e5156cff3b01e36a3767 [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
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +02007// This class models a sequence of literals and a backward reference copy.
8
9#ifndef BROTLI_ENC_COMMAND_H_
10#define BROTLI_ENC_COMMAND_H_
11
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010012#include "./fast_log.h"
Lode Vandevenne6511d6b2015-08-28 16:09:23 +020013#include "./prefix.h"
Zoltan Szabadka4a7024d2015-10-01 12:08:14 +020014#include "./types.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 {
66 // "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 Szabadkab4f39bf2014-10-28 13:25:22 +010076 uint16_t* code, uint64_t* extra) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010077 uint16_t inscode = GetInsertLengthCode(insertlen);
78 uint16_t copycode = GetCopyLengthCode(copylen);
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010079 uint64_t insnumextra = kInsExtra[inscode];
80 uint64_t numextra = insnumextra + kCopyExtra[copycode];
81 uint64_t insextraval = insertlen - kInsBase[inscode];
82 uint64_t copyextraval = copylen - kCopyBase[copycode];
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010083 *code = CombineLengthCodes(inscode, copycode, use_last_distance);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010084 *extra = (numextra << 48) | (copyextraval << insnumextra) | insextraval;
85}
86
87struct Command {
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +020088 // distance_code is e.g. 0 for same-as-last short code, or 16 for offset 1.
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010089 Command(size_t insertlen, size_t copylen, size_t copylen_code,
90 size_t distance_code)
91 : insert_len_(static_cast<uint32_t>(insertlen))
92 , copy_len_(static_cast<uint32_t>(copylen)) {
Lode Vandevenne6511d6b2015-08-28 16:09:23 +020093 // The distance prefix and extra bits are stored in this Command as if
94 // npostfix and ndirect were 0, they are only recomputed later after the
95 // clustering if needed.
96 PrefixEncodeCopyDistance(distance_code, 0, 0, &dist_prefix_, &dist_extra_);
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010097 GetLengthCode(insertlen, copylen_code, dist_prefix_ == 0,
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010098 &cmd_prefix_, &cmd_extra_);
99 }
100
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100101 explicit Command(size_t insertlen)
102 : insert_len_(static_cast<uint32_t>(insertlen))
Zoltan Szabadka14d6ae72016-01-26 11:25:53 +0100103 , copy_len_(0), dist_extra_(0), dist_prefix_(16) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +0100104 GetLengthCode(insertlen, 4, dist_prefix_ == 0, &cmd_prefix_, &cmd_extra_);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100105 }
106
Eugene Kliuchnikov25e37962016-02-29 14:41:24 +0100107 uint32_t DistanceCode(void) const {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100108 if (dist_prefix_ < 16) {
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +0200109 return dist_prefix_;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100110 }
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100111 uint32_t nbits = dist_extra_ >> 24;
112 uint32_t extra = dist_extra_ & 0xffffff;
113 uint32_t prefix = dist_prefix_ - 12 - 2 * nbits;
Zoltan Szabadka12eb9bf2015-05-07 17:40:00 +0200114 return (prefix << nbits) + extra + 12;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100115 }
116
Eugene Kliuchnikov25e37962016-02-29 14:41:24 +0100117 uint32_t DistanceContext(void) const {
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100118 uint32_t r = cmd_prefix_ >> 6;
119 uint32_t c = cmd_prefix_ & 7;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100120 if ((r == 0 || r == 2 || r == 4 || r == 7) && (c <= 2)) {
121 return c;
122 }
123 return 3;
124 }
125
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100126 uint32_t insert_len_;
127 uint32_t copy_len_;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100128 uint64_t cmd_extra_;
129 uint32_t dist_extra_;
Zoltan Szabadka14d6ae72016-01-26 11:25:53 +0100130 uint16_t cmd_prefix_;
131 uint16_t dist_prefix_;
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +0200132};
133
134} // namespace brotli
135
136#endif // BROTLI_ENC_COMMAND_H_