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
|
/*
* This file and its contents are supplied under the terms of the
* Common Development and Distribution License ("CDDL"), version 1.0.
* You may only use this file in accordance with the terms of version
* 1.0 of the CDDL.
*
* A full copy of the text of the CDDL should have accompanied this
* source. A copy of the CDDL is also available via the Internet at
* http://www.illumos.org/license/CDDL.
*/
/*
* Copyright 2012 DEY Storage Systems, Inc. All rights reserved.
*/
/*
* Copyright (c) 2013 Joyent, Inc. All Rights reserved.
* Copyright 2020 OmniOS Community Edition (OmniOSce) Association.
*/
#include <limits.h>
#include <stdio.h>
#include <errno.h>
#include <unistd.h>
#include <dirent.h>
#include <ctype.h>
#include <string.h>
#include <sys/mkdev.h>
#include "libproc.h"
#include "Pcontrol.h"
#include "proc_fd.h"
/*
* Pfdinfo.c - obtain open file information.
*/
/*
* Allocate an fd_info structure and stick it on the list.
* (Unless one already exists.) The list is sorted in
* reverse order. We will traverse it in that order later.
* This makes the usual ordered insert *fast*.
*/
fd_info_t *
Pfd2info(struct ps_prochandle *P, int fd)
{
fd_info_t *fip = list_next(&P->fd_head);
fd_info_t *next;
int i;
if (fip == NULL) {
list_link(&P->fd_head, NULL);
fip = list_next(&P->fd_head);
}
for (i = 0; i < P->num_fd; i++, fip = list_next(fip)) {
if (fip->fd_info == NULL)
continue;
if (fip->fd_info->pr_fd == fd) {
return (fip);
}
if (fip->fd_info->pr_fd < fd) {
break;
}
}
next = fip;
if ((fip = calloc(1, sizeof (*fip))) == NULL)
return (NULL);
list_link(fip, next ? next : (void *)&(P->fd_head));
P->num_fd++;
return (fip);
}
static int
fdwalk_cb(const prfdinfo_t *info, void *arg)
{
struct ps_prochandle *P = arg;
fd_info_t *fip;
fip = Pfd2info(P, info->pr_fd);
if (fip == NULL) {
errno = ENOMEM;
return (-1);
}
if (fip->fd_info == NULL)
fip->fd_info = proc_fdinfo_dup(info);
if (fip->fd_info == NULL) {
errno = ENOMEM;
return (-1);
}
return (0);
}
/*
* Attempt to load the open file information from a live process.
*/
static void
load_fdinfo(struct ps_prochandle *P)
{
/*
* In the unlikely case there are *no* file descriptors open,
* we will keep rescanning the proc directory, which will be empty.
* This is an edge case it isn't worth adding additional state to
* to eliminate.
*/
if (P->num_fd > 0)
return;
if (P->state == PS_DEAD || P->state == PS_IDLE)
return;
proc_fdwalk(P->pid, fdwalk_cb, P);
}
int
Pfdinfo_iter(struct ps_prochandle *P, proc_fdinfo_f *func, void *cd)
{
fd_info_t *fip;
int rv;
/* Make sure we have live data, if appropriate */
load_fdinfo(P);
/* NB: We walk the list backwards. */
for (fip = list_prev(&P->fd_head);
fip != (void *)&P->fd_head && fip != NULL;
fip = list_prev(fip)) {
if ((rv = func(cd, fip->fd_info)) != 0)
return (rv);
}
return (0);
}
|
