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 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175
|
/* Copyright (c) 2008, 2010, 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,
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA */
/**
@file storage/perfschema/table_all_instr.cc
Abstract tables for all instruments (implementation).
*/
#include "my_global.h"
#include "my_pthread.h"
#include "table_all_instr.h"
#include "pfs_global.h"
table_all_instr::table_all_instr(const PFS_engine_table_share *share)
: PFS_engine_table(share, &m_pos),
m_pos(), m_next_pos()
{}
void table_all_instr::reset_position(void)
{
m_pos.reset();
m_next_pos.reset();
}
int table_all_instr::rnd_next(void)
{
PFS_mutex *mutex;
PFS_rwlock *rwlock;
PFS_cond *cond;
PFS_file *file;
PFS_socket *socket;
for (m_pos.set_at(&m_next_pos);
m_pos.has_more_view();
m_pos.next_view())
{
switch (m_pos.m_index_1) {
case pos_all_instr::VIEW_MUTEX:
for ( ; m_pos.m_index_2 < mutex_max; m_pos.m_index_2++)
{
mutex= &mutex_array[m_pos.m_index_2];
if (mutex->m_lock.is_populated())
{
make_mutex_row(mutex);
m_next_pos.set_after(&m_pos);
return 0;
}
}
break;
case pos_all_instr::VIEW_RWLOCK:
for ( ; m_pos.m_index_2 < rwlock_max; m_pos.m_index_2++)
{
rwlock= &rwlock_array[m_pos.m_index_2];
if (rwlock->m_lock.is_populated())
{
make_rwlock_row(rwlock);
m_next_pos.set_after(&m_pos);
return 0;
}
}
break;
case pos_all_instr::VIEW_COND:
for ( ; m_pos.m_index_2 < cond_max; m_pos.m_index_2++)
{
cond= &cond_array[m_pos.m_index_2];
if (cond->m_lock.is_populated())
{
make_cond_row(cond);
m_next_pos.set_after(&m_pos);
return 0;
}
}
break;
case pos_all_instr::VIEW_FILE:
for ( ; m_pos.m_index_2 < file_max; m_pos.m_index_2++)
{
file= &file_array[m_pos.m_index_2];
if (file->m_lock.is_populated())
{
make_file_row(file);
m_next_pos.set_after(&m_pos);
return 0;
}
}
break;
case pos_all_instr::VIEW_SOCKET:
for ( ; m_pos.m_index_2 < socket_max; m_pos.m_index_2++)
{
socket= &socket_array[m_pos.m_index_2];
if (socket->m_lock.is_populated())
{
make_socket_row(socket);
m_next_pos.set_after(&m_pos);
return 0;
}
}
break;
}
}
return HA_ERR_END_OF_FILE;
}
int table_all_instr::rnd_pos(const void *pos)
{
PFS_mutex *mutex;
PFS_rwlock *rwlock;
PFS_cond *cond;
PFS_file *file;
PFS_socket *socket;
set_position(pos);
switch (m_pos.m_index_1) {
case pos_all_instr::VIEW_MUTEX:
DBUG_ASSERT(m_pos.m_index_2 < mutex_max);
mutex= &mutex_array[m_pos.m_index_2];
if (mutex->m_lock.is_populated())
{
make_mutex_row(mutex);
return 0;
}
break;
case pos_all_instr::VIEW_RWLOCK:
DBUG_ASSERT(m_pos.m_index_2 < rwlock_max);
rwlock= &rwlock_array[m_pos.m_index_2];
if (rwlock->m_lock.is_populated())
{
make_rwlock_row(rwlock);
return 0;
}
break;
case pos_all_instr::VIEW_COND:
DBUG_ASSERT(m_pos.m_index_2 < cond_max);
cond= &cond_array[m_pos.m_index_2];
if (cond->m_lock.is_populated())
{
make_cond_row(cond);
return 0;
}
break;
case pos_all_instr::VIEW_FILE:
DBUG_ASSERT(m_pos.m_index_2 < file_max);
file= &file_array[m_pos.m_index_2];
if (file->m_lock.is_populated())
{
make_file_row(file);
return 0;
}
break;
case pos_all_instr::VIEW_SOCKET:
DBUG_ASSERT(m_pos.m_index_2 < socket_max);
socket= &socket_array[m_pos.m_index_2];
if (socket->m_lock.is_populated())
{
make_socket_row(socket);
return 0;
}
break;
}
return HA_ERR_RECORD_DELETED;
}
|