[fio.git] / eta.c

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

#include "fio.h"
#include "lib/pow2.h"

static char __run_str[REAL_MAX_JOBS + 1];
static char run_str[__THREAD_RUNSTR_SZ(REAL_MAX_JOBS)];

static void update_condensed_str(char *rstr, char *run_str_condensed)
{
	if (*rstr) {
		while (*rstr) {
			int nr = 1;

			*run_str_condensed++ = *rstr++;
			while (*(rstr - 1) == *rstr) {
				rstr++;
				nr++;
			}
			run_str_condensed += sprintf(run_str_condensed, "(%u),", nr);
		}
		run_str_condensed--;
	}
	*run_str_condensed = '\0';
}

/*
 * 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_FINISHING:
		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;
	update_condensed_str(__run_str, run_str);
}

/*
 * 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;

	if (eta_sec == -1) {
		sprintf(str, "--");
		return;
	}

	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 unsigned long thread_eta(struct thread_data *td)
{
	unsigned long long bytes_total, bytes_done;
	unsigned long eta_sec = 0;
	unsigned long elapsed;
	uint64_t timeout;

	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
	timeout = td->o.timeout / 1000000UL;

	bytes_total = td->total_io_size;

	if (td->flags & TD_F_NO_PROGRESS)
		return -1;

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

		if (bytes_total) {
			perc = (double) bytes_done / (double) bytes_total;
			if (perc > 1.0)
				perc = 1.0;
		} else
			perc = 0.0;

		if (td->o.time_based) {
			if (timeout) {
				perc_t = (double) elapsed / (double) timeout;
				if (perc_t < perc)
					perc = perc_t;
			} else {
				/*
				 * Will never hit, we can't have time_based
				 * without a timeout set.
				 */
				perc = 0.0;
			}
		}

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

		if (td->o.timeout &&
		    eta_sec > (timeout + done_secs - elapsed))
			eta_sec = timeout + done_secs - elapsed;
	} else if (td->runstate == TD_NOT_CREATED || td->runstate == TD_CREATED
			|| td->runstate == TD_INITIALIZED
			|| td->runstate == TD_SETTING_UP
			|| 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) {
			uint64_t __timeout = td->o.timeout;
			uint64_t start_delay = td->o.start_delay;
			uint64_t ramp_time = td->o.ramp_time;

			t_eta = __timeout + start_delay + ramp_time;
			t_eta /= 1000000ULL;

			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 / 1000000ULL);
		}

		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, this_rate;

		diff = io_bytes[i] - prev_io_bytes[i];
		if (mtime)
			this_rate = ((1000 * diff) / mtime) / 1024;
		else
			this_rate = 0;

		if (unified_rw_rep) {
			rate[i] = 0;
			rate[0] += this_rate;
		} else
			rate[i] = this_rate;

		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
		    || td->runstate == TD_FINISHING) {
			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_setting_up++;
		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_SETTING_UP) {
			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;
	update_condensed_str(__run_str, run_str);
	memcpy(je->run_str, run_str, strlen(run_str));
	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 ||
		    je->eta_sec == -1)
			strcpy(perc_str, "-.-% done");
		else {
			double mult = 100.0;

			if (je->nr_setting_up && je->nr_running)
				mult *= (1.0 - (double) je->nr_setting_up / (double) je->nr_running);

			eta_good = 1;
			perc *= mult;
			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) {
		fio_gettime(&disp_eta_new_line, NULL);
		eta_new_line_pending = 1;
	}

	fflush(stdout);
}

struct jobs_eta *get_jobs_eta(int force, size_t *size)
{
	struct jobs_eta *je;

	if (!thread_number)
		return NULL;

	*size = sizeof(*je) + THREAD_RUNSTR_SZ;
	je = malloc(*size);
	if (!je)
		return NULL;
	memset(je, 0, *size);

	if (!calc_thread_status(je, force)) {
		free(je);
		return NULL;
	}

	*size = sizeof(*je) + strlen((char *) je->run_str) + 1;
	return je;
}

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

	je = get_jobs_eta(0, &size);
	if (je)
		display_thread_status(je);

	free(je);
}

