Prex Home / Browse Source - Prex Version: 0.9.0

root/usr/lib/libc/stdlib/getsubopt.c

/* [<][>][^][v][top][bottom][index][help] */

DEFINITIONS

This source file includes following definitions.
  1. getsubopt

   1 /*-
   2  * Copyright (c) 1990, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  */
  29 
  30 #include <unistd.h>
  31 #include <stdlib.h>
  32 #include <string.h>
  33 
  34 /*
  35  * The SVID interface to getsubopt provides no way of figuring out which
  36  * part of the suboptions list wasn't matched.  This makes error messages
  37  * tricky...  The extern variable suboptarg is a pointer to the token
  38  * which didn't match.
  39  */
  40 char *suboptarg;
  41 
  42 int
  43 getsubopt(optionp, tokens, valuep)
  44         char **optionp, **valuep;
  45         char * const *tokens;
  46 {
  47         int cnt;
  48         char *p;
  49 
  50         suboptarg = *valuep = NULL;
  51 
  52         if (!optionp || !*optionp)
  53                 return(-1);
  54 
  55         /* skip leading white-space, commas */
  56         for (p = *optionp; *p && (*p == ',' || *p == ' ' || *p == '\t'); ++p);
  57 
  58         if (!*p) {
  59                 *optionp = p;
  60                 return(-1);
  61         }
  62 
  63         /* save the start of the token, and skip the rest of the token. */
  64         for (suboptarg = p;
  65             *++p && *p != ',' && *p != '=' && *p != ' ' && *p != '\t';);
  66 
  67         if (*p) {
  68                 /*
  69                  * If there's an equals sign, set the value pointer, and
  70                  * skip over the value part of the token.  Terminate the
  71                  * token.
  72                  */
  73                 if (*p == '=') {
  74                         *p = '\0';
  75                         for (*valuep = ++p;
  76                             *p && *p != ',' && *p != ' ' && *p != '\t'; ++p);
  77                         if (*p)
  78                                 *p++ = '\0';
  79                 } else
  80                         *p++ = '\0';
  81                 /* Skip any whitespace or commas after this token. */
  82                 for (; *p && (*p == ',' || *p == ' ' || *p == '\t'); ++p);
  83         }
  84 
  85         /* set optionp for next round. */
  86         *optionp = p;
  87 
  88         for (cnt = 0; *tokens; ++tokens, ++cnt)
  89                 if (!strcmp(suboptarg, *tokens))
  90                         return(cnt);
  91         return(-1);
  92 }

/* [<][>][^][v][top][bottom][index][help] */