Lines Matching refs:bits
7908 var bits; /* local strm.bits */
7942 bits = state.bits;
7954 if (bits < 15) {
7955 hold += input[_in++] << bits;
7956 bits += 8;
7957 hold += input[_in++] << bits;
7958 bits += 8;
7967 bits -= op;
7979 if (bits < op) {
7980 hold += input[_in++] << bits;
7981 bits += 8;
7985 bits -= op;
7988 if (bits < 15) {
7989 hold += input[_in++] << bits;
7990 bits += 8;
7991 hold += input[_in++] << bits;
7992 bits += 8;
8000 bits -= op;
8006 if (bits < op) {
8007 hold += input[_in++] << bits;
8008 bits += 8;
8009 if (bits < op) {
8010 hold += input[_in++] << bits;
8011 bits += 8;
8023 bits -= op;
8163 len = bits >> 3;
8165 bits -= len << 3;
8166 hold &= (1 << bits) - 1;
8174 state.bits = bits;
8320 this.bits = 0; /* number of bits in "in" */
8373 state.bits = 0;
8484 inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
8490 inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
8566 var bits; /* bits in bit buffer */
8603 bits = state.bits;
8619 while (bits < 16) {
8622 hold += input[next++] << bits;
8623 bits += 8;
8636 bits = 0;
8658 bits -= 4;
8675 bits = 0;
8680 while (bits < 16) {
8683 hold += input[next++] << bits;
8684 bits += 8;
8710 bits = 0;
8716 while (bits < 32) {
8719 hold += input[next++] << bits;
8720 bits += 8;
8737 bits = 0;
8743 while (bits < 16) {
8746 hold += input[next++] << bits;
8747 bits += 8;
8763 bits = 0;
8770 while (bits < 16) {
8773 hold += input[next++] << bits;
8774 bits += 8;
8790 bits = 0;
8889 while (bits < 16) {
8892 hold += input[next++] << bits;
8893 bits += 8;
8903 bits = 0;
8915 while (bits < 32) {
8918 hold += input[next++] << bits;
8919 bits += 8;
8925 bits = 0;
8937 state.bits = bits;
8950 hold >>>= bits & 7;
8951 bits -= bits & 7;
8957 while (bits < 3) {
8960 hold += input[next++] << bits;
8961 bits += 8;
8967 bits -= 1;
8984 bits -= 2;
9000 bits -= 2;
9005 hold >>>= bits & 7;
9006 bits -= bits & 7;
9009 while (bits < 32) {
9012 hold += input[next++] << bits;
9013 bits += 8;
9026 bits = 0;
9055 while (bits < 14) {
9058 hold += input[next++] << bits;
9059 bits += 8;
9065 bits -= 5;
9070 bits -= 5;
9075 bits -= 4;
9091 while (bits < 3) {
9094 hold += input[next++] << bits;
9095 bits += 8;
9101 bits -= 3;
9114 opts = { bits: state.lenbits }; property in AnonymousFunctione744f5d00100.AnonymousFunctione744f5d06300.inflate.opts
9116 state.lenbits = opts.bits;
9135 if ((here_bits) <= bits) { break; }
9139 hold += input[next++] << bits;
9140 bits += 8;
9146 bits -= here_bits;
9154 while (bits < n) {
9157 hold += input[next++] << bits;
9158 bits += 8;
9163 bits -= here_bits;
9174 bits -= 2;
9180 while (bits < n) {
9183 hold += input[next++] << bits;
9184 bits += 8;
9189 bits -= here_bits;
9195 bits -= 3;
9201 while (bits < n) {
9204 hold += input[next++] << bits;
9205 bits += 8;
9210 bits -= here_bits;
9216 bits -= 7;
9245 opts = { bits: state.lenbits }; property in AnonymousFunctione744f5d00100.AnonymousFunctione744f5d06300.inflate.opts
9249 state.lenbits = opts.bits;
9262 opts = { bits: state.distbits }; property in AnonymousFunctione744f5d00100.AnonymousFunctione744f5d06300.inflate.opts
9266 state.distbits = opts.bits;
9289 state.bits = bits;
9300 bits = state.bits;
9315 if (here_bits <= bits) { break; }
9319 hold += input[next++] << bits;
9320 bits += 8;
9334 if ((last_bits + here_bits) <= bits) { break; }
9338 hold += input[next++] << bits;
9339 bits += 8;
9344 bits -= last_bits;
9350 bits -= here_bits;
9379 while (bits < n) {
9382 hold += input[next++] << bits;
9383 bits += 8;
9389 bits -= state.extra;
9404 if ((here_bits) <= bits) { break; }
9408 hold += input[next++] << bits;
9409 bits += 8;
9423 if ((last_bits + here_bits) <= bits) { break; }
9427 hold += input[next++] << bits;
9428 bits += 8;
9433 bits -= last_bits;
9439 bits -= here_bits;
9455 while (bits < n) {
9458 hold += input[next++] << bits;
9459 bits += 8;
9465 bits -= state.extra;
9538 while (bits < 32) {
9542 hold |= input[next++] << bits;
9543 bits += 8;
9564 bits = 0;
9573 while (bits < 32) {
9576 hold += input[next++] << bits;
9577 bits += 8;
9587 bits = 0;
9623 state.bits = bits;
9642 strm.data_type = state.bits + (state.last ? 64 : 0) +
9793 var bits = opts.bits;
9861 root = bits;
9880 opts.bits = 1;
10077 opts.bits = root;
10402 var bits; /* bit length */
10407 for (bits = 0; bits <= MAX_BITS; bits++) {
10408 s.bl_count[bits] = 0;
10418 bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
10419 if (bits > max_length) {
10420 bits = max_length;
10423 tree[n * 2 + 1]/*.Len*/ = bits;
10428 s.bl_count[bits]++;
10434 s.opt_len += f * (bits + xbits);
10446 bits = max_length - 1;
10447 while (s.bl_count[bits] === 0) { bits--; }
10448 s.bl_count[bits]--; /* move one leaf down the tree */
10449 s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
10462 for (bits = max_length; bits !== 0; bits--) {
10463 n = s.bl_count[bits];
10467 if (tree[m * 2 + 1]/*.Len*/ !== bits) {
10469 s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;
10470 tree[m * 2 + 1]/*.Len*/ = bits;
10493 var bits; /* bit index */
10499 for (bits = 1; bits <= MAX_BITS; bits++) {
10500 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
10526 var bits; /* bit counter */
10579 for (bits = 0; bits <= MAX_BITS; bits++) {
10580 bl_count[bits] = 0;