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
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#include <mdb/mdb_modapi.h>
typedef struct combined_walk {
int (*cw_init)(mdb_walk_state_t *);
int (*cw_step)(mdb_walk_state_t *);
void (*cw_fini)(mdb_walk_state_t *);
struct combined_walk *cw_next;
void *cw_data;
boolean_t cw_initialized;
} combined_walk_t;
typedef struct combined_walk_data {
uintptr_t cwd_initial_walk_addr; /* to init each walk */
combined_walk_t *cwd_current_walk;
combined_walk_t *cwd_final_walk; /* tail pointer */
struct combined_walk_data *cwd_next;
struct combined_walk_data *cwd_prev;
void *cwd_tag; /* used to find this data */
} combined_walk_data_t;
/*
* Initialize a combined walk to
* A) present a single concatenated series of elements from different
* structures, or
* B) select from several possible walks at runtime.
* Multiple walks are done in the same order passed to combined_walk_add(). Each
* walk is initialized with the same wsp->walk_addr.
*/
void
combined_walk_init(mdb_walk_state_t *wsp)
{
combined_walk_data_t *cwd;
cwd = mdb_alloc(sizeof (combined_walk_data_t), UM_SLEEP);
cwd->cwd_initial_walk_addr = wsp->walk_addr;
cwd->cwd_current_walk = cwd->cwd_final_walk = NULL;
cwd->cwd_next = cwd->cwd_prev = NULL;
cwd->cwd_tag = NULL;
wsp->walk_data = cwd;
}
/*
* If a sub-walker's walk_step() is interrupted (by Ctrl-C or entering 'q' when
* prompted for the next screenful of data), there won't be an opportunity to
* switch wsp->walk_data from the sub-walker's data back to the combined walk
* data, since control will not return from walk_step(). Since mdb is
* single-threaded, we can save the combined walk data for combined_walk_fini()
* to use in case it was reached from an interrupted walk_step(). To allow for
* the possibility of nested combined walks, we'll save them on a list tagged by
* the sub-walker's data.
*/
static combined_walk_data_t *cwd_saved;
static void
combined_walk_data_save(combined_walk_data_t *cwd, void *tag)
{
cwd->cwd_next = cwd_saved;
cwd->cwd_prev = NULL;
if (cwd_saved != NULL) {
cwd_saved->cwd_prev = cwd;
}
cwd_saved = cwd;
cwd->cwd_tag = tag;
}
static void
combined_walk_data_drop(combined_walk_data_t *cwd)
{
if (cwd->cwd_prev == NULL) {
cwd_saved = cwd->cwd_next;
} else {
cwd->cwd_prev->cwd_next = cwd->cwd_next;
}
if (cwd->cwd_next != NULL) {
cwd->cwd_next->cwd_prev = cwd->cwd_prev;
}
cwd->cwd_next = cwd->cwd_prev = NULL;
cwd->cwd_tag = NULL;
}
static combined_walk_data_t *
combined_walk_data_find(void *tag)
{
combined_walk_data_t *cwd;
if (tag == NULL) {
return (NULL);
}
for (cwd = cwd_saved; cwd != NULL; cwd = cwd->cwd_next) {
if (cwd->cwd_tag == tag) {
return (cwd);
}
}
return (NULL);
}
static void
combined_walk_append(combined_walk_data_t *cwd, combined_walk_t *cw)
{
if (cwd->cwd_final_walk == NULL) {
cwd->cwd_current_walk = cwd->cwd_final_walk = cw;
} else {
cwd->cwd_final_walk->cw_next = cw;
cwd->cwd_final_walk = cw;
}
}
static combined_walk_t *
combined_walk_remove_current(combined_walk_data_t *cwd)
{
combined_walk_t *cw = cwd->cwd_current_walk;
if (cw == NULL) {
return (NULL);
}
if (cw == cwd->cwd_final_walk) {
cwd->cwd_final_walk = cw->cw_next;
}
cwd->cwd_current_walk = cw->cw_next;
cw->cw_next = NULL;
return (cw);
}
void
combined_walk_add(mdb_walk_state_t *wsp,
int (*walk_init)(mdb_walk_state_t *),
int (*walk_step)(mdb_walk_state_t *),
void (*walk_fini)(mdb_walk_state_t *))
{
combined_walk_data_t *cwd = wsp->walk_data;
combined_walk_t *cw;
cw = mdb_alloc(sizeof (combined_walk_t), UM_SLEEP);
cw->cw_init = walk_init;
cw->cw_step = walk_step;
cw->cw_fini = walk_fini;
cw->cw_next = NULL;
cw->cw_data = NULL;
cw->cw_initialized = B_FALSE;
combined_walk_append(cwd, cw);
}
int
combined_walk_step(mdb_walk_state_t *wsp)
{
combined_walk_data_t *cwd = wsp->walk_data;
combined_walk_t *cw = cwd->cwd_current_walk;
int status;
if (cw == NULL) {
return (WALK_DONE);
}
if (cw->cw_initialized) {
wsp->walk_data = cw->cw_data;
} else {
wsp->walk_addr = cwd->cwd_initial_walk_addr;
status = cw->cw_init(wsp);
cw->cw_data = wsp->walk_data;
if (status != WALK_NEXT)
goto done;
cw->cw_initialized = B_TRUE;
}
/* save cwd for fini() in case step() is interrupted */
combined_walk_data_save(cwd, cw->cw_data);
status = cw->cw_step(wsp);
/* control may never reach here */
combined_walk_data_drop(cwd);
if (status == WALK_DONE)
goto done;
wsp->walk_data = cwd;
return (status);
done:
(void) combined_walk_remove_current(cwd);
if (cw->cw_initialized)
cw->cw_fini(wsp);
mdb_free(cw, sizeof (combined_walk_t));
wsp->walk_data = cwd;
if (status == WALK_DONE)
return (combined_walk_step(wsp));
return (status);
}
void
combined_walk_fini(mdb_walk_state_t *wsp)
{
combined_walk_data_t *cwd;
combined_walk_t *cw;
/*
* If walk_step() was interrupted, wsp->walk_data will be the
* sub-walker's data, not the combined walker's data, so first check to
* see if there is saved combined walk data tagged by the presumed
* sub-walker's walk data.
*/
cwd = combined_walk_data_find(wsp->walk_data);
if (cwd == NULL) {
/*
* walk_step() was not interrupted, so wsp->walk_data is
* actually the combined walk data.
*/
cwd = wsp->walk_data;
} else {
combined_walk_data_drop(cwd);
}
while ((cw = combined_walk_remove_current(cwd)) != NULL) {
if (cw->cw_initialized) {
wsp->walk_data = cw->cw_data;
cw->cw_fini(wsp);
}
mdb_free(cw, sizeof (combined_walk_t));
}
mdb_free(cwd, sizeof (combined_walk_data_t));
}
|
