[fio.git] / diskutil.c

#include <stdio.h>
#include <string.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <dirent.h>
#include <libgen.h>
#include <math.h>

#include "fio.h"
#include "smalloc.h"
#include "diskutil.h"

static int last_majdev, last_mindev;
static struct disk_util *last_du;

static struct fio_mutex *disk_util_mutex;

FLIST_HEAD(disk_list);

static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
		int majdev, int mindev, char *path);

static void disk_util_free(struct disk_util *du)
{
	if (du == last_du)
		last_du = NULL;

	while (!flist_empty(&du->slaves)) {
		struct disk_util *slave;

		slave = flist_entry(du->slaves.next, struct disk_util, slavelist);
		flist_del(&slave->slavelist);
		slave->users--;
	}

	fio_mutex_remove(du->lock);
	sfree(du);
}

static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
{
	unsigned in_flight;
	unsigned long long sectors[2];
	char line[256];
	FILE *f;
	char *p;
	int ret;

	dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);

	f = fopen(du->path, "r");
	if (!f)
		return 1;

	p = fgets(line, sizeof(line), f);
	if (!p) {
		fclose(f);
		return 1;
	}

	dprint(FD_DISKUTIL, "%s: %s", du->path, p);

	ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
					&dus->merges[0], &sectors[0],
					&dus->ticks[0], &dus->ios[1],
					&dus->merges[1], &sectors[1],
					&dus->ticks[1], &in_flight,
					&dus->io_ticks, &dus->time_in_queue);
	fclose(f);
	dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
	dus->sectors[0] = sectors[0];
	dus->sectors[1] = sectors[1];
	return ret != 11;
}

static void update_io_tick_disk(struct disk_util *du)
{
	struct disk_util_stat __dus, *dus, *ldus;
	struct timeval t;

	if (!du->users)
		return;
	if (get_io_ticks(du, &__dus))
		return;

	dus = &du->dus;
	ldus = &du->last_dus;

	dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
	dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
	dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
	dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
	dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
	dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
	dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
	dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
	dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
	dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);

	fio_gettime(&t, NULL);
	dus->msec += mtime_since(&du->time, &t);
	memcpy(&du->time, &t, sizeof(t));
	memcpy(ldus, &__dus, sizeof(__dus));
}

int update_io_ticks(void)
{
	struct flist_head *entry;
	struct disk_util *du;
	int ret = 0;

	dprint(FD_DISKUTIL, "update io ticks\n");

	fio_mutex_down(disk_util_mutex);

	if (!disk_util_exit) {
		flist_for_each(entry, &disk_list) {
			du = flist_entry(entry, struct disk_util, list);
			update_io_tick_disk(du);
		}
	} else
		ret = 1;

	fio_mutex_up(disk_util_mutex);
	return ret;
}

static struct disk_util *disk_util_exists(int major, int minor)
{
	struct flist_head *entry;
	struct disk_util *du;

	fio_mutex_down(disk_util_mutex);

	flist_for_each(entry, &disk_list) {
		du = flist_entry(entry, struct disk_util, list);

		if (major == du->major && minor == du->minor) {
			fio_mutex_up(disk_util_mutex);
			return du;
		}
	}

	fio_mutex_up(disk_util_mutex);
	return NULL;
}

static int get_device_numbers(char *file_name, int *maj, int *min)
{
	struct stat st;
	int majdev, mindev;
	char tempname[PATH_MAX], *p;

	if (!lstat(file_name, &st)) {
		if (S_ISBLK(st.st_mode)) {
			majdev = major(st.st_rdev);
			mindev = minor(st.st_rdev);
		} else if (S_ISCHR(st.st_mode)) {
			majdev = major(st.st_rdev);
			mindev = minor(st.st_rdev);
			if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
				return -1;
		} else if (S_ISFIFO(st.st_mode))
			return -1;
		else {
			majdev = major(st.st_dev);
			mindev = minor(st.st_dev);
		}
	} else {
		/*
		 * must be a file, open "." in that path
		 */
		strncpy(tempname, file_name, PATH_MAX - 1);
		p = dirname(tempname);
		if (stat(p, &st)) {
			perror("disk util stat");
			return -1;
		}

		majdev = major(st.st_dev);
		mindev = minor(st.st_dev);
	}

	*min = mindev;
	*maj = majdev;

	return 0;
}

static int read_block_dev_entry(char *path, int *maj, int *min)
{
	char line[256], *p;
	FILE *f;

	f = fopen(path, "r");
	if (!f) {
		perror("open path");
		return 1;
	}

	p = fgets(line, sizeof(line), f);
	fclose(f);

	if (!p)
		return 1;

	if (sscanf(p, "%u:%u", maj, min) != 2)
		return 1;

	return 0;
}

static void find_add_disk_slaves(struct thread_data *td, char *path,
				 struct disk_util *masterdu)
{
	DIR *dirhandle = NULL;
	struct dirent *dirent = NULL;
	char slavesdir[PATH_MAX], temppath[PATH_MAX], slavepath[PATH_MAX];
	struct disk_util *slavedu = NULL;
	int majdev, mindev;
	ssize_t linklen;

	sprintf(slavesdir, "%s/%s", path, "slaves");
	dirhandle = opendir(slavesdir);
	if (!dirhandle)
		return;

	while ((dirent = readdir(dirhandle)) != NULL) {
		if (!strcmp(dirent->d_name, ".") ||
		    !strcmp(dirent->d_name, ".."))
			continue;

		sprintf(temppath, "%s%s%s", slavesdir, FIO_OS_PATH_SEPARATOR, dirent->d_name);
		/* Can we always assume that the slaves device entries
		 * are links to the real directories for the slave
		 * devices?
		 */
		linklen = readlink(temppath, slavepath, PATH_MAX - 0);
		if (linklen  < 0) {
			perror("readlink() for slave device.");
			return;
		}
		slavepath[linklen] = '\0';

		sprintf(temppath, "%s/%s/dev", slavesdir, slavepath);
		if (read_block_dev_entry(temppath, &majdev, &mindev)) {
			perror("Error getting slave device numbers.");
			return;
		}

		/*
		 * See if this maj,min already exists
		 */
		slavedu = disk_util_exists(majdev, mindev);
		if (slavedu)
			continue;

		sprintf(temppath, "%s%s%s", slavesdir, FIO_OS_PATH_SEPARATOR, slavepath);
		__init_per_file_disk_util(td, majdev, mindev, temppath);
		slavedu = disk_util_exists(majdev, mindev);

		/* Should probably use an assert here. slavedu should
		 * always be present at this point. */
		if (slavedu) {
			slavedu->users++;
			flist_add_tail(&slavedu->slavelist, &masterdu->slaves);
		}
	}

