[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_write(td)) {
			if (td_random(td))
				c = 'w';
			else
				c = 'W';
		} else {
			if (td_random(td))
				c = 'd';
			else
				c = 'D';
		}
		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 = ddir_rw_sum(td->io_bytes);
		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;
		unsigned long long rate_bytes;

		/*
		 * 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;
			}
		}
		rate_bytes = ddir_rw_sum(td->o.rate);
		if (rate_bytes) {
			r_eta = (bytes_total / 1024) / rate_bytes;
			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)
{
	int i;

	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
		unsigned long long diff;

		diff = io_bytes[i] - prev_io_bytes[i];
		rate[i] = ((1000 * diff) / mtime) / 1024;

		prev_io_bytes[i] = io_bytes[i];
	}
}

static void calc_iops(unsigned long mtime, unsigned long long *io_iops,
		      unsigned long long *prev_io_iops, unsigned int *iops)
{
	int i;

	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
		iops[i] = ((io_iops[i] - prev_io_iops[i]) * 1000) / mtime;
		prev_io_iops[i] = io_iops[i];
	}
}

/*
 * 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[DDIR_RWDIR_CNT];
	unsigned long long io_iops[DDIR_RWDIR_CNT];
	struct timeval now;

	static unsigned long long rate_io_bytes[DDIR_RWDIR_CNT];
	static unsigned long long disp_io_bytes[DDIR_RWDIR_CNT];
	static unsigned long long disp_io_iops[DDIR_RWDIR_CNT];
	static struct timeval rate_prev_time, disp_prev_time;

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

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

	if (!ddir_rw_sum(rate_io_bytes))
		fill_start_time(&rate_prev_time);
	if (!ddir_rw_sum(disp_io_bytes))
		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[DDIR_READ] = io_bytes[DDIR_WRITE] = io_bytes[DDIR_TRIM] = 0;
	io_iops[DDIR_READ] = io_iops[DDIR_WRITE] = io_iops[DDIR_TRIM] = 0;
	bw_avg_time = ULONG_MAX;
	for_each_td(td, i) {
		if (is_power_of_2(td->o.kb_base))
			je->is_pow2 = 1;
		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++;
			if (td_read(td)) {
				je->t_rate += td->o.rate[DDIR_READ];
				je->t_iops += td->o.rate_iops[DDIR_READ];
				je->m_rate += td->o.ratemin[DDIR_READ];
				je->m_iops += td->o.rate_iops_min[DDIR_READ];
			}
			if (td_write(td)) {
				je->t_rate += td->o.rate[DDIR_WRITE];
				je->t_iops += td->o.rate_iops[DDIR_WRITE];
				je->m_rate += td->o.ratemin[DDIR_WRITE];
				je->m_iops += td->o.rate_iops_min[DDIR_WRITE];
			}
			if (td_trim(td)) {
				je->t_rate += td->o.rate[DDIR_TRIM];
				je->t_iops += td->o.rate_iops[DDIR_TRIM];
				je->m_rate += td->o.ratemin[DDIR_TRIM];
				je->m_iops += td->o.rate_iops_min[DDIR_TRIM];
			}

			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) {
			int ddir;
			for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
				io_bytes[ddir] += td->io_bytes[ddir];
				io_iops[ddir] += td->io_blocks[ddir];
			}
		}
	}

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

	for_each_td(td, i) {
		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);
		add_agg_sample(je->rate[DDIR_TRIM], DDIR_TRIM, 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;

	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, je->is_pow2);
		tr = num2str(je->t_rate, 4, 0, je->is_pow2);
		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[DDIR_RWDIR_CNT];
		char *rate_str[DDIR_RWDIR_CNT];
		size_t left;
		int l;
		int ddir;

		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);
		}

		for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
			rate_str[ddir] = num2str(je->rate[ddir], 5,
						1024, je->is_pow2);
			iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0);
		}

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

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

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