libexec/mknetid/parse_group.c

   1 /*
   2  * Copyright (c) 1989, 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. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  * @(#)getgrent.c       8.2 (Berkeley) 3/21/94
  34  * $FreeBSD: src/libexec/mknetid/parse_group.c,v 1.6 1999/08/28 00:09:42 peter Exp $
  35  * $DragonFly: src/libexec/mknetid/parse_group.c,v 1.3 2006/08/03 16:40:46 swildner Exp $
  36  */
  37
  38 /*
  39  * This is a slightly modified chunk of getgrent(3). All the YP support
  40  * and unneeded functions have been stripped out.
  41  */
  42
  43 #include <sys/types.h>
  44 #include <grp.h>
  45 #include <stdio.h>
  46 #include <stdlib.h>
  47 #include <string.h>
  48
  49 FILE *_gr_fp;
  50 static struct group _gr_group;
  51 static int _gr_stayopen;
  52 static int grscan(), start_gr();
  53
  54 #define MAXGRP          200
  55 static char *members[MAXGRP];
  56 #define MAXLINELENGTH   1024
  57 static char line[MAXLINELENGTH];
  58
  59 struct group *
  60 _getgrent()
  61 {
  62         if (!_gr_fp && !start_gr()) {
  63                 return NULL;
  64         }
  65
  66
  67         if (!grscan(0, 0, NULL))
  68                 return(NULL);
  69         return(&_gr_group);
  70 }
  71
  72 static int
  73 start_gr()
  74 {
  75         return 1;
  76 }
  77
  78 int
  79 _setgroupent(stayopen)
  80         int stayopen;
  81 {
  82         if (!start_gr())
  83                 return(0);
  84         _gr_stayopen = stayopen;
  85         return(1);
  86 }
  87
  88 int
  89 _setgrent()
  90 {
  91         return(_setgroupent(0));
  92 }
  93
  94 void
  95 _endgrent()
  96 {
  97         if (_gr_fp) {
  98                 (void)fclose(_gr_fp);
  99                 _gr_fp = NULL;
 100         }
 101 }
 102
 103 static int
 104 grscan(search, gid, name)
 105         register int search, gid;
 106         register char *name;
 107 {
 108         register char *cp, **m;
 109         char *bp;
 110         for (;;) {
 111                 if (!fgets(line, sizeof(line), _gr_fp))
 112                         return(0);
 113                 bp = line;
 114                 /* skip lines that are too big */
 115                 if (!index(line, '\n')) {
 116                         int ch;
 117
 118                         while ((ch = getc(_gr_fp)) != '\n' && ch != EOF)
 119                                 ;
 120                         continue;
 121                 }
 122                 if ((_gr_group.gr_name = strsep(&bp, ":\n")) == NULL)
 123                         break;
 124                 if (_gr_group.gr_name[0] == '+')
 125                         continue;
 126
 127                 if (search && name) {
 128                         if(strcmp(_gr_group.gr_name, name)) {
 129                                 continue;
 130                         }
 131                 }
 132                 if ((_gr_group.gr_passwd = strsep(&bp, ":\n")) == NULL)
 133                         break;
 134                 if (!(cp = strsep(&bp, ":\n")))
 135                         continue;
 136                 _gr_group.gr_gid = atoi(cp);
 137                 if (search && name == NULL && _gr_group.gr_gid != gid)
 138                         continue;
 139                 cp = NULL;
 140                 if (bp == NULL) /* !! Must check for this! */
 141                         break;
 142                 for (m = _gr_group.gr_mem = members;; bp++) {
 143                         if (m == &members[MAXGRP - 1])
 144                                 break;
 145                         if (*bp == ',') {
 146                                 if (cp) {
 147                                         *bp = '\0';
 148                                         *m++ = cp;
 149                                         cp = NULL;
 150                                 }
 151                         } else if (*bp == '\0' || *bp == '\n' || *bp == ' ') {
 152                                 if (cp) {
 153                                         *bp = '\0';
 154                                         *m++ = cp;
 155                         }
 156                                 break;
 157                         } else if (cp == NULL)
 158                                 cp = bp;
 159                 }
 160                 *m = NULL;
 161                 return(1);
 162         }
 163         /* NOTREACHED */
 164         return (0);
 165 }