summaryrefslogtreecommitdiffstats
path: root/sql/sql_list.cc
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-04 18:07:14 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-05-04 18:07:14 +0000
commita175314c3e5827eb193872241446f2f8f5c9d33c (patch)
treecd3d60ca99ae00829c52a6ca79150a5b6e62528b /sql/sql_list.cc
parentInitial commit. (diff)
downloadmariadb-10.5-a175314c3e5827eb193872241446f2f8f5c9d33c.tar.xz
mariadb-10.5-a175314c3e5827eb193872241446f2f8f5c9d33c.zip
Adding upstream version 1:10.5.12.upstream/1%10.5.12upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'sql/sql_list.cc')
-rw-r--r--sql/sql_list.cc75
1 files changed, 75 insertions, 0 deletions
diff --git a/sql/sql_list.cc b/sql/sql_list.cc
new file mode 100644
index 00000000..92664898
--- /dev/null
+++ b/sql/sql_list.cc
@@ -0,0 +1,75 @@
+/* Copyright (c) 2000, 2010, 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 St, Fifth Floor, Boston, MA 02110-1335 USA */
+
+
+#ifdef USE_PRAGMA_IMPLEMENTATION
+#pragma implementation // gcc: Class implementation
+#endif
+
+#include "mariadb.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;
+}
+
+
+bool base_list::copy(const base_list *rhs, MEM_ROOT *mem_root)
+{
+ bool error= 0;
+ if (rhs->elements)
+ {
+ /*
+ It's okay to allocate an array of nodes at once: we never
+ call a destructor for list_node objects anyway.
+ */
+ if ((first= (list_node*) alloc_root(mem_root,
+ sizeof(list_node) * rhs->elements)))
+ {
+ 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 0;
+ }
+ error= 1;
+ }
+ elements= 0;
+ first= &end_of_list;
+ last= &first;
+ return error;
+}