[fio.git] / eta.c

/*
 * Status and ETA code
 */
#include <unistd.h>
#include <fcntl.h>
#include <string.h>

#include "fio.h"

static char run_str[REAL_MAX_JOBS + 1];

/*
 * Sets the status of the 'td' in the printed status map.
 */
static void check_str_update(struct thread_data *td)
{
	char c = run_str[td->thread_number - 1];

	switch (td->runstate) {
	case TD_REAPED:
		if (td->error)
			c = 'X';
		else if (td->sig)
			c = 'K';
		else
			c = '_';
		break;
	case TD_EXITED:
		c = 'E';
		break;
	case TD_RAMP:
		c = '/';
		break;
	case TD_RUNNING:
		if (td_rw(td)) {
			if (td_random(td)) {
				if (td->o.rwmix[DDIR_READ] == 100)
					c = 'r';
				else if (td->o.rwmix[DDIR_WRITE] == 100)
					c = 'w';
				else
					c = 'm';
			} else {
				if (td->o.rwmix[DDIR_READ] == 100)
					c = 'R';
				else if (td->o.rwmix[DDIR_WRITE] == 100)
					c = 'W';
				else
					c = 'M';
			}
		} else if (td_read(td)) {
			if (td_random(td))
				c = 'r';
			else
				c = 'R';
		} else {
			if (td_random(td))
				c = 'w';
			else
				c = 'W';
		}
		break;
	case TD_PRE_READING:
		c = 'p';
		break;
	case TD_VERIFYING:
		c = 'V';
		break;
	case TD_FSYNCING:
		c = 'F';
		break;
	case TD_CREATED:
		c = 'C';
		break;
	case TD_INITIALIZED:
		c = 'I';
		break;
	case TD_NOT_CREATED:
		c = 'P';
		break;
	default:
		log_err("state %d\n", td->runstate);
	}

	run_str[td->thread_number - 1] = c;
}

/*
 * Convert seconds to a printable string.
 */
static void eta_to_str(char *str, unsigned long eta_sec)
{
	unsigned int d, h, m, s;
	int disp_hour = 0;

	s = eta_sec % 60;
	eta_sec /= 60;
	m = eta_sec % 60;
	eta_sec /= 60;
	h = eta_sec % 24;
	eta_sec /= 24;
	d = eta_sec;

	if (d) {
		disp_hour = 1;
		str += sprintf(str, "%02ud:", d);
	}

	if (h || disp_hour)
		str += sprintf(str, "%02uh:", h);

	str += sprintf(str, "%02um:", m);
	str += sprintf(str, "%02us", s);
}

/*
 * Best effort calculation of the estimated pending runtime of a job.
 */
