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

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

?? getopt.c

?? 另一個(gè)版本的x264的decoder
?? C
字號(hào):
/*	$NetBSD: getopt_long.c,v 1.15 2002/01/31 22:43:40 tv Exp $	*//*- * Copyright (c) 2000 The NetBSD Foundation, Inc. * All rights reserved. * * This code is derived from software contributed to The NetBSD Foundation * by Dieter Baron and Thomas Klausner. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in the *    documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software *    must display the following acknowledgement: *        This product includes software developed by the NetBSD *        Foundation, Inc. and its contributors. * 4. Neither the name of The NetBSD Foundation nor the names of its *    contributors may be used to endorse or promote products derived *    from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */#include <assert.h>#include <errno.h>#include <stdlib.h>#include <string.h>#include "getopt.h"#include <stdarg.h>#include <stdio.h>#define REPLACE_GETOPT#define _DIAGASSERT(x) do {} while (0)#ifdef REPLACE_GETOPT#ifdef __weak_alias__weak_alias(getopt,_getopt)#endifint opterr = 1;	/* if error message should be printed */int optind = 1;	/* index into parent argv vector */int optopt = '?';	/* character checked for validity */int optreset;	/* reset getopt */char *optarg;	/* argument associated with option */#endif#ifdef __weak_alias__weak_alias(getopt_long,_getopt_long)#endif#ifndef __CYGWIN__#define __progname __argv[0]#elseextern char *__progname;#endif#define IGNORE_FIRST	(*options == '-' || *options == '+')#define PRINT_ERROR	((opterr) && ((*options != ':') \				      || (IGNORE_FIRST && options[1] != ':')))#define IS_POSIXLY_CORRECT (getenv("POSIXLY_INCORRECT_GETOPT") == NULL)#define PERMUTE         (!IS_POSIXLY_CORRECT && !IGNORE_FIRST)/* XXX: GNU ignores PC if *options == '-' */#define IN_ORDER        (!IS_POSIXLY_CORRECT && *options == '-')/* return values */#define	BADCH	(int)'?'#define	BADARG		((IGNORE_FIRST && options[1] == ':') \			 || (*options == ':') ? (int)':' : (int)'?')#define INORDER (int)1static char EMSG[1];static int getopt_internal (int, char * const *, const char *);static int gcd (int, int);static void permute_args (int, int, int, char * const *);static char *place = EMSG; /* option letter processing *//* XXX: set optreset to 1 rather than these two */static int nonopt_start = -1; /* first non option argument (for permute) */static int nonopt_end = -1;   /* first option after non options (for permute) *//* Error messages */static const char recargchar[] = "option requires an argument -- %c";static const char recargstring[] = "option requires an argument -- %s";static const char ambig[] = "ambiguous option -- %.*s";static const char noarg[] = "option doesn't take an argument -- %.*s";static const char illoptchar[] = "unknown option -- %c";static const char illoptstring[] = "unknown option -- %s";static void_vwarnx(const char *fmt, va_list ap){  (void)fprintf(stderr, "%s: ", __progname);  if (fmt != NULL)    (void)vfprintf(stderr, fmt, ap);  (void)fprintf(stderr, "\n");}static voidwarnx(const char *fmt, ...){  va_list ap;  va_start(ap, fmt);  _vwarnx(fmt, ap);  va_end(ap);}/* * Compute the greatest common divisor of a and b. */static intgcd(a, b)	int a;	int b;{	int c;	c = a % b;	while (c != 0) {		a = b;		b = c;		c = a % b;	}	return b;}/* * Exchange the block from nonopt_start to nonopt_end with the block * from nonopt_end to opt_end (keeping the same order of arguments * in each block). */static voidpermute_args(panonopt_start, panonopt_end, opt_end, nargv)	int panonopt_start;	int panonopt_end;	int opt_end;	char * const *nargv;{	int cstart, cyclelen, i, j, ncycle, nnonopts, nopts, pos;	char *swap;	_DIAGASSERT(nargv != NULL);	/*	 * compute lengths of blocks and number and size of cycles	 */	nnonopts = panonopt_end - panonopt_start;	nopts = opt_end - panonopt_end;	ncycle = gcd(nnonopts, nopts);	cyclelen = (opt_end - panonopt_start) / ncycle;	for (i = 0; i < ncycle; i++) {		cstart = panonopt_end+i;		pos = cstart;		for (j = 0; j < cyclelen; j++) {			if (pos >= panonopt_end)				pos -= nnonopts;			else				pos += nopts;			swap = nargv[pos];			/* LINTED const cast */			((char **) nargv)[pos] = nargv[cstart];			/* LINTED const cast */			((char **)nargv)[cstart] = swap;		}	}}/* * getopt_internal -- *	Parse argc/argv argument vector.  Called by user level routines. *  Returns -2 if -- is found (can be long option or end of options marker). */static intgetopt_internal(nargc, nargv, options)	int nargc;	char * const *nargv;	const char *options;{	char *oli;				/* option letter list index */	int optchar;	_DIAGASSERT(nargv != NULL);	_DIAGASSERT(options != NULL);	optarg = NULL;	/*	 * XXX Some programs (like rsyncd) expect to be able to	 * XXX re-initialize optind to 0 and have getopt_long(3)	 * XXX properly function again.  Work around this braindamage.	 */	if (optind == 0)		optind = 1;	if (optreset)		nonopt_start = nonopt_end = -1;start:	if (optreset || !*place) {		/* update scanning pointer */		optreset = 0;		if (optind >= nargc) {          /* end of argument vector */			place = EMSG;			if (nonopt_end != -1) {				/* do permutation, if we have to */				permute_args(nonopt_start, nonopt_end,				    optind, nargv);				optind -= nonopt_end - nonopt_start;			}			else if (nonopt_start != -1) {				/*				 * If we skipped non-options, set optind				 * to the first of them.				 */				optind = nonopt_start;			}			nonopt_start = nonopt_end = -1;			return -1;		}		if ((*(place = nargv[optind]) != '-')		    || (place[1] == '\0')) {    /* found non-option */			place = EMSG;			if (IN_ORDER) {				/*				 * GNU extension:				 * return non-option as argument to option 1				 */				optarg = nargv[optind++];				return INORDER;			}			if (!PERMUTE) {				/*				 * if no permutation wanted, stop parsing				 * at first non-option				 */				return -1;			}			/* do permutation */			if (nonopt_start == -1)				nonopt_start = optind;			else if (nonopt_end != -1) {				permute_args(nonopt_start, nonopt_end,				    optind, nargv);				nonopt_start = optind -				    (nonopt_end - nonopt_start);				nonopt_end = -1;			}			optind++;			/* process next argument */			goto start;		}		if (nonopt_start != -1 && nonopt_end == -1)			nonopt_end = optind;		if (place[1] && *++place == '-') {	/* found "--" */			place++;			return -2;		}	}	if ((optchar = (int)*place++) == (int)':' ||	    (oli = strchr(options + (IGNORE_FIRST ? 1 : 0), optchar)) == NULL) {		/* option letter unknown or ':' */		if (!*place)			++optind;		if (PRINT_ERROR)			warnx(illoptchar, optchar);		optopt = optchar;		return BADCH;	}	if (optchar == 'W' && oli[1] == ';') {		/* -W long-option */		/* XXX: what if no long options provided (called by getopt)? */		if (*place)			return -2;		if (++optind >= nargc) {	/* no arg */			place = EMSG;			if (PRINT_ERROR)				warnx(recargchar, optchar);			optopt = optchar;			return BADARG;		} else				/* white space */			place = nargv[optind];		/*		 * Handle -W arg the same as --arg (which causes getopt to		 * stop parsing).		 */		return -2;	}	if (*++oli != ':') {			/* doesn't take argument */		if (!*place)			++optind;	} else {				/* takes (optional) argument */		optarg = NULL;		if (*place)			/* no white space */			optarg = place;		/* XXX: disable test for :: if PC? (GNU doesn't) */		else if (oli[1] != ':') {	/* arg not optional */			if (++optind >= nargc) {	/* no arg */				place = EMSG;				if (PRINT_ERROR)					warnx(recargchar, optchar);				optopt = optchar;				return BADARG;			} else				optarg = nargv[optind];		}		place = EMSG;		++optind;	}	/* dump back option letter */	return optchar;}#ifdef REPLACE_GETOPT/* * getopt -- *	Parse argc/argv argument vector. * * [eventually this will replace the real getopt] */intgetopt(nargc, nargv, options)	int nargc;	char * const *nargv;	const char *options;{	int retval;	_DIAGASSERT(nargv != NULL);	_DIAGASSERT(options != NULL);	if ((retval = getopt_internal(nargc, nargv, options)) == -2) {		++optind;		/*		 * We found an option (--), so if we skipped non-options,		 * we have to permute.		 */		if (nonopt_end != -1) {			permute_args(nonopt_start, nonopt_end, optind,				       nargv);			optind -= nonopt_end - nonopt_start;		}		nonopt_start = nonopt_end = -1;		retval = -1;	}	return retval;}#endif/* * getopt_long -- *	Parse argc/argv argument vector. */intgetopt_long(nargc, nargv, options, long_options, idx)	int nargc;	char * const *nargv;	const char *options;	const struct option *long_options;	int *idx;{	int retval;	_DIAGASSERT(nargv != NULL);	_DIAGASSERT(options != NULL);	_DIAGASSERT(long_options != NULL);	/* idx may be NULL */	if ((retval = getopt_internal(nargc, nargv, options)) == -2) {		char *current_argv, *has_equal;		size_t current_argv_len;		int i, match;		current_argv = place;		match = -1;		optind++;		place = EMSG;		if (*current_argv == '\0') {		/* found "--" */			/*			 * We found an option (--), so if we skipped			 * non-options, we have to permute.			 */			if (nonopt_end != -1) {				permute_args(nonopt_start, nonopt_end,				    optind, nargv);				optind -= nonopt_end - nonopt_start;			}			nonopt_start = nonopt_end = -1;			return -1;		}		if ((has_equal = strchr(current_argv, '=')) != NULL) {			/* argument found (--option=arg) */			current_argv_len = has_equal - current_argv;			has_equal++;		} else			current_argv_len = strlen(current_argv);		for (i = 0; long_options[i].name; i++) {			/* find matching long option */			if (strncmp(current_argv, long_options[i].name,			    current_argv_len))				continue;			if (strlen(long_options[i].name) ==			    (unsigned)current_argv_len) {				/* exact match */				match = i;				break;			}			if (match == -1)		/* partial match */				match = i;			else {				/* ambiguous abbreviation */				if (PRINT_ERROR)					warnx(ambig, (int)current_argv_len,					     current_argv);				optopt = 0;				return BADCH;			}		}		if (match != -1) {			/* option found */			if (long_options[match].has_arg == no_argument			    && has_equal) {				if (PRINT_ERROR)					warnx(noarg, (int)current_argv_len,					     current_argv);				/*				 * XXX: GNU sets optopt to val regardless of				 * flag				 */				if (long_options[match].flag == NULL)					optopt = long_options[match].val;				else					optopt = 0;				return BADARG;			}			if (long_options[match].has_arg == required_argument ||			    long_options[match].has_arg == optional_argument) {				if (has_equal)					optarg = has_equal;				else if (long_options[match].has_arg ==				    required_argument) {					/*					 * optional argument doesn't use					 * next nargv					 */					optarg = nargv[optind++];				}			}			if ((long_options[match].has_arg == required_argument)			    && (optarg == NULL)) {				/*				 * Missing argument; leading ':'				 * indicates no error should be generated				 */				if (PRINT_ERROR)					warnx(recargstring, current_argv);				/*				 * XXX: GNU sets optopt to val regardless				 * of flag				 */				if (long_options[match].flag == NULL)					optopt = long_options[match].val;				else					optopt = 0;				--optind;				return BADARG;			}		} else {			/* unknown option */			if (PRINT_ERROR)				warnx(illoptstring, current_argv);			optopt = 0;			return BADCH;		}		if (long_options[match].flag) {			*long_options[match].flag = long_options[match].val;			retval = 0;		} else			retval = long_options[match].val;		if (idx)			*idx = match;	}	return retval;}