	closedir(dirhandle);
}

static struct disk_util *disk_util_add(struct thread_data *td, int majdev,
				       int mindev, char *path)
{
	struct disk_util *du, *__du;
	struct flist_head *entry;
	int l;

	dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);

	du = smalloc(sizeof(*du));
	if (!du) {
		log_err("fio: smalloc() pool exhausted\n");
		return NULL;
	}

	memset(du, 0, sizeof(*du));
	INIT_FLIST_HEAD(&du->list);
	l = snprintf(du->path, sizeof(du->path), "%s/stat", path);
	if (l < 0 || l >= sizeof(du->path)) {
		log_err("constructed path \"%.100s[...]/stat\" larger than buffer (%zu bytes)\n",
			path, sizeof(du->path) - 1);
		sfree(du);
		return NULL;
	}
	strncpy((char *) du->dus.name, basename(path), FIO_DU_NAME_SZ);
	du->sysfs_root = path;
	du->major = majdev;
	du->minor = mindev;
	INIT_FLIST_HEAD(&du->slavelist);
	INIT_FLIST_HEAD(&du->slaves);
	du->lock = fio_mutex_init(FIO_MUTEX_UNLOCKED);
	du->users = 0;

	fio_mutex_down(disk_util_mutex);

	flist_for_each(entry, &disk_list) {
		__du = flist_entry(entry, struct disk_util, list);

		dprint(FD_DISKUTIL, "found %s in list\n", __du->dus.name);

		if (!strcmp((char *) du->dus.name, (char *) __du->dus.name)) {
			disk_util_free(du);
			fio_mutex_up(disk_util_mutex);
			return __du;
		}
	}

	dprint(FD_DISKUTIL, "add %s to list\n", du->dus.name);

	fio_gettime(&du->time, NULL);
	get_io_ticks(du, &du->last_dus);

	flist_add_tail(&du->list, &disk_list);
	fio_mutex_up(disk_util_mutex);

	find_add_disk_slaves(td, path, du);
	return du;
}

static int check_dev_match(int majdev, int mindev, char *path)
{
	int major, minor;

	if (read_block_dev_entry(path, &major, &minor))
		return 1;

	if (majdev == major && mindev == minor)
		return 0;

	return 1;
}

static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
{
	struct dirent *dir;
	struct stat st;
	int found = 0;
	DIR *D;

	D = opendir(path);
	if (!D)
		return 0;

	while ((dir = readdir(D)) != NULL) {
		char full_path[256];

		if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
			continue;

		sprintf(full_path, "%s%s%s", path, FIO_OS_PATH_SEPARATOR, dir->d_name);

		if (!strcmp(dir->d_name, "dev")) {
			if (!check_dev_match(majdev, mindev, full_path)) {
				found = 1;
				break;
			}
		}

		if (link_ok) {
			if (stat(full_path, &st) == -1) {
				perror("stat");
				break;
			}
		} else {
			if (lstat(full_path, &st) == -1) {
				perror("stat");
				break;
			}
		}

		if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
			continue;

		found = find_block_dir(majdev, mindev, full_path, 0);
		if (found) {
			strcpy(path, full_path);
			break;
		}
	}

	closedir(D);
	return found;
}

static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
						   int majdev, int mindev,
						   char *path)
{
	struct stat st;
	char tmp[PATH_MAX];
	char *p;

	/*
	 * If there's a ../queue/ directory there, we are inside a partition.
	 * Check if that is the case and jump back. For loop/md/dm etc we
	 * are already in the right spot.
	 */
	sprintf(tmp, "%s/../queue", path);
	if (!stat(tmp, &st)) {
		p = dirname(path);
		sprintf(tmp, "%s/queue", p);
		if (stat(tmp, &st)) {
			log_err("unknown sysfs layout\n");
			return NULL;
		}
		strncpy(tmp, p, PATH_MAX - 1);
		sprintf(path, "%s", tmp);
	}

	if (td->o.ioscheduler && !td->sysfs_root)
		td->sysfs_root = strdup(path);

	return disk_util_add(td, majdev, mindev, path);
}

static struct disk_util *init_per_file_disk_util(struct thread_data *td,
						 char *filename)
{

	char foo[PATH_MAX];
	struct disk_util *du;
	int mindev, majdev;

	if (get_device_numbers(filename, &majdev, &mindev))
		return NULL;

	dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev,
			mindev);

	du = disk_util_exists(majdev, mindev);
	if (du) {
		if (td->o.ioscheduler && !td->sysfs_root)
			td->sysfs_root = strdup(du->sysfs_root);

		return du;
	}

	/*
	 * for an fs without a device, we will repeatedly stat through
	 * sysfs which can take oodles of time for thousands of files. so
	 * cache the last lookup and compare with that before going through
	 * everything again.
	 */
	if (mindev == last_mindev && majdev == last_majdev)
		return last_du;

	last_mindev = mindev;
	last_majdev = majdev;

	sprintf(foo, "/sys/block");
	if (!find_block_dir(majdev, mindev, foo, 1))
		return NULL;

	return __init_per_file_disk_util(td, majdev, mindev, foo);
}

static struct disk_util *__init_disk_util(struct thread_data *td,
					  struct fio_file *f)
{
	return init_per_file_disk_util(td, f->file_name);
}

