Home
last modified time | relevance | path

Searched refs:bi_buf (Results 1 – 8 of 8) sorted by relevance

/external/llvm/test/Transforms/GVN/
Dlpre-call-wrap-2.ll6 ; void bi_windup(unsigned char *outbuf, unsigned char bi_buf) {
7 ; outbuf[outcnt] = bi_buf;
10 ; outbuf[outcnt] = bi_buf;
16 define void @bi_windup(i8* %outbuf, i8 zeroext %bi_buf) nounwind {
21 store i8 %bi_buf, i8* %1, align 1
36 store i8 %bi_buf, i8* %5, align 1
/external/zlib/src/
Dtrees.c202 s->bi_buf |= (ush)value << s->bi_valid;
203 put_short(s, s->bi_buf);
204 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
207 s->bi_buf |= (ush)value << s->bi_valid;
217 s->bi_buf |= (ush)val << s->bi_valid;\
218 put_short(s, s->bi_buf);\
219 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
222 s->bi_buf |= (ush)(value) << s->bi_valid;\
395 s->bi_buf = 0;
1173 put_short(s, s->bi_buf);
[all …]
Ddeflate.h257 ush bi_buf; member
Ddeflate.c480 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Dfx_zlib_trees.c202 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
203 put_short(s, s->bi_buf); in send_bits()
204 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()
207 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
217 s->bi_buf |= (ush)val << s->bi_valid;\
218 put_short(s, s->bi_buf);\
219 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
222 s->bi_buf |= (ush)(value) << s->bi_valid;\
395 s->bi_buf = 0; in _tr_init()
1173 put_short(s, s->bi_buf);
[all …]
Ddeflate.h257 ush bi_buf; member
Dfx_zlib_deflate.c479 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
/external/chromium-trace/trace-viewer/tracing/third_party/jszip/
Djszip.min.js13 …buf=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}…
14 …bi_buf|=b<<a.bi_valid&65535,f(a,a.bi_buf),a.bi_buf=b>>V-a.bi_valid,a.bi_valid+=c-V):(a.bi_buf|=b<<…