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
|
/* Copyright (c) 2010, 2015, 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 */
#include "my_global.h"
#include "my_pthread.h"
#include "pfs_con_slice.h"
#include "pfs_stat.h"
#include "pfs_global.h"
#include "pfs_instr_class.h"
/**
@file storage/perfschema/pfs_con_slice.cc
Performance schema connection slice (implementation).
*/
/**
@addtogroup Performance_schema_buffers
@{
*/
PFS_single_stat *
PFS_connection_slice::alloc_waits_slice(uint sizing)
{
PFS_single_stat *slice= NULL;
uint index;
if (sizing > 0)
{
slice= PFS_MALLOC_ARRAY(sizing, sizeof(PFS_single_stat), PFS_single_stat,
MYF(MY_ZEROFILL));
if (unlikely(slice == NULL))
return NULL;
for (index= 0; index < sizing; index++)
slice[index].reset();
}
return slice;
}
PFS_stage_stat *
PFS_connection_slice::alloc_stages_slice(uint sizing)
{
PFS_stage_stat *slice= NULL;
uint index;
if (sizing > 0)
{
slice= PFS_MALLOC_ARRAY(sizing, sizeof(PFS_stage_stat), PFS_stage_stat,
MYF(MY_ZEROFILL));
if (unlikely(slice == NULL))
return NULL;
for (index= 0; index < sizing; index++)
slice[index].reset();
}
return slice;
}
PFS_statement_stat *
PFS_connection_slice::alloc_statements_slice(uint sizing)
{
PFS_statement_stat *slice= NULL;
uint index;
if (sizing > 0)
{
slice= PFS_MALLOC_ARRAY(sizing, sizeof(PFS_statement_stat), PFS_statement_stat,
MYF(MY_ZEROFILL));
if (unlikely(slice == NULL))
return NULL;
for (index= 0; index < sizing; index++)
slice[index].reset();
}
return slice;
}
void PFS_connection_slice::reset_waits_stats()
{
PFS_single_stat *stat= m_instr_class_waits_stats;
PFS_single_stat *stat_last= stat + wait_class_max;
for ( ; stat < stat_last; stat++)
stat->reset();
}
void PFS_connection_slice::reset_stages_stats()
{
PFS_stage_stat *stat= m_instr_class_stages_stats;
PFS_stage_stat *stat_last= stat + stage_class_max;
for ( ; stat < stat_last; stat++)
stat->reset();
}
void PFS_connection_slice::reset_statements_stats()
{
PFS_statement_stat *stat= m_instr_class_statements_stats;
PFS_statement_stat *stat_last= stat + statement_class_max;
for ( ; stat < stat_last; stat++)
stat->reset();
}
/** @} */
|
