003 File Manager
Current Path:
/usr/src/contrib/ntp/sntp/libopts
usr
/
src
/
contrib
/
ntp
/
sntp
/
libopts
/
📁
..
📄
COPYING.gplv3
(34.34 KB)
📄
COPYING.lgplv3
(7.45 KB)
📄
COPYING.mbsd
(1.41 KB)
📄
MakeDefs.inc
(0 B)
📄
Makefile.am
(2.51 KB)
📄
Makefile.in
(27.52 KB)
📄
README
(4.84 KB)
📄
ag-char-map.h
(26.67 KB)
📄
alias.c
(3.26 KB)
📄
ao-strs.c
(13.82 KB)
📄
ao-strs.h
(14.02 KB)
📁
autoopts
📄
autoopts.c
(11.94 KB)
📄
autoopts.h
(12.96 KB)
📄
boolean.c
(2.45 KB)
📄
check.c
(4.84 KB)
📁
compat
📄
configfile.c
(35.76 KB)
📄
cook.c
(9.18 KB)
📄
enum.c
(18.09 KB)
📄
env.c
(7.17 KB)
📄
file.c
(5.67 KB)
📄
find.c
(22 KB)
📄
genshell.c
(30.64 KB)
📄
genshell.h
(7.77 KB)
📄
gettext.h
(9.79 KB)
📄
init.c
(8.42 KB)
📄
intprops.h
(14.58 KB)
📄
libopts.c
(1.06 KB)
📄
load.c
(15.98 KB)
📁
m4
📄
makeshell.c
(24.36 KB)
📄
nested.c
(24.33 KB)
📄
numeric.c
(5.05 KB)
📄
option-value-type.c
(5.5 KB)
📄
option-value-type.h
(2.36 KB)
📄
option-xat-attribute.c
(5.04 KB)
📄
option-xat-attribute.h
(2.25 KB)
📄
parse-duration.c
(12.11 KB)
📄
parse-duration.h
(3.32 KB)
📄
pgusage.c
(4.89 KB)
📄
proto.h
(2.73 KB)
📄
putshell.c
(14.62 KB)
📄
reset.c
(3.84 KB)
📄
restore.c
(6.82 KB)
📄
save.c
(20.53 KB)
📄
sort.c
(9.84 KB)
📄
stack.c
(7.23 KB)
📄
stdnoreturn.in.h
(1.77 KB)
📄
streqvcmp.c
(8.14 KB)
📄
text_mmap.c
(11.05 KB)
📄
time.c
(3.77 KB)
📄
tokenize.c
(8.99 KB)
📄
usage.c
(38.19 KB)
📄
version.c
(6.11 KB)
Editing: stack.c
/** * \file stack.c * * This is a special option processing routine that will save the * argument to an option in a FIFO queue. * * @addtogroup autoopts * @{ */ /* * This file is part of AutoOpts, a companion to AutoGen. * AutoOpts is free software. * AutoOpts is Copyright (C) 1992-2015 by Bruce Korb - all rights reserved * * AutoOpts is available under any one of two licenses. The license * in use must be one of these two and the choice is under the control * of the user of the license. * * The GNU Lesser General Public License, version 3 or later * See the files "COPYING.lgplv3" and "COPYING.gplv3" * * The Modified Berkeley Software Distribution License * See the file "COPYING.mbsd" * * These files have the following sha256 sums: * * 8584710e9b04216a394078dc156b781d0b47e1729104d666658aecef8ee32e95 COPYING.gplv3 * 4379e7444a0e2ce2b12dd6f5a52a27a4d02d39d247901d3285c88cf0d37f477b COPYING.lgplv3 * 13aa749a5b0a454917a944ed8fffc530b784f5ead522b1aacaf4ec8aa55a6239 COPYING.mbsd */ #ifdef WITH_LIBREGEX # include REGEX_HEADER #endif /*=export_func optionUnstackArg * private: * * what: Remove option args from a stack * arg: + tOptions * + opts + program options descriptor + * arg: + tOptDesc * + od + the descriptor for this arg + * * doc: * Invoked for options that are equivalenced to stacked options. =*/ void optionUnstackArg(tOptions * opts, tOptDesc * od) { tArgList * arg_list; if (INQUERY_CALL(opts, od)) return; arg_list = (tArgList *)od->optCookie; /* * IF we don't have any stacked options, * THEN indicate that we don't have any of these options */ if (arg_list == NULL) { od->fOptState &= OPTST_PERSISTENT_MASK; if ((od->fOptState & OPTST_INITENABLED) == 0) od->fOptState |= OPTST_DISABLED; return; } #ifdef WITH_LIBREGEX { regex_t re; int i, ct, dIdx; if (regcomp(&re, od->optArg.argString, REG_NOSUB) != 0) return; /* * search the list for the entry(s) to remove. Entries that * are removed are *not* copied into the result. The source * index is incremented every time. The destination only when * we are keeping a define. */ for (i = 0, dIdx = 0, ct = arg_list->useCt; --ct >= 0; i++) { char const * pzSrc = arg_list->apzArgs[ i ]; char * pzEq = strchr(pzSrc, '='); int res; if (pzEq != NULL) *pzEq = NUL; res = regexec(&re, pzSrc, (size_t)0, NULL, 0); switch (res) { case 0: /* * Remove this entry by reducing the in-use count * and *not* putting the string pointer back into * the list. */ AGFREE(pzSrc); arg_list->useCt--; break; default: case REG_NOMATCH: if (pzEq != NULL) *pzEq = '='; /* * IF we have dropped an entry * THEN we have to move the current one. */ if (dIdx != i) arg_list->apzArgs[ dIdx ] = pzSrc; dIdx++; } } regfree(&re); } #else /* not WITH_LIBREGEX */ { int i, ct, dIdx; /* * search the list for the entry(s) to remove. Entries that * are removed are *not* copied into the result. The source * index is incremented every time. The destination only when * we are keeping a define. */ for (i = 0, dIdx = 0, ct = arg_list->useCt; --ct >= 0; i++) { const char * pzSrc = arg_list->apzArgs[ i ]; char * pzEq = strchr(pzSrc, '='); if (pzEq != NULL) *pzEq = NUL; if (strcmp(pzSrc, od->optArg.argString) == 0) { /* * Remove this entry by reducing the in-use count * and *not* putting the string pointer back into * the list. */ AGFREE(pzSrc); arg_list->useCt--; } else { if (pzEq != NULL) *pzEq = '='; /* * IF we have dropped an entry * THEN we have to move the current one. */ if (dIdx != i) arg_list->apzArgs[ dIdx ] = pzSrc; dIdx++; } } } #endif /* WITH_LIBREGEX */ /* * IF we have unstacked everything, * THEN indicate that we don't have any of these options */ if (arg_list->useCt == 0) { od->fOptState &= OPTST_PERSISTENT_MASK; if ((od->fOptState & OPTST_INITENABLED) == 0) od->fOptState |= OPTST_DISABLED; AGFREE(arg_list); od->optCookie = NULL; } } /* * Put an entry into an argument list. The first argument points to * a pointer to the argument list structure. It gets passed around * as an opaque address. */ LOCAL void addArgListEntry(void ** ppAL, void * entry) { tArgList * pAL = *(void **)ppAL; /* * IF we have never allocated one of these, * THEN allocate one now */ if (pAL == NULL) { pAL = (tArgList *)AGALOC(sizeof(*pAL), "new option arg stack"); if (pAL == NULL) return; pAL->useCt = 0; pAL->allocCt = MIN_ARG_ALLOC_CT; *ppAL = VOIDP(pAL); } /* * ELSE if we are out of room * THEN make it bigger */ else if (pAL->useCt >= pAL->allocCt) { size_t sz = sizeof(*pAL); pAL->allocCt += INCR_ARG_ALLOC_CT; /* * The base structure contains space for MIN_ARG_ALLOC_CT * pointers. We subtract it off to find our augment size. */ sz += sizeof(char *) * ((size_t)pAL->allocCt - MIN_ARG_ALLOC_CT); pAL = (tArgList *)AGREALOC(VOIDP(pAL), sz, "expanded opt arg stack"); if (pAL == NULL) return; *ppAL = VOIDP(pAL); } /* * Insert the new argument into the list */ pAL->apzArgs[ (pAL->useCt)++ ] = entry; } /*=export_func optionStackArg * private: * * what: put option args on a stack * arg: + tOptions * + opts + program options descriptor + * arg: + tOptDesc * + od + the descriptor for this arg + * * doc: * Keep an entry-ordered list of option arguments. =*/ void optionStackArg(tOptions * opts, tOptDesc * od) { char * pz; if (INQUERY_CALL(opts, od)) return; if ((od->fOptState & OPTST_RESET) != 0) { tArgList * arg_list = od->optCookie; int ix; if (arg_list == NULL) return; ix = arg_list->useCt; while (--ix >= 0) AGFREE(arg_list->apzArgs[ix]); AGFREE(arg_list); } else { if (od->optArg.argString == NULL) return; AGDUPSTR(pz, od->optArg.argString, "stack arg"); addArgListEntry(&(od->optCookie), VOIDP(pz)); } } /** @} * * Local Variables: * mode: C * c-file-style: "stroustrup" * indent-tabs-mode: nil * End: * end of autoopts/stack.c */
Upload File
Create Folder