333 lines
7.3 KiB
C++
333 lines
7.3 KiB
C++
/* 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 Street, Fifth Floor, Boston, MA 02110-1301, USA */
|
|
|
|
/**
|
|
@file storage/perfschema/pfs_user.cc
|
|
Performance schema user (implementation).
|
|
*/
|
|
|
|
#include "my_global.h"
|
|
#include "my_sys.h"
|
|
#include "pfs.h"
|
|
#include "pfs_stat.h"
|
|
#include "pfs_instr.h"
|
|
#include "pfs_setup_actor.h"
|
|
#include "pfs_user.h"
|
|
#include "pfs_global.h"
|
|
#include "pfs_instr_class.h"
|
|
#include "pfs_buffer_container.h"
|
|
|
|
/**
|
|
@addtogroup Performance_schema_buffers
|
|
@{
|
|
*/
|
|
|
|
LF_HASH user_hash;
|
|
static bool user_hash_inited= false;
|
|
|
|
/**
|
|
Initialize the user buffers.
|
|
@param param sizing parameters
|
|
@return 0 on success
|
|
*/
|
|
int init_user(const PFS_global_param *param)
|
|
{
|
|
if (global_user_container.init(param->m_user_sizing))
|
|
return 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/** Cleanup all the user buffers. */
|
|
void cleanup_user(void)
|
|
{
|
|
global_user_container.cleanup();
|
|
}
|
|
|
|
C_MODE_START
|
|
static uchar *user_hash_get_key(const uchar *entry, size_t *length,
|
|
my_bool)
|
|
{
|
|
const PFS_user * const *typed_entry;
|
|
const PFS_user *user;
|
|
const void *result;
|
|
typed_entry= reinterpret_cast<const PFS_user* const *> (entry);
|
|
DBUG_ASSERT(typed_entry != NULL);
|
|
user= *typed_entry;
|
|
DBUG_ASSERT(user != NULL);
|
|
*length= user->m_key.m_key_length;
|
|
result= user->m_key.m_hash_key;
|
|
return const_cast<uchar*> (reinterpret_cast<const uchar*> (result));
|
|
}
|
|
C_MODE_END
|
|
|
|
/**
|
|
Initialize the user hash.
|
|
@return 0 on success
|
|
*/
|
|
int init_user_hash(const PFS_global_param *param)
|
|
{
|
|
if ((! user_hash_inited) && (param->m_user_sizing != 0))
|
|
{
|
|
lf_hash_init(&user_hash, sizeof(PFS_user*), LF_HASH_UNIQUE,
|
|
0, 0, user_hash_get_key, &my_charset_bin);
|
|
user_hash_inited= true;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/** Cleanup the user hash. */
|
|
void cleanup_user_hash(void)
|
|
{
|
|
if (user_hash_inited)
|
|
{
|
|
lf_hash_destroy(&user_hash);
|
|
user_hash_inited= false;
|
|
}
|
|
}
|
|
|
|
static LF_PINS* get_user_hash_pins(PFS_thread *thread)
|
|
{
|
|
if (unlikely(thread->m_user_hash_pins == NULL))
|
|
{
|
|
if (! user_hash_inited)
|
|
return NULL;
|
|
thread->m_user_hash_pins= lf_hash_get_pins(&user_hash);
|
|
}
|
|
return thread->m_user_hash_pins;
|
|
}
|
|
|
|
static void set_user_key(PFS_user_key *key,
|
|
const char *user, uint user_length)
|
|
{
|
|
DBUG_ASSERT(user_length <= USERNAME_LENGTH);
|
|
|
|
char *ptr= &key->m_hash_key[0];
|
|
if (user_length > 0)
|
|
{
|
|
memcpy(ptr, user, user_length);
|
|
ptr+= user_length;
|
|
}
|
|
ptr[0]= 0;
|
|
ptr++;
|
|
key->m_key_length= ptr - &key->m_hash_key[0];
|
|
}
|
|
|
|
PFS_user *
|
|
find_or_create_user(PFS_thread *thread,
|
|
const char *username, uint username_length)
|
|
{
|
|
LF_PINS *pins= get_user_hash_pins(thread);
|
|
if (unlikely(pins == NULL))
|
|
{
|
|
global_user_container.m_lost++;
|
|
return NULL;
|
|
}
|
|
|
|
PFS_user_key key;
|
|
set_user_key(&key, username, username_length);
|
|
|
|
PFS_user **entry;
|
|
PFS_user *pfs;
|
|
uint retry_count= 0;
|
|
const uint retry_max= 3;
|
|
pfs_dirty_state dirty_state;
|
|
|
|
search:
|
|
entry= reinterpret_cast<PFS_user**>
|
|
(lf_hash_search(&user_hash, pins,
|
|
key.m_hash_key, key.m_key_length));
|
|
if (entry && (entry != MY_ERRPTR))
|
|
{
|
|
pfs= *entry;
|
|
pfs->inc_refcount();
|
|
lf_hash_search_unpin(pins);
|
|
return pfs;
|
|
}
|
|
|
|
lf_hash_search_unpin(pins);
|
|
|
|
pfs= global_user_container.allocate(& dirty_state);
|
|
if (pfs != NULL)
|
|
{
|
|
pfs->m_key= key;
|
|
if (username_length > 0)
|
|
pfs->m_username= &pfs->m_key.m_hash_key[0];
|
|
else
|
|
pfs->m_username= NULL;
|
|
pfs->m_username_length= username_length;
|
|
|
|
pfs->init_refcount();
|
|
pfs->reset_stats();
|
|
pfs->m_disconnected_count= 0;
|
|
|
|
int res;
|
|
pfs->m_lock.dirty_to_allocated(& dirty_state);
|
|
res= lf_hash_insert(&user_hash, pins, &pfs);
|
|
if (likely(res == 0))
|
|
{
|
|
return pfs;
|
|
}
|
|
|
|
global_user_container.deallocate(pfs);
|
|
|
|
if (res > 0)
|
|
{
|
|
if (++retry_count > retry_max)
|
|
{
|
|
global_user_container.m_lost++;
|
|
return NULL;
|
|
}
|
|
goto search;
|
|
}
|
|
|
|
global_user_container.m_lost++;
|
|
return NULL;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void PFS_user::aggregate(bool alive)
|
|
{
|
|
aggregate_waits();
|
|
aggregate_stages();
|
|
aggregate_statements();
|
|
aggregate_transactions();
|
|
aggregate_memory(alive);
|
|
aggregate_status();
|
|
aggregate_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_waits()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
reset_waits_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_stages()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
reset_stages_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_statements()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
reset_statements_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_transactions()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
reset_transactions_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_memory(bool alive)
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
rebase_memory_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_status()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
reset_status_stats();
|
|
}
|
|
|
|
void PFS_user::aggregate_stats()
|
|
{
|
|
/* No parent to aggregate to, clean the stats */
|
|
m_disconnected_count= 0;
|
|
}
|
|
|
|
void PFS_user::release()
|
|
{
|
|
dec_refcount();
|
|
}
|
|
|
|
void PFS_user::carry_memory_stat_delta(PFS_memory_stat_delta *delta, uint index)
|
|
{
|
|
PFS_memory_stat *event_name_array;
|
|
PFS_memory_stat *stat;
|
|
PFS_memory_stat_delta delta_buffer;
|
|
|
|
event_name_array= write_instr_class_memory_stats();
|
|
stat= & event_name_array[index];
|
|
(void) stat->apply_delta(delta, &delta_buffer);
|
|
}
|
|
|
|
PFS_user *sanitize_user(PFS_user *unsafe)
|
|
{
|
|
return global_user_container.sanitize(unsafe);
|
|
}
|
|
|
|
void purge_user(PFS_thread *thread, PFS_user *user)
|
|
{
|
|
LF_PINS *pins= get_user_hash_pins(thread);
|
|
if (unlikely(pins == NULL))
|
|
return;
|
|
|
|
PFS_user **entry;
|
|
entry= reinterpret_cast<PFS_user**>
|
|
(lf_hash_search(&user_hash, pins,
|
|
user->m_key.m_hash_key, user->m_key.m_key_length));
|
|
if (entry && (entry != MY_ERRPTR))
|
|
{
|
|
DBUG_ASSERT(*entry == user);
|
|
if (user->get_refcount() == 0)
|
|
{
|
|
lf_hash_delete(&user_hash, pins,
|
|
user->m_key.m_hash_key, user->m_key.m_key_length);
|
|
user->aggregate(false);
|
|
global_user_container.deallocate(user);
|
|
}
|
|
}
|
|
|
|
lf_hash_search_unpin(pins);
|
|
}
|
|
|
|
class Proc_purge_user
|
|
: public PFS_buffer_processor<PFS_user>
|
|
{
|
|
public:
|
|
Proc_purge_user(PFS_thread *thread)
|
|
: m_thread(thread)
|
|
{}
|
|
|
|
virtual void operator()(PFS_user *pfs)
|
|
{
|
|
pfs->aggregate(true);
|
|
if (pfs->get_refcount() == 0)
|
|
purge_user(m_thread, pfs);
|
|
}
|
|
|
|
private:
|
|
PFS_thread *m_thread;
|
|
};
|
|
|
|
/** Purge non connected users, reset stats of connected users. */
|
|
void purge_all_user(void)
|
|
{
|
|
PFS_thread *thread= PFS_thread::get_current_thread();
|
|
if (unlikely(thread == NULL))
|
|
return;
|
|
|
|
Proc_purge_user proc(thread);
|
|
global_user_container.apply(proc);
|
|
}
|
|
|
|
/** @} */
|