mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 12:02:42 +01:00
7b8bfb2a93
Bug#12093 "SP not found on second PS execution if another thread drops other SP in between" and Bug#21294 "executing a prepared statement that executes a stored function which was recreat" Stored functions are resolved at prepared statement prepare only. If someone flushes the stored functions cache between prepare and execute, execution fails. The fix is to detect the situation of the cache flush and automatically reprepare the prepared statement after it. mysql-test/r/ps_ddl.result: Update results (Bug#12093 and Bug#21294, the test cases are already in the source tree). mysql-test/r/ps_ddl1.result: Update results (Bug#12093 and Bug#21294, the test cases are already in the source tree). mysql-test/r/sp-error.result: Update results (Bug#12093 and Bug#21294, the test cases are already in the source tree). mysql-test/t/ps_ddl.test: Modify the test to not expect an error where there is no error any more (Bug#12093, Bug#21294). mysql-test/t/ps_ddl1.test: Modify the test to not expect an error where there is no error any more (Bug#12093, Bug#21294). mysql-test/t/sp-error.test: Modify the test to not expect an error where there is no error any more (Bug#12093, Bug#21294). sql/sp_cache.cc: Implement sp_cache_version() -- returns the current version of a stored routines cache. sql/sp_cache.h: Declare sp_cache_version(). sql/sql_prepare.cc: Keep track of stored functions cache version, and invalidate the statement if it changed between prepared statement prepare and execute (and the statement actually uses stored routines).
275 lines
5.5 KiB
C++
275 lines
5.5 KiB
C++
/* Copyright (C) 2002 MySQL AB
|
|
|
|
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
|
|
|
|
#include "mysql_priv.h"
|
|
#ifdef USE_PRAGMA_IMPLEMENTATION
|
|
#pragma implementation
|
|
#endif
|
|
#include "sp_cache.h"
|
|
#include "sp_head.h"
|
|
|
|
static pthread_mutex_t Cversion_lock;
|
|
static ulong volatile Cversion= 0;
|
|
|
|
|
|
/*
|
|
Cache of stored routines.
|
|
*/
|
|
|
|
class sp_cache
|
|
{
|
|
public:
|
|
ulong version;
|
|
|
|
sp_cache();
|
|
~sp_cache();
|
|
|
|
inline void insert(sp_head *sp)
|
|
{
|
|
/* TODO: why don't we check return value? */
|
|
my_hash_insert(&m_hashtable, (const uchar *)sp);
|
|
}
|
|
|
|
inline sp_head *lookup(char *name, uint namelen)
|
|
{
|
|
return (sp_head *)hash_search(&m_hashtable, (const uchar *)name, namelen);
|
|
}
|
|
|
|
#ifdef NOT_USED
|
|
inline bool remove(char *name, uint namelen)
|
|
{
|
|
sp_head *sp= lookup(name, namelen);
|
|
if (sp)
|
|
{
|
|
hash_delete(&m_hashtable, (uchar *)sp);
|
|
return TRUE;
|
|
}
|
|
return FALSE;
|
|
}
|
|
#endif
|
|
|
|
inline void remove_all()
|
|
{
|
|
cleanup();
|
|
init();
|
|
}
|
|
|
|
private:
|
|
void init();
|
|
void cleanup();
|
|
|
|
/* All routines in this cache */
|
|
HASH m_hashtable;
|
|
}; // class sp_cache
|
|
|
|
|
|
/* Initialize the SP caching once at startup */
|
|
|
|
void sp_cache_init()
|
|
{
|
|
pthread_mutex_init(&Cversion_lock, MY_MUTEX_INIT_FAST);
|
|
}
|
|
|
|
|
|
/*
|
|
Clear the cache *cp and set *cp to NULL.
|
|
|
|
SYNOPSIS
|
|
sp_cache_clear()
|
|
cp Pointer to cache to clear
|
|
|
|
NOTE
|
|
This function doesn't invalidate other caches.
|
|
*/
|
|
|
|
void sp_cache_clear(sp_cache **cp)
|
|
{
|
|
sp_cache *c= *cp;
|
|
|
|
if (c)
|
|
{
|
|
delete c;
|
|
*cp= NULL;
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
Insert a routine into the cache.
|
|
|
|
SYNOPSIS
|
|
sp_cache_insert()
|
|
cp The cache to put routine into
|
|
sp Routine to insert.
|
|
|
|
TODO: Perhaps it will be more straightforward if in case we returned an
|
|
error from this function when we couldn't allocate sp_cache. (right
|
|
now failure to put routine into cache will cause a 'SP not found'
|
|
error to be reported at some later time)
|
|
*/
|
|
|
|
void sp_cache_insert(sp_cache **cp, sp_head *sp)
|
|
{
|
|
sp_cache *c;
|
|
|
|
if (!(c= *cp))
|
|
{
|
|
if (!(c= new sp_cache()))
|
|
return; // End of memory error
|
|
c->version= Cversion; // No need to lock when reading long variable
|
|
}
|
|
DBUG_PRINT("info",("sp_cache: inserting: %.*s", (int) sp->m_qname.length,
|
|
sp->m_qname.str));
|
|
c->insert(sp);
|
|
*cp= c; // Update *cp if it was NULL
|
|
}
|
|
|
|
|
|
/*
|
|
Look up a routine in the cache.
|
|
SYNOPSIS
|
|
sp_cache_lookup()
|
|
cp Cache to look into
|
|
name Name of rutine to find
|
|
|
|
NOTE
|
|
An obsolete (but not more obsolete then since last
|
|
sp_cache_flush_obsolete call) routine may be returned.
|
|
|
|
RETURN
|
|
The routine or
|
|
NULL if the routine not found.
|
|
*/
|
|
|
|
sp_head *sp_cache_lookup(sp_cache **cp, sp_name *name)
|
|
{
|
|
sp_cache *c= *cp;
|
|
if (! c)
|
|
return NULL;
|
|
return c->lookup(name->m_qname.str, name->m_qname.length);
|
|
}
|
|
|
|
|
|
/*
|
|
Invalidate all routines in all caches.
|
|
|
|
SYNOPSIS
|
|
sp_cache_invalidate()
|
|
|
|
NOTE
|
|
This is called when a VIEW definition is modifed. We can't destroy sp_head
|
|
objects here as one may modify VIEW definitions from prelocking-free SPs.
|
|
*/
|
|
|
|
void sp_cache_invalidate()
|
|
{
|
|
DBUG_PRINT("info",("sp_cache: invalidating"));
|
|
thread_safe_increment(Cversion, &Cversion_lock);
|
|
}
|
|
|
|
|
|
/*
|
|
Remove out-of-date SPs from the cache.
|
|
|
|
SYNOPSIS
|
|
sp_cache_flush_obsolete()
|
|
cp Cache to flush
|
|
|
|
NOTE
|
|
This invalidates pointers to sp_head objects this thread uses.
|
|
In practice that means 'dont call this function when inside SP'.
|
|
*/
|
|
|
|
void sp_cache_flush_obsolete(sp_cache **cp)
|
|
{
|
|
sp_cache *c= *cp;
|
|
if (c)
|
|
{
|
|
ulong v;
|
|
v= Cversion; // No need to lock when reading long variable
|
|
if (c->version < v)
|
|
{
|
|
DBUG_PRINT("info",("sp_cache: deleting all functions"));
|
|
/* We need to delete all elements. */
|
|
c->remove_all();
|
|
c->version= v;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
Return the current version of the cache.
|
|
*/
|
|
|
|
ulong sp_cache_version(sp_cache **cp)
|
|
{
|
|
sp_cache *c= *cp;
|
|
if (c)
|
|
return c->version;
|
|
return 0;
|
|
}
|
|
|
|
|
|
/*************************************************************************
|
|
Internal functions
|
|
*************************************************************************/
|
|
|
|
extern "C" uchar *hash_get_key_for_sp_head(const uchar *ptr, size_t *plen,
|
|
my_bool first);
|
|
extern "C" void hash_free_sp_head(void *p);
|
|
|
|
uchar *hash_get_key_for_sp_head(const uchar *ptr, size_t *plen,
|
|
my_bool first)
|
|
{
|
|
sp_head *sp= (sp_head *)ptr;
|
|
*plen= sp->m_qname.length;
|
|
return (uchar*) sp->m_qname.str;
|
|
}
|
|
|
|
|
|
void hash_free_sp_head(void *p)
|
|
{
|
|
sp_head *sp= (sp_head *)p;
|
|
delete sp;
|
|
}
|
|
|
|
|
|
sp_cache::sp_cache()
|
|
{
|
|
init();
|
|
}
|
|
|
|
|
|
sp_cache::~sp_cache()
|
|
{
|
|
hash_free(&m_hashtable);
|
|
}
|
|
|
|
|
|
void
|
|
sp_cache::init()
|
|
{
|
|
hash_init(&m_hashtable, system_charset_info, 0, 0, 0,
|
|
hash_get_key_for_sp_head, hash_free_sp_head, 0);
|
|
version= 0;
|
|
}
|
|
|
|
|
|
void
|
|
sp_cache::cleanup()
|
|
{
|
|
hash_free(&m_hashtable);
|
|
}
|