[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:
	case TD_SETTING_UP:
		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 (td->o.zone_size && td->o.zone_skip && bytes_total) {
		unsigned int nr_zones;
		uint64_t zone_bytes;

		zone_bytes = bytes_total + td->o.zone_size + td->o.zone_skip;
		nr_zones = (zone_bytes - 1) / (td->o.zone_size + td->o.zone_skip);
		bytes_total -= nr_zones * td->o.zone_skip;
	}

	/*
	 * if writing and verifying afterwards, bytes_total will be twice the
	 * size. In a mixed workload, verify phase will be the size of the
	 * first stage writes.
	 */
	if (td->o.do_verify && td->o.verify && td_write(td)) {
		if (td_rw(td)) {
			unsigned int perc = 50;

			if (td->o.rwmix[DDIR_WRITE])
				perc = td->o.rwmix[DDIR_WRITE];

			bytes_total += (bytes_total * perc) / 100;
		} else
			bytes_total <<= 1;
	}

	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(int unified_rw_rep, 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];
		if (unified_rw_rep) {
			rate[i] = 0;
			rate[0] += ((1000 * diff) / mtime) / 1024;
		} else
			rate[i] = ((1000 * diff) / mtime) / 1024;

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

static void calc_iops(int unified_rw_rep, 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++) {
		unsigned long long diff;

		diff = io_iops[i] - prev_io_iops[i];
		if (unified_rw_rep) {
			iops[i] = 0;
			iops[0] += (diff * 1000) / mtime;
		} else
			iops[i] = (diff * 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, unified_rw_rep;
	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 &&
		    f_out == stdout)
			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;
	unified_rw_rep = 0;
	for_each_td(td, i) {
		unified_rw_rep += td->o.unified_rw_rep;
		if (is_power_of_2(td->o.kb_base))
			je->is_pow2 = 1;
		je->unit_base = td->o.unit_base;
		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[0] += td->o.rate[DDIR_READ];
				je->t_iops[0] += td->o.rate_iops[DDIR_READ];
				je->m_rate[0] += td->o.ratemin[DDIR_READ];
				je->m_iops[0] += td->o.rate_iops_min[DDIR_READ];
			}
			if (td_write(td)) {
				je->t_rate[1] += td->o.rate[DDIR_WRITE];
				je->t_iops[1] += td->o.rate_iops[DDIR_WRITE];
				je->m_rate[1] += td->o.ratemin[DDIR_WRITE];
				je->m_iops[1] += td->o.rate_iops_min[DDIR_WRITE];
			}
			if (td_trim(td)) {
				je->t_rate[2] += td->o.rate[DDIR_TRIM];
				je->t_iops[2] += td->o.rate_iops[DDIR_TRIM];
				je->m_rate[2] += td->o.ratemin[DDIR_TRIM];
				je->m_iops[2] += 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_SETTING_UP)
			je->nr_running++;
		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++) {
				if (unified_rw_rep) {
					io_bytes[0] += td->io_bytes[ddir];
					io_iops[0] += td->io_blocks[ddir];
				} else {
					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(unified_rw_rep, 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(unified_rw_rep, disp_time, io_bytes, disp_io_bytes, je->rate);
	calc_iops(unified_rw_rep, 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 struct timeval disp_eta_new_line;
	static int eta_new_line_init, eta_new_line_pending;
	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);
	}

	if (eta_new_line_pending) {
		eta_new_line_pending = 0;
		p += sprintf(p, "\n");
	}

	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, je->is_pow2, 8);
		tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, je->is_pow2, 8);
		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->m_iops[1]);
	}
	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, je->unit_base);
			iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0, 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);

	if (!eta_new_line_init) {
		fio_gettime(&disp_eta_new_line, NULL);
		eta_new_line_init = 1;
	} else if (eta_new_line &&
		   mtime_since_now(&disp_eta_new_line) > eta_new_line * 1000) {
		fio_gettime(&disp_eta_new_line, NULL);
		eta_new_line_pending = 1;
	}

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