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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <mach.h>
#include <hurd/process.h>
#include "procfs.h"
#include "process.h"
#define PID_STR_SIZE (3 * sizeof (pid_t) + 1)
struct proclist_node
{
process_t process;
};
static error_t
proclist_get_contents (void *hook, void **contents, size_t *contents_len)
{
struct proclist_node *pl = hook;
pidarray_t pids;
mach_msg_type_number_t num_pids;
error_t err;
int i;
num_pids = 0;
err = proc_getallpids (pl->process, &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 proclist_node *pl = 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 (pl->process, pid, np);
}
struct node *
proclist_make_node (process_t process)
{
static const struct procfs_node_ops ops = {
.get_contents = proclist_get_contents,
.lookup = proclist_lookup,
.cleanup_contents = procfs_cleanup_contents_with_free,
.cleanup = free,
};
struct proclist_node *pl;
pl = malloc (sizeof *pl);
if (! pl)
return NULL;
memset (pl, 0, sizeof *pl);
pl->process = process;
return procfs_make_node (&ops, pl);
}
|
