sp_pcontext.cc 4.3 KB
Newer Older
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
/* 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"
27
#include "sp_head.h"
28 29

sp_pcontext::sp_pcontext()
30
  : Sql_alloc(), m_params(0), m_framesize(0), m_handlers(0), m_cursmax(0)
31
{
32
  VOID(my_init_dynamic_array(&m_pvar, sizeof(sp_pvar_t *), 16, 8));
33
  VOID(my_init_dynamic_array(&m_cond, sizeof(sp_cond_type_t *), 16, 8));
34
  VOID(my_init_dynamic_array(&m_cursor, sizeof(LEX_STRING), 16, 8));
35
  m_label.empty();
36 37 38
}

void
39
sp_pcontext::destroy()
40
{
41
  delete_dynamic(&m_pvar);
42
  delete_dynamic(&m_cond);
43
  delete_dynamic(&m_cursor);
44
  m_label.empty();
45 46
}

47

48 49 50 51 52 53 54 55 56 57
/* 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)
{
58
  uint i = m_pvar.elements;
59 60 61

  while (i-- > 0)
  {
62
    sp_pvar_t *p;
63

64
    get_dynamic(&m_pvar, (gptr)&p, i);
unknown's avatar
unknown committed
65 66 67
    if (my_strnncoll(system_charset_info,
		     (const uchar *)name->str, name->length,
		     (const uchar *)p->name.str, p->name.length) == 0)
unknown's avatar
unknown committed
68
    {
69
      return p;
unknown's avatar
unknown committed
70
    }
71 72 73 74 75
  }
  return NULL;
}

void
76 77
sp_pcontext::push_pvar(LEX_STRING *name, enum enum_field_types type,
		       sp_param_mode_t mode)
78
{
79 80 81
  sp_pvar_t *p= (sp_pvar_t *)sql_alloc(sizeof(sp_pvar_t));

  if (p)
82
  {
83
    if (m_pvar.elements == m_framesize)
84
      m_framesize += 1;
85 86 87 88 89 90 91
    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);
92 93
  }
}
94

95
sp_label_t *
96 97
sp_pcontext::push_label(char *name, uint ip)
{
98
  sp_label_t *lab = (sp_label_t *)sql_alloc(sizeof(sp_label_t));
99 100 101 102 103 104 105

  if (lab)
  {
    lab->name= name;
    lab->ip= ip;
    m_label.push_front(lab);
  }
106
  return lab;
107 108 109 110 111 112 113 114 115
}

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++))
unknown's avatar
unknown committed
116
    if (my_strcasecmp(system_charset_info, name, lab->name) == 0)
117 118 119 120
      return lab;

  return NULL;
}
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

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;
}
158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193

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;
}