From: Jon Olav Hauglid Date: February 14 2011 3:09pm Subject: bzr commit into mysql-5.5 branch (jon.hauglid:3325) Bug#11752069 List-Archive: http://lists.mysql.com/commits/131202 X-Bug: 11752069 Message-Id: <201102141510.p1EEgnnh032460@rcsinet13.oracle.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============3587518846231186990==" --===============3587518846231186990== MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline #At file:///export/home/x/mysql-5.5-bug43152/ based on revid:jon.hauglid@stripped 3325 Jon Olav Hauglid 2011-02-14 Bug #11752069 (former bug 43152) Assertion `bitmap_is_set_all(&table->s->all_set)' failed in handler::ha_reset This assertion could be triggered if two connections simultaneously executed two bitmap test functions on the same bitmap. For example, the assertion could be triggered if one connection executed UPDATE while a second connection executed SELECT on the same table. Even if bitmap test functions have read-only semantics and have const bitmaps as parameter, several of them modified the internal state of the bitmap. With interleaved execution of two such functions it was possible for one function to modify the state of the same bitmap that the other function had just modified. This lead to an inconsistent state and could trigger the assert. Internally the bitmap uses 32 bit words for storage. Since bitmaps can contain any number of bits, the last word in the bitmap may not be fully used. A 32 bit mask is maintained where a bit is set if the corresponding bit in the last bitmap word is unused. The problem was that several test functions applied this mask to the last word. Sometimes the mask was negated and used to zero out the remainder of the last word and sometimes the mask was used as-is to fill the remainder of the last word with 1's. This meant that if a function first used the negated mask and another function then used the mask as-is (or vice-versa), the first function would then get the wrong result. This patch fixes the problem by changing the implementation of 9 bitmap functions that modified the bitmap state even if the bitmap was declared const. These functions now preserve the internal state of the bitmap. This makes it possible for two connections to concurrently execute two of these functions on the same bitmap without issues. The patch also removes dead testing code from my_bitmap.c. These tests have already been moved to unittest/mysys/bitmap-t.c. Existing test coverage of my_bitmap has been extended. No MTR test case added as this would require adding several sync points to the bitmap functions. The patch has been tested with a non-deterministic test case posted on the bug report. @ include/my_bit.h Removed my_count_bits_ushort() which is not needed anymore. Added my_count_bits_uint32(). @ unittest/mysys/bitmap-t.c Extended test coverage of my_bitmap. modified: include/my_bit.h include/my_bitmap.h mysys/my_bitmap.c unittest/mysys/bitmap-t.c === modified file 'include/my_bit.h' --- a/include/my_bit.h 2010-07-23 20:18:36 +0000 +++ b/include/my_bit.h 2011-02-14 15:09:45 +0000 @@ -1,3 +1,18 @@ +/* Copyright (c) 2007, 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ + #ifndef MY_BIT_INCLUDED #define MY_BIT_INCLUDED @@ -44,9 +59,12 @@ static inline uint my_count_bits(ulonglo #endif } -static inline uint my_count_bits_ushort(ushort v) +static inline uint my_count_bits_uint32(uint32 v) { - return _my_bits_nbits[v]; + return (uint) (uchar) (_my_bits_nbits[(uchar) v] + + _my_bits_nbits[(uchar) (v >> 8)] + + _my_bits_nbits[(uchar) (v >> 16)] + + _my_bits_nbits[(uchar) (v >> 24)]); } === modified file 'include/my_bitmap.h' --- a/include/my_bitmap.h 2011-01-11 09:07:37 +0000 +++ b/include/my_bitmap.h 2011-02-14 15:09:45 +0000 @@ -1,4 +1,4 @@ -/* Copyright (C) 2000 MySQL AB, 2009 Sun Microsystems, Inc +/* Copyright (c) 2000, 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 @@ -11,7 +11,7 @@ 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 */ + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #ifndef _my_bitmap_h_ #define _my_bitmap_h_ @@ -125,9 +125,10 @@ bitmap_is_set(const MY_BITMAP *map,uint static inline my_bool bitmap_cmp(const MY_BITMAP *map1, const MY_BITMAP *map2) { - *(map1)->last_word_ptr|= (map1)->last_word_mask; - *(map2)->last_word_ptr|= (map2)->last_word_mask; - return memcmp((map1)->bitmap, (map2)->bitmap, 4*no_words_in_map((map1)))==0; + if (memcmp(map1->bitmap, map2->bitmap, 4*(no_words_in_map(map1)-1)) != 0) + return FALSE; + return ((*map1->last_word_ptr | map1->last_word_mask) == + (*map2->last_word_ptr | map2->last_word_mask)); } #define bitmap_clear_all(MAP) \ === modified file 'mysys/my_bitmap.c' --- a/mysys/my_bitmap.c 2011-01-11 09:07:37 +0000 +++ b/mysys/my_bitmap.c 2011-02-14 15:09:45 +0000 @@ -1,4 +1,4 @@ -/* Copyright (C) 2000 MySQL AB, 2008-2009 Sun Microsystems, Inc +/* Copyright (c) 2000, 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 @@ -86,6 +86,7 @@ static inline void bitmap_lock(MY_BITMAP mysql_mutex_lock(map->mutex); } + static inline void bitmap_unlock(MY_BITMAP *map __attribute__((unused))) { if (map->mutex) @@ -93,6 +94,42 @@ static inline void bitmap_unlock(MY_BITM } +static inline uint get_first_set(uint32 value, uint word_pos) +{ + uchar *byte_ptr; + uint byte_pos, bit_pos; + byte_ptr= (uchar*)&value; + for (byte_pos=0; byte_pos < 4; byte_pos++, byte_ptr++) + { + if (*byte_ptr) + { + for (bit_pos=0; ; bit_pos++) + if (*byte_ptr & (1 << bit_pos)) + return (word_pos*32) + (byte_pos*8) + bit_pos; + } + } + return MY_BIT_NONE; +} + + +static inline uint get_first(uint32 value, uint word_pos) +{ + uchar *byte_ptr; + uint byte_pos, bit_pos; + byte_ptr= (uchar*)&value; + for (byte_pos=0; byte_pos < 4; byte_pos++, byte_ptr++) + { + if (*byte_ptr != 0xFF) + { + for (bit_pos=0; ; bit_pos++) + if (!(*byte_ptr & (1 << bit_pos))) + return (word_pos*32) + (byte_pos*8) + bit_pos; + } + } + return MY_BIT_NONE; +} + + my_bool bitmap_init(MY_BITMAP *map, my_bitmap_map *buf, uint n_bits, my_bool thread_safe __attribute__((unused))) { @@ -259,28 +296,39 @@ void bitmap_set_prefix(MY_BITMAP *map, u my_bool bitmap_is_prefix(const MY_BITMAP *map, uint prefix_size) { - uint prefix_bits= prefix_size & 0x7, res; - uchar *m= (uchar*)map->bitmap; - uchar *end_prefix= m+prefix_size/8; - uchar *end; - DBUG_ASSERT(m && prefix_size <= map->n_bits); - end= m+no_bytes_in_map(map); - - while (m < end_prefix) - if (*m++ != 0xff) - return 0; - - *map->last_word_ptr&= ~map->last_word_mask; /*Clear bits*/ - res= 0; - if (prefix_bits && *m++ != (1 << prefix_bits)-1) - goto ret; - - while (m < end) - if (*m++ != 0) - goto ret; - res= 1; -ret: - return res; + uint prefix_bits= prefix_size % 32; + my_bitmap_map *word_ptr= map->bitmap, last_word; + my_bitmap_map *end_prefix= word_ptr + prefix_size / 32; + DBUG_ASSERT(word_ptr && prefix_size <= map->n_bits); + + /* 1: Words that should be filled with 1 */ + while (word_ptr < end_prefix) + if (*word_ptr++ != 0xFFFFFFFF) + return FALSE; + + last_word= *map->last_word_ptr & ~map->last_word_mask; + + /* 2: Word which contains the end of the prefix (if any) */ + if (prefix_bits) + { + if (word_ptr == map->last_word_ptr) + return uint4korr((uchar*)&last_word) == (uint32)((1 << prefix_bits) - 1); + else if (uint4korr((uchar*)word_ptr) != (uint32)((1 << prefix_bits) - 1)) + return FALSE; + word_ptr++; + } + + /* 3: Words that should be filled with 0 */ + while (word_ptr < map->last_word_ptr) + if (*word_ptr++ != 0) + return FALSE; + + /* + word_ptr will be larger than map->last_word_ptr if + prefix_size equals map->n_bits, the bitmap is filled with 1 + and prefix % 32 == 0. + */ + return word_ptr > map->last_word_ptr || last_word == 0; } @@ -288,10 +336,11 @@ my_bool bitmap_is_set_all(const MY_BITMA { my_bitmap_map *data_ptr= map->bitmap; my_bitmap_map *end= map->last_word_ptr; - *map->last_word_ptr |= map->last_word_mask; - for (; data_ptr <= end; data_ptr++) + for (; data_ptr < end; data_ptr++) if (*data_ptr != 0xFFFFFFFF) return FALSE; + if ((*map->last_word_ptr | map->last_word_mask) != 0xFFFFFFFF) + return FALSE; return TRUE; } @@ -319,14 +368,17 @@ my_bool bitmap_is_subset(const MY_BITMAP map1->n_bits==map2->n_bits); end= map1->last_word_ptr; - *map1->last_word_ptr &= ~map1->last_word_mask; - *map2->last_word_ptr &= ~map2->last_word_mask; - while (m1 <= end) + while (m1 < end) { if ((*m1++) & ~(*m2++)) - return 0; + return FALSE; } - return 1; + + if ((*map1->last_word_ptr & ~map1->last_word_mask) & + ~(*map2->last_word_ptr & ~map2->last_word_mask)) + return FALSE; + + return TRUE; } /* True if bitmaps has any common bits */ @@ -339,14 +391,17 @@ my_bool bitmap_is_overlapping(const MY_B map1->n_bits==map2->n_bits); end= map1->last_word_ptr; - *map1->last_word_ptr &= ~map1->last_word_mask; - *map2->last_word_ptr &= ~map2->last_word_mask; - while (m1 <= end) + while (m1 < end) { if ((*m1++) & (*m2++)) - return 1; + return TRUE; } - return 0; + + if ((*map1->last_word_ptr & ~map1->last_word_mask) & + (*map2->last_word_ptr & ~map2->last_word_mask)) + return TRUE; + + return FALSE; } @@ -358,10 +413,12 @@ void bitmap_intersect(MY_BITMAP *map, co DBUG_ASSERT(map->bitmap && map2->bitmap); end= to+min(len,len2); - *map2->last_word_ptr&= ~map2->last_word_mask; /*Clear last bits in map2*/ while (to < end) *to++ &= *from++; + if (len >= len2) + map->bitmap[len2 - 1] &= ~map2->last_word_mask; + if (len2 < len) { end+=len-len2; @@ -451,15 +508,16 @@ void bitmap_invert(MY_BITMAP *map) uint bitmap_bits_set(const MY_BITMAP *map) -{ - uchar *m= (uchar*)map->bitmap; - uchar *end= m + no_bytes_in_map(map); +{ + my_bitmap_map *data_ptr= map->bitmap; + my_bitmap_map *end= map->last_word_ptr; uint res= 0; DBUG_ASSERT(map->bitmap); - *map->last_word_ptr&= ~map->last_word_mask; /*Reset last bits to zero*/ - while (m < end) - res+= my_count_bits_ushort(*m++); + while (data_ptr < end) + res+= my_count_bits_uint32(*data_ptr++); + /*Reset last bits to zero*/ + res+= my_count_bits_uint32(*map->last_word_ptr & ~map->last_word_mask); return res; } @@ -478,65 +536,33 @@ void bitmap_copy(MY_BITMAP *map, const M uint bitmap_get_first_set(const MY_BITMAP *map) { - uchar *byte_ptr; - uint i,j,k; + uint word_pos; my_bitmap_map *data_ptr, *end= map->last_word_ptr; DBUG_ASSERT(map->bitmap); data_ptr= map->bitmap; - *map->last_word_ptr &= ~map->last_word_mask; - for (i=0; data_ptr <= end; data_ptr++, i++) - { + for (word_pos=0; data_ptr < end; data_ptr++, word_pos++) if (*data_ptr) - { - byte_ptr= (uchar*)data_ptr; - for (j=0; ; j++, byte_ptr++) - { - if (*byte_ptr) - { - for (k=0; ; k++) - { - if (*byte_ptr & (1 << k)) - return (i*32) + (j*8) + k; - } - } - } - } - } - return MY_BIT_NONE; + return get_first_set(*data_ptr, word_pos); + + return get_first_set(*map->last_word_ptr & ~map->last_word_mask, word_pos); } uint bitmap_get_first(const MY_BITMAP *map) { - uchar *byte_ptr; - uint i,j,k; + uint word_pos; my_bitmap_map *data_ptr, *end= map->last_word_ptr; DBUG_ASSERT(map->bitmap); data_ptr= map->bitmap; - *map->last_word_ptr|= map->last_word_mask; - for (i=0; data_ptr <= end; data_ptr++, i++) - { + for (word_pos=0; data_ptr < end; data_ptr++, word_pos++) if (*data_ptr != 0xFFFFFFFF) - { - byte_ptr= (uchar*)data_ptr; - for (j=0; ; j++, byte_ptr++) - { - if (*byte_ptr != 0xFF) - { - for (k=0; ; k++) - { - if (!(*byte_ptr & (1 << k))) - return (i*32) + (j*8) + k; - } - } - } - } - } - return MY_BIT_NONE; + return get_first(*data_ptr, word_pos); + + return get_first(*map->last_word_ptr | map->last_word_mask, word_pos); } @@ -557,376 +583,3 @@ void bitmap_lock_clear_bit(MY_BITMAP *ma bitmap_clear_bit(map, bitmap_bit); bitmap_unlock(map); } - -#ifdef MAIN - -uint get_rand_bit(uint bitsize) -{ - return (rand() % bitsize); -} - -bool test_set_get_clear_bit(MY_BITMAP *map, uint bitsize) -{ - uint i, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit= get_rand_bit(bitsize); - bitmap_set_bit(map, test_bit); - if (!bitmap_is_set(map, test_bit)) - goto error1; - bitmap_clear_bit(map, test_bit); - if (bitmap_is_set(map, test_bit)) - goto error2; - } - return FALSE; -error1: - printf("Error in set bit, bit %u, bitsize = %u", test_bit, bitsize); - return TRUE; -error2: - printf("Error in clear bit, bit %u, bitsize = %u", test_bit, bitsize); - return TRUE; -} - -bool test_flip_bit(MY_BITMAP *map, uint bitsize) -{ - uint i, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit= get_rand_bit(bitsize); - bitmap_flip_bit(map, test_bit); - if (!bitmap_is_set(map, test_bit)) - goto error1; - bitmap_flip_bit(map, test_bit); - if (bitmap_is_set(map, test_bit)) - goto error2; - } - return FALSE; -error1: - printf("Error in flip bit 1, bit %u, bitsize = %u", test_bit, bitsize); - return TRUE; -error2: - printf("Error in flip bit 2, bit %u, bitsize = %u", test_bit, bitsize); - return TRUE; -} - -bool test_operators(MY_BITMAP *map __attribute__((unused)), - uint bitsize __attribute__((unused))) -{ - return FALSE; -} - -bool test_get_all_bits(MY_BITMAP *map, uint bitsize) -{ - uint i; - bitmap_set_all(map); - if (!bitmap_is_set_all(map)) - goto error1; - if (!bitmap_is_prefix(map, bitsize)) - goto error5; - bitmap_clear_all(map); - if (!bitmap_is_clear_all(map)) - goto error2; - if (!bitmap_is_prefix(map, 0)) - goto error6; - for (i=0; i 128 ? 128 : bitsize; - MY_BITMAP map2_obj, map3_obj; - MY_BITMAP *map2= &map2_obj, *map3= &map3_obj; - my_bitmap_map map2buf[1024]; - my_bitmap_map map3buf[1024]; - bitmap_init(&map2_obj, map2buf, bitsize, FALSE); - bitmap_init(&map3_obj, map3buf, bitsize, FALSE); - bitmap_clear_all(map2); - bitmap_clear_all(map3); - for (i=0; i < no_loops; i++) - { - test_bit1=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit1); - test_bit2=get_rand_bit(bitsize); - bitmap_set_prefix(map2, test_bit2); - bitmap_intersect(map, map2); - test_bit3= test_bit2 < test_bit1 ? test_bit2 : test_bit1; - bitmap_set_prefix(map3, test_bit3); - if (!bitmap_cmp(map, map3)) - goto error1; - bitmap_clear_all(map); - bitmap_clear_all(map2); - bitmap_clear_all(map3); - test_bit1=get_rand_bit(bitsize); - test_bit2=get_rand_bit(bitsize); - test_bit3=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit1); - bitmap_set_prefix(map2, test_bit2); - test_bit3= test_bit2 > test_bit1 ? test_bit2 : test_bit1; - bitmap_set_prefix(map3, test_bit3); - bitmap_union(map, map2); - if (!bitmap_cmp(map, map3)) - goto error2; - bitmap_clear_all(map); - bitmap_clear_all(map2); - bitmap_clear_all(map3); - test_bit1=get_rand_bit(bitsize); - test_bit2=get_rand_bit(bitsize); - test_bit3=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit1); - bitmap_set_prefix(map2, test_bit2); - bitmap_xor(map, map2); - test_bit3= test_bit2 > test_bit1 ? test_bit2 : test_bit1; - test_bit4= test_bit2 < test_bit1 ? test_bit2 : test_bit1; - bitmap_set_prefix(map3, test_bit3); - for (j=0; j < test_bit4; j++) - bitmap_clear_bit(map3, j); - if (!bitmap_cmp(map, map3)) - goto error3; - bitmap_clear_all(map); - bitmap_clear_all(map2); - bitmap_clear_all(map3); - test_bit1=get_rand_bit(bitsize); - test_bit2=get_rand_bit(bitsize); - test_bit3=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit1); - bitmap_set_prefix(map2, test_bit2); - bitmap_subtract(map, map2); - if (test_bit2 < test_bit1) - { - bitmap_set_prefix(map3, test_bit1); - for (j=0; j < test_bit2; j++) - bitmap_clear_bit(map3, j); - } - if (!bitmap_cmp(map, map3)) - goto error4; - bitmap_clear_all(map); - bitmap_clear_all(map2); - bitmap_clear_all(map3); - test_bit1=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit1); - bitmap_invert(map); - bitmap_set_all(map3); - for (j=0; j < test_bit1; j++) - bitmap_clear_bit(map3, j); - if (!bitmap_cmp(map, map3)) - goto error5; - bitmap_clear_all(map); - bitmap_clear_all(map3); - } - return FALSE; -error1: - printf("intersect error bitsize=%u,size1=%u,size2=%u", bitsize, - test_bit1,test_bit2); - return TRUE; -error2: - printf("union error bitsize=%u,size1=%u,size2=%u", bitsize, - test_bit1,test_bit2); - return TRUE; -error3: - printf("xor error bitsize=%u,size1=%u,size2=%u", bitsize, - test_bit1,test_bit2); - return TRUE; -error4: - printf("subtract error bitsize=%u,size1=%u,size2=%u", bitsize, - test_bit1,test_bit2); - return TRUE; -error5: - printf("invert error bitsize=%u,size=%u", bitsize, - test_bit1); - return TRUE; -} - -bool test_count_bits_set(MY_BITMAP *map, uint bitsize) -{ - uint i, bit_count=0, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit=get_rand_bit(bitsize); - if (!bitmap_is_set(map, test_bit)) - { - bitmap_set_bit(map, test_bit); - bit_count++; - } - } - if (bit_count==0 && bitsize > 0) - goto error1; - if (bitmap_bits_set(map) != bit_count) - goto error2; - return FALSE; -error1: - printf("No bits set bitsize = %u", bitsize); - return TRUE; -error2: - printf("Wrong count of bits set, bitsize = %u", bitsize); - return TRUE; -} - -bool test_get_first_bit(MY_BITMAP *map, uint bitsize) -{ - uint i, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit=get_rand_bit(bitsize); - bitmap_set_bit(map, test_bit); - if (bitmap_get_first_set(map) != test_bit) - goto error1; - bitmap_set_all(map); - bitmap_clear_bit(map, test_bit); - if (bitmap_get_first(map) != test_bit) - goto error2; - bitmap_clear_all(map); - } - return FALSE; -error1: - printf("get_first_set error bitsize=%u,prefix_size=%u",bitsize,test_bit); - return TRUE; -error2: - printf("get_first error bitsize= %u, prefix_size= %u",bitsize,test_bit); - return TRUE; -} - -bool test_get_next_bit(MY_BITMAP *map, uint bitsize) -{ - uint i, j, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit=get_rand_bit(bitsize); - for (j=0; j < test_bit; j++) - bitmap_set_next(map); - if (!bitmap_is_prefix(map, test_bit)) - goto error1; - bitmap_clear_all(map); - } - return FALSE; -error1: - printf("get_next error bitsize= %u, prefix_size= %u", bitsize,test_bit); - return TRUE; -} - -bool test_prefix(MY_BITMAP *map, uint bitsize) -{ - uint i, j, test_bit; - uint no_loops= bitsize > 128 ? 128 : bitsize; - for (i=0; i < no_loops; i++) - { - test_bit=get_rand_bit(bitsize); - bitmap_set_prefix(map, test_bit); - if (!bitmap_is_prefix(map, test_bit)) - goto error1; - bitmap_clear_all(map); - for (j=0; j < test_bit; j++) - bitmap_set_bit(map, j); - if (!bitmap_is_prefix(map, test_bit)) - goto error2; - bitmap_set_all(map); - for (j=bitsize - 1; ~(j-test_bit); j--) - bitmap_clear_bit(map, j); - if (!bitmap_is_prefix(map, test_bit)) - goto error3; - bitmap_clear_all(map); - } - return FALSE; -error1: - printf("prefix1 error bitsize = %u, prefix_size = %u", bitsize,test_bit); - return TRUE; -error2: - printf("prefix2 error bitsize = %u, prefix_size = %u", bitsize,test_bit); - return TRUE; -error3: - printf("prefix3 error bitsize = %u, prefix_size = %u", bitsize,test_bit); - return TRUE; -} - - -bool do_test(uint bitsize) -{ - MY_BITMAP map; - my_bitmap_map buf[1024]; - if (bitmap_init(&map, buf, bitsize, FALSE)) - { - printf("init error for bitsize %d", bitsize); - goto error; - } - if (test_set_get_clear_bit(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_flip_bit(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_operators(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_get_all_bits(&map, bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_compare_operators(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_count_bits_set(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_get_first_bit(&map,bitsize)) - goto error; - bitmap_clear_all(&map); - if (test_get_next_bit(&map,bitsize)) - goto error; - if (test_prefix(&map,bitsize)) - goto error; - return FALSE; -error: - printf("\n"); - return TRUE; -} - -int main() -{ - int i; - for (i= 1; i < 4096; i++) - { - printf("Start test for bitsize=%u\n",i); - if (do_test(i)) - return -1; - } - printf("OK\n"); - return 0; -} - -/* - In directory mysys: - make test_bitmap - will build the bitmap tests and ./test_bitmap will execute it -*/ - -#endif === modified file 'unittest/mysys/bitmap-t.c' --- a/unittest/mysys/bitmap-t.c 2008-02-18 22:29:39 +0000 +++ b/unittest/mysys/bitmap-t.c 2011-02-14 15:09:45 +0000 @@ -1,4 +1,4 @@ -/* Copyright (C) 2006 MySQL AB +/* Copyright (c) 2000, 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 @@ -24,6 +24,8 @@ #include #include +#define MAX_TESTED_BITMAP_SIZE 1024 + uint get_rand_bit(uint bitsize) { return (rand() % bitsize); @@ -75,12 +77,6 @@ error2: return TRUE; } -my_bool test_operators(MY_BITMAP *map __attribute__((unused)), - uint bitsize __attribute__((unused))) -{ - return FALSE; -} - my_bool test_get_all_bits(MY_BITMAP *map, uint bitsize) { uint i; @@ -129,8 +125,8 @@ my_bool test_compare_operators(MY_BITMAP uint no_loops= bitsize > 128 ? 128 : bitsize; MY_BITMAP map2_obj, map3_obj; MY_BITMAP *map2= &map2_obj, *map3= &map3_obj; - uint32 map2buf[1024]; - uint32 map3buf[1024]; + uint32 map2buf[MAX_TESTED_BITMAP_SIZE]; + uint32 map3buf[MAX_TESTED_BITMAP_SIZE]; bitmap_init(&map2_obj, map2buf, bitsize, FALSE); bitmap_init(&map3_obj, map3buf, bitsize, FALSE); bitmap_clear_all(map2); @@ -259,6 +255,19 @@ my_bool test_get_first_bit(MY_BITMAP *ma { uint i, test_bit; uint no_loops= bitsize > 128 ? 128 : bitsize; + + bitmap_set_all(map); + for (i=0; i < bitsize; i++) + bitmap_clear_bit(map, i); + if (bitmap_get_first_set(map) != MY_BIT_NONE) + goto error1; + bitmap_clear_all(map); + for (i=0; i < bitsize; i++) + bitmap_set_bit(map, i); + if (bitmap_get_first(map) != MY_BIT_NONE) + goto error2; + bitmap_clear_all(map); + for (i=0; i < no_loops; i++) { test_bit=get_rand_bit(bitsize); @@ -321,6 +330,24 @@ my_bool test_prefix(MY_BITMAP *map, uint goto error3; bitmap_clear_all(map); } + for (i=0; i < bitsize; i++) + { + if (bitmap_is_prefix(map, i + 1)) + goto error4; + bitmap_set_bit(map, i); + if (!bitmap_is_prefix(map, i + 1)) + goto error5; + test_bit=get_rand_bit(bitsize); + bitmap_set_bit(map, test_bit); + if (test_bit <= i && !bitmap_is_prefix(map, i + 1)) + goto error5; + else if (test_bit > i) + { + if (bitmap_is_prefix(map, i + 1)) + goto error4; + bitmap_clear_bit(map, test_bit); + } + } return FALSE; error1: diag("prefix1 error bitsize = %u, prefix_size = %u", bitsize,test_bit); @@ -331,13 +358,127 @@ error2: error3: diag("prefix3 error bitsize = %u, prefix_size = %u", bitsize,test_bit); return TRUE; +error4: + diag("prefix4 error bitsize = %u, i = %u", bitsize,i); + return TRUE; +error5: + diag("prefix5 error bitsize = %u, i = %u", bitsize,i); + return TRUE; +} + +my_bool test_compare(MY_BITMAP *map, uint bitsize) +{ + MY_BITMAP map2; + uint32 map2buf[MAX_TESTED_BITMAP_SIZE]; + uint i, test_bit; + uint no_loops= bitsize > 128 ? 128 : bitsize; + if (bitmap_init(&map2, map2buf, bitsize, FALSE)) + { + diag("init error for bitsize %d", bitsize); + return TRUE; + } + /* Test all 4 possible combinations of set/unset bits. */ + for (i=0; i < no_loops; i++) + { + test_bit=get_rand_bit(bitsize); + bitmap_clear_bit(map, test_bit); + bitmap_clear_bit(&map2, test_bit); + if (!bitmap_is_subset(map, &map2)) + goto error_is_subset; + bitmap_set_bit(map, test_bit); + if (bitmap_is_subset(map, &map2)) + goto error_is_subset; + bitmap_set_bit(&map2, test_bit); + if (!bitmap_is_subset(map, &map2)) + goto error_is_subset; + bitmap_clear_bit(map, test_bit); + if (!bitmap_is_subset(map, &map2)) + goto error_is_subset; + /* Note that test_bit is not cleared i map2. */ + } + bitmap_clear_all(map); + bitmap_clear_all(&map2); + /* Test all 4 possible combinations of set/unset bits. */ + for (i=0; i < no_loops; i++) + { + test_bit=get_rand_bit(bitsize); + if (bitmap_is_overlapping(map, &map2)) + goto error_is_overlapping; + bitmap_set_bit(map, test_bit); + if (bitmap_is_overlapping(map, &map2)) + goto error_is_overlapping; + bitmap_set_bit(&map2, test_bit); + if (!bitmap_is_overlapping(map, &map2)) + goto error_is_overlapping; + bitmap_clear_bit(map, test_bit); + if (bitmap_is_overlapping(map, &map2)) + goto error_is_overlapping; + bitmap_clear_bit(&map2, test_bit); + /* Note that test_bit is not cleared i map2. */ + } + return FALSE; +error_is_subset: + diag("is_subset error bitsize = %u", bitsize); + return TRUE; +error_is_overlapping: + diag("is_overlapping error bitsize = %u", bitsize); + return TRUE; } +my_bool test_intersect(MY_BITMAP *map, uint bitsize) +{ + uint bitsize2 = 1 + get_rand_bit(MAX_TESTED_BITMAP_SIZE - 1); + MY_BITMAP map2; + uint32 map2buf[bitsize2]; + uint i, test_bit1, test_bit2, test_bit3; + if (bitmap_init(&map2, map2buf, bitsize2, FALSE)) + { + diag("init error for bitsize %d", bitsize2); + return TRUE; + } + test_bit1= get_rand_bit(bitsize); + test_bit2= get_rand_bit(bitsize); + bitmap_set_bit(map, test_bit1); + bitmap_set_bit(map, test_bit2); + test_bit3= get_rand_bit(bitsize2); + bitmap_set_bit(&map2, test_bit3); + if (test_bit2 < bitsize2) + bitmap_set_bit(&map2, test_bit2); + + bitmap_intersect(map, &map2); + if (test_bit2 < bitsize2) + { + if (!bitmap_is_set(map, test_bit2)) + goto error; + bitmap_clear_bit(map, test_bit2); + } + if (test_bit1 == test_bit3) + { + if (!bitmap_is_set(map, test_bit1)) + goto error; + bitmap_clear_bit(map, test_bit1); + } + if (!bitmap_is_clear_all(map)) + goto error; + + bitmap_set_all(map); + bitmap_set_all(&map2); + for (i=0; i < bitsize2; i++) + bitmap_clear_bit(&map2, i); + bitmap_intersect(map, &map2); + if (!bitmap_is_clear_all(map)) + goto error; + return FALSE; +error: + diag("intersect error bitsize = %u, bit1 = %u, bit2 = %u, bit3 = %u", + bitsize, test_bit1, test_bit2, test_bit3); + return TRUE; +} my_bool do_test(uint bitsize) { MY_BITMAP map; - uint32 buf[1024]; + uint32 buf[MAX_TESTED_BITMAP_SIZE]; if (bitmap_init(&map, buf, bitsize, FALSE)) { diag("init error for bitsize %d", bitsize); @@ -349,9 +490,6 @@ my_bool do_test(uint bitsize) if (test_flip_bit(&map,bitsize)) goto error; bitmap_clear_all(&map); - if (test_operators(&map,bitsize)) - goto error; - bitmap_clear_all(&map); if (test_get_all_bits(&map, bitsize)) goto error; bitmap_clear_all(&map); @@ -366,8 +504,15 @@ my_bool do_test(uint bitsize) bitmap_clear_all(&map); if (test_get_next_bit(&map,bitsize)) goto error; + bitmap_clear_all(&map); if (test_prefix(&map,bitsize)) goto error; + bitmap_clear_all(&map); + if (test_compare(&map,bitsize)) + goto error; + bitmap_clear_all(&map); + if (test_intersect(&map,bitsize)) + goto error; return FALSE; error: return TRUE; @@ -377,7 +522,7 @@ int main() { int i; int const min_size = 1; - int const max_size = 1024; + int const max_size = MAX_TESTED_BITMAP_SIZE; MY_INIT("bitmap-t"); plan(max_size - min_size); --===============3587518846231186990== MIME-Version: 1.0 Content-Type: text/bzr-bundle; charset="us-ascii"; name="bzr/jon.hauglid@stripped" Content-Transfer-Encoding: 7bit Content-Disposition: inline # Bazaar merge directive format 2 (Bazaar 0.90) # revision_id: jon.hauglid@stripped # target_branch: file:///export/home/x/mysql-5.5-bug43152/ # testament_sha1: 28ac1be4c9ff491daa546b102c80f839e7af035e # timestamp: 2011-02-14 16:09:47 +0100 # base_revision_id: jon.hauglid@stripped\ # i40ch7exris42tzh # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWed81AoAC4p/gF0QAgB7//// //fe+v////9gF058rkqPZoNhd3kve70utbZ7u7YlUAzd07qZi7uNHLqzuurtjVO23ZrlWtjVqRlR VVAlsJQkUQRiCbUxqYRkam0U9T0wU8Uw1PSeiep6JoGmRoHqBKJoAmgQCmCbKaBT01Ho1Ho1PUAA AyMj1AMRPU0yJPSekmjI0AAAABkAAAAAABISEJPQjKE8Ep5qnhTxQ8oaepkNGgfqj1Gjym1ADygc GQaNAGTTENNBkGIYQNAaMTEaAAASJBAE0ApmibQFHlGqftVP9VPU/SnkQ0eo9TyCNGCHpBOCJmCX ewBcYxRXjZn1GaTKoqDNvQQRIH7vRnmdjZYnU9JCOMpojG8OOU/f/z3e03/X9oJzamzkK1g2k22v iMgmQaZCKMc9zRRTfhEk13OZJCbKt7yKeUL4s+ZcrHhios2nGYas1m7uiFNlGxo/oRSEfDpJFZ/T YQG3fZWYWVwkqPFphSIZaqLpoyyUzZnRkcBFs3THCYuu9siT5PS76afDZONKtMZdy4dkxIwGBraG 1DP+aQiTtmHB2KfYYuSzrH3uO2EI4IotNkmeOkUOFZ0Z6qS54RzfpgmTvpv3wnbs6Xp8cff1aKnB DkgIJsVBBBMUEkmDOiDPfBNJYIiAQNoE2AWtAmds4hnf+7+eC8RFCxB/B/t4CO5C3NGBSxkhGJBv C3awl9ZQF4KBTIwUZkYmRH/hNxHbXveTPin4GMblcbwZdZBy7tWSX9YeXeBoxIM1t2EBnVpA7uGf THu8suqlcQoDdae9VH7YUKOS/w9GcJma50c9YvZvXgwWlbTZbiHMLzwMXHmZMbpSLvo4c5B8j4dk obV2KjLBQbV2xmvBH3x9Jq/SnmtNRYOQf8Bo/JAUnVmUAgJATQa5q02KkHrMkWnRWRwD1N4PMKsV MpyKBd4oIDnv/jnBQdLIG+kittKWy5fksvP9X7IDidQfPBaIu/ZLysqZZsI/1Wdh5qkD86+zIMjM dQ8tdvgt92TxZzUQ8dR6ESSn1cH+5HzrJU7AkQbdp8WjIcEot9ooUgrBKRXSBy+T8/5dhuXoeB6k jjkGrXBqa2pJwTZzJo5SLRPAgfBrKy63b/1qC8vKH5SNzNtxpfEE5cfdvrInQxFwKYoiNaTpg/P0 gyBFI2asjJ/fULHiyekZpFxBTlfEjXQjG2IG/kXkMfLoUp11XjtrwDeJkz4QEhYGL0BWtDxpbDkM ExGLOliQqvJBALRA5yJEIwRfslfUBAnFKpYcxEePUfOMdgXwvNw7VnarnxXPuIahXMm73A6uGo3J 6VXxGF5jx65sPLO55zfL1Vn4Um0cge5fGZM1VzH6dvv/7EmCmal+lt8QZwBihsCQb98tpyponkhP B/is/fkzHo52pCZQwANFEXe5HLA2StsAxo2QKWU0znax5zxjVUjFJDoChHA0ITmcmqyFJXPRrcKG GbUk2huDxHuNRqhjZBpY03Zkz1z39/Rni35X3aeCTPW5FlZo23XTGw0EzfrjSJ6rNZiIxQxHJK/2 xAabFg4eCGH1buTIZj/YdZ1QCbp3N7e22DrAnZgQwGMCvtYBhY2I0SogAxjEQXTERpS2rn1wQgcw qcifRM/FxIbvbX/33/jUJjpg4QmJoQzBLEIF9wMA8in1tB+TaugbyqQI5muSw88AmfrMIYbss8nu 0w8J+uKFJLCR0DD1W4rlY7ycXiyJezgKNtVPuUKFD0hLThySsy1xZHjB6AClGuRtTHOMEgCgb+Vx RKJTNrhhGCEzRbpMocrmmOZuiRKk4gnR7PT02f5Ao4h1o9WjQKbgkNNDGxDDlGIYlhXNyZCJwapE PX4uXgI/X71H6C6VNvD5BwCfxWRkvVp6jIKDvYMxcNsYFukSZeQpX9ToVLDqLzOhQ2hbpjzPUaa3 /WIMz11vObXRpqKJsIQikgscV6+dfJuXc0VcPGaYHdUEsiQ07R1zwyRqQKjM6zM5yZP2sr/CJqQc GmVViWp5Ge7vWnTM2MG9EgcTXAAe2xZdiR0I9g/EhLMu2WovNEbgg2cbhaPxam0kaNLgzyPrqIzZ 3lnQUUsxKn03lgaEWEMuRJJrKlRQoip/5o0Sn57QHoKmBMzGH4POscXCAKYpLP5AswmrypsL7dC4 NTBEisAUaow5d8m2Wycl5n4TyhxOS4Rn7uuFGgMdJaK3ltyLdDaoHepJY90PGcPDczMwxwiAhIi1 J+3LOlKDCiG1ZZx2ZbVWOGMc6eF1mTFFT0irSUwOWox4LVlpdGBMBz+CPR6N1wxGPTfbRvR58Ndp THApLrkEcMi85GwK6HVJItDHJQQU15zKdsqYuN+epa6gXNcuIFtHagxtAdo2oSIIMRldrnSbQwVA I1fbC6AVXSF8fYVh2EZPvYNzQwg72nF7z0LFXvCG2PjEpdWkTvul0bqJWyfA38WuzSaOuWOq0qZm w6Das9FY4ZKTl0WPUEqNPWuNhNYjuVgL5xl8jN0a2DhheNGDN/20ln1x8XN77+pElmMzNDLUdUKq vUbRtanePK1KHixL9naZJinmSDbs0NF1oxgS5bKQifNQfjNoBt0Z4PTabConBKOSSgkU7nA3i081 nlTsiVATn2pmq6sodzW8fZB4UK3VM3dnWjYnkM0HkT/4xB2fwTjwLMi5bIXtDGHJYxwXOTuT9Jgm G228xVyYwUECtLJy6X2WxO7ORqWeLkc3wC9mON+oimSjDHWQfbjgp5pHIfzLJ4HRKapZMNz5ch1c 48iUDekiEnwE2brFlhBNSDQWcOzmTCu8yJm4uZP3F48MsVQ5E67UU6HC5Il2u03vdqtpK2UGizsh ICK5HmYrhGyiwrybsatSxn00YSwsSpY70ueyh04FS+dasurjlHymt5Vq0kdWdJumjzi1pDouVUY5 RKECm4ib67bWXfFCRiQJm4yHmEsccYKtMVuzpR9cYQqd/na4zRfYiCxJOq8Er2Yo8jjmMNNUY2Dh +sF0SReEOfX4QxhWl8nxcFLEc1WEHaEL6uIoaMuqRfKhWJm4jkq+ST0evq8H3pHupRfLrSjKtHO+ xvg+LJLDm+S2xoTymRiG15uboi50kCekB49Vl91EmZmVCPatRiNDiM1HxgwTFddV45eTukoO4YAx i3UPoYis7I3IEBqQZTVjx1/VUpV+4o/1/k5ZmCiirqFWRQJie0TQSSef5wbNMXQLG0koQmoKAD2n zJjs7AXy+6SVI+f9+3x/iVLTODuttsYM/KZJTa5jnqj/MgUuKV/xP8K0fBpjpkTboi38MJX5niks g5jd3FqCZ2MZBLVr/u2H+bg0izOAySqYYX6bOAKosUj4QfqBkDF8Qt0Bg+CeuDuhzc/VZGAe/plJ MNZrblxaOwjX+jbU3lzEXz1pX3tKaVnHHStqVqW+jBdNwiLGELa22NNklQRxvntZqYsUrNhgBPBL xD70dXD0ne8JzszfUGpJhdDAl4pdAcAwY2DGNnAkyANNttpHsQ0CaFrXKOARQzYCsaFRSGBD0GKC BexQwMkNIaLJexUGNAXm+Cz0Esy5QxQZCBCChCgZE0HaDBRhINRjgOWSdvZSg+3ZTQqDchhFJMAK sy1DoldsTYZe6PeQPtXYSnabZ7O8mkyZMyRC38IsRNmzkiIS3pAvqMGZowfiRJpsTS+wPLMgYzqm DZ+Flp6oX56yPxfoFqxCgRh9jHJxd6XtaUSthyuG+qXgKSQg/kmCS5xFoUZHY0GaQdH9hjzopInt yL4GaNttm42CCLISCXQPnSNFuR9RzhRewXXE/NmATSBlCR7u/rO4z7RxM/keTwJknHSLx52pvEPS mOnVxY6EWNMEhtA2k2gYHoGRo87bPIu3tKVwO1XKS8iXvZoFH1EbTGz/zI8wsrptDRENPwA0EEf3 MKNjfxYoz2MPKHE9B6Q0PvgIwrluDM1EEzZdJ+ZkIheGDPAIDGUlGQEjZdtLkLQNKU1UlS4TmN/D TdW/a1FZYXHf1FexqBeS4es9MeHNLKbrpE5lFyVnEkd9IMGa65qkDOuhFjCu2EE0MuolRIbbGiLx +0k3Nrvg423IKm9YrN2cphTjI6ZZg/9lKfSquiUnNG8x3cynI3HuzVwsSzO28U6YtN2IE0oCExgl xFq7x6Kw3WNWli0mQuet6NpeUmKCvGUnxaty6qzyEUdCLiJ7dEsVKTrEGO1p3y5RNz7k3VE613IL 5VAk9DKFB7qOnN4PkiUFOivKOmtZwDIfNHwtnYuxrFog+UpRWa1GLa9rtwwXxMx6KSuXBLrivIUy Hj7ujk5ECooRuV5FRJKcjqJWG0s886thcVLLDUXhmw3BBzM9sKNBXJTBCrRyXwKPEQ5l4S2ibQ4o WOCwIYSgoV2yJQc7pLRzicr4sVKtVK8L9eDa/DWaeOddVLfojkpgtWAgu2zQtcJp1RTmZzvdMMrd RVtSeEn2TElqwY4GpLgbyn5k0B1UMFmiidxsd7z1FmlibuJQWy9HZ3LoqTkbpCKisMUHUxsbE2DY Tmh0+ZoI/dmd+h5Wh4ZqYul7bV0lgkKGp4i1tADSW6jZMANCihKA1v51agjiWZ+Y0hDTGNobE33b BqEXCN/zccyKc52cSKkcQZVvJGtORfAKcQMpC4GFWewECCO4Z9o0BX2jpHasOKusoJe6gyspTaNh JhmPj2ksmZopPG0hbZuaFivGJps/ZNa1yGBjbmgMDJfA6P4sgYxgcV9Roe0H2lvI3C7UNv7T0miE TgJndCkHWI7ONemgKRJBmAQIkB5xjaD0mWeK0v6mHgeZ2UBFTBm9TRU1IbRhAlReQIaS7Bga5jZx rfFxJbmAMgghWBb+0Ogp9HdX67cfmSIAI6CB00O9nek041AYeJxNpPhA7r4gfWzlSPIC4C1SXRUD sFBsQocFM3uTXcfRtOenzIkzCqOfHS/tc7tZA9fqajRX7UQwSiDClA4+nrsrvzEmNoYLDYI1nHJN tNMGP3LIzYA2g3LmlXDs+ridJSZCIcrhQ0Ajfr1I97VkkkYBpCXPktDxcUgyQkavkeSomslcp++P VdC+44oYRyovqNnbqMmJPNtl4chozpQxZFzHKTnOCibtvaGmNg1KQi0KeS/tBSlLBa4eF4RsVgfF npBL9eHeLwGXZRI7YbxAMk4ckggRdCEYSyVCvn91vjYiq60BYd/UqSWxTncDghcDgtiD6DrjpXJw ESfOQtGHEohZt6MFS2o+1sQdJKJcjQg6R6wvQnaj3sGMRJpMaF9JRg7H/kbsoxiwgMFirLCEShuS gRQSSYrAXSoNuRyWMagKYzs3midbCO9U1+Zc1inYKoXnqg8lUxcRJG4edXMq4gUmU5zOckq5LxVE kIHQHiIjfVsG/k3zcFctUClQRJaBZ2BwpwktTjiLDAVDR9sdrLYEJoFjj/Mvow60K9NmxpposlAi TLJlEt6C9qGvQ2BGKnS1TRJpsN7RPSEXqUKm4YWrre5hh9YK4jJnIGhApCrERGAWRAtTkWpopIIG KLKzWambB+3P/h9bYxIdNkSRKmBWFZIZc+BEb6QdRVFce8dUDESW0Iknnitn/mgosZCNhpHcANLg Wmdh4Z7NtQtBMXxJhTxe1U/eFKslQ0KpnlieREVotyIF6kg2QM4eZgkmPOWgzl7m2L5bTSQe8yIk 0lcb+6CNf6TlQ75DEmjwvodBtKHmIjLsEEMSSH3pKBIFaSPogGJpkI5ms3CP9JqH4ay/6FrrmIDF GSR5wSR8B9shezyTRrtNFYgFPYC+wwojo1wuwuNA2edQnjBYF4UhoWCIIrtMkFE6cToVhqzYDQVa HbKbbSbKYMVkggj8YNIJjAYuan57Eud9gIChZ6SkN9pv7XJVItPLrEFK6NjFDqdmGt4v9H0mB05A bkIiNtvq7YRdZjuL2ukKh7LlmtRakcDcEHUADWSZUwastxlkAHUCvLr4L0kHERENg7lCPsUld2FS kzIPKla3ljg8HZWkl0sq1NdzlJtOoRRWRMlUuXpzYMY2JXGQ7v4cE2YuMM/hc0XzXiyVsCYTMYCB JtCaNveugOKoZZamQaipWM0d1KdWwMIs7YOyuhQGFiIiSi6DzaImGV1VeDwmlhXUMaG2wSYZCDpk Gtl+a6ebU8wep8skkbnHnYbfys+QOFiuDgcWq31YGEppJEBIAIxXNtWytG4J4JSJ6bhFN869a2l9 4fnwW8obtSthNsWDlRCiQrw3MWC4ZWC0xV6d8nZ2TY3ersYWCZNBzWuOrMVUwooRGNlS7pI9edsu 88ur6EzNFGhBIyEu4Q0ositWttBkDSGCC6GQCBFYRSUDxgMAMJH0cb5K+5gTCzZo1sKrZxBELt5R 2Hp16TkgGQRKx6SITYmNC8ykbppGVxijuZaUSDk0gbSbSNQwmTk1ljuzOkmSXEK64UJoY0fAtvSS RgsARjArxFF40AoUqwFdIVQg1aBEEw3ABvXWCtFDJvKqj3iKvR2q9ER9JrhQZEGtegypS6EulrIg MAWF4Be0NeQMh5+PQuO0BmXHhJCmrj3+HmTRO2fcAHOfUy9rS3naRvZvi5NnhM3Kl2ssOZJeJQN0 4tJB+/uNFMhMRndG1Wyol4df5izgqi1Fx2yA4sR71orEB7pg2xJi3jBkJOGnGtpfLtIxhJBlhlgY lo2kF4fuTSsdmIoIIjk3QiCg1pLMlumMcV3FjkLTckp7FHMXkJRWAFMsuzuUhILEZAjntZPXuEkX GtfBbvzl5QR1LsR/OSIGNMCK64Af+LuSKcKEhzvmoFA= --===============3587518846231186990==--