void print_status_init(int thr_number)
{
	__run_str[thr_number] = 'P';
	update_condensed_str(__run_str, run_str);
}
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"
0f38bbef	9	#include "lib/pow2.h"
263e529f	10
3e2e48a7	11	static char __run_str[REAL_MAX_JOBS + 1];
11155857	12	static char run_str[__THREAD_RUNSTR_SZ(REAL_MAX_JOBS)];
3e2e48a7	13
8a1db9a1	14	static void update_condensed_str(char rstr, char run_str_condensed)
3e2e48a7	15	{
8a1db9a1 JA	16	if (*rstr) {
8a1db9a1 JA	17	while (*rstr) {
595d9e77 AG	18	int nr = 1;
595d9e77 AG	19
8a1db9a1 JA	20	run_str_condensed++ = rstr++;
	21	while ((rstr - 1) == rstr) {
	22	rstr++;
595d9e77 AG	23	nr++;
	24	}
	25	run_str_condensed += sprintf(run_str_condensed, "(%u),", nr);
3e2e48a7	26	}
595d9e77	27	run_str_condensed--;
3e2e48a7	28	}
595d9e77	29	*run_str_condensed = '\0';
6c784104	30	}
263e529f JA	31
	32	/*
	33	* Sets the status of the 'td' in the printed status map.
	34	*/
	35	static void check_str_update(struct thread_data *td)
	36	{
3e2e48a7	37	char c = __run_str[td->thread_number - 1];
263e529f JA	38
263e529f JA	39	switch (td->runstate) {
5ec10eaa	40	case TD_REAPED:
4f7e57a4 JA	41	if (td->error)
4f7e57a4 JA	42	c = 'X';
a5e371a6 JA	43	else if (td->sig)
a5e371a6 JA	44	c = 'K';
4f7e57a4 JA	45	else
4f7e57a4 JA	46	c = '_';
5ec10eaa JA	47	break;
	48	case TD_EXITED:
	49	c = 'E';
	50	break;
b29ee5b3 JA	51	case TD_RAMP:
	52	c = '/';
	53	break;
5ec10eaa JA	54	case TD_RUNNING:
5ec10eaa JA	55	if (td_rw(td)) {
e3b3f81e JA	56	if (td_random(td)) {
	57	if (td->o.rwmix[DDIR_READ] == 100)
	58	c = 'r';
	59	else if (td->o.rwmix[DDIR_WRITE] == 100)
	60	c = 'w';
	61	else
	62	c = 'm';
	63	} else {
	64	if (td->o.rwmix[DDIR_READ] == 100)
	65	c = 'R';
	66	else if (td->o.rwmix[DDIR_WRITE] == 100)
	67	c = 'W';
	68	else
	69	c = 'M';
	70	}
5ec10eaa JA	71	} else if (td_read(td)) {
	72	if (td_random(td))
	73	c = 'r';
	74	else
	75	c = 'R';
6eaf09d6	76	} else if (td_write(td)) {
5ec10eaa JA	77	if (td_random(td))
	78	c = 'w';
	79	else
	80	c = 'W';
6eaf09d6 SL	81	} else {
	82	if (td_random(td))
	83	c = 'd';
	84	else
	85	c = 'D';
5ec10eaa JA	86	}
5ec10eaa JA	87	break;
b0f65863 JA	88	case TD_PRE_READING:
	89	c = 'p';
	90	break;
5ec10eaa JA	91	case TD_VERIFYING:
	92	c = 'V';
	93	break;
	94	case TD_FSYNCING:
	95	c = 'F';
	96	break;
3d434057 JA	97	case TD_FINISHING:
	98	c = 'f';
	99	break;
5ec10eaa JA	100	case TD_CREATED:
	101	c = 'C';
	102	break;
	103	case TD_INITIALIZED:
9c6f6316	104	case TD_SETTING_UP:
5ec10eaa JA	105	c = 'I';
	106	break;
	107	case TD_NOT_CREATED:
	108	c = 'P';
	109	break;
	110	default:
	111	log_err("state %d\n", td->runstate);
263e529f JA	112	}
263e529f JA	113
3e2e48a7 JA	114	__run_str[td->thread_number - 1] = c;
3e2e48a7 JA	115	update_condensed_str(__run_str, run_str);
263e529f JA	116	}
	117
	118	/*
	119	* Convert seconds to a printable string.
	120	*/