void init_disk_util(struct thread_data *td)
{
	struct fio_file *f;
	unsigned int i;

	if (!td->o.do_disk_util ||
	    (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
		return;

	for_each_file(td, f, i)
		f->du = __init_disk_util(td, f);
}

static void show_agg_stats(struct disk_util_agg *agg, int terse)
{
	if (!agg->slavecount)
		return;

	if (!terse) {
		log_info(", aggrios=%u/%u, aggrmerge=%u/%u, aggrticks=%u/%u,"
				" aggrin_queue=%u, aggrutil=%3.2f%%",
				agg->ios[0] / agg->slavecount,
				agg->ios[1] / agg->slavecount,
				agg->merges[0] / agg->slavecount,
				agg->merges[1] / agg->slavecount,
				agg->ticks[0] / agg->slavecount,
				agg->ticks[1] / agg->slavecount,
				agg->time_in_queue / agg->slavecount,
				agg->max_util.u.f);
	} else {
		log_info(";slaves;%u;%u;%u;%u;%u;%u;%u;%3.2f%%",
				agg->ios[0] / agg->slavecount,
				agg->ios[1] / agg->slavecount,
				agg->merges[0] / agg->slavecount,
				agg->merges[1] / agg->slavecount,
				agg->ticks[0] / agg->slavecount,
				agg->ticks[1] / agg->slavecount,
				agg->time_in_queue / agg->slavecount,
				agg->max_util.u.f);
	}
}

static void aggregate_slaves_stats(struct disk_util *masterdu)
{
	struct disk_util_agg *agg = &masterdu->agg;
	struct disk_util_stat *dus;
	struct flist_head *entry;
	struct disk_util *slavedu;
	double util;

	flist_for_each(entry, &masterdu->slaves) {
		slavedu = flist_entry(entry, struct disk_util, slavelist);
		dus = &slavedu->dus;
		agg->ios[0] += dus->ios[0];
		agg->ios[1] += dus->ios[1];
		agg->merges[0] += dus->merges[0];
		agg->merges[1] += dus->merges[1];
		agg->sectors[0] += dus->sectors[0];
		agg->sectors[1] += dus->sectors[1];
		agg->ticks[0] += dus->ticks[0];
		agg->ticks[1] += dus->ticks[1];
		agg->time_in_queue += dus->time_in_queue;
		agg->slavecount++;

		util = (double) (100 * dus->io_ticks / (double) slavedu->dus.msec);
		/* System utilization is the utilization of the
		 * component with the highest utilization.
		 */
		if (util > agg->max_util.u.f)
			agg->max_util.u.f = util;

	}

	if (agg->max_util.u.f > 100.0)
		agg->max_util.u.f = 100.0;
}

void disk_util_prune_entries(void)
{
	fio_mutex_down(disk_util_mutex);

	while (!flist_empty(&disk_list)) {
		struct disk_util *du;

		du = flist_entry(disk_list.next, struct disk_util, list);
		flist_del(&du->list);
		disk_util_free(du);
	}

	last_majdev = last_mindev = -1;
	fio_mutex_up(disk_util_mutex);
	fio_mutex_remove(disk_util_mutex);
}

void print_disk_util(struct disk_util_stat *dus, struct disk_util_agg *agg,
		     int terse)
{
	double util = 0;

	if (dus->msec)
		util = (double) 100 * dus->io_ticks / (double) dus->msec;
	if (util > 100.0)
		util = 100.0;

	if (!terse) {
		if (agg->slavecount)
			log_info("  ");

		log_info("  %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
			 "in_queue=%u, util=%3.2f%%", dus->name,
					dus->ios[0], dus->ios[1],
					dus->merges[0], dus->merges[1],
					dus->ticks[0], dus->ticks[1],
					dus->time_in_queue, util);
	} else {
		log_info(";%s;%u;%u;%u;%u;%u;%u;%u;%3.2f%%",
					dus->name, dus->ios[0], dus->ios[1],
					dus->merges[0], dus->merges[1],
					dus->ticks[0], dus->ticks[1],
					dus->time_in_queue, util);
	}

	/*
	 * If the device has slaves, aggregate the stats for
	 * those slave devices also.
	 */
	show_agg_stats(agg, terse);

	if (!terse)
		log_info("\n");
}

static void print_disk_util_json(struct disk_util *du, struct json_array *array)
{
	double util = 0;
	struct disk_util_stat *dus = &du->dus;
	struct disk_util_agg *agg = &du->agg;
	struct json_object *obj;

	obj = json_create_object();
	json_array_add_value_object(array, obj);

	if (dus->msec)
		util = (double) 100 * dus->io_ticks / (double) dus->msec;
	if (util > 100.0)
		util = 100.0;


	json_object_add_value_string(obj, "name", dus->name);
	json_object_add_value_int(obj, "read_ios", dus->ios[0]);
	json_object_add_value_int(obj, "write_ios", dus->ios[1]);
	json_object_add_value_int(obj, "read_merges", dus->merges[0]);
	json_object_add_value_int(obj, "write_merges", dus->merges[1]);
	json_object_add_value_int(obj, "read_ticks", dus->ticks[0]);
	json_object_add_value_int(obj, "write_ticks", dus->ticks[1]);
	json_object_add_value_int(obj, "in_queue", dus->time_in_queue);
	json_object_add_value_float(obj, "util", util);

	/*
	 * If the device has slaves, aggregate the stats for
	 * those slave devices also.
	 */
	if (!agg->slavecount)
		return;
	json_object_add_value_int(obj, "aggr_read_ios",
				agg->ios[0] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_write_ios",
				agg->ios[1] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_read_merges",
				agg->merges[0] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_write_merge",
				agg->merges[1] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_read_ticks",
				agg->ticks[0] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_write_ticks",
				agg->ticks[1] / agg->slavecount);
	json_object_add_value_int(obj, "aggr_in_queue",
				agg->time_in_queue / agg->slavecount);
	json_object_add_value_float(obj, "aggr_util", agg->max_util.u.f);
}

void show_disk_util(int terse, struct json_object *parent)
{
	struct flist_head *entry;
	struct disk_util *du;
	struct json_array *array = NULL;

	fio_mutex_down(disk_util_mutex);

	if (flist_empty(&disk_list)) {
		fio_mutex_up(disk_util_mutex);
		return;
	}

	if (!terse)
		log_info("\nDisk stats (read/write):\n");

	if (output_format == FIO_OUTPUT_JSON) {
		array = json_create_array();
		json_object_add_value_array(parent, "disk_util", array);
	}

	flist_for_each(entry, &disk_list) {
		du = flist_entry(entry, struct disk_util, list);

		aggregate_slaves_stats(du);
		if (output_format == FIO_OUTPUT_JSON)
			print_disk_util_json(du, array);
		else
			print_disk_util(&du->dus, &du->agg, terse);
	}

	fio_mutex_up(disk_util_mutex);
}

void setup_disk_util(void)
{
	disk_util_mutex = fio_mutex_init(FIO_MUTEX_UNLOCKED);
}
Commit	Line	Data
9f8f2064 JA	1	#include <stdio.h>
	2	#include <string.h>
	3	#include <sys/time.h>
	4	#include <sys/types.h>
	5	#include <sys/stat.h>
	6	#include <dirent.h>
	7	#include <libgen.h>
	8	#include <math.h>
	9
	10	#include "fio.h"
c97bd0fa	11	#include "smalloc.h"
7c9b1bce	12	#include "diskutil.h"
9f8f2064 JA	13
9f8f2064 JA	14	static int last_majdev, last_mindev;
c97bd0fa	15	static struct disk_util *last_du;
9f8f2064	16
9ec7779f	17	static struct fio_mutex *disk_util_mutex;
9ec7779f	18
d09a64a0	19	FLIST_HEAD(disk_list);
9f8f2064	20
2db4ecca JA	21	static struct disk_util __init_per_file_disk_util(struct thread_data td,
	22	int majdev, int mindev, char *path);
	23
c97bd0fa JA	24	static void disk_util_free(struct disk_util *du)
	25	{
	26	if (du == last_du)
	27	last_du = NULL;
	28
b8d541d5 JA	29	while (!flist_empty(&du->slaves)) {
	30	struct disk_util *slave;
	31
	32	slave = flist_entry(du->slaves.next, struct disk_util, slavelist);
	33	flist_del(&slave->slavelist);
	34	slave->users--;
	35	}
93bcfd20	36
c97bd0fa	37	fio_mutex_remove(du->lock);
c97bd0fa JA	38	sfree(du);
	39	}
	40
9f8f2064 JA	41	static int get_io_ticks(struct disk_util du, struct disk_util_stat dus)
	42	{
	43	unsigned in_flight;
d09a64a0	44	unsigned long long sectors[2];
9f8f2064 JA	45	char line[256];
	46	FILE *f;
	47	char *p;
5ec10eaa	48	int ret;
9f8f2064	49
cd991b9e JA	50	dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
cd991b9e JA	51
9f8f2064 JA	52	f = fopen(du->path, "r");
	53	if (!f)
	54	return 1;
	55
	56	p = fgets(line, sizeof(line), f);
	57	if (!p) {
	58	fclose(f);
	59	return 1;
	60	}
	61
cd991b9e JA	62	dprint(FD_DISKUTIL, "%s: %s", du->path, p);
	63
	64	ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
d09a64a0	65	&dus->merges[0], &sectors[0],
5ec10eaa	66	&dus->ticks[0], &dus->ios[1],
d09a64a0	67	&dus->merges[1], &sectors[1],
5ec10eaa JA	68	&dus->ticks[1], &in_flight,
5ec10eaa JA	69	&dus->io_ticks, &dus->time_in_queue);
9f8f2064	70	fclose(f);
cd991b9e	71	dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
d09a64a0 JA	72	dus->sectors[0] = sectors[0];
d09a64a0 JA	73	dus->sectors[1] = sectors[1];
cd991b9e	74	return ret != 11;
9f8f2064 JA	75	}
	76
	77	static void update_io_tick_disk(struct disk_util *du)
	78	{
	79	struct disk_util_stat __dus, dus, ldus;
	80	struct timeval t;
	81
c97bd0fa JA	82	if (!du->users)
c97bd0fa JA	83	return;
90b97ac3 JA	84	if (get_io_ticks(du, &__dus))
90b97ac3 JA	85	return;
9f8f2064 JA	86
	87	dus = &du->dus;
	88	ldus = &du->last_dus;
	89
	90	dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
	91	dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
	92	dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
	93	dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
	94	dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
	95	dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
	96	dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
	97	dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
	98	dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
	99	dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
	100
	101	fio_gettime(&t, NULL);
d09a64a0	102	dus->msec += mtime_since(&du->time, &t);
9f8f2064 JA	103	memcpy(&du->time, &t, sizeof(t));
	104	memcpy(ldus, &__dus, sizeof(__dus));
	105	}
	106
9ec7779f	107	int update_io_ticks(void)
9f8f2064	108	{
01743ee1	109	struct flist_head *entry;
9f8f2064	110	struct disk_util *du;
9ec7779f	111	int ret = 0;
9f8f2064	112
cd991b9e JA	113	dprint(FD_DISKUTIL, "update io ticks\n");
cd991b9e JA	114
9ec7779f JA	115	fio_mutex_down(disk_util_mutex);
	116
	117	if (!disk_util_exit) {
	118	flist_for_each(entry, &disk_list) {
	119	du = flist_entry(entry, struct disk_util, list);
	120	update_io_tick_disk(du);
	121	}
	122	} else
	123	ret = 1;
	124
	125	fio_mutex_up(disk_util_mutex);
	126	return ret;
9f8f2064 JA	127	}
9f8f2064 JA	128
e11c410c	129	static struct disk_util *disk_util_exists(int major, int minor)
9f8f2064	130	{
01743ee1	131	struct flist_head *entry;
9f8f2064 JA	132	struct disk_util *du;
9f8f2064 JA	133
9ec7779f JA	134	fio_mutex_down(disk_util_mutex);
9ec7779f JA	135
01743ee1 JA	136	flist_for_each(entry, &disk_list) {
01743ee1 JA	137	du = flist_entry(entry, struct disk_util, list);
9f8f2064	138
9ec7779f JA	139	if (major == du->major && minor == du->minor) {
9ec7779f JA	140	fio_mutex_up(disk_util_mutex);
e11c410c	141	return du;
9ec7779f	142	}
9f8f2064 JA	143	}
9f8f2064 JA	144
9ec7779f	145	fio_mutex_up(disk_util_mutex);
e11c410c	146	return NULL;
9f8f2064 JA	147	}
9f8f2064 JA	148
67423013 ST	149	static int get_device_numbers(char file_name, int maj, int *min)
	150	{
	151	struct stat st;
	152	int majdev, mindev;
	153	char tempname[PATH_MAX], *p;
	154
	155	if (!lstat(file_name, &st)) {
	156	if (S_ISBLK(st.st_mode)) {
	157	majdev = major(st.st_rdev);
	158	mindev = minor(st.st_rdev);
	159	} else if (S_ISCHR(st.st_mode)) {
	160	majdev = major(st.st_rdev);
	161	mindev = minor(st.st_rdev);
	162	if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
	163	return -1;
	164	} else if (S_ISFIFO(st.st_mode))
	165	return -1;
	166	else {
	167	majdev = major(st.st_dev);
	168	mindev = minor(st.st_dev);
	169	}
	170	} else {
	171	/*
	172	* must be a file, open "." in that path
	173	*/
	174	strncpy(tempname, file_name, PATH_MAX - 1);
	175	p = dirname(tempname);
	176	if (stat(p, &st)) {
	177	perror("disk util stat");
	178	return -1;
	179	}
	180
	181	majdev = major(st.st_dev);
	182	mindev = minor(st.st_dev);
	183	}
	184
	185	*min = mindev;
	186	*maj = majdev;
	187
	188	return 0;
	189	}
	190
	191	static int read_block_dev_entry(char path, int maj, int *min)
	192	{
	193	char line[256], *p;
	194	FILE *f;
	195
	196	f = fopen(path, "r");
	197	if (!f) {
	198	perror("open path");
	199	return 1;
	200	}
	201
	202	p = fgets(line, sizeof(line), f);
	203	fclose(f);
	204
	205	if (!p)
	206	return 1;
	207
	208	if (sscanf(p, "%u:%u", maj, min) != 2)
	209	return 1;
	210
	211	return 0;
	212	}
213
67423013	214	static void find_add_disk_slaves(struct thread_data td, char path,
2db4ecca	215	struct disk_util *masterdu)
67423013 ST	216	{
	217	DIR *dirhandle = NULL;
	218	struct dirent *dirent = NULL;
	219	char slavesdir[PATH_MAX], temppath[PATH_MAX], slavepath[PATH_MAX];
	220	struct disk_util *slavedu = NULL;
	221	int majdev, mindev;
	222	ssize_t linklen;
	223
2db4ecca	224	sprintf(slavesdir, "%s/%s", path, "slaves");
67423013 ST	225	dirhandle = opendir(slavesdir);
	226	if (!dirhandle)
	227	return;
	228
	229	while ((dirent = readdir(dirhandle)) != NULL) {
2db4ecca JA	230	if (!strcmp(dirent->d_name, ".") \|\|
2db4ecca JA	231	!strcmp(dirent->d_name, ".."))
67423013 ST	232	continue;
67423013 ST	233
b9fd788f	234	sprintf(temppath, "%s%s%s", slavesdir, FIO_OS_PATH_SEPARATOR, dirent->d_name);
67423013 ST	235	/* Can we always assume that the slaves device entries
	236	* are links to the real directories for the slave
	237	* devices?
	238	*/
2db4ecca JA	239	linklen = readlink(temppath, slavepath, PATH_MAX - 0);
2db4ecca JA	240	if (linklen < 0) {
67423013 ST	241	perror("readlink() for slave device.");
	242	return;
	243	}
2db4ecca	244	slavepath[linklen] = '\0';
67423013 ST	245
	246	sprintf(temppath, "%s/%s/dev", slavesdir, slavepath);
	247	if (read_block_dev_entry(temppath, &majdev, &mindev)) {
	248	perror("Error getting slave device numbers.");
	249	return;
	250	}
	251
b06de82e AB	252	/*
	253	* See if this maj,min already exists
	254	*/
	255	slavedu = disk_util_exists(majdev, mindev);
	256	if (slavedu)
	257	continue;
	258
b9fd788f	259	sprintf(temppath, "%s%s%s", slavesdir, FIO_OS_PATH_SEPARATOR, slavepath);
67423013 ST	260	__init_per_file_disk_util(td, majdev, mindev, temppath);
	261	slavedu = disk_util_exists(majdev, mindev);
	262
	263	/* Should probably use an assert here. slavedu should
	264	* always be present at this point. */
b8d541d5 JA	265	if (slavedu) {
b8d541d5 JA	266	slavedu->users++;
67423013	267	flist_add_tail(&slavedu->slavelist, &masterdu->slaves);
b8d541d5	268	}
67423013 ST	269	}
	270
	271	closedir(dirhandle);
67423013 ST	272	}
67423013 ST	273
b8fefc2b	274	static struct disk_util disk_util_add(struct thread_data td, int majdev,
c97bd0fa	275	int mindev, char *path)
9f8f2064 JA	276	{
9f8f2064 JA	277	struct disk_util du, __du;
01743ee1	278	struct flist_head *entry;
4b919f77	279	int l;
9f8f2064	280
cd991b9e JA	281	dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
cd991b9e JA	282
c97bd0fa	283	du = smalloc(sizeof(*du));
fba5c5ff JA	284	if (!du) {
	285	log_err("fio: smalloc() pool exhausted\n");
	286	return NULL;
	287	}
	288
9f8f2064	289	memset(du, 0, sizeof(*du));
01743ee1	290	INIT_FLIST_HEAD(&du->list);
4b919f77 KR	291	l = snprintf(du->path, sizeof(du->path), "%s/stat", path);
	292	if (l < 0 \|\| l >= sizeof(du->path)) {
	293	log_err("constructed path \"%.100s[...]/stat\" larger than buffer (%zu bytes)\n",
	294	path, sizeof(du->path) - 1);
	295	sfree(du);
	296	return NULL;
	297	}
d09a64a0	298	strncpy((char *) du->dus.name, basename(path), FIO_DU_NAME_SZ);
e11c410c	299	du->sysfs_root = path;
9f8f2064 JA	300	du->major = majdev;
9f8f2064 JA	301	du->minor = mindev;
67423013 ST	302	INIT_FLIST_HEAD(&du->slavelist);
67423013 ST	303	INIT_FLIST_HEAD(&du->slaves);
521da527	304	du->lock = fio_mutex_init(FIO_MUTEX_UNLOCKED);
c97bd0fa	305	du->users = 0;
9f8f2064	306
9ec7779f JA	307	fio_mutex_down(disk_util_mutex);
9ec7779f JA	308
01743ee1 JA	309	flist_for_each(entry, &disk_list) {
01743ee1 JA	310	__du = flist_entry(entry, struct disk_util, list);
9f8f2064	311
d09a64a0	312	dprint(FD_DISKUTIL, "found %s in list\n", __du->dus.name);
cd991b9e	313
d09a64a0	314	if (!strcmp((char ) du->dus.name, (char ) __du->dus.name)) {
c97bd0fa	315	disk_util_free(du);
9ec7779f	316	fio_mutex_up(disk_util_mutex);
c97bd0fa	317	return __du;
9f8f2064 JA	318	}
	319	}
	320
d09a64a0	321	dprint(FD_DISKUTIL, "add %s to list\n", du->dus.name);
cd991b9e	322
9f8f2064 JA	323	fio_gettime(&du->time, NULL);
	324	get_io_ticks(du, &du->last_dus);
	325
01743ee1	326	flist_add_tail(&du->list, &disk_list);
9ec7779f JA	327	fio_mutex_up(disk_util_mutex);
9ec7779f JA	328
67423013	329	find_add_disk_slaves(td, path, du);
c97bd0fa	330	return du;
9f8f2064 JA	331	}
	332
	333	static int check_dev_match(int majdev, int mindev, char *path)
	334	{
	335	int major, minor;
9f8f2064	336
67423013	337	if (read_block_dev_entry(path, &major, &minor))
9f8f2064	338	return 1;
9f8f2064	339
c97bd0fa	340	if (majdev == major && mindev == minor)
9f8f2064	341	return 0;
9f8f2064	342
9f8f2064 JA	343	return 1;
	344	}
	345
ac0be2ac	346	static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
9f8f2064 JA	347	{
	348	struct dirent *dir;
	349	struct stat st;
	350	int found = 0;
	351	DIR *D;
	352
	353	D = opendir(path);
	354	if (!D)
	355	return 0;
	356
	357	while ((dir = readdir(D)) != NULL) {
	358	char full_path[256];
	359
	360	if (!strcmp(dir->d_name, ".") \|\| !strcmp(dir->d_name, ".."))
	361	continue;
	362
b9fd788f	363	sprintf(full_path, "%s%s%s", path, FIO_OS_PATH_SEPARATOR, dir->d_name);
9f8f2064 JA	364
	365	if (!strcmp(dir->d_name, "dev")) {
	366	if (!check_dev_match(majdev, mindev, full_path)) {
	367	found = 1;
	368	break;
	369	}
	370	}
	371
ac0be2ac JA	372	if (link_ok) {
	373	if (stat(full_path, &st) == -1) {
	374	perror("stat");
	375	break;
	376	}
	377	} else {
	378	if (lstat(full_path, &st) == -1) {
	379	perror("stat");
	380	break;
	381	}
9f8f2064 JA	382	}
	383
	384	if (!S_ISDIR(st.st_mode) \|\| S_ISLNK(st.st_mode))
	385	continue;
	386
ac0be2ac	387	found = find_block_dir(majdev, mindev, full_path, 0);
9f8f2064 JA	388	if (found) {
	389	strcpy(path, full_path);
	390	break;
	391	}
	392	}
	393
	394	closedir(D);
	395	return found;
	396	}
	397
c97bd0fa JA	398	static struct disk_util __init_per_file_disk_util(struct thread_data td,
	399	int majdev, int mindev,
	400	char *path)
9f8f2064 JA	401	{
9f8f2064 JA	402	struct stat st;
67423013	403	char tmp[PATH_MAX];
9f8f2064 JA	404	char *p;
9f8f2064 JA	405
67423013 ST	406	/*
	407	* If there's a ../queue/ directory there, we are inside a partition.
	408	* Check if that is the case and jump back. For loop/md/dm etc we
	409	* are already in the right spot.
	410	*/
	411	sprintf(tmp, "%s/../queue", path);
	412	if (!stat(tmp, &st)) {
	413	p = dirname(path);
	414	sprintf(tmp, "%s/queue", p);
	415	if (stat(tmp, &st)) {
	416	log_err("unknown sysfs layout\n");
c97bd0fa	417	return NULL;
9f8f2064	418	}
67423013 ST	419	strncpy(tmp, p, PATH_MAX - 1);
67423013 ST	420	sprintf(path, "%s", tmp);
9f8f2064 JA	421	}
9f8f2064 JA	422
67423013 ST	423	if (td->o.ioscheduler && !td->sysfs_root)
	424	td->sysfs_root = strdup(path);
	425
c97bd0fa	426	return disk_util_add(td, majdev, mindev, path);
67423013 ST	427	}
67423013 ST	428
c97bd0fa JA	429	static struct disk_util init_per_file_disk_util(struct thread_data td,
c97bd0fa JA	430	char *filename)
67423013 ST	431	{
	432
	433	char foo[PATH_MAX];
	434	struct disk_util *du;
	435	int mindev, majdev;
	436
c97bd0fa JA	437	if (get_device_numbers(filename, &majdev, &mindev))
c97bd0fa JA	438	return NULL;
67423013 ST	439
	440	dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev,
	441	mindev);
cd991b9e	442
e11c410c JA	443	du = disk_util_exists(majdev, mindev);
	444	if (du) {
	445	if (td->o.ioscheduler && !td->sysfs_root)
	446	td->sysfs_root = strdup(du->sysfs_root);
	447
c97bd0fa	448	return du;
e11c410c	449	}
9f8f2064 JA	450
	451	/*
	452	* for an fs without a device, we will repeatedly stat through
	453	* sysfs which can take oodles of time for thousands of files. so
	454	* cache the last lookup and compare with that before going through
	455	* everything again.
	456	*/
	457	if (mindev == last_mindev && majdev == last_majdev)
c97bd0fa	458	return last_du;
9f8f2064 JA	459
	460	last_mindev = mindev;
	461	last_majdev = majdev;
5ec10eaa	462
9f8f2064	463	sprintf(foo, "/sys/block");
ac0be2ac	464	if (!find_block_dir(majdev, mindev, foo, 1))
c97bd0fa	465	return NULL;
9f8f2064	466
c97bd0fa	467	return __init_per_file_disk_util(td, majdev, mindev, foo);
67423013	468	}
9f8f2064	469
c97bd0fa JA	470	static struct disk_util __init_disk_util(struct thread_data td,
c97bd0fa JA	471	struct fio_file *f)
67423013 ST	472	{
67423013 ST	473	return init_per_file_disk_util(td, f->file_name);
9f8f2064 JA	474	}
	475
	476	void init_disk_util(struct thread_data *td)
	477	{
	478	struct fio_file *f;
	479	unsigned int i;
	480
	481	if (!td->o.do_disk_util \|\|
	482	(td->io_ops->flags & (FIO_DISKLESSIO \| FIO_NODISKUTIL)))
	483	return;
	484
	485	for_each_file(td, f, i)
c97bd0fa	486	f->du = __init_disk_util(td, f);
9f8f2064 JA	487	}
9f8f2064 JA	488
f2f788dd	489	static void show_agg_stats(struct disk_util_agg *agg, int terse)
d09a64a0 JA	490	{
	491	if (!agg->slavecount)
	492	return;
	493
f2f788dd JA	494	if (!terse) {
	495	log_info(", aggrios=%u/%u, aggrmerge=%u/%u, aggrticks=%u/%u,"
	496	" aggrin_queue=%u, aggrutil=%3.2f%%",
	497	agg->ios[0] / agg->slavecount,
	498	agg->ios[1] / agg->slavecount,
	499	agg->merges[0] / agg->slavecount,
	500	agg->merges[1] / agg->slavecount,
	501	agg->ticks[0] / agg->slavecount,
	502	agg->ticks[1] / agg->slavecount,
	503	agg->time_in_queue / agg->slavecount,
	504	agg->max_util.u.f);
	505	} else {
97b007ec	506	log_info(";slaves;%u;%u;%u;%u;%u;%u;%u;%3.2f%%",
f2f788dd JA	507	agg->ios[0] / agg->slavecount,
	508	agg->ios[1] / agg->slavecount,
	509	agg->merges[0] / agg->slavecount,
	510	agg->merges[1] / agg->slavecount,
	511	agg->ticks[0] / agg->slavecount,
	512	agg->ticks[1] / agg->slavecount,
	513	agg->time_in_queue / agg->slavecount,
	514	agg->max_util.u.f);
	515	}
d09a64a0 JA	516	}
d09a64a0 JA	517
043b74b9 ST	518	static void aggregate_slaves_stats(struct disk_util *masterdu)
043b74b9 ST	519	{
d09a64a0	520	struct disk_util_agg *agg = &masterdu->agg;
043b74b9 ST	521	struct disk_util_stat *dus;
	522	struct flist_head *entry;
	523	struct disk_util *slavedu;
d09a64a0	524	double util;
043b74b9 ST	525
	526	flist_for_each(entry, &masterdu->slaves) {
	527	slavedu = flist_entry(entry, struct disk_util, slavelist);
	528	dus = &slavedu->dus;
d09a64a0 JA	529	agg->ios[0] += dus->ios[0];
	530	agg->ios[1] += dus->ios[1];
	531	agg->merges[0] += dus->merges[0];
	532	agg->merges[1] += dus->merges[1];
	533	agg->sectors[0] += dus->sectors[0];
	534	agg->sectors[1] += dus->sectors[1];
	535	agg->ticks[0] += dus->ticks[0];
	536	agg->ticks[1] += dus->ticks[1];
	537	agg->time_in_queue += dus->time_in_queue;
	538	agg->slavecount++;
	539
	540	util = (double) (100 * dus->io_ticks / (double) slavedu->dus.msec);
043b74b9 ST	541	/* System utilization is the utilization of the
	542	* component with the highest utilization.
	543	*/
d09a64a0 JA	544	if (util > agg->max_util.u.f)
d09a64a0 JA	545	agg->max_util.u.f = util;
043b74b9 ST	546
	547	}
	548
d09a64a0 JA	549	if (agg->max_util.u.f > 100.0)
	550	agg->max_util.u.f = 100.0;
	551	}
	552
