Home
last modified time | relevance | path

Searched refs:bi_buf (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c195 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
200 s->bi_buf |= (ush)value << s->bi_valid;
201 put_short(s, s->bi_buf);
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
216 put_short(s, s->bi_buf);\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |
[all...]
H A Ddeflate.h52 /* size of bit buffer in bi_buf */
255 ush bi_buf; member
260 /* Number of valid bits in bi_buf. All bits above the last valid bit
H A Ddeflate.c610 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
/third_party/node/deps/zlib/
H A Dtrees.c168 put_short(s, s->bi_buf); in bi_flush()
169 s->bi_buf = 0; in bi_flush()
172 put_byte(s, (Byte)s->bi_buf); in bi_flush()
173 s->bi_buf >>= 8; in bi_flush()
183 put_short(s, s->bi_buf); in bi_windup()
185 put_byte(s, (Byte)s->bi_buf); in bi_windup()
187 s->bi_buf = 0; in bi_windup()
257 /* If not enough room in bi_buf, use (valid) bits from bi_buf and in send_bits()
262 s->bi_buf | in send_bits()
[all...]
H A Ddeflate.h56 /* size of bit buffer in bi_buf */
264 ush bi_buf; member
269 /* Number of valid bits in bi_buf. All bits above the last valid bit
H A Ddeflate.c780 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid); in deflatePrime()
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c78 /* Number of bits used within bi_buf. (bi_buf might be implemented on
202 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
207 s->bi_buf |= (ush)value << s->bi_valid;
208 put_short(s, s->bi_buf);
209 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
212 s->bi_buf |= (ush)value << s->bi_valid;
222 s->bi_buf |= (ush)val << s->bi_valid;\
223 put_short(s, s->bi_buf);\
[all...]
H A Ddeflate.h249 ush bi_buf; member
254 /* Number of valid bits in bi_buf. All bits above the last valid bit
H A Ddeflate.c456 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c195 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
200 s->bi_buf |= (ush)value << s->bi_valid;
201 put_short(s, s->bi_buf);
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
216 put_short(s, s->bi_buf);\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |
[all...]
H A Ddeflate.h52 /* size of bit buffer in bi_buf */
255 ush bi_buf; member
260 /* Number of valid bits in bi_buf. All bits above the last valid bit
H A Ddeflate.c604 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
/third_party/zlib/
H A Dtrees.c179 put_short(s, s->bi_buf); in bi_flush()
180 s->bi_buf = 0; in bi_flush()
183 put_byte(s, (Byte)s->bi_buf); in bi_flush()
184 s->bi_buf >>= INDEX_8; in bi_flush()
195 put_short(s, s->bi_buf); in bi_windup()
197 put_byte(s, (Byte)s->bi_buf); in bi_windup()
199 s->bi_buf = 0; in bi_windup()
271 /* If not enough room in bi_buf, use (valid) bits from bi_buf and in send_bits()
276 s->bi_buf | in send_bits()
[all...]
H A Ddeflate.h56 /* size of bit buffer in bi_buf */
266 ush bi_buf; member
271 /* Number of valid bits in bi_buf. All bits above the last valid bit
H A Ddeflate.c747 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid); in deflatePrime()

Completed in 22 milliseconds