Lines Matching refs:bitlen
310 int makeFromLengths(const std::vector<unsigned long>& bitlen, unsigned long maxbitlen)
312 unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0;
315 for(unsigned long bits = 0; bits < numcodes; bits++) blcount[bitlen[bits]]++;
321 for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++;
324 for(unsigned long i = 0; i < bitlen[n]; i++) //the bits for this code
326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1;
330 if(i + 1 == bitlen[n])
385 std::vector<unsigned long> bitlen(288, 8), bitlenD(32, 5);;
386 for(size_t i = 144; i <= 255; i++) bitlen[i] = 9;
387 for(size_t i = 256; i <= 279; i++) bitlen[i] = 7;
388 tree.makeFromLengths(bitlen, 15);
412 std::vector<unsigned long> bitlen(288, 0), bitlenD(32, 0);
430 if(code <= 15) { if(i < HLIT) bitlen[i++] = code; else bitlenD[i++ - HLIT] = code; } //a length code
436 if((i - 1) < HLIT) value = bitlen[i - 1];
441 if(i < HLIT) bitlen[i++] = value; else bitlenD[i++ - HLIT] = value;
452 if(i < HLIT) bitlen[i++] = 0; else bitlenD[i++ - HLIT] = 0;
463 if(i < HLIT) bitlen[i++] = 0; else bitlenD[i++ - HLIT] = 0;
468 if(bitlen[256] == 0) { error = 64; return; } //the length of the end code 256 must be larger than 0
469 error = tree.makeFromLengths(bitlen, 15);
475 for(size_t i = 0; i < bitlen.size(); i++) zlibinfo->back().litlenlengths.push_back(bitlen[i]);