27357187	553	void disk_util_prune_entries(void)
d09a64a0	554	{
9ec7779f JA	555	fio_mutex_down(disk_util_mutex);
9ec7779f JA	556
d09a64a0	557	while (!flist_empty(&disk_list)) {
27357187 JA	558	struct disk_util *du;
27357187 JA	559
d09a64a0 JA	560	du = flist_entry(disk_list.next, struct disk_util, list);
	561	flist_del(&du->list);
	562	disk_util_free(du);
	563	}
043b74b9	564
d09a64a0	565	last_majdev = last_mindev = -1;
9ec7779f JA	566	fio_mutex_up(disk_util_mutex);
9ec7779f JA	567	fio_mutex_remove(disk_util_mutex);
d09a64a0 JA	568	}
d09a64a0 JA	569
f2f788dd JA	570	void print_disk_util(struct disk_util_stat dus, struct disk_util_agg agg,
f2f788dd JA	571	int terse)
d09a64a0	572	{
6914f59e	573	double util = 0;
d09a64a0	574
6914f59e JA	575	if (dus->msec)
6914f59e JA	576	util = (double) 100 * dus->io_ticks / (double) dus->msec;
d09a64a0 JA	577	if (util > 100.0)
	578	util = 100.0;
	579
f2f788dd	580	if (!terse) {
f1d64553 JA	581	if (agg->slavecount)
	582	log_info(" ");
	583
f2f788dd JA	584	log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
f2f788dd JA	585	"in_queue=%u, util=%3.2f%%", dus->name,
d09a64a0 JA	586	dus->ios[0], dus->ios[1],
	587	dus->merges[0], dus->merges[1],
	588	dus->ticks[0], dus->ticks[1],
	589	dus->time_in_queue, util);
f2f788dd	590	} else {
3d7cd9b4	591	log_info(";%s;%u;%u;%u;%u;%u;%u;%u;%3.2f%%",
f2f788dd JA	592	dus->name, dus->ios[0], dus->ios[1],
	593	dus->merges[0], dus->merges[1],
	594	dus->ticks[0], dus->ticks[1],
	595	dus->time_in_queue, util);
	596	}
