Lines Matching defs:jj
164 int hh, ii, jj, kk, symCount, *base, *limit;
169 jj = 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;
192 for (jj=0; jj<16; jj++)
193 if (kk & (1 << (15 - jj)))
194 bd->symToByte[bd->symTotal++] = (16 * ii) + jj;
214 for(jj=0;get_bits(bd,1);jj++)
215 if (jj>=bd->groupCount) return RETVAL_DATA_ERROR;
218 uc = bd->mtfSymbol[jj];
219 memmove(bd->mtfSymbol+1, bd->mtfSymbol, jj);
226 for (jj=0; jj<bd->groupCount; jj++) {
272 hufGroup = bd->groups+jj;
322 int ii, jj, kk, runPos, dbufCount, symCount, selector, nextSym,
358 // Read next huffman-coded symbol (into jj).
360 jj = get_bits(bd, ii);
361 while (jj > limit[ii]) {
369 jj = (jj << 1) | kk;
371 // Huffman decode jj into nextSym (with bounds checking)
372 jj-=base[ii];
374 if (ii > hufGroup->maxLen || (unsigned)jj >= MAX_SYMBOLS)
376 nextSym = hufGroup->permute[jj];
454 int ii, jj;
459 jj = 0;
461 int kk = jj + byteCount[ii];
462 byteCount[ii] = jj;
463 jj = kk;
476 // Using ii as position, jj as previous character, hh as current character,