From: Tor Didriksen Date: May 16 2011 11:48am Subject: bzr commit into mysql-trunk branch (tor.didriksen:3088) Bug#12552221 List-Archive: http://lists.mysql.com/commits/137425 X-Bug: 12552221 Message-Id: <20110516114832.9C97637B2@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============7624529959978866012==" --===============7624529959978866012== 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:andrei.elkin@stripped 3088 Tor Didriksen 2011-05-16 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. @ sql/sql_test.h 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-16 11:48:23 +0000 @@ -0,0 +1,175 @@ +/* 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. + + @remark + Unlike DYNAMIC_ARRAY, elements are properly copied + (rather than memcpy()d) if the underlying array needs to be expanded. + + @remark + Depending on has_trivial_destructor, we destroy objects which are + removed from the array (including when the array object itself is destroyed). + + @remark + 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 a 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 (!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= 20; + 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-16 11:48:23 +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-16 11:48:23 +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,24 @@ /** 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() + : table(NULL), + val(NULL), + used_tables(0), + key(0), + keypart(0), + optimize(0), + keypart_map(0), + ref_table_rows(0), + null_rejecting(false), + cond_guard(NULL), + sj_pred_no(UINT_MAX) + {} + 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, @@ -85,7 +98,7 @@ public: bool *cond_guard; /** 0..64 <=> This was created from semi-join IN-equality # sj_pred_no. - MAX_UINT Otherwise + UINT_MAX Otherwise Not used if the index is fulltext (such index cannot be used for semijoin). @@ -93,6 +106,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 +1833,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 +1911,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 +1967,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-16 11:48:23 +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-16 11:48:23 +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-16 11:48:23 +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-16 11:48:23 +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); +} + + +} --===============7624529959978866012== 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\ # m201tsvv10f89jb5 # target_branch: file:///export/home/didrik/repo/trunk-dynarray/ # testament_sha1: 154ee9c887d3fcab1271558a9eaced4f3ac9be2f # timestamp: 2011-05-16 13:48:32 +0200 # base_revision_id: andrei.elkin@stripped\ # 93n3pu5b4moj8wsy # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWcnXWS0AEeZ/gH/yIpx7//// f////r////tgJF3NKdL774bp4kWoaGhd8vG81V3d3jN3vXtKT6322mgkFvWN4H100+95e9vr3d3v eu+7vIXln1Pln12+nXu7r7acxprc973k3bmXds2va2S3O27rbz3drE5nufTSfNbPvnGEigiE9Sn6 ZPQNRo0xT0ajFGaNTZBNPU0AANNqGg0aBoCUEAQ0mQibUwhTBqehHqNMjTIABoANBoABoEpoIQJN NEmmp+mqPU3onqnqfqT2inlNPSb1Qepk9QHqADTRkaA09IJNKRGpiamTJtKeRTanlPU9R6no0m1P UGHqQaNGg0PUNDQAPUARSEARoCKn+mhMmgniU8JHqZlHpkmm1PU9RtJ6gDT1DTQZPUCRIIAhMmCJ 6RqeKp/oA1Kfo1PU09NU09R+pA8kAeoHqAfqh6jq5oeAYQD0skkm/fZ3/Y8P/QqjBVBfoFEBSICE ySOl3SQNg8h7r+tFT3s+qhj04ywdWnG/Xq2XJtj/0DkI/1Ut4pEnf+cQkKMN27Hzevbyj8Xxd2GS rb5yurBkgUfv3PBIt4FjZEqVoOchvBY5NhtQgTuRC/5UBeWzUNKcsDtGpte2isJcT3cjCkdmcOiT 5Kz3xjLIbPGYfdtnGV+cnCcEkU7SCBS0zjOc1GnLWiay/nL+PVhoz6LDYLdfsNWP1bIYiEyQQnwm Sxqa6kQ5TU1kJHtcuREno7iiDwoJRGBHtuPBZO7qMNhppNfvEQwuD2BDql0EcsMUkqiurTdnLUYo OMOjth0nmwdhzURCQiE4Pu6YObaVCXHLvnTEMcO+5KBtzsU2G4YSe0+jEZejbqm13NDeRZCEGZQM dKYNkwHIbrYkG02NGrYt6yKaK8lg7LDz0jSspkyTaynOE6xjOFp00lqTWzM3SiFZlaMpFmmba5hL b830YIxYF7C5AkboiEQWcCqsCcUCIcEISgEL+f/eJJNphKxyTitJgSfNu605Mg1pBeuB109dA/Ek WAbmFE5GLDwsPiMEqxYKSIMgipE+a85iiHWIFARA5rYRSRG2wiwEHxpCTm5Xptvm5Q8oea9smD81 AuIuNt5P1MLYi6E5aKUrKcsdiK3R42Q22w/xKRWaoFg8GmHynG0EKqaWrbrKEF4lA/gvxn5PRIuT aVlfDGhexzOVp5EBpNeFmrf/1rRoSLexKaPoQ0NjbYNptIXGtTUIPmAsj1+cklnfT5+PSfAjProz xXi061U7IssKL5XC2VcR7h6k0X5TMvBtAinHWm1at5Kwh1fnH4lObrbFccVilfKWhZmplkXqbRHG tERd4RfZ7Lju8Iwlk8IdWtGjzm24dl8aDWc5Ks+/jXj5tdH0Qkt5SUbgbusHGFeKPyGeM9JHAsHH Se0j2P3V+t4aG1yrcatkgrjORawVCOvgTjB2DliRhB/Yb47aGlF47Bk2rCUd0qSUk7Zh5/PYaCjs sQXd8eaC2jlO9mQ9HXtwsWKU4PDnNlIvKc5XNsPzDXHLtsFBJvEEHfKgeKyxi+lqzYZkrBhr5YEL 6muSrBc+rtv59piYNTvXRjoocCouM0dX9xR82LLotRUlkx7uiGhiB7MebfsK8m23e23WaoaucxoY 4kjhZffMzVcP/S/N0zJKMbblOdsIqFHWqnLdJvBZoMT7su/pNpMQ3dyt4ju1c16p6szC9q6cLRbL GZGyl8653IkVyeUjZFIon6FvQsiFC3qksOrI2b2pBSnwyaBrbOsI25LBcS7GfTjHfqonyfritD3Q xogYcgUx4K4/LepvAyHt9MxRqkqfJx570hCIM8WIPZ5CUT7MUa5FFMu/ggDIBK6w+v5GgeSunly4 xL3NvBrTLtZmZhldjpoy1ayRvvZzKfbsEt6WmTXyPtAMZ+8iTNO/a7+bONLD5YnDBBJIOoKovCNx VTota+2sYxInpMNHyrZmJ0tAmeIlZU0LdRXdEjb3stl03O1uZqkcxLcjQc0c3XXmDDxlxObWo4Qo rb5x4FT4DGNm3aBzKpfyu0Hb1BTKPQuiOgr4GUiYXaS4d+XNqBkKmdbD0oHzOuhHrMo9dSJ373sK ZpoxpyZ2VOQiMIO+erOKpuLwMzcTeLG7DUUo+KMFovHNoZEdd9B2IOX02pkL3ZssM5wqVFF3wZ3S pGnoMBkkL3GoXwSpFHmzVtRQ7CitOgbgTNsfboMMNJGLwOo0a8zjHWcMHNs3Eh0TaFqjM1SRVRWd 4jA+5GRe7Fb7iujvrp7cY6n3/eOjdvMuKjpTZPwJWvFOrBhp692+GsFsQg2AxjaBjGxDN3j6hKKr yWBgiIH5fjp5TMsEVWRIkU0enpN5gnA7wiTHge82f0oHRCtiD6+On24ic8Bggn3qRVqfKYmMVgpi UHnIcICh6ViUxOb/CnjOzYQlqP8Vnl89oX9wfn/7geG8rmMZbLGBtvHnWBPdcu4MLGxtv5IfK4hR h5s1u4oVxzX6RkraS+nHCc0YlFXR3OmjllOO+hr8Ea+OkBzD5oqoqaNCkmyzg1pRgqD0WFjbsNUl ilVTsZvT9+WxvA+w/w8OC+SUBJSldmb2adBavfcifqZ9Xf4WadEEpmj9HdjypuPdrwfSZ31o9evC a6IbsesaTh6ZwFRLKZ1GZRM42zh3rHDk5NFLX2jNDUI5K0LDytHnWzLDtb2kWLWcSKUy5xLZTnX1 cEFNWoytrj4p50y+c0lVd6pZyXS3CB/wG4+2tSjrh+BVS3Cora2+qTbNvc7SPHeYsblqiLqNtxta HLup2T4hA8AnWYOfI5UiGlD5ECaIKSGgL5Owc0BK8xBizRmxLyNYdJLg292ywnuBcD0W4dteh9wy qORODJ7HmIA/Zb3hzBbxo9vPHezZUIHxUfhw3fOi54BczvxQNS3LkeERBuLaUUbhdlpw7j5dSWWq 2IuMiPELBQSvCS7xqigBU/BeNHwPgvVetO0YsjsGM9JESmmMkSJJERpPIum9VD43mInv2U36hB4G 2ypetPWiqCCdji+m++eBPoCTGTmsoEl4dzpNOVW8y1ikqwKXpCzwlSdqT9QUj42Uy7cd900LUFpr DO4AupOc4EPGqAk0EJU9dJ0rVVW9Oh0M7KUPfxrnOceFBBnWlrWs5RT55RJMpRJEqG6YUnDBRZKX YQuWtDBA1yJNnXz/ZHzTuXy3EUYCU1fccvlL+3VJ8PBR6+AWWL2+nh1ycu1+bRihX+iAVKQvK0Jf H3Uu7JIKO8KEKXltQPXPR+O7g3svGUN0BxAQAS+1ggYJsO1VQFcigzDoImauSIHgRPZcTN7OSqtT nB4B2nrC1tBbmUgTc2sr1c3mnXZISY9f/Z3mzZjK8SxuXfCiBEU+VTn+c0ATgqX4s6oGWUXpFMnn SuUnDKh9BSm6WJltXCKiGsxHdAUGQEyj8fI310mYz1ecQXF48CBpJM2Gw+N9/OsBBKvhFOmmIQzy Klj+LOe0cjXwo0a+DaFeXV0OywlUlJdeQpwuaoEq7jBUQPo8fpdt438bUk2V0EGjwzNoT57HiFli 5uuyzbwovpZY27mWIHuLiNeaW40GhbUbjxQg0iD+jPPEOpj0aeGqkRKhlOCdacOFpcPrexh5Riga 5ZppIgV+MQxNhnNQ1u6DUzdQypeSyOMxdVMNYgv8XA2lMqLG6ZTEggoxkGgw2kxim0yZpQj3kBzh 43cQj1S0E1OOZ3KVMzeETzbbIZ7UJsKUTOUxmbznaBg39pcuSsQzqWDuKWReYKQttslRWClLLGES hW0TbjDMdFaVI33lhvO4necKVDKPM52IIMUMy5qnuRLlUNkLJ501RyDY1OGDkhPW+q7V4UyzlhXc b6SCporFSUIYzTlB6o3ajHMgWHRJwZdk5pZx05T5srES5S0Yz0jEQHG4kMTghn5bVsi+VPYTICkD MtCZxOZsYHA610oovzGGNt1xlOfMS11pIsSUtsurhWe/mUSaEJq/WOUOM+rZCdcxON5I+kGRRylf U25D12KuMgQxmmNH8RqkDWMWJmnoTkngu9c1HsuIQ01hrNF38jG5QiIDk5sDqpRTkXMh8EkJWZEZ FQR6NCu3YSwdUZT4ksiwpcUa/CMc2A1ZzQmmQpDicCBXU4U8WE99tEdCImNeGFyIOLeOAGEIbS8h MskKDgRLdYXHejCmLJy7FtmWGrrXaqF2m8vWs09UE2LGN2r7zbVBTgbjaQcDRPYaiZKRqMzgu1b1 6kwk78G4te6vCDZvrFX48grKncxWVIuqoINqT7SgtB0mKVKUucTiIHKHVmlsFSRQTycuiR3rfRXW HeytljPVR4sgSzJxCZrNyUXPEHMeNlCJUwliFTPORBA5WgVGmIYGk5DIaJunVNpljmbKXHIKUORE pfgUECUzajMntJwBbkrMHrlEMcnAHeFxArbPoHnqwUoWuDa+eKijmlFjLVWqUgIIhgkZ4C/NEgSz WyibzMrMYzuNm9iz5E+T7S8/L7xbcCceZQhmJhJtxvxyOjo/RZLLdMZCZuXxS8E8REMd9Eort6Q3 NnEGhrMXl2UOwoLejOaDoaMGldcFzBtRxupHpJKjQqH2FhiO3KvTf8hMQmjFx7s/wl/iKsaIvOdx In4JMboPOsfWaeFGvZZeuAlZh+88HTaflvpCU868/K8226cpqJWaGhvzKrBOptiwEHfI6buQ2nQb Jw4XUfVPB501beuZXoKoT0bjvrbCCR3tewB0mREMH+j3E3p/QLL2/PWlZP6gf2v2HuLT6D7ipX7S AzhB9OJarS06zg1Af03NEgYiGReMKXpqtdnL9rMgzGtpcWK/8F+Bt0bpZTkHUhFjwcI8FYerX7XO XFUCaDZEgzQH/oOyR0EODBnTbyyIItyVwahdvGLkgQWgdgciBMNAQBEfYBmGnvWgVQec7MY1jL9c PQ+jaBQCwSfA0ltjMiGLrNoQbQe5wEek5Kl6C3M3k95YPdLjcYrcuw+vNjRWkN7uY7ZSGcXQ3h85 L5tTGB+WWnQAbDhrRp4XSFIqANS2LG5pWB0QWrDm1SCRCWA1rw40hG6RWsLyQrfY8YMNzvICR9w5 gsILglLIUEyiZdR61pQv7tium8YopajMhcRWLYKksfpScxYtCCFOFA6JmsqQKFmKjBRAmEEBVgkL IZNpxQ+JTdgXG0z3lBOvAxEgS8Q6KSCooYCwjGPOdhNHEmJ2EAL9CIq1J4X+lt2nCTMNpunIZzqC LQEyOIPMebmwBaMbQ2x+B4TNTSrYL7ty7Ef768ioBbXmINQF8ZhAaFIUz1QGe04pJ7MSDtGgZ19w KuY6RJxHTJ8G/84UsVTlDAX8HYHU9TrD4bKZCTnK8aDXYCrWcKy+LjJJCi6ZtRjiQxpRFaTYBMeF G+gzd3m1x7TgE1+UkfAgQ+qDqmSgYyRtBgT7ZIw9ZFzyDYeOCWETaTQkDWBiS1x8g7OrAGBJhBa2 GLs1IRQhsBKQ3JMLiEZnAzKepJRtxmekptNcIAmYl05UhCRnLxuqFdglUaGA0oEMLgL6xTHQVoWq UcRtULQUmMjsxAkPy+JyjqYKSQl6TeweoTN+44H7T9h+tzgUXwOewbAbMz9mJNBCb2AHN17SlERL ST9BJ3QiskeYxAdswwVWQirRBJiKg+Nwo07B6HIX0RPOn45C93ylSZlwauO1QjWA78DIaC/SxBo4 gYDMAruAOHEHh8UFlZqZt8y25zOCNvNiURuTUV7i5jJtDgaAzUlAXqMUFDRUmMQxpEkRkRkpagwQ ZOwoYxKk8T4mRCCVAKYqtBRM8vSnBNQKwRY4mBQ/ufIKpgqNfSL02FDDEwNwUsKBvJ5xmJfpVuLC IKCOjSHQZE0le0IS+3KXEH9cc3CLQ1sbBsf4lH5cdnCTUThUzlQHK+QxI5EXtauEjevaBKRubByk ysVQVwwZzOnu5ikzq+fj7jqEkcSFUkbmuMVs4IGnAIDt9SSRISN6xIG1UkI1eUuVWbjf1EvIPUeM oSP7ZnrKwPpqeUzMC0X4bql51hOetZM0sfSbl5E+BCW2UKgWHWsyxCxGpkHSb2NtobOnWqEjMDaf 1KLDbGj9r68oLy9CVeQTUgSZRL2biF5seAmkLHSHPqu0Es7Y2xoZsk6iJJnwer04hNAZ7IlQ8nPg 5vszEgc866iI5UpK0TW+28NSSl8tmDBjHqTDllKFJiUaRhRPjaZQ5zh5aKH3jtIgiYpBpx8O9l0n Eay3WSLqk/N2kLJB9izO80mxrUgreegnmkE3ekoNhTRIYogqXKchEkG/oQvcTD37zwMy5M/ZyBX+ LO82n5VuJLLNKQkEhBFzqBh+IDyDmitoIg4KakNbEI4bMLTKRS/MurmCjl6fW48dfJmXHEkRybxq GmBJN4JeEhMg7pDFXb5bXwSBAIRyrkNA0ct72pbDoZzAs+h5PN+N8ZMnB1ObM95uNODqdgqWUiXI jz99qK8JSzpIxOY7Ot7Fuhe8szUdSyXJQzIjvDPRyUytzGeRa/fYxATZFURr6jskPDTQ9SA4tHAt I7rGyafdJlMxkyM7VEhtWDUIA7u4ty88aB6+8lJfWN9xfrrFuuvNh7zI64INAYBpNifOxmwc5Q2l xSijGzic8Vwk8qb5iJqRuNoklrLSyZUKTaxwA+8OjIUJH8JLrZw5YI4mgjmN5Ybz5fqk8kLTBavz aI0PZ9eBsTxusO7widDr61pYjOtXFrYVXwUQODFghZ/QeHweGruhbbhz5RkXnMnGXhR5DI63zs1q c8G4Ts3q9l4BsJPAT6/uU91PraNDzwVrCknKW6yp9EuPmeX5lJDAsLAwhqY6DYQoBInW9Rny91fY yxOgkT70gSW/kv8+w4DyWesbxv1g7AMktmyEQwaTQLLSoQBJB3h6IVKmuyBvWSU4ia4Qp4OzRwok xuIGSaUggMvDKyg7L57FwayANW+rbNM05zf3KsrlaG8hlJmVMjHpEXmmqMneCaEQiAMjCVA5+0Mg kIOpbjzekLzXYc+JFk6JCyGqjEVWoCdkqByIIxV72ZX6mAIBSABNH4Q2KHTIiG+JiaDpYQ/vjLCY vYg6j4UvPD6iEesZ9J9RI7iog9ugKCwx6hnbaJ0FlR3VdMIFQ9vABxTHqRtKRll+bmPUvm51gdi5 zYSZaUw4m4qMDxpICIxhSLjxbwkYvSmrGtOvYK4spzPcdq1GkA2sBvNgmfFJsvd7mULKORBLKtuC F53hSNI2efTaar3zlXMlw0/Bw6SEkoSkkcAy7jQ6RaoAM9RDjoPoKYAQZCeywiMBTtYDUaTdn2Mk yg3WWIIe6+Gbofh2DTQzNIwOQ2Koxj5BTsEIuKo61BxUjiueXTWvtSswxOlQEEhiYL0ohOMD9oHt r12pI6FoYg9vqBEt+Rh7WZTwizmPLzQ20n/EyAJgcT3wXlwXGKhCOdd5tKwXP1SLcOQsJnGQpnRn dyLwmbtNCekbITjqEZalZfLlvyWOe+Si+DnoQQ2NHHdpzZgyTGxt8I2oepBBCbICGy8JIk1rGciZ BPv7L9JviqJBFJ5TyF7k+P502h4BIiyKvV0d6bSojVCX6Cgdki5diGDRuLFxReKGTrVcnjPnaiBi AzNobiF4LYhA9iBxISCIR+sSuoDIhDaSYxIqYPbPLh17yoXeEGUvDp5/Gs1awpLHjwRwLxLgKMCG QpXr9peRt6sxGLcAq2LsaZqySu7pfJFNb4fCoGynOBO1TCdeaHITTQmaxWQZBPanrykN/PyATl7s ZHUNxcWyqGCoR3H6EjpDkBOUhj01kMUyAF/SZMZdecUtHmGoK+hmWGdzck2TYXF6y6+cGcUEZLpI RmhmoJ47RX2qF0mUItYOe2QOLQ0OqWhlmFZv2G9uRekZG76eaE5nBLIsMQhQQfyDXo3kCkyOKC7x zIt+NxMC129t0cUKfK54RJHiJwKCQkJykDBjyZUJv7/RwDA+C9OXqyuRXLFxbMJ51G9ga7VPzPUX cpoJdOmyuw8ZsO7sMGkQevCFc+Y1QMOCuUK8i/UNoO7HLvuGz7V9r7IkgzcJGImZhFcWxeMkMFWM ZR3qKdKafkSo9DBg37CscQIolzgkg8zItJ+XXPh4JJJj37QbUI6WNNTlbXeFwpNUqW7UsPWK+OSg RezCCGdvose/AGA+/qqJEQ0PhOO/bbtl6s9DiZr3hhQqAt7DQqYgqsWw6pFqPpM4VxajoZM0FhaF DBC3ybChMwe7SuvUYA1h+t2BbFAUR276Bt4VKpIYxWePFfiwmmfJRJq1Bc1G+RFzJOuvmTAHjWsZ AUB0vlaABMKAsQigojIxQiCBLYFuwMCEEmEYsM2EBPc7e3jUZOoBhRh55pP5xb1c+n7kirhjcMY0 nmSZPvR7FeeAiRr4TAdQSJfqDAqHB+ZU+V+Mvc6mN5y/ui/8kHhUYyI+0aNytnQkc40BQ99YMDSq CkIDaH2JFSA+dIaEHUsgFw6RyLW1PTwPvsbz2igpQzk5XIE9dZtmxCQ+QJCSIhUM/4hGQNVOQjf9 /s80tDS2re+klobhcGQWywxH1HgOxsdbghMYgUWagl17l+JeaLNYcBSG0DGEy40u77y0ME0Dtufr PB4vhLKQE+uPCQtfsO/Oxy3izbSZdeaDt1FiWo0+ceylxvosISDiQxgaFByKgKIshgebAhxyl4UR cDJHyAgt4qqhVZ62oLTLbII1ZlUSOB7qrsf2A0tcaJqyRQqSokMtXwVRWwc1zI3PfYbU5b0sjaw/ DFE9O0m9G9T4uskIWVWIxLoV0DqMtctSxqV5O6IIA0oMBg0LBnesoRpSyrUC+wY2sw5lM3CkwwoK 5ShBqDPDMZYoMahmPvCSBroKYesGzdl04Ff2NKaX0MgRMEAWq/gQiGxg2QZNM0oKjKpFOEgcgaQx mnvdK+EkdlWrm+AWHbfEjBmzjLCybUqIss0L3PHQO4N7tIejyFRmIivaGiXWVGsUudAx23GYXLRn aNA+SGecbQLvQytgt6y87XoZpabUNCCo3ccs9DTF6cEKZz5GsEfRCowsAurRVpzUwHfDUBiAjBi4 IUVYUYFTExxEDF0SKsCqNSj4PnY2KZZ6CGtxuMTHEteNIigdNWIPgkZ8hPT7CvI0kERq/LqUUZax 3GvhwjV+gtI1lM80Sy8Ro4aT6oc5MgyZkyJZHasVE3s1hSERxrUoyk5sZECoe2KRSlg3XTdJuw3S HtghRypZxcpZWMSFSBg1GWAybGmMqmgStZ0oXflr0jBGXiyBZiV7yd+AlQvE0RSukkUkWUxxE0Fs booHqOZwiODbkH64SUzYxNDaaT+Peaw3tHQLBWb2NhlqPQqrFWbjI3FAv34fA6rbbcdCm4vRDhnD TLW5zTEststFzvCTiIO+nQlhE4UuI0BiKCB2kgmdCDGUEkxsh5IwR4iGo0QL0DBudtitGjoKGQiC YTQF7QQrK11CCit61zIVerQ1gEK8xgfkHSZO6RDTDiC3GW3FRNNdextB0Xoh7j3MJqD4B7HQ9gTA k1PKITXcKjSHsw+t8mJZ9MWmjRxxB59u3EmyRY7JLDBRpoTY4FcZmBgsRMSmhoY0M7HVfW25LGcs txaIgwdKbSdxkGBdJlSTJTEJBQSajMkTRlIK717zkNjGiqDJKSGlSakkDLUB2ml7Po7BtNtwcBqh NInCD0d/TU0mOoaBgEMPuYuLBDUwnWMxvBxyZ77IcVQlxoPdurpoeEUOtRA6mGaGZ1MpGBI/cese 1HtaG3fC61uZQ6BiYwDdhhmJimIOBYQJJsMWI5PcVEfVBIC17AHa8qWV1SVjfvdBapyccDYaZzsg lRIIRzUyEm0m6FFRgrcjuAaUfpnQaYyoJ2rAumJ7RTkgUjxMV2goOhBpfcTi8YlRMTopJDkPpEJl Amq9gehoFZBkwJkDnIXLTMyTbWwlj1cr1cxQ9Ywmvva0N6MiRELZPXjfVc2gzpsv6zGVrEQy9yIA W1dmqEXEpLenEkAr2COSsihLew7iRQMbQ+OAxDGelwaRFo7pAiABsFJdS9Iz2SLUg6+foJaiP1wQ GfwLXjxI7Vi5ly0I1CDlxl+WsNfAG+hMsFmY1QzRSbbDcaGc7CKl1s2sTB5Jgc0BmIJMdqtkYD7O tCN4qGbFrFYpsXvTNKYFR9pZBIP0resVJawRViFl2KASl6XDLBcj2KQsVpUAHp7dsUdBEMWHZIYc 8D/Y3uq5YpMS8sjhLGDt2xIaya3iwqgJc8VMIcQyKGaGSAZpMspQyc2oKucD02TKIG6WRsC0hQJA p6izyOBaRv3Zvvj8wEI+yjgrkg4FzNgiAIYtzplAGTUIux58iCKamW5RCppX0jv6HidKp0D3e0IT XxwkhPfAVTBnEQs4mxUwMkVQP4xM3/xdyRThQkMnXWS0 --===============7624529959978866012==--