| | 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 | struct group *_getgrent(void); |
| | 50 | int _setgrent(void); |
| | 51 | void _endgrent(void); |
| | 52 | FILE *_gr_fp; |
| | 53 | |
| | 54 | static struct group _gr_group; |
| | 55 | static int _gr_stayopen; |
| | 56 | static int grscan(int, gid_t, char *), start_gr(void); |
| | 57 | |
| | 58 | #define MAXGRP 200 |
| | 59 | static char *members[MAXGRP]; |
| | 60 | #define MAXLINELENGTH 1024 |
| | 61 | static char line[MAXLINELENGTH]; |
| | 62 | |
| | 63 | struct group * |
| | 64 | _getgrent(void) |
| | 65 | { |
| | 66 | if (!_gr_fp && !start_gr()) { |
| | 67 | return NULL; |
| | 68 | } |
| | 69 | |
| | 70 | |
| | 71 | if (!grscan(0, 0, NULL)) |
| | 72 | return(NULL); |
| | 73 | return(&_gr_group); |
| | 74 | } |
| | 75 | |
| | 76 | static int |
| | 77 | start_gr(void) |
| | 78 | { |
| | 79 | return 1; |
| | 80 | } |
| | 81 | |
| | 82 | static int |
| | 83 | _setgroupent(int stayopen) |
| | 84 | { |
| | 85 | if (!start_gr()) |
| | 86 | return(0); |
| | 87 | _gr_stayopen = stayopen; |
| | 88 | return(1); |
| | 89 | } |
| | 90 | |
| | 91 | int |
| | 92 | _setgrent(void) |
| | 93 | { |
| | 94 | return(_setgroupent(0)); |
| | 95 | } |
| | 96 | |
| | 97 | void |
| | 98 | _endgrent(void) |
| | 99 | { |
| | 100 | if (_gr_fp) { |
| | 101 | (void)fclose(_gr_fp); |
| | 102 | _gr_fp = NULL; |
| | 103 | } |
| | 104 | } |
| | 105 | |
| | 106 | static int |
| | 107 | grscan(int search, gid_t gid, char *name) |
| | 108 | { |
| | 109 | char *cp, **m; |
| | 110 | char *bp; |
| | 111 | for (;;) { |
| | 112 | if (!fgets(line, sizeof(line), _gr_fp)) |
| | 113 | return(0); |
| | 114 | bp = line; |
| | 115 | /* skip lines that are too big */ |
| | 116 | if (!index(line, '\n')) { |
| | 117 | int ch; |
| | 118 | |
| | 119 | while ((ch = getc(_gr_fp)) != '\n' && ch != EOF) |
| | 120 | ; |
| | 121 | continue; |
| | 122 | } |
| | 123 | if ((_gr_group.gr_name = strsep(&bp, ":\n")) == NULL) |
| | 124 | break; |
| | 125 | if (_gr_group.gr_name[0] == '+') |
| | 126 | continue; |
| | 127 | |
| | 128 | if (search && name) { |
| | 129 | if(strcmp(_gr_group.gr_name, name)) { |
| | 130 | continue; |
| | 131 | } |
| | 132 | } |
| | 133 | if ((_gr_group.gr_passwd = strsep(&bp, ":\n")) == NULL) |
| | 134 | break; |
| | 135 | if (!(cp = strsep(&bp, ":\n"))) |
| | 136 | continue; |
| | 137 | _gr_group.gr_gid = atoi(cp); |
| | 138 | if (search && name == NULL && _gr_group.gr_gid != gid) |
| | 139 | continue; |
| | 140 | cp = NULL; |
| | 141 | if (bp == NULL) /* !! Must check for this! */ |
| | 142 | break; |
| | 143 | for (m = _gr_group.gr_mem = members;; bp++) { |
| | 144 | if (m == &members[MAXGRP - 1]) |
| | 145 | break; |
| | 146 | if (*bp == ',') { |
| | 147 | if (cp) { |
| | 148 | *bp = '\0'; |
| | 149 | *m++ = cp; |
| | 150 | cp = NULL; |
| | 151 | } |
| | 152 | } else if (*bp == '\0' || *bp == '\n' || *bp == ' ') { |
| | 153 | if (cp) { |
| | 154 | *bp = '\0'; |
| | 155 | *m++ = cp; |
| | 156 | } |
| | 157 | break; |
| | 158 | } else if (cp == NULL) |
| | 159 | cp = bp; |
| | 160 | } |
| | 161 | *m = NULL; |
| | 162 | return(1); |
| | 163 | } |
| | 164 | /* NOTREACHED */ |
| | 165 | return (0); |
| | 166 | } |
tuxillo's projects / dragonfly.git / blame_incremental