Lines Matching full:bitlen_cl
950 unsigned* bitlen_cl = 0;
968 bitlen_cl = (unsigned*)lodepng_malloc(NUM_CODE_LENGTH_CODES * sizeof(unsigned));
969 if(!bitlen_cl) ERROR_BREAK(83 /*alloc fail*/);
973 if(i < HCLEN) bitlen_cl[CLCL_ORDER[i]] = readBitsFromStream(bp, in, 3);
974 else bitlen_cl[CLCL_ORDER[i]] = 0; /*if not, it must stay 0*/
977 error = HuffmanTree_makeFromLengths(&tree_cl, bitlen_cl, NUM_CODE_LENGTH_CODES, 7);
1077 lodepng_free(bitlen_cl);
1698 /*bitlen_cl is the code length code lengths ("clcl"). The bit lengths of codes to represent tree_cl
1701 uivector bitlen_cl;
1708 bitlen_cl is to bitlen_lld_e what bitlen_lld is to lz77_encoded.
1724 uivector_init(&bitlen_cl);
1834 if(!uivector_resize(&bitlen_cl, tree_cl.numcodes)) ERROR_BREAK(83 /*alloc fail*/);
1838 bitlen_cl.data[i] = HuffmanTree_getLength(&tree_cl, CLCL_ORDER[i]);
1840 while(bitlen_cl.data[bitlen_cl.size - 1] == 0 && bitlen_cl.size > 4)
1843 if(!uivector_resize(&bitlen_cl, bitlen_cl.size - 1)) ERROR_BREAK(83 /*alloc fail*/);
1869 HCLEN = (unsigned)bitlen_cl.size - 4;
1871 while(!bitlen_cl.data[HCLEN + 4 - 1] && HCLEN > 0) HCLEN--;
1877 for(i = 0; i < HCLEN + 4; i++) addBitsToStream(bp, out, bitlen_cl.data[i], 3);
1911 uivector_cleanup(&bitlen_cl);
