Lines Matching refs:bits
15449 var bits = 0, remaining = 8;
15455 buf.push(bits | (x >> (n -= remaining)));
15457 bits = 0;
15460 if (n > 0) bits |= (x & ((1 << n) - 1)) << (remaining -= n);
15497 if (remaining < 8) buf.push(bits);
15602 var blit = function(y, x, h, w, bits) {
15605 matrix[y+i][x+j] = (bits[i] >> j) & 1;
23402 var bits; /* bit length */
23407 for (bits = 0; bits <= MAX_BITS; bits++) {
23408 s.bl_count[bits] = 0;
23418 bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
23419 if (bits > max_length) {
23420 bits = max_length;
23423 tree[n*2 + 1]/*.Len*/ = bits;
23428 s.bl_count[bits]++;
23434 s.opt_len += f * (bits + xbits);
23446 bits = max_length-1;
23447 while (s.bl_count[bits] === 0) { bits--; }
23448 s.bl_count[bits]--; /* move one leaf down the tree */
23449 s.bl_count[bits+1] += 2; /* move one overflow item as its brother */
23462 for (bits = max_length; bits !== 0; bits--) {
23463 n = s.bl_count[bits];
23467 if (tree[m*2 + 1]/*.Len*/ !== bits) {
23469 s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;
23470 tree[m*2 + 1]/*.Len*/ = bits;
23493 var bits; /* bit index */
23499 for (bits = 1; bits <= MAX_BITS; bits++) {
23500 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
23526 var bits; /* bit counter */
23579 for (bits = 0; bits <= MAX_BITS; bits++) {
23580 bl_count[bits] = 0;
24550 this.bits = 0; /* number of bits in "in" */
24603 state.bits = 0;
24714 inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, {bits: 9});
24720 inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, {bits: 5});
24796 var bits; /* bits in bit buffer */
24833 bits = state.bits;
24849 while (bits < 16) {
24852 hold += input[next++] << bits;
24853 bits += 8;
24866 bits = 0;
24888 bits -= 4;
24905 bits = 0;
24910 while (bits < 16) {
24913 hold += input[next++] << bits;
24914 bits += 8;
24940 bits = 0;
24946 while (bits < 32) {
24949 hold += input[next++] << bits;
24950 bits += 8;
24967 bits = 0;
24973 while (bits < 16) {
24976 hold += input[next++] << bits;
24977 bits += 8;
24993 bits = 0;
25000 while (bits < 16) {
25003 hold += input[next++] << bits;
25004 bits += 8;
25020 bits = 0;
25119 while (bits < 16) {
25122 hold += input[next++] << bits;
25123 bits += 8;
25133 bits = 0;
25145 while (bits < 32) {
25148 hold += input[next++] << bits;
25149 bits += 8;
25155 bits = 0;
25167 state.bits = bits;
25180 hold >>>= bits & 7;
25181 bits -= bits & 7;
25187 while (bits < 3) {
25190 hold += input[next++] << bits;
25191 bits += 8;
25197 bits -= 1;
25214 bits -= 2;
25230 bits -= 2;
25235 hold >>>= bits & 7;
25236 bits -= bits & 7;
25239 while (bits < 32) {
25242 hold += input[next++] << bits;
25243 bits += 8;
25256 bits = 0;
25285 while (bits < 14) {
25288 hold += input[next++] << bits;
25289 bits += 8;
25295 bits -= 5;
25300 bits -= 5;
25305 bits -= 4;
25321 while (bits < 3) {
25324 hold += input[next++] << bits;
25325 bits += 8;
25331 bits -= 3;
25344 opts = {bits: state.lenbits};
25346 state.lenbits = opts.bits;
25365 if ((here_bits) <= bits) { break; }
25369 hold += input[next++] << bits;
25370 bits += 8;
25376 bits -= here_bits;
25384 while (bits < n) {
25387 hold += input[next++] << bits;
25388 bits += 8;
25393 bits -= here_bits;
25404 bits -= 2;
25410 while (bits < n) {
25413 hold += input[next++] << bits;
25414 bits += 8;
25419 bits -= here_bits;
25425 bits -= 3;
25431 while (bits < n) {
25434 hold += input[next++] << bits;
25435 bits += 8;
25440 bits -= here_bits;
25446 bits -= 7;
25475 opts = {bits: state.lenbits};
25479 state.lenbits = opts.bits;
25492 opts = {bits: state.distbits};
25496 state.distbits = opts.bits;
25519 state.bits = bits;
25530 bits = state.bits;
25545 if (here_bits <= bits) { break; }
25549 hold += input[next++] << bits;
25550 bits += 8;
25564 if ((last_bits + here_bits) <= bits) { break; }
25568 hold += input[next++] << bits;
25569 bits += 8;
25574 bits -= last_bits;
25580 bits -= here_bits;
25609 while (bits < n) {
25612 hold += input[next++] << bits;
25613 bits += 8;
25619 bits -= state.extra;
25634 if ((here_bits) <= bits) { break; }
25638 hold += input[next++] << bits;
25639 bits += 8;
25653 if ((last_bits + here_bits) <= bits) { break; }
25657 hold += input[next++] << bits;
25658 bits += 8;
25663 bits -= last_bits;
25669 bits -= here_bits;
25685 while (bits < n) {
25688 hold += input[next++] << bits;
25689 bits += 8;
25695 bits -= state.extra;
25768 while (bits < 32) {
25772 hold |= input[next++] << bits;
25773 bits += 8;
25794 bits = 0;
25803 while (bits < 32) {
25806 hold += input[next++] << bits;
25807 bits += 8;
25817 bits = 0;
25853 state.bits = bits;
25872 strm.data_type = state.bits + (state.last ? 64 : 0) +
25992 var bits; /* local strm.bits */
26026 bits = state.bits;
26038 if (bits < 15) {
26039 hold += input[_in++] << bits;
26040 bits += 8;
26041 hold += input[_in++] << bits;
26042 bits += 8;
26051 bits -= op;
26063 if (bits < op) {
26064 hold += input[_in++] << bits;
26065 bits += 8;
26069 bits -= op;
26072 if (bits < 15) {
26073 hold += input[_in++] << bits;
26074 bits += 8;
26075 hold += input[_in++] << bits;
26076 bits += 8;
26084 bits -= op;
26090 if (bits < op) {
26091 hold += input[_in++] << bits;
26092 bits += 8;
26093 if (bits < op) {
26094 hold += input[_in++] << bits;
26095 bits += 8;
26107 bits -= op;
26247 len = bits >> 3;
26249 bits -= len << 3;
26250 hold &= (1 << bits) - 1;
26258 state.bits = bits;
26305 var bits = opts.bits;
26373 root = bits;
26392 opts.bits = 1;
26591 opts.bits = root;
65354 this.bits = this.data[pos++];
65380 BitsPerComponent: this.bits,
65433 BitsPerComponent: this.image.bits,
65442 BitsPerComponent: this.image.bits,
65500 colorByteSize = _this.image.colors * _this.image.bits / 8;
65641 this.bits = this.data[this.pos++];
65694 this.pixelBitlength = this.bits * colors;