Lines Matching refs:ii
164 int hh, ii, jj, kk, symCount, *base, *limit;
168 ii = get_bits(bd, 24);
173 if (ii==0x177245 && jj==0x385090) return RETVAL_LAST_BLOCK;
176 if (ii!=0x314159 || jj!=0x265359) return RETVAL_NOT_BZIP_DATA;
189 for (ii=0; ii<16; ii++) {
190 if (hh & (1 << (15 - ii))) {
194 bd->symToByte[bd->symTotal++] = (16 * ii) + jj;
210 for (ii=0; ii<bd->groupCount; ii++) bd->mtfSymbol[ii] = ii;
211 for (ii=0; ii<bd->nSelectors; ii++) {
220 bd->mtfSymbol[0] = bd->selectors[ii] = uc;
233 for (ii = 0; ii < symCount; ii++) {
247 length[ii] = hh;
252 for (ii = 1; ii < symCount; ii++) {
253 if(length[ii] > maxLen) maxLen = length[ii];
254 else if(length[ii] < minLen) minLen = length[ii];
284 for (ii = minLen; ii <= maxLen; ii++) {
285 temp[ii] = limit[ii] = 0;
287 if (length[hh] == ii) hufGroup->permute[pp++] = hh;
291 for (ii = 0; ii < symCount; ii++) temp[length[ii]]++;
298 for (ii = minLen; ii < maxLen; ii++) {
299 pp += temp[ii];
300 limit[ii] = pp-1;
302 base[ii+1] = pp-(hh+=temp[ii]);
322 int ii, jj, kk, runPos, dbufCount, symCount, selector, nextSym,
333 for(ii=0; ii<256; ii++) {
334 byteCount[ii] = 0;
335 bd->mtfSymbol[ii] = ii;
359 ii = hufGroup->minLen;
360 jj = get_bits(bd, ii);
361 while (jj > limit[ii]) {
362 // if (ii > hufGroup->maxLen) return RETVAL_DATA_ERROR;
363 ii++;
372 jj-=base[ii];
374 if (ii > hufGroup->maxLen || (unsigned)jj >= MAX_SYMBOLS)
423 ii = nextSym - 1;
424 uc = bd->mtfSymbol[ii];
427 while(ii--) bd->mtfSymbol[ii+1] = bd->mtfSymbol[ii];
454 int ii, jj;
460 for (ii=0; ii<256; ii++) {
461 int kk = jj + byteCount[ii];
462 byteCount[ii] = jj;
468 for (ii=0; ii < bw->writeCount; ii++) {
469 unsigned char uc = dbuf[ii];
470 dbuf[byteCount[uc]] |= (ii << 8);
476 // Using ii as position, jj as previous character, hh as current character,