blob: dfe3bc6e5e15b21a5680c3852a9281d578dd05f3 (
plain)
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
|
/*
* COPYRIGHT (c) 1989-2013.
* On-Line Applications Research Corporation (OAR).
*
* The license and distribution terms for this file may be
* found in the file LICENSE in this distribution or at
* http://www.rtems.com/license/LICENSE.
*/
#include <newlib/getopt.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include "shell.h"
#include "rtems_sched.h"
// #define __RTEMS_VIOLATE_KERNEL_VISIBILITY__
#include <rtems.h>
#include <rtems/score/percpu.h>
#include <rtems/score/smp.h>
#include <rtems/score/schedulerpriority.h>
int main_dump_all_cpus(int argc, char **argv)
{
uint32_t cpu;
Thread_Control *h;
Thread_Control *i;
Thread_Control *e;
printf(
"=== CPU Status\n"
" EXECUTING / HEIR / SWITCH NEEDED\n"
);
for ( cpu=0 ; cpu < _SMP_Processor_count ; cpu++ ) {
e = _Per_CPU_Information[cpu].per_cpu.executing;
h = _Per_CPU_Information[cpu].per_cpu.heir;
printf(
" CPU %d: 0x%08x @%3ld / 0x%08x @%3ld %s\n",
cpu,
e->Object.id, (long) e->current_priority,
h->Object.id, (long) h->current_priority,
((_Per_CPU_Information[cpu].per_cpu.dispatch_necessary) ?
"true" : "false")
);
}
printf( "=== End of Ready Set of Threads\n" );
return 0;
}
|