3e47bd25	121	void eta_to_str(char *str, unsigned long eta_sec)
263e529f JA	122	{
263e529f JA	123	unsigned int d, h, m, s;
165faf16	124	int disp_hour = 0;
263e529f	125
263775ad LG	126	if (eta_sec == -1) {
	127	sprintf(str, "--");
	128	return;
	129	}
	130
263e529f JA	131	s = eta_sec % 60;
	132	eta_sec /= 60;
	133	m = eta_sec % 60;
	134	eta_sec /= 60;
	135	h = eta_sec % 24;
	136	eta_sec /= 24;
	137	d = eta_sec;
	138
165faf16 JA	139	if (d) {
165faf16 JA	140	disp_hour = 1;
1e97cce9	141	str += sprintf(str, "%02ud:", d);
263e529f	142	}
165faf16 JA	143
165faf16 JA	144	if (h \|\| disp_hour)
1e97cce9	145	str += sprintf(str, "%02uh:", h);
263e529f	146
1e97cce9 JA	147	str += sprintf(str, "%02um:", m);
1e97cce9 JA	148	str += sprintf(str, "%02us", s);
263e529f JA	149	}
	150
	151	/*
	152	* Best effort calculation of the estimated pending runtime of a job.
	153	*/
263775ad	154	static unsigned long thread_eta(struct thread_data *td)
263e529f JA	155	{
263e529f JA	156	unsigned long long bytes_total, bytes_done;
1e97cce9	157	unsigned long eta_sec = 0;
b29ee5b3	158	unsigned long elapsed;
0de5b26f	159	uint64_t timeout;
b29ee5b3 JA	160
b29ee5b3 JA	161	elapsed = (mtime_since_now(&td->epoch) + 999) / 1000;
0de5b26f	162	timeout = td->o.timeout / 1000000UL;
263e529f JA	163
	164	bytes_total = td->total_io_size;
	165
263775ad LG	166	if (td->flags & TD_F_NO_PROGRESS)
	167	return -1;
	168
2e3bd4c2 JA	169	if (td->o.fill_device && td->o.size == -1ULL) {
	170	if (!td->fill_device_size \|\| td->fill_device_size == -1ULL)
	171	return 0;
	172
	173	bytes_total = td->fill_device_size;
	174	}
	175
0d73a2f9 JA	176	if (td->o.zone_size && td->o.zone_skip && bytes_total) {
	177	unsigned int nr_zones;
	178	uint64_t zone_bytes;
	179
	180	zone_bytes = bytes_total + td->o.zone_size + td->o.zone_skip;
	181	nr_zones = (zone_bytes - 1) / (td->o.zone_size + td->o.zone_skip);
	182	bytes_total -= nr_zones * td->o.zone_skip;
	183	}
	184
74939e38	185	/*
165eb050 JA	186	* if writing and verifying afterwards, bytes_total will be twice the
	187	* size. In a mixed workload, verify phase will be the size of the
	188	* first stage writes.
74939e38	189	*/
0dd8377f	190	if (td->o.do_verify && td->o.verify && td_write(td)) {
165eb050 JA	191	if (td_rw(td)) {
	192	unsigned int perc = 50;
	193
	194	if (td->o.rwmix[DDIR_WRITE])
	195	perc = td->o.rwmix[DDIR_WRITE];
	196
	197	bytes_total += (bytes_total * perc) / 100;
	198	} else
74939e38 JA	199	bytes_total <<= 1;
	200	}
	201
263e529f	202	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING) {
cf4464ca	203	double perc, perc_t;
263e529f	204
342f4be4	205	bytes_done = ddir_rw_sum(td->io_bytes);
476882d7 JA	206
	207	if (bytes_total) {
	208	perc = (double) bytes_done / (double) bytes_total;
	209	if (perc > 1.0)
	210	perc = 1.0;
	211	} else
	212	perc = 0.0;
263e529f	213
cf4464ca	214	if (td->o.time_based) {
476882d7 JA	215	if (timeout) {
	216	perc_t = (double) elapsed / (double) timeout;
	217	if (perc_t < perc)
	218	perc = perc_t;
	219	} else {
	220	/*
	221	* Will never hit, we can't have time_based
	222	* without a timeout set.
	223	*/
	224	perc = 0.0;
	225	}
cf4464ca JA	226	}
cf4464ca JA	227
1e97cce9	228	eta_sec = (unsigned long) (elapsed * (1.0 / perc)) - elapsed;
263e529f	229
d3eeeabc	230	if (td->o.timeout &&
0de5b26f JA	231	eta_sec > (timeout + done_secs - elapsed))
0de5b26f JA	232	eta_sec = timeout + done_secs - elapsed;
263e529f	233	} else if (td->runstate == TD_NOT_CREATED \|\| td->runstate == TD_CREATED
b29ee5b3	234	\|\| td->runstate == TD_INITIALIZED
714e85f3	235	\|\| td->runstate == TD_SETTING_UP
b0f65863 JA	236	\|\| td->runstate == TD_RAMP
b0f65863 JA	237	\|\| td->runstate == TD_PRE_READING) {
263e529f	238	int t_eta = 0, r_eta = 0;
342f4be4	239	unsigned long long rate_bytes;
263e529f JA	240
	241	/*
	242	* We can only guess - assume it'll run the full timeout
	243	* if given, otherwise assume it'll run at the specified rate.
	244	*/
b29ee5b3	245	if (td->o.timeout) {
8a1db9a1	246	uint64_t __timeout = td->o.timeout;
0de5b26f JA	247	uint64_t start_delay = td->o.start_delay;
	248	uint64_t ramp_time = td->o.ramp_time;
	249
8a1db9a1	250	t_eta = __timeout + start_delay + ramp_time;
0de5b26f	251	t_eta /= 1000000ULL;
b29ee5b3 JA	252
	253	if (in_ramp_time(td)) {
	254	unsigned long ramp_left;
	255
cda99fa0	256	ramp_left = mtime_since_now(&td->epoch);
b29ee5b3 JA	257	ramp_left = (ramp_left + 999) / 1000;
	258	if (ramp_left <= t_eta)
	259	t_eta -= ramp_left;
	260	}
	261	}
342f4be4 JA	262	rate_bytes = ddir_rw_sum(td->o.rate);
	263	if (rate_bytes) {
	264	r_eta = (bytes_total / 1024) / rate_bytes;
0de5b26f	265	r_eta += (td->o.start_delay / 1000000ULL);
263e529f JA	266	}
	267
	268	if (r_eta && t_eta)
	269	eta_sec = min(r_eta, t_eta);
	270	else if (r_eta)
	271	eta_sec = r_eta;
	272	else if (t_eta)
	273	eta_sec = t_eta;
	274	else
	275	eta_sec = 0;
	276	} else {
	277	/*
	278	* thread is already done or waiting for fsync
	279	*/
	280	eta_sec = 0;
	281	}
	282
	283	return eta_sec;
	284	}
	285
