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
|
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include "load.h"
#include "sched_trace.h"
#include "eheap.h"
/* limit search window in case of missing completions */
#define MAX_COMPLETIONS_TO_CHECK 20
int want_ms = 0;
static double nano_to_ms(int64_t ns)
{
return ns * 1E-6;
}
static void count_preemptions(
struct evlink *release,
struct evlink *completion,
unsigned int *preemptions,
unsigned int *migrations)
{
struct evlink *e;
int seen_switched_away = 0;
u8 last_cpu = 0;
for (e = release; e != completion; e = e->next) {
if (e->rec->hdr.job == release->rec->hdr.job) {
switch (e->rec->hdr.type) {
case ST_SWITCH_AWAY:
seen_switched_away = 1;
last_cpu = e->rec->hdr.cpu;
break;
case ST_SWITCH_TO:
if (seen_switched_away)
(*preemptions)++;
if (seen_switched_away &&
e->rec->hdr.cpu != last_cpu)
(*migrations)++;
break;
default:
break;
}
}
}
}
static void print_stats(
struct task* t,
struct evlink *release,
struct evlink *completion)
{
int64_t lateness;
u64 response;
unsigned int preemptions = 0, migrations = 0;
lateness = completion->rec->data.completion.when;
lateness -= release->rec->data.release.deadline;
response = completion->rec->data.completion.when;
response -= release->rec->data.release.release;
count_preemptions(release, completion, &preemptions, &migrations);
if (want_ms)
printf(" %5u, %5u, %10.2f, %10.2f, %8d, %10.2f, %10.2f, %7d"
", %10.2f, %12u, %12u\n",
release->rec->hdr.pid,
release->rec->hdr.job,
nano_to_ms(per(t)),
nano_to_ms(response),
lateness > 0,
nano_to_ms(lateness),
lateness > 0 ? nano_to_ms(lateness) : 0,
completion->rec->data.completion.forced,
nano_to_ms(completion->rec->data.completion.exec_time),
preemptions,
migrations);
else
printf(" %5u, %5u, %10llu, %10llu, %8d, %10lld, %10lld, %7d"
", %10llu, %12u, %12u\n",
release->rec->hdr.pid,
release->rec->hdr.job,
(unsigned long long) per(t),
(unsigned long long) response,
lateness > 0,
(long long) lateness,
lateness > 0 ? (long long) lateness : 0,
completion->rec->data.completion.forced,
(unsigned long long) completion->rec->data.completion.exec_time,
preemptions,
migrations);
}
static void print_task_info(struct task *t)
{
if (want_ms)
printf("# task NAME=%s PID=%d COST=%.2f PERIOD=%.2f CPU=%d\n",
tsk_name(t),
t->pid,
nano_to_ms(exe(t)),
nano_to_ms(per(t)),
tsk_cpu(t));
else
printf("# task NAME=%s PID=%d COST=%lu PERIOD=%lu CPU=%d\n",
tsk_name(t),
t->pid,
(unsigned long) exe(t),
(unsigned long) per(t),
tsk_cpu(t));
}
static void usage(const char *str)
{
fprintf(stderr,
"\n USAGE\n"
"\n"
" st_job_stats [opts] <file.st>+\n"
"\n"
" OPTIONS\n"
" -r -- skip jobs prior to task-system release\n"
" -m -- output milliseconds (default: nanoseconds)\n"
" -p PID -- show only data for the task with the given PID\n"
" -n NAME -- show only data for the task(s) with the given NAME\n"
" -t PERIOD -- show only data for the task(s) with the given PERIOD\n"
"\n\n"
);
if (str) {
fprintf(stderr, "Aborted: %s\n", str);
exit(1);
} else {
exit(0);
}
}
#define OPTSTR "rmp:n:t:h"
int main(int argc, char** argv)
{
unsigned int count;
struct heap *h;
struct task *t;
struct evlink *e, *pos;
struct st_event_record *rec;
int wait_for_release = 0;
u64 sys_release = 0;
unsigned int pid_filter = 0;
const char* name_filter = 0;
u32 period_filter = 0;
int opt;
while ((opt = getopt(argc, argv, OPTSTR)) != -1) {
switch (opt) {
case 'r':
wait_for_release = 1;
break;
case 'm':
want_ms = 1;
break;
case 'p':
pid_filter = atoi(optarg);
if (!pid_filter)
usage("Invalid PID.");
break;
case 't':
period_filter = atoi(optarg);
if (!period_filter)
usage("Invalid period.");
break;
case 'n':
name_filter = optarg;
break;
case 'h':
usage(NULL);
break;
case ':':
usage("Argument missing.");
break;
case '?':
default:
usage("Bad argument.");
break;
}
}
if (want_ms)
period_filter *= 1000000; /* ns per ms */
h = load(argv + optind, argc - optind, &count);
if (!h)
return 1;
init_tasks();
split(h, count, 1);
if (wait_for_release) {
rec = find_sys_event(ST_SYS_RELEASE);
if (rec)
sys_release = rec->data.sys_release.release;
else {
fprintf(stderr, "Could not find task system "
"release time.\n");
exit(1);
}
}
/* print header */
printf("#%5s, %5s, %10s, %10s, %8s, %10s, %10s, %7s, %10s, %12s, %12s\n",
"Task",
"Job",
"Period",
"Response",
"DL Miss?",
"Lateness",
"Tardiness",
"Forced?",
"ACET",
"Preemptions",
"Migrations");
/* print stats for each task */
for_each_task(t) {
if (pid_filter && pid_filter != t->pid)
continue;
if (name_filter && strcmp(tsk_name(t), name_filter))
continue;
if (period_filter && period_filter != per(t))
continue;
print_task_info(t);
for_each_event(t, e) {
rec = e->rec;
if (rec->hdr.type == ST_RELEASE &&
(!wait_for_release ||
rec->data.release.release >= sys_release)) {
pos = e;
count = 0;
while (pos && count < MAX_COMPLETIONS_TO_CHECK) {
find(pos, ST_COMPLETION);
if (pos->rec->hdr.job == rec->hdr.job) {
print_stats(t, e, pos);
break;
} else {
pos = pos->next;
count++;
}
}
}
}
}
return 0;
}
|
