blob: d4a301967e41c3993d03b93aeebdcf4bdbc7b7af [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 Kliuchnikov0a63f992016-09-21 17:20:36 +020012#include "../common/constants.h"
13#include <brotli/port.h>
Eugene Kliuchnikov81480012016-08-23 14:40:33 +020014#include <brotli/types.h>
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010015#include "./fast_log.h"
Lode Vandevenne6511d6b2015-08-28 16:09:23 +020016#include "./prefix.h"
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +020017
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020018#if defined(__cplusplus) || defined(c_plusplus)
19extern "C" {
20#endif
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +020021
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +010022static uint32_t kInsBase[] = { 0, 1, 2, 3, 4, 5, 6, 8, 10, 14, 18, 26, 34, 50,
23 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594 };
24static uint32_t kInsExtra[] = { 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4,
25 5, 5, 6, 7, 8, 9, 10, 12, 14, 24 };
26static uint32_t kCopyBase[] = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 18, 22, 30,
27 38, 54, 70, 102, 134, 198, 326, 582, 1094, 2118 };
28static uint32_t kCopyExtra[] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3,
29 4, 4, 5, 5, 6, 7, 8, 9, 10, 24 };
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010030
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020031static BROTLI_INLINE uint16_t GetInsertLengthCode(size_t insertlen) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010032 if (insertlen < 6) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020033 return (uint16_t)insertlen;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010034 } else if (insertlen < 130) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020035 uint32_t nbits = Log2FloorNonZero(insertlen - 2) - 1u;
36 return (uint16_t)((nbits << 1) + ((insertlen - 2) >> nbits) + 2);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010037 } else if (insertlen < 2114) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020038 return (uint16_t)(Log2FloorNonZero(insertlen - 66) + 10);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010039 } else if (insertlen < 6210) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010040 return 21u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010041 } else if (insertlen < 22594) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010042 return 22u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010043 } else {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010044 return 23u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010045 }
46}
47
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020048static BROTLI_INLINE uint16_t GetCopyLengthCode(size_t copylen) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010049 if (copylen < 10) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020050 return (uint16_t)(copylen - 2);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010051 } else if (copylen < 134) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020052 uint32_t nbits = Log2FloorNonZero(copylen - 6) - 1u;
53 return (uint16_t)((nbits << 1) + ((copylen - 6) >> nbits) + 4);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010054 } else if (copylen < 2118) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020055 return (uint16_t)(Log2FloorNonZero(copylen - 70) + 12);
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010056 } else {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010057 return 23u;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010058 }
59}
60
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020061static BROTLI_INLINE uint16_t CombineLengthCodes(
Eugene Kliuchnikov20481892016-07-26 14:41:59 +020062 uint16_t inscode, uint16_t copycode, BROTLI_BOOL use_last_distance) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010063 uint16_t bits64 =
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020064 (uint16_t)((copycode & 0x7u) | ((inscode & 0x7u) << 3));
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010065 if (use_last_distance && inscode < 8 && copycode < 16) {
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010066 return (copycode < 8) ? bits64 : (bits64 | 64);
67 } else {
Eugene Kliuchnikov352b0b22016-06-03 11:19:23 +020068 /* "To convert an insert-and-copy length code to an insert length code and
69 a copy length code, the following table can be used" */
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010070 static const uint16_t cells[9] = { 128u, 192u, 384u, 256u, 320u, 512u,
71 448u, 576u, 640u };
72 return cells[(copycode >> 3) + 3 * (inscode >> 3)] | bits64;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010073 }
74}
75
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020076static BROTLI_INLINE void GetLengthCode(size_t insertlen, size_t copylen,
Eugene Kliuchnikov20481892016-07-26 14:41:59 +020077 BROTLI_BOOL use_last_distance,
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020078 uint16_t* code) {
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010079 uint16_t inscode = GetInsertLengthCode(insertlen);
80 uint16_t copycode = GetCopyLengthCode(copylen);
Zoltan Szabadkaea48ce52015-10-28 17:44:47 +010081 *code = CombineLengthCodes(inscode, copycode, use_last_distance);
Zoltan Szabadkab820c392016-03-15 10:50:16 +010082}
83
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020084static BROTLI_INLINE uint32_t GetInsertBase(uint16_t inscode) {
Zoltan Szabadkab820c392016-03-15 10:50:16 +010085 return kInsBase[inscode];
86}
87
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020088static BROTLI_INLINE uint32_t GetInsertExtra(uint16_t inscode) {
Zoltan Szabadkab820c392016-03-15 10:50:16 +010089 return kInsExtra[inscode];
90}
91
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020092static BROTLI_INLINE uint32_t GetCopyBase(uint16_t copycode) {
Zoltan Szabadkab820c392016-03-15 10:50:16 +010093 return kCopyBase[copycode];
94}
95
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +020096static BROTLI_INLINE uint32_t GetCopyExtra(uint16_t copycode) {
Zoltan Szabadkab820c392016-03-15 10:50:16 +010097 return kCopyExtra[copycode];
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +010098}
99
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200100typedef struct Command {
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100101 uint32_t insert_len_;
Zoltan Szabadkab820c392016-03-15 10:50:16 +0100102 /* Stores copy_len in low 24 bits and copy_len XOR copy_code in high 8 bit. */
Zoltan Szabadka8844b7f2016-01-07 16:27:49 +0100103 uint32_t copy_len_;
Zoltan Szabadkab4f39bf2014-10-28 13:25:22 +0100104 uint32_t dist_extra_;
Zoltan Szabadka14d6ae72016-01-26 11:25:53 +0100105 uint16_t cmd_prefix_;
106 uint16_t dist_prefix_;
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200107} Command;
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +0200108
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200109/* distance_code is e.g. 0 for same-as-last short code, or 16 for offset 1. */
110static BROTLI_INLINE void InitCommand(Command* self, size_t insertlen,
111 size_t copylen, size_t copylen_code, size_t distance_code) {
112 self->insert_len_ = (uint32_t)insertlen;
113 self->copy_len_ = (uint32_t)(copylen | ((copylen_code ^ copylen) << 24));
114 /* The distance prefix and extra bits are stored in this Command as if
115 npostfix and ndirect were 0, they are only recomputed later after the
116 clustering if needed. */
117 PrefixEncodeCopyDistance(
118 distance_code, 0, 0, &self->dist_prefix_, &self->dist_extra_);
119 GetLengthCode(
Eugene Kliuchnikov20481892016-07-26 14:41:59 +0200120 insertlen, copylen_code, TO_BROTLI_BOOL(self->dist_prefix_ == 0),
121 &self->cmd_prefix_);
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200122}
123
124static BROTLI_INLINE void InitInsertCommand(Command* self, size_t insertlen) {
125 self->insert_len_ = (uint32_t)insertlen;
126 self->copy_len_ = 4 << 24;
127 self->dist_extra_ = 0;
Eugene Kliuchnikov0a63f992016-09-21 17:20:36 +0200128 self->dist_prefix_ = BROTLI_NUM_DISTANCE_SHORT_CODES;
Eugene Kliuchnikov20481892016-07-26 14:41:59 +0200129 GetLengthCode(insertlen, 4, BROTLI_FALSE, &self->cmd_prefix_);
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200130}
131
Eugene Kliuchnikov0a63f992016-09-21 17:20:36 +0200132static BROTLI_INLINE uint32_t CommandRestoreDistanceCode(const Command* self) {
133 if (self->dist_prefix_ < BROTLI_NUM_DISTANCE_SHORT_CODES) {
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200134 return self->dist_prefix_;
135 } else {
136 uint32_t nbits = self->dist_extra_ >> 24;
137 uint32_t extra = self->dist_extra_ & 0xffffff;
Eugene Kliuchnikov0a63f992016-09-21 17:20:36 +0200138 /* It is assumed that the distance was first encoded with NPOSTFIX = 0 and
139 NDIRECT = 0, so the code itself is of this form:
140 BROTLI_NUM_DISTANCE_SHORT_CODES + 2 * (nbits - 1) + prefix_bit
141 Therefore, the following expression results in (2 + prefix_bit). */
142 uint32_t prefix =
143 self->dist_prefix_ + 4u - BROTLI_NUM_DISTANCE_SHORT_CODES - 2u * nbits;
144 /* Subtract 4 for offset (Chapter 4.) and
145 increase by BROTLI_NUM_DISTANCE_SHORT_CODES - 1 */
146 return (prefix << nbits) + extra + BROTLI_NUM_DISTANCE_SHORT_CODES - 4u;
Eugene Kliuchnikovb972c672016-06-13 11:01:04 +0200147 }
148}
149
150static BROTLI_INLINE uint32_t CommandDistanceContext(const Command* self) {
151 uint32_t r = self->cmd_prefix_ >> 6;
152 uint32_t c = self->cmd_prefix_ & 7;
153 if ((r == 0 || r == 2 || r == 4 || r == 7) && (c <= 2)) {
154 return c;
155 }
156 return 3;
157}
158
159static BROTLI_INLINE uint32_t CommandCopyLen(const Command* self) {
160 return self->copy_len_ & 0xFFFFFF;
161}
162
163static BROTLI_INLINE uint32_t CommandCopyLenCode(const Command* self) {
164 return (self->copy_len_ & 0xFFFFFF) ^ (self->copy_len_ >> 24);
165}
166
167#if defined(__cplusplus) || defined(c_plusplus)
168} /* extern "C" */
169#endif
Zoltan Szabadkac66e4e32013-10-23 13:06:13 +0200170
Eugene Kliuchnikov352b0b22016-06-03 11:19:23 +0200171#endif /* BROTLI_ENC_COMMAND_H_ */