public static void UpdateZopfliNode(global::encode.backward_references.ZopfliNode[] nodes, int nodes_off, int pos, int start_pos, int len, int len_code, int dist, int dist_code, int max_dist, int[] dist_cache, double cost)
 {
     global::encode.backward_references.ZopfliNode next = ((global::encode.backward_references.ZopfliNode)(((global::encode.backward_references.ZopfliNode[])(nodes))[((nodes_off + pos) + len)]));
     next.length        = len;
     next.length_code   = len_code;
     next.distance      = dist;
     next.distance_code = dist_code;
     next.insert_length = (pos - start_pos);
     next.cost          = cost;
     global::encode.Backward_references.SetDistanceCache(dist, dist_code, max_dist, dist_cache, next.distance_cache, 0);
 }
Beispiel #2
0
 public static void __hx_ctor_encode_backward_references_ZopfliNode(global::encode.backward_references.ZopfliNode __hx_this)
 {
     unchecked {
         __hx_this.distance_cache = global::FunctionMalloc.mallocInt(4);
         __hx_this.length         = 1;
         __hx_this.distance       = 0;
         __hx_this.distance_code  = 0;
         __hx_this.length_code    = 0;
         __hx_this.insert_length  = 0;
         __hx_this.cost           = global::encode.Backward_references.kInfinity;
     }
 }
        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);
            }
        }