public static void CreateBackwardReferences_HashLongestMatchQuickly(int num_bytes, int position, uint[] ringbuffer, int ringbuffer_mask, int max_backward_limit, int quality, global::encode.hash.HashLongestMatchQuickly hasher, int[] dist_cache, global::Array <int> last_insert_len, global::Array <object> commands, int commands_off, global::Array <int> num_commands, global::Array <int> num_literals)
{
unchecked {
if (((num_bytes >= 3) && (position >= 3)))
{
hasher.Store(ringbuffer, ((position - 3) & ringbuffer_mask), (position - 3));
hasher.Store(ringbuffer, ((position - 2) & ringbuffer_mask), (position - 2));
hasher.Store(ringbuffer, ((position - 1) & ringbuffer_mask), (position - 1));
}
int orig_commands_off = commands_off;
int insert_length = last_insert_len[0];
int i = (position & ringbuffer_mask);
int i_diff = (position - i);
int i_end = (i + num_bytes);
int random_heuristics_window_size = (((quality < 9)) ? (64) : (512));
int apply_random_heuristics = (i + random_heuristics_window_size);
while (((i + 3) < i_end))
{
int max_length = (i_end - i);
int max_distance = ((int)(global::System.Math.Min(((double)((i + i_diff))), ((double)(max_backward_limit)))));
global::Array <int> best_len = new global::Array <int>(new int[] { 0 });
global::Array <int> best_len_code = new global::Array <int>(new int[] { 0 });
global::Array <int> best_dist = new global::Array <int>(new int[] { 0 });
global::Array <double> best_score = new global::Array <double>(new double[] { 4.0 });
bool match_found = hasher.FindLongestMatch(ringbuffer, ringbuffer_mask, dist_cache, (i + i_diff), max_length, max_distance, best_len, best_len_code, best_dist, best_score);
if (match_found)
{
int delayed_backward_references_in_row = 0;
while (true)
{
--max_length;
global::Array <int> best_len_2 = new global::Array <int>(new int[] { (((quality < 5)) ? (((int)(global::System.Math.Min(((double)((best_len[0] - 1))), ((double)(max_length)))))) : (0)) });
global::Array <int> best_len_code_2 = new global::Array <int>(new int[] { 0 });
global::Array <int> best_dist_2 = new global::Array <int>(new int[] { 0 });
global::Array <double> best_score_2 = new global::Array <double>(new double[] { 4.0 });
max_distance = ((int)(global::System.Math.Min(((double)(((i + i_diff) + 1))), ((double)(max_backward_limit)))));
hasher.Store(ringbuffer, i, (i + i_diff));
match_found = hasher.FindLongestMatch(ringbuffer, ringbuffer_mask, dist_cache, ((i + i_diff) + 1), max_length, max_distance, best_len_2, best_len_code_2, best_dist_2, best_score_2);
if ((match_found && (best_score_2[0] >= (best_score[0] + 7.0))))
{
++i;
++insert_length;
best_len[0] = best_len_2[0];
best_len_code[0] = best_len_code_2[0];
best_dist[0] = best_dist_2[0];
best_score[0] = best_score_2[0];
if ((++delayed_backward_references_in_row < 4))
{
continue;
}
}
break;
}
apply_random_heuristics = ((i + (2 * best_len[0])) + random_heuristics_window_size);
max_distance = ((int)(global::System.Math.Min(((double)((i + i_diff))), ((double)(max_backward_limit)))));
int distance_code = global::encode.Backward_references.ComputeDistanceCode(best_dist[0], max_distance, quality, dist_cache);
if (((best_dist[0] <= max_distance) && (distance_code > 0)))
{
((int[])(dist_cache))[3] = ((int)(((int[])(dist_cache))[2]));
((int[])(dist_cache))[2] = ((int)(((int[])(dist_cache))[1]));
((int[])(dist_cache))[1] = ((int)(((int[])(dist_cache))[0]));
((int[])(dist_cache))[0] = best_dist[0];
}
global::encode.command.Command command = new global::encode.command.Command();
command.Command4(insert_length, best_len[0], best_len_code[0], distance_code);
commands[commands_off++] = command;
num_literals[0] += insert_length;
insert_length = 0;
{
int _g1 = 1;
int _g = best_len[0];
while ((_g1 < _g))
{
int j = _g1++;
hasher.Store(ringbuffer, (i + j), ((i + i_diff) + j));
}
}
i += best_len[0];
}
else
{
++insert_length;
hasher.Store(ringbuffer, i, (i + i_diff));
++i;
if ((i > apply_random_heuristics))
{
if ((i > (apply_random_heuristics + (4 * random_heuristics_window_size))))
{
int i_jump = ((int)(global::System.Math.Min(((double)((i + 16))), ((double)((i_end - 4))))));
while ((i < i_jump))
{
hasher.Store(ringbuffer, i, (i + i_diff));
insert_length += 4;
i += 4;
}
}
else
{
int i_jump1 = ((int)(global::System.Math.Min(((double)((i + 8))), ((double)((i_end - 3))))));
while ((i < i_jump1))
{
hasher.Store(ringbuffer, i, (i + i_diff));
insert_length += 2;
i += 2;
}
}
}
}
}
insert_length += (i_end - i);
last_insert_len[0] = insert_length;
num_commands[0] += (commands_off - orig_commands_off);
}
}
public static void ZopfliIterate(int num_bytes, int position, uint[] ringbuffer, int ringbuffer_mask, int max_backward_limit, global::encode.backward_references.ZopfliCostModel model, int[] num_matches, global::Array <object> matches, int[] dist_cache, global::Array <int> last_insert_len, global::Array <object> commands, int commands_off, global::Array <int> num_commands, global::Array <int> num_literals)
{
unchecked {
int orig_commands_off = commands_off;
global::encode.backward_references.ZopfliNode[] nodes = global::FunctionMalloc.malloc_encode_backward_references_ZopfliNode(typeof(global::encode.backward_references.ZopfliNode), (num_bytes + 1));
((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[0])).length = 0;
((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[0])).cost = ((double)(0));
global::DefaultFunctions.memcpy_Int(((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[0])).distance_cache, 0, dist_cache, 0, 4);
global::encode.backward_references.StartPosQueue queue = new global::encode.backward_references.StartPosQueue(((int)(3)));
double min_cost_cmd = model.GetMinCostCmd();
int cur_match_pos = 0;
int i = 0;
while (((i + 3) < num_bytes))
{
int cur_ix = (position + i);
int cur_ix_masked = (cur_ix & ringbuffer_mask);
int max_distance = ((int)(global::System.Math.Min(((double)(cur_ix)), ((double)(max_backward_limit)))));
int max_length = (num_bytes - i);
queue.Push(i, (((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[i])).cost - model.GetLiteralCosts(0, i)));
int min_len = global::encode.Backward_references.ComputeMinimumCopyLength(queue, nodes, model, i, min_cost_cmd);
int k = 0;
while (((k < 5) && (k < queue.size())))
{
int start = queue.GetStartPos(k);
double start_costdiff = (((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[start])).cost - model.GetLiteralCosts(0, start));
int[] dist_cache2 = ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[start])).distance_cache;
int best_len = (min_len - 1);
{
int _g = 0;
while ((_g < 16))
{
int j = _g++;
int backward = (((int)(((int[])(dist_cache2))[global::encode.Hash.kDistanceCacheIndex[j]])) + global::encode.Hash.kDistanceCacheOffset[j]);
int prev_ix = (cur_ix - backward);
if ((prev_ix >= cur_ix))
{
continue;
}
if ((backward > max_distance))
{
continue;
}
prev_ix &= ringbuffer_mask;
if (((((cur_ix_masked + best_len) > ringbuffer_mask) || ((prev_ix + best_len) > ringbuffer_mask)) || ((bool)((((uint)(((uint[])(ringbuffer))[(cur_ix_masked + best_len)])) != ((uint)(((uint[])(ringbuffer))[(prev_ix + best_len)])))))))
{
continue;
}
{
int _g2 = (best_len + 1);
int _g1 = (global::encode.Find_match_length.FindMatchLengthWithLimit(ringbuffer, prev_ix, ringbuffer, cur_ix_masked, max_length) + 1);
while ((_g2 < _g1))
{
int l = _g2++;
double cost = ((start_costdiff + model.GetCommandCost(j, l, (i - start))) + model.GetLiteralCosts(0, i));
if ((cost < ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[(i + l)])).cost))
{
global::encode.Backward_references.UpdateZopfliNode(nodes, 0, i, start, l, l, backward, j, max_distance, dist_cache2, cost);
}
best_len = l;
}
}
}
}
if ((k >= 2))
{
++k;
continue;
}
int len = min_len;
{
int _g11 = 0;
int _g3 = ((int)(((int[])(num_matches))[i]));
while ((_g11 < _g3))
{
global::encode.hash.BackwardMatch match = ((global::encode.hash.BackwardMatch)(matches[(cur_match_pos + _g11++)]));
int dist = match.distance;
bool is_dictionary_match = (dist > max_distance);
int dist_code = (dist + 15);
int max_len = match.length();
if (((len < max_len) && ((is_dictionary_match || (max_len > 325)))))
{
len = max_len;
}
while ((len <= max_len))
{
int len_code = ((is_dictionary_match) ? (match.length_code()) : (len));
double cost1 = ((start_costdiff + model.GetCommandCost(dist_code, len_code, (i - start))) + model.GetLiteralCosts(0, i));
if ((cost1 < ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[(i + len)])).cost))
{
global::encode.Backward_references.UpdateZopfliNode(nodes, 0, i, start, len, len_code, dist, dist_code, max_distance, dist_cache2, cost1);
}
++len;
}
}
}
++k;
}
cur_match_pos += ((int)(((int[])(num_matches))[i]));
if (((((int)(((int[])(num_matches))[i])) == 1) && (((global::encode.hash.BackwardMatch)(matches[(cur_match_pos - 1)])).length() > 325)))
{
i += (((global::encode.hash.BackwardMatch)(matches[(cur_match_pos - 1)])).length() - 1);
queue.Clear();
}
++i;
}
global::Array <int> backwards = new global::Array <int>();
int index = num_bytes;
while ((((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[index])).cost == global::encode.Backward_references.kInfinity))
{
--index;
}
while ((index > 0))
{
int len1 = (((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[index])).length + ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[index])).insert_length);
backwards.push(len1);
index -= len1;
}
global::Array <int> path = new global::Array <int>();
int i1 = backwards.length;
while ((i1 > 0))
{
path.push(backwards[(i1 - 1)]);
--i1;
}
int pos = 0;
{
int _g12 = 0;
int _g4 = path.length;
while ((_g12 < _g4))
{
int i2 = _g12++;
global::encode.backward_references.ZopfliNode next = ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[(pos + path[i2])]));
int copy_length = next.length;
int insert_length = next.insert_length;
pos += insert_length;
if ((i2 == 0))
{
insert_length += last_insert_len[0];
}
int distance = next.distance;
int len_code1 = next.length_code;
bool is_dictionary = (distance > ((int)(global::System.Math.Min(((double)((position + pos))), ((double)(max_backward_limit))))));
int dist_code1 = next.distance_code;
global::encode.command.Command command = new global::encode.command.Command();
command.Command4(insert_length, copy_length, len_code1, dist_code1);
commands[commands_off++] = command;
if ((!(is_dictionary) && (dist_code1 > 0)))
{
((int[])(dist_cache))[3] = ((int)(((int[])(dist_cache))[2]));
((int[])(dist_cache))[2] = ((int)(((int[])(dist_cache))[1]));
((int[])(dist_cache))[1] = ((int)(((int[])(dist_cache))[0]));
((int[])(dist_cache))[0] = distance;
}
num_literals[0] += insert_length;
insert_length = 0;
pos += copy_length;
}
}
last_insert_len[0] = (num_bytes - pos);
num_commands[0] += (commands_off - orig_commands_off);
}
}
