mirror of
https://github.com/google/brotli.git
synced 2024-11-22 11:40:06 +00:00
b4f39bf540
The new interface of the backward reference search function makes it possible to use it in a streaming manner. Using the advanced cost model and static dictionary can be turned on/off by template parameters. The distance short codes are now computed as part of the backward reference search. Added a faster version of the Hasher.
47 lines
1.7 KiB
C++
47 lines
1.7 KiB
C++
// Copyright 2013 Google Inc. All Rights Reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
//
|
|
// Function to find backward reference copies.
|
|
|
|
#ifndef BROTLI_ENC_BACKWARD_REFERENCES_H_
|
|
#define BROTLI_ENC_BACKWARD_REFERENCES_H_
|
|
|
|
#include <stdint.h>
|
|
#include <vector>
|
|
|
|
#include "./hash.h"
|
|
#include "./command.h"
|
|
|
|
namespace brotli {
|
|
|
|
void CreateBackwardReferences(size_t num_bytes,
|
|
size_t position,
|
|
const uint8_t* ringbuffer,
|
|
size_t ringbuffer_mask,
|
|
const float* literal_cost,
|
|
size_t literal_cost_mask,
|
|
const size_t max_backward_limit,
|
|
const double base_min_score,
|
|
const int quality,
|
|
Hashers* hashers,
|
|
int hash_type,
|
|
int* dist_cache,
|
|
int* last_insert_len,
|
|
Command* commands,
|
|
int* num_commands);
|
|
|
|
} // namespace brotli
|
|
|
|
#endif // BROTLI_ENC_BACKWARD_REFERENCES_H_
|