Commit | Line | Data |
---|---|---|
263e529f JA |
1 | /* |
2 | * Status and ETA code | |
3 | */ | |
4 | #include <unistd.h> | |
5 | #include <fcntl.h> | |
6 | #include <string.h> | |
7 | ||
8 | #include "fio.h" | |
263e529f JA |
9 | |
10 | static char run_str[MAX_JOBS + 1]; | |
11 | ||
12 | /* | |
13 | * Sets the status of the 'td' in the printed status map. | |
14 | */ | |
15 | static void check_str_update(struct thread_data *td) | |
16 | { | |
17 | char c = run_str[td->thread_number - 1]; | |
18 | ||
19 | switch (td->runstate) { | |
5ec10eaa JA |
20 | case TD_REAPED: |
21 | c = '_'; | |
22 | break; | |
23 | case TD_EXITED: | |
24 | c = 'E'; | |
25 | break; | |
b29ee5b3 JA |
26 | case TD_RAMP: |
27 | c = '/'; | |
28 | break; | |
5ec10eaa JA |
29 | case TD_RUNNING: |
30 | if (td_rw(td)) { | |
31 | if (td_random(td)) | |
32 | c = 'm'; | |
33 | else | |
34 | c = 'M'; | |
35 | } else if (td_read(td)) { | |
36 | if (td_random(td)) | |
37 | c = 'r'; | |
38 | else | |
39 | c = 'R'; | |
40 | } else { | |
41 | if (td_random(td)) | |
42 | c = 'w'; | |
43 | else | |
44 | c = 'W'; | |
45 | } | |
46 | break; | |
47 | case TD_VERIFYING: | |
48 | c = 'V'; | |
49 | break; | |
50 | case TD_FSYNCING: | |
51 | c = 'F'; | |
52 | break; | |
53 | case TD_CREATED: | |
54 | c = 'C'; | |
55 | break; | |
56 | case TD_INITIALIZED: | |
57 | c = 'I'; | |
58 | break; | |
59 | case TD_NOT_CREATED: | |
60 | c = 'P'; | |
61 | break; | |
62 | default: | |
63 | log_err("state %d\n", td->runstate); | |
263e529f JA |
64 | } |
65 | ||
66 | run_str[td->thread_number - 1] = c; | |
67 | } | |
68 | ||
69 | /* | |
70 | * Convert seconds to a printable string. | |
71 | */ | |
9c02f6ef | 72 | static void eta_to_str(char *str, unsigned long eta_sec) |
263e529f JA |
73 | { |
74 | unsigned int d, h, m, s; | |
165faf16 | 75 | int disp_hour = 0; |
263e529f | 76 | |
263e529f JA |
77 | s = eta_sec % 60; |
78 | eta_sec /= 60; | |
79 | m = eta_sec % 60; | |
80 | eta_sec /= 60; | |
81 | h = eta_sec % 24; | |
82 | eta_sec /= 24; | |
83 | d = eta_sec; | |
84 | ||
165faf16 JA |
85 | if (d) { |
86 | disp_hour = 1; | |
1e97cce9 | 87 | str += sprintf(str, "%02ud:", d); |
263e529f | 88 | } |
165faf16 JA |
89 | |
90 | if (h || disp_hour) | |
1e97cce9 | 91 | str += sprintf(str, "%02uh:", h); |
263e529f | 92 | |
1e97cce9 JA |
93 | str += sprintf(str, "%02um:", m); |
94 | str += sprintf(str, "%02us", s); | |
263e529f JA |
95 | } |
96 | ||
97 | /* | |
98 | * Best effort calculation of the estimated pending runtime of a job. | |
99 | */ | |
b29ee5b3 | 100 | static int thread_eta(struct thread_data *td) |
263e529f JA |
101 | { |
102 | unsigned long long bytes_total, bytes_done; | |
1e97cce9 | 103 | unsigned long eta_sec = 0; |
b29ee5b3 JA |
104 | unsigned long elapsed; |
105 | ||
106 | elapsed = (mtime_since_now(&td->epoch) + 999) / 1000; | |
263e529f JA |
107 | |
108 | bytes_total = td->total_io_size; | |
109 | ||
74939e38 JA |
110 | /* |
111 | * if writing, bytes_total will be twice the size. If mixing, | |
112 | * assume a 50/50 split and thus bytes_total will be 50% larger. | |
113 | */ | |
0dd8377f | 114 | if (td->o.do_verify && td->o.verify && td_write(td)) { |
74939e38 JA |
115 | if (td_rw(td)) |
116 | bytes_total = bytes_total * 3 / 2; | |
117 | else | |
118 | bytes_total <<= 1; | |
119 | } | |
120 | ||
2dc1bbeb JA |
121 | if (td->o.zone_size && td->o.zone_skip) |
122 | bytes_total /= (td->o.zone_skip / td->o.zone_size); | |
263e529f | 123 | |
9c5a3854 SSY |
124 | if (td->o.fill_device && td->o.size == -1ULL) |
125 | return 0; | |
126 | ||
263e529f | 127 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) { |
cf4464ca | 128 | double perc, perc_t; |
263e529f JA |
129 | |
130 | bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]; | |
131 | perc = (double) bytes_done / (double) bytes_total; | |
132 | if (perc > 1.0) | |
133 | perc = 1.0; | |
134 | ||
cf4464ca JA |
135 | if (td->o.time_based) { |
136 | perc_t = (double) elapsed / (double) td->o.timeout; | |
137 | if (perc_t < perc) | |
138 | perc = perc_t; | |
139 | } | |
140 | ||
1e97cce9 | 141 | eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed; |
263e529f | 142 | |
d3eeeabc JA |
143 | if (td->o.timeout && |
144 | eta_sec > (td->o.timeout + done_secs - elapsed)) | |
145 | eta_sec = td->o.timeout + done_secs - elapsed; | |
263e529f | 146 | } else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED |
b29ee5b3 JA |
147 | || td->runstate == TD_INITIALIZED |
148 | || td->runstate == TD_RAMP) { | |
263e529f JA |
149 | int t_eta = 0, r_eta = 0; |
150 | ||
151 | /* | |
152 | * We can only guess - assume it'll run the full timeout | |
153 | * if given, otherwise assume it'll run at the specified rate. | |
154 | */ | |
b29ee5b3 | 155 | if (td->o.timeout) { |
d3eeeabc | 156 | t_eta = td->o.timeout + td->o.start_delay; |
b29ee5b3 JA |
157 | |
158 | if (in_ramp_time(td)) { | |
159 | unsigned long ramp_left; | |
160 | ||
161 | ramp_left = mtime_since_now(&td->start); | |
162 | ramp_left = (ramp_left + 999) / 1000; | |
163 | if (ramp_left <= t_eta) | |
164 | t_eta -= ramp_left; | |
165 | } | |
166 | } | |
2dc1bbeb JA |
167 | if (td->o.rate) { |
168 | r_eta = (bytes_total / 1024) / td->o.rate; | |
d3eeeabc | 169 | r_eta += td->o.start_delay; |
263e529f JA |
170 | } |
171 | ||
172 | if (r_eta && t_eta) | |
173 | eta_sec = min(r_eta, t_eta); | |
174 | else if (r_eta) | |
175 | eta_sec = r_eta; | |
176 | else if (t_eta) | |
177 | eta_sec = t_eta; | |
178 | else | |
179 | eta_sec = 0; | |
180 | } else { | |
181 | /* | |
182 | * thread is already done or waiting for fsync | |
183 | */ | |
184 | eta_sec = 0; | |
185 | } | |
186 | ||
187 | return eta_sec; | |
188 | } | |
189 | ||
46fda8d0 JA |
190 | static void calc_rate(unsigned long mtime, unsigned long long *io_bytes, |
191 | unsigned long long *prev_io_bytes, unsigned int *rate) | |
192 | { | |
193 | rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime; | |
194 | rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime; | |
195 | prev_io_bytes[0] = io_bytes[0]; | |
196 | prev_io_bytes[1] = io_bytes[1]; | |
197 | } | |
5ec10eaa | 198 | |
263e529f JA |
199 | /* |
200 | * Print status of the jobs we know about. This includes rate estimates, | |
201 | * ETA, thread state, etc. | |
202 | */ | |
203 | void print_thread_status(void) | |
204 | { | |
b29ee5b3 JA |
205 | unsigned long elapsed = (mtime_since_genesis() + 999) / 1000; |
206 | int i, nr_ramp, nr_running, nr_pending, t_rate, m_rate; | |
e6e41602 | 207 | int t_iops, m_iops, files_open; |
34572e28 | 208 | struct thread_data *td; |
2eaa41ce | 209 | char eta_str[128]; |
263e529f | 210 | double perc = 0.0; |
6043c579 | 211 | unsigned long long io_bytes[2]; |
d3eeeabc | 212 | unsigned long rate_time, disp_time, bw_avg_time, *eta_secs, eta_sec; |
46fda8d0 JA |
213 | struct timeval now; |
214 | ||
215 | static unsigned long long rate_io_bytes[2]; | |
216 | static unsigned long long disp_io_bytes[2]; | |
217 | static struct timeval rate_prev_time, disp_prev_time; | |
218 | static unsigned int rate[2]; | |
43819609 | 219 | static int linelen_last; |
cac58fd5 | 220 | static int eta_good; |
6043c579 | 221 | |
e592a06b AC |
222 | if (temp_stall_ts || terse_output || eta_print == FIO_ETA_NEVER) |
223 | return; | |
224 | ||
225 | if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS)) | |
263e529f JA |
226 | return; |
227 | ||
46fda8d0 JA |
228 | if (!rate_io_bytes[0] && !rate_io_bytes[1]) |
229 | fill_start_time(&rate_prev_time); | |
230 | if (!disp_io_bytes[0] && !disp_io_bytes[1]) | |
231 | fill_start_time(&disp_prev_time); | |
6043c579 | 232 | |
d3eeeabc JA |
233 | eta_secs = malloc(thread_number * sizeof(unsigned long)); |
234 | memset(eta_secs, 0, thread_number * sizeof(unsigned long)); | |
263e529f | 235 | |
6043c579 | 236 | io_bytes[0] = io_bytes[1] = 0; |
ac71feb1 | 237 | nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0; |
b29ee5b3 | 238 | nr_ramp = 0; |
bb3884d8 | 239 | bw_avg_time = ULONG_MAX; |
e6e41602 | 240 | files_open = 0; |
34572e28 | 241 | for_each_td(td, i) { |
2dc1bbeb JA |
242 | if (td->o.bw_avg_time < bw_avg_time) |
243 | bw_avg_time = td->o.bw_avg_time; | |
46fda8d0 JA |
244 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING |
245 | || td->runstate == TD_FSYNCING) { | |
263e529f | 246 | nr_running++; |
2dc1bbeb JA |
247 | t_rate += td->o.rate; |
248 | m_rate += td->o.ratemin; | |
ac71feb1 JA |
249 | t_iops += td->o.rate_iops; |
250 | m_iops += td->o.rate_iops_min; | |
e6e41602 | 251 | files_open += td->nr_open_files; |
b29ee5b3 JA |
252 | } else if (td->runstate == TD_RAMP) { |
253 | nr_running++; | |
254 | nr_ramp++; | |
263e529f JA |
255 | } else if (td->runstate < TD_RUNNING) |
256 | nr_pending++; | |
257 | ||
258 | if (elapsed >= 3) | |
b29ee5b3 | 259 | eta_secs[i] = thread_eta(td); |
263e529f JA |
260 | else |
261 | eta_secs[i] = INT_MAX; | |
262 | ||
263 | check_str_update(td); | |
b29ee5b3 JA |
264 | |
265 | if (td->runstate > TD_RAMP) { | |
266 | io_bytes[0] += td->io_bytes[0]; | |
267 | io_bytes[1] += td->io_bytes[1]; | |
268 | } | |
263e529f JA |
269 | } |
270 | ||
271 | if (exitall_on_terminate) | |
272 | eta_sec = INT_MAX; | |
273 | else | |
274 | eta_sec = 0; | |
275 | ||
34572e28 | 276 | for_each_td(td, i) { |
9c5a3854 SSY |
277 | if (exitall_on_terminate) { |
278 | if (eta_secs[i] < eta_sec) | |
279 | eta_sec = eta_secs[i]; | |
280 | } else { | |
281 | if (eta_secs[i] > eta_sec) | |
282 | eta_sec = eta_secs[i]; | |
283 | } | |
263e529f JA |
284 | } |
285 | ||
eecf272f JA |
286 | free(eta_secs); |
287 | ||
263e529f JA |
288 | if (eta_sec != INT_MAX && elapsed) { |
289 | perc = (double) elapsed / (double) (elapsed + eta_sec); | |
290 | eta_to_str(eta_str, eta_sec); | |
291 | } | |
292 | ||
46fda8d0 JA |
293 | fio_gettime(&now, NULL); |
294 | rate_time = mtime_since(&rate_prev_time, &now); | |
295 | ||
b29ee5b3 | 296 | if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) { |
46fda8d0 JA |
297 | calc_rate(rate_time, io_bytes, rate_io_bytes, rate); |
298 | memcpy(&rate_prev_time, &now, sizeof(now)); | |
306ddc97 JA |
299 | add_agg_sample(rate[DDIR_READ], DDIR_READ, 0); |
300 | add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE, 0); | |
6043c579 JA |
301 | } |
302 | ||
46fda8d0 JA |
303 | disp_time = mtime_since(&disp_prev_time, &now); |
304 | if (disp_time < 1000) | |
305 | return; | |
306 | ||
307 | calc_rate(disp_time, io_bytes, disp_io_bytes, rate); | |
308 | memcpy(&disp_prev_time, &now, sizeof(now)); | |
309 | ||
263e529f JA |
310 | if (!nr_running && !nr_pending) |
311 | return; | |
312 | ||
e6e41602 | 313 | printf("Jobs: %d (f=%d)", nr_running, files_open); |
263e529f | 314 | if (m_rate || t_rate) |
2cb8d960 | 315 | printf(", CR=%d/%d KiB/s", t_rate, m_rate); |
ac71feb1 JA |
316 | else if (m_iops || t_iops) |
317 | printf(", CR=%d/%d IOPS", t_iops, m_iops); | |
263e529f | 318 | if (eta_sec != INT_MAX && nr_running) { |
0721d11e | 319 | char perc_str[32]; |
5ec10eaa JA |
320 | int ll; |
321 | ||
b29ee5b3 | 322 | if ((!eta_sec && !eta_good) || nr_ramp == nr_running) |
cac58fd5 JA |
323 | strcpy(perc_str, "-.-% done"); |
324 | else { | |
325 | eta_good = 1; | |
326 | perc *= 100.0; | |
0721d11e | 327 | sprintf(perc_str, "%3.1f%% done", perc); |
cac58fd5 | 328 | } |
0721d11e | 329 | |
0721d11e JA |
330 | ll = printf(": [%s] [%s] [%6u/%6u kb/s] [eta %s]", |
331 | run_str, perc_str, rate[0], rate[1], eta_str); | |
5ec10eaa JA |
332 | if (ll >= 0 && ll < linelen_last) |
333 | printf("%*s", linelen_last - ll, ""); | |
334 | linelen_last = ll; | |
263e529f JA |
335 | } |
336 | printf("\r"); | |
337 | fflush(stdout); | |
263e529f JA |
338 | } |
339 | ||
340 | void print_status_init(int thread_number) | |
341 | { | |
342 | run_str[thread_number] = 'P'; | |
343 | } |