Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
/* 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; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
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 */
|
|
|
|
|
|
|
|
#ifdef __GNUC__
|
|
|
|
#pragma implementation
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined(WIN32) || defined(__WIN__)
|
|
|
|
#undef SAFEMALLOC /* Problems with threads */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "mysql_priv.h"
|
|
|
|
#include "sp_pcontext.h"
|
2002-12-11 14:24:29 +01:00
|
|
|
#include "sp_head.h"
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
|
|
|
|
sp_pcontext::sp_pcontext()
|
2003-10-10 16:57:21 +02:00
|
|
|
: Sql_alloc(), m_params(0), m_framesize(0), m_handlers(0), m_cursmax(0)
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
VOID(my_init_dynamic_array(&m_pvar, sizeof(sp_pvar_t *), 16, 8));
|
2003-09-16 14:26:08 +02:00
|
|
|
VOID(my_init_dynamic_array(&m_cond, sizeof(sp_cond_type_t *), 16, 8));
|
2003-10-10 16:57:21 +02:00
|
|
|
VOID(my_init_dynamic_array(&m_cursor, sizeof(LEX_STRING), 16, 8));
|
2002-12-11 14:24:29 +01:00
|
|
|
m_label.empty();
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2003-04-02 20:42:28 +02:00
|
|
|
sp_pcontext::destroy()
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
delete_dynamic(&m_pvar);
|
2003-09-16 14:26:08 +02:00
|
|
|
delete_dynamic(&m_cond);
|
2003-10-10 16:57:21 +02:00
|
|
|
delete_dynamic(&m_cursor);
|
2003-04-02 20:42:28 +02:00
|
|
|
m_label.empty();
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
}
|
|
|
|
|
2003-04-02 20:42:28 +02:00
|
|
|
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
/* This does a linear search (from newer to older variables, in case
|
|
|
|
** we have shadowed names).
|
|
|
|
** It's possible to have a more efficient allocation and search method,
|
|
|
|
** but it might not be worth it. The typical number of parameters and
|
|
|
|
** variables will in most cases be low (a handfull).
|
|
|
|
** And this is only called during parsing.
|
|
|
|
*/
|
|
|
|
sp_pvar_t *
|
|
|
|
sp_pcontext::find_pvar(LEX_STRING *name)
|
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
uint i = m_pvar.elements;
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
|
|
|
|
while (i-- > 0)
|
|
|
|
{
|
2003-09-16 14:26:08 +02:00
|
|
|
sp_pvar_t *p;
|
2003-03-20 11:57:05 +01:00
|
|
|
|
2003-09-16 14:26:08 +02:00
|
|
|
get_dynamic(&m_pvar, (gptr)&p, i);
|
2003-04-04 15:47:43 +02:00
|
|
|
if (my_strnncoll(system_charset_info,
|
|
|
|
(const uchar *)name->str, name->length,
|
|
|
|
(const uchar *)p->name.str, p->name.length) == 0)
|
2003-03-19 11:36:32 +01:00
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
return p;
|
2003-03-19 11:36:32 +01:00
|
|
|
}
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2003-09-16 14:26:08 +02:00
|
|
|
sp_pcontext::push_pvar(LEX_STRING *name, enum enum_field_types type,
|
|
|
|
sp_param_mode_t mode)
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
sp_pvar_t *p= (sp_pvar_t *)sql_alloc(sizeof(sp_pvar_t));
|
|
|
|
|
|
|
|
if (p)
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
if (m_pvar.elements == m_framesize)
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
m_framesize += 1;
|
2003-04-02 20:42:28 +02:00
|
|
|
p->name.str= name->str;
|
|
|
|
p->name.length= name->length;
|
|
|
|
p->type= type;
|
|
|
|
p->mode= mode;
|
|
|
|
p->offset= m_pvar.elements;
|
|
|
|
p->isset= (mode == sp_param_out ? FALSE : TRUE);
|
|
|
|
insert_dynamic(&m_pvar, (gptr)&p);
|
Simplistic, experimental framework for Stored Procedures (SPs).
Implements creation and dropping of PROCEDUREs, IN, OUT, and INOUT parameters,
single-statement procedures, rudimentary multi-statement (begin-end) prodedures
(when the client can handle it), and local variables.
Missing most of the embedded SQL language, all attributes, FUNCTIONs, error handling,
reparses procedures at each call (no caching), etc, etc.
Certainly buggy too, but procedures can actually be created and called....
2002-12-08 19:59:22 +01:00
|
|
|
}
|
|
|
|
}
|
2002-12-11 14:24:29 +01:00
|
|
|
|
2002-12-16 15:40:44 +01:00
|
|
|
sp_label_t *
|
2002-12-11 14:24:29 +01:00
|
|
|
sp_pcontext::push_label(char *name, uint ip)
|
|
|
|
{
|
2003-04-02 20:42:28 +02:00
|
|
|
sp_label_t *lab = (sp_label_t *)sql_alloc(sizeof(sp_label_t));
|
2002-12-11 14:24:29 +01:00
|
|
|
|
|
|
|
if (lab)
|
|
|
|
{
|
|
|
|
lab->name= name;
|
|
|
|
lab->ip= ip;
|
|
|
|
m_label.push_front(lab);
|
|
|
|
}
|
2002-12-16 15:40:44 +01:00
|
|
|
return lab;
|
2002-12-11 14:24:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
sp_label_t *
|
|
|
|
sp_pcontext::find_label(char *name)
|
|
|
|
{
|
|
|
|
List_iterator_fast<sp_label_t> li(m_label);
|
|
|
|
sp_label_t *lab;
|
|
|
|
|
|
|
|
while ((lab= li++))
|
2003-03-27 17:35:27 +01:00
|
|
|
if (my_strcasecmp(system_charset_info, name, lab->name) == 0)
|
2002-12-11 14:24:29 +01:00
|
|
|
return lab;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
2003-09-16 14:26:08 +02:00
|
|
|
|
|
|
|
void
|
|
|
|
sp_pcontext::push_cond(LEX_STRING *name, sp_cond_type_t *val)
|
|
|
|
{
|
|
|
|
sp_cond_t *p= (sp_cond_t *)sql_alloc(sizeof(sp_cond_t));
|
|
|
|
|
|
|
|
if (p)
|
|
|
|
{
|
|
|
|
p->name.str= name->str;
|
|
|
|
p->name.length= name->length;
|
|
|
|
p->val= val;
|
|
|
|
insert_dynamic(&m_cond, (gptr)&p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* See comment for find_pvar() above
|
|
|
|
*/
|
|
|
|
sp_cond_type_t *
|
|
|
|
sp_pcontext::find_cond(LEX_STRING *name)
|
|
|
|
{
|
|
|
|
uint i = m_cond.elements;
|
|
|
|
|
|
|
|
while (i-- > 0)
|
|
|
|
{
|
|
|
|
sp_cond_t *p;
|
|
|
|
|
|
|
|
get_dynamic(&m_cond, (gptr)&p, i);
|
|
|
|
if (my_strnncoll(system_charset_info,
|
|
|
|
(const uchar *)name->str, name->length,
|
|
|
|
(const uchar *)p->name.str, p->name.length) == 0)
|
|
|
|
{
|
|
|
|
return p->val;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
2003-10-10 16:57:21 +02:00
|
|
|
|
|
|
|
void
|
|
|
|
sp_pcontext::push_cursor(LEX_STRING *name)
|
|
|
|
{
|
|
|
|
LEX_STRING n;
|
|
|
|
|
|
|
|
n.str= name->str;
|
|
|
|
n.length= name->length;
|
|
|
|
insert_dynamic(&m_cursor, (gptr)&n);
|
|
|
|
if (m_cursor.elements > m_cursmax)
|
|
|
|
m_cursmax= m_cursor.elements;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* See comment for find_pvar() above
|
|
|
|
*/
|
|
|
|
my_bool
|
|
|
|
sp_pcontext::find_cursor(LEX_STRING *name, uint *poff)
|
|
|
|
{
|
|
|
|
uint i = m_cursor.elements;
|
|
|
|
|
|
|
|
while (i-- > 0)
|
|
|
|
{
|
|
|
|
LEX_STRING n;
|
|
|
|
|
|
|
|
get_dynamic(&m_cursor, (gptr)&n, i);
|
|
|
|
if (my_strnncoll(system_charset_info,
|
|
|
|
(const uchar *)name->str, name->length,
|
|
|
|
(const uchar *)n.str, n.length) == 0)
|
|
|
|
{
|
|
|
|
*poff= i;
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return FALSE;
|
|
|
|
}
|