static int thread_eta(struct thread_data *td)
{
	unsigned long long bytes_total, bytes_done;
	unsigned long eta_sec = 0;
	unsigned long elapsed;

	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;

	bytes_total = td->total_io_size;

	if (td->o.fill_device && td->o.size  == -1ULL) {
		if (!td->fill_device_size || td->fill_device_size == -1ULL)
			return 0;

		bytes_total = td->fill_device_size;
	}

	/*
	 * if writing, bytes_total will be twice the size. If mixing,
	 * assume a 50/50 split and thus bytes_total will be 50% larger.
	 */
	if (td->o.do_verify && td->o.verify && td_write(td)) {
		if (td_rw(td))
			bytes_total = bytes_total * 3 / 2;
		else
			bytes_total <<= 1;
	}

	if (td->o.zone_size && td->o.zone_skip)
		bytes_total /= (td->o.zone_skip / td->o.zone_size);

	if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING) {
		double perc, perc_t;

		bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE];
		perc = (double) bytes_done / (double) bytes_total;
		if (perc > 1.0)
			perc = 1.0;

		if (td->o.time_based) {
			perc_t = (double) elapsed / (double) td->o.timeout;
			if (perc_t < perc)
				perc = perc_t;
		}

		eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;

		if (td->o.timeout &&
		    eta_sec > (td->o.timeout + done_secs - elapsed))
			eta_sec = td->o.timeout + done_secs - elapsed;
	} else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED
			|| td->runstate == TD_INITIALIZED
			|| td->runstate == TD_RAMP
			|| td->runstate == TD_PRE_READING) {
		int t_eta = 0, r_eta = 0;

		/*
		 * We can only guess - assume it'll run the full timeout
		 * if given, otherwise assume it'll run at the specified rate.
		 */
		if (td->o.timeout) {
			t_eta = td->o.timeout + td->o.start_delay +
					td->o.ramp_time;

			if (in_ramp_time(td)) {
				unsigned long ramp_left;

				ramp_left = mtime_since_now(&td->epoch);
				ramp_left = (ramp_left + 999) / 1000;
				if (ramp_left <= t_eta)
					t_eta -= ramp_left;
			}
		}
		if (td->o.rate[0] || td->o.rate[1]) {
			r_eta = (bytes_total / 1024) /
					(td->o.rate[0] + td->o.rate[1]);
			r_eta += td->o.start_delay;
		}

		if (r_eta && t_eta)
			eta_sec = min(r_eta, t_eta);
		else if (r_eta)
			eta_sec = r_eta;
		else if (t_eta)
			eta_sec = t_eta;
		else
			eta_sec = 0;
	} else {
		/*
		 * thread is already done or waiting for fsync
		 */
		eta_sec = 0;
	}

	return eta_sec;
}

static void calc_rate(unsigned long mtime, unsigned long long *io_bytes,
		      unsigned long long *prev_io_bytes, unsigned int *rate)
{
	rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime;
	rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime;
	prev_io_bytes[0] = io_bytes[0];
	prev_io_bytes[1] = io_bytes[1];
}

static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
		      unsigned long long *prev_io_iops, unsigned int *iops)
{
	iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime;
	iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime;
	prev_io_iops[0] = io_iops[0];
	prev_io_iops[1] = io_iops[1];
}

/*
 * Print status of the jobs we know about. This includes rate estimates,
 * ETA, thread state, etc.
 */
