forked from cispa/Security-RISC
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtimer-resolution.c
More file actions
178 lines (140 loc) · 3.94 KB
/
timer-resolution.c
File metadata and controls
178 lines (140 loc) · 3.94 KB
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
#include "../rlibsc.h"
#include <memory.h>
#include <stdint.h>
#include <stdio.h>
#include <time.h>
#define TESTS 1000000
int in_range(size_t val, size_t div) {
return (val > (TESTS / div) * 0.9 && val < (TESTS / div) * 1.1);
}
inline uint64_t as_nanoseconds(struct timespec *ts) {
return ts->tv_sec * (uint64_t)1000000000L + ts->tv_nsec;
}
int main() {
size_t div = 100;
size_t best_top = 0;
size_t best_top_at = (size_t)-1;
struct timespec stamp;
do {
size_t hist[div];
memset(hist, 0, sizeof(hist));
for (size_t i = 0; i < TESTS; i++) {
clock_gettime(CLOCK_REALTIME, &stamp);
size_t val = as_nanoseconds(&stamp);
hist[val % div]++;
}
for (size_t i = 0; i < div; i++) {
if (hist[i] > best_top) {
best_top = hist[i];
best_top_at = div;
}
}
div--;
} while (div > 1);
if (best_top < TESTS * 0.9) {
printf("[+] clock_gettime Estimated increment: %.1f\n",
(double)(best_top_at * best_top) / TESTS);
} else {
printf("[+] clock_gettime Increment: %zd\n", best_top_at);
}
// -----------------------------------------------------------------------------------------------------------
div = 100;
best_top = 0;
best_top_at = (size_t)-1;
do {
size_t hist[div];
memset(hist, 0, sizeof(hist));
for (size_t i = 0; i < TESTS; i++) {
size_t val = rdcycle();
hist[val % div]++;
}
for (size_t i = 0; i < div; i++) {
if (hist[i] > best_top) {
best_top = hist[i];
best_top_at = div;
}
}
div--;
} while (div > 1);
if (best_top < TESTS * 0.9) {
printf("[+] rdcycle Estimated increment: %.1f\n",
(double)(best_top_at * best_top) / TESTS);
} else {
printf("[+] rdcycle Increment: %zd\n", best_top_at);
}
// -----------------------------------------------------------------------------------------------------------
div = 100;
best_top = 0;
best_top_at = (size_t)-1;
do {
size_t hist[div];
memset(hist, 0, sizeof(hist));
for (size_t i = 0; i < TESTS; i++) {
size_t val = get_cycle_perf();
hist[val % div]++;
}
for (size_t i = 0; i < div; i++) {
if (hist[i] > best_top) {
best_top = hist[i];
best_top_at = div;
}
}
div--;
} while (div > 1);
if (best_top < TESTS * 0.9) {
printf("[+] get_cycle_perf Estimated increment: %.1f\n",
(double)(best_top_at * best_top) / TESTS);
} else {
printf("[+] get_cycle_perf Increment: %zd\n", best_top_at);
}
// -----------------------------------------------------------------------------------------------------------
div = 100;
best_top = 0;
best_top_at = (size_t)-1;
do {
size_t hist[div];
memset(hist, 0, sizeof(hist));
for (size_t i = 0; i < TESTS; i++) {
size_t val = rdtime();
hist[val % div]++;
}
for (size_t i = 0; i < div; i++) {
if (hist[i] > best_top) {
best_top = hist[i];
best_top_at = div;
}
}
div--;
} while (div > 1);
if (best_top < TESTS * 0.9) {
printf("[+] rdtime Estimated increment: %.1f\n",
(double)(best_top_at * best_top) / TESTS);
} else {
printf("[+] rdtime Increment: %zd\n", best_top_at);
}
// -----------------------------------------------------------------------------------------------------------
div = 100;
best_top = 0;
best_top_at = (size_t)-1;
do {
size_t hist[div];
memset(hist, 0, sizeof(hist));
for (size_t i = 0; i < TESTS; i++) {
size_t val = get_time_perf();
hist[val % div]++;
}
for (size_t i = 0; i < div; i++) {
if (hist[i] > best_top) {
best_top = hist[i];
best_top_at = div;
}
}
div--;
} while (div > 1);
if (best_top < TESTS * 0.9) {
printf("[+] get_time_perf Estimated increment: %.1f\n",
(double)(best_top_at * best_top) / TESTS);
} else {
printf("[+] get_time_perf Increment: %zd\n", best_top_at);
}
}