HomeSort by relevance Sort by last modified time
    Searched refs:htrees (Results 1 - 5 of 5) sorted by null

  /external/brotli/dec/
state.c 78 s->literal_hgroup.htrees = NULL;
80 s->insert_copy_hgroup.htrees = NULL;
82 s->distance_hgroup.htrees = NULL;
129 s->literal_hgroup.htrees = NULL;
131 s->insert_copy_hgroup.htrees = NULL;
133 s->distance_hgroup.htrees = NULL;
140 BROTLI_FREE(s, s->literal_hgroup.htrees);
141 BROTLI_FREE(s, s->insert_copy_hgroup.htrees);
142 BROTLI_FREE(s, s->distance_hgroup.htrees);
162 group->htrees = p
    [all...]
huffman.h 58 HuffmanCode** htrees; member in struct:__anon13463
decode.c 907 group->htrees[s->htree_index] = s->next;
    [all...]
  /external/webp/src/utils/
huffman_utils.h 58 HuffmanCode* htrees[HUFFMAN_CODES_PER_META_CODE]; member in struct:HTreeGroup
  /external/webp/src/dec/
vp8l_dec.c 232 HuffmanCode hcode = htree_group->htrees[GREEN][bits];
240 bits >>= AccumulateHCode(htree_group->htrees[RED][bits], 16, huff);
241 bits >>= AccumulateHCode(htree_group->htrees[BLUE][bits], 0, huff);
242 bits >>= AccumulateHCode(htree_group->htrees[ALPHA][bits], 24, huff);
420 HuffmanCode** const htrees = htree_group->htrees; local
427 htrees[j] = next;
454 const int red = htrees[RED][0].value;
455 const int blue = htrees[BLUE][0].value;
456 const int alpha = htrees[ALPHA][0].value
778 HuffmanCode** const htrees = hdr->htree_groups_[i].htrees; local
    [all...]

Completed in 103 milliseconds