1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*
Copyright (C) 1994 Free Software Foundation
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, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "priv.h"
#include "io_S.h"
/* Tell if the array LIST (of size N) contains a member equal to QUERY. */
static inline int
listmember (int *list, int query, int n)
{
int i;
for (i = 0; i < n; i++)
if (list[i] == query)
return 1;
return 0;
}
/* Implement io_restrict_auth as described in <hurd/io.defs>. */
error_t
diskfs_S_io_restrict_auth (struct protid *cred,
mach_port_t *newport,
mach_msg_type_name_t *newportpoly,
uid_t *uids,
u_int nuids,
gid_t *gids,
u_int ngids)
{
uid_t *newuids, *newgids;
int i, newnuids, newngids;
if (!cred)
return EOPNOTSUPP;
newuids = alloca (sizeof (uid_t) * cred->nuids);
newgids = alloca (sizeof (uid_t) * cred->ngids);
for (i = newnuids = 0; i < cred->nuids; i++)
if (listmember (uids, cred->uids[i], nuids))
newuids[newnuids++] = cred->uids[i];
for (i = newngids = 0; i < cred->ngids; i++)
if (listmember (gids, cred->gids[i], ngids))
newgids[newngids++] = cred->gids[i];
mutex_lock (&cred->po->np->lock);
*newport = (diskfs_make_protid (cred->po, newuids, newnuids, newgids,
newngids))->fspt.pi.port;
mutex_unlock (&cred->po->np->lock);
*newportpoly = MACH_MSG_TYPE_MAKE_SEND;
return 0;
}
|