int calc_thread_status(struct jobs_eta *je, int force)
{
	struct thread_data *td;
	int i;
	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
	unsigned long long io_bytes[2];
	unsigned long long io_iops[2];
	struct timeval now;

	static unsigned long long rate_io_bytes[2];
	static unsigned long long disp_io_bytes[2];
	static unsigned long long disp_io_iops[2];
	static struct timeval rate_prev_time, disp_prev_time;
	int i2p = 0;

	if (!force) {
		if (temp_stall_ts || terse_output || eta_print == FIO_ETA_NEVER)
			return 0;

		if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
			return 0;
	}

	if (!rate_io_bytes[0] && !rate_io_bytes[1])
		fill_start_time(&rate_prev_time);
	if (!disp_io_bytes[0] && !disp_io_bytes[1])
		fill_start_time(&disp_prev_time);

	eta_secs = malloc(thread_number * sizeof(unsigned long));
	memset(eta_secs, 0, thread_number * sizeof(unsigned long));

	je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;

	io_bytes[0] = io_bytes[1] = 0;
	io_iops[0] = io_iops[1] = 0;
	bw_avg_time = ULONG_MAX;
	for_each_td(td, i) {
		if (td->o.bw_avg_time < bw_avg_time)
			bw_avg_time = td->o.bw_avg_time;
		if (td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING
		    || td->runstate == TD_FSYNCING
		    || td->runstate == TD_PRE_READING) {
			je->nr_running++;
			je->t_rate += td->o.rate[0] + td->o.rate[1];
			je->m_rate += td->o.ratemin[0] + td->o.ratemin[1];
			je->t_iops += td->o.rate_iops[0] + td->o.rate_iops[1];
			je->m_iops += td->o.rate_iops_min[0] +
					td->o.rate_iops_min[1];
			je->files_open += td->nr_open_files;
		} else if (td->runstate == TD_RAMP) {
			je->nr_running++;
			je->nr_ramp++;
		} else if (td->runstate < TD_RUNNING)
			je->nr_pending++;

		if (je->elapsed_sec >= 3)
			eta_secs[i] = thread_eta(td);
		else
			eta_secs[i] = INT_MAX;

		check_str_update(td);

		if (td->runstate > TD_RAMP) {
			io_bytes[0] += td->io_bytes[0];
			io_bytes[1] += td->io_bytes[1];
			io_iops[0] += td->io_blocks[0];
			io_iops[1] += td->io_blocks[1];
		}
	}

	if (exitall_on_terminate)
		je->eta_sec = INT_MAX;
	else
		je->eta_sec = 0;

	for_each_td(td, i) {
		if (!i2p && is_power_of_2(td->o.kb_base))
			i2p = 1;
		if (exitall_on_terminate) {
			if (eta_secs[i] < je->eta_sec)
				je->eta_sec = eta_secs[i];
		} else {
			if (eta_secs[i] > je->eta_sec)
				je->eta_sec = eta_secs[i];
		}
	}

	free(eta_secs);

	fio_gettime(&now, NULL);
	rate_time = mtime_since(&rate_prev_time, &now);

	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
		calc_rate(rate_time, io_bytes, rate_io_bytes, je->rate);
		memcpy(&rate_prev_time, &now, sizeof(now));
		add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
		add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
	}

	disp_time = mtime_since(&disp_prev_time, &now);

	/*
	 * Allow a little slack, the target is to print it every 1000 msecs
	 */
	if (!force && disp_time < 900)
		return 0;

	calc_rate(disp_time, io_bytes, disp_io_bytes, je->rate);
	calc_iops(disp_time, io_iops, disp_io_iops, je->iops);

	memcpy(&disp_prev_time, &now, sizeof(now));

	if (!force && !je->nr_running && !je->nr_pending)
		return 0;

	je->nr_threads = thread_number;
	memcpy(je->run_str, run_str, thread_number * sizeof(char));

	return 1;
}

void display_thread_status(struct jobs_eta *je)
{
	static int linelen_last;
	static int eta_good;
	char output[REAL_MAX_JOBS + 512], *p = output;
	char eta_str[128];
	double perc = 0.0;
	int i2p = 0;

	if (je->eta_sec != INT_MAX && je->elapsed_sec) {
		perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
		eta_to_str(eta_str, je->eta_sec);
	}

	p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
	if (je->m_rate || je->t_rate) {
		char *tr, *mr;

		mr = num2str(je->m_rate, 4, 0, i2p);
		tr = num2str(je->t_rate, 4, 0, i2p);
		p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
		free(tr);
		free(mr);
	} else if (je->m_iops || je->t_iops)
		p += sprintf(p, ", CR=%d/%d IOPS", je->t_iops, je->m_iops);
	if (je->eta_sec != INT_MAX && je->nr_running) {
		char perc_str[32];
		char *iops_str[2];
		char *rate_str[2];
		size_t left;
		int l;

		if ((!je->eta_sec && !eta_good) || je->nr_ramp == je->nr_running)
			strcpy(perc_str, "-.-% done");
		else {
			eta_good = 1;
			perc *= 100.0;
			sprintf(perc_str, "%3.1f%% done", perc);
		}

		rate_str[0] = num2str(je->rate[0], 5, 10, i2p);
		rate_str[1] = num2str(je->rate[1], 5, 10, i2p);

		iops_str[0] = num2str(je->iops[0], 4, 1, 0);
		iops_str[1] = num2str(je->iops[1], 4, 1, 0);

		left = sizeof(output) - (p - output) - 1;

		l = snprintf(p, left, ": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
				je->run_str, perc_str, rate_str[0],
				rate_str[1], iops_str[0], iops_str[1], eta_str);
		p += l;
		if (l >= 0 && l < linelen_last)
			p += sprintf(p, "%*s", linelen_last - l, "");
		linelen_last = l;

		free(rate_str[0]);
		free(rate_str[1]);
		free(iops_str[0]);
		free(iops_str[1]);
	}
	p += sprintf(p, "\r");

	printf("%s", output);
	fflush(stdout);
}

