Lines Matching refs:i

341   register unsigned i;          /* counter, current code */  in huft_build()  local
375 p = b; i = n; in huft_build()
377 Tracecv(*p, (stderr, (n-i >= ' ' && n-i <= '~' ? "%c %d\n" : "0x%x %d\n"), in huft_build()
378 n-i, *p)); in huft_build()
381 } while (--i); in huft_build()
400 for (i = BMAX; i; i--) in huft_build()
401 if (c[i]) in huft_build()
403 g = i; /* maximum code length */ in huft_build()
404 if ((unsigned)l > i) in huft_build()
405 l = i; in huft_build()
411 for (y = 1 << j; j < i; j++, y <<= 1) in huft_build()
416 if ((y -= c[i]) < 0) { in huft_build()
420 c[i] += y; in huft_build()
427 while (--i) { /* note that i == g from above */ in huft_build()
434 p = b; i = 0; in huft_build()
437 v[x[j]++] = i; in huft_build()
438 } while (++i < n); in huft_build()
444 x[0] = i = 0; /* first Huffman code is zero */ in huft_build()
506 x[h] = i; /* save pattern for backing up */ in huft_build()
510 j = i >> (w - l); /* (get around Turbo C bug) */ in huft_build()
536 for (j = i >> w; j < z; j += f) in huft_build()
540 for (j = 1 << (k - 1); i & j; j >>= 1) in huft_build()
541 i ^= j; in huft_build()
542 i ^= j; in huft_build()
545 while ((i & ((1 << w) - 1)) != x[h]) in huft_build()
770 int i; /* temporary variable */ in inflate_fixed() local
784 for (i = 0; i < 144; i++) in inflate_fixed()
785 l[i] = 8; in inflate_fixed()
786 for (; i < 256; i++) in inflate_fixed()
787 l[i] = 9; in inflate_fixed()
788 for (; i < 280; i++) in inflate_fixed()
789 l[i] = 7; in inflate_fixed()
790 for (; i < 288; i++) /* make a complete, but wrong code set */ in inflate_fixed()
791 l[i] = 8; in inflate_fixed()
793 if ((i = huft_build(l, 288, 257, cplens, cplext, &tl, &bl)) != 0) { in inflate_fixed()
795 return i; in inflate_fixed()
799 for (i = 0; i < 30; i++) /* make an incomplete code set */ in inflate_fixed()
800 l[i] = 5; in inflate_fixed()
802 if ((i = huft_build(l, 30, 0, cpdist, cpdext, &td, &bd)) > 1) in inflate_fixed()
808 return i; in inflate_fixed()
832 int i; /* temporary variables */ in inflate_dynamic() local
901 if ((i = huft_build(ll, 19, 19, NULL, NULL, &tl, &bl)) != 0) in inflate_dynamic()
903 if (i == 1) in inflate_dynamic()
905 ret = i; /* incomplete code set */ in inflate_dynamic()
914 i = l = 0; in inflate_dynamic()
915 while ((unsigned)i < n) in inflate_dynamic()
922 ll[i++] = l = j; /* save last length in l */ in inflate_dynamic()
928 if ((unsigned)i + j > n) { in inflate_dynamic()
933 ll[i++] = l; in inflate_dynamic()
940 if ((unsigned)i + j > n) { in inflate_dynamic()
945 ll[i++] = 0; in inflate_dynamic()
953 if ((unsigned)i + j > n) { in inflate_dynamic()
958 ll[i++] = 0; in inflate_dynamic()
978 if ((i = huft_build(ll, nl, 257, cplens, cplext, &tl, &bl)) != 0) in inflate_dynamic()
981 if (i == 1) { in inflate_dynamic()
985 ret = i; /* incomplete code set */ in inflate_dynamic()
990 if ((i = huft_build(ll + nl, nd, 0, cpdist, cpdext, &td, &bd)) != 0) in inflate_dynamic()
993 if (i == 1) { in inflate_dynamic()
996 i = 0; in inflate_dynamic()
1002 ret = i; /* incomplete code set */ in inflate_dynamic()
1153 int i; /* counter for all possible eight bit values */ in makecrc() local
1161 for (i = 0; i < sizeof(p)/sizeof(int); i++) in makecrc()
1162 e |= 1L << (31 - p[i]); in makecrc()
1166 for (i = 1; i < 256; i++) in makecrc()
1169 for (k = i | 256; k != 1; k >>= 1) in makecrc()
1175 crc_32_tab[i] = c; in makecrc()