72    Int32 nNodes, nHeap, n1, n2, i, j, k;  in BZ2_hbMakeCodeLengths()  local
79    for (i = 0; i < alphaSize; i++)  in BZ2_hbMakeCodeLengths()
80       weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;  in BZ2_hbMakeCodeLengths()
91       for (i = 1; i <= alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
92          parent[i] = -1;  in BZ2_hbMakeCodeLengths()
94          heap[nHeap] = i;  in BZ2_hbMakeCodeLengths()
115       for (i = 1; i <= alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
117          k = i;  in BZ2_hbMakeCodeLengths()
119          len[i-1] = j;  in BZ2_hbMakeCodeLengths()
142       for (i = 1; i <= alphaSize; i++) {  in BZ2_hbMakeCodeLengths()
143          j = weight[i] >> 8;  in BZ2_hbMakeCodeLengths()
145          weight[i] = j << 8;  in BZ2_hbMakeCodeLengths()
158    Int32 n, vec, i;  in BZ2_hbAssignCodes()  local
162       for (i = 0; i < alphaSize; i++)  in BZ2_hbAssignCodes()
163          if (length[i] == n) { code[i] = vec; vec++; };  in BZ2_hbAssignCodes()
178    Int32 pp, i, j, vec;  in BZ2_hbCreateDecodeTables()  local
181    for (i = minLen; i <= maxLen; i++)  in BZ2_hbCreateDecodeTables()
183          if (length[j] == i) { perm[pp] = j; pp++; };  in BZ2_hbCreateDecodeTables()
185    for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;  in BZ2_hbCreateDecodeTables()
186    for (i = 0; i < alphaSize; i++) base[length[i]+1]++;  in BZ2_hbCreateDecodeTables()
188    for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];  in BZ2_hbCreateDecodeTables()
190    for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;  in BZ2_hbCreateDecodeTables()
193    for (i = minLen; i <= maxLen; i++) {  in BZ2_hbCreateDecodeTables()
194       vec += (base[i+1] - base[i]);  in BZ2_hbCreateDecodeTables()
195       limit[i] = vec-1;  in BZ2_hbCreateDecodeTables()
198    for (i = minLen + 1; i <= maxLen; i++)  in BZ2_hbCreateDecodeTables()
199       base[i] = ((limit[i-1] + 1) << 1) - base[i];  in BZ2_hbCreateDecodeTables()