771e58be JA	286	static void calc_rate(int unified_rw_rep, unsigned long mtime,
771e58be JA	287	unsigned long long *io_bytes,
46fda8d0 JA	288	unsigned long long prev_io_bytes, unsigned int rate)
46fda8d0 JA	289	{
b7f05eb0 JA	290	int i;
b7f05eb0 JA	291
6eaf09d6	292	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
1e271b21	293	unsigned long long diff, this_rate;
b7f05eb0 JA	294
b7f05eb0 JA	295	diff = io_bytes[i] - prev_io_bytes[i];
1e271b21 JA	296	if (mtime)
	297	this_rate = ((1000 * diff) / mtime) / 1024;
	298	else
	299	this_rate = 0;
	300
771e58be JA	301	if (unified_rw_rep) {
771e58be JA	302	rate[i] = 0;
1e271b21	303	rate[0] += this_rate;
771e58be	304	} else
1e271b21	305	rate[i] = this_rate;
6eaf09d6 SL	306
6eaf09d6 SL	307	prev_io_bytes[i] = io_bytes[i];
b7f05eb0	308	}
46fda8d0	309	}
5ec10eaa	310
771e58be JA	311	static void calc_iops(int unified_rw_rep, unsigned long mtime,
771e58be JA	312	unsigned long long *io_iops,
adb02ba8 JA	313	unsigned long long prev_io_iops, unsigned int iops)
adb02ba8 JA	314	{
6eaf09d6 SL	315	int i;
	316
	317	for (i = 0; i < DDIR_RWDIR_CNT; i++) {
771e58be JA	318	unsigned long long diff;
	319
	320	diff = io_iops[i] - prev_io_iops[i];
	321	if (unified_rw_rep) {
	322	iops[i] = 0;
	323	iops[0] += (diff * 1000) / mtime;
	324	} else
	325	iops[i] = (diff * 1000) / mtime;
	326
6eaf09d6 SL	327	prev_io_iops[i] = io_iops[i];
6eaf09d6 SL	328	}
adb02ba8 JA	329	}
adb02ba8 JA	330
263e529f JA	331	/*
	332	* Print status of the jobs we know about. This includes rate estimates,
	333	* ETA, thread state, etc.
	334	*/
