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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
|
/* Proc server host management calls
Copyright (C) 1992,93,94,96,97,2001 Free Software Foundation
This file is part of the GNU Hurd.
The GNU Hurd 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.
The GNU Hurd 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 the GNU Hurd; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/* Written by Michael I. Bushnell. */
#include <mach.h>
#include <hurd.h>
#include <sys/types.h>
#include <hurd/hurd_types.h>
#include <stdlib.h>
#include <errno.h>
#include <mach/notify.h>
#include <string.h>
#include <stdio.h>
#include <hurd/exec.h>
#include <unistd.h>
#include <assert.h>
#include <version.h>
#include <sys/mman.h>
#include "proc.h"
#include "process_S.h"
static mach_port_t *std_port_array;
static int *std_int_array;
static int n_std_ports, n_std_ints;
static struct utsname uname_info;
struct server_version
{
char *name;
char *version;
} *server_versions;
int nserver_versions, server_versions_nalloc;
struct execdata_notify
{
mach_port_t notify_port;
struct execdata_notify *next;
} *execdata_notifys;
/* Implement proc_getprivports as described in <hurd/process.defs>. */
kern_return_t
S_proc_getprivports (struct proc *p,
mach_port_t *hostpriv,
mach_port_t *devpriv)
{
if (!p)
return EOPNOTSUPP;
if (! check_uid (p, 0))
return EPERM;
*hostpriv = master_host_port;
*devpriv = master_device_port;
return 0;
}
/* Implement proc_setexecdata as described in <hurd/process.defs>. */
kern_return_t
S_proc_setexecdata (struct proc *p,
mach_port_t *ports,
u_int nports,
int *ints,
u_int nints)
{
int i;
struct execdata_notify *n;
mach_port_t *std_port_array_new;
int *std_int_array_new;
if (!p)
return EOPNOTSUPP;
if (!check_uid (p, 0))
return EPERM;
/* Allocate memory up front. */
std_port_array_new = malloc (sizeof (mach_port_t) * nports);
if (! std_port_array_new)
return ENOMEM;
std_int_array_new = malloc (sizeof (int) * nints);
if (! std_int_array_new)
{
free (std_port_array_new);
return ENOMEM;
}
if (std_port_array)
{
for (i = 0; i < n_std_ports; i++)
mach_port_deallocate (mach_task_self (), std_port_array[i]);
free (std_port_array);
}
if (std_int_array)
free (std_int_array);
std_port_array = std_port_array_new;
n_std_ports = nports;
memcpy (std_port_array, ports, sizeof (mach_port_t) * nports);
std_int_array = std_int_array_new;
n_std_ints = nints;
memcpy (std_int_array, ints, sizeof (int) * nints);
for (n = execdata_notifys; n; n = n->next)
exec_setexecdata (n->notify_port, std_port_array, MACH_MSG_TYPE_COPY_SEND,
n_std_ports, std_int_array, n_std_ints);
return 0;
}
/* Implement proc_getexecdata as described in <hurd/process.defs>. */
kern_return_t
S_proc_getexecdata (struct proc *p,
mach_port_t **ports,
mach_msg_type_name_t *portspoly,
u_int *nports,
int **ints,
u_int *nints)
{
/* No need to check P here; we don't use it. */
if (!std_port_array)
return ENOENT;
if (*nports < n_std_ports)
{
*ports = mmap (0, round_page (n_std_ports * sizeof (mach_port_t)),
PROT_READ|PROT_WRITE, MAP_ANON, 0, 0);
if (*ports == MAP_FAILED)
return ENOMEM;
}
memcpy (*ports, std_port_array, n_std_ports * sizeof (mach_port_t));
*nports = n_std_ports;
if (*nints < n_std_ints)
{
*ints = mmap (0, round_page (n_std_ints * sizeof (int)),
PROT_READ|PROT_WRITE, MAP_ANON, 0, 0);
if (*ints == MAP_FAILED)
return ENOMEM;
}
memcpy (*ints, std_int_array, n_std_ints * sizeof (int));
*nints = n_std_ints;
return 0;
}
/* Implement proc_execdata_notify as described in <hurd/process.defs>. */
kern_return_t
S_proc_execdata_notify (struct proc *p,
mach_port_t notify)
{
struct execdata_notify *n;
mach_port_t foo;
/* No need to check P here; we don't use it. */
n = malloc (sizeof (struct execdata_notify));
if (! n)
return ENOMEM;
n->notify_port = notify;
n->next = execdata_notifys;
execdata_notifys = n;
mach_port_request_notification (mach_task_self (), notify,
MACH_NOTIFY_DEAD_NAME, 1,
generic_port, MACH_MSG_TYPE_MAKE_SEND_ONCE,
&foo);
if (foo)
mach_port_deallocate (mach_task_self (), foo);
if (std_port_array)
exec_setexecdata (n->notify_port, std_port_array, MACH_MSG_TYPE_COPY_SEND,
n_std_ports, std_int_array, n_std_ints);
return 0;
}
/* Check all the execdata notify ports and see if one of them is
PORT; if it is, then free it. */
void
check_dead_execdata_notify (mach_port_t port)
{
struct execdata_notify *en, **prevp;
for (en = execdata_notifys, prevp = &execdata_notifys; en; en = *prevp)
{
if (en->notify_port == port)
{
mach_port_deallocate (mach_task_self (), port);
*prevp = en->next;
free (en);
}
else
prevp = &en->next;
}
}
/* Version information handling.
A server registers its name and version with
startup_register_version.
The uname release is the most popular version number.
The uname version string is composed of all the server names and
versions, omitting special mention of those which match the uname
release, plus the kernel version string. */
char *kernel_name, *kernel_version;
/* Rebuild the uname version string. */
static void
rebuild_uname (void)
{
unsigned int i, j;
char *p, *end;
/* Set up for addstr to write into STRING. */
inline void initstr (char *string)
{
p = string;
end = p + _UTSNAME_LENGTH;
}
/* If NAME is not null, write "name-version/", else "version/". */
inline void addstr (const char *name, const char *version)
{
size_t len;
if (name)
{
len = strlen (name);
if (p + len + 1 < end)
memcpy (p, name, len);
p += len;
if (p < end)
*p++ = '-';
}
len = strlen (version);
if (p + len + 1 < end)
memcpy (p, version, len);
p += len;
if (p < end)
*p++ = '/';
}
/* Collect all the differing version strings and count how many
servers use each. */
struct version
{
const char *version;
unsigned int count;
} versions[nserver_versions];
int compare_versions (const void *a, const void *b)
{
return (((const struct version *) b)->count -
((const struct version *) a)->count);
}
unsigned int nversions = 0;
for (i = 0; i < nserver_versions; ++i)
{
for (j = 0; j < nversions; ++j)
if (! strcmp (versions[j].version, server_versions[i].version))
{
++versions[j].count;
break;
}
if (j == nversions)
{
versions[nversions].version = server_versions[i].version;
versions[nversions].count = 1;
++nversions;
}
}
/* Sort the versions in order of decreasing popularity. */
qsort (versions, nversions, sizeof (struct version), compare_versions);
/* Now build the uname strings. */
/* release is the most popular version */
strcpy (uname_info.release, versions[0].version);
initstr (uname_info.version);
addstr (kernel_name, kernel_version);
if (versions[0].count > 1)
addstr ("Hurd", versions[0].version);
/* Now, for any which differ (if there might be any), write it out
separately. */
if (versions[0].count != nserver_versions)
for (i = 0; i < nserver_versions; i++)
if (versions[0].count == 1
|| strcmp (server_versions[i].version, versions[0].version))
addstr (server_versions[i].name, server_versions[i].version);
if (p > end)
#ifdef notyet
syslog (LOG_EMERG,
"_UTSNAME_LENGTH %u too short; inform bug-glibc@prep.ai.mit.edu\n",
p - end)
#endif
;
else
p[-1] = '\0';
end[-1] = '\0';
}
void
initialize_version_info (void)
{
extern const char *const mach_cpu_types[];
extern const char *const mach_cpu_subtypes[][32];
kernel_version_t kv;
char *p;
struct host_basic_info info;
unsigned int n = sizeof info;
error_t err;
/* Fill in fixed slots sysname and machine. */
strcpy (uname_info.sysname, "GNU");
err = host_info (mach_host_self (), HOST_BASIC_INFO, (int *) &info, &n);
assert (! err);
snprintf (uname_info.machine, sizeof uname_info.machine, "%s-%s",
mach_cpu_types[info.cpu_type],
mach_cpu_subtypes[info.cpu_type][info.cpu_subtype]);
/* Notice Mach's and our own version and initialize server version
variables. */
server_versions = malloc (sizeof (struct server_version) * 10);
assert (server_versions);
server_versions_nalloc = 10;
err = host_kernel_version (mach_host_self (), kv);
assert (! err);
/* Make sure the result is null-terminated, as the kernel doesn't
guarantee it. */
kv[sizeof (kv) - 1] = '\0';
p = index (kv, ':');
if (p)
*p = '\0';
p = index (kv, ' ');
if (p)
*p = '\0';
kernel_name = strdup (p ? kv : "mach");
assert (kernel_name);
kernel_version = strdup (p ? p + 1 : kv);
assert (kernel_version);
server_versions[0].name = strdup ("proc");
assert (server_versions[0].name);
server_versions[0].version = strdup (HURD_VERSION);
assert (server_versions[0].version);
nserver_versions = 1;
rebuild_uname ();
uname_info.nodename[0] = '\0';
}
kern_return_t
S_proc_uname (pstruct_t process,
struct utsname *uname)
{
/* No need to check PROCESS here, we don't use it. */
*uname = uname_info;
return 0;
}
kern_return_t
S_proc_register_version (pstruct_t server,
mach_port_t credential,
char *name,
char *release,
char *version)
{
error_t err = 0;
int i;
/* No need to check SERVER here; we don't use it. */
if (credential != master_host_port)
/* Must be privileged to register for uname. */
return EPERM;
for (i = 0; i < nserver_versions; i++)
if (!strcmp (name, server_versions[i].name))
{
/* Change this entry. */
free (server_versions[i].version);
server_versions[i].version = malloc (strlen (version) + 1);
if (! server_versions[i].version)
{
err = ENOMEM;
goto out;
}
strcpy (server_versions[i].version, version);
break;
}
if (i == nserver_versions)
{
/* Didn't find it; extend. */
if (nserver_versions == server_versions_nalloc)
{
void *new = realloc (server_versions,
sizeof (struct server_version) *
server_versions_nalloc * 2);
if (! new)
{
err = ENOMEM;
goto out;
}
server_versions_nalloc *= 2;
server_versions = new;
}
server_versions[nserver_versions].name = malloc (strlen (name) + 1);
if (! server_versions[nserver_versions].name)
{
err = ENOMEM;
goto out;
}
server_versions[nserver_versions].version = malloc (strlen (version)
+ 1);
if (! server_versions[nserver_versions].version)
{
free (server_versions[nserver_versions].name);
err = ENOMEM;
goto out;
}
strcpy (server_versions[nserver_versions].name, name);
strcpy (server_versions[nserver_versions].version, version);
nserver_versions++;
}
rebuild_uname ();
out:
mach_port_deallocate (mach_task_self (), credential);
return err;
}
|