1996-12-19 13:53:16 +00:00
|
|
|
/* provide consistent interface to getgroups for systems that don't allow N==0
|
2003-04-11 12:20:35 +00:00
|
|
|
Copyright (C) 1996, 1999, 2003 Free Software Foundation, Inc.
|
1996-12-19 13:53:16 +00:00
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with this program; if not, write to the Free Software Foundation,
|
2005-05-14 07:58:06 +00:00
|
|
|
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
|
1996-12-19 13:53:16 +00:00
|
|
|
|
|
|
|
|
/* written by Jim Meyering */
|
|
|
|
|
|
2005-09-22 06:05:39 +00:00
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
|
# include <config.h>
|
|
|
|
|
#endif
|
1996-12-19 13:53:16 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <sys/types.h>
|
2003-10-16 08:23:41 +00:00
|
|
|
#include <errno.h>
|
|
|
|
|
#include <stdlib.h>
|
1996-12-19 13:53:16 +00:00
|
|
|
|
2003-01-10 21:38:20 +00:00
|
|
|
#include "xalloc.h"
|
1996-12-19 13:53:16 +00:00
|
|
|
|
1996-12-27 03:36:53 +00:00
|
|
|
/* On at least Ultrix 4.3 and NextStep 3.2, getgroups (0, 0) always fails.
|
|
|
|
|
On other systems, it returns the number of supplemental groups for the
|
1999-03-09 18:53:54 +00:00
|
|
|
process. This function handles that special case and lets the system-
|
|
|
|
|
provided function handle all others. */
|
1996-12-19 13:53:16 +00:00
|
|
|
|
|
|
|
|
int
|
2003-10-16 08:23:41 +00:00
|
|
|
getgroups (int n, GETGROUPS_T *group)
|
1996-12-19 13:53:16 +00:00
|
|
|
{
|
1996-12-27 03:36:53 +00:00
|
|
|
int n_groups;
|
1996-12-19 13:53:16 +00:00
|
|
|
GETGROUPS_T *gbuf;
|
2003-10-16 08:23:41 +00:00
|
|
|
int saved_errno;
|
1996-12-19 13:53:16 +00:00
|
|
|
|
|
|
|
|
#undef getgroups
|
|
|
|
|
|
|
|
|
|
if (n != 0)
|
|
|
|
|
return getgroups (n, group);
|
|
|
|
|
|
|
|
|
|
n = 20;
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
2003-10-16 08:23:41 +00:00
|
|
|
/* No need to worry about address arithmetic overflow here,
|
|
|
|
|
since the ancient systems that we're running on have low
|
|
|
|
|
limits on the number of secondary groups. */
|
2003-12-03 10:28:39 +00:00
|
|
|
gbuf = xmalloc (n * sizeof *gbuf);
|
1996-12-27 03:36:53 +00:00
|
|
|
n_groups = getgroups (n, gbuf);
|
|
|
|
|
if (n_groups < n)
|
1996-12-19 13:53:16 +00:00
|
|
|
break;
|
2003-10-31 13:44:24 +00:00
|
|
|
free (gbuf);
|
1996-12-19 13:53:16 +00:00
|
|
|
n += 10;
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-16 08:23:41 +00:00
|
|
|
saved_errno = errno;
|
1996-12-19 13:53:16 +00:00
|
|
|
free (gbuf);
|
2003-10-16 08:23:41 +00:00
|
|
|
errno = saved_errno;
|
1996-12-19 13:53:16 +00:00
|
|
|
|
1996-12-27 03:36:53 +00:00
|
|
|
return n_groups;
|
1996-12-19 13:53:16 +00:00
|
|
|
}
|