亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? infback.c

?? psp上的reader 這個是以月光老大的cnreader為基礎 增加了zip文件瀏覽功能
?? C
?? 第 1 頁 / 共 2 頁
字號:
            }            DROPBITS(2);            break;        case STORED:            /* get and verify stored block length */            BYTEBITS();                         /* go to byte boundary */            NEEDBITS(32);            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {                strm->msg = (char *)"invalid stored block lengths";                state->mode = BAD;                break;            }            state->length = (unsigned)hold & 0xffff;            Tracev((stderr, "inflate:       stored length %u\n",                    state->length));            INITBITS();            /* copy stored block from input to output */            while (state->length != 0) {                copy = state->length;                PULL();                ROOM();                if (copy > have) copy = have;                if (copy > left) copy = left;                zmemcpy(put, next, copy);                have -= copy;                next += copy;                left -= copy;                put += copy;                state->length -= copy;            }            Tracev((stderr, "inflate:       stored end\n"));            state->mode = TYPE;            break;        case TABLE:            /* get dynamic table entries descriptor */            NEEDBITS(14);            state->nlen = BITS(5) + 257;            DROPBITS(5);            state->ndist = BITS(5) + 1;            DROPBITS(5);            state->ncode = BITS(4) + 4;            DROPBITS(4);#ifndef PKZIP_BUG_WORKAROUND            if (state->nlen > 286 || state->ndist > 30) {                strm->msg = (char *)"too many length or distance symbols";                state->mode = BAD;                break;            }#endif            Tracev((stderr, "inflate:       table sizes ok\n"));            /* get code length code lengths (not a typo) */            state->have = 0;            while (state->have < state->ncode) {                NEEDBITS(3);                state->lens[order[state->have++]] = (unsigned short)BITS(3);                DROPBITS(3);            }            while (state->have < 19)                state->lens[order[state->have++]] = 0;            state->next = state->codes;            state->lencode = (code const FAR *)(state->next);            state->lenbits = 7;            ret = inflate_table(CODES, state->lens, 19, &(state->next),                                &(state->lenbits), state->work);            if (ret) {                strm->msg = (char *)"invalid code lengths set";                state->mode = BAD;                break;            }            Tracev((stderr, "inflate:       code lengths ok\n"));            /* get length and distance code code lengths */            state->have = 0;            while (state->have < state->nlen + state->ndist) {                for (;;) {                    this = state->lencode[BITS(state->lenbits)];                    if ((unsigned)(this.bits) <= bits) break;                    PULLBYTE();                }                if (this.val < 16) {                    NEEDBITS(this.bits);                    DROPBITS(this.bits);                    state->lens[state->have++] = this.val;                }                else {                    if (this.val == 16) {                        NEEDBITS(this.bits + 2);                        DROPBITS(this.bits);                        if (state->have == 0) {                            strm->msg = (char *)"invalid bit length repeat";                            state->mode = BAD;                            break;                        }                        len = (unsigned)(state->lens[state->have - 1]);                        copy = 3 + BITS(2);                        DROPBITS(2);                    }                    else if (this.val == 17) {                        NEEDBITS(this.bits + 3);                        DROPBITS(this.bits);                        len = 0;                        copy = 3 + BITS(3);                        DROPBITS(3);                    }                    else {                        NEEDBITS(this.bits + 7);                        DROPBITS(this.bits);                        len = 0;                        copy = 11 + BITS(7);                        DROPBITS(7);                    }                    if (state->have + copy > state->nlen + state->ndist) {                        strm->msg = (char *)"invalid bit length repeat";                        state->mode = BAD;                        break;                    }                    while (copy--)                        state->lens[state->have++] = (unsigned short)len;                }            }            /* handle error breaks in while */            if (state->mode == BAD) break;            /* build code tables */            state->next = state->codes;            state->lencode = (code const FAR *)(state->next);            state->lenbits = 9;            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),                                &(state->lenbits), state->work);            if (ret) {                strm->msg = (char *)"invalid literal/lengths set";                state->mode = BAD;                break;            }            state->distcode = (code const FAR *)(state->next);            state->distbits = 6;            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,                            &(state->next), &(state->distbits), state->work);            if (ret) {                strm->msg = (char *)"invalid distances set";                state->mode = BAD;                break;            }            Tracev((stderr, "inflate:       codes ok\n"));            state->mode = LEN;        case LEN:            /* use inflate_fast() if we have enough input and output */            if (have >= 6 && left >= 258) {                RESTORE();                if (state->whave < state->wsize)                    state->whave = state->wsize - left;                inflate_fast(strm, state->wsize);                LOAD();                break;            }            /* get a literal, length, or end-of-block code */            for (;;) {                this = state->lencode[BITS(state->lenbits)];                if ((unsigned)(this.bits) <= bits) break;                PULLBYTE();            }            if (this.op && (this.op & 0xf0) == 0) {                last = this;                for (;;) {                    this = state->lencode[last.val +                            (BITS(last.bits + last.op) >> last.bits)];                    if ((unsigned)(last.bits + this.bits) <= bits) break;                    PULLBYTE();                }                DROPBITS(last.bits);            }            DROPBITS(this.bits);            state->length = (unsigned)this.val;            /* process literal */            if (this.op == 0) {                Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?                        "inflate:         literal '%c'\n" :                        "inflate:         literal 0x%02x\n", this.val));                ROOM();                *put++ = (unsigned char)(state->length);                left--;                state->mode = LEN;                break;            }            /* process end of block */            if (this.op & 32) {                Tracevv((stderr, "inflate:         end of block\n"));                state->mode = TYPE;                break;            }            /* invalid code */            if (this.op & 64) {                strm->msg = (char *)"invalid literal/length code";                state->mode = BAD;                break;            }            /* length code -- get extra bits, if any */            state->extra = (unsigned)(this.op) & 15;            if (state->extra != 0) {                NEEDBITS(state->extra);                state->length += BITS(state->extra);                DROPBITS(state->extra);            }            Tracevv((stderr, "inflate:         length %u\n", state->length));            /* get distance code */            for (;;) {                this = state->distcode[BITS(state->distbits)];                if ((unsigned)(this.bits) <= bits) break;                PULLBYTE();            }            if ((this.op & 0xf0) == 0) {                last = this;                for (;;) {                    this = state->distcode[last.val +                            (BITS(last.bits + last.op) >> last.bits)];                    if ((unsigned)(last.bits + this.bits) <= bits) break;                    PULLBYTE();                }                DROPBITS(last.bits);            }            DROPBITS(this.bits);            if (this.op & 64) {                strm->msg = (char *)"invalid distance code";                state->mode = BAD;                break;            }            state->offset = (unsigned)this.val;            /* get distance extra bits, if any */            state->extra = (unsigned)(this.op) & 15;            if (state->extra != 0) {                NEEDBITS(state->extra);                state->offset += BITS(state->extra);                DROPBITS(state->extra);            }            if (state->offset > state->wsize - (state->whave < state->wsize ?                                                left : 0)) {                strm->msg = (char *)"invalid distance too far back";                state->mode = BAD;                break;            }            Tracevv((stderr, "inflate:         distance %u\n", state->offset));            /* copy match from window to output */            do {                ROOM();                copy = state->wsize - state->offset;                if (copy < left) {                    from = put + copy;                    copy = left - copy;                }                else {                    from = put - state->offset;                    copy = left;                }                if (copy > state->length) copy = state->length;                state->length -= copy;                left -= copy;                do {                    *put++ = *from++;                } while (--copy);            } while (state->length != 0);            break;        case DONE:            /* inflate stream terminated properly -- write leftover output */            ret = Z_STREAM_END;            if (left < state->wsize) {                if (out(out_desc, state->window, state->wsize - left))                    ret = Z_BUF_ERROR;            }            goto inf_leave;        case BAD:            ret = Z_DATA_ERROR;            goto inf_leave;        default:                /* can't happen, but makes compilers happy */            ret = Z_STREAM_ERROR;            goto inf_leave;        }    /* Return unused input */  inf_leave:    strm->next_in = next;    strm->avail_in = have;    return ret;}int ZEXPORT inflateBackEnd(strm)z_stream FAR *strm;{    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)        return Z_STREAM_ERROR;    ZFREE(strm, strm->state);    strm->state = Z_NULL;    Tracev((stderr, "inflate: end\n"));    return Z_OK;}

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
欧美在线观看你懂的| 日韩欧美在线综合网| 香港成人在线视频| 欧美一级久久久| 国产一区不卡视频| 国产精品色呦呦| 色天天综合色天天久久| 亚洲黄色在线视频| 欧美电影一区二区| 国产又黄又大久久| 亚洲三级在线播放| 欧美欧美欧美欧美| 国产一区久久久| 亚洲人成在线观看一区二区| 欧美在线免费观看亚洲| 美女脱光内衣内裤视频久久网站 | gogo大胆日本视频一区| 亚洲精品高清视频在线观看| 欧美一区二区观看视频| 国产成人一区在线| 亚洲夂夂婷婷色拍ww47| 欧美大片在线观看一区二区| 成人免费av资源| 亚洲一区在线观看视频| 2023国产精品| 91电影在线观看| 久久黄色级2电影| 中文字幕中文字幕在线一区 | 日韩欧美国产精品一区| 丁香啪啪综合成人亚洲小说| 亚洲第一成年网| 久久综合久久综合亚洲| 91麻豆国产精品久久| 美日韩一区二区三区| 亚洲天堂2016| 日韩精品中文字幕一区二区三区| 不卡大黄网站免费看| 免费精品视频在线| 亚洲免费av在线| 国产亚洲精品超碰| 欧美日韩一区二区三区四区五区| 国产精品69久久久久水密桃| 亚洲伊人色欲综合网| 国产免费成人在线视频| 91精品久久久久久蜜臀| 91在线观看成人| 激情欧美一区二区三区在线观看| 亚洲精品日日夜夜| 久久人人超碰精品| 欧美乱妇15p| 97se亚洲国产综合自在线不卡| 美女视频黄久久| 亚洲乱码国产乱码精品精98午夜| 久久综合九色综合欧美98 | 久久老女人爱爱| 欧美日韩精品一区二区天天拍小说| 国产99精品国产| 免费成人在线观看| 亚洲第一搞黄网站| 亚洲免费看黄网站| 日本一区二区三区国色天香 | 欧美一区二区三区在| 97国产一区二区| 国产成人自拍网| 美洲天堂一区二卡三卡四卡视频 | 欧美日韩国产片| 91麻豆蜜桃一区二区三区| 国产精品一二三在| 麻豆中文一区二区| 亚州成人在线电影| 一区二区三区中文在线| 国产欧美一区二区精品婷婷| 精品久久国产老人久久综合| 欧美日韩高清一区二区不卡| 色哟哟一区二区三区| 丁香网亚洲国际| 国产在线播放一区二区三区| 免费观看成人鲁鲁鲁鲁鲁视频| 亚洲成人一二三| 亚洲一区二区高清| 综合色中文字幕| 中文字幕的久久| 国产欧美视频在线观看| 久久久不卡网国产精品二区| 日韩免费电影一区| 欧美一区二区三区小说| 欧美日韩高清一区| 欧美日韩免费一区二区三区| 91官网在线观看| 色屁屁一区二区| 91麻豆高清视频| 一本大道久久a久久精品综合| av网站免费线看精品| 成人性色生活片| 成人免费视频视频| 成人午夜短视频| 粉嫩欧美一区二区三区高清影视 | 精品少妇一区二区三区免费观看| 9191成人精品久久| 欧美伦理影视网| 欧美巨大另类极品videosbest | 亚洲成人在线网站| 亚洲国产cao| 性久久久久久久久| 日本vs亚洲vs韩国一区三区| 免费成人美女在线观看| 麻豆91在线观看| 国产在线视频精品一区| 国产成人免费xxxxxxxx| 国产91精品入口| av成人免费在线| 91成人国产精品| 精品视频全国免费看| 91精品免费观看| 精品久久99ma| 国产午夜亚洲精品理论片色戒| 国产午夜精品理论片a级大结局| 中文无字幕一区二区三区| 国产精品视频一二三| 亚洲另类春色校园小说| 亚洲第一狼人社区| 男男成人高潮片免费网站| 久久66热re国产| 国产激情精品久久久第一区二区| 风间由美中文字幕在线看视频国产欧美| 成人黄色电影在线 | 日韩免费电影网站| 久久精品男人的天堂| 国产精品久久久久久久浪潮网站| 亚洲女与黑人做爰| 亚欧色一区w666天堂| 精品一区二区三区视频在线观看| 国产成人av福利| 色香色香欲天天天影视综合网| 欧美日本在线观看| 久久久亚洲精华液精华液精华液| 国产精品亲子乱子伦xxxx裸| 一区二区三区在线视频播放| 琪琪一区二区三区| 成人免费视频视频在线观看免费| 在线免费不卡电影| 欧美一级片免费看| 国产视频一区在线观看| 亚洲黄一区二区三区| 免费在线观看精品| 成人国产精品免费网站| 欧美亚男人的天堂| 2024国产精品视频| 一区二区三区在线免费播放| 裸体歌舞表演一区二区| 成人福利视频在线| 欧美日产在线观看| 亚洲国产精品高清| 日欧美一区二区| 国产成人久久精品77777最新版本| 色偷偷成人一区二区三区91| 日韩午夜电影av| 国产精品伦一区| 日韩中文字幕不卡| 成人性生交大合| 在线不卡欧美精品一区二区三区| 久久精品一区二区三区不卡| 香蕉久久夜色精品国产使用方法 | av男人天堂一区| 欧美精品日日鲁夜夜添| 国产清纯白嫩初高生在线观看91| 亚洲一区二区三区国产| 国产一区二区毛片| 欧美日韩一二区| 国产精品乱码久久久久久| 免费观看在线色综合| 91免费观看视频在线| 欧美成人在线直播| 又紧又大又爽精品一区二区| 精品国产三级a在线观看| 亚洲视频小说图片| 久久99在线观看| 在线视频欧美精品| 久久久久久99精品| 日韩—二三区免费观看av| www.日韩在线| 日韩欧美你懂的| 一区二区三区在线视频观看| 国产精品中文字幕一区二区三区| 欧美在线观看视频一区二区| 亚洲国产精品成人综合| 蜜桃久久精品一区二区| 欧美影视一区在线| 国产精品久久久久婷婷二区次| 久久99国产精品久久99| 欧美亚一区二区| 亚洲日本青草视频在线怡红院 | 欧美在线观看视频一区二区三区 | 亚洲视频一二三区| 国产一区二区美女| 日韩欧美高清在线| 午夜成人免费电影| 一本久久精品一区二区| 国产精品天天摸av网| 精品亚洲porn|