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

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? lcp.c

?? vxworks的源代碼
?? C
?? 第 1 頁(yè) / 共 3 頁(yè)
字號(hào):
    ACKCILQR(CI_QUALITY, go->neg_lqr, go->lqr_period);    ACKCILONG(CI_MAGICNUMBER, go->neg_magicnumber, go->magicnumber);    ACKCIVOID(CI_PCOMPRESSION, go->neg_pcompression);    ACKCIVOID(CI_ACCOMPRESSION, go->neg_accompression);    /*     * If there are any remaining CIs, then this packet is bad.     */    if (len != 0)	goto bad;    return (1);bad:    LCPDEBUG((LOG_WARNING, "lcp_acki: received bad Ack!"));    return (0);}/* * lcp_nakci - Peer has sent a NAK for some of our CIs. * This should not modify any state if the Nak is bad * or if LCP is in the OPENED state. * * Returns: *	0 - Nak was bad. *	1 - Nak was good. */static intlcp_nakci(f, p, len)    fsm *f;    u_char *p;    int len;{    lcp_options *go = &ppp_if[f->unit]->lcp_gotoptions;    lcp_options *wo = &ppp_if[f->unit]->lcp_wantoptions;    u_char cilen, citype, cichar, *next;    u_short cishort = 0;    u_long cilong;    lcp_options no;		/* options we've seen Naks for */    lcp_options try;		/* options to request next time */    int looped_back = 0;    BZERO((char *)&no, sizeof(no));    try = *go;    /*     * Any Nak'd CIs must be in exactly the same order that we sent.     * Check packet length and CI length at each step.     * If we find any deviations, then this packet is bad.     */#define NAKCIVOID(opt, neg, code) \    if (go->neg && \	len >= CILEN_VOID && \	p[1] == CILEN_VOID && \	p[0] == opt) { \	len -= CILEN_VOID; \	INCPTR(CILEN_VOID, p); \	no.neg = 1; \	code \    }#define NAKCICHAP(opt, neg, code) \    if (go->neg && \	len >= CILEN_CHAP && \	p[1] == CILEN_CHAP && \	p[0] == opt) { \	len -= CILEN_CHAP; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	GETCHAR(cichar, p); \	no.neg = 1; \	code \    }#define NAKCISHORT(opt, neg, code) \    if (go->neg && \	len >= CILEN_SHORT && \	p[1] == CILEN_SHORT && \	p[0] == opt) { \	len -= CILEN_SHORT; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	no.neg = 1; \	code \    }#define NAKCILONG(opt, neg, code) \    if (go->neg && \	len >= CILEN_LONG && \	p[1] == CILEN_LONG && \	p[0] == opt) { \	len -= CILEN_LONG; \	INCPTR(2, p); \	GETLONG(cilong, p); \	no.neg = 1; \	code \    }#define NAKCILQR(opt, neg, code) \    if (go->neg && \	len >= CILEN_LQR && \	p[1] == CILEN_LQR && \	p[0] == opt) { \	len -= CILEN_LQR; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	GETLONG(cilong, p); \	no.neg = 1; \	code \    }    /*     * We don't care if they want to send us smaller packets than     * we want.  Therefore, accept any MRU less than what we asked for,     * but then ignore the new value when setting the MRU in the kernel.     * If they send us a bigger MRU than what we asked, accept it, up to     * the limit of the default MRU we'd get if we didn't negotiate.     */    NAKCISHORT(CI_MRU, neg_mru,	       if (cishort <= wo->mru || cishort < DEFMRU)		   try.mru = cishort;	       );    /*     * Add any characters they want to our (receive-side) asyncmap.     */    NAKCILONG(CI_ASYNCMAP, neg_asyncmap,	      try.asyncmap = go->asyncmap | cilong;	      );    /*     * If they can't cope with our CHAP hash algorithm, we'll have     * to stop asking for CHAP.  We haven't got any other algorithm.     */    NAKCICHAP(CI_AUTHTYPE, neg_chap,	      try.neg_chap = 0;	      );    /*     * Peer shouldn't send Nak for UPAP, protocol compression or     * address/control compression requests; they should send     * a Reject instead.  If they send a Nak, treat it as a Reject.     */    if (!go->neg_chap ){	NAKCISHORT(CI_AUTHTYPE, neg_upap,		   try.neg_upap = 0;		   );    }    /*     * If they can't cope with our link quality protocol, we'll have     * to stop asking for LQR.  We haven't got any other protocol.     * If they Nak the reporting period, take their value XXX ?     */    NAKCILQR(CI_QUALITY, neg_lqr,	      if (cishort != LQR)		  try.neg_lqr = 0;	      else	          try.lqr_period = cilong;	      );    /*     * Check for a looped-back line.     */    NAKCILONG(CI_MAGICNUMBER, neg_magicnumber,	      try.magicnumber = magic();	      ++try.numloops;	      looped_back = 1;	      );    NAKCIVOID(CI_PCOMPRESSION, neg_pcompression,	      try.neg_pcompression = 0;	      );    NAKCIVOID(CI_ACCOMPRESSION, neg_accompression,	      try.neg_accompression = 0;	      );    /*     * There may be remaining CIs, if the peer is requesting negotiation     * on an option that we didn't include in our request packet.     * If we see an option that we requested, or one we've already seen     * in this packet, then this packet is bad.     * If we wanted to respond by starting to negotiate on the requested     * option(s), we could, but we don't, because except for the     * authentication type and quality protocol, if we are not negotiating     * an option, it is because we were told not to.     * For the authentication type, the Nak from the peer means     * `let me authenticate myself with you' which is a bit pointless.     * For the quality protocol, the Nak means `ask me to send you quality     * reports', but if we didn't ask for them, we don't want them.     */    while (len > CILEN_VOID) {	GETCHAR(citype, p);	GETCHAR(cilen, p);	if( (len -= cilen) < 0 )	    goto bad;	next = p + cilen - 2;	switch (citype) {	case CI_MRU:	    if (go->neg_mru || no.neg_mru || cilen != CILEN_SHORT)		goto bad;	    break;	case CI_ASYNCMAP:	    if (go->neg_asyncmap || no.neg_asyncmap || cilen != CILEN_LONG)		goto bad;	    break;	case CI_AUTHTYPE:	    if (go->neg_chap || no.neg_chap || go->neg_upap || no.neg_upap)		goto bad;	    break;	case CI_MAGICNUMBER:	    if (go->neg_magicnumber || no.neg_magicnumber ||		cilen != CILEN_LONG)		goto bad;	    break;	case CI_PCOMPRESSION:	    if (go->neg_pcompression || no.neg_pcompression		|| cilen != CILEN_VOID)		goto bad;	    break;	case CI_ACCOMPRESSION:	    if (go->neg_accompression || no.neg_accompression		|| cilen != CILEN_VOID)		goto bad;	    break;	case CI_QUALITY:	    if (go->neg_lqr || no.neg_lqr || cilen != CILEN_LQR)		goto bad;	    break;	default:	    goto bad;	}	p = next;    }    /* If there is still anything left, this packet is bad. */    if (len != 0)	goto bad;    /*     * OK, the Nak is good.  Now we can update state.     */    if (f->state != OPENED) {	*go = try;	if (looped_back && try.numloops % lcp_warnloops == 0)	    LCPDEBUG((LOG_INFO, "The line appears to be looped back."));    }    return 1;bad:    LCPDEBUG((LOG_WARNING, "lcp_nakci: received bad Nak!"));    return 0;}/* * lcp_rejci - Peer has Rejected some of our CIs. * This should not modify any state if the Reject is bad * or if LCP is in the OPENED state. * * Returns: *	0 - Reject was bad. *	1 - Reject was good. */static intlcp_rejci(f, p, len)    fsm *f;    u_char *p;    int len;{    lcp_options *go = &ppp_if[f->unit]->lcp_gotoptions;    u_char cichar = 0;    u_short cishort;    u_long cilong;#ifdef	DEBUGLCP    u_char *start = p;    int plen = len;#endif	/* DEBUGLCP */    lcp_options try;		/* options to request next time */    try = *go;    /*     * Any Rejected CIs must be in exactly the same order that we sent.     * Check packet length and CI length at each step.     * If we find any deviations, then this packet is bad.     */#define REJCIVOID(opt, neg) \    if (go->neg && \	len >= CILEN_VOID && \	p[1] == CILEN_VOID && \	p[0] == opt) { \	len -= CILEN_VOID; \	INCPTR(CILEN_VOID, p); \	try.neg = 0; \	LCPDEBUG((LOG_INFO, "lcp_rejci rejected void opt %d", opt)); \    }#define REJCISHORT(opt, neg, val) \    if (go->neg && \	len >= CILEN_SHORT && \	p[1] == CILEN_SHORT && \	p[0] == opt) { \	len -= CILEN_SHORT; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	/* Check rejected value. */ \	if (cishort != (u_short)val) \	    goto bad; \	try.neg = 0; \	LCPDEBUG((LOG_INFO,"lcp_rejci rejected short opt %d", opt)); \    }#define REJCICHAP(opt, neg, val, digest) \    if (go->neg && \	len >= CILEN_CHAP && \	p[1] == CILEN_CHAP && \	p[0] == opt) { \	len -= CILEN_CHAP; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	GETCHAR(cichar, p); \	/* Check rejected value. */ \	if (cishort != (u_short)val || cichar != (u_char)digest) \	    goto bad; \	try.neg = 0; \	LCPDEBUG((LOG_INFO,"lcp_rejci rejected chap opt %d", opt)); \    }#define REJCILONG(opt, neg, val) \    if (go->neg && \	len >= CILEN_LONG && \	p[1] == CILEN_LONG && \	p[0] == opt) { \	len -= CILEN_LONG; \	INCPTR(2, p); \	GETLONG(cilong, p); \	/* Check rejected value. */ \	if (cilong != (u_long)val) \	    goto bad; \	try.neg = 0; \	LCPDEBUG((LOG_INFO,"lcp_rejci rejected long opt %d", opt)); \    }#define REJCILQR(opt, neg, val) \    if (go->neg && \	len >= CILEN_LQR && \	p[1] == CILEN_LQR && \	p[0] == opt) { \	len -= CILEN_LQR; \	INCPTR(2, p); \	GETSHORT(cishort, p); \	GETLONG(cilong, p); \	/* Check rejected value. */ \	if (cishort != LQR || cilong != val) \	    goto bad; \	try.neg = 0; \	LCPDEBUG((LOG_INFO,"lcp_rejci rejected LQR opt %d", opt)); \    }    REJCISHORT(CI_MRU, neg_mru, go->mru);    REJCILONG(CI_ASYNCMAP, neg_asyncmap, go->asyncmap);    REJCICHAP(CI_AUTHTYPE, neg_chap, CHAP, go->chap_mdtype);    if (!go->neg_chap) {	REJCISHORT(CI_AUTHTYPE, neg_upap, UPAP);    }    REJCILQR(CI_QUALITY, neg_lqr, go->lqr_period);    REJCILONG(CI_MAGICNUMBER, neg_magicnumber, go->magicnumber);    REJCIVOID(CI_PCOMPRESSION, neg_pcompression);    REJCIVOID(CI_ACCOMPRESSION, neg_accompression);    /*     * If there are any remaining CIs, then this packet is bad.     */    if (len != 0)	goto bad;    /*     * Now we can update state.     */    if (f->state != OPENED)	*go = try;    return 1;bad:    LCPDEBUG((LOG_WARNING, "lcp_rejci: received bad Reject!"));    LCPDEBUG((LOG_WARNING, "lcp_rejci: plen %d len %d off %d",              plen, len, p - start));    return 0;}/* * lcp_reqci - Check the peer's requested CIs and send appropriate response. * * Returns: CONFACK, CONFNAK or CONFREJ and input packet modified * appropriately.  If reject_if_disagree is non-zero, doesn't return * CONFNAK; returns CONFREJ if it can't return CONFACK. */static intlcp_reqci(f, inp, lenp, reject_if_disagree)    fsm *f;    u_char *inp;                /* Requested CIs */    int *lenp;                  /* Length of requested CIs */    int reject_if_disagree;{    lcp_options *go = &ppp_if[f->unit]->lcp_gotoptions;    lcp_options *ho = &ppp_if[f->unit]->lcp_hisoptions;    lcp_options *ao = &ppp_if[f->unit]->lcp_allowoptions;    u_char *cip, *next;		/* Pointer to current and next CIs */    u_char cilen, citype = 0, cichar;/* Parsed len, type, char value */    u_short cishort;		/* Parsed short value */    u_long cilong;		/* Parse long value */    int rc = CONFACK;		/* Final packet return code */    int orc;			/* Individual option return code */    u_char *p;			/* Pointer to next char to parse */    u_char *rejp;		/* Pointer to next char in reject frame */    u_char *nakp;		/* Pointer to next char in Nak frame */    int l = *lenp;		/* Length left */    /*     * Reset all his options.     */    BZERO((char *)ho, sizeof(*ho));    /*     * Process all his options.     */    next = inp;    nakp = nak_buffer;    rejp = inp;    while (l) {	orc = CONFACK;			/* Assume success */	cip = p = next;			/* Remember begining of CI */	if (l < 2 ||			/* Not enough data for CI header or */	    p[1] < 2 ||			/*  CI length too small or */	    p[1] > l) {			/*  CI length too big? */	    LCPDEBUG((LOG_WARNING, "lcp_reqci: bad CI length!"));	    orc = CONFREJ;		/* Reject bad CI */	    cilen = l;			/* Reject till end of packet */	    l = 0;			/* Don't loop again */	    goto endswitch;	}	GETCHAR(citype, p);		/* Parse CI type */	GETCHAR(cilen, p);		/* Parse CI length */	l -= cilen;			/* Adjust remaining length */	next += cilen;			/* Step to next CI */	switch (citype) {		/* Check CI type */	case CI_MRU:	    LCPDEBUG((LOG_INFO, "lcp_reqci: rcvd MRU"));	    if (!ao->neg_mru ||		/* Allow option? */		cilen != CILEN_SHORT) {	/* Check CI length */		orc = CONFREJ;		/* Reject CI */		break;	    }	    GETSHORT(cishort, p);	/* Parse MRU */	    LCPDEBUG((LOG_INFO, "(%d)", cishort));	    /*	     * He must be able to receive at least our minimum.	     * No need to check a maximum.  If he sends a large number,	     * we'll just ignore it.	     */	    if (cishort < MINMRU) {		orc = CONFNAK;		/* Nak CI */		if( !reject_if_disagree ){		    DECPTR(sizeof (short), p);	/* Backup */		    PUTSHORT(MINMRU, p);	/* Give him a hint */		}		break;	    }	    ho->neg_mru = 1;		/* Remember he sent MRU */	    ho->mru = cishort;		/* And remember value */	    break;	case CI_ASYNCMAP:	    LCPDEBUG((LOG_INFO, "lcp_reqci: rcvd ASYNCMAP"));	    if (!ao->neg_asyncmap ||		cilen != CILEN_LONG) {		orc = CONFREJ;		break;	    }	    GETLONG(cilong, p);	    LCPDEBUG((LOG_INFO, "(%lx)", cilong));	    /*	     * Asyncmap must have set at least the bits	     * which are set in lcp_allowoptions[unit].asyncmap.	     */	    if ((ao->asyncmap & ~cilong) != 0) {		orc = CONFNAK;		if( !reject_if_disagree ){		    DECPTR(sizeof (long), p);		    PUTLONG(ao->asyncmap | cilong, p);		}		break;	    }	    ho->neg_asyncmap = 1;	    ho->asyncmap = cilong;	    break;	case CI_AUTHTYPE:	    LCPDEBUG((LOG_INFO, "lcp_reqci: rcvd AUTHTYPE"));	    if (cilen < CILEN_SHORT ||		!(ao->neg_upap || ao->neg_chap)) {		orc = CONFREJ;		if (!ao->neg_upap && !ao->neg_chap)		    LCPDEBUG((LOG_INFO, " we're not willing to authenticate"));		else		    LCPDEBUG((LOG_INFO, " cilen is too short!"));		break;	    }	    GETSHORT(cishort, p);	    LCPDEBUG((LOG_INFO, "(%x)", cishort));	    /*	     * Authtype must be UPAP or CHAP.	     *	     * Note: if both ao->neg_upap and ao->neg_chap are set,	     * and the peer sends a Configure-Request with two	     * authenticate-protocol requests, one for CHAP and one	     * for UPAP, then we will reject the second request.	     * Whether we end up doing CHAP or UPAP depends then on	     * the ordering of the CIs in the peer's Configure-Request.	     */	    if (cishort == UPAP) {		if (ho->neg_chap ||	/* we've already accepted CHAP */		    cilen != CILEN_SHORT) {		    LCPDEBUG((LOG_WARNING,			      "lcp_reqci: rcvd AUTHTYPE PAP, rejecting..."));		    orc = CONFREJ;		    break;		}		if (!ao->neg_upap) {	/* we don't want to do PAP */		    orc = CONFNAK;	/* NAK it and suggest CHAP */		    PUTCHAR(CI_AUTHTYPE, nakp);		    PUTCHAR(CILEN_CHAP, nakp);		    PUTSHORT(CHAP, nakp);		    PUTCHAR(ao->chap_mdtype, nakp);		    break;		}		ho->neg_upap = 1;		break;	    }	    if (cishort == CHAP) {		if (ho->neg_upap ||	/* we've already accepted PAP */		    cilen != CILEN_CHAP) {		    LCPDEBUG((LOG_INFO,			      "lcp_reqci: rcvd AUTHTYPE CHAP, rejecting..."));		    orc = CONFREJ;		    break;		}		if (!ao->neg_chap) {	/* we don't want to do CHAP */		    orc = CONFNAK;	/* NAK it and suggest PAP */		    PUTCHAR(CI_AUTHTYPE, nakp);		    PUTCHAR(CILEN_SHORT, nakp);		    PUTSHORT(UPAP, nakp);		    break;		}		GETCHAR(cichar, p);	/* get digest type*/		if (cichar != (u_char)ao->chap_mdtype) {		    orc = CONFNAK;		    PUTCHAR(CI_AUTHTYPE, nakp);		    PUTCHAR(CILEN_CHAP, nakp);		    PUTSHORT(CHAP, nakp);		    PUTCHAR(ao->chap_mdtype, nakp);		    break;		}		ho->chap_mdtype = cichar; /* save md type */		ho->neg_chap = 1;		break;	    }	    /*	     * We don't recognize the protocol they're asking for.	     * Nak it with something we're willing to do.	     * (At this point we know ao->neg_upap || ao->neg_chap.)	     */	    orc = CONFNAK;	    PUTCHAR(CI_AUTHTYPE, nakp);	    if (ao->neg_chap) {		PUTCHAR(CILEN_CHAP, nakp);		PUTSHORT(CHAP, nakp);

?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
亚洲精品欧美在线| 欧美少妇bbb| 91精品国产手机| 精品第一国产综合精品aⅴ| 亚洲午夜在线观看视频在线| 日韩国产欧美视频| 91官网在线免费观看| 久久久久久久国产精品影院| 洋洋av久久久久久久一区| 国产精品亚洲综合一区在线观看| 精品女同一区二区| 精品99久久久久久| 一区二区视频免费在线观看| 成人黄色一级视频| 99国产精品国产精品久久| 久久久亚洲高清| 日本在线观看不卡视频| 99re8在线精品视频免费播放| 国产日产欧产精品推荐色| 亚洲自拍偷拍综合| 色激情天天射综合网| 中文无字幕一区二区三区| 日韩二区三区四区| 欧美精品第1页| 欧美一级久久久久久久大片| 日本美女视频一区二区| 欧洲生活片亚洲生活在线观看| 国产亚洲综合在线| 国产精品亚洲人在线观看| 欧美性一二三区| 洋洋成人永久网站入口| 91免费小视频| 精品国产制服丝袜高跟| 久久99精品久久久久久动态图 | 首页国产欧美日韩丝袜| 久久99精品久久久久婷婷| 日韩欧美一二三四区| 蜜臀久久久99精品久久久久久| 在线观看欧美精品| 一区二区在线免费观看| 久久99精品国产麻豆婷婷| 精品国产三级电影在线观看| 久久av资源站| 日韩精品在线一区二区| 国产一区二区三区黄视频| 欧美日韩亚洲综合在线| 天天综合日日夜夜精品| 欧美性色综合网| 有坂深雪av一区二区精品| 欧美日韩在线播放一区| 国产精品网友自拍| 91蝌蚪国产九色| 亚洲福利一二三区| 5566中文字幕一区二区电影| 久久综合99re88久久爱| 五月婷婷综合网| 欧美不卡视频一区| 成人黄色片在线观看| 中文字幕成人av| 国产精品18久久久久| 国产视频一区在线播放| 色悠悠久久综合| 一区二区免费在线播放| 欧美日韩国产综合一区二区| 老鸭窝一区二区久久精品| 久久在线观看免费| 国产一区二区三区观看| 亚洲素人一区二区| 在线播放中文一区| 国产乱码精品一区二区三区忘忧草 | 国产亚洲精品aa午夜观看| 国产成人丝袜美腿| 久久久久久黄色| 99国产精品久久久久久久久久久| 亚洲免费av网站| 欧美日韩一区在线观看| 九色综合国产一区二区三区| 日韩欧美国产一区二区三区 | 国产在线一区二区综合免费视频| 6080yy午夜一二三区久久| 国产最新精品精品你懂的| 欧美国产精品专区| 国产999精品久久久久久| 亚洲欧美日韩一区| 欧美一区二区国产| 精品一区二区日韩| 亚洲欧美日韩国产手机在线| 国产99久久久精品| 爽爽淫人综合网网站| 中文字幕精品在线不卡| 国产一区二三区| 一区二区三区久久| 精品999在线播放| 成人在线视频首页| 日日欢夜夜爽一区| 国产亚洲va综合人人澡精品| 91丨国产丨九色丨pron| 免费不卡在线观看| 久久日韩精品一区二区五区| 日本精品裸体写真集在线观看| 蜜臀av性久久久久蜜臀aⅴ| 久久综合狠狠综合久久综合88 | 久久精品av麻豆的观看方式| 自拍偷拍国产精品| 91影视在线播放| 国产精品一区二区三区99| 午夜视频在线观看一区二区| 亚洲国产精品传媒在线观看| 777午夜精品视频在线播放| 韩国女主播成人在线| 中文字幕 久热精品 视频在线| 欧美一区二区精美| 91极品视觉盛宴| 国产91精品欧美| 久久99精品久久久| 午夜电影一区二区| 亚洲精品中文字幕乱码三区| 久久精品一二三| 精品日韩一区二区三区 | 国产麻豆一精品一av一免费| 亚洲成av人片一区二区| 欧美一区二区女人| 国产很黄免费观看久久| 亚洲日本在线观看| 欧美人与z0zoxxxx视频| 黄色日韩三级电影| 亚洲精品视频在线| 精品国内二区三区| 国产成人啪午夜精品网站男同| 日韩国产欧美在线观看| 亚洲少妇30p| 国产精品第一页第二页第三页| 久久精品一区二区三区四区| 欧美日韩免费视频| 欧美三级日本三级少妇99| 91免费观看在线| jlzzjlzz亚洲日本少妇| 国产成人精品在线看| 久久爱www久久做| 欧美日韩中文一区| 亚洲色图欧美偷拍| 日本一区二区三区国色天香| 日韩欧美中文一区| 欧美丰满少妇xxxxx高潮对白| 在线观看精品一区| 日本高清不卡aⅴ免费网站| av中文一区二区三区| www.66久久| 91亚洲大成网污www| 91在线国产观看| 91视频com| 色播五月激情综合网| 91国偷自产一区二区使用方法| www.亚洲精品| 99久久久久久| 91福利在线看| 欧美亚洲综合一区| 欧美日本一道本| 欧美肥妇bbw| 日韩一二三区不卡| 欧美成人欧美edvon| 久久精品在线观看| 国产精品久久毛片av大全日韩| 1000部国产精品成人观看| 亚洲男人电影天堂| 亚洲国产精品视频| 天堂资源在线中文精品| 免费成人你懂的| 国产精品18久久久久久vr| 成人免费高清在线观看| 色呦呦网站一区| 欧美精品久久久久久久多人混战| 欧美一区二区日韩一区二区| 久久免费看少妇高潮| 亚洲国产精品t66y| 一区二区三区加勒比av| 日韩中文字幕不卡| 国产精品自拍在线| 91一区二区三区在线观看| 精品视频在线免费观看| 欧美成人性战久久| 国产精品久久久久久久久动漫| 亚洲欧美区自拍先锋| 日韩精品一二区| 国产成人免费在线观看| 97精品国产露脸对白| 欧美日韩国产不卡| 久久久久国产精品麻豆ai换脸| 最新热久久免费视频| 日韩成人免费看| 国产精品综合一区二区| 99精品久久久久久| 欧美日韩国产大片| 国产亚洲一区二区在线观看| 亚洲激情图片小说视频| 蜜乳av一区二区三区| 成人av资源下载| 欧美电影在线免费观看| 久久精品一区二区三区不卡牛牛 | 亚洲欧洲美洲综合色网|