Rev 2000 | Rev 2039 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2000 | Rev 2035 | ||
---|---|---|---|
Line 341... | Line 341... | ||
341 | ipl_t ipl; |
341 | ipl_t ipl; |
342 | 342 | ||
343 | /* Messing with thread structures, avoid deadlock */ |
343 | /* Messing with thread structures, avoid deadlock */ |
344 | ipl = interrupts_disable(); |
344 | ipl = interrupts_disable(); |
345 | spinlock_lock(&tasks_lock); |
345 | spinlock_lock(&tasks_lock); |
- | 346 | ||
- | 347 | printf("taskid name ctx address as active calls callee\n"); |
|
- | 348 | printf("------ ---------- --- ---------- ---------- ------------ ------>\n"); |
|
346 | 349 | ||
347 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
350 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
348 | btree_node_t *node; |
351 | btree_node_t *node; |
349 | int i; |
352 | int i; |
350 | 353 | ||
Line 354... | Line 357... | ||
354 | int j; |
357 | int j; |
355 | 358 | ||
356 | t = (task_t *) node->value[i]; |
359 | t = (task_t *) node->value[i]; |
357 | 360 | ||
358 | spinlock_lock(&t->lock); |
361 | spinlock_lock(&t->lock); |
359 | printf("%s(%lld): context=%ld, address=%#zx, as=%#zx, ActiveCalls: %zd", |
- | |
360 | t->name, t->taskid, t->context, t, t->as, atomic_get(&t->active_calls)); |
362 | printf("%-6lld %-10s %-3ld %#10zx %#10zx %12zd", t->taskid, t->name, t->context, t, t->as, atomic_get(&t->active_calls)); |
361 | for (j=0; j < IPC_MAX_PHONES; j++) { |
363 | for (j = 0; j < IPC_MAX_PHONES; j++) { |
362 | if (t->phones[j].callee) |
364 | if (t->phones[j].callee) |
363 | printf(" Ph(%zd): %#zx ", j, t->phones[j].callee); |
365 | printf(" %zd:%#zx", j, t->phones[j].callee); |
364 | } |
366 | } |
365 | printf("\n"); |
367 | printf("\n"); |
366 | spinlock_unlock(&t->lock); |
368 | spinlock_unlock(&t->lock); |
367 | } |
369 | } |
368 | } |
370 | } |