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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include "mapping.h"
#include "timestamp.h"
int no_interleaved = 1;
static unsigned int complete = 0;
static unsigned int incomplete = 0;
static unsigned int filtered = 0;
static unsigned int skipped = 0;
static unsigned int non_rt = 0;
static unsigned int interleaved = 0;
static unsigned long long threshold = 2700 * 1000; /* 1 ms == 1 full tick */
//static unsigned long long threshold = 2700 * 50; /* 1 ms == 1 full tick */
static struct timestamp* next(struct timestamp* start, struct timestamp* end,
int cpu)
{
struct timestamp* pos;
for (pos = start; pos != end && pos->cpu != cpu; pos++);
return pos != end ? pos : NULL;
}
static struct timestamp* next_id(struct timestamp* start, struct timestamp* end,
int cpu, unsigned long id, unsigned long stop_id)
{
struct timestamp* pos = start;
int restarts = 0;
while ((pos = next(pos, end, cpu))) {
if (pos->event == id)
break;
else if (pos->event == stop_id)
return NULL;
pos++;
restarts++;
if (no_interleaved)
return NULL;
}
if (pos)
interleaved += restarts;
return pos;
}
static struct timestamp* find_second_ts(struct timestamp* start, struct timestamp* end)
{
/* convention: the end->event is start->event + 1 */
return next_id(start + 1, end, start->cpu, start->event + 1, start->event);
}
static void show_csv(struct timestamp* first, struct timestamp *end)
{
struct timestamp *second;
second = find_second_ts(first, end);
if (second) {
if (second->timestamp - first->timestamp > threshold)
filtered++;
else if (first->task_type != TSK_RT &&
second->task_type != TSK_RT)
non_rt++;
else {
printf("%llu, %llu, %llu\n",
(unsigned long long) first->timestamp,
(unsigned long long) second->timestamp,
(unsigned long long)
(second->timestamp - first->timestamp));
complete++;
}
} else
incomplete++;
}
static void show_id(struct timestamp* start, struct timestamp* end,
unsigned long id)
{
while (start !=end && start->event != id + 1) {
skipped++;
start++;
}
for (; start != end; start++)
if (start->event == id)
show_csv(start, end);
}
static void die(char* msg)
{
if (errno)
perror("error: ");
fprintf(stderr, "%s\n", msg);
exit(1);
}
int main(int argc, char** argv)
{
void* mapped;
size_t size, count;
struct timestamp *ts, *end;
cmd_t id;
if (argc != 3)
die("Usage: ft2csv <event_name> <logfile>");
if (map_file(argv[2], &mapped, &size))
die("could not map file");
if (!str2event(argv[1], &id))
die("Unknown event!");
ts = (struct timestamp*) mapped;
count = size / sizeof(struct timestamp);
end = ts + count;
show_id(ts, end, id);
fprintf(stderr,
"Total : %10d\n"
"Skipped : %10d\n"
"Complete : %10d\n"
"Incomplete : %10d\n"
"Filtered : %10d\n"
"Non RT : %10d\n"
"Interleaved : %10d\n",
(int) count,
skipped, complete,
incomplete, filtered, non_rt,
interleaved);
return 0;
}
|