af9c9fb3	335	int calc_thread_status(struct jobs_eta *je, int force)
263e529f	336	{
34572e28	337	struct thread_data *td;
771e58be	338	int i, unified_rw_rep;
b75a394f	339	unsigned long rate_time, disp_time, bw_avg_time, *eta_secs;
6eaf09d6 SL	340	unsigned long long io_bytes[DDIR_RWDIR_CNT];
6eaf09d6 SL	341	unsigned long long io_iops[DDIR_RWDIR_CNT];
46fda8d0 JA	342	struct timeval now;
46fda8d0 JA	343
6eaf09d6 SL	344	static unsigned long long rate_io_bytes[DDIR_RWDIR_CNT];
	345	static unsigned long long disp_io_bytes[DDIR_RWDIR_CNT];
	346	static unsigned long long disp_io_iops[DDIR_RWDIR_CNT];
46fda8d0	347	static struct timeval rate_prev_time, disp_prev_time;
6043c579	348
af9c9fb3	349	if (!force) {
fc47559b JA	350	if (output_format != FIO_OUTPUT_NORMAL &&
fc47559b JA	351	f_out == stdout)
f3afa57e JA	352	return 0;
f3afa57e JA	353	if (temp_stall_ts \|\| eta_print == FIO_ETA_NEVER)
af9c9fb3	354	return 0;
e592a06b	355
af9c9fb3 JA	356	if (!isatty(STDOUT_FILENO) && (eta_print != FIO_ETA_ALWAYS))
	357	return 0;
	358	}
263e529f	359
342f4be4	360	if (!ddir_rw_sum(rate_io_bytes))
46fda8d0	361	fill_start_time(&rate_prev_time);
342f4be4	362	if (!ddir_rw_sum(disp_io_bytes))
46fda8d0	363	fill_start_time(&disp_prev_time);
6043c579	364
d3eeeabc JA	365	eta_secs = malloc(thread_number * sizeof(unsigned long));
d3eeeabc JA	366	memset(eta_secs, 0, thread_number * sizeof(unsigned long));
263e529f	367
b75a394f JA	368	je->elapsed_sec = (mtime_since_genesis() + 999) / 1000;
b75a394f JA	369
6eaf09d6 SL	370	io_bytes[DDIR_READ] = io_bytes[DDIR_WRITE] = io_bytes[DDIR_TRIM] = 0;
6eaf09d6 SL	371	io_iops[DDIR_READ] = io_iops[DDIR_WRITE] = io_iops[DDIR_TRIM] = 0;
bb3884d8	372	bw_avg_time = ULONG_MAX;
771e58be	373	unified_rw_rep = 0;
34572e28	374	for_each_td(td, i) {
771e58be	375	unified_rw_rep += td->o.unified_rw_rep;
b7f05eb0 JA	376	if (is_power_of_2(td->o.kb_base))
b7f05eb0 JA	377	je->is_pow2 = 1;
ad705bcb	378	je->unit_base = td->o.unit_base;
2dc1bbeb JA	379	if (td->o.bw_avg_time < bw_avg_time)
2dc1bbeb JA	380	bw_avg_time = td->o.bw_avg_time;
46fda8d0	381	if (td->runstate == TD_RUNNING \|\| td->runstate == TD_VERIFYING
b0f65863	382	\|\| td->runstate == TD_FSYNCING
3d434057 JA	383	\|\| td->runstate == TD_PRE_READING
3d434057 JA	384	\|\| td->runstate == TD_FINISHING) {
b75a394f	385	je->nr_running++;
242c38db	386	if (td_read(td)) {
c2e9cc4d JA	387	je->t_rate[0] += td->o.rate[DDIR_READ];
	388	je->t_iops[0] += td->o.rate_iops[DDIR_READ];
	389	je->m_rate[0] += td->o.ratemin[DDIR_READ];
	390	je->m_iops[0] += td->o.rate_iops_min[DDIR_READ];
242c38db JA	391	}
242c38db JA	392	if (td_write(td)) {
c2e9cc4d JA	393	je->t_rate[1] += td->o.rate[DDIR_WRITE];
	394	je->t_iops[1] += td->o.rate_iops[DDIR_WRITE];
	395	je->m_rate[1] += td->o.ratemin[DDIR_WRITE];
	396	je->m_iops[1] += td->o.rate_iops_min[DDIR_WRITE];
242c38db	397	}
6eaf09d6	398	if (td_trim(td)) {
d79db122 JA	399	je->t_rate[2] += td->o.rate[DDIR_TRIM];
	400	je->t_iops[2] += td->o.rate_iops[DDIR_TRIM];
	401	je->m_rate[2] += td->o.ratemin[DDIR_TRIM];
	402	je->m_iops[2] += td->o.rate_iops_min[DDIR_TRIM];
6eaf09d6 SL	403	}
6eaf09d6 SL	404
b75a394f	405	je->files_open += td->nr_open_files;
b29ee5b3	406	} else if (td->runstate == TD_RAMP) {
b75a394f JA	407	je->nr_running++;
b75a394f JA	408	je->nr_ramp++;
aef66dec	409	} else if (td->runstate == TD_SETTING_UP)
714e85f3	410	je->nr_setting_up++;
aef66dec	411	else if (td->runstate < TD_RUNNING)
b75a394f	412	je->nr_pending++;
263e529f	413
b75a394f	414	if (je->elapsed_sec >= 3)
b29ee5b3	415	eta_secs[i] = thread_eta(td);
263e529f JA	416	else
	417	eta_secs[i] = INT_MAX;
	418
	419	check_str_update(td);
b29ee5b3	420
714e85f3	421	if (td->runstate > TD_SETTING_UP) {
6eaf09d6	422	int ddir;
771e58be	423
6eaf09d6	424	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
771e58be JA	425	if (unified_rw_rep) {
	426	io_bytes[0] += td->io_bytes[ddir];
	427	io_iops[0] += td->io_blocks[ddir];
	428	} else {
	429	io_bytes[ddir] += td->io_bytes[ddir];
	430	io_iops[ddir] += td->io_blocks[ddir];
	431	}
6eaf09d6	432	}
b29ee5b3	433	}
263e529f JA	434	}
	435
	436	if (exitall_on_terminate)
