113    Int32 nNodes, nHeap, n1, n2, i, j, k;  in BZ2_hbMakeCodeLengths()  local
120    for (i = 0; i < alphaSize; i++)  in BZ2_hbMakeCodeLengths()
121       weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;  in BZ2_hbMakeCodeLengths()
132       for (i = 1; i <= alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
133 	 parent[i] = -1;  in BZ2_hbMakeCodeLengths()
135 	 heap[nHeap] = i;  in BZ2_hbMakeCodeLengths()
156       for (i = 1; i <= alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
158 	 k = i;  in BZ2_hbMakeCodeLengths()
160 	 len[i-1] = j;  in BZ2_hbMakeCodeLengths()
166       for (i = 1; i < alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
167 	 j = weight[i] >> 8;  in BZ2_hbMakeCodeLengths()
169 	 weight[i] = j << 8;  in BZ2_hbMakeCodeLengths()
182    Int32 n, vec, i;  in BZ2_hbAssignCodes()  local
186       for (i = 0; i < alphaSize; i++)  in BZ2_hbAssignCodes()
187 	 if (length[i] == n) { code[i] = vec; vec++; };  in BZ2_hbAssignCodes()
202    Int32 pp, i, j, vec;  in BZ2_hbCreateDecodeTables()  local
205    for (i = minLen; i <= maxLen; i++)  in BZ2_hbCreateDecodeTables()
207 	 if (length[j] == i) { perm[pp] = j; pp++; };  in BZ2_hbCreateDecodeTables()
209    for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;  in BZ2_hbCreateDecodeTables()
210    for (i = 0; i < alphaSize; i++) base[length[i]+1]++;  in BZ2_hbCreateDecodeTables()
212    for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];  in BZ2_hbCreateDecodeTables()
214    for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;  in BZ2_hbCreateDecodeTables()
217    for (i = minLen; i <= maxLen; i++) {  in BZ2_hbCreateDecodeTables()
218       vec += (base[i+1] - base[i]);  in BZ2_hbCreateDecodeTables()
219       limit[i] = vec-1;  in BZ2_hbCreateDecodeTables()
222    for (i = minLen + 1; i <= maxLen; i++)  in BZ2_hbCreateDecodeTables()
223       base[i] = ((limit[i-1] + 1) << 1) - base[i];  in BZ2_hbCreateDecodeTables()