void print_thread_status(void)
{
	struct jobs_eta *je;
	size_t size;

	if (!thread_number)
		return;

	size = sizeof(*je) + thread_number * sizeof(char) + 1;
	je = malloc(size);
	memset(je, 0, size);

	if (calc_thread_status(je, 0))
		display_thread_status(je);

	free(je);
}

void print_status_init(int thr_number)
{
	run_str[thr_number] = 'P';
}
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	9
fca70358	10	static char run_str[REAL_MAX_JOBS + 1];
263e529f JA	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	20	case TD_REAPED:
4f7e57a4 JA	21	if (td->error)
4f7e57a4 JA	22	c = 'X';
a5e371a6 JA	23	else if (td->sig)
a5e371a6 JA	24	c = 'K';
4f7e57a4 JA	25	else
4f7e57a4 JA	26	c = '_';
5ec10eaa JA	27	break;
	28	case TD_EXITED:
	29	c = 'E';
	30	break;
b29ee5b3 JA	31	case TD_RAMP:
	32	c = '/';
	33	break;
5ec10eaa JA	34	case TD_RUNNING:
5ec10eaa JA	35	if (td_rw(td)) {
e3b3f81e JA	36	if (td_random(td)) {
	37	if (td->o.rwmix[DDIR_READ] == 100)
	38	c = 'r';
	39	else if (td->o.rwmix[DDIR_WRITE] == 100)
	40	c = 'w';
	41	else
	42	c = 'm';
	43	} else {
	44	if (td->o.rwmix[DDIR_READ] == 100)
	45	c = 'R';
	46	else if (td->o.rwmix[DDIR_WRITE] == 100)
	47	c = 'W';
	48	else
	49	c = 'M';
	50	}
5ec10eaa JA	51	} else if (td_read(td)) {
	52	if (td_random(td))
	53	c = 'r';
	54	else
	55	c = 'R';
	56	} else {
	57	if (td_random(td))
	58	c = 'w';
	59	else
	60	c = 'W';
	61	}
	62	break;
b0f65863 JA	63	case TD_PRE_READING:
	64	c = 'p';
	65	break;
5ec10eaa JA	66	case TD_VERIFYING:
	67	c = 'V';
	68	break;
	69	case TD_FSYNCING:
	70	c = 'F';
	71	break;
	72	case TD_CREATED:
	73	c = 'C';
	74	break;
	75	case TD_INITIALIZED:
	76	c = 'I';
	77	break;
	78	case TD_NOT_CREATED:
	79	c = 'P';
	80	break;
	81	default:
	82	log_err("state %d\n", td->runstate);
263e529f JA	83	}
	84
	85	run_str[td->thread_number - 1] = c;
	86	}
	87
	88	/*
	89	* Convert seconds to a printable string.
	90	*/
9c02f6ef	91	static void eta_to_str(char *str, unsigned long eta_sec)
263e529f JA	92	{
263e529f JA	93	unsigned int d, h, m, s;
165faf16	94	int disp_hour = 0;
263e529f	95
263e529f JA	96	s = eta_sec % 60;
	97	eta_sec /= 60;
	98	m = eta_sec % 60;
	99	eta_sec /= 60;
	100	h = eta_sec % 24;
	101	eta_sec /= 24;
	102	d = eta_sec;
	103
165faf16 JA	104	if (d) {
165faf16 JA	105	disp_hour = 1;
1e97cce9	106	str += sprintf(str, "%02ud:", d);
263e529f	107	}
165faf16 JA	108
165faf16 JA	109	if (h \|\| disp_hour)
1e97cce9	110	str += sprintf(str, "%02uh:", h);
263e529f	111
1e97cce9 JA	112	str += sprintf(str, "%02um:", m);
1e97cce9 JA	113	str += sprintf(str, "%02us", s);
263e529f JA	114	}
	115
	116	/*
	117	* Best effort calculation of the estimated pending runtime of a job.
	118	*/