b75a394f	437	je->eta_sec = INT_MAX;
263e529f	438	else
b75a394f	439	je->eta_sec = 0;
263e529f	440
34572e28	441	for_each_td(td, i) {
9c5a3854	442	if (exitall_on_terminate) {
b75a394f JA	443	if (eta_secs[i] < je->eta_sec)
b75a394f JA	444	je->eta_sec = eta_secs[i];
9c5a3854	445	} else {
b75a394f JA	446	if (eta_secs[i] > je->eta_sec)
b75a394f JA	447	je->eta_sec = eta_secs[i];
9c5a3854	448	}
263e529f JA	449	}
263e529f JA	450
eecf272f JA	451	free(eta_secs);
eecf272f JA	452
46fda8d0 JA	453	fio_gettime(&now, NULL);
	454	rate_time = mtime_since(&rate_prev_time, &now);
	455
b29ee5b3	456	if (write_bw_log && rate_time > bw_avg_time && !in_ramp_time(td)) {
771e58be JA	457	calc_rate(unified_rw_rep, rate_time, io_bytes, rate_io_bytes,
771e58be JA	458	je->rate);
46fda8d0	459	memcpy(&rate_prev_time, &now, sizeof(now));
b75a394f JA	460	add_agg_sample(je->rate[DDIR_READ], DDIR_READ, 0);
b75a394f JA	461	add_agg_sample(je->rate[DDIR_WRITE], DDIR_WRITE, 0);
6eaf09d6	462	add_agg_sample(je->rate[DDIR_TRIM], DDIR_TRIM, 0);
6043c579 JA	463	}
6043c579 JA	464
46fda8d0	465	disp_time = mtime_since(&disp_prev_time, &now);
a5b01f1b JA	466
	467	/*
	468	* Allow a little slack, the target is to print it every 1000 msecs
	469	*/
