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
|
/* Hurd /proc filesystem, list of processes as a directory.
Copyright (C) 2010 Free Software Foundation, Inc.
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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <mach.h>
#include <hurd/process.h>
#include <ps.h>
#include "procfs.h"
#include "process.h"
#define PID_STR_SIZE (3 * sizeof (pid_t) + 1)
static error_t
proclist_get_contents (void *hook, char **contents, ssize_t *contents_len)
{
struct ps_context *pc = hook;
pidarray_t pids;
mach_msg_type_number_t num_pids;
error_t err;
int i;
num_pids = 0;
err = proc_getallpids (pc->server, &pids, &num_pids);
if (err)
return EIO;
*contents = malloc (num_pids * PID_STR_SIZE);
if (*contents)
{
*contents_len = 0;
for (i=0; i < num_pids; i++)
{
int n = sprintf (*contents + *contents_len, "%d", pids[i]);
assert (n >= 0);
*contents_len += (n + 1);
}
}
else
err = ENOMEM;
vm_deallocate (mach_task_self (), (vm_address_t) pids, num_pids * sizeof pids[0]);
return err;
}
static error_t
proclist_lookup (void *hook, const char *name, struct node **np)
{
struct ps_context *pc = hook;
char *endp;
pid_t pid;
/* Self-lookups should not end up here. */
assert (name[0]);
/* No leading zeros allowed */
if (name[0] == '0' && name[1])
return ENOENT;
pid = strtol (name, &endp, 10);
if (*endp)
return ENOENT;
return process_lookup_pid (pc, pid, np);
}
struct node *
proclist_make_node (struct ps_context *pc)
{
static const struct procfs_node_ops ops = {
.get_contents = proclist_get_contents,
.lookup = proclist_lookup,
.cleanup_contents = procfs_cleanup_contents_with_free,
};
return procfs_make_node (&ops, pc);
}
|