b29ee5b3	119	static int thread_eta(struct thread_data *td)
263e529f JA	120	{
263e529f JA	121	unsigned long long bytes_total, bytes_done;
1e97cce9	122	unsigned long eta_sec = 0;
b29ee5b3 JA	123	unsigned long elapsed;
	124
	125	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
263e529f JA	126
	127	bytes_total = td->total_io_size;
	128
2e3bd4c2 JA	129	if (td->o.fill_device && td->o.size == -1ULL) {
	130	if (!td->fill_device_size \|\| td->fill_device_size == -1ULL)
	131	return 0;
	132
	133	bytes_total = td->fill_device_size;
	134	}
	135
74939e38 JA	136	/*
	137	* if writing, bytes_total will be twice the size. If mixing,
	138	* assume a 50/50 split and thus bytes_total will be 50% larger.
	139	*/
0dd8377f	140	if (td->o.do_verify && td->o.verify && td_write(td)) {
74939e38 JA	141	if (td_rw(td))
	142	bytes_total = bytes_total * 3 / 2;
	143	else
	144	bytes_total <<= 1;
	145	}
	146
2dc1bbeb JA	147	if (td->o.zone_size && td->o.zone_skip)
2dc1bbeb JA	148	bytes_total /= (td->o.zone_skip / td->o.zone_size);
263e529f JA	149
263e529f JA	150	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING) {
cf4464ca	151	double perc, perc_t;
263e529f JA	152
	153	bytes_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE];
	154	perc = (double) bytes_done / (double) bytes_total;
	155	if (perc > 1.0)
	156	perc = 1.0;
	157
cf4464ca JA	158	if (td->o.time_based) {
	159	perc_t = (double) elapsed / (double) td->o.timeout;
	160	if (perc_t < perc)
	161	perc = perc_t;
	162	}
	163
1e97cce9	164	eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
263e529f	165
d3eeeabc JA	166	if (td->o.timeout &&
	167	eta_sec > (td->o.timeout + done_secs - elapsed))
	168	eta_sec = td->o.timeout + done_secs - elapsed;
263e529f	169	} else if (td->runstate == TD_NOT_CREATED \|\| td->runstate == TD_CREATED
b29ee5b3	170	\|\| td->runstate == TD_INITIALIZED
b0f65863 JA	171	\|\| td->runstate == TD_RAMP
b0f65863 JA	172	\|\| td->runstate == TD_PRE_READING) {
263e529f JA	173	int t_eta = 0, r_eta = 0;
	174
	175	/*
	176	* We can only guess - assume it'll run the full timeout
	177	* if given, otherwise assume it'll run at the specified rate.
	178	*/
b29ee5b3	179	if (td->o.timeout) {
cda99fa0 SSP	180	t_eta = td->o.timeout + td->o.start_delay +
cda99fa0 SSP	181	td->o.ramp_time;
b29ee5b3 JA	182
	183	if (in_ramp_time(td)) {
	184	unsigned long ramp_left;
	185
cda99fa0	186	ramp_left = mtime_since_now(&td->epoch);
b29ee5b3 JA	187	ramp_left = (ramp_left + 999) / 1000;
	188	if (ramp_left <= t_eta)
	189	t_eta -= ramp_left;
	190	}
	191	}
581e7141	192	if (td->o.rate[0] \|\| td->o.rate[1]) {
0b9d69ec JA	193	r_eta = (bytes_total / 1024) /
0b9d69ec JA	194	(td->o.rate[0] + td->o.rate[1]);
d3eeeabc	195	r_eta += td->o.start_delay;
263e529f JA	196	}
	197
	198	if (r_eta && t_eta)
	199	eta_sec = min(r_eta, t_eta);
	200	else if (r_eta)
	201	eta_sec = r_eta;
	202	else if (t_eta)
	203	eta_sec = t_eta;
	204	else
	205	eta_sec = 0;
	206	} else {
	207	/*
	208	* thread is already done or waiting for fsync
	209	*/
	210	eta_sec = 0;
	211	}
	212
	213	return eta_sec;
	214	}
	215
