[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:
		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.
 */
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[0] += td->o.rate[0];
			je->t_rate[1] += td->o.rate[1];
			je->m_rate[0] += td->o.ratemin[0];
			je->m_rate[1] += td->o.ratemin[1];
			je->t_iops[0] += td->o.rate_iops[0];
			je->t_iops[1] += td->o.rate_iops[1];
			je->m_iops[0] += td->o.rate_iops_min[0];
			je->m_iops[1] += 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[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[0] || je->m_rate[1] || je->t_rate[0] || je->t_rate[1]) {
		char *tr, *mr;

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

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