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