46fda8d0 JA	216	static void calc_rate(unsigned long mtime, unsigned long long *io_bytes,
	217	unsigned long long prev_io_bytes, unsigned int rate)
	218	{
	219	rate[0] = (io_bytes[0] - prev_io_bytes[0]) / mtime;
	220	rate[1] = (io_bytes[1] - prev_io_bytes[1]) / mtime;
	221	prev_io_bytes[0] = io_bytes[0];
	222	prev_io_bytes[1] = io_bytes[1];
	223	}
5ec10eaa	224
adb02ba8 JA	225	static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
	226	unsigned long long prev_io_iops, unsigned int iops)
	227	{
	228	iops[0] = ((io_iops[0] - prev_io_iops[0]) * 1000) / mtime;
	229	iops[1] = ((io_iops[1] - prev_io_iops[1]) * 1000) / mtime;
	230	prev_io_iops[0] = io_iops[0];
	231	prev_io_iops[1] = io_iops[1];
	232	}
	233
263e529f JA	234	/*
	235	* Print status of the jobs we know about. This includes rate estimates,
	236	* ETA, thread state, etc.
	237	*/
af9c9fb3	238	int calc_thread_status(struct jobs_eta *je, int force)
263e529f	239	{
34572e28	240	struct thread_data *td;
b75a394f JA	241	int i;
	242	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
	243	unsigned long long io_bytes[2];
	244	unsigned long long io_iops[2];
46fda8d0 JA	245	struct timeval now;
	246
	247	static unsigned long long rate_io_bytes[2];
	248	static unsigned long long disp_io_bytes[2];
adb02ba8	249	static unsigned long long disp_io_iops[2];
46fda8d0	250	static struct timeval rate_prev_time, disp_prev_time;
d6978a32	251	int i2p = 0;
6043c579	252
af9c9fb3 JA	253	if (!force) {
	254	if (temp_stall_ts \|\| terse_output \|\| eta_print == FIO_ETA_NEVER)
	255	return 0;
e592a06b	256
af9c9fb3 JA	257	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
	258	return 0;
	259	}
263e529f	260
46fda8d0 JA	261	if (!rate_io_bytes[0] && !rate_io_bytes[1])
	262	fill_start_time(&rate_prev_time);
	263	if (!disp_io_bytes[0] && !disp_io_bytes[1])
	264	fill_start_time(&disp_prev_time);
6043c579	265
d3eeeabc JA	266	eta_secs = malloc(thread_number * sizeof(unsigned long));
d3eeeabc JA	267	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f	268
b75a394f JA	269	je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;
b75a394f JA	270
6043c579	271	io_bytes[0] = io_bytes[1] = 0;
adb02ba8	272	io_iops[0] = io_iops[1] = 0;
bb3884d8	273	bw_avg_time = ULONG_MAX;
34572e28	274	for_each_td(td, i) {
2dc1bbeb JA	275	if (td->o.bw_avg_time < bw_avg_time)
2dc1bbeb JA	276	bw_avg_time = td->o.bw_avg_time;
46fda8d0	277	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
b0f65863 JA	278	\|\| td->runstate == TD_FSYNCING
b0f65863 JA	279	\|\| td->runstate == TD_PRE_READING) {
b75a394f JA	280	je->nr_running++;
	281	je->t_rate += td->o.rate[0] + td->o.rate[1];
	282	je->m_rate += td->o.ratemin[0] + td->o.ratemin[1];
	283	je->t_iops += td->o.rate_iops[0] + td->o.rate_iops[1];
	284	je->m_iops += td->o.rate_iops_min[0] +
0b9d69ec	285	td->o.rate_iops_min[1];
b75a394f	286	je->files_open += td->nr_open_files;
b29ee5b3	287	} else if (td->runstate == TD_RAMP) {
b75a394f JA	288	je->nr_running++;
b75a394f JA	289	je->nr_ramp++;
263e529f	290	} else if (td->runstate < TD_RUNNING)
b75a394f	291	je->nr_pending++;
263e529f	292
b75a394f	293	if (je->elapsed_sec >= 3)
b29ee5b3	294	eta_secs[i] = thread_eta(td);
263e529f JA	295	else
	296	eta_secs[i] = INT_MAX;
	297
	298	check_str_update(td);
b29ee5b3 JA	299
	300	if (td->runstate > TD_RAMP) {
	301	io_bytes[0] += td->io_bytes[0];
	302	io_bytes[1] += td->io_bytes[1];
adb02ba8 JA	303	io_iops[0] += td->io_blocks[0];
adb02ba8 JA	304	io_iops[1] += td->io_blocks[1];
b29ee5b3	305	}
263e529f JA	306	}
	307
	308	if (exitall_on_terminate)