d09a64a0 JA	597
	598	/*
	599	* If the device has slaves, aggregate the stats for
	600	* those slave devices also.
	601	*/
f1d64553	602	show_agg_stats(agg, terse);
d09a64a0	603
f2f788dd JA	604	if (!terse)
f2f788dd JA	605	log_info("\n");
043b74b9 ST	606	}
043b74b9 ST	607
cc372b17 SL	608	static void print_disk_util_json(struct disk_util du, struct json_array array)
	609	{
	610	double util = 0;
	611	struct disk_util_stat *dus = &du->dus;
	612	struct disk_util_agg *agg = &du->agg;
	613	struct json_object *obj;
	614
	615	obj = json_create_object();
	616	json_array_add_value_object(array, obj);
	617
	618	if (dus->msec)
	619	util = (double) 100 * dus->io_ticks / (double) dus->msec;
	620	if (util > 100.0)
	621	util = 100.0;
	622
	623
	624	json_object_add_value_string(obj, "name", dus->name);
	625	json_object_add_value_int(obj, "read_ios", dus->ios[0]);
	626	json_object_add_value_int(obj, "write_ios", dus->ios[1]);
	627	json_object_add_value_int(obj, "read_merges", dus->merges[0]);
	628	json_object_add_value_int(obj, "write_merges", dus->merges[1]);
	629	json_object_add_value_int(obj, "read_ticks", dus->ticks[0]);
	630	json_object_add_value_int(obj, "write_ticks", dus->ticks[1]);
	631	json_object_add_value_int(obj, "in_queue", dus->time_in_queue);
	632	json_object_add_value_float(obj, "util", util);
	633
	634	/*
	635	* If the device has slaves, aggregate the stats for
	636	* those slave devices also.
	637	*/
	638	if (!agg->slavecount)
	639	return;
	640	json_object_add_value_int(obj, "aggr_read_ios",
	641	agg->ios[0] / agg->slavecount);
	642	json_object_add_value_int(obj, "aggr_write_ios",
	643	agg->ios[1] / agg->slavecount);
	644	json_object_add_value_int(obj, "aggr_read_merges",
	645	agg->merges[0] / agg->slavecount);
	646	json_object_add_value_int(obj, "aggr_write_merge",
	647	agg->merges[1] / agg->slavecount);
	648	json_object_add_value_int(obj, "aggr_read_ticks",
	649	agg->ticks[0] / agg->slavecount);
	650	json_object_add_value_int(obj, "aggr_write_ticks",
	651	agg->ticks[1] / agg->slavecount);
	652	json_object_add_value_int(obj, "aggr_in_queue",
	653	agg->time_in_queue / agg->slavecount);
	654	json_object_add_value_float(obj, "aggr_util", agg->max_util.u.f);
	655	}
	656
	657	void show_disk_util(int terse, struct json_object *parent)
