Searched refs:max_code (Results 1 - 8 of 8) sorted by relevance

/haiku-fatelf/src/bin/gzip/
H A Dtrees.c204 int max_code; /* largest code with non zero frequency */ member in struct:tree_desc
297 local void gen_codes OF((ct_data near *tree, int max_code));
299 local void scan_tree OF((ct_data near *tree, int max_code));
300 local void send_tree OF((ct_data near *tree, int max_code));
489 int max_code = desc->max_code; local
513 if (n > max_code) continue; /* not a leaf node */
549 if (m > max_code) continue;
568 local void gen_codes (tree, max_code)
570 int max_code; /* larges
616 int max_code = -1; /* largest code with non zero frequency */ local
[all...]
/haiku-fatelf/src/bin/zip/
H A Dtrees.c257 int max_code; /* largest code with non zero frequency */ member in struct:tree_desc
423 local void gen_codes OF((ct_data near *tree, int max_code));
425 local void scan_tree OF((ct_data near *tree, int max_code));
426 local void send_tree OF((ct_data near *tree, int max_code));
636 int max_code = desc->max_code; local
660 if (n > max_code) continue; /* not a leaf node */
696 if (m > max_code) continue;
715 local void gen_codes (tree, max_code)
717 int max_code; /* larges
763 int max_code = -1; /* largest code with non zero frequency */ local
[all...]
/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Dtrees.c147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
497 int max_code = desc->max_code; local
523 if (n > max_code) continue; /* not a leaf node */
559 if (m > max_code) continue;
581 int max_code, /* largest code with non zero frequency */
600 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
579 gen_codes( ct_data *tree, int max_code, ushf *bl_count) argument
629 int max_code = -1; /* largest code with non zero frequency */ local
708 scan_tree( deflate_state *s, ct_data *tree, int max_code) argument
753 send_tree( deflate_state *s, ct_data *tree, int max_code) argument
[all...]
H A Ddeflate.h73 int max_code; /* largest code with non zero frequency */ member in struct:tree_desc_s
/haiku-fatelf/src/libs/zlib/
H A Dtrees.c147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
499 int max_code = desc->max_code; local
525 if (n > max_code) continue; /* not a leaf node */
561 if (m > max_code) continue;
581 local void gen_codes (tree, max_code, bl_count)
583 int max_code; /* largest code with non zero frequency */
602 Tracev((stderr,"\ngen_codes: max_code
631 int max_code = -1; /* largest code with non zero frequency */ local
[all...]
H A Ddeflate.h82 int max_code; /* largest code with non zero frequency */ member in struct:tree_desc_s
/haiku-fatelf/src/add-ons/translators/gif/
H A DGIFSave.h58 int BITS, max_code; member in class:GIFSave
H A DGIFSave.cpp235 if (next_code > max_code) {
243 max_code = (1 << BITS) - 1;
476 max_code = (1 << BITS) - 1;

Completed in 109 milliseconds