b75a394f	309	je->eta_sec = INT_MAX;
263e529f	310	else
b75a394f	311	je->eta_sec = 0;
263e529f	312
34572e28	313	for_each_td(td, i) {
d6978a32 JA	314	if (!i2p && is_power_of_2(td->o.kb_base))
d6978a32 JA	315	i2p = 1;
9c5a3854	316	if (exitall_on_terminate) {
b75a394f JA	317	if (eta_secs[i] < je->eta_sec)
b75a394f JA	318	je->eta_sec = eta_secs[i];
9c5a3854	319	} else {
b75a394f JA	320	if (eta_secs[i] > je->eta_sec)
b75a394f JA	321	je->eta_sec = eta_secs[i];
9c5a3854	322	}
263e529f JA	323	}
263e529f JA	324
eecf272f JA	325	free(eta_secs);
eecf272f JA	326
46fda8d0 JA	327	fio_gettime(&now, NULL);
	328	rate_time = mtime_since(&rate_prev_time, &now);
	329
b29ee5b3	330	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
b75a394f	331	calc_rate(rate_time, io_bytes, rate_io_bytes, je->rate);
46fda8d0	332	memcpy(&rate_prev_time, &now, sizeof(now));
b75a394f JA	333	add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
b75a394f JA	334	add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
6043c579 JA	335	}
6043c579 JA	336
46fda8d0	337	disp_time = mtime_since(&disp_prev_time, &now);
a5b01f1b JA	338
	339	/*
	340	* Allow a little slack, the target is to print it every 1000 msecs
	341	*/
af9c9fb3	342	if (!force && disp_time < 900)
b75a394f	343	return 0;
46fda8d0	344
b75a394f JA	345	calc_rate(disp_time, io_bytes, disp_io_bytes, je->rate);
b75a394f JA	346	calc_iops(disp_time, io_iops, disp_io_iops, je->iops);
adb02ba8	347
46fda8d0 JA	348	memcpy(&disp_prev_time, &now, sizeof(now));
46fda8d0 JA	349
af9c9fb3	350	if (!force && !je->nr_running && !je->nr_pending)
b75a394f JA	351	return 0;
b75a394f JA	352
1d1f45ae JA	353	je->nr_threads = thread_number;
	354	memcpy(je->run_str, run_str, thread_number * sizeof(char));
	355
b75a394f JA	356	return 1;
	357	}
	358
