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" | |
9 | #include "os.h" | |
10 | ||
11 | static char run_str[MAX_JOBS + 1]; | |
12 | ||
13 | /* | |
14 | * Sets the status of the 'td' in the printed status map. | |
15 | */ | |
16 | static void check_str_update(struct thread_data *td) | |
17 | { | |
18 | char c = run_str[td->thread_number - 1]; | |
19 | ||
20 | switch (td->runstate) { | |
21 | case TD_REAPED: | |
22 | c = '_'; | |
23 | break; | |
24 | case TD_EXITED: | |
25 | c = 'E'; | |
26 | break; | |
27 | case TD_RUNNING: | |
28 | if (td_rw(td)) { | |
413dd459 | 29 | if (td_random(td)) |
263e529f | 30 | c = 'm'; |
263e529f | 31 | else |
413dd459 JA |
32 | c = 'M'; |
33 | } else if (td_read(td)) { | |
34 | if (td_random(td)) | |
263e529f | 35 | c = 'r'; |
263e529f | 36 | else |
413dd459 JA |
37 | c = 'R'; |
38 | } else { | |
39 | if (td_random(td)) | |
263e529f | 40 | c = 'w'; |
413dd459 JA |
41 | else |
42 | c = 'W'; | |
263e529f JA |
43 | } |
44 | break; | |
45 | case TD_VERIFYING: | |
46 | c = 'V'; | |
47 | break; | |
48 | case TD_FSYNCING: | |
49 | c = 'F'; | |
50 | break; | |
51 | case TD_CREATED: | |
52 | c = 'C'; | |
53 | break; | |
54 | case TD_INITIALIZED: | |
55 | c = 'I'; | |
56 | break; | |
57 | case TD_NOT_CREATED: | |
58 | c = 'P'; | |
59 | break; | |
60 | default: | |
61 | log_err("state %d\n", td->runstate); | |
62 | } | |
63 | ||
64 | run_str[td->thread_number - 1] = c; | |
65 | } | |
66 | ||
67 | /* | |
68 | * Convert seconds to a printable string. | |
69 | */ | |
70 | static void eta_to_str(char *str, int eta_sec) | |
71 | { | |
72 | unsigned int d, h, m, s; | |
165faf16 | 73 | int disp_hour = 0; |
263e529f JA |
74 | |
75 | d = h = m = s = 0; | |
76 | ||
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 | */ | |
100 | static int thread_eta(struct thread_data *td, unsigned long elapsed) | |
101 | { | |
102 | unsigned long long bytes_total, bytes_done; | |
1e97cce9 | 103 | unsigned long eta_sec = 0; |
263e529f JA |
104 | |
105 | bytes_total = td->total_io_size; | |
106 | ||
74939e38 JA |
107 | /* |
108 | * if writing, bytes_total will be twice the size. If mixing, | |
109 | * assume a 50/50 split and thus bytes_total will be 50% larger. | |
110 | */ | |
2dc1bbeb | 111 | if (td->o.verify) { |
74939e38 JA |
112 | if (td_rw(td)) |
113 | bytes_total = bytes_total * 3 / 2; | |
114 | else | |
115 | bytes_total <<= 1; | |
116 | } | |
117 | ||
2dc1bbeb JA |
118 | if (td->o.zone_size && td->o.zone_skip) |
119 | bytes_total /= (td->o.zone_skip / td->o.zone_size); | |
263e529f JA |
120 | |
121 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) { | |
122 | double perc; | |
123 | ||
124 | bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]; | |
125 | perc = (double) bytes_done / (double) bytes_total; | |
126 | if (perc > 1.0) | |
127 | perc = 1.0; | |
128 | ||
1e97cce9 | 129 | eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed; |
263e529f | 130 | |
2dc1bbeb JA |
131 | if (td->o.timeout && eta_sec > (td->o.timeout - elapsed)) |
132 | eta_sec = td->o.timeout - elapsed; | |
263e529f JA |
133 | } else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED |
134 | || td->runstate == TD_INITIALIZED) { | |
135 | int t_eta = 0, r_eta = 0; | |
136 | ||
137 | /* | |
138 | * We can only guess - assume it'll run the full timeout | |
139 | * if given, otherwise assume it'll run at the specified rate. | |
140 | */ | |
2dc1bbeb JA |
141 | if (td->o.timeout) |
142 | t_eta = td->o.timeout + td->o.start_delay - elapsed; | |
143 | if (td->o.rate) { | |
144 | r_eta = (bytes_total / 1024) / td->o.rate; | |
145 | r_eta += td->o.start_delay - elapsed; | |
263e529f JA |
146 | } |
147 | ||
148 | if (r_eta && t_eta) | |
149 | eta_sec = min(r_eta, t_eta); | |
150 | else if (r_eta) | |
151 | eta_sec = r_eta; | |
152 | else if (t_eta) | |
153 | eta_sec = t_eta; | |
154 | else | |
155 | eta_sec = 0; | |
156 | } else { | |
157 | /* | |
158 | * thread is already done or waiting for fsync | |
159 | */ | |
160 | eta_sec = 0; | |
161 | } | |
162 | ||
163 | return eta_sec; | |
164 | } | |
165 | ||
46fda8d0 JA |
166 | static void calc_rate(unsigned long mtime, unsigned long long *io_bytes, |
167 | unsigned long long *prev_io_bytes, unsigned int *rate) | |
168 | { | |
169 | rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime; | |
170 | rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime; | |
171 | prev_io_bytes[0] = io_bytes[0]; | |
172 | prev_io_bytes[1] = io_bytes[1]; | |
173 | } | |
174 | ||
263e529f JA |
175 | /* |
176 | * Print status of the jobs we know about. This includes rate estimates, | |
177 | * ETA, thread state, etc. | |
178 | */ | |
179 | void print_thread_status(void) | |
180 | { | |
181 | unsigned long elapsed = mtime_since_genesis() / 1000; | |
182 | int i, nr_running, nr_pending, t_rate, m_rate, *eta_secs, eta_sec; | |
ac71feb1 | 183 | int t_iops, m_iops; |
34572e28 | 184 | struct thread_data *td; |
2eaa41ce | 185 | char eta_str[128]; |
263e529f | 186 | double perc = 0.0; |
6043c579 | 187 | unsigned long long io_bytes[2]; |
46fda8d0 JA |
188 | unsigned long rate_time, disp_time, bw_avg_time; |
189 | struct timeval now; | |
190 | ||
191 | static unsigned long long rate_io_bytes[2]; | |
192 | static unsigned long long disp_io_bytes[2]; | |
193 | static struct timeval rate_prev_time, disp_prev_time; | |
194 | static unsigned int rate[2]; | |
6043c579 | 195 | |
263e529f JA |
196 | if (temp_stall_ts || terse_output) |
197 | return; | |
198 | ||
46fda8d0 JA |
199 | if (!rate_io_bytes[0] && !rate_io_bytes[1]) |
200 | fill_start_time(&rate_prev_time); | |
201 | if (!disp_io_bytes[0] && !disp_io_bytes[1]) | |
202 | fill_start_time(&disp_prev_time); | |
6043c579 | 203 | |
263e529f JA |
204 | eta_secs = malloc(thread_number * sizeof(int)); |
205 | memset(eta_secs, 0, thread_number * sizeof(int)); | |
206 | ||
6043c579 | 207 | io_bytes[0] = io_bytes[1] = 0; |
ac71feb1 | 208 | nr_pending = nr_running = t_rate = m_rate = t_iops = m_iops = 0; |
bb3884d8 | 209 | bw_avg_time = ULONG_MAX; |
34572e28 | 210 | for_each_td(td, i) { |
2dc1bbeb JA |
211 | if (td->o.bw_avg_time < bw_avg_time) |
212 | bw_avg_time = td->o.bw_avg_time; | |
46fda8d0 JA |
213 | if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING |
214 | || td->runstate == TD_FSYNCING) { | |
263e529f | 215 | nr_running++; |
2dc1bbeb JA |
216 | t_rate += td->o.rate; |
217 | m_rate += td->o.ratemin; | |
ac71feb1 JA |
218 | t_iops += td->o.rate_iops; |
219 | m_iops += td->o.rate_iops_min; | |
263e529f JA |
220 | } else if (td->runstate < TD_RUNNING) |
221 | nr_pending++; | |
222 | ||
223 | if (elapsed >= 3) | |
224 | eta_secs[i] = thread_eta(td, elapsed); | |
225 | else | |
226 | eta_secs[i] = INT_MAX; | |
227 | ||
228 | check_str_update(td); | |
6043c579 JA |
229 | io_bytes[0] += td->io_bytes[0]; |
230 | io_bytes[1] += td->io_bytes[1]; | |
263e529f JA |
231 | } |
232 | ||
233 | if (exitall_on_terminate) | |
234 | eta_sec = INT_MAX; | |
235 | else | |
236 | eta_sec = 0; | |
237 | ||
34572e28 | 238 | for_each_td(td, i) { |
263e529f JA |
239 | if (exitall_on_terminate) { |
240 | if (eta_secs[i] < eta_sec) | |
241 | eta_sec = eta_secs[i]; | |
242 | } else { | |
243 | if (eta_secs[i] > eta_sec) | |
244 | eta_sec = eta_secs[i]; | |
245 | } | |
246 | } | |
247 | ||
eecf272f JA |
248 | free(eta_secs); |
249 | ||
263e529f JA |
250 | if (eta_sec != INT_MAX && elapsed) { |
251 | perc = (double) elapsed / (double) (elapsed + eta_sec); | |
252 | eta_to_str(eta_str, eta_sec); | |
253 | } | |
254 | ||
46fda8d0 JA |
255 | fio_gettime(&now, NULL); |
256 | rate_time = mtime_since(&rate_prev_time, &now); | |
257 | ||
258 | if (write_bw_log && rate_time> bw_avg_time) { | |
259 | calc_rate(rate_time, io_bytes, rate_io_bytes, rate); | |
260 | memcpy(&rate_prev_time, &now, sizeof(now)); | |
261 | add_agg_sample(rate[DDIR_READ], DDIR_READ); | |
262 | add_agg_sample(rate[DDIR_WRITE], DDIR_WRITE); | |
6043c579 JA |
263 | } |
264 | ||
46fda8d0 JA |
265 | disp_time = mtime_since(&disp_prev_time, &now); |
266 | if (disp_time < 1000) | |
267 | return; | |
268 | ||
269 | calc_rate(disp_time, io_bytes, disp_io_bytes, rate); | |
270 | memcpy(&disp_prev_time, &now, sizeof(now)); | |
271 | ||
263e529f JA |
272 | if (!nr_running && !nr_pending) |
273 | return; | |
274 | ||
9cedf167 | 275 | printf("Jobs: %d", nr_running); |
263e529f | 276 | if (m_rate || t_rate) |
2cb8d960 | 277 | printf(", CR=%d/%d KiB/s", t_rate, m_rate); |
ac71feb1 JA |
278 | else if (m_iops || t_iops) |
279 | printf(", CR=%d/%d IOPS", t_iops, m_iops); | |
263e529f JA |
280 | if (eta_sec != INT_MAX && nr_running) { |
281 | perc *= 100.0; | |
46fda8d0 | 282 | printf(": [%s] [%3.1f%% done] [%6u/%6u kb/s] [eta %s]", run_str, perc, rate[0], rate[1], eta_str); |
263e529f JA |
283 | } |
284 | printf("\r"); | |
285 | fflush(stdout); | |
263e529f JA |
286 | } |
287 | ||
288 | void print_status_init(int thread_number) | |
289 | { | |
290 | run_str[thread_number] = 'P'; | |
291 | } |