9f8f2064	658	{
d09a64a0	659	struct flist_head *entry;
9f8f2064	660	struct disk_util *du;
cc372b17	661	struct json_array *array = NULL;
9f8f2064	662
9ec7779f JA	663	fio_mutex_down(disk_util_mutex);
	664
	665	if (flist_empty(&disk_list)) {
	666	fio_mutex_up(disk_util_mutex);
0a839f30	667	return;
9ec7779f	668	}
0a839f30	669
f2f788dd JA	670	if (!terse)
f2f788dd JA	671	log_info("\nDisk stats (read/write):\n");
9f8f2064	672
aeb32dfc	673	if (output_format == FIO_OUTPUT_JSON) {
cc372b17 SL	674	array = json_create_array();
	675	json_object_add_value_array(parent, "disk_util", array);
	676	}
	677
01743ee1 JA	678	flist_for_each(entry, &disk_list) {
01743ee1 JA	679	du = flist_entry(entry, struct disk_util, list);
9f8f2064	680
d09a64a0	681	aggregate_slaves_stats(du);
aeb32dfc	682	if (output_format == FIO_OUTPUT_JSON)
cc372b17 SL	683	print_disk_util_json(du, array);
	684	else
	685	print_disk_util(&du->dus, &du->agg, terse);
9f8f2064	686	}
9ec7779f JA	687
	688	fio_mutex_up(disk_util_mutex);
	689	}
	690
	691	void setup_disk_util(void)
	692	{
521da527	693	disk_util_mutex = fio_mutex_init(FIO_MUTEX_UNLOCKED);
9f8f2064	694	}