?? 快捷鍵說(shuō)明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號(hào) Ctrl + =
減小字號(hào) Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
久久这里只精品最新地址| 一区二区三区四区激情| 欧美一区二区三区喷汁尤物| 欧洲国产伦久久久久久久| 91亚洲午夜精品久久久久久| 成人午夜视频福利| 国产mv日韩mv欧美| 丰满少妇久久久久久久| 成人永久免费视频| 成人app在线| 91同城在线观看| 色婷婷亚洲一区二区三区| 91在线视频官网| 色av综合在线| 欧美网站一区二区| 欧美老女人第四色| 欧美日韩国产首页| 91麻豆精品国产无毒不卡在线观看| 亚洲色图制服诱惑| 亚洲精品久久久蜜桃| 亚洲影院免费观看| 日本大胆欧美人术艺术动态| 日韩福利电影在线| 韩国精品免费视频| 成人一道本在线| 色综合久久久久| 欧美美女视频在线观看| 日韩欧美在线网站| 久久综合狠狠综合久久激情| 日本一区二区三区在线不卡 | 国产日韩在线不卡| 欧美成人三级在线| 国产色产综合产在线视频| 国产精品三级视频| 一区二区三区波多野结衣在线观看| 亚洲成人你懂的| 极品销魂美女一区二区三区| 粉嫩在线一区二区三区视频| 91捆绑美女网站| 欧美一区二区二区| 中文字幕在线观看一区| 亚洲一区二区三区四区中文字幕| 日本人妖一区二区| 高清不卡一区二区| 精品视频色一区| 久久综合av免费| 亚洲欧美电影一区二区| 日本成人超碰在线观看| 高清国产午夜精品久久久久久| 欧美中文一区二区三区| 精品国产成人系列| 亚洲精品日日夜夜| 国内成+人亚洲+欧美+综合在线| 成人av网址在线| 欧美日韩国产美| 国产日韩欧美高清在线| 一区二区三区蜜桃| 国产精品888| 欧美日韩黄色影视| 国产精品久线观看视频| 麻豆精品一区二区综合av| av高清不卡在线| 日韩免费在线观看| 亚洲一区二区欧美| 丁香一区二区三区| 欧美一区二区成人6969| 日韩理论片在线| 精品午夜一区二区三区在线观看| 一本色道久久加勒比精品| 精品91自产拍在线观看一区| 亚洲综合无码一区二区| 粉嫩av一区二区三区在线播放| 3d成人动漫网站| 一区二区三区欧美| 成人黄色在线网站| 精品国精品国产| 日韩电影免费一区| 欧美无砖专区一中文字| 成人免费在线播放视频| 国产精品乡下勾搭老头1| 91精品久久久久久久91蜜桃| 亚洲免费视频中文字幕| 成人国产免费视频| 2欧美一区二区三区在线观看视频 337p粉嫩大胆噜噜噜噜噜91av | 一区二区三区中文字幕| 国产一区二区三区在线看麻豆| 欧美日韩大陆在线| 亚洲宅男天堂在线观看无病毒| 成人国产电影网| 国产视频一区二区三区在线观看| 日韩av电影免费观看高清完整版| 中文字幕欧美激情一区| 看电视剧不卡顿的网站| 欧美色倩网站大全免费| 亚洲一区中文日韩| 91免费国产在线观看| 中文字幕一区在线观看| 国产精品一级在线| 国产日韩欧美激情| 国产毛片一区二区| 26uuuu精品一区二区| 日日摸夜夜添夜夜添国产精品| 欧美无砖专区一中文字| 一区二区三区在线观看欧美| eeuss鲁片一区二区三区在线观看| 久久久电影一区二区三区| 韩国成人福利片在线播放| 日韩欧美久久一区| 另类调教123区| 日韩一级免费观看| 久久国产精品99久久久久久老狼| 日韩一区二区三区电影| 免费成人在线视频观看| 日韩欧美亚洲另类制服综合在线| 日韩综合小视频| 日韩无一区二区| 久久99国产精品久久99果冻传媒| 精品国产精品网麻豆系列| 久久99热国产| 久久综合色之久久综合| 国产黄色91视频| 国产精品久久影院| 欧美综合一区二区三区| 天堂一区二区在线免费观看| 91精品国产色综合久久不卡电影| 热久久国产精品| 久久久亚洲精华液精华液精华液 | 欧美一区二区三区视频免费播放| 日日摸夜夜添夜夜添精品视频| 日韩欧美一级二级三级久久久| 国产麻豆一精品一av一免费| 欧美国产国产综合| 91黄色激情网站| 日本午夜精品一区二区三区电影| 精品久久人人做人人爰| av成人动漫在线观看| 亚洲午夜一区二区三区| 欧美xxxx老人做受| 成人午夜在线播放| 亚洲图片欧美综合| 精品少妇一区二区| 91免费看片在线观看| 日韩高清一区二区| 日本一区二区综合亚洲| 欧美日韩卡一卡二| 国产一区视频网站| 亚洲综合在线视频| 久久综合精品国产一区二区三区| 91丨九色porny丨蝌蚪| 免费成人在线影院| 1000精品久久久久久久久| 3d成人h动漫网站入口| 大白屁股一区二区视频| 性做久久久久久久免费看| 国产片一区二区| 欧美卡1卡2卡| 波多野结衣中文字幕一区| 肉丝袜脚交视频一区二区| 国产精品美女久久久久aⅴ国产馆 国产精品美女久久久久av爽李琼 国产精品美女久久久久高潮 | 国产三区在线成人av| 欧美手机在线视频| 国产suv一区二区三区88区| 亚洲午夜成aⅴ人片| 国产精品水嫩水嫩| 日韩一卡二卡三卡四卡| 色诱视频网站一区| 国产麻豆成人传媒免费观看| 性欧美疯狂xxxxbbbb| 中文字幕免费不卡| 精品日产卡一卡二卡麻豆| 欧美影片第一页| 不卡电影一区二区三区| 精品中文字幕一区二区小辣椒 | 91日韩一区二区三区| 精品一区二区三区视频在线观看| 一区二区三区精品久久久| 国产婷婷精品av在线| 日韩欧美专区在线| 欧美在线观看视频一区二区三区 | 精品国产一区二区三区忘忧草| 色综合久久久久综合99| 国产另类ts人妖一区二区| 日韩精品1区2区3区| 亚洲激情图片qvod| 亚洲欧洲日韩在线| 中文字幕电影一区| 久久综合色8888| 在线不卡欧美精品一区二区三区| 91美女片黄在线观看91美女| 国产不卡高清在线观看视频| 久久成人免费电影| 日韩黄色免费网站| 亚洲成人综合视频| 亚洲一区自拍偷拍| 一区二区三区 在线观看视频| 中文字幕一区二区三区在线观看 | 精品国产网站在线观看| 制服丝袜在线91| 欧美精品丝袜中出| 精品视频1区2区3区|