2 * QEMU System Emulator block accounting
4 * Copyright (c) 2011 Christoph Hellwig
5 * Copyright (c) 2015 Igalia, S.L.
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #ifndef BLOCK_ACCOUNTING_H
26 #define BLOCK_ACCOUNTING_H
28 #include "qemu/timed-average.h"
29 #include "qemu/thread.h"
30 #include "qapi/qapi-types-common.h"
32 typedef struct BlockAcctTimedStats BlockAcctTimedStats
;
33 typedef struct BlockAcctStats BlockAcctStats
;
40 BLOCK_ACCT_ZONE_APPEND
,
45 struct BlockAcctTimedStats
{
46 BlockAcctStats
*stats
;
47 TimedAverage latency
[BLOCK_MAX_IOTYPE
];
48 unsigned interval_length
; /* in seconds */
49 QSLIST_ENTRY(BlockAcctTimedStats
) entries
;
52 typedef struct BlockLatencyHistogram
{
53 /* The following histogram is represented like this:
63 * BlockLatencyHistogram histogram = {
65 * .boundaries = {10, 50, 100},
66 * .bins = {3, 1, 5, 2},
69 * @boundaries array define histogram intervals as follows:
70 * [0, boundaries[0]), [boundaries[0], boundaries[1]), ...
71 * [boundaries[nbins-2], +inf)
73 * So, for example above, histogram intervals are:
74 * [0, 10), [10, 50), [50, 100), [100, +inf)
77 uint64_t *boundaries
; /* @nbins-1 numbers here
78 (all boundaries, except 0 and +inf) */
80 } BlockLatencyHistogram
;
82 struct BlockAcctStats
{
84 uint64_t nr_bytes
[BLOCK_MAX_IOTYPE
];
85 uint64_t nr_ops
[BLOCK_MAX_IOTYPE
];
86 uint64_t invalid_ops
[BLOCK_MAX_IOTYPE
];
87 uint64_t failed_ops
[BLOCK_MAX_IOTYPE
];
88 uint64_t total_time_ns
[BLOCK_MAX_IOTYPE
];
89 uint64_t merged
[BLOCK_MAX_IOTYPE
];
90 int64_t last_access_time_ns
;
91 QSLIST_HEAD(, BlockAcctTimedStats
) intervals
;
94 BlockLatencyHistogram latency_histogram
[BLOCK_MAX_IOTYPE
];
97 typedef struct BlockAcctCookie
{
99 int64_t start_time_ns
;
100 enum BlockAcctType type
;
103 void block_acct_init(BlockAcctStats
*stats
);
104 void block_acct_setup(BlockAcctStats
*stats
, enum OnOffAuto account_invalid
,
105 enum OnOffAuto account_failed
);
106 void block_acct_cleanup(BlockAcctStats
*stats
);
107 void block_acct_add_interval(BlockAcctStats
*stats
, unsigned interval_length
);
108 BlockAcctTimedStats
*block_acct_interval_next(BlockAcctStats
*stats
,
109 BlockAcctTimedStats
*s
);
110 void block_acct_start(BlockAcctStats
*stats
, BlockAcctCookie
*cookie
,
111 int64_t bytes
, enum BlockAcctType type
);
112 void block_acct_done(BlockAcctStats
*stats
, BlockAcctCookie
*cookie
);
113 void block_acct_failed(BlockAcctStats
*stats
, BlockAcctCookie
*cookie
);
114 void block_acct_invalid(BlockAcctStats
*stats
, enum BlockAcctType type
);
115 void block_acct_merge_done(BlockAcctStats
*stats
, enum BlockAcctType type
,
117 int64_t block_acct_idle_time_ns(BlockAcctStats
*stats
);
118 double block_acct_queue_depth(BlockAcctTimedStats
*stats
,
119 enum BlockAcctType type
);
120 int block_latency_histogram_set(BlockAcctStats
*stats
, enum BlockAcctType type
,
121 uint64List
*boundaries
);
122 void block_latency_histograms_clear(BlockAcctStats
*stats
);