cf451d1e	359	void display_thread_status(struct jobs_eta *je)
b75a394f	360	{
b75a394f JA	361	static int linelen_last;
b75a394f JA	362	static int eta_good;
79074e7c	363	char output[REAL_MAX_JOBS + 512], *p = output;
b75a394f JA	364	char eta_str[128];
	365	double perc = 0.0;
	366	int i2p = 0;
	367
cf451d1e JA	368	if (je->eta_sec != INT_MAX && je->elapsed_sec) {
	369	perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
	370	eta_to_str(eta_str, je->eta_sec);
b75a394f JA	371	}
b75a394f JA	372
cf451d1e JA	373	p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
cf451d1e JA	374	if (je->m_rate \|\| je->t_rate) {
581e7141 JA	375	char tr, mr;
581e7141 JA	376
cf451d1e JA	377	mr = num2str(je->m_rate, 4, 0, i2p);
cf451d1e JA	378	tr = num2str(je->t_rate, 4, 0, i2p);
37db14fe	379	p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
581e7141 JA	380	free(tr);
581e7141 JA	381	free(mr);
cf451d1e JA	382	} else if (je->m_iops \|\| je->t_iops)
	383	p += sprintf(p, ", CR=%d/%d IOPS", je->t_iops, je->m_iops);
	384	if (je->eta_sec != INT_MAX && je->nr_running) {
0721d11e	385	char perc_str[32];
adb02ba8	386	char *iops_str[2];
d1bd7213	387	char *rate_str[2];
79074e7c	388	size_t left;
adb02ba8	389	int l;
5ec10eaa	390
cf451d1e	391	if ((!je->eta_sec && !eta_good) \|\| je->nr_ramp == je->nr_running)
cac58fd5 JA	392	strcpy(perc_str, "-.-% done");
	393	else {
	394	eta_good = 1;
	395	perc *= 100.0;
0721d11e	396	sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5	397	}
0721d11e	398
cf451d1e JA	399	rate_str[0] = num2str(je->rate[0], 5, 10, i2p);
cf451d1e JA	400	rate_str[1] = num2str(je->rate[1], 5, 10, i2p);
d1bd7213	401
cf451d1e JA	402	iops_str[0] = num2str(je->iops[0], 4, 1, 0);
cf451d1e JA	403	iops_str[1] = num2str(je->iops[1], 4, 1, 0);
adb02ba8	404
79074e7c JA	405	left = sizeof(output) - (p - output) - 1;
	406
	407	l = snprintf(p, left, ": [%s] [%s] [%s/%s /s] [%s/%s iops] [eta %s]",
1d1f45ae JA	408	je->run_str, perc_str, rate_str[0],
1d1f45ae JA	409	rate_str[1], iops_str[0], iops_str[1], eta_str);
37db14fe	410	p += l;
adb02ba8	411	if (l >= 0 && l < linelen_last)
37db14fe	412	p += sprintf(p, "%*s", linelen_last - l, "");
adb02ba8	413	linelen_last = l;
d1bd7213 JA	414
	415	free(rate_str[0]);
	416	free(rate_str[1]);
adb02ba8 JA	417	free(iops_str[0]);
adb02ba8 JA	418	free(iops_str[1]);
263e529f	419	}
37db14fe JA	420	p += sprintf(p, "\r");
37db14fe JA	421
cf451d1e JA	422	printf("%s", output);
cf451d1e JA	423	fflush(stdout);
263e529f JA	424	}
263e529f JA	425
cf451d1e JA	426	void print_thread_status(void)
cf451d1e JA	427	{
1d1f45ae	428	struct jobs_eta *je;
b814fb26	429	size_t size;
1d1f45ae	430
b814fb26 JA	431	if (!thread_number)
b814fb26 JA	432	return;
cf451d1e	433
b814fb26 JA	434	size = sizeof(je) + thread_number sizeof(char) + 1;
	435	je = malloc(size);
	436	memset(je, 0, size);
cf451d1e	437
af9c9fb3	438	if (calc_thread_status(je, 0))
1d1f45ae	439	display_thread_status(je);
cf451d1e	440
1d1f45ae	441	free(je);
cf451d1e	442	}
b75a394f	443
2b13e716	444	void print_status_init(int thr_number)
263e529f	445	{
2b13e716	446	run_str[thr_number] = 'P';
263e529f	447	}