Платформа ЦРНП "Мирокод" для разработки проектов
https://git.mirocod.ru
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
93 lines
2.9 KiB
93 lines
2.9 KiB
package brotli |
|
|
|
/* Copyright 2018 Google Inc. All Rights Reserved. |
|
|
|
Distributed under MIT license. |
|
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT |
|
*/ |
|
|
|
func (h *hashComposite) HashTypeLength() uint { |
|
var a uint = h.ha.HashTypeLength() |
|
var b uint = h.hb.HashTypeLength() |
|
if a > b { |
|
return a |
|
} else { |
|
return b |
|
} |
|
} |
|
|
|
func (h *hashComposite) StoreLookahead() uint { |
|
var a uint = h.ha.StoreLookahead() |
|
var b uint = h.hb.StoreLookahead() |
|
if a > b { |
|
return a |
|
} else { |
|
return b |
|
} |
|
} |
|
|
|
/* Composite hasher: This hasher allows to combine two other hashers, HASHER_A |
|
and HASHER_B. */ |
|
type hashComposite struct { |
|
hasherCommon |
|
ha hasherHandle |
|
hb hasherHandle |
|
params *encoderParams |
|
} |
|
|
|
func (h *hashComposite) Initialize(params *encoderParams) { |
|
h.params = params |
|
} |
|
|
|
/* TODO: Initialize of the hashers is defered to Prepare (and params |
|
remembered here) because we don't get the one_shot and input_size params |
|
here that are needed to know the memory size of them. Instead provide |
|
those params to all hashers InitializehashComposite */ |
|
func (h *hashComposite) Prepare(one_shot bool, input_size uint, data []byte) { |
|
if h.ha == nil { |
|
var common_a *hasherCommon |
|
var common_b *hasherCommon |
|
|
|
common_a = h.ha.Common() |
|
common_a.params = h.params.hasher |
|
common_a.is_prepared_ = false |
|
common_a.dict_num_lookups = 0 |
|
common_a.dict_num_matches = 0 |
|
h.ha.Initialize(h.params) |
|
|
|
common_b = h.hb.Common() |
|
common_b.params = h.params.hasher |
|
common_b.is_prepared_ = false |
|
common_b.dict_num_lookups = 0 |
|
common_b.dict_num_matches = 0 |
|
h.hb.Initialize(h.params) |
|
} |
|
|
|
h.ha.Prepare(one_shot, input_size, data) |
|
h.hb.Prepare(one_shot, input_size, data) |
|
} |
|
|
|
func (h *hashComposite) Store(data []byte, mask uint, ix uint) { |
|
h.ha.Store(data, mask, ix) |
|
h.hb.Store(data, mask, ix) |
|
} |
|
|
|
func (h *hashComposite) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) { |
|
h.ha.StoreRange(data, mask, ix_start, ix_end) |
|
h.hb.StoreRange(data, mask, ix_start, ix_end) |
|
} |
|
|
|
func (h *hashComposite) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ring_buffer_mask uint) { |
|
h.ha.StitchToPreviousBlock(num_bytes, position, ringbuffer, ring_buffer_mask) |
|
h.hb.StitchToPreviousBlock(num_bytes, position, ringbuffer, ring_buffer_mask) |
|
} |
|
|
|
func (h *hashComposite) PrepareDistanceCache(distance_cache []int) { |
|
h.ha.PrepareDistanceCache(distance_cache) |
|
h.hb.PrepareDistanceCache(distance_cache) |
|
} |
|
|
|
func (h *hashComposite) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) { |
|
h.ha.FindLongestMatch(dictionary, data, ring_buffer_mask, distance_cache, cur_ix, max_length, max_backward, gap, max_distance, out) |
|
h.hb.FindLongestMatch(dictionary, data, ring_buffer_mask, distance_cache, cur_ix, max_length, max_backward, gap, max_distance, out) |
|
}
|
|
|