Home
last modified time | relevance | path

Searched refs:nextlen (Results 1 - 13 of 13) sorted by relevance

/third_party/ffmpeg/libavfilter/
H A Daf_alimiter.c74 int nextlen; member
192 s->nextlen = 1; in filter_frame()
195 for (i = s->nextiter; i < s->nextiter + s->nextlen; i++) { in filter_frame()
209 s->nextlen = i - s->nextiter + 1; in filter_frame()
210 nextpos[(s->nextiter + s->nextlen) % buffer_size] = s->pos; in filter_frame()
211 nextdelta[(s->nextiter + s->nextlen) % buffer_size] = rdelta; in filter_frame()
212 nextpos[(s->nextiter + s->nextlen + 1) % buffer_size] = -1; in filter_frame()
213 s->nextlen++; in filter_frame()
243 if (s->nextlen > 1) { in filter_frame()
260 s->nextlen in filter_frame()
[all...]
/kernel/linux/linux-5.10/lib/zlib_deflate/
H A Ddeftree.c581 int nextlen = tree[0].Len; /* length of next code */ in scan_tree() local
586 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree()
590 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
591 if (++count < max_count && curlen == nextlen) { in scan_tree()
604 if (nextlen == 0) { in scan_tree()
606 } else if (curlen == nextlen) { in scan_tree()
627 int nextlen = tree[0].Len; /* length of next code */ in send_tree() local
633 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree()
636 curlen = nextlen; nextle in send_tree()
[all...]
/kernel/linux/linux-6.6/lib/zlib_deflate/
H A Ddeftree.c581 int nextlen = tree[0].Len; /* length of next code */ in scan_tree() local
586 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree()
590 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()
591 if (++count < max_count && curlen == nextlen) { in scan_tree()
604 if (nextlen == 0) { in scan_tree()
606 } else if (curlen == nextlen) { in scan_tree()
627 int nextlen = tree[0].Len; /* length of next code */ in send_tree() local
633 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree()
636 curlen = nextlen; nextle in send_tree()
[all...]
/third_party/toybox/toys/posix/
H A Dsed.c184 long nextlen, rememberlen, count;
263 long len = TT.nextlen; in sed_line()
274 TT.nextlen = 0; in sed_line()
277 TT.nextlen = plen; in sed_line()
453 extend_string(&line, TT.nextline, len, -TT.nextlen); in sed_line()
456 TT.nextlen += len + 1; in sed_line()
472 TT.nextlen = 0; in sed_line()
677 TT.nextlen = TT.noeol = 0; in do_sed_file()
842 if (c == '{') TT.nextlen++; in parse_pattern()
844 if (!TT.nextlen in parse_pattern()
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c711 int nextlen = tree[0].Len; /* length of next code */ local
716 if (nextlen == 0) max_count = 138, min_count = 3;
720 curlen = nextlen; nextlen = tree[n+1].Len;
721 if (++count < max_count && curlen == nextlen) {
734 if (nextlen == 0) {
736 } else if (curlen == nextlen) {
756 int nextlen = tree[0].Len; /* length of next code */ local
762 if (nextlen == 0) max_count = 138, min_count = 3;
765 curlen = nextlen; nextle
[all...]
/third_party/node/deps/zlib/
H A Dtrees.c714 int nextlen = tree[0].Len; /* length of next code */ in scan_tree() local
719 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree()
723 curlen = nextlen; nextlen = tree[n + 1].Len; in scan_tree()
724 if (++count < max_count && curlen == nextlen) { in scan_tree()
737 if (nextlen == 0) { in scan_tree()
739 } else if (curlen == nextlen) { in scan_tree()
755 int nextlen = tree[0].Len; /* length of next code */ in send_tree() local
761 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree()
764 curlen = nextlen; nextle in send_tree()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c719 int nextlen = tree[0].Len; /* length of next code */ local
724 if (nextlen == 0) max_count = 138, min_count = 3;
728 curlen = nextlen; nextlen = tree[n+1].Len;
729 if (++count < max_count && curlen == nextlen) {
742 if (nextlen == 0) {
744 } else if (curlen == nextlen) {
764 int nextlen = tree[0].Len; /* length of next code */ local
770 if (nextlen == 0) max_count = 138, min_count = 3;
773 curlen = nextlen; nextle
[all...]
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c711 int nextlen = tree[0].Len; /* length of next code */ local
716 if (nextlen == 0) max_count = 138, min_count = 3;
720 curlen = nextlen; nextlen = tree[n+1].Len;
721 if (++count < max_count && curlen == nextlen) {
734 if (nextlen == 0) {
736 } else if (curlen == nextlen) {
756 int nextlen = tree[0].Len; /* length of next code */ local
762 if (nextlen == 0) max_count = 138, min_count = 3;
765 curlen = nextlen; nextle
[all...]
/third_party/zlib/
H A Dtrees.c735 int nextlen = tree[0].Len; /* length of next code */ in scan_tree() local
740 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree()
744 curlen = nextlen; nextlen = tree[n + 1].Len; in scan_tree()
745 if (++count < max_count && curlen == nextlen) { in scan_tree()
758 if (nextlen == 0) { in scan_tree()
760 } else if (curlen == nextlen) { in scan_tree()
777 int nextlen = tree[0].Len; /* length of next code */ in send_tree() local
783 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree()
786 curlen = nextlen; nextle in send_tree()
[all...]
/device/soc/rockchip/common/kernel/drivers/net/wireless/rockchip_wlan/rkwifi/bcmdhd_wifi6/
H A Ddhd_sdio.c491 bus->nextlen = 0; \
4072 bus->nextlen = 0; in dhdsdio_doiovar()
5264 bus->nextlen = 0; in dhdsdio_rxfail()
5465 if (DHD_GLOM_ON() && bus->nextlen) { in dhdsdio_rxglom()
5466 if (totlen != bus->nextlen) { in dhdsdio_rxglom()
5467 DHD_GLOM(("%s: glomdesc mismatch: nextlen %d glomdesc %d " in dhdsdio_rxglom()
5468 "rxseq %d\n", __FUNCTION__, bus->nextlen, in dhdsdio_rxglom()
5484 bus->nextlen = 0; in dhdsdio_rxglom()
5566 bus->nextlen = dptr[SDPCM_FRAMETAG_LEN + SDPCM_NEXTLEN_OFFSET]; in dhdsdio_rxglom()
5567 if ((bus->nextlen << in dhdsdio_rxglom()
5943 uint16 nextlen = bus->nextlen; dhdsdio_readframes() local
[all...]
H A Ddhd_wlfc.h120 uint16 nextlen; /* Next Read Len from last header */ member
/third_party/nghttp2/src/
H A Dutil.cc1377 auto nextlen = in hexdump() local
1379 if (nextlen == buflen && in hexdump()
1387 i += nextlen; in hexdump()
/third_party/toybox/generated/
H A Dglobals.h1488 long nextlen, rememberlen, count; member

Completed in 27 milliseconds