1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/* Copyright (c) 2010, 2011, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
#ifndef TABLE_IO_WAIT_SUMMARY_BY_INDEX_USAGE_H
#define TABLE_IO_WAIT_SUMMARY_BY_INDEX_USAGE_H
/**
@file storage/perfschema/table_tiws_by_index_usage.h
Table TABLE_IO_WAIT_SUMMARY_BY_INDEX_USAGE (declarations).
*/
#include "pfs_column_types.h"
#include "pfs_engine_table.h"
#include "pfs_instr_class.h"
#include "pfs_instr.h"
#include "table_helper.h"
/**
@addtogroup Performance_schema_tables
@{
*/
/**
A row of table
PERFORMANCE_SCHEMA.TABLE_IO_WAIT_SUMMARY_BY_INDEX.
*/
struct row_tiws_by_index_usage
{
/** Column OBJECT_TYPE, SCHEMA_NAME, OBJECT_NAME, INDEX_NAME. */
PFS_index_row m_index;
/** Columns COUNT/SUM/MIN/AVG/MAX (+_READ, +WRITE). */
PFS_table_io_stat_row m_stat;
};
/**
Position of a cursor on
PERFORMANCE_SCHEMA.TABLE_IO_WAIT_SUMMARY_BY_INDEX.
Index 1 on table_share_array (0 based)
Index 2 on index (0 based)
*/
struct pos_tiws_by_index_usage : public PFS_double_index
{
pos_tiws_by_index_usage()
: PFS_double_index(0, 0)
{}
inline void reset(void)
{
m_index_1= 0;
m_index_2= 0;
}
inline bool has_more_table(void)
{
return (m_index_1 < table_share_max);
}
inline void next_table(void)
{
m_index_1++;
m_index_2= 0;
}
};
/** Table PERFORMANCE_SCHEMA.TABLE_IO_WAIT_SUMMARY_BY_INDEX. */
class table_tiws_by_index_usage : public PFS_engine_table
{
public:
/** Table share */
static PFS_engine_table_share m_share;
static PFS_engine_table* create();
static int delete_all_rows();
virtual int rnd_init(bool scan);
virtual int rnd_next();
virtual int rnd_pos(const void *pos);
virtual void reset_position(void);
protected:
virtual int read_row_values(TABLE *table,
unsigned char *buf,
Field **fields,
bool read_all);
table_tiws_by_index_usage();
public:
~table_tiws_by_index_usage()
{}
protected:
void make_row(PFS_table_share *table_share, uint index);
private:
/** Table share lock. */
static THR_LOCK m_table_lock;
/** Fields definition. */
static TABLE_FIELD_DEF m_field_def;
/** Current row. */
row_tiws_by_index_usage m_row;
/** True is the current row exists. */
bool m_row_exists;
/** Current position. */
pos_tiws_by_index_usage m_pos;
/** Next position. */
pos_tiws_by_index_usage m_next_pos;
};
/** @} */
#endif
|
