external/bsd/mdocml/dist/compat_getsubopt.c

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