af9c9fb3	470	if (!force && disp_time < 900)
b75a394f	471	return 0;
46fda8d0	472
771e58be JA	473	calc_rate(unified_rw_rep, disp_time, io_bytes, disp_io_bytes, je->rate);
771e58be JA	474	calc_iops(unified_rw_rep, disp_time, io_iops, disp_io_iops, je->iops);
adb02ba8	475
46fda8d0 JA	476	memcpy(&disp_prev_time, &now, sizeof(now));
46fda8d0 JA	477
af9c9fb3	478	if (!force && !je->nr_running && !je->nr_pending)
b75a394f JA	479	return 0;
b75a394f JA	480
1d1f45ae	481	je->nr_threads = thread_number;
6c784104 JA	482	update_condensed_str(__run_str, run_str);
6c784104 JA	483	memcpy(je->run_str, run_str, strlen(run_str));
b75a394f JA	484	return 1;
	485	}
	486
cf451d1e	487	void display_thread_status(struct jobs_eta *je)
b75a394f	488	{
e382e661 JA	489	static struct timeval disp_eta_new_line;
e382e661 JA	490	static int eta_new_line_init, eta_new_line_pending;
b75a394f JA	491	static int linelen_last;
b75a394f JA	492	static int eta_good;
79074e7c	493	char output[REAL_MAX_JOBS + 512], *p = output;
b75a394f JA	494	char eta_str[128];
b75a394f JA	495	double perc = 0.0;
b75a394f	496
cf451d1e JA	497	if (je->eta_sec != INT_MAX && je->elapsed_sec) {
	498	perc = (double) je->elapsed_sec / (double) (je->elapsed_sec + je->eta_sec);
	499	eta_to_str(eta_str, je->eta_sec);
b75a394f JA	500	}
b75a394f JA	501
e382e661 JA	502	if (eta_new_line_pending) {
	503	eta_new_line_pending = 0;
	504	p += sprintf(p, "\n");
	505	}
	506
cf451d1e	507	p += sprintf(p, "Jobs: %d (f=%d)", je->nr_running, je->files_open);
3e47bd25	508	if (je->m_rate[0] \|\| je->m_rate[1] \|\| je->t_rate[0] \|\| je->t_rate[1]) {
581e7141 JA	509	char tr, mr;
581e7141 JA	510
22f80458 JA	511	mr = num2str(je->m_rate[0] + je->m_rate[1], 4, 0, je->is_pow2, 8);
22f80458 JA	512	tr = num2str(je->t_rate[0] + je->t_rate[1], 4, 0, je->is_pow2, 8);
37db14fe	513	p += sprintf(p, ", CR=%s/%s KB/s", tr, mr);
581e7141 JA	514	free(tr);
581e7141 JA	515	free(mr);
3e47bd25 JA	516	} else if (je->m_iops[0] \|\| je->m_iops[1] \|\| je->t_iops[0] \|\| je->t_iops[1]) {
	517	p += sprintf(p, ", CR=%d/%d IOPS",
	518	je->t_iops[0] + je->t_iops[1],
88e4beaa	519	je->m_iops[0] + je->m_iops[1]);
3e47bd25	520	}
cf451d1e	521	if (je->eta_sec != INT_MAX && je->nr_running) {
0721d11e	522	char perc_str[32];
6eaf09d6 SL	523	char *iops_str[DDIR_RWDIR_CNT];
6eaf09d6 SL	524	char *rate_str[DDIR_RWDIR_CNT];
79074e7c	525	size_t left;
adb02ba8	526	int l;
6eaf09d6	527	int ddir;
5ec10eaa	528
263775ad LG	529	if ((!je->eta_sec && !eta_good) \|\| je->nr_ramp == je->nr_running \|\|
263775ad LG	530	je->eta_sec == -1)
cac58fd5 JA	531	strcpy(perc_str, "-.-% done");
cac58fd5 JA	532	else {
714e85f3 JA	533	double mult = 100.0;
	534
	535	if (je->nr_setting_up && je->nr_running)
	536	mult *= (1.0 - (double) je->nr_setting_up / (double) je->nr_running);
	537
cac58fd5	538	eta_good = 1;
714e85f3	539	perc *= mult;
0721d11e	540	sprintf(perc_str, "%3.1f%% done", perc);
cac58fd5	541	}
0721d11e	542
6eaf09d6 SL	543	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
6eaf09d6 SL	544	rate_str[ddir] = num2str(je->rate[ddir], 5,
ad705bcb	545	1024, je->is_pow2, je->unit_base);
73798eb2	546	iops_str[ddir] = num2str(je->iops[ddir], 4, 1, 0, 0);
6eaf09d6	547	}
adb02ba8	548
79074e7c JA	549	left = sizeof(output) - (p - output) - 1;
79074e7c JA	550
6eaf09d6 SL	551	l = snprintf(p, left, ": [%s] [%s] [%s/%s/%s /s] [%s/%s/%s iops] [eta %s]",
	552	je->run_str, perc_str, rate_str[DDIR_READ],
	553	rate_str[DDIR_WRITE], rate_str[DDIR_TRIM],
	554	iops_str[DDIR_READ], iops_str[DDIR_WRITE],
	555	iops_str[DDIR_TRIM], eta_str);
37db14fe	556	p += l;
adb02ba8	557	if (l >= 0 && l < linelen_last)
37db14fe	558	p += sprintf(p, "%*s", linelen_last - l, "");
adb02ba8	559	linelen_last = l;
d1bd7213	560
6eaf09d6 SL	561	for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
	562	free(rate_str[ddir]);
	563	free(iops_str[ddir]);
	564	}
