From: Tor Didriksen Date: May 13 2011 1:44pm Subject: bzr commit into mysql-trunk branch (tor.didriksen:3083) Bug#12552221 List-Archive: http://lists.mysql.com/commits/137331 X-Bug: 12552221 Message-Id: <20110513134420.3259A3793@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============8088050332202239008==" --===============8088050332202239008== MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline #At file:///export/home/didrik/repo/trunk-dynarray/ based on revid:bjorn.munch@stripped 3083 Tor Didriksen 2011-05-13 Bug#12552221 - MEMORY LEAK IN UPDATE_REF_AND_KEYS Allocate array in memroot rather than heap. Fixes the leak, and also yields a 1-2% performance gain with sysbench if you have lots of cpus/threads. @ sql/mem_root_array.h A typesafe replacement for DYNAMIC_ARRAY. We use MEM_ROOT for allocating storage, rather than the C++ heap. The interface is chosen to be similar to std::vector. @ sql/sql_select.cc Use Key_use_array rather than DYNAMIC_ARRAY. @ sql/sql_select.h Use Key_use_array rather than DYNAMIC_ARRAY. @ sql/sql_test.cc Use Key_use_array rather than DYNAMIC_ARRAY. @ unittest/gunit/dynarray-t.cc Unit tests for Mem_root_array. Also performance testing comparing DYNAMIC_ARRAY with std::vector and Mem_root_array. added: sql/mem_root_array.h unittest/gunit/dynarray-t.cc modified: sql/sql_select.cc sql/sql_select.h sql/sql_test.cc sql/sql_test.h unittest/gunit/CMakeLists.txt === added file 'sql/mem_root_array.h' --- a/sql/mem_root_array.h 1970-01-01 00:00:00 +0000 +++ b/sql/mem_root_array.h 2011-05-13 13:44:14 +0000 @@ -0,0 +1,168 @@ +/* Copyright (c) 2011, 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + + +#ifndef MEM_ROOT_ARRAY_INCLUDED +#define MEM_ROOT_ARRAY_INCLUDED + +#include + +/** + A typesafe replacement for DYNAMIC_ARRAY. + We use MEM_ROOT for allocating storage, rather than the C++ heap. + The interface is chosen to be similar to std::vector. + + Note that MEM_ROOT has no facility for reusing free space, + so don't use this if multiple re-expansions are likely to happen. + + @param Element_type The type of the elements of the container. + Elements must be copyable. + @param has_trivial_destructor If true, we don't destroy elements. + We could have used type traits to determine this. + __has_trivial_destructor is supported by some (but not all) + compilers we use. +*/ +template +class Mem_root_array +{ +public: + Mem_root_array(MEM_ROOT *root) + : m_root(root), m_array(NULL), m_size(0), m_capacity(0) + { + DBUG_ASSERT(m_root != NULL); + } + + ~Mem_root_array() + { + clear(); + } + + Element_type &at(size_t n) + { + DBUG_ASSERT(n < size()); + return m_array[n]; + } + + const Element_type &at(size_t n) const + { + DBUG_ASSERT(n < size()); + return m_array[n]; + } + + // Returns a pointer to the first element in the array. + Element_type *begin() { return &m_array[0]; } + + // Returns an pointer to the past-the-end element in the array. + Element_type *end() { return &m_array[size()]; } + + // Erases all of the elements. + void clear() + { + if (!empty()) + chop(0); + } + + /* + Chops the tail off the array, erasing all tail elements. + @param pos Index of first element to erase. + */ + void chop(const size_t pos) + { + DBUG_ASSERT(pos < m_size); + if (pos >= m_size) + return; + if (!has_trivial_destructor) + { + for (size_t ix= pos; ix < m_size; ++ix) + { + Element_type *p= &m_array[ix]; + p->~Element_type(); // Destroy discarded element. + } + } + m_size= pos; + } + + /* + Reserves space for array elements. + Copies over existing elements, in case we are re-expanding the array. + + @param n number of elements. + @retval true if out-of-memory, false otherwise. + */ + bool reserve(size_t n) + { + if (n <= m_capacity) + return false; + + void *mem= alloc_root(m_root, n * element_size()); + if (!mem) + return true; + Element_type *array= static_cast(mem); + + // Copy all the existing elements into the new array. + for (size_t ix= 0; ix < m_size; ++ix) + { + Element_type *new_p= &array[ix]; + Element_type *old_p= &m_array[ix]; + new (new_p) Element_type(*old_p); // Copy into new location. + if (!has_trivial_destructor) + old_p->~Element_type(); // Destroy the old element. + } + + // Forget the old array. + m_array= array; + m_capacity= n; + return false; + } + + /* + Adds a new element at the end of the array, after its current last + element. The content of this new element is initialized to a copy of + the input argument. + + @param element Object to copy. + @retval true if out-of-memory, false otherwise. + */ + bool push_back(const Element_type &element) + { + const size_t min_capacity= 10; + const size_t expansion_factor= 2; + if (0 == m_capacity && reserve(min_capacity)) + return true; + if (m_size == m_capacity && reserve(m_capacity * expansion_factor)) + return true; + Element_type *p= &m_array[m_size++]; + new (p) Element_type(element); + return false; + } + + size_t capacity() const { return m_capacity; } + size_t element_size() const { return sizeof(Element_type); } + bool empty() const { return size() == 0; } + size_t size() const { return m_size; } + +private: + MEM_ROOT *const m_root; + Element_type *m_array; + size_t m_size; + size_t m_capacity; + + // Not (yet) implemented. + Mem_root_array(const Mem_root_array&); + Mem_root_array &operator=(const Mem_root_array&); +}; + + +#endif // MEM_ROOT_ARRAY_INCLUDED === modified file 'sql/sql_select.cc' --- a/sql/sql_select.cc 2011-05-06 12:56:36 +0000 +++ b/sql/sql_select.cc 2011-05-13 13:44:14 +0000 @@ -38,8 +38,7 @@ #include "sql_parse.h" // check_stack_overrun #include "sql_partition.h" // make_used_partitions_str #include "sql_acl.h" // *_ACL -#include "sql_test.h" // print_where, print_keyuse_array, - // print_sjm, print_plan, TEST_join +#include "sql_test.h" // misc. debug printing utilities #include "records.h" // init_read_record, end_read_record #include "filesort.h" // filesort_free_buffers #include "sql_union.h" // mysql_union @@ -59,11 +58,11 @@ const char *join_type_str[]={ "UNKNOWN", struct st_sargable_param; -static void optimize_keyuse(JOIN *join, DYNAMIC_ARRAY *keyuse_array); +static void optimize_keyuse(JOIN *join, Key_use_array *keyuse_array); static bool make_join_statistics(JOIN *join, TABLE_LIST *leaves, Item *conds, - DYNAMIC_ARRAY *keyuse); + Key_use_array *keyuse); static bool optimize_semijoin_nests(JOIN *join); -static bool update_ref_and_keys(THD *thd, DYNAMIC_ARRAY *keyuse, +static bool update_ref_and_keys(THD *thd, Key_use_array *keyuse, JOIN_TAB *join_tab, uint tables, Item *conds, COND_EQUAL *cond_equal, @@ -3546,7 +3545,7 @@ bool JOIN::destroy() while ((sj_nest= sj_list_it++)) sj_nest->sj_mat_exec= NULL; - delete_dynamic(&keyuse); + keyuse.clear(); delete procedure; DBUG_RETURN(test(error)); } @@ -4709,7 +4708,7 @@ static uint get_tmp_table_rec_length(Lis static bool make_join_statistics(JOIN *join, TABLE_LIST *tables_arg, Item *conds, - DYNAMIC_ARRAY *keyuse_array) + Key_use_array *keyuse_array) { int error; TABLE *table; @@ -6091,7 +6090,7 @@ max_part_bit(key_part_map bits) */ static bool -add_key_part(DYNAMIC_ARRAY *keyuse_array,KEY_FIELD *key_field) +add_key_part(Key_use_array *keyuse_array, KEY_FIELD *key_field) { Field *field=key_field->field; TABLE *form= field->table; @@ -6121,7 +6120,7 @@ add_key_part(DYNAMIC_ARRAY *keyuse_array key_field->null_rejecting, key_field->cond_guard, key_field->sj_pred_no); - if (insert_dynamic(keyuse_array, &keyuse)) + if (keyuse_array->push_back(keyuse)) return TRUE; } } @@ -6134,7 +6133,7 @@ add_key_part(DYNAMIC_ARRAY *keyuse_array #define FT_KEYPART (MAX_REF_PARTS+10) static bool -add_ft_keys(DYNAMIC_ARRAY *keyuse_array, +add_ft_keys(Key_use_array *keyuse_array, JOIN_TAB *stat,Item *cond,table_map usable_tables) { Item_func_match *cond_func=NULL; @@ -6196,7 +6195,7 @@ add_ft_keys(DYNAMIC_ARRAY *keyuse_array, false, // null_rejecting NULL, // cond_guard UINT_MAX); // sj_pred_no - return insert_dynamic(keyuse_array, &keyuse); + return keyuse_array->push_back(keyuse); } @@ -6312,7 +6311,7 @@ static void add_key_fields_for_nj(JOIN * */ static bool -update_ref_and_keys(THD *thd, DYNAMIC_ARRAY *keyuse,JOIN_TAB *join_tab, +update_ref_and_keys(THD *thd, Key_use_array *keyuse,JOIN_TAB *join_tab, uint tables, Item *cond, COND_EQUAL *cond_equal, table_map normal_tables, SELECT_LEX *select_lex, SARGABLE_PARAM **sargables) @@ -6355,8 +6354,6 @@ update_ref_and_keys(THD *thd, DYNAMIC_AR /* set a barrier for the array of SARGABLE_PARAM */ (*sargables)[0].field= 0; - if (my_init_dynamic_array(keyuse, sizeof(Key_use), 20, 64)) - return TRUE; if (cond) { add_key_fields(join_tab->join, &end, &and_level, cond, normal_tables, @@ -6430,21 +6427,21 @@ update_ref_and_keys(THD *thd, DYNAMIC_AR used in the query, we drop the partial key parts from consideration). Special treatment for ft-keys. */ - if (keyuse->elements) + if (!keyuse->empty()) { Key_use *save_pos, *use; - my_qsort(keyuse->buffer, keyuse->elements, sizeof(Key_use), + my_qsort(keyuse->begin(), keyuse->size(), keyuse->element_size(), reinterpret_cast(sort_keyuse)); const Key_use key_end(NULL, NULL, 0, 0, 0, 0, 0, 0, false, NULL, 0); - if (insert_dynamic(keyuse, &key_end)) // added for easy testing + if (keyuse->push_back(key_end)) // added for easy testing return TRUE; - use= save_pos= dynamic_element(keyuse, 0, Key_use *); + use= save_pos= keyuse->begin(); const Key_use *prev= &key_end; found_eq_constant=0; - for (i=0 ; i < keyuse->elements-1 ; i++,use++) + for (i=0 ; i < keyuse->size()-1 ; i++,use++) { if (!use->used_tables && use->optimize != KEY_OPTIMIZE_REF_OR_NULL) use->table->const_key_parts[use->key]|= use->keypart_map; @@ -6477,9 +6474,9 @@ update_ref_and_keys(THD *thd, DYNAMIC_AR use->table->reginfo.join_tab->checked_keys.set_bit(use->key); save_pos++; } - i= (uint) (save_pos - (Key_use *)keyuse->buffer); - (void) set_dynamic(keyuse, &key_end, i); - keyuse->elements=i; + i= (uint) (save_pos - keyuse->begin()); + keyuse->at(i) = key_end; + keyuse->chop(i); } DBUG_EXECUTE("opt", print_keyuse_array(keyuse);); return FALSE; @@ -6489,12 +6486,11 @@ update_ref_and_keys(THD *thd, DYNAMIC_AR Update some values in keyuse for faster choose_table_order() loop. */ -static void optimize_keyuse(JOIN *join, DYNAMIC_ARRAY *keyuse_array) +static void optimize_keyuse(JOIN *join, Key_use_array *keyuse_array) { - Key_use *end, *keyuse= dynamic_element(keyuse_array, 0, Key_use *); - - for (end= keyuse+ keyuse_array->elements ; keyuse < end ; keyuse++) + for (size_t ix= 0; ix < keyuse_array->size(); ++ix) { + Key_use *keyuse= &keyuse_array->at(ix); table_map map; /* If we find a ref, assume this table matches a proportional === modified file 'sql/sql_select.h' --- a/sql/sql_select.h 2011-05-02 11:51:41 +0000 +++ b/sql/sql_select.h 2011-05-13 13:44:14 +0000 @@ -30,6 +30,7 @@ #include "records.h" /* READ_RECORD */ #include "opt_range.h" /* SQL_SELECT, QUICK_SELECT_I */ +#include "mem_root_array.h" /* Values in optimize */ #define KEY_OPTIMIZE_EXISTS 1 @@ -37,12 +38,12 @@ /** Information about usage of an index to satisfy an equality condition. - - @note such objects are stored in DYNAMIC_ARRAY which uses sizeof(), so keep - this class as POD as possible. */ class Key_use { public: + // We need the default constructor for unit testing. + Key_use() { memset(this, 0, sizeof(*this)); } + Key_use(TABLE *table_arg, Item *val_arg, table_map used_tables_arg, uint key_arg, uint keypart_arg, uint optimize_arg, key_part_map keypart_map_arg, ha_rows ref_table_rows_arg, @@ -93,6 +94,10 @@ public: uint sj_pred_no; }; + +// Key_use has a trivial destructor, no need to run it from Mem_root_array. +typedef Mem_root_array Key_use_array; + class store_key; typedef struct st_table_ref : public Sql_alloc @@ -1816,7 +1821,9 @@ public: bool skip_sort_order; bool need_tmp, hidden_group_fields; - DYNAMIC_ARRAY keyuse; + + Key_use_array keyuse; + List all_fields; ///< to store all fields that used in query ///Above list changed to use temporary table List tmp_all_fields1, tmp_all_fields2, tmp_all_fields3; @@ -1892,7 +1899,9 @@ public: JOIN(THD *thd_arg, List &fields_arg, ulonglong select_options_arg, select_result *result_arg) - :fields_list(fields_arg), sj_subselects(thd_arg->mem_root, 4) + : keyuse(thd_arg->mem_root), + fields_list(fields_arg), + sj_subselects(thd_arg->mem_root, 4) { init(thd_arg, fields_arg, select_options_arg, result_arg); } @@ -1946,7 +1955,7 @@ public: all_fields= fields_arg; if (&fields_list != &fields_arg) /* Avoid valgrind-warning */ fields_list= fields_arg; - bzero((char*) &keyuse,sizeof(keyuse)); + keyuse.clear(); tmp_table_param.init(); tmp_table_param.end_write_records= HA_POS_ERROR; rollup.state= ROLLUP::STATE_NONE; === modified file 'sql/sql_test.cc' --- a/sql/sql_test.cc 2010-11-05 22:19:41 +0000 +++ b/sql/sql_test.cc 2011-05-13 13:44:14 +0000 @@ -239,7 +239,7 @@ TEST_join(JOIN *join) #define FT_KEYPART (MAX_REF_PARTS+10) -void print_keyuse(Key_use *keyuse) +void print_keyuse(const Key_use *keyuse) { char buff[256]; char buf2[64]; @@ -266,14 +266,14 @@ void print_keyuse(Key_use *keyuse) /* purecov: begin inspected */ -void print_keyuse_array(DYNAMIC_ARRAY *keyuse_array) +void print_keyuse_array(const Key_use_array *keyuse_array) { DBUG_LOCK_FILE; - fprintf(DBUG_FILE, "Key_use array (%d elements)\n", keyuse_array->elements); + fprintf(DBUG_FILE, "Key_use array (%d elements)\n", + (int) keyuse_array->size()); DBUG_UNLOCK_FILE; - for(uint i=0; i < keyuse_array->elements; i++) - print_keyuse(reinterpret_cast - (dynamic_array_ptr(keyuse_array, i))); + for(uint i=0; i < keyuse_array->size(); i++) + print_keyuse(&keyuse_array->at(i)); } === modified file 'sql/sql_test.h' --- a/sql/sql_test.h 2010-08-19 07:10:58 +0000 +++ b/sql/sql_test.h 2011-05-13 13:44:14 +0000 @@ -17,6 +17,7 @@ #define SQL_TEST_INCLUDED #include "mysqld.h" +#include "sql_select.h" class JOIN; struct TABLE_LIST; @@ -31,7 +32,7 @@ void print_plan(JOIN* join,uint idx, dou double current_read_time, const char *info); void dump_TABLE_LIST_graph(SELECT_LEX *select_lex, TABLE_LIST* tl); void print_sjm(TABLE_LIST *emb_sj_nest); -void print_keyuse_array(DYNAMIC_ARRAY *keyuse_array); +void print_keyuse_array(const Key_use_array *keyuse_array); #endif void mysql_print_status(); === modified file 'unittest/gunit/CMakeLists.txt' --- a/unittest/gunit/CMakeLists.txt 2011-05-13 09:36:13 +0000 +++ b/unittest/gunit/CMakeLists.txt 2011-05-13 13:44:14 +0000 @@ -206,6 +206,7 @@ ENDIF() SET(TESTS bounded_queue dbug + dynarray mdl mdl_mytap my_bitmap === added file 'unittest/gunit/dynarray-t.cc' --- a/unittest/gunit/dynarray-t.cc 1970-01-01 00:00:00 +0000 +++ b/unittest/gunit/dynarray-t.cc 2011-05-13 13:44:14 +0000 @@ -0,0 +1,408 @@ +/* Copyright (c) 2011, 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + +// First include (the generated) my_config.h, to get correct platform defines, +// then gtest.h (before any other MySQL headers), to avoid min() macros etc ... +#include "my_config.h" +#include + +#include +#include +#include + +#include "sql_select.h" +#include "mem_root_array.h" + +/** + WL#5774 Decrease number of malloc's for normal DML queries. + One of the malloc's was due to DYNAMIC_ARRAY keyuse; + We replace the DYNAMIC_ARRAY with a std::vector-like class Mem_root_array. + + Below are unit tests for comparing performance, and for testing + functionality of Mem_root_array. +*/ + +pthread_key(MEM_ROOT**, THR_MALLOC); +pthread_key(THD*, THR_THD); + +extern "C" void sql_alloc_error_handler(void) +{ + ADD_FAILURE(); +} + + +/* + Rewrite of sort_keyuse() to comparison operator for use by std::less<> + It is a template argument, so static rather than in unnamed namespace. +*/ +static inline bool operator<(const Key_use &a, const Key_use &b) +{ + if (a.table->tablenr != b.table->tablenr) + return a.table->tablenr < b.table->tablenr; + if (a.key != b.key) + return a.key < b.key; + if (a.keypart != b.keypart) + return a.keypart < b.keypart; + const bool atab = test((a.used_tables & ~OUTER_REF_TABLE_BIT)); + const bool btab = test((b.used_tables & ~OUTER_REF_TABLE_BIT)); + if (atab != btab) + return atab < btab; + return + ((a.optimize & KEY_OPTIMIZE_REF_OR_NULL) < + (b.optimize & KEY_OPTIMIZE_REF_OR_NULL)); +} + + +/* + Compare for equality. + It is a template argument, so static rather than in unnamed namespace. +*/ +static inline bool operator==(const Key_use &lhs, const Key_use &rhs) +{ + return + lhs.table->tablenr == rhs.table->tablenr && + lhs.key == rhs.key && + lhs.keypart == rhs.keypart && + test((lhs.used_tables & ~OUTER_REF_TABLE_BIT)) + == + test((rhs.used_tables & ~OUTER_REF_TABLE_BIT)) && + (lhs.optimize & KEY_OPTIMIZE_REF_OR_NULL) + == + (rhs.optimize & KEY_OPTIMIZE_REF_OR_NULL); +} + + +namespace { + +/* + Cut'n paste this function from sql_select.cc, + to avoid linking in the entire server for this unit test. +*/ +inline int sort_keyuse(Key_use *a, Key_use *b) +{ + int res; + if (a->table->tablenr != b->table->tablenr) + return (int) (a->table->tablenr - b->table->tablenr); + if (a->key != b->key) + return (int) (a->key - b->key); + if (a->keypart != b->keypart) + return (int) (a->keypart - b->keypart); + // Place const values before other ones + if ((res= test((a->used_tables & ~OUTER_REF_TABLE_BIT)) - + test((b->used_tables & ~OUTER_REF_TABLE_BIT)))) + return res; + /* Place rows that are not 'OPTIMIZE_REF_OR_NULL' first */ + return (int) ((a->optimize & KEY_OPTIMIZE_REF_OR_NULL) - + (b->optimize & KEY_OPTIMIZE_REF_OR_NULL)); +} + + +std::ostream &operator<<(std::ostream &s, const Key_use &v) +{ + return s << "{" + << v.table->tablenr << ", " + << v.key << ", " + << v.keypart << ", " + << v.used_tables << ", " + << v.optimize + << "}" + ; +} + + +// We generate some random data at startup, for testing of sorting. +void generate_test_data(Key_use *keys, TABLE *tables, int n) +{ + int ix; + for (ix= 0; ix < n; ++ix) + { + tables[ix].tablenr= ix % 3; + keys[ix]= + Key_use(&tables[ix], + NULL, // Item *val + 0, // table_map used_tables + ix % 4, // uint key + ix % 2, // uint keypart + 0, // uint optimize + 0, // keypart_map + 0, // ha_rows ref_table_rows + true, // bool null_rejecting + NULL, // bool *cond_guard + 0 // uint sj_pred_no + ); + } + std::random_shuffle(&keys[0], &keys[n]); +} + + +// Play around with these constants to see std::sort speedup vs. my_qsort. +const int num_elements= 200; +const int num_iterations= 10; + +/* + This class is used for comparing performance of + std::vector<> and std::sort() + vs + DYNAMIC_ARRAY and my_qsort() + */ +class DynArrayTest : public ::testing::Test +{ +public: + DynArrayTest() {} + + static void SetUpTestCase() + { + generate_test_data(test_data, table_list, num_elements); + } + + virtual void SetUp() + { + my_init_dynamic_array(&m_keyuse_dyn, sizeof(Key_use), num_elements, 64); + m_keyuse_vec.reserve(num_elements); + } + + void insert_and_sort_dynamic() + { + reset_dynamic(&m_keyuse_dyn); + for (int ix= 0; ix < num_elements; ++ix) + { + insert_dynamic(&m_keyuse_dyn, &test_data[ix]); + } + my_qsort(m_keyuse_dyn.buffer, m_keyuse_dyn.elements, sizeof(Key_use), + reinterpret_cast(sort_keyuse)); + } + + void insert_and_sort_vector() + { + m_keyuse_vec.clear(); + for (int ix= 0; ix < num_elements; ++ix) + { + m_keyuse_vec.push_back(test_data[ix]); + } + std::sort(m_keyuse_vec.begin(), m_keyuse_vec.end(), std::less()); + } + + DYNAMIC_ARRAY m_keyuse_dyn; + std::vector m_keyuse_vec; +private: + static Key_use test_data[num_elements]; + static TABLE table_list[num_elements]; + + GTEST_DISALLOW_COPY_AND_ASSIGN_(DynArrayTest); +}; + +Key_use DynArrayTest::test_data[num_elements]; +TABLE DynArrayTest::table_list[num_elements]; + + +// Test insert_dynamic() and my_qsort(). +TEST_F(DynArrayTest, DynArray) +{ + for (int ix= 0; ix < num_iterations; ++ix) + insert_and_sort_dynamic(); +} + + +// Test vector::push_back() and std::sort() +TEST_F(DynArrayTest, Vector) +{ + for (int ix= 0; ix < num_iterations; ++ix) + insert_and_sort_vector(); +} + + +/* + This class is for unit testing of Mem_root_array. + */ +class MemRootTest : public ::testing::Test +{ +protected: + MemRootTest() + : m_mem_root_p(&m_mem_root), + m_array_mysys(m_mem_root_p), + m_array_std(m_mem_root_p) + {} + + virtual void SetUp() + { + init_sql_alloc(&m_mem_root, 1024, 0); + ASSERT_EQ(0, my_pthread_setspecific_ptr(THR_MALLOC, &m_mem_root_p)); + MEM_ROOT *root= *my_pthread_getspecific_ptr(MEM_ROOT**, THR_MALLOC); + ASSERT_EQ(root, m_mem_root_p); + + m_array_mysys.reserve(num_elements); + m_array_std.reserve(num_elements); + } + + virtual void TearDown() + { + free_root(&m_mem_root, MYF(0)); + } + + static void SetUpTestCase() + { + generate_test_data(test_data, table_list, num_elements); + ASSERT_EQ(0, pthread_key_create(&THR_THD, NULL)); + ASSERT_EQ(0, pthread_key_create(&THR_MALLOC, NULL)); + } + + static void TearDownTestCase() + { + pthread_key_delete(THR_THD); + pthread_key_delete(THR_MALLOC); + } + + void insert_and_sort_mysys() + { + m_array_mysys.clear(); + for (int ix= 0; ix < num_elements; ++ix) + { + m_array_mysys.push_back(test_data[ix]); + } + my_qsort(m_array_mysys.begin(), m_array_mysys.size(), + m_array_mysys.element_size(), + reinterpret_cast(sort_keyuse)); + } + + void insert_and_sort_std() + { + m_array_std.clear(); + for (int ix= 0; ix < num_elements; ++ix) + { + m_array_std.push_back(test_data[ix]); + } + std::sort(m_array_std.begin(), m_array_std.end(), std::less()); + } + + MEM_ROOT m_mem_root; + MEM_ROOT *m_mem_root_p; + Key_use_array m_array_mysys; + Key_use_array m_array_std; +private: + static Key_use test_data[num_elements]; + static TABLE table_list[num_elements]; + + GTEST_DISALLOW_COPY_AND_ASSIGN_(MemRootTest); +}; + +Key_use MemRootTest::test_data[num_elements]; +TABLE MemRootTest::table_list[num_elements]; + + +// Test Mem_root_array::push_back() and my_qsort() +TEST_F(MemRootTest, KeyUseMysys) +{ + for (int ix= 0; ix < num_iterations; ++ix) + insert_and_sort_mysys(); +} + + +// Test Mem_root_array::push_back() and std::sort() +TEST_F(MemRootTest, KeyUseStd) +{ + for (int ix= 0; ix < num_iterations; ++ix) + insert_and_sort_std(); +} + + +// Test that my_qsort() and std::sort() generate same order. +TEST_F(MemRootTest, KeyUseCompare) +{ + insert_and_sort_mysys(); + insert_and_sort_std(); + for (int ix= 0; ix < num_elements; ++ix) + { + Key_use k1= m_array_mysys.at(ix); + Key_use k2= m_array_std.at(ix); + EXPECT_EQ(k1, k2); + } +} + + +// Test that Mem_root_array re-expanding works. +TEST_F(MemRootTest, Reserve) +{ + Mem_root_array intarr(m_mem_root_p); + intarr.reserve(2); + const uint num_pushes= 20; + for (uint ix=0; ix < num_pushes; ++ix) + { + EXPECT_EQ(ix, intarr.size()); + EXPECT_FALSE(intarr.push_back(ix)); + EXPECT_EQ(ix, intarr.at(ix)); + } + for (uint ix=0; ix < num_pushes; ++ix) + { + EXPECT_EQ(ix, intarr.at(ix)); + } + EXPECT_EQ(sizeof(uint), intarr.element_size()); + EXPECT_EQ(num_pushes, intarr.size()); + EXPECT_LE(num_pushes, intarr.capacity()); +} + + +class DestroyCounter +{ +public: + DestroyCounter(const DestroyCounter &rhs) : p_counter(rhs.p_counter) {} + DestroyCounter(size_t *p) : p_counter(p) {} + ~DestroyCounter() { (*p_counter)+= 1; } +private: + size_t *p_counter; +}; + + +// Test chop() and clear() and that destructors are executed. +TEST_F(MemRootTest, ChopAndClear) +{ + Mem_root_array array(m_mem_root_p); + const size_t nn= 4; + array.reserve(nn); + size_t counter= 0; + DestroyCounter foo(&counter); + for (size_t ix= 0; ix < array.capacity(); ++ix) + array.push_back(foo); + + EXPECT_EQ(0U, counter); + array.chop(nn / 2); + EXPECT_EQ(nn / 2, counter); + EXPECT_EQ(nn / 2, array.size()); + + array.clear(); + EXPECT_EQ(nn, counter); +} + + +// Test that elements are destroyed if push_back() needs to call reserve(). +TEST_F(MemRootTest, ReserveDestroy) +{ + Mem_root_array array(m_mem_root_p); + const size_t nn= 4; + array.reserve(nn / 2); + size_t counter= 0; + DestroyCounter foo(&counter); + for (size_t ix= 0; ix < nn; ++ix) + array.push_back(foo); + + EXPECT_EQ(nn / 2, counter); + EXPECT_EQ(nn, array.size()); + + counter= 0; + array.clear(); + EXPECT_EQ(nn, counter); +} + + +} --===============8088050332202239008== MIME-Version: 1.0 Content-Type: text/bzr-bundle; charset="us-ascii"; name="bzr/tor.didriksen@stripped" Content-Transfer-Encoding: 7bit Content-Disposition: inline # Bazaar merge directive format 2 (Bazaar 0.90) # revision_id: tor.didriksen@stripped\ # 966y99y1jx0as1rw # target_branch: file:///export/home/didrik/repo/trunk-dynarray/ # testament_sha1: 3fef7a4c36e00cf4d3c0504584d03f654c653fe9 # timestamp: 2011-05-13 15:44:20 +0200 # base_revision_id: bjorn.munch@stripped\ # 6z0pqy6wm04e73jb # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWYshfjwAEWx/gH/yIpx7//// f////r////tgI3ztOlTzxb32ffd3WqGhoO9PLnR11vMZ33m+983jDdgMR25u9t745tQMe7sSnWS7 cdfXkz5b333Oufd3XlnYdN11955Ns9295FjY3nDCXpvQXG13p3Z1rXXvO64SSCCaaNMTETIjUep+ mp6U2pk2Kemk0009RoAAAAGg9QJQQBNBASeUxAQnpqPRA00PUAA0AADQGQaBKaaIRCj0KaR7VPU0 PaU9RkPFHoaT1AeoyAAAaDRoHqaAk1JNJpMQJmgnqGqem1TNpT1HlPRpNk0aaTZT0mnqej1R6Q9Q aAGgRREaE0mETaYqegZU8T1NqmnpGTaIaBoyGmJ6hpp6gA9I0CRIQBMgE0nppMIBtU09VPU/1T0T R+qjR6j9Uab1QZAGgNADl6kOyMIB0sISbe3U5u77n3hSjBVBe0UJLpYLMVPdqlQmR3zw196Xw5tr uXIefLPkdzR0Hj4xt1ctfEyRo/zdR4qEpn320hPUWfD/3tfET2vf9mcKK7ui2nPg4l/jv+KBizmD DylTBzjtYaWgzBmc4jKNr02wzUbpxSlLATD4nLOOCwJducyPSomIkOyj4L35vW2xG+tw+zvO2Pk1 lSki6garst3dw7efghFO7+kPj+LlLy+boXOGfRrhyGgKENnciWLWGUuLjCEjr6th0ej46bPnoKQ9 CPDJLMKZlPUairUZ9YbgXOcAiVa74+lwWkkJqcuWb6koOMOjto6TwweA4KghIRCcHz9lzpiCuq7Q Zt7gcHfENBHKYKjMdGUpxXo0/t+jl4axmTgcx4QooWIgh7CoGFAN5nKkAS+DNq2LdiLmryWDssPR SMKrIkRbW0nlWFJwas6Zx1IJwzObsyWxQUum2usQ7Ref6o46EzgDKAxVQcYiFFGkAisIcIUQ54Qm FAy73qoKaCkEwxWDPVEsJPbp6qbuAZkgvVga65kPSkUA0oUMN1h2WHoLSlAUkQZBFSI9QqhDsDJQ CIG/VQikiNMJTAQe0wF2643TM9usOwO2dg0PrZHeO/DIr5YDCZxlimkYyeD5b0JVbvUZVVVD4pSK iFg72kHui0dCalM01F5nINaTB9zfUfDueTpmSlk5ccTEw0DXMdpAZmu+vT0f760ZJFnclNHahobG 2wbTYhdJVUbCB8aIhg+Z6R0TO0fj9u8GX1WFKzh6rNBbqRWivKkwlSOD0HwKjz3FibsnqIsMvuZx yDEYqMsvCNpa96XLbHN3tay4w54HC1omnbf0Fuh6lozynC6M1ZMlz1ZKcaMbWVyV3DqHCWxw97lx 5ejfu9WpJxlJRvBu2scX1VdJ+sZ6TmRvLBxxPsI+L8qvLDNs41M+FQllByqgkRT1biFKH0xiRAQU PhE/fK5eJl+chRxgSfeLopJTG8ebzYIZZ58DMzOvKzHBiLNJFGierG6RIisKHtWhJYHzjtI9cDdR JDE0wFAmZjCR3lQHVXWxftMr2GglWMNfK8g8muSSYqvf57ceRkXm9O9c2OqhsWFmjN9BRsmqsxUj aD5YIwMZn136ejYVcm23c23VMoZ7DChhgSOFd10zNJX/6WzWOCSjHLeU420RUKOtVNySZ1kgxLuv 39ZtJtzMV7Jju1cLznqzML2rtWDXzyI1Utlpi5Ejk8pG5FJIn51vQsiFC3sEtHVkbD2pBSn/JNA1 th4W4rddJdGfPhv50T+X67LQ94NM0DRyBTx6uPx31N8DIe/rGrOKSudpJr5dA0M31gZ0jQ/jOjho stO/VAHQCVlh9fxtA8dceTLfEvc28TWmXazMzDK7HTNlq0bJK/dZ/XivdvCfCuUya+R98Azz99Em aeKzebKE6j3znDMgkkHUFUXaJwTwrWvuLGMSJ9E0aPlWzMUs5I6EaqmZXsK70SNvpZ7lz3x7n5Gq SwJxMxjTd5ctSv7C0nNrQNOlfgO46TqGMbN24DUqi7bfE5N5xTKPUuiOgukFGUiaLukujvx5NQMh UxWw9KB5uyhHsMo0IHfutUUyTDGODOypwERgHfLRnFU3C6mDcBtEaak3zmwVi8cmhc02wUYg5fG2 RXuwywxOFSoou7QxdKkaek0DJL3JULMPFormptxQieYilDoKrCKcW+toXvq1jvNJZmBZnNzfbIkN YaAaS9RVJFVFZsIgfshyTy2nXZ68XrdXUd+ENjdPlPDrrYoUnUDNHlSmpizro/XqzBxoU9UsiIsB EUgmzueYktN/j5AsRED6vTR+IuVBFVkSJFMnXrNssTsHMJgZc9ZsMT7yCVGNWexr53hbrfQaGV7l ovFztTpPV6KgpB5hyDCybWClBW8+6pe+I0o4/IT/fXa/qE49NyrTwUaNzPqcsiVccrugOFFFX019 LYL8Hg7GWdG2fOQo9BE/LxaMUN6Oro7nZhyqnLbBp6418FIDmj4RVRUzaFJNliDWlGCoPRYWNuZq ktKUqyc2b3fvy1lkDyP8eajgkgKSSNDnO2xcwSR6nFEI9NG7hrkUMbBBUR+re6qbZ3ya0IaRs0fk ommENzHmM5w9ycBUSylBcKiYjbEO5Y6OTk0UtfZ7KJEU3RuSGgueT4K+lykGFUqtIMUVONPZzIKa tNlbTP4J5Uv6mkqrvqjWWXXvzo/4E9XiWxZ4nPSXdR0275Y53ajlHOT1EePNPBmuSjzV8ZmJIR2y f1p90UDxinQc4QNlEUKMHqQJkgpGuyG+X5RxgGGpIHFzWuh8rNfuEPHv8PToR6hYPbtt21t1PuDV HImzJ7XmIA/S3vDmhbvQ9/Xvq3njoo/FZmOw7+DwC65ntMi1yXTLQ2chYuoUMR/dXNsfVySxzriL DEjiK5QSuCR7BqigBU/QdaPxkl+Rc+Qg07xi0HcMZ4ERKaYyRIdEGbYkdapIPXvMCLz4R6eo5SiV TTxoSQGIcVay1sT6hBRSUllAkuv2nSacKt5VrFJVgU60hZ4SpO1J+cUj4WUy7e/suZlqC01hi4Au pOc4EO1UBJoQY1jOtJLtqUSoJhUpx5F3jvEtMZtajfGMYkwXO+zoqqZRWEszk8Mw0VXggjxdUCCA UfSkU9nwfXbpvWHsq0UYCUY+Vw9hX24yfPxKPLxBTLG3o3cF8J0+jVmj5e/K+WEtaRW0fB7t3ZhR ujILiFIp7tR4IIkeX6LiWSWgakgckDABkRlaNTFcZQIoVC53kiYeKaBZPCwuO4oW2CnjBWjOWtYO wd7JSHCZEu4M0Z5nTclY8NiRHg/2eAQbrWZrraTGK8pLTJDKMeZdjiWv5StJFDJ97nqA48beric6 Qduz20X2jJzbgjnZDcAgmASsf2+Q7ZGDIU9dCothhUREU1NSfUrBkbrfJ7UMiZ/NnOBjum08/BCO K7b+R4BEJiWECxPFG0SPIQROVBJOwdFmiifQ6TGOTul74VZsslRgJ9zTWSXHREb8mVsdkFaB4lpG exKsrxMTWihu6TIq41IKHE9Yg9og/ow1ZhWzVnwjXOVFqiCdKuNZYPve1h8BbFFA2RjIIGJKLzaV CouDzUlmKLaWEuR2wE743t3dhwIYil3LlOLkeNDqOQNjXkQDfc2dvEWKmDh2wgIT57CZEUsa7Hk2 whS0RQmsFgtHepggdxg2ssRw4IHNx0c0YQKGSRElR0mSEd2EBUJMcRoONfIgkyI3ZU7PF4DMyMUr cNiuOQciclLCcvNB0SFZBFCzorTGMptakqHmd7PfHRjG+mqyQFnRQxIjuqO53JzeTepIDXAusDEt TlDJNeqMVKlxw1EBSAq8DnHEII789HcyNs7ZSnlCwvEfaMEPJShBG8h6EsBOGZ03G5NhxfEnah8h zNKF79dxFYb3jm2brz4jCIOvByI9CfHVDbK2RFINyZhzFTO3nkVLZMDxIIGedZT6SkcZNXeQKY8q Zp4l2s2YtsocJQ0XU3RY4kxiUmOw3MazZhywzakI0YLYeEESAqCRs1jeQy4x4FY6iBQz0AvttPNQ MTcoTQ4GpS5tuuYsW56nstJHQ4lOqhB205V2W2VjEM2Wqm0CCCslxT8hiJ54CeXkMK5zHe460VSv L1XCjiVko+/0V6SjbkJ1YXW4vQgpGRjdq2meKCGM0FBgOLTOMRN4eZiak1mpaFrWVdLcb8W2ZVd8 8RVn4snIKzSEpdSo4zEmO4mOm+1By1K8oN2cLHO9ChqKQE8fGPOt8K6wqytnv11FHVAkZEoBIkw8 zMZyRIad12yyyhIQrgQMiJoN1xBNwajcIG6osNBsBhUaxmpaRBEyuLnLkVYTqShy4yZFOtnAbAmH Cml4xsmegeyrk59UziB+q5wnqMYIoBjcBcEsM910BURjZ1mq3INskbzZqaI/P50vU6PsEzLEcrJC CxEmHreE4yel2u11tKFV7JWjS2c5xInkSkjtZNked3TyWdy5lB5wZFdkEYp1zggdVQuqJWoVUFlc ue9d4tLsJc+MzGbSVWrHZteciQjDS18O36pf3iqjKLja4kT8UmN0HoqjyM+FGvrruXASrvu/NBHk fD2SZEhnLj3WOX4q7ZxRnpUqaRGVRUFOrKiqgMDZUmmpzFBeYlhg6Q7xy+RFl3I8kqIsj2dJi5Up 4QSO3l5jkYUNhYh/yeko9n6RZ+f896XlPpE9D/c9JgfKfUXI+ogOQIPnsjSx5TdtA9PBqkLASYjC mKbcHm73qaEGk2tcSyv+wfI4a+E6qSHvQOtbdwttQfx6/1LQWlGBmbHCxYf/M7h941emaEbeqBjs ySV6oJbeQlkgGWAdYshiL8wYBm/YCkUOxKARY+07j32jFdrvwbw1AnBpEx4IV5SDekD9JrEO4J4u cj4jpuXqMNLPEvHxkxoKEpkrT9cdEElBma+s4nvGNLRMA87152UBk/0069SO438qa9+NBkuR2rZY 3tbwOqDBIdO2QkhLCXruzrCOMl6wvTCuVn1hIcXiQH1DpCxBjM7y4uLXGpP+PWj6sR1HdN1F8R30 fIcw6DMej61dJZakEKbkDqocpcrUtmowVVoEEBdoSFkZcDhD7Sm/QYncOTIqJ7GgzEgTITjBeGJA agyGTV2HAs0Gw8CoF/oKDdpXJv/aIi83pUC8wWZRdIJuAGWh8T465ARAxtDbH4njM0tKq8X4b13o vJoVU8yDICzAGsVMUznAYcElu1YEHeNJnZ6hFWgbxJnNcnybfrCioqm8Fgrz+QON43MH56lGAxGM MxwnHpEWrthaVi3EEhPaWLJ77wTxTJWAoO5HKo0d/3+WPQc4nL5yTxgEPxQevQmBWSNUDAnjJGHI i3wDaOeCVCJohkSxMQhgY5is88fRlJkLBDHHKGaS6JcSWCUQ0pLNoSpeBej2pKGqtc9lGgzQoDAz xrS6UU5Kd+9HHQt5CQhCyJAYgZWFM9d4GCFXNMFDBRKDJ4YhCH8PlkuO1C6ou4AfQdJ9Qm+W+w9S bx0/YOYxE1AbX1nstHEhTVCrzdOZJJBBBMi6hekF4VOJuA8xzy7d5RwJGBMw+KJv69B/iKj8lD6H v0T7vw0rU05tWnqUI1JO68xGguzYgy6RV3kF4VzAN2APm3FryXGS2Bm5I27+gqjimy/xBiVgIkhA 1S0oHTAwNu5gkEQBGRGSiqQYIMnkKC1pSTnedkhhMiTLbzuR4CBUNWn7btdYGVWLttgMT5j0kQaz Eb+wXssVNGZoN4VsVDiU5EoBltVxLEQVE46w4mkqLlAhJ5NVuqDwlb/JWQdRFBR+0xPbu8nOXm9c 6DEOiEMnEqXnAJTl24iZKkd2kYzPr4DgTaNRMb6rPHsWRIn2Ec1N9aUc/DJqyCQ8HYKlBTi/SSRD eSEafWWqpnQM3jg4EGZzGT8DqLyP6hfTbcdgSlpWDNDHabF6U9xCWuUKgeNh2laFgbCFMkdJuY22 hs6cVQ2zMgNlxtP0lxDVNP8r7MoMC9EmOwMJYJEvJ+POE6eTiLyE5MweHnuW5lFRQzAneSJs/Z+z 9UgVgNcxkMNUGn5KSA1LjDEIVTJEqRYX0+5hEMn15hjG/Sh1UMJIagcCaIE/c01OcTn9h8USCYph eTNvs7jmeBM8oXc4RyoQSnSthyFOwqrZVIJ8ptJyNSQRalJOLCNj2E5xJiUHiHgXaELmIB0VBurt MxQmPnxBYcc8Mp/5PMmVO4mTBthKs8fcCJagPEgqvGYHFTUjehHHfhZokUuyLKsgUfDw+LjnViWH E7jq5kWQ2JKPLUtIUIPlDgvEXjIwHCEdS6TcN5Me3wMLUEmhfB4Zo6/vTtG0hK3iFl5JxTqdBUsp EuRHn77UV4SlikjScx3e9i3UveWZqOpZLkoYIjvDGbkp1uaYyLXqZuhsiiiJK4yJS4sVMCSp3cQ6 JlZ4qK9oqlEG0QctRLG1WNQgD2leDZtj8Xq95I9w/Mt1UjPVXf6y8xDsvlixtdvtmoN44Y60ThHC 1LJskq6KbDY4sKba9NEE7gOJziSt5gWpcKUbx0AcCLoJTkjrH+gx2sSL7i0fYaCU0ntu6qUKp0y7 GSh3XGYqy1Px7ZnoN+91+8pcx13NyyqA0wWJpS+hy8Z+1V13dne9R4nYjqLlNVGg8F5qSWNReP34 9bn+SN4XiXcL4Pio8Se/k1PBBWmFEm+cB8rs5p1/NIURJGRiaDvNQxAEFF8C/H9dDr139xBLnAIj jyu89p3Dz/GOQ5bQeUDUve5pSYCFhBz1sgBRDyJDW423yRGwohvKLlCnm8NXKqUHEgZTigooZ/Nc TfauCQJNQDI8UrKiQtCfplKZG5qWjgbRfDAh9Ai78xiTYEyIhEkZGEpA+vJpDAg61vNP1fUF5Ks2 4EVzoCWI1UMRe7AK2pc90gjNXt0i/xYAhRIFQ1+4HMCPdA2ECaDi0fSWMrmLxQdZWQUsPkNH2kxx 3uc6PX5jY3OTjyZQN4w2DJQkyYjpMpp5ipZStBbUXAbYjbEWECvwdfCeZLxcKTIwSymA5OzIo1qc oXnyRADeDSRadfEJGDzTVbM9e0VpXTU9543YaxeeFjkZKHvS2yeg0iFquognVe4hC+J3JGwbfBsw 25PwF3UmI19vdshJEJkI5xnyNSs7hIoBt3A1UD8JVgEGBO8wiMBdyQVFhhRCkh1DTBi832q9HztH BWUPNNBmXNtjTHyCnegRaVI7VBBwNnTxqq/EKu/A4qAgkMTBfFEJxefzAU7K0kdJoYg8uYIleW+T L+i+K9J7dMNtJ/NqEpgcD74Li0LTAhCNi2GckSFk2uJqNRKPN4YRkQnz6kryl46oUjI7hGGaqtl1 b8FfjCdsEhmtthw26MWXMkxsbe+NiHxQQQmyAhsuCSJNahnUTIJ+zuuzNEVRIIpO4dsrgnp600B8 QwRZFWcmvYay8TZK+8XB10MXrSAhNxZ4JkMwVvvenOvfbiRQ1TIOQSa86wD1QDlgUCwn3EODSBoQ gYYSMbIaw5rtsT01qqk5/YXBFdIguSWGHBbgnyT8GPBBKzT/vfnzK9gqloNG1uWxvMVVX+WEv3vY TI1WzFMXTUr2nI1FWKIwXQUEeSEQYdugBZfBNJ9Y4lEohQ2EiGo9Z9ojiHICcpDHnVIaJwJH6TFj Lbjgll7xUCruUis0LHlJlsYmSz7HeUpFRGV2EA0A01E9zAV+ZQxkmEW8HkwlTNqa3brY0jbo5joi KGSmk9rT0JzOCWgrMAYz8414dECkyOlBb1zIs87SaVjs77Y6QU7LnCOJygUSGIXxUiXwnALR2b+g JD8s92vTU0SqcuZho9xPnARmLr4Zt5kuGVKlRjZJpkkzKIaKUfNolxjabJIDeQ5GOwiEPHfj7rBs 815v1RJB2GJqEYpgksFWLqIEymDyfOYj3o0+KKBcW6ygrwHNFiuRAfeoIs5Jx02Pvuchybszgp0D 9iMdJaseZShFlGEFngiM0n34iwRcGQcTH/sHYwNB9rirKEOHOlJOof3SK6VRQgaVdYIoBZ6VMomy laVZ74LEL5mIYu5M4RlSyCwqgoLEKro2qCXDrJWbGksH7YycJuBmfFuuDudF5eCQQlvBm/wgKsH5 mQwQxanCTFhO7f3k0A71vGQKg7H32oAWDAFiEUFEZGKEQQJVQKraCwhBJZGKF2EBPFtaVGTlAYUM PBM09BOOZOz5yGLSLSIyOoPeh3pj3yFjf49IDsSSf1BkXDm/kVPxPunIpnidPojH70eyozmR5jRv UpkG0aAn910F5kqCkIDaH3pGCA+iQ0IP3zgBcfjHPOfd6X9rG6ihghnPitAI/PUbJJtDX3BAiBsS DHyEKAVJ9g+X8Hu+yfa5Lzdz9eSTsrW0JQakNZ6zxHa0+xqERIErNsCng3P0GRqtzBvGhEIQQFTF w+Qs5EK9bp7D7P2vaLJPZHskLd8p20weHEWjgUMcjWddxZMEa/CnhTE41WEJDgBnCVKpqLgKo6SA PX0EOOUposBwfwgRXwXioVTPqagsMdxII06CpFyhoOeVcTdQMK11UFK8iSD4iGJ1AimOCZONC5Ey lRrnFnTL1Gej3M49cO8I5tw4Ba1pRcuhZAPmOt1MMZznml96O4QKBkpAQYLBnXqUQaKKlLSBXdLa WWblF2ykswqK4Sgg0gztS2FqBjSFx+MSQM1yYB3gU4tvq6DH0MmACQsAAZjPxlBSiC0l4nPAvOSm V6oOYdwbzu+ZFd6ArR7H2saGq7iEQl5shjG1Ae8jZ64A2CuWwa7ftKGI3VsDOPgUPvEi1ZifqWEg tFAizkhngNoFJP2oZSoXQY/BrmzNptQ0IKcOMZTNNwbmIyPNVAE8rJCMiEm9u33tWFg5gxAtAWDF sQoVYUwKS0tngGhvIYsPpICZob8r5HWjYplj5ja6DoxMcSycYxKgTZSyR+ExRaOKRiLNEUMb4z3O Nlm3HriK4z4DF2Rs5u+87heM3kK5/SUGu0LUmmTTN2Yg9CrqejYFgSHLYpynN0YyQGI7ETKxbep1 5FLjBI/bTCByghW6SJSMYSWMS1gwUYiYxkhMk60J2+puiCZ93MHSLjGfCctAtvwQtF1FUwKQYU6C 5DIXHEfdPfasNK2DzUAYHAkYLEB8vb4w5GGwmiZuRFDVvHhVVirNJgaSgK88PK41VVVW1qaStcOO 4ZYZm8ytKlVUqheKTPAdujWlQicVFWjQDEUEDcSCXogMZQJJbPDuRgjoIMrcondEFwyzTIYbC5qE kqFVcoAltffVtrRr3tMOIS4GUkeAi6K0yVEEiDHbMcS3VxldzizszY5yTk0osPdJwKwUAlFS0NRi Q7Hwc4gnjnaConhrFWcJJEHs8ODiN4hIW8RMDJN5ZsQ0xJOywwWIlpRkZFsi9Rxri0YLGb0qrVQq yGMJNA+JkNBjLNZZUzCQqJRRoSURqgx2pO62FEQxgapLQZL4S0gJlAOczfb3Dabb3G8apNInAHP2 9NRmYaRoGAQw62FpYEVGVYDnFkHjyU6nItZElsw+h1+9kN+KOhiDsYaEM0VGMi8ket6x7keTBl0L sW9lD0DExgG++/QJomAcCsgEmwwaDk95UBBK33zZ7oHV76YYXSrHDg6jAT1uMDY1zaCuEEYb19UI si3Ly7IZajtAMlePC4xEqBOxXlsxPaichIkcWK3Io6EGb9ROLmJUTEs2g4lCQQAHULsUwoM0JiNA LEaWSp5kRbImRs1LZv0HviZFe2wDSCcOGZKV+y9vLdmHJNmr2HQbFvjjzkAFqykqKpFwqLqqkTAW 9w25OAsSTra+rIYiLB6KVgIn3NMhZhzySCABsFJda+AyCtIOzX0ksyPzQQGP5Szz3I26F4FukRuu HcYcfAGtCYwFvsMpGO3KSF5SrX1joLSpKoRevRIDkwxGQn21KC8XP0rcLEqOSAlWDaODdDX3WSSA O1sT1mElH2HNk5QRRiF+Ag0d5IEp/JwywXIwUkYLNQAeHfulZ3xuDBIkQSeCeaVdTpQnCOlhk9XP 0aDMQ51QErC1JZDOMihnQwQC6TD1kDVMZtkC4ZnJpBVygdNSYRA3JUjUCqEkCVE+Mw87b1uHaPwg Qjqo4o6UHE2tGBsBp6tCMmBkqCEtJ2ZD1JxTWo4AkFSnbyJx6nJ2KnUPn6xCgHtwEiRAVkH64iFa cF0yEi7CfIKI/+LuSKcKEhFkL8eA --===============8088050332202239008==--