mirror of
https://github.com/MariaDB/server.git
synced 2025-01-16 20:12:31 +01:00
23d8586dbf
This patch: - Moves all definitions from the mysql_priv.h file into header files for the component where the variable is defined - Creates header files if the component lacks one - Eliminates all include directives from mysql_priv.h - Eliminates all circular include cycles - Rename time.cc to sql_time.cc - Rename mysql_priv.h to sql_priv.h
73 lines
1.9 KiB
C++
73 lines
1.9 KiB
C++
/* Copyright (C) 2000-2001, 2003, 2005 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 */
|
|
|
|
|
|
#ifdef USE_PRAGMA_IMPLEMENTATION
|
|
#pragma implementation // gcc: Class implementation
|
|
#endif
|
|
|
|
#include "unireg.h"
|
|
#include "sql_list.h"
|
|
|
|
list_node end_of_list;
|
|
|
|
void free_list(I_List <i_string_pair> *list)
|
|
{
|
|
i_string_pair *tmp;
|
|
while ((tmp= list->get()))
|
|
delete tmp;
|
|
}
|
|
|
|
|
|
void free_list(I_List <i_string> *list)
|
|
{
|
|
i_string *tmp;
|
|
while ((tmp= list->get()))
|
|
delete tmp;
|
|
}
|
|
|
|
|
|
base_list::base_list(const base_list &rhs, MEM_ROOT *mem_root)
|
|
{
|
|
if (rhs.elements)
|
|
{
|
|
/*
|
|
It's okay to allocate an array of nodes at once: we never
|
|
call a destructor for list_node objects anyway.
|
|
*/
|
|
first= (list_node*) alloc_root(mem_root,
|
|
sizeof(list_node) * rhs.elements);
|
|
if (first)
|
|
{
|
|
elements= rhs.elements;
|
|
list_node *dst= first;
|
|
list_node *src= rhs.first;
|
|
for (; dst < first + elements - 1; dst++, src= src->next)
|
|
{
|
|
dst->info= src->info;
|
|
dst->next= dst + 1;
|
|
}
|
|
/* Copy the last node */
|
|
dst->info= src->info;
|
|
dst->next= &end_of_list;
|
|
/* Setup 'last' member */
|
|
last= &dst->next;
|
|
return;
|
|
}
|
|
}
|
|
elements= 0;
|
|
first= &end_of_list;
|
|
last= &first;
|
|
}
|