263e529f	565	}
37db14fe JA	566	p += sprintf(p, "\r");
37db14fe JA	567
3e47bd25	568	printf("%s", output);
e382e661 JA	569
	570	if (!eta_new_line_init) {
	571	fio_gettime(&disp_eta_new_line, NULL);
	572	eta_new_line_init = 1;
88038bc7	573	} else if (eta_new_line && mtime_since_now(&disp_eta_new_line) > eta_new_line) {
e382e661 JA	574	fio_gettime(&disp_eta_new_line, NULL);
	575	eta_new_line_pending = 1;
	576	}
	577
3e47bd25	578	fflush(stdout);
263e529f JA	579	}
263e529f JA	580
723297c9	581	struct jobs_eta get_jobs_eta(int force, size_t size)
cf451d1e	582	{
1d1f45ae JA	583	struct jobs_eta *je;
1d1f45ae JA	584
b814fb26	585	if (!thread_number)
723297c9	586	return NULL;
cf451d1e	587
723297c9 JA	588	size = sizeof(je) + THREAD_RUNSTR_SZ;
723297c9 JA	589	je = malloc(*size);
70034d87 RE	590	if (!je)
70034d87 RE	591	return NULL;
723297c9 JA	592	memset(je, 0, *size);
723297c9 JA	593
256bc54c	594	if (!calc_thread_status(je, force)) {
723297c9 JA	595	free(je);
	596	return NULL;
	597	}
	598
05bff935	599	size = sizeof(je) + strlen((char *) je->run_str) + 1;
723297c9 JA	600	return je;
	601	}
	602
	603	void print_thread_status(void)
	604	{
	605	struct jobs_eta *je;
	606	size_t size;
cf451d1e	607
723297c9 JA	608	je = get_jobs_eta(0, &size);
723297c9 JA	609	if (je)
1d1f45ae	610	display_thread_status(je);
cf451d1e	611
1d1f45ae	612	free(je);
cf451d1e	613	}
b75a394f	614
2b13e716	615	void print_status_init(int thr_number)
263e529f	616	{
3e2e48a7 JA	617	__run_str[thr_number] = 'P';
3e2e48a7 JA	618	update_condensed_str(__run_str, run_str);
263e529f	619	}