diff options
| author | Bjoern Brandenburg <bbb@mpi-sws.org> | 2012-02-13 12:27:18 -0500 |
|---|---|---|
| committer | Bjoern Brandenburg <bbb@mpi-sws.org> | 2012-02-13 12:27:18 -0500 |
| commit | fc6f91abc9cf80350b756547c8fb9fc5cbdcbddc (patch) | |
| tree | 502446327d74ac1184e2e3803fbeae86a98d24a8 | |
| parent | 10dd550fb2a71eddd0a2251664d3320a3d09e600 (diff) | |
Remove hard-coded thresholdarchive/unc-master-3.0
The hard-coded threshold is a leftover from the beginnings. It can be
surprising and is no longer needed: outlier filtering should happen
during post-processing, if at all.
| -rw-r--r-- | src/ft2csv.c | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/src/ft2csv.c b/src/ft2csv.c index aceeb25..a6b1bf2 100644 --- a/src/ft2csv.c +++ b/src/ft2csv.c | |||
| @@ -37,7 +37,6 @@ static int only_cpu = -1; | |||
| 37 | 37 | ||
| 38 | static unsigned int complete = 0; | 38 | static unsigned int complete = 0; |
| 39 | static unsigned int incomplete = 0; | 39 | static unsigned int incomplete = 0; |
| 40 | static unsigned int filtered = 0; | ||
| 41 | static unsigned int skipped = 0; | 40 | static unsigned int skipped = 0; |
| 42 | static unsigned int non_rt = 0; | 41 | static unsigned int non_rt = 0; |
| 43 | static unsigned int interleaved = 0; | 42 | static unsigned int interleaved = 0; |
| @@ -45,8 +44,6 @@ static unsigned int avoided = 0; | |||
| 45 | 44 | ||
| 46 | #define CYCLES_PER_US 2128 | 45 | #define CYCLES_PER_US 2128 |
| 47 | 46 | ||
| 48 | static unsigned long long threshold = CYCLES_PER_US * 10000; /* 10 ms == 10 full ticks */ | ||
| 49 | |||
| 50 | static struct timestamp* next(struct timestamp* start, struct timestamp* end, | 47 | static struct timestamp* next(struct timestamp* start, struct timestamp* end, |
| 51 | int cpu) | 48 | int cpu) |
| 52 | { | 49 | { |
| @@ -128,9 +125,7 @@ static void show_csv(struct timestamp* first, struct timestamp *end) | |||
| 128 | 125 | ||
| 129 | second = find_second_ts(first, end); | 126 | second = find_second_ts(first, end); |
| 130 | if (second) { | 127 | if (second) { |
| 131 | if (second->timestamp - first->timestamp > threshold) | 128 | if (first->task_type != TSK_RT && |
| 132 | filtered++; | ||
| 133 | else if (first->task_type != TSK_RT && | ||
| 134 | second->task_type != TSK_RT && !want_best_effort) | 129 | second->task_type != TSK_RT && !want_best_effort) |
| 135 | non_rt++; | 130 | non_rt++; |
| 136 | else { | 131 | else { |
| @@ -281,12 +276,11 @@ int main(int argc, char** argv) | |||
| 281 | "Avoided : %10d\n" | 276 | "Avoided : %10d\n" |
| 282 | "Complete : %10d\n" | 277 | "Complete : %10d\n" |
| 283 | "Incomplete : %10d\n" | 278 | "Incomplete : %10d\n" |
| 284 | "Filtered : %10d\n" | ||
| 285 | "Non RT : %10d\n" | 279 | "Non RT : %10d\n" |
| 286 | "Interleaved : %10d\n", | 280 | "Interleaved : %10d\n", |
| 287 | (int) count, | 281 | (int) count, |
| 288 | skipped, avoided, complete, | 282 | skipped, avoided, complete, |
| 289 | incomplete, filtered, non_rt, | 283 | incomplete, non_rt, |
| 290 | interleaved); | 284 | interleaved); |
| 291 | 285 | ||
| 292 | return 0; | 286 | return 0; |
