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
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
|
/*
* Mach Operating System
* Copyright (c) 1991,1990 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
/*
* Author: David B. Golub, Carnegie Mellon University
* Date: 7/90
*/
#if MACH_KDB
/*
* Miscellaneous printing.
*/
#include <mach/port.h>
#include <kern/strings.h>
#include <kern/task.h>
#include <kern/thread.h>
#include <kern/queue.h>
#include <ipc/ipc_port.h>
#include <ipc/ipc_space.h>
#include <machine/db_machdep.h>
#include <machine/thread.h>
#include <ddb/db_lex.h>
#include <ddb/db_variables.h>
#include <ddb/db_sym.h>
#include <ddb/db_task_thread.h>
extern unsigned int db_maxoff;
/* ARGSUSED */
void
db_show_regs(addr, have_addr, count, modif)
db_expr_t addr;
boolean_t have_addr;
db_expr_t count;
char *modif;
{
register struct db_variable *regp;
db_expr_t value;
db_addr_t offset;
char * name;
register i;
struct db_var_aux_param aux_param;
task_t task = TASK_NULL;
aux_param.modif = modif;
aux_param.thread = THREAD_NULL;
if (db_option(modif, 't')) {
if (have_addr) {
if (!db_check_thread_address_valid((thread_t)addr))
return;
aux_param.thread = (thread_t)addr;
} else
aux_param.thread = db_default_thread;
if (aux_param.thread != THREAD_NULL)
task = aux_param.thread->task;
}
for (regp = db_regs; regp < db_eregs; regp++) {
if (regp->max_level > 1) {
db_printf("bad multi-suffixed register %s\n", regp->name);
continue;
}
aux_param.level = regp->max_level;
for (i = regp->low; i <= regp->high; i++) {
aux_param.suffix[0] = i;
db_read_write_variable(regp, &value, DB_VAR_GET, &aux_param);
if (regp->max_level > 0)
db_printf("%s%d%*s", regp->name, i,
12-strlen(regp->name)-((i<10)?1:2), "");
else
db_printf("%-12s", regp->name);
db_printf("%#*N", 2+2*sizeof(vm_offset_t), value);
db_find_xtrn_task_sym_and_offset((db_addr_t)value, &name,
&offset, task);
if (name != 0 && offset <= db_maxoff && offset != value) {
db_printf("\t%s", name);
if (offset != 0)
db_printf("+%#r", offset);
}
db_printf("\n");
}
}
}
#define OPTION_LONG 0x001 /* long print option */
#define OPTION_USER 0x002 /* print ps-like stuff */
#define OPTION_INDENT 0x100 /* print with indent */
#define OPTION_THREAD_TITLE 0x200 /* print thread title */
#define OPTION_TASK_TITLE 0x400 /* print thread title */
#ifndef DB_TASK_NAME
#define DB_TASK_NAME(task) /* no task name */
#define DB_TASK_NAME_TITLE "" /* no task name */
#endif /* DB_TASK_NAME */
#ifndef db_thread_fp_used
#define db_thread_fp_used(thread) FALSE
#endif
char *
db_thread_stat(thread, status)
register thread_t thread;
char *status;
{
register char *p = status;
*p++ = (thread->state & TH_RUN) ? 'R' : '.';
*p++ = (thread->state & TH_WAIT) ? 'W' : '.';
*p++ = (thread->state & TH_SUSP) ? 'S' : '.';
*p++ = (thread->state & TH_SWAPPED) ? 'O' : '.';
*p++ = (thread->state & TH_UNINT) ? 'N' : '.';
/* show if the FPU has been used */
*p++ = db_thread_fp_used(thread) ? 'F' : '.';
*p++ = 0;
return(status);
}
void
db_print_thread(thread, thread_id, flag)
thread_t thread;
int thread_id;
int flag;
{
if (flag & OPTION_USER) {
char status[8];
char *indent = "";
if (flag & OPTION_LONG) {
if (flag & OPTION_INDENT)
indent = " ";
if (flag & OPTION_THREAD_TITLE) {
db_printf("%s ID: THREAD STAT STACK PCB", indent);
db_printf(" SUS PRI CONTINUE,WAIT_FUNC\n");
}
db_printf("%s%3d%c %0*X %s %0*X %0*X %3d %3d ",
indent, thread_id,
(thread == current_thread())? '#': ':',
2*sizeof(vm_offset_t), thread,
db_thread_stat(thread, status),
2*sizeof(vm_offset_t), thread->kernel_stack,
2*sizeof(vm_offset_t), thread->pcb,
thread->suspend_count, thread->sched_pri);
if ((thread->state & TH_SWAPPED) && thread->swap_func) {
db_task_printsym((db_addr_t)thread->swap_func,
DB_STGY_ANY, kernel_task);
db_printf(", ");
}
if (thread->state & TH_WAIT)
db_task_printsym((db_addr_t)thread->wait_event,
DB_STGY_ANY, kernel_task);
db_printf("\n");
} else {
if (thread_id % 3 == 0) {
if (flag & OPTION_INDENT)
db_printf("\n ");
} else
db_printf(" ");
db_printf("%3d%c(%0*X,%s)", thread_id,
(thread == current_thread())? '#': ':',
2*sizeof(vm_offset_t), thread,
db_thread_stat(thread, status));
}
} else {
if (flag & OPTION_INDENT)
db_printf(" %3d (%0*X) ", thread_id,
2*sizeof(vm_offset_t), thread);
else
db_printf("(%0*X) ", 2*sizeof(vm_offset_t), thread);
db_printf("%c%c%c%c%c",
(thread->state & TH_RUN) ? 'R' : ' ',
(thread->state & TH_WAIT) ? 'W' : ' ',
(thread->state & TH_SUSP) ? 'S' : ' ',
(thread->state & TH_UNINT)? 'N' : ' ',
db_thread_fp_used(thread) ? 'F' : ' ');
if (thread->state & TH_SWAPPED) {
if (thread->swap_func) {
db_printf("(");
db_task_printsym((db_addr_t)thread->swap_func,
DB_STGY_ANY, kernel_task);
db_printf(")");
} else {
db_printf("(swapped)");
}
}
if (thread->state & TH_WAIT) {
db_printf(" ");
db_task_printsym((db_addr_t)thread->wait_event,
DB_STGY_ANY, kernel_task);
}
db_printf("\n");
}
}
void
db_print_task(task, task_id, flag)
task_t task;
int task_id;
int flag;
{
thread_t thread;
int thread_id;
if (flag & OPTION_USER) {
if (flag & OPTION_TASK_TITLE) {
db_printf(" ID: TASK MAP THD SUS PR %s",
DB_TASK_NAME_TITLE);
if ((flag & OPTION_LONG) == 0)
db_printf(" THREADS");
db_printf("\n");
}
db_printf("%3d: %0*X %0*X %3d %3d %2d ",
task_id, 2*sizeof(vm_offset_t), task,
2*sizeof(vm_offset_t), task->map, task->thread_count,
task->suspend_count, task->priority);
DB_TASK_NAME(task);
if (flag & OPTION_LONG) {
if (flag & OPTION_TASK_TITLE)
flag |= OPTION_THREAD_TITLE;
db_printf("\n");
} else if (task->thread_count <= 1)
flag &= ~OPTION_INDENT;
thread_id = 0;
queue_iterate(&task->thread_list, thread, thread_t, thread_list) {
db_print_thread(thread, thread_id, flag);
flag &= ~OPTION_THREAD_TITLE;
thread_id++;
}
if ((flag & OPTION_LONG) == 0)
db_printf("\n");
} else {
if (flag & OPTION_TASK_TITLE)
db_printf(" TASK THREADS\n");
db_printf("%3d (%0*X): ", task_id, 2*sizeof(vm_offset_t), task);
if (task->thread_count == 0) {
db_printf("no threads\n");
} else {
if (task->thread_count > 1) {
db_printf("%d threads: \n", task->thread_count);
flag |= OPTION_INDENT;
} else
flag &= ~OPTION_INDENT;
thread_id = 0;
queue_iterate(&task->thread_list, thread,
thread_t, thread_list)
db_print_thread(thread, thread_id++, flag);
}
}
}
/*ARGSUSED*/
void
db_show_all_threads(addr, have_addr, count, modif)
db_expr_t addr;
boolean_t have_addr;
db_expr_t count;
char * modif;
{
task_t task;
int task_id;
int flag;
processor_set_t pset;
flag = OPTION_TASK_TITLE|OPTION_INDENT;
if (db_option(modif, 'u'))
flag |= OPTION_USER;
if (db_option(modif, 'l'))
flag |= OPTION_LONG;
task_id = 0;
queue_iterate(&all_psets, pset, processor_set_t, all_psets) {
queue_iterate(&pset->tasks, task, task_t, pset_tasks) {
db_print_task(task, task_id, flag);
flag &= ~OPTION_TASK_TITLE;
task_id++;
}
}
}
db_addr_t
db_task_from_space(
ipc_space_t space,
int *task_id)
{
task_t task;
int tid = 0;
processor_set_t pset;
queue_iterate(&all_psets, pset, processor_set_t, all_psets) {
queue_iterate(&pset->tasks, task, task_t, pset_tasks) {
if (task->itk_space == space) {
*task_id = tid;
return (db_addr_t)task;
}
tid++;
}
}
*task_id = 0;
return (0);
}
/*ARGSUSED*/
void
db_show_one_thread(addr, have_addr, count, modif)
db_expr_t addr;
boolean_t have_addr;
db_expr_t count;
char * modif;
{
int flag;
int thread_id;
thread_t thread;
flag = OPTION_THREAD_TITLE;
if (db_option(modif, 'u'))
flag |= OPTION_USER;
if (db_option(modif, 'l'))
flag |= OPTION_LONG;
if (!have_addr) {
thread = current_thread();
if (thread == THREAD_NULL) {
db_error("No thread\n");
/*NOTREACHED*/
}
} else
thread = (thread_t) addr;
if ((thread_id = db_lookup_thread(thread)) < 0) {
db_printf("bad thread address %#X\n", addr);
db_error(0);
/*NOTREACHED*/
}
if (flag & OPTION_USER) {
db_printf("TASK%d(%0*X):\n",
db_lookup_task(thread->task),
2*sizeof(vm_offset_t), thread->task);
db_print_thread(thread, thread_id, flag);
} else {
db_printf("task %d(%0*X): thread %d",
db_lookup_task(thread->task),
2*sizeof(vm_offset_t), thread->task, thread_id);
db_print_thread(thread, thread_id, flag);
}
}
/*ARGSUSED*/
void
db_show_one_task(addr, have_addr, count, modif)
db_expr_t addr;
boolean_t have_addr;
db_expr_t count;
char * modif;
{
int flag;
int task_id;
task_t task;
flag = OPTION_TASK_TITLE;
if (db_option(modif, 'u'))
flag |= OPTION_USER;
if (db_option(modif, 'l'))
flag |= OPTION_LONG;
if (!have_addr) {
task = db_current_task();
if (task == TASK_NULL) {
db_error("No task\n");
/*NOTREACHED*/
}
} else
task = (task_t) addr;
if ((task_id = db_lookup_task(task)) < 0) {
db_printf("bad task address %#X\n", addr);
db_error(0);
/*NOTREACHED*/
}
db_print_task(task, task_id, flag);
}
int
db_port_iterate(thread, func)
thread_t thread;
void (*func)();
{
ipc_entry_t entry;
int index;
int n = 0;
int size;
ipc_space_t space;
space = thread->task->itk_space;
entry = space->is_table;
size = space->is_table_size;
for (index = 0; index < size; index++, entry++) {
if (entry->ie_bits & MACH_PORT_TYPE_PORT_RIGHTS)
(*func)(index, (ipc_port_t) entry->ie_object,
entry->ie_bits, n++);
}
return(n);
}
ipc_port_t
db_lookup_port(thread, id)
thread_t thread;
int id;
{
register ipc_space_t space;
register ipc_entry_t entry;
if (thread == THREAD_NULL)
return(0);
space = thread->task->itk_space;
if (id < 0 || id >= space->is_table_size)
return(0);
entry = &space->is_table[id];
if (entry->ie_bits & MACH_PORT_TYPE_PORT_RIGHTS)
return((ipc_port_t)entry->ie_object);
return(0);
}
static void
db_print_port_id(id, port, bits, n)
int id;
ipc_port_t port;
unsigned bits;
int n;
{
if (n != 0 && n % 3 == 0)
db_printf("\n");
db_printf("\tport%d(%s,%x)", id,
(bits & MACH_PORT_TYPE_RECEIVE)? "r":
(bits & MACH_PORT_TYPE_SEND)? "s": "S", port);
}
static void
db_print_port_id_long(
int id,
ipc_port_t port,
unsigned bits,
int n)
{
if (n != 0)
db_printf("\n");
db_printf("\tport%d(%s, port=0x%x", id,
(bits & MACH_PORT_TYPE_RECEIVE)? "r":
(bits & MACH_PORT_TYPE_SEND)? "s": "S", port);
db_printf(", receiver_name=0x%x)", port->ip_receiver_name);
}
/* ARGSUSED */
void
db_show_port_id(addr, have_addr, count, modif)
db_expr_t addr;
boolean_t have_addr;
db_expr_t count;
char * modif;
{
thread_t thread;
if (!have_addr) {
thread = current_thread();
if (thread == THREAD_NULL) {
db_error("No thread\n");
/*NOTREACHED*/
}
} else
thread = (thread_t) addr;
if (db_lookup_thread(thread) < 0) {
db_printf("Bad thread address %#X\n", addr);
db_error(0);
/*NOTREACHED*/
}
if (db_option(modif, 'l'))
{
if (db_port_iterate(thread, db_print_port_id_long))
db_printf("\n");
return;
}
if (db_port_iterate(thread, db_print_port_id))
db_printf("\n");
}
#endif /* MACH_KDB */
|