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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
|
/*
Copyright (c) 2004 The Regents of the University of Michigan.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif /* HAVE_CONFIG_H */
#ifndef _GNU_SOURCE
#define _GNU_SOURCE
#endif
#include <sys/param.h>
#include <sys/socket.h>
#include <sys/poll.h>
#include <netinet/in.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <unistd.h>
#include <dirent.h>
#include "gssd.h"
#include "err_util.h"
extern struct pollfd *pollarray;
extern int pollsize;
#define POLL_MILLISECS 500
static volatile int dir_changed = 1;
static void dir_notify_handler(int sig)
{
printerr(2, "dir_notify_handler: sig %d\n", sig);
dir_changed = 1;
}
static void
scan_poll_results(int ret)
{
int i;
struct clnt_info *clp;
for (clp = clnt_list.tqh_first; clp != NULL; clp = clp->list.tqe_next)
{
i = clp->gssd_poll_index;
if (i >= 0 && pollarray[i].revents) {
if (pollarray[i].revents & POLLHUP) {
clp->gssd_close_me = 1;
dir_changed = 1;
}
if (pollarray[i].revents & POLLIN)
handle_gssd_upcall(clp);
pollarray[clp->gssd_poll_index].revents = 0;
ret--;
if (!ret)
break;
}
i = clp->krb5_poll_index;
if (i >= 0 && pollarray[i].revents) {
if (pollarray[i].revents & POLLHUP) {
clp->krb5_close_me = 1;
dir_changed = 1;
}
if (pollarray[i].revents & POLLIN)
handle_krb5_upcall(clp);
pollarray[clp->krb5_poll_index].revents = 0;
ret--;
if (!ret)
break;
}
}
};
static int
topdirs_add_entry(struct dirent *dent)
{
struct topdirs_info *tdi;
tdi = calloc(sizeof(struct topdirs_info), 1);
if (tdi == NULL) {
printerr(0, "ERROR: Couldn't allocate struct topdirs_info\n");
return -1;
}
tdi->dirname = malloc(PATH_MAX);
if (tdi->dirname == NULL) {
printerr(0, "ERROR: Couldn't allocate directory name\n");
free(tdi);
return -1;
}
snprintf(tdi->dirname, PATH_MAX, "%s/%s", pipefs_dir, dent->d_name);
tdi->fd = open(tdi->dirname, O_RDONLY);
if (tdi->fd != -1) {
fcntl(tdi->fd, F_SETSIG, DNOTIFY_SIGNAL);
fcntl(tdi->fd, F_NOTIFY,
DN_CREATE|DN_DELETE|DN_MODIFY|DN_MULTISHOT);
}
TAILQ_INSERT_HEAD(&topdirs_list, tdi, list);
return 0;
}
static void
topdirs_free_list(void)
{
struct topdirs_info *tdi;
TAILQ_FOREACH(tdi, &topdirs_list, list) {
free(tdi->dirname);
if (tdi->fd != -1)
close(tdi->fd);
TAILQ_REMOVE(&topdirs_list, tdi, list);
free(tdi);
}
}
static int
topdirs_init_list(void)
{
DIR *pipedir;
struct dirent *dent;
int ret;
TAILQ_INIT(&topdirs_list);
pipedir = opendir(pipefs_dir);
if (pipedir == NULL) {
printerr(0, "ERROR: could not open rpc_pipefs directory '%s': "
"%s\n", pipefs_dir, strerror(errno));
return -1;
}
for (dent = readdir(pipedir); dent != NULL; dent = readdir(pipedir)) {
if (dent->d_type != DT_DIR ||
strcmp(dent->d_name, ".") == 0 ||
strcmp(dent->d_name, "..") == 0) {
continue;
}
ret = topdirs_add_entry(dent);
if (ret)
goto out_err;
}
closedir(pipedir);
return 0;
out_err:
topdirs_free_list();
return -1;
}
void
gssd_run()
{
int ret;
struct sigaction dn_act = {
.sa_handler = dir_notify_handler
};
sigset_t set;
sigemptyset(&dn_act.sa_mask);
sigaction(DNOTIFY_SIGNAL, &dn_act, NULL);
/* just in case the signal is blocked... */
sigemptyset(&set);
sigaddset(&set, DNOTIFY_SIGNAL);
sigprocmask(SIG_UNBLOCK, &set, NULL);
if (topdirs_init_list() != 0)
return;
init_client_list();
printerr(1, "beginning poll\n");
while (1) {
while (dir_changed) {
dir_changed = 0;
if (update_client_list()) {
/* Error msg is already printed */
exit(1);
}
}
/* race condition here: dir_changed could be set before we
* enter the poll, and we'd never notice if it weren't for the
* timeout. */
ret = poll(pollarray, pollsize, POLL_MILLISECS);
if (ret < 0) {
if (errno != EINTR)
printerr(0,
"WARNING: error return from poll\n");
} else if (ret == 0) {
/* timeout */
} else { /* ret > 0 */
scan_poll_results(ret);
}
}
topdirs_free_list();
return;
}
|
