From: Tor Didriksen Date: November 11 2010 12:43pm Subject: bzr commit into mysql-next-mr-bugfixing branch (tor.didriksen:3236) WL#1393 List-Archive: http://lists.mysql.com/commits/123603 Message-Id: <20101111124341.750FA372E@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============6282726538553789830==" --===============6282726538553789830== MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline #At file:///export/home/didrik/repo/next-mr-opt-team-wl1393-merge/ based on revid:tor.didriksen@stripped 3236 Tor Didriksen 2010-10-21 WL#1393 Optimizing filesort with small limit Many web customers have to do "SELECT ... ORDER BY non_index_column LIMIT X", When X * is smaller than sort_buff_size we can use the following algoritm to speed up the sort: - Create a queue to hold 'limit' keys. - Scan through the table and store the first (last if DESC) keys in the queue - Return values from queue @ libmysqld/CMakeLists.txt Add Bounded_queue @ libmysqld/Makefile.am Add Bounded_queue @ mysql-test/include/order_by.inc Add new tests. @ mysql-test/include/select.inc Fix typo in bug number. @ mysql-test/r/order_by_none.result Added new tests. @ mysql-test/r/order_by_sortkey.result New test. @ mysql-test/r/select_none.result Fix typo in bug number. @ mysql-test/t/order_by_sortkey.test New test. @ mysys/CMakeLists.txt Compile standalone queues test executable. @ mysys/queues.c Fix un-maintained code: s/bool/my_bool/ @ sql/CMakeLists.txt Add Bounded_queue to gunit tests. @ sql/Makefile.am Add Bounded_queue @ sql/bounded_queue.cc Since Bounded_queue is templatized, the entire implementation must go in the .h file The free funciton get_merge_many_buffs_cost_fast is here so that we can unit test it. @ sql/bounded_queue.h This is a wrapper on top of QUEUE and the queue_xxx() functions. @ sql/filesort.cc Add support for Priority Queue sort for queries with a LIMIT. Remove dead code. @ sql/filesort.h New argument to filesort() @ sql/sql_const.h Use double, rather than int, literals (avoids lots of casting). @ sql/sql_delete.cc New argument to filesort() @ sql/sql_select.cc Handle new filesort() using priority queue: - Add some more DBUG_PRINT statements before calls to create_sort_index() - create_sort_index() can use the new PQ algorithm if (!group && tables==1) - use information from filesort() if we have OPTION_FOUND_ROWS - in end_send(): stop if we are about to read more rows than allocated by the PQ - pass OPTION_FOUND_ROWS on to filesort() for single-table queries. @ sql/sql_sort.h Rename st_sort_param/SORTPARAM to Sort_param. Add constructor. Add init() function. @ sql/sql_table.cc New argument to filesort() @ sql/sql_update.cc New argument to filesort() @ sql/uniques.cc Rename SORTPARAM to Sort_param. @ unittest/gunit/CMakeLists.txt Add gunit test for Bounded_queue @ unittest/gunit/bounded_queue-t.cc Add new unit tests for Bounded_queue and merge-cost estimation. Add performance tests for Bounded_queue. added: mysql-test/r/order_by_sortkey.result mysql-test/t/order_by_sortkey.test sql/bounded_queue.cc sql/bounded_queue.h unittest/gunit/bounded_queue-t.cc modified: libmysqld/CMakeLists.txt libmysqld/Makefile.am mysql-test/include/order_by.inc mysql-test/include/select.inc mysql-test/r/order_by_none.result mysql-test/r/select_none.result mysys/CMakeLists.txt mysys/queues.c sql/CMakeLists.txt sql/Makefile.am sql/filesort.cc sql/filesort.h sql/sql_const.h sql/sql_delete.cc sql/sql_select.cc sql/sql_sort.h sql/sql_table.cc sql/sql_update.cc sql/uniques.cc unittest/gunit/CMakeLists.txt === modified file 'libmysqld/CMakeLists.txt' --- a/libmysqld/CMakeLists.txt 2010-10-21 09:49:16 +0000 +++ b/libmysqld/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -45,6 +45,7 @@ SET(SQL_EMBEDDED_SOURCES emb_qcache.cc l ../sql-common/client_plugin.c ../sql/password.c ../sql/discover.cc ../sql/derror.cc ../sql/field.cc ../sql/field_conv.cc + ../sql/bounded_queue.cc ../sql/filesort.cc ../sql/gstream.cc ../sql/handler.cc ../sql/hash_filo.cc ../sql/hostname.cc ../sql/init.cc ../sql/item_buff.cc ../sql/item_cmpfunc.cc === modified file 'libmysqld/Makefile.am' --- a/libmysqld/Makefile.am 2010-10-21 09:49:16 +0000 +++ b/libmysqld/Makefile.am 2010-10-21 14:12:43 +0000 @@ -44,6 +44,7 @@ libmysqlsources = errmsg.c get_password. noinst_HEADERS = embedded_priv.h emb_qcache.h sqlsources = derror.cc field.cc field_conv.cc strfunc.cc filesort.cc \ + bounded_queue.cc \ ha_ndbcluster.cc ha_ndbcluster_cond.cc \ ha_ndbcluster_binlog.cc ha_partition.cc \ handler.cc sql_handler.cc \ === modified file 'mysql-test/include/order_by.inc' --- a/mysql-test/include/order_by.inc 2010-09-27 13:20:24 +0000 +++ b/mysql-test/include/order_by.inc 2010-10-21 14:12:43 +0000 @@ -1364,6 +1364,162 @@ ORDER BY t2.c LIMIT 1; DROP TABLE t1,t2,t3; +--echo # +--echo # WL#1393 - Optimizing filesort with small limit +--echo # + +CREATE TABLE t1(f0 int auto_increment primary key, f1 int, f2 varchar(200)); +INSERT INTO t1(f1, f2) VALUES +(0,"0"),(1,"1"),(2,"2"),(3,"3"),(4,"4"),(5,"5"), +(6,"6"),(7,"7"),(8,"8"),(9,"9"),(10,"10"), +(11,"11"),(12,"12"),(13,"13"),(14,"14"),(15,"15"), +(16,"16"),(17,"17"),(18,"18"),(19,"19"),(20,"20"), +(21,"21"),(22,"22"),(23,"23"),(24,"24"),(25,"25"), +(26,"26"),(27,"27"),(28,"28"),(29,"29"),(30,"30"), +(31,"31"),(32,"32"),(33,"33"),(34,"34"),(35,"35"), +(36,"36"),(37,"37"),(38,"38"),(39,"39"),(40,"40"), +(41,"41"),(42,"42"),(43,"43"),(44,"44"),(45,"45"), +(46,"46"),(47,"47"),(48,"48"),(49,"49"),(50,"50"), +(51,"51"),(52,"52"),(53,"53"),(54,"54"),(55,"55"), +(56,"56"),(57,"57"),(58,"58"),(59,"59"),(60,"60"), +(61,"61"),(62,"62"),(63,"63"),(64,"64"),(65,"65"), +(66,"66"),(67,"67"),(68,"68"),(69,"69"),(70,"70"), +(71,"71"),(72,"72"),(73,"73"),(74,"74"),(75,"75"), +(76,"76"),(77,"77"),(78,"78"),(79,"79"),(80,"80"), +(81,"81"),(82,"82"),(83,"83"),(84,"84"),(85,"85"), +(86,"86"),(87,"87"),(88,"88"),(89,"89"),(90,"90"), +(91,"91"),(92,"92"),(93,"93"),(94,"94"),(95,"95"), +(96,"96"),(97,"97"),(98,"98"),(99,"99"); + +################ +## Test sort when source data fits to memory + +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 100; +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 30; +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 0; +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 30; +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 0; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 20; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 10 OFFSET 10; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0 OFFSET 10; + +################ +## Test sort when source data does not fit to memory +set sort_buffer_size= 32768; +CREATE TEMPORARY TABLE tmp (f1 int, f2 varchar(20)); +INSERT INTO tmp SELECT f1, f2 FROM t1; +INSERT INTO t1(f1, f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1, f2 FROM t1; +INSERT INTO t1(f1, f2) SELECT * FROM tmp; + +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 30; +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 0; +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 30; +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 0; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 20; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 10 OFFSET 10; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0 OFFSET 10; + +################ +## Test with SQL_CALC_FOUND_ROWS +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 30; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 0; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 20; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 10 OFFSET 10; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0 OFFSET 10; +SELECT FOUND_ROWS(); + +################ +## Test sorting with join +## These are re-written to use PQ during execution. +set sort_buffer_size= 327680; + +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30; + +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +WHERE t1.f2>20 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +SELECT FOUND_ROWS(); + +################ +## Test views +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 30; +SELECT * FROM v1; +drop view v1; + +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 100; +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; + +CREATE VIEW v2 as SELECT * FROM t1 ORDER BY f2, f0 LIMIT 100; +SELECT * FROM v1 JOIN v2 on v1.f1=v2.f1 ORDER BY v1.f2,v1.f0,v2.f0 +LIMIT 30; + +################ +## Test group & having +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 5; + +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 0; + +################ +## Test SP +delimiter |; +CREATE PROCEDURE wl1393_sp_test() +BEGIN +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 30; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT FOUND_ROWS(); +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; +END| +CALL wl1393_sp_test()| +DROP PROCEDURE wl1393_sp_test| +delimiter ;| + +################ +## Test with subqueries +SELECT d1.* FROM t1 +LEFT JOIN (SELECT * FROM t1 LIMIT 30) d1 on t1.f1=d1.f1 +ORDER BY d1.f2 DESC LIMIT 30; + +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 1); + +--error ER_SUBQUERY_NO_1_ROW +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 2); + +DROP TABLE t1, tmp; +DROP VIEW v1, v2; + +--echo # end of WL#1393 - Optimizing filesort with small limit # # Bug#35844: Covering index for ref access not compatible with ORDER BY list === modified file 'mysql-test/include/select.inc' --- a/mysql-test/include/select.inc 2010-10-26 09:10:59 +0000 +++ b/mysql-test/include/select.inc 2010-10-21 14:12:43 +0000 @@ -4140,7 +4140,7 @@ DROP TABLE t1; --echo End of 5.1 tests --echo # ---echo # Bug#45277: Lost HAVING clause led to a wrong result. +--echo # Bug#45227: Lost HAVING clause led to a wrong result. --echo # CREATE TABLE `CC` ( `int_nokey` int(11) NOT NULL, @@ -4162,7 +4162,7 @@ SELECT `varchar_nokey` G1 FROM CC WHER HAVING G1 ORDER BY `varchar_key` LIMIT 6 ; DROP TABLE CC; ---echo # End of test#45277 +--echo # End of test#45227 --echo # --echo # Bug#54515: Crash in opt_range.cc::get_best_group_min_max on === modified file 'mysql-test/r/order_by_none.result' --- a/mysql-test/r/order_by_none.result 2010-09-27 13:20:24 +0000 +++ b/mysql-test/r/order_by_none.result 2010-10-21 14:12:43 +0000 @@ -1504,6 +1504,852 @@ ORDER BY t2.c LIMIT 1; d 52.5 DROP TABLE t1,t2,t3; +# +# WL#1393 - Optimizing filesort with small limit +# +CREATE TABLE t1(f0 int auto_increment primary key, f1 int, f2 varchar(200)); +INSERT INTO t1(f1, f2) VALUES +(0,"0"),(1,"1"),(2,"2"),(3,"3"),(4,"4"),(5,"5"), +(6,"6"),(7,"7"),(8,"8"),(9,"9"),(10,"10"), +(11,"11"),(12,"12"),(13,"13"),(14,"14"),(15,"15"), +(16,"16"),(17,"17"),(18,"18"),(19,"19"),(20,"20"), +(21,"21"),(22,"22"),(23,"23"),(24,"24"),(25,"25"), +(26,"26"),(27,"27"),(28,"28"),(29,"29"),(30,"30"), +(31,"31"),(32,"32"),(33,"33"),(34,"34"),(35,"35"), +(36,"36"),(37,"37"),(38,"38"),(39,"39"),(40,"40"), +(41,"41"),(42,"42"),(43,"43"),(44,"44"),(45,"45"), +(46,"46"),(47,"47"),(48,"48"),(49,"49"),(50,"50"), +(51,"51"),(52,"52"),(53,"53"),(54,"54"),(55,"55"), +(56,"56"),(57,"57"),(58,"58"),(59,"59"),(60,"60"), +(61,"61"),(62,"62"),(63,"63"),(64,"64"),(65,"65"), +(66,"66"),(67,"67"),(68,"68"),(69,"69"),(70,"70"), +(71,"71"),(72,"72"),(73,"73"),(74,"74"),(75,"75"), +(76,"76"),(77,"77"),(78,"78"),(79,"79"),(80,"80"), +(81,"81"),(82,"82"),(83,"83"),(84,"84"),(85,"85"), +(86,"86"),(87,"87"),(88,"88"),(89,"89"),(90,"90"), +(91,"91"),(92,"92"),(93,"93"),(94,"94"),(95,"95"), +(96,"96"),(97,"97"),(98,"98"),(99,"99"); +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 100; +f0 f1 f2 +1 0 0 +2 1 1 +3 2 2 +4 3 3 +5 4 4 +6 5 5 +7 6 6 +8 7 7 +9 8 8 +10 9 9 +11 10 10 +12 11 11 +13 12 12 +14 13 13 +15 14 14 +16 15 15 +17 16 16 +18 17 17 +19 18 18 +20 19 19 +21 20 20 +22 21 21 +23 22 22 +24 23 23 +25 24 24 +26 25 25 +27 26 26 +28 27 27 +29 28 28 +30 29 29 +31 30 30 +32 31 31 +33 32 32 +34 33 33 +35 34 34 +36 35 35 +37 36 36 +38 37 37 +39 38 38 +40 39 39 +41 40 40 +42 41 41 +43 42 42 +44 43 43 +45 44 44 +46 45 45 +47 46 46 +48 47 47 +49 48 48 +50 49 49 +51 50 50 +52 51 51 +53 52 52 +54 53 53 +55 54 54 +56 55 55 +57 56 56 +58 57 57 +59 58 58 +60 59 59 +61 60 60 +62 61 61 +63 62 62 +64 63 63 +65 64 64 +66 65 65 +67 66 66 +68 67 67 +69 68 68 +70 69 69 +71 70 70 +72 71 71 +73 72 72 +74 73 73 +75 74 74 +76 75 75 +77 76 76 +78 77 77 +79 78 78 +80 79 79 +81 80 80 +82 81 81 +83 82 82 +84 83 83 +85 84 84 +86 85 85 +87 86 86 +88 87 87 +89 88 88 +90 89 89 +91 90 90 +92 91 91 +93 92 92 +94 93 93 +95 94 94 +96 95 95 +97 96 96 +98 97 97 +99 98 98 +100 99 99 +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 30; +f0 f1 f2 +1 0 0 +2 1 1 +3 2 2 +4 3 3 +5 4 4 +6 5 5 +7 6 6 +8 7 7 +9 8 8 +10 9 9 +11 10 10 +12 11 11 +13 12 12 +14 13 13 +15 14 14 +16 15 15 +17 16 16 +18 17 17 +19 18 18 +20 19 19 +21 20 20 +22 21 21 +23 22 22 +24 23 23 +25 24 24 +26 25 25 +27 26 26 +28 27 27 +29 28 28 +30 29 29 +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 30; +f0 f1 f2 +100 99 99 +99 98 98 +98 97 97 +97 96 96 +96 95 95 +95 94 94 +94 93 93 +93 92 92 +92 91 91 +91 90 90 +10 9 9 +90 89 89 +89 88 88 +88 87 87 +87 86 86 +86 85 85 +85 84 84 +84 83 83 +83 82 82 +82 81 81 +81 80 80 +9 8 8 +80 79 79 +79 78 78 +78 77 77 +77 76 76 +76 75 75 +75 74 74 +74 73 73 +73 72 72 +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 20; +f0 f1 f2 +12 11 11 +13 12 12 +14 13 13 +15 14 14 +16 15 15 +17 16 16 +18 17 17 +19 18 18 +20 19 19 +21 20 20 +22 21 21 +23 22 22 +24 23 23 +25 24 24 +26 25 25 +27 26 26 +28 27 27 +29 28 28 +30 29 29 +31 30 30 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 10 OFFSET 10; +f0 f1 f2 +22 21 21 +23 22 22 +24 23 23 +25 24 24 +26 25 25 +27 26 26 +28 27 27 +29 28 28 +30 29 29 +31 30 30 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0 OFFSET 10; +f0 f1 f2 +set sort_buffer_size= 32768; +CREATE TEMPORARY TABLE tmp (f1 int, f2 varchar(20)); +INSERT INTO tmp SELECT f1, f2 FROM t1; +INSERT INTO t1(f1, f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1, f2 FROM t1; +INSERT INTO t1(f1, f2) SELECT * FROM tmp; +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 30; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +2 1 1 +102 1 1 +202 1 1 +302 1 1 +402 1 1 +3 2 2 +103 2 2 +203 2 2 +303 2 2 +403 2 2 +4 3 3 +104 3 3 +204 3 3 +304 3 3 +404 3 3 +5 4 4 +105 4 4 +205 4 4 +305 4 4 +405 4 4 +6 5 5 +106 5 5 +206 5 5 +306 5 5 +406 5 5 +SELECT * FROM t1 ORDER BY f1 ASC, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 30; +f0 f1 f2 +100 99 99 +200 99 99 +300 99 99 +400 99 99 +500 99 99 +99 98 98 +199 98 98 +299 98 98 +399 98 98 +499 98 98 +98 97 97 +198 97 97 +298 97 97 +398 97 97 +498 97 97 +97 96 96 +197 96 96 +297 96 96 +397 96 96 +497 96 96 +96 95 95 +196 95 95 +296 95 95 +396 95 95 +496 95 95 +95 94 94 +195 94 94 +295 94 94 +395 94 94 +495 94 94 +SELECT * FROM t1 ORDER BY f2 DESC, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 20; +f0 f1 f2 +12 11 11 +112 11 11 +212 11 11 +312 11 11 +412 11 11 +13 12 12 +113 12 12 +213 12 12 +313 12 12 +413 12 12 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0; +f0 f1 f2 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 10 OFFSET 10; +f0 f1 f2 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 0 OFFSET 10; +f0 f1 f2 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 30; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +2 1 1 +102 1 1 +202 1 1 +302 1 1 +402 1 1 +3 2 2 +103 2 2 +203 2 2 +303 2 2 +403 2 2 +4 3 3 +104 3 3 +204 3 3 +304 3 3 +404 3 3 +5 4 4 +105 4 4 +205 4 4 +305 4 4 +405 4 4 +6 5 5 +106 5 5 +206 5 5 +306 5 5 +406 5 5 +SELECT FOUND_ROWS(); +FOUND_ROWS() +500 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 0; +f0 f1 f2 +SELECT FOUND_ROWS(); +FOUND_ROWS() +500 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 20; +f0 f1 f2 +12 11 11 +112 11 11 +212 11 11 +312 11 11 +412 11 11 +13 12 12 +113 12 12 +213 12 12 +313 12 12 +413 12 12 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +SELECT FOUND_ROWS(); +FOUND_ROWS() +445 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0; +f0 f1 f2 +SELECT FOUND_ROWS(); +FOUND_ROWS() +445 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 10 OFFSET 10; +f0 f1 f2 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +SELECT FOUND_ROWS(); +FOUND_ROWS() +445 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0 OFFSET 10; +f0 f1 f2 +SELECT FOUND_ROWS(); +FOUND_ROWS() +445 +set sort_buffer_size= 327680; +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30; +f0 f1 f2 f1 f2 +1 0 0 0 0 +1 0 0 0 0 +1 0 0 0 0 +101 0 0 0 0 +101 0 0 0 0 +101 0 0 0 0 +201 0 0 0 0 +201 0 0 0 0 +201 0 0 0 0 +301 0 0 0 0 +301 0 0 0 0 +301 0 0 0 0 +401 0 0 0 0 +401 0 0 0 0 +401 0 0 0 0 +2 1 1 1 1 +2 1 1 1 1 +2 1 1 1 1 +102 1 1 1 1 +102 1 1 1 1 +102 1 1 1 1 +202 1 1 1 1 +202 1 1 1 1 +202 1 1 1 1 +302 1 1 1 1 +302 1 1 1 1 +302 1 1 1 1 +402 1 1 1 1 +402 1 1 1 1 +402 1 1 1 1 +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +f0 f1 f2 f1 f2 +3 2 2 2 2 +3 2 2 2 2 +3 2 2 2 2 +103 2 2 2 2 +103 2 2 2 2 +103 2 2 2 2 +203 2 2 2 2 +203 2 2 2 2 +203 2 2 2 2 +303 2 2 2 2 +303 2 2 2 2 +303 2 2 2 2 +403 2 2 2 2 +403 2 2 2 2 +403 2 2 2 2 +4 3 3 3 3 +4 3 3 3 3 +4 3 3 3 3 +104 3 3 3 3 +104 3 3 3 3 +104 3 3 3 3 +204 3 3 3 3 +204 3 3 3 3 +204 3 3 3 3 +304 3 3 3 3 +304 3 3 3 3 +304 3 3 3 3 +404 3 3 3 3 +404 3 3 3 3 +404 3 3 3 3 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +f0 f1 f2 f1 f2 +3 2 2 2 2 +3 2 2 2 2 +3 2 2 2 2 +103 2 2 2 2 +103 2 2 2 2 +103 2 2 2 2 +203 2 2 2 2 +203 2 2 2 2 +203 2 2 2 2 +303 2 2 2 2 +303 2 2 2 2 +303 2 2 2 2 +403 2 2 2 2 +403 2 2 2 2 +403 2 2 2 2 +4 3 3 3 3 +4 3 3 3 3 +4 3 3 3 3 +104 3 3 3 3 +104 3 3 3 3 +104 3 3 3 3 +204 3 3 3 3 +204 3 3 3 3 +204 3 3 3 3 +304 3 3 3 3 +304 3 3 3 3 +304 3 3 3 3 +404 3 3 3 3 +404 3 3 3 3 +404 3 3 3 3 +SELECT FOUND_ROWS(); +FOUND_ROWS() +1500 +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +WHERE t1.f2>20 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +f0 f1 f2 f1 f2 +24 23 23 23 23 +24 23 23 23 23 +24 23 23 23 23 +124 23 23 23 23 +124 23 23 23 23 +124 23 23 23 23 +224 23 23 23 23 +224 23 23 23 23 +224 23 23 23 23 +324 23 23 23 23 +324 23 23 23 23 +324 23 23 23 23 +424 23 23 23 23 +424 23 23 23 23 +424 23 23 23 23 +25 24 24 24 24 +25 24 24 24 24 +25 24 24 24 24 +125 24 24 24 24 +125 24 24 24 24 +125 24 24 24 24 +225 24 24 24 24 +225 24 24 24 24 +225 24 24 24 24 +325 24 24 24 24 +325 24 24 24 24 +325 24 24 24 24 +425 24 24 24 24 +425 24 24 24 24 +425 24 24 24 24 +SELECT FOUND_ROWS(); +FOUND_ROWS() +1185 +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 30; +SELECT * FROM v1; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +2 1 1 +102 1 1 +202 1 1 +302 1 1 +402 1 1 +3 2 2 +103 2 2 +203 2 2 +303 2 2 +403 2 2 +4 3 3 +104 3 3 +204 3 3 +304 3 3 +404 3 3 +5 4 4 +105 4 4 +205 4 4 +305 4 4 +405 4 4 +6 5 5 +106 5 5 +206 5 5 +306 5 5 +406 5 5 +drop view v1; +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 100; +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +2 1 1 +102 1 1 +202 1 1 +302 1 1 +402 1 1 +11 10 10 +111 10 10 +211 10 10 +311 10 10 +411 10 10 +12 11 11 +112 11 11 +212 11 11 +312 11 11 +412 11 11 +13 12 12 +113 12 12 +213 12 12 +313 12 12 +413 12 12 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +CREATE VIEW v2 as SELECT * FROM t1 ORDER BY f2, f0 LIMIT 100; +SELECT * FROM v1 JOIN v2 on v1.f1=v2.f1 ORDER BY v1.f2,v1.f0,v2.f0 +LIMIT 30; +f0 f1 f2 f0 f1 f2 +1 0 0 1 0 0 +1 0 0 101 0 0 +1 0 0 201 0 0 +1 0 0 301 0 0 +1 0 0 401 0 0 +101 0 0 1 0 0 +101 0 0 101 0 0 +101 0 0 201 0 0 +101 0 0 301 0 0 +101 0 0 401 0 0 +201 0 0 1 0 0 +201 0 0 101 0 0 +201 0 0 201 0 0 +201 0 0 301 0 0 +201 0 0 401 0 0 +301 0 0 1 0 0 +301 0 0 101 0 0 +301 0 0 201 0 0 +301 0 0 301 0 0 +301 0 0 401 0 0 +401 0 0 1 0 0 +401 0 0 101 0 0 +401 0 0 201 0 0 +401 0 0 301 0 0 +401 0 0 401 0 0 +2 1 1 2 1 1 +2 1 1 102 1 1 +2 1 1 202 1 1 +2 1 1 302 1 1 +2 1 1 402 1 1 +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 5; +f3 count(f2) +0 50 +1 50 +2 50 +3 50 +4 50 +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 0; +f3 count(f2) +CREATE PROCEDURE wl1393_sp_test() +BEGIN +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 30; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT FOUND_ROWS(); +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; +END| +CALL wl1393_sp_test()| +f0 f1 f2 +12 11 11 +112 11 11 +212 11 11 +312 11 11 +412 11 11 +13 12 12 +113 12 12 +213 12 12 +313 12 12 +413 12 12 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +16 15 15 +116 15 15 +216 15 15 +316 15 15 +416 15 15 +17 16 16 +117 16 16 +217 16 16 +317 16 16 +417 16 16 +f0 f1 f2 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +16 15 15 +116 15 15 +216 15 15 +316 15 15 +416 15 15 +17 16 16 +117 16 16 +217 16 16 +317 16 16 +417 16 16 +f0 f1 f2 +15 14 14 +115 14 14 +215 14 14 +315 14 14 +415 14 14 +16 15 15 +116 15 15 +216 15 15 +316 15 15 +416 15 15 +17 16 16 +117 16 16 +217 16 16 +317 16 16 +417 16 16 +FOUND_ROWS() +445 +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +2 1 1 +102 1 1 +202 1 1 +302 1 1 +402 1 1 +11 10 10 +111 10 10 +211 10 10 +311 10 10 +411 10 10 +12 11 11 +112 11 11 +212 11 11 +312 11 11 +412 11 11 +13 12 12 +113 12 12 +213 12 12 +313 12 12 +413 12 12 +14 13 13 +114 13 13 +214 13 13 +314 13 13 +414 13 13 +DROP PROCEDURE wl1393_sp_test| +SELECT d1.* FROM t1 +LEFT JOIN (SELECT * FROM t1 LIMIT 30) d1 on t1.f1=d1.f1 +ORDER BY d1.f2 DESC LIMIT 30; +f0 f1 f2 +10 9 9 +10 9 9 +10 9 9 +10 9 9 +10 9 9 +9 8 8 +9 8 8 +9 8 8 +9 8 8 +9 8 8 +8 7 7 +8 7 7 +8 7 7 +8 7 7 +8 7 7 +7 6 6 +7 6 6 +7 6 6 +7 6 6 +7 6 6 +6 5 5 +6 5 5 +6 5 5 +6 5 5 +6 5 5 +5 4 4 +5 4 4 +5 4 4 +5 4 4 +5 4 4 +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 1); +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 2); +ERROR 21000: Subquery returns more than 1 row +DROP TABLE t1, tmp; +DROP VIEW v1, v2; +# end of WL#1393 - Optimizing filesort with small limit CREATE TABLE t1 ( id1 INT NULL, id2 INT NOT NULL, === added file 'mysql-test/r/order_by_sortkey.result' --- a/mysql-test/r/order_by_sortkey.result 1970-01-01 00:00:00 +0000 +++ b/mysql-test/r/order_by_sortkey.result 2010-10-21 14:12:43 +0000 @@ -0,0 +1,161 @@ +CREATE TABLE t1( +f0 int auto_increment PRIMARY KEY, +f1 int, +f2 varchar(200) +) ENGINE=MyISAM; +INSERT INTO t1(f1, f2) VALUES +(0,"0"),(1,"1"),(2,"2"),(3,"3"),(4,"4"),(5,"5"), +(6,"6"),(7,"7"),(8,"8"),(9,"9"),(10,"10"), +(11,"11"),(12,"12"),(13,"13"),(14,"14"),(15,"15"), +(16,"16"),(17,"17"),(18,"18"),(19,"19"),(20,"20"), +(21,"21"),(22,"22"),(23,"23"),(24,"24"),(25,"25"), +(26,"26"),(27,"27"),(28,"28"),(29,"29"),(30,"30"), +(31,"31"),(32,"32"),(33,"33"),(34,"34"),(35,"35"), +(36,"36"),(37,"37"),(38,"38"),(39,"39"),(40,"40"), +(41,"41"),(42,"42"),(43,"43"),(44,"44"),(45,"45"), +(46,"46"),(47,"47"),(48,"48"),(49,"49"),(50,"50"), +(51,"51"),(52,"52"),(53,"53"),(54,"54"),(55,"55"), +(56,"56"),(57,"57"),(58,"58"),(59,"59"),(60,"60"), +(61,"61"),(62,"62"),(63,"63"),(64,"64"),(65,"65"), +(66,"66"),(67,"67"),(68,"68"),(69,"69"),(70,"70"), +(71,"71"),(72,"72"),(73,"73"),(74,"74"),(75,"75"), +(76,"76"),(77,"77"),(78,"78"),(79,"79"),(80,"80"), +(81,"81"),(82,"82"),(83,"83"),(84,"84"),(85,"85"), +(86,"86"),(87,"87"),(88,"88"),(89,"89"),(90,"90"), +(91,"91"),(92,"92"),(93,"93"),(94,"94"),(95,"95"), +(96,"96"),(97,"97"),(98,"98"),(99,"99"); +CREATE TEMPORARY TABLE tmp (f1 int, f2 varchar(20)); +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +set sort_buffer_size= 32768; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +FLUSH STATUS; +SHOW SESSION STATUS LIKE 'Sort%'; +Variable_name Value +Sort_merge_passes 0 +Sort_range 0 +Sort_rows 0 +Sort_scan 0 +SELECT * FROM t1 ORDER BY f2 LIMIT 100; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +501 0 0 +601 0 0 +701 0 0 +801 0 0 +901 0 0 +1001 0 0 +1101 0 0 +1201 0 0 +1301 0 0 +1401 0 0 +1501 0 0 +1601 0 0 +1701 0 0 +1801 0 0 +1901 0 0 +2001 0 0 +2101 0 0 +2201 0 0 +2301 0 0 +2401 0 0 +2501 0 0 +2601 0 0 +2701 0 0 +2801 0 0 +2901 0 0 +3001 0 0 +3101 0 0 +3201 0 0 +3301 0 0 +3401 0 0 +3501 0 0 +3601 0 0 +3701 0 0 +3801 0 0 +3901 0 0 +4001 0 0 +4101 0 0 +4201 0 0 +4301 0 0 +4401 0 0 +4501 0 0 +4601 0 0 +4701 0 0 +4801 0 0 +4901 0 0 +5001 0 0 +5101 0 0 +5201 0 0 +5301 0 0 +5401 0 0 +5501 0 0 +5601 0 0 +5701 0 0 +5801 0 0 +5901 0 0 +6001 0 0 +6101 0 0 +6201 0 0 +6301 0 0 +6401 0 0 +6501 0 0 +6601 0 0 +6701 0 0 +6801 0 0 +6901 0 0 +7001 0 0 +7101 0 0 +7201 0 0 +7301 0 0 +7401 0 0 +7501 0 0 +7601 0 0 +7701 0 0 +7801 0 0 +7901 0 0 +8001 0 0 +8101 0 0 +8201 0 0 +8301 0 0 +8401 0 0 +8501 0 0 +8601 0 0 +8701 0 0 +8801 0 0 +8901 0 0 +9001 0 0 +9101 0 0 +9201 0 0 +9301 0 0 +9401 0 0 +9501 0 0 +9601 0 0 +9701 0 0 +9801 0 0 +9901 0 0 +SHOW SESSION STATUS LIKE 'Sort%'; +Variable_name Value +Sort_merge_passes 0 +Sort_range 0 +Sort_rows 100 +Sort_scan 1 +DROP TABLE t1, tmp; === modified file 'mysql-test/r/select_none.result' --- a/mysql-test/r/select_none.result 2010-10-26 09:10:59 +0000 +++ b/mysql-test/r/select_none.result 2010-10-21 14:12:43 +0000 @@ -4875,7 +4875,7 @@ SELECT 1 FROM t1 ORDER BY a COLLATE lati DROP TABLE t1; End of 5.1 tests # -# Bug#45277: Lost HAVING clause led to a wrong result. +# Bug#45227: Lost HAVING clause led to a wrong result. # CREATE TABLE `CC` ( `int_nokey` int(11) NOT NULL, @@ -4904,7 +4904,7 @@ Warning 1292 Truncated incorrect DOUBLE Warning 1292 Truncated incorrect DOUBLE value: 'm' Warning 1292 Truncated incorrect DOUBLE value: 'j' DROP TABLE CC; -# End of test#45277 +# End of test#45227 # # Bug#54515: Crash in opt_range.cc::get_best_group_min_max on # SELECT from VIEW with GROUP BY === added file 'mysql-test/t/order_by_sortkey.test' --- a/mysql-test/t/order_by_sortkey.test 1970-01-01 00:00:00 +0000 +++ b/mysql-test/t/order_by_sortkey.test 2010-10-21 14:12:43 +0000 @@ -0,0 +1,64 @@ +# +# WL#1393 - ORDER BY with LIMIT tests +# +# A big test in a separate file, so that we can run the original +# order_by test with --debug without timeout. +# +CREATE TABLE t1( + f0 int auto_increment PRIMARY KEY, + f1 int, + f2 varchar(200) +) ENGINE=MyISAM; + +INSERT INTO t1(f1, f2) VALUES +(0,"0"),(1,"1"),(2,"2"),(3,"3"),(4,"4"),(5,"5"), +(6,"6"),(7,"7"),(8,"8"),(9,"9"),(10,"10"), +(11,"11"),(12,"12"),(13,"13"),(14,"14"),(15,"15"), +(16,"16"),(17,"17"),(18,"18"),(19,"19"),(20,"20"), +(21,"21"),(22,"22"),(23,"23"),(24,"24"),(25,"25"), +(26,"26"),(27,"27"),(28,"28"),(29,"29"),(30,"30"), +(31,"31"),(32,"32"),(33,"33"),(34,"34"),(35,"35"), +(36,"36"),(37,"37"),(38,"38"),(39,"39"),(40,"40"), +(41,"41"),(42,"42"),(43,"43"),(44,"44"),(45,"45"), +(46,"46"),(47,"47"),(48,"48"),(49,"49"),(50,"50"), +(51,"51"),(52,"52"),(53,"53"),(54,"54"),(55,"55"), +(56,"56"),(57,"57"),(58,"58"),(59,"59"),(60,"60"), +(61,"61"),(62,"62"),(63,"63"),(64,"64"),(65,"65"), +(66,"66"),(67,"67"),(68,"68"),(69,"69"),(70,"70"), +(71,"71"),(72,"72"),(73,"73"),(74,"74"),(75,"75"), +(76,"76"),(77,"77"),(78,"78"),(79,"79"),(80,"80"), +(81,"81"),(82,"82"),(83,"83"),(84,"84"),(85,"85"), +(86,"86"),(87,"87"),(88,"88"),(89,"89"),(90,"90"), +(91,"91"),(92,"92"),(93,"93"),(94,"94"),(95,"95"), +(96,"96"),(97,"97"),(98,"98"),(99,"99"); + +CREATE TEMPORARY TABLE tmp (f1 int, f2 varchar(20)); +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; + +# Test when only sortkeys fits to memory +set sort_buffer_size= 32768; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; +INSERT INTO tmp SELECT f1,f2 FROM t1; +INSERT INTO t1(f1,f2) SELECT * FROM tmp; + +FLUSH STATUS; +SHOW SESSION STATUS LIKE 'Sort%'; + +SELECT * FROM t1 ORDER BY f2 LIMIT 100; + +SHOW SESSION STATUS LIKE 'Sort%'; + +DROP TABLE t1, tmp; === modified file 'mysys/CMakeLists.txt' --- a/mysys/CMakeLists.txt 2010-08-12 15:27:53 +0000 +++ b/mysys/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -77,3 +77,8 @@ DTRACE_INSTRUMENT(mysys) ADD_EXECUTABLE(thr_lock thr_lock.c) TARGET_LINK_LIBRARIES(thr_lock mysys) SET_TARGET_PROPERTIES(thr_lock PROPERTIES COMPILE_FLAGS "-DMAIN") + +ADD_EXECUTABLE(queues queues.c) +TARGET_LINK_LIBRARIES(queues mysys) +SET_TARGET_PROPERTIES(queues PROPERTIES COMPILE_FLAGS "-DMAIN") +ADD_TEST(queues_test queues) === modified file 'mysys/queues.c' --- a/mysys/queues.c 2010-07-08 21:20:08 +0000 +++ b/mysys/queues.c 2010-10-21 14:12:43 +0000 @@ -381,11 +381,11 @@ static uint tot_no_parts= 0; static uint tot_no_loops= 0; static uint expected_part= 0; static uint expected_num= 0; -static bool max_ind= 0; -static bool fix_used= 0; +static my_bool max_ind= 0; +static my_bool fix_used= 0; static ulonglong start_time= 0; -static bool is_divisible_by(uint num, uint divisor) +static my_bool is_divisible_by(uint num, uint divisor) { uint quotient= num / divisor; if (quotient * divisor == num) @@ -492,7 +492,7 @@ static int test_compare(void *null_arg, return 0; } -bool check_num(uint num_part) +my_bool check_num(uint num_part) { uint part= num_part >> 22; uint num= num_part & 0x3FFFFF; @@ -543,7 +543,7 @@ void perform_insert(QUEUE *queue) } } -bool perform_ins_del(QUEUE *queue, bool max_ind) +my_bool perform_ins_del(QUEUE *queue, my_bool max_ind) { uint i= 0, no_loops= tot_no_loops, j= tot_no_parts; do @@ -571,10 +571,10 @@ bool perform_ins_del(QUEUE *queue, bool return FALSE; } -bool do_test(uint no_parts, uint l_max_ind, bool l_fix_used) +my_bool do_test(uint no_parts, uint l_max_ind, my_bool l_fix_used) { QUEUE queue; - bool result; + my_bool result; max_ind= l_max_ind; fix_used= l_fix_used; init_queue(&queue, no_parts, 0, max_ind, test_compare, NULL); === modified file 'sql/CMakeLists.txt' --- a/sql/CMakeLists.txt 2010-10-21 12:18:25 +0000 +++ b/sql/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -40,6 +40,7 @@ ENDIF() SET (SQL_SOURCE ../sql-common/client.c derror.cc des_key_file.cc discover.cc ../libmysql/errmsg.c field.cc field_conv.cc + bounded_queue.cc filesort.cc gstream.cc sha2.cc handler.cc hash_filo.h sql_plugin_services.h hostname.cc init.cc item.cc item_buff.cc item_cmpfunc.cc @@ -108,7 +109,8 @@ SET (SLAVE_SOURCE rpl_slave.cc rpl_repor rpl_info_factory.cc server_ids.h) ADD_LIBRARY(slave ${SLAVE_SOURCE}) ADD_DEPENDENCIES(slave GenError) -ADD_LIBRARY(sqlgunitlib mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) +ADD_LIBRARY(sqlgunitlib + bounded_queue.cc mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) ADD_DEPENDENCIES(sqlgunitlib GenError) === modified file 'sql/Makefile.am' --- a/sql/Makefile.am 2010-10-21 12:18:25 +0000 +++ b/sql/Makefile.am 2010-10-21 14:12:43 +0000 @@ -161,6 +161,7 @@ mysqld_SOURCES = sql_lex.cc sql_handler. log.cc init.cc derror.cc sql_acl.cc \ unireg.cc des_key_file.cc \ discover.cc sql_time.cc opt_range.cc opt_sum.cc \ + bounded_queue.cc \ records.cc filesort.cc handler.cc \ ha_partition.cc \ debug_sync.cc \ === added file 'sql/bounded_queue.cc' --- a/sql/bounded_queue.cc 1970-01-01 00:00:00 +0000 +++ b/sql/bounded_queue.cc 2010-10-21 14:12:43 +0000 @@ -0,0 +1,67 @@ +/* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; version 2 of the License. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + +#include "bounded_queue.h" +#include "sql_const.h" +#include "sql_sort.h" + + +double get_merge_many_buffs_cost_fast(ha_rows num_buffers, ha_rows max_n_elems, + ha_rows last_n_elems, uint elem_size) +{ + double total_cost; + const double MERGEBUFF_double= (double) MERGEBUFF; + + /* Calc CPU cost of sorting each buffer */ + total_cost= ( num_buffers * max_n_elems * log(1.0 + max_n_elems) + + last_n_elems * log(1.0 + last_n_elems) ) + / TIME_FOR_COMPARE_ROWID; + + /* Simulate behavior of merge_many_buff(). */ + while (num_buffers >= MERGEBUFF2) + { + /* Calculate # of calls to merge_buffers() */ + ha_rows loop_limit= num_buffers - MERGEBUFF*3/2; + ha_rows num_merge_calls= 1 + loop_limit/MERGEBUFF; + ha_rows i_end_value= num_merge_calls * MERGEBUFF; + + /* Cost of merge sort 'num_merge_calls' */ + total_cost+= num_merge_calls * + ( 2.0 * (max_n_elems * MERGEBUFF_double * elem_size) / IO_SIZE + + max_n_elems * MERGEBUFF_double * log(MERGEBUFF_double) / + (TIME_FOR_COMPARE_ROWID * M_LN2)); + + /* # of records in last buffer */ + last_n_elems+= (num_buffers - i_end_value) * max_n_elems; + + /* cost of merge sort of last buffer */ + total_cost+= 2.0 * ((double)last_n_elems * elem_size) / IO_SIZE + + double(last_n_elems) * log(MERGEBUFF_double) / + (TIME_FOR_COMPARE_ROWID * M_LN2); + + num_buffers= num_merge_calls; + max_n_elems*= MERGEBUFF; + } + + /* Simulate final merge_buff call. */ + last_n_elems+= max_n_elems*num_buffers; + total_cost+= 2.0 * ((double)last_n_elems * elem_size) / IO_SIZE + + double(last_n_elems) * log(num_buffers + 1.0) / + (TIME_FOR_COMPARE_ROWID * M_LN2); + + return total_cost; +} + + === added file 'sql/bounded_queue.h' --- a/sql/bounded_queue.h 1970-01-01 00:00:00 +0000 +++ b/sql/bounded_queue.h 2010-10-21 14:12:43 +0000 @@ -0,0 +1,189 @@ +/* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; version 2 of the License. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + +#ifndef BOUNDED_QUEUE_INCLUDED +#define BOUNDED_QUEUE_INCLUDED + +#include +#include "my_global.h" +#include "my_base.h" +#include "my_sys.h" +#include "queues.h" + +class Sort_param; + +/** + A priority queue with a fixed, limited size. + + This is a wrapper on top of QUEUE and the queue_xxx() functions. + It keeps the top N elements which are inserted. + */ +template +class Bounded_queue +{ +public: + Bounded_queue() + { + memset(&m_queue, 0, sizeof(m_queue)); + } + + ~Bounded_queue() + { + delete_queue(&m_queue); + } + + /** + Function for making sort-key from input data. + @param param Sort parameters. + @param to Where to put the key. + @param from The input data. + */ + typedef void (*keymaker_function)(Sort_param *param, + Key_type *to, + Element_type *from); + + /** + Function for comparing two keys. + @param n Pointer to number of bytes to compare. + @param a First key. + @parm b Second key. + @retval a <=> b. + */ + typedef int (*compare_function)(size_t *v, Key_type **a, Key_type **b); + + /** + Initialize the queue. + + @param max_elements The size of the queue. + @param offset_to_key Offset to key in elements stored in the queue. + @param max_at_top Set to 1 if you want biggest element on top. + @param compare Compare function for elements, takes 3 arguments. + If NULL, we use get_ptr_compare(compare_length). + @parem compare_length Lenght of the data used for sorting. + @param keymaker Function which generates keys for elements. + @param sort_param Sort parameters. + @param sort_keys Array of pointers to keys to sort. + + @retval 0 OK, 1 Could not allocate memory. + + We do *not* take ownership of any of the input pointer arguments. + */ + int init(ha_rows max_elements, uint offset_to_key, pbool max_at_top, + compare_function compare, size_t compare_length, + keymaker_function keymaker, Sort_param *sort_param, + Key_type **sort_keys); + + /** + Pushes an element on the queue. + If the queue is already full, we discard the smallest (or biggest) element. + + @param element The element to be pushed. + */ + void push(Element_type *element); + + /** + Removes an element from the queue. + + @retval Pointer to the removed element. + */ + Key_type **pop() + { + return (Key_type**) queue_remove(&m_queue, 0); + } + + /** + The number of elements in the queue. + */ + uint num_elements() const { return m_queue.elements; } + + /** + Is the queue initialized? + */ + bool is_initialized() const { return m_queue.max_elements > 0; } + +private: + Key_type **m_sort_keys; + size_t m_compare_length; + keymaker_function m_keymaker; + Sort_param *m_sort_param; + st_queue m_queue; +}; + + +template +int Bounded_queue::init(ha_rows max_elements, + uint offset_to_key, + pbool max_at_top, + compare_function compare, + size_t compare_length, + keymaker_function keymaker, + Sort_param *sort_param, + Key_type **sort_keys) +{ + DBUG_ASSERT(sort_keys != NULL); + + m_sort_keys= sort_keys; + m_compare_length= compare_length; + m_keymaker= keymaker; + m_sort_param= sort_param; + // init_queue() takes an uint, and also does (max_elements + 1) + if (max_elements >= (UINT_MAX - 1)) + return 1; + if (compare == NULL) + compare= reinterpret_cast(get_ptr_compare(compare_length)); + // We allocate space for one extra element, for replace when queue is full. + return init_queue(&m_queue, (uint) max_elements + 1, offset_to_key, max_at_top, + reinterpret_cast(compare), &m_compare_length); +} + + +template +void Bounded_queue::push(Element_type *element) +{ + DBUG_ASSERT(is_initialized()); + if (queue_is_full((&m_queue))) + { + Key_type **pq_top= reinterpret_cast(queue_top(&m_queue)); + (*m_keymaker)(m_sort_param, *pq_top, element); + queue_replaced(&m_queue); + } else { + (*m_keymaker)(m_sort_param, m_sort_keys[m_queue.elements], element); + queue_insert(&m_queue, + reinterpret_cast(&m_sort_keys[m_queue.elements])); + } +} + + +/* + Calculate cost of merge sort + + @param num_buffers # of merge buffers + @param max_n_elems max # of keys in memory buffer + @param last_n_elems # of keys in last buffer + @param elem_size Size of each element. + + Calculates cost of merge sort by simulating call to merge_many_buff(). + + @retval + computed cost of merge sort + + @note + Declared here in order to be able to unit test it, + since library dependencies have not been sorted out yet. +*/ +double get_merge_many_buffs_cost_fast(ha_rows num_buffers, ha_rows max_n_elems, + ha_rows last_n_elems, uint elem_size); + +#endif // BOUNDED_QUEUE_INCLUDED === modified file 'sql/filesort.cc' --- a/sql/filesort.cc 2010-08-04 10:34:01 +0000 +++ b/sql/filesort.cc 2010-10-21 14:12:43 +0000 @@ -32,11 +32,27 @@ #include "probes_mysql.h" #include "sql_test.h" // TEST_filesort #include "opt_range.h" // SQL_SELECT +#include "bounded_queue.h" +#include "sql_select.h" #ifndef THREAD #define SKIP_DBUG_IN_FILESORT #endif +/* + How much Priority Queue sort is slower than qsort. + For qsort we have an average case complexity of O(n*log(n)) comparisons. + When using a priority queue, we have log(n) comparisons each time we + push a new element. For PQ we also call qsort at the end. + Measurements show that there is some extra overhead in QUEUE, + so we set it to 3.0 rather than 2.0. + */ +static double PQ_slowness= 3.0; + +#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION +template class Bounded_queue; +#endif + /// How to write record_ref. #define WRITE_REF(file,from) \ if (my_b_write((file),(uchar*) (from),param->ref_length)) \ @@ -44,22 +60,23 @@ if (my_b_write((file),(uchar*) (from),pa /* functions defined in this file */ -static char **make_char_array(char **old_pos, register uint fields, - uint length, myf my_flag); +static uchar **make_char_array(uchar **old_pos, uint fields, uint length); static uchar *read_buffpek_from_file(IO_CACHE *buffer_file, uint count, uchar *buf); -static ha_rows find_all_keys(SORTPARAM *param,SQL_SELECT *select, - uchar * *sort_keys, IO_CACHE *buffer_file, - IO_CACHE *tempfile,IO_CACHE *indexfile); -static int write_keys(SORTPARAM *param,uchar * *sort_keys, - uint count, IO_CACHE *buffer_file, IO_CACHE *tempfile); -static void make_sortkey(SORTPARAM *param,uchar *to, uchar *ref_pos); -static void register_used_fields(SORTPARAM *param); -static int merge_index(SORTPARAM *param,uchar *sort_buffer, - BUFFPEK *buffpek, - uint maxbuffer,IO_CACHE *tempfile, - IO_CACHE *outfile); -static bool save_index(SORTPARAM *param,uchar **sort_keys, uint count, +static ha_rows find_all_keys(Sort_param *param,SQL_SELECT *select, + uchar **sort_keys, IO_CACHE *buffer_file, + IO_CACHE *tempfile, + Bounded_queue *pq, + ha_rows *found_rows); +static int write_keys(Sort_param *param,uchar * *sort_keys, + uint count, IO_CACHE *buffer_file, IO_CACHE *tempfile); +static void make_sortkey(Sort_param *param,uchar *to, uchar *ref_pos); +static void register_used_fields(Sort_param *param); +static int merge_index(Sort_param *param,uchar *sort_buffer, + BUFFPEK *buffpek, + uint maxbuffer,IO_CACHE *tempfile, + IO_CACHE *outfile); +static bool save_index(Sort_param *param,uchar **sort_keys, uint count, FILESORT_INFO *table_sort); static uint suffix_length(ulong string_length); static uint sortlength(THD *thd, SORT_FIELD *sortorder, uint s_length, @@ -68,6 +85,41 @@ static SORT_ADDON_FIELD *get_addon_field uint sortlength, uint *plength); static void unpack_addon_fields(struct st_sort_addon_field *addon_field, uchar *buff); +static uchar **check_if_pq_applicable(Sort_param *param, FILESORT_INFO *info, + TABLE *table, + ha_rows records, ulong memavl); + + +void Sort_param::init(uint sortlen, TABLE *table, THD *thd, + ha_rows maxrows, bool sort_positions) +{ + sort_length= sortlen; + ref_length= table->file->ref_length; + if (!(table->file->ha_table_flags() & HA_FAST_KEY_READ) && + !table->fulltext_searched && !sort_positions) + { + /* + Get the descriptors of all fields whose values are appended + to sorted fields and get its total length in addon_length. + */ + addon_field= get_addon_fields(thd, table->field, sort_length, &addon_length); + } + if (addon_field) + res_length= addon_length; + else + { + res_length= ref_length; + /* + The reference to the record is considered + as an additional sorted field + */ + sort_length+= ref_length; + } + rec_length= sort_length + addon_length; + max_rows= maxrows; +} + + /** Sort a table. Creates a set of pointers that can be used to read the rows @@ -80,18 +132,17 @@ static void unpack_addon_fields(struct s The result set is stored in table->io_cache or table->record_pointers. - @param thd Current thread - @param table Table to sort - @param sortorder How to sort the table - @param s_length Number of elements in sortorder - @param select condition to apply to the rows - @param max_rows Return only this many rows - @param sort_positions Set to 1 if we want to force sorting by position - (Needed by UPDATE/INSERT or ALTER TABLE) - @param examined_rows Store number of examined rows here + @param thd Current thread + @param table Table to sort + @param sortorder How to sort the table + @param s_length Number of elements in sortorder + @param select Condition to apply to the rows + @param max_rows Return only this many rows + @param sort_positions Set to TRUE if we want to force sorting by position + (Needed by UPDATE/INSERT or ALTER TABLE) + @param[out] examined_rows Store number of examined rows here + @param options 0 or OPTION_FOUND_ROWS - @todo - check why we do this (param.keys--) @note If we sort by position (like if sort_positions is 1) filesort() will call table->prepare_for_position(). @@ -100,29 +151,30 @@ static void unpack_addon_fields(struct s HA_POS_ERROR Error @retval \# Number of rows - @retval - examined_rows will be set to number of examined rows */ ha_rows filesort(THD *thd, TABLE *table, SORT_FIELD *sortorder, uint s_length, SQL_SELECT *select, ha_rows max_rows, - bool sort_positions, ha_rows *examined_rows) + bool sort_positions, ha_rows *examined_rows, + ulonglong options) { int error; - ulong memavl, min_sort_memory; + ulong memavl; uint maxbuffer; BUFFPEK *buffpek; - ha_rows records= HA_POS_ERROR; - uchar **sort_keys= 0; - IO_CACHE tempfile, buffpek_pointers, *selected_records_file, *outfile; - SORTPARAM param; + ha_rows num_rows= HA_POS_ERROR; + uchar **sort_keys= NULL; + IO_CACHE tempfile, buffpek_pointers, *outfile; + Sort_param param; bool multi_byte_charset; + ha_rows found_rows; + Bounded_queue pq; + DBUG_ENTER("filesort"); DBUG_EXECUTE("info",TEST_filesort(sortorder,s_length);); #ifdef SKIP_DBUG_IN_FILESORT DBUG_PUSH(""); /* No DBUG here */ #endif - FILESORT_INFO table_sort; TABLE_LIST *tab= table->pos_in_table_list; Item_subselect *subselect= tab ? tab->containing_subselect() : 0; @@ -139,7 +191,7 @@ ha_rows filesort(THD *thd, TABLE *table, QUICK_INDEX_MERGE_SELECT. Work with a copy and put it back at the end when index_merge select has finished with it. */ - memcpy(&table_sort, &table->sort, sizeof(FILESORT_INFO)); + FILESORT_INFO table_sort= table->sort; table->sort.io_cache= NULL; outfile= table_sort.io_cache; @@ -147,117 +199,98 @@ ha_rows filesort(THD *thd, TABLE *table, my_b_clear(&buffpek_pointers); buffpek=0; error= 1; - bzero((char*) ¶m,sizeof(param)); - param.sort_length= sortlength(thd, sortorder, s_length, &multi_byte_charset); + + param.init(sortlength(thd, sortorder, s_length, &multi_byte_charset), + table, thd, max_rows, sort_positions); /* filesort cannot handle zero-length records. */ DBUG_ASSERT(param.sort_length); - param.ref_length= table->file->ref_length; - param.addon_field= 0; - param.addon_length= 0; - if (!(table->file->ha_table_flags() & HA_FAST_KEY_READ) && - !table->fulltext_searched && !sort_positions) - { - /* - Get the descriptors of all fields whose values are appended - to sorted fields and get its total length in param.spack_length. - */ - param.addon_field= get_addon_fields(thd, table->field, - param.sort_length, - ¶m.addon_length); - } table_sort.addon_buf= 0; table_sort.addon_length= param.addon_length; table_sort.addon_field= param.addon_field; table_sort.unpack= unpack_addon_fields; - if (param.addon_field) - { - param.res_length= param.addon_length; - if (!(table_sort.addon_buf= (uchar *) my_malloc(param.addon_length, - MYF(MY_WME)))) + if (param.addon_field && + !(table_sort.addon_buf= + (uchar *) my_malloc(param.addon_length, MYF(MY_WME)))) goto err; - } - else - { - param.res_length= param.ref_length; - /* - The reference to the record is considered - as an additional sorted field - */ - param.sort_length+= param.ref_length; - } - param.rec_length= param.sort_length+param.addon_length; - param.max_rows= max_rows; if (select && select->quick) - { status_var_increment(thd->status_var.filesort_range_count); - } else - { status_var_increment(thd->status_var.filesort_scan_count); - } -#ifdef CAN_TRUST_RANGE - if (select && select->quick && select->quick->records > 0L) - { - records=min((ha_rows) (select->quick->records*2+EXTRA_RECORDS*2), - table->file->stats.records)+EXTRA_RECORDS; - selected_records_file=0; - } - else -#endif - { - records= table->file->estimate_rows_upper_bound(); - /* - If number of records is not known, use as much of sort buffer - as possible. - */ - if (records == HA_POS_ERROR) - records--; // we use 'records+1' below. - selected_records_file= 0; - } + + /* + If number of rows is not known, use as much of sort buffer as possible. + */ + num_rows= table->file->estimate_rows_upper_bound(); if (multi_byte_charset && !(param.tmp_buffer= (char*) my_malloc(param.sort_length,MYF(MY_WME)))) goto err; memavl= thd->variables.sortbuff_size; - min_sort_memory= max(MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2); - while (memavl >= min_sort_memory) - { - ulong old_memavl; - ulong keys= memavl/(param.rec_length+sizeof(char*)); - param.keys=(uint) min(records+1, keys); - if ((table_sort.sort_keys= - (uchar **) make_char_array((char **) table_sort.sort_keys, - param.keys, param.rec_length, MYF(0)))) - break; - old_memavl=memavl; - if ((memavl=memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory) - memavl= min_sort_memory; + + table_sort.sort_keys= + check_if_pq_applicable(¶m, &table_sort, table, num_rows, memavl); + if (table_sort.sort_keys) + { + DBUG_PRINT("info", ("filesort PQ is applicable")); + const size_t compare_length= param.sort_length; + if (pq.init(param.max_rows, 0, 1, + NULL, + compare_length, + &make_sortkey, ¶m, table_sort.sort_keys)) + { + // If failed to init pq, fall back to merge-sort. + my_free(table_sort.sort_keys); + table_sort.sort_keys= NULL; + } } - sort_keys= table_sort.sort_keys; - if (memavl < min_sort_memory) + else + DBUG_PRINT("info", ("filesort PQ is not applicable")); + + if (!table_sort.sort_keys) { - my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG)); - goto err; + const ulong min_sort_memory= + max(MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2); + while (memavl >= min_sort_memory) + { + ulong old_memavl; + ulong keys= memavl/(param.rec_length+sizeof(char*)); + param.num_keys_per_buffer= (uint) min(num_rows, keys); + if ((table_sort.sort_keys= + make_char_array(table_sort.sort_keys, + param.num_keys_per_buffer, param.rec_length))) + break; + old_memavl=memavl; + if ((memavl=memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory) + memavl= min_sort_memory; + } + if (memavl < min_sort_memory) + { + my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG)); + goto err; + } } + + sort_keys= table_sort.sort_keys; if (open_cached_file(&buffpek_pointers,mysql_tmpdir,TEMP_PREFIX, DISK_BUFFER_SIZE, MYF(MY_WME))) goto err; - param.keys--; /* TODO: check why we do this */ param.sort_form= table; param.end=(param.local_sortorder=sortorder)+s_length; - if ((records=find_all_keys(¶m,select,sort_keys, &buffpek_pointers, - &tempfile, selected_records_file)) == + if ((num_rows= find_all_keys(¶m, select, sort_keys, &buffpek_pointers, + &tempfile, + pq.is_initialized() ? &pq : NULL, + &found_rows)) == HA_POS_ERROR) goto err; maxbuffer= (uint) (my_b_tell(&buffpek_pointers)/sizeof(*buffpek)); if (maxbuffer == 0) // The whole set is in memory { - if (save_index(¶m,sort_keys,(uint) records, &table_sort)) + if (save_index(¶m, sort_keys, (uint) num_rows, &table_sort)) goto err; } else @@ -286,8 +319,9 @@ ha_rows filesort(THD *thd, TABLE *table, Use also the space previously used by string pointers in sort_buffer for temporary key storage. */ - param.keys=((param.keys*(param.rec_length+sizeof(char*))) / - param.rec_length-1); + param.num_keys_per_buffer=((param.num_keys_per_buffer * + (param.rec_length + sizeof(char*))) / + param.rec_length - 1); maxbuffer--; // Offset from 0 if (merge_many_buff(¶m,(uchar*) sort_keys,buffpek,&maxbuffer, &tempfile)) @@ -299,9 +333,17 @@ ha_rows filesort(THD *thd, TABLE *table, outfile)) goto err; } - if (records > param.max_rows) - records=param.max_rows; - error =0; + + if (pq.is_initialized() && (options & OPTION_FOUND_ROWS)) + { + DBUG_PRINT("info", ("PQ and OPTION_FOUND_ROWS !!")); + } + + if (options & OPTION_FOUND_ROWS) + num_rows= found_rows; + else if (num_rows > param.max_rows) + num_rows= param.max_rows; + error= 0; err: my_free(param.tmp_buffer); @@ -332,15 +374,16 @@ ha_rows filesort(THD *thd, TABLE *table, MYF(ME_ERROR+ME_WAITTANG)); else statistic_add(thd->status_var.filesort_rows, - (ulong) records, &LOCK_status); + (ulong) num_rows, &LOCK_status); *examined_rows= param.examined_rows; #ifdef SKIP_DBUG_IN_FILESORT DBUG_POP(); /* Ok to DBUG */ #endif - memcpy(&table->sort, &table_sort, sizeof(FILESORT_INFO)); - DBUG_PRINT("exit",("records: %ld", (long) records)); - MYSQL_FILESORT_DONE(error, records); - DBUG_RETURN(error ? HA_POS_ERROR : records); + table->sort= table_sort; + DBUG_PRINT("exit",("num_rows: %ld examined_rows: %ld", + (long) num_rows, (long) *examined_rows)); + MYSQL_FILESORT_DONE(error, num_rows); + DBUG_RETURN(error ? HA_POS_ERROR : num_rows); } /* filesort */ @@ -366,23 +409,22 @@ void filesort_free_buffers(TABLE *table, /** Make a array of string pointers. */ -static char **make_char_array(char **old_pos, register uint fields, - uint length, myf my_flag) +static uchar **make_char_array(uchar **old_pos, uint fields, uint length) { - register char **pos; - char *char_pos; DBUG_ENTER("make_char_array"); if (old_pos || - (old_pos= (char**) my_malloc((uint) fields*(length+sizeof(char*)), - my_flag))) + (old_pos= + (uchar**) my_malloc(fields * (length + sizeof(char*)), MYF(0)))) { - pos=old_pos; char_pos=((char*) (pos+fields)) -length; - while (fields--) *(pos++) = (char_pos+= length); + uchar **pos= old_pos; + uchar *char_pos= ((uchar*) (pos+fields)) - length; + while (fields--) + *(pos++) = (char_pos+= length); } DBUG_RETURN(old_pos); -} /* make_char_array */ +} /** Read 'count' number of buffer pointers into memory. */ @@ -470,20 +512,26 @@ static void dbug_print_record(TABLE *tab @param buffpek_pointers File to write BUFFPEKs describing sorted segments in tempfile. @param tempfile File to write sorted sequences of sortkeys to. - @param indexfile If !NULL, use it for source data (contains rowids) + @param pq If !NULL, use it for keeping top N elements + @param [out] found_rows The number of FOUND_ROWS(). @note Basic idea: @verbatim while (get_next_sortkey()) { - if (no free space in sort_keys buffers) + if (using priority queue) + push sort key into queue + else { - sort sort_keys buffer; - dump sorted sequence to 'tempfile'; - dump BUFFPEK describing sequence location into 'buffpek_pointers'; + if (no free space in sort_keys buffers) + { + sort sort_keys buffer; + dump sorted sequence to 'tempfile'; + dump BUFFPEK describing sequence location into 'buffpek_pointers'; + } + put sort key into 'sort_keys'; } - put sort key into 'sort_keys'; } if (sort_keys has some elements && dumped at least once) sort-dump-dump as above; @@ -497,10 +545,12 @@ static void dbug_print_record(TABLE *tab HA_POS_ERROR on error. */ -static ha_rows find_all_keys(SORTPARAM *param, SQL_SELECT *select, - uchar **sort_keys, - IO_CACHE *buffpek_pointers, - IO_CACHE *tempfile, IO_CACHE *indexfile) +static ha_rows find_all_keys(Sort_param *param, SQL_SELECT *select, + uchar **sort_keys, + IO_CACHE *buffpek_pointers, + IO_CACHE *tempfile, + Bounded_queue *pq, + ha_rows *found_rows) { int error,flag,quick_select; uint idx,indexpos,ref_length; @@ -512,11 +562,12 @@ static ha_rows find_all_keys(SORTPARAM * handler *file; MY_BITMAP *save_read_set, *save_write_set; bool skip_record; + DBUG_ENTER("find_all_keys"); DBUG_PRINT("info",("using: %s", (select ? select->quick ? "ranges" : "where": "every row"))); - + idx=indexpos=0; error=quick_select=0; sort_form=param->sort_form; @@ -525,12 +576,12 @@ static ha_rows find_all_keys(SORTPARAM * ref_pos= ref_buff; quick_select=select && select->quick; record=0; - flag= ((!indexfile && file->ha_table_flags() & HA_REC_NOT_IN_SEQ) - || quick_select); - if (indexfile || flag) + *found_rows= 0; + flag= ((file->ha_table_flags() & HA_REC_NOT_IN_SEQ) || quick_select); + if (flag) ref_pos= &file->ref[0]; next_pos=ref_pos; - if (! indexfile && ! quick_select) + if (!quick_select) { next_pos=(uchar*) 0; /* Find records in sequence */ file->ha_rnd_init(1); @@ -577,16 +628,6 @@ static ha_rows find_all_keys(SORTPARAM * } else /* Not quick-select */ { - if (indexfile) - { - if (my_b_read(indexfile,(uchar*) ref_pos,ref_length)) /* purecov: deadcode */ - { - error= my_errno ? my_errno : -1; /* Abort */ - break; - } - error= file->ha_rnd_pos(sort_form->record[0], next_pos); - } - else { error= file->ha_rnd_next(sort_form->record[0]); if (!flag) @@ -604,7 +645,7 @@ static ha_rows find_all_keys(SORTPARAM * if (*killed) { DBUG_PRINT("info",("Sort killed by user")); - if (!indexfile && !quick_select) + if (!quick_select) { (void) file->extra(HA_EXTRA_NO_CACHE); file->ha_rnd_end(); @@ -616,14 +657,23 @@ static ha_rows find_all_keys(SORTPARAM * if (!error && (!select || (!select->skip_record(thd, &skip_record) && !skip_record))) { - if (idx == param->keys) + ++(*found_rows); + if (pq) { - if (write_keys(param,sort_keys,idx,buffpek_pointers,tempfile)) - DBUG_RETURN(HA_POS_ERROR); - idx=0; - indexpos++; + pq->push(ref_pos); + idx= pq->num_elements(); + } + else + { + if (idx == param->num_keys_per_buffer) + { + if (write_keys(param,sort_keys, idx, buffpek_pointers, tempfile)) + DBUG_RETURN(HA_POS_ERROR); + idx= 0; + indexpos++; + } + make_sortkey(param, sort_keys[idx++], ref_pos); } - make_sortkey(param,sort_keys[idx++],ref_pos); } else file->unlock_row(); @@ -653,9 +703,11 @@ static ha_rows find_all_keys(SORTPARAM * if (indexpos && idx && write_keys(param,sort_keys,idx,buffpek_pointers,tempfile)) DBUG_RETURN(HA_POS_ERROR); /* purecov: inspected */ - DBUG_RETURN(my_b_inited(tempfile) ? - (ha_rows) (my_b_tell(tempfile)/param->rec_length) : - idx); + const ha_rows retval= + my_b_inited(tempfile) ? + (ha_rows) (my_b_tell(tempfile)/param->rec_length) : idx; + DBUG_PRINT("info", ("find_all_keys return %u", (uint) retval)); + DBUG_RETURN(retval); } /* find_all_keys */ @@ -682,7 +734,7 @@ static ha_rows find_all_keys(SORTPARAM * */ static int -write_keys(SORTPARAM *param, register uchar **sort_keys, uint count, +write_keys(Sort_param *param, register uchar **sort_keys, uint count, IO_CACHE *buffpek_pointers, IO_CACHE *tempfile) { size_t sort_length, rec_length; @@ -745,8 +797,8 @@ static inline void store_length(uchar *t /** Make a sort-key from record. */ -static void make_sortkey(register SORTPARAM *param, - register uchar *to, uchar *ref_pos) +static void make_sortkey(register Sort_param *param, + register uchar *to, uchar *ref_pos) { reg3 Field *field; reg1 SORT_FIELD *sort_field; @@ -998,7 +1050,7 @@ static void make_sortkey(register SORTPA Register fields used by sorting in the sorted table's read set */ -static void register_used_fields(SORTPARAM *param) +static void register_used_fields(Sort_param *param) { reg1 SORT_FIELD *sort_field; TABLE *table=param->sort_form; @@ -1036,17 +1088,17 @@ static void register_used_fields(SORTPAR } -static bool save_index(SORTPARAM *param, uchar **sort_keys, uint count, +static bool save_index(Sort_param *param, uchar **sort_keys, uint count, FILESORT_INFO *table_sort) { uint offset,res_length; uchar *to; DBUG_ENTER("save_index"); - my_string_ptr_sort((uchar*) sort_keys, (uint) count, param->sort_length); + my_string_ptr_sort((uchar*) sort_keys, count, param->sort_length); res_length= param->res_length; offset= param->rec_length-res_length; - if ((ha_rows) count > param->max_rows) + if ((ha_rows) count > param->max_rows && param->max_rows > 0) count=(uint) param->max_rows; if (!(to= table_sort->record_pointers= (uchar*) my_malloc(res_length*count, MYF(MY_WME)))) @@ -1060,10 +1112,127 @@ static bool save_index(SORTPARAM *param, } +/** + Test whether priority queue is worth using to get top elements of an + ordered result set. If it is then allocates buffer for required amount of + records + + @param param Sort parameters. + @param info Filesort information. + @param table Table to sort. + @param num_rows Estimate of number of rows in source record set. + @param memavl Memory available for sorting. + + DESCRIPTION + Function tests applicability of PQ to get L top records for queries like + SELECT ... FROM t ORDER BY a1,...,an LIMIT max_rows; + It tests whether there is enough memory to contain max_rows elements, + whether max_rows is small enough to make PQ perform faster that qsort + on table containing 'num_rows' records. If available memory is enough to + store only 'max_rows' sort keys without addon data, it modifies 'table' + to sort with references to tuples instead of additional data. In evaluations + it uses 'param' to get sort key, addon data and reference sizes, 'table' - + to get table scan time. + + @retval + allocated buffer - if it's ok to use PQ + NULL - PQ will be slower than merge-sort, or there is not enough memory. +*/ + +uchar **check_if_pq_applicable(Sort_param *param, FILESORT_INFO *info, + TABLE *table, ha_rows num_rows, ulong memavl) +{ + DBUG_ENTER("check_if_pq_applicable"); + + if (param->max_rows == HA_POS_ERROR) + { + DBUG_PRINT("info", ("max_rows = HA_POS_ERROR")); + DBUG_RETURN(NULL); + } + + if (param->max_rows + 2 >= UINT_MAX) + { + DBUG_PRINT("info", ("Too large LIMIT")); + DBUG_RETURN(NULL); + } + + uchar **sort_keys; + ulong num_available_keys= memavl/(param->rec_length + sizeof(char*)); + param->num_keys_per_buffer= (uint) param->max_rows + 1; + if (num_rows < num_available_keys) + { + /* The whole source set fits into memory. */ + if (param->max_rows < num_rows/PQ_slowness ) + { + if ((sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length))) + DBUG_RETURN(sort_keys); + } + else + { + /* PQ will be slower */ + DBUG_RETURN(NULL); + } + } + + if (param->max_rows + 1 < num_available_keys && + (sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length))) + DBUG_RETURN(sort_keys); + + /* Try to strip off addon fields */ + if (param->addon_field) + { + const ulong row_lenght= + param->sort_length + param->ref_length + sizeof(char*); + num_available_keys= memavl / row_lenght; + + if (param->max_rows + 1 < num_available_keys) + { + const double merge_cost= + get_merge_many_buffs_cost_fast(num_rows / num_available_keys, + num_available_keys, + num_rows % num_available_keys, + row_lenght); + const double pq_cost= + (PQ_slowness * num_rows + param->max_rows + 1)* + log(param->max_rows + 1.0) / TIME_FOR_COMPARE_ROWID + + param->max_rows * table->file->scan_time(); + + if (merge_cost < pq_cost) + DBUG_RETURN(NULL); + + sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length); + if (sort_keys) + { + // Make attached data to be references instead of fields. + my_free(info->addon_buf); + my_free(info->addon_field); + info->addon_buf= NULL; + info->addon_field= 0; + param->addon_field= NULL; + param->addon_length= 0; + + param->res_length= param->ref_length; + param->sort_length+= param->ref_length; + param->rec_length= param->sort_length + param->addon_length; + + DBUG_RETURN(sort_keys); + } + } + } + DBUG_RETURN(NULL); +} + + /** Merge buffers to make < MERGEBUFF2 buffers. */ -int merge_many_buff(SORTPARAM *param, uchar *sort_buffer, - BUFFPEK *buffpek, uint *maxbuffer, IO_CACHE *t_file) +int merge_many_buff(Sort_param *param, uchar *sort_buffer, + BUFFPEK *buffpek, uint *maxbuffer, IO_CACHE *t_file) { register uint i; IO_CACHE t_file2,*from_file,*to_file,*temp; @@ -1192,7 +1361,7 @@ void reuse_freed_buff(QUEUE *queue, BUFF other error */ -int merge_buffers(SORTPARAM *param, IO_CACHE *from_file, +int merge_buffers(Sort_param *param, IO_CACHE *from_file, IO_CACHE *to_file, uchar *sort_buffer, BUFFPEK *lastbuff, BUFFPEK *Fb, BUFFPEK *Tb, int flag) @@ -1224,7 +1393,7 @@ int merge_buffers(SORTPARAM *param, IO_C res_length= param->res_length; sort_length= param->sort_length; offset= rec_length-res_length; - maxcount= (ulong) (param->keys/((uint) (Tb-Fb) +1)); + maxcount= (ulong) (param->num_keys_per_buffer / ((uint) (Tb-Fb) +1)); to_start_filepos= my_b_tell(to_file); strpos= (uchar*) sort_buffer; org_max_rows=max_rows= param->max_rows; @@ -1249,8 +1418,7 @@ int merge_buffers(SORTPARAM *param, IO_C { buffpek->base= strpos; buffpek->max_keys= maxcount; - strpos+= (uint) (error= (int) read_to_buffer(from_file, buffpek, - rec_length)); + strpos+= (uint) (error= (int)read_to_buffer(from_file, buffpek, rec_length)); if (error == -1) goto err; /* purecov: inspected */ buffpek->max_keys= buffpek->mem_count; // If less data in buffers than expected @@ -1340,7 +1508,7 @@ int merge_buffers(SORTPARAM *param, IO_C } buffpek= (BUFFPEK*) queue_top(&queue); buffpek->base= sort_buffer; - buffpek->max_keys= param->keys; + buffpek->max_keys= param->num_keys_per_buffer; /* As we know all entries in the buffer are unique, we only have to @@ -1400,9 +1568,9 @@ err: /* Do a merge to output-file (save only positions) */ -static int merge_index(SORTPARAM *param, uchar *sort_buffer, - BUFFPEK *buffpek, uint maxbuffer, - IO_CACHE *tempfile, IO_CACHE *outfile) +static int merge_index(Sort_param *param, uchar *sort_buffer, + BUFFPEK *buffpek, uint maxbuffer, + IO_CACHE *tempfile, IO_CACHE *outfile) { DBUG_ENTER("merge_index"); if (merge_buffers(param,tempfile,outfile,sort_buffer,buffpek,buffpek, === modified file 'sql/filesort.h' --- a/sql/filesort.h 2010-07-02 02:58:51 +0000 +++ b/sql/filesort.h 2010-10-21 14:12:43 +0000 @@ -21,6 +21,7 @@ class SQL_SELECT; #include "my_global.h" /* uint, uchar */ #include "my_base.h" /* ha_rows */ +class JOIN; class SQL_SELECT; class THD; struct TABLE; @@ -29,7 +30,7 @@ typedef struct st_sort_field SORT_FIELD; ha_rows filesort(THD *thd, TABLE *table, st_sort_field *sortorder, uint s_length, SQL_SELECT *select, ha_rows max_rows, bool sort_positions, - ha_rows *examined_rows); + ha_rows *examined_rows, ulonglong options); void filesort_free_buffers(TABLE *table, bool full); void change_double_for_sort(double nr,uchar *to); === modified file 'sql/sql_const.h' --- a/sql/sql_const.h 2010-07-13 17:29:44 +0000 +++ b/sql/sql_const.h 2010-10-21 14:12:43 +0000 @@ -161,13 +161,13 @@ instead of reading with keys. The number says how many evaluation of the WHERE clause is comparable to reading one extra row from a table. */ -#define TIME_FOR_COMPARE 5 // 5 compares == one read +#define TIME_FOR_COMPARE 5.0 // 5 compares == one read /** Number of comparisons of table rowids equivalent to reading one row from a table. */ -#define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2) +#define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2.0) /* For sequential disk seeks the cost formula is: === modified file 'sql/sql_delete.cc' --- a/sql/sql_delete.cc 2010-10-21 11:34:17 +0000 +++ b/sql/sql_delete.cc 2010-10-21 14:12:43 +0000 @@ -243,7 +243,7 @@ bool mysql_delete(THD *thd, TABLE_LIST * if (!(sortorder= make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records = filesort(thd, table, sortorder, length, select, HA_POS_ERROR, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { delete select; === modified file 'sql/sql_select.cc' --- a/sql/sql_select.cc 2010-11-05 16:23:32 +0000 +++ b/sql/sql_select.cc 2010-10-21 14:12:43 +0000 @@ -2557,6 +2557,7 @@ JOIN::optimize() if (!group_list && ! exec_tmp_table1->distinct && order && simple_order) { + DBUG_PRINT("info",("Sorting for order")); thd_proc_info(thd, "Sorting for order"); if (create_sort_index(thd, this, order, HA_POS_ERROR, HA_POS_ERROR, TRUE)) @@ -2734,6 +2735,8 @@ JOIN::exec() int tmp_error; DBUG_ENTER("JOIN::exec"); + const bool has_group_by= this->group; + thd_proc_info(thd, "executing"); error= 0; if (procedure) @@ -3019,11 +3022,12 @@ JOIN::exec() } if (curr_join->group_list) { - thd_proc_info(thd, "Creating sort index"); if (curr_join->join_tab == join_tab && save_join_tab()) { DBUG_VOID_RETURN; } + DBUG_PRINT("info",("Sorting for index")); + thd_proc_info(thd, "Creating sort index"); if (create_sort_index(thd, curr_join, curr_join->group_list, HA_POS_ERROR, HA_POS_ERROR, FALSE) || make_group_fields(this, curr_join)) @@ -3249,12 +3253,21 @@ JOIN::exec() the query. XXX: it's never shown in EXPLAIN! OPTION_FOUND_ROWS supersedes LIMIT and is taken into account. */ - if (create_sort_index(thd, curr_join, - curr_join->group_list ? - curr_join->group_list : curr_join->order, - curr_join->select_limit, - (select_options & OPTION_FOUND_ROWS ? - HA_POS_ERROR : unit->select_limit_cnt), + DBUG_PRINT("info",("Sorting for order by/group by")); + ORDER *order_arg= + curr_join->group_list ? curr_join->group_list : curr_join->order; + const ha_rows filesort_limit_arg= + (has_group_by || curr_join->tables > 1) + ? curr_join->select_limit : unit->select_limit_cnt; + const ha_rows select_limit_arg= + select_options & OPTION_FOUND_ROWS + ? HA_POS_ERROR : unit->select_limit_cnt; + + if (create_sort_index(thd, + curr_join, + order_arg, + filesort_limit_arg, + select_limit_arg, curr_join->group_list ? FALSE : TRUE)) DBUG_VOID_RETURN; sortorder= curr_join->sortorder; @@ -3287,6 +3300,15 @@ JOIN::exec() Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF); error= do_select(curr_join, curr_fields_list, NULL, procedure); thd->limit_found_rows= curr_join->send_records; + if (curr_join->order && + curr_join->sortorder && + curr_join->select_options & OPTION_FOUND_ROWS) + { + /* Use info provided by filesort. */ + DBUG_ASSERT(curr_join->tables > curr_join->const_tables); + JOIN_TAB *tab= curr_join->join_tab + curr_join->const_tables; + thd->limit_found_rows= tab->records; + } /* Accumulate the counts from all join iterations of all join parts. */ thd->examined_row_count+= curr_join->examined_rows; @@ -18368,8 +18390,26 @@ end_send(JOIN *join, JOIN_TAB *join_tab error=join->result->send_data(*join->fields); if (error) DBUG_RETURN(NESTED_LOOP_ERROR); /* purecov: inspected */ - if (++join->send_records >= join->unit->select_limit_cnt && - join->do_send_rows) + + ++join->send_records; + if (join->send_records >= join->unit->select_limit_cnt && + !join->do_send_rows) + { + /* + If filesort is used for sorting, stop after select_limit_cnt+1 + records are read. Because of optimization in some cases it can + provide only select_limit_cnt+1 records. + */ + if (join->order && + join->sortorder && + join->select_options & OPTION_FOUND_ROWS) + { + DBUG_PRINT("info", ("filesort NESTED_LOOP_QUERY_LIMIT")); + DBUG_RETURN(NESTED_LOOP_QUERY_LIMIT); + } + } + if (join->send_records >= join->unit->select_limit_cnt && + join->do_send_rows) { if (join->select_options & OPTION_FOUND_ROWS) { @@ -20016,7 +20056,7 @@ use_filesort: SYNOPSIS create_sort_index() thd Thread handler - tab Table to sort (in join structure) + join The join order How table should be sorted filesort_limit Max number of rows that needs to be sorted select_limit Max number of rows in final output @@ -20118,9 +20158,11 @@ create_sort_index(THD *thd, JOIN *join, if (table->s->tmp_table) table->file->info(HA_STATUS_VARIABLE); // Get record count - table->sort.found_records=filesort(thd, table,join->sortorder, length, - select, filesort_limit, 0, - &examined_rows); + table->sort.found_records= filesort(thd, table,join->sortorder, length, + select, filesort_limit, 0, + &examined_rows, + join->tables != 1 ? 0 : + join->select_options & OPTION_FOUND_ROWS); tab->records= table->sort.found_records; // For SQL_CALC_ROWS if (select) { @@ -20467,7 +20509,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER pos= sort= sortorder; if (!pos) - return 0; + DBUG_RETURN(0); for (;order;order=order->next,pos++) { @@ -20484,6 +20526,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER else pos->item= *order->item; pos->reverse=! order->asc; + DBUG_ASSERT(pos->field != NULL || pos->item != NULL); } *length=count; DBUG_RETURN(sort); === modified file 'sql/sql_sort.h' --- a/sql/sql_sort.h 2010-07-02 18:15:21 +0000 +++ b/sql/sql_sort.h 2010-10-21 14:12:43 +0000 @@ -26,7 +26,7 @@ typedef struct st_sort_field SORT_FIELD; class Field; struct TABLE; - +class THD; /* Defines used by filesort and uniques */ @@ -71,15 +71,17 @@ struct BUFFPEK_COMPARE_CONTEXT void *key_compare_arg; }; -typedef struct st_sort_param { - uint rec_length; /* Length of sorted records */ - uint sort_length; /* Length of sorted columns */ - uint ref_length; /* Length of record ref. */ - uint addon_length; /* Length of added packed fields */ - uint res_length; /* Length of records in final sorted file/buffer */ - uint keys; /* Max keys / buffer */ - ha_rows max_rows,examined_rows; - TABLE *sort_form; /* For quicker make_sortkey */ +class Sort_param { +public: + uint rec_length; /* Length of sorted records */ + uint sort_length; /* Length of sorted columns */ + uint ref_length; /* Length of record ref. */ + uint addon_length; /* Length of added packed fields */ + uint res_length; /* Length of records in final sorted file/buffer */ + uint num_keys_per_buffer; /* Max keys / buffer */ + ha_rows max_rows; /* Select limit, or HA_POS_ERROR if unlimited */ + ha_rows examined_rows; /* Number of examined rows */ + TABLE *sort_form; /* For quicker make_sortkey */ SORT_FIELD *local_sortorder; SORT_FIELD *end; SORT_ADDON_FIELD *addon_field; /* Descriptors for companion fields */ @@ -89,15 +91,22 @@ typedef struct st_sort_param { /* The fields below are used only by Unique class */ qsort2_cmp compare; BUFFPEK_COMPARE_CONTEXT cmp_context; -} SORTPARAM; + + Sort_param() + { + memset(this, 0, sizeof(*this)); + } + void init(uint sortlen, TABLE *table, THD *thd, + ha_rows maxrows, bool sort_positions); +}; -int merge_many_buff(SORTPARAM *param, uchar *sort_buffer, +int merge_many_buff(Sort_param *param, uchar *sort_buffer, BUFFPEK *buffpek, uint *maxbuffer, IO_CACHE *t_file); uint read_to_buffer(IO_CACHE *fromfile,BUFFPEK *buffpek, uint sort_length); -int merge_buffers(SORTPARAM *param,IO_CACHE *from_file, +int merge_buffers(Sort_param *param,IO_CACHE *from_file, IO_CACHE *to_file, uchar *sort_buffer, BUFFPEK *lastbuff,BUFFPEK *Fb, BUFFPEK *Tb,int flag); === modified file 'sql/sql_table.cc' --- a/sql/sql_table.cc 2010-10-27 10:28:09 +0000 +++ b/sql/sql_table.cc 2010-10-21 14:12:43 +0000 @@ -7105,7 +7105,7 @@ copy_data_between_tables(TABLE *from,TAB !(sortorder= make_unireg_sortorder(order, &length, NULL)) || (from->sort.found_records= filesort(thd, from, sortorder, length, (SQL_SELECT *) 0, HA_POS_ERROR, - 1, &examined_rows)) == + 1, &examined_rows, 0)) == HA_POS_ERROR) goto err; } === modified file 'sql/sql_update.cc' --- a/sql/sql_update.cc 2010-10-21 12:18:25 +0000 +++ b/sql/sql_update.cc 2010-10-21 14:12:43 +0000 @@ -479,7 +479,7 @@ int mysql_update(THD *thd, if (!(sortorder=make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records= filesort(thd, table, sortorder, length, select, limit, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { goto err; === modified file 'sql/uniques.cc' --- a/sql/uniques.cc 2010-07-08 21:42:23 +0000 +++ b/sql/uniques.cc 2010-10-21 14:12:43 +0000 @@ -577,7 +577,6 @@ bool Unique::walk(tree_walk_action actio bool Unique::get(TABLE *table) { - SORTPARAM sort_param; table->sort.found_records=elements+tree.elements_in_tree; if (my_b_tell(&file) == 0) @@ -612,19 +611,20 @@ bool Unique::get(TABLE *table) return 1; reinit_io_cache(outfile,WRITE_CACHE,0L,0,0); - bzero((char*) &sort_param,sizeof(sort_param)); + Sort_param sort_param; sort_param.max_rows= elements; sort_param.sort_form=table; sort_param.rec_length= sort_param.sort_length= sort_param.ref_length= size; - sort_param.keys= (uint) (max_in_memory_size / sort_param.sort_length); + sort_param.num_keys_per_buffer= + (uint) (max_in_memory_size / sort_param.sort_length); sort_param.not_killable=1; - if (!(sort_buffer=(uchar*) my_malloc((sort_param.keys+1) * + if (!(sort_buffer=(uchar*) my_malloc((sort_param.num_keys_per_buffer + 1) * sort_param.sort_length, MYF(0)))) return 1; - sort_param.unique_buff= sort_buffer+(sort_param.keys* + sort_param.unique_buff= sort_buffer+(sort_param.num_keys_per_buffer * sort_param.sort_length); sort_param.compare= (qsort2_cmp) buffpek_compare; === modified file 'unittest/gunit/CMakeLists.txt' --- a/unittest/gunit/CMakeLists.txt 2010-10-18 11:31:18 +0000 +++ b/unittest/gunit/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -206,8 +206,17 @@ IF (CMAKE_CXX_COMPILER_ID STREQUAL "SunP ADD_DEFINITIONS("-library=stlport4") ENDIF() -# Add tests (link them with sql library) -SET(TESTS dbug sql_list mdl mdl_mytap my_regex thread_utils) +# Add tests (link them with gunit library) +SET(TESTS + bounded_queue + dbug + mdl + mdl_mytap + my_regex + sql_list + thread_utils + ) + FOREACH(test ${TESTS}) ADD_EXECUTABLE(${test}-t ${test}-t.cc) TARGET_LINK_LIBRARIES(${test}-t gunit sqlgunitlib strings dbug regex) === added file 'unittest/gunit/bounded_queue-t.cc' --- a/unittest/gunit/bounded_queue-t.cc 1970-01-01 00:00:00 +0000 +++ b/unittest/gunit/bounded_queue-t.cc 2010-10-21 14:12:43 +0000 @@ -0,0 +1,423 @@ +/* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; version 2 of the License. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 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 "bounded_queue.h" +#include "my_sys.h" + +namespace { + +const int num_elements= 14; + +// A simple helper function to determine array size. +template +int array_size(const T (&)[size]) +{ + return size; +} + + +/* + Elements to be sorted by tests below. + We put some data in front of 'val' to verify (when debugging) + that all the reinterpret_casts involved when using QUEUE are correct. +*/ +struct Test_element +{ + Test_element() { *this= -1; } + Test_element(int i) { *this= i; } + + Test_element &operator=(int i) + { + val= i; + snprintf(text, array_size(text), "%4d", i); + return *this; + } + + char text[8]; // Some data. + int val; // The value we use for generating the key. +}; + + +/* + The key, which is actually sorted by queue_xxx() functions. + We sort on the key only. + */ +struct Test_key +{ + Test_key() : element(NULL), key(-1) {} + + Test_element *element; // The actual data element. + int key; // The generated key for the data element. +}; + + +/* + Comparison function for Test_key objects. + */ +extern "C" +int test_key_compare(size_t *cmp_arg, Test_key **a, Test_key **b) +{ + EXPECT_EQ(*cmp_arg, sizeof(int)); + + int a_num= (*a)->key; + int b_num= (*b)->key; + + if (a_num > b_num) + return +1; + if (a_num < b_num) + return -1; + return 0; +} + + +/* + Generates a Test_key for a given Test_element. + */ +void test_keymaker(Sort_param *sp, Test_key *key, Test_element *element) +{ + int key_val= element->val; + + key->element= element; + key->key= key_val; +} + + +/* + A struct to wrap the actual keys, and an array of pointers to the keys. + */ +template +struct Key_container +{ + Key_container() + { + for (int ix= 0; ix <= sz; ++ix) + key_ptrs[ix]= &key_data[ix]; + } + + Key_type *key_ptrs[sz+1]; + Key_type key_data[sz+1]; +}; + + +class BoundedQueueTest : public ::testing::Test +{ +protected: + BoundedQueueTest() : m_key_size(sizeof(int)) + { + } + + virtual void SetUp() + { + int ix; + for (ix=0; ix < array_size(m_test_data); ++ix) + m_test_data[ix]= ix; + std::random_shuffle(&m_test_data[0], &m_test_data[array_size(m_test_data)]); + } + + // Key pointers and data, used by the queue_xxx() functions. + Key_container m_keys; + + // Some random intput data, to be sorted. + Test_element m_test_data[num_elements]; + + size_t m_key_size; + Bounded_queue m_queue; +private: + GTEST_DISALLOW_COPY_AND_ASSIGN_(BoundedQueueTest); +}; + + +// Google Test recommends DeathTest suffix for classes used in death tests. +typedef BoundedQueueTest BoundedQueueDeathTest; + +#if !defined(DBUG_OFF) +/* + Verifies that we DBUG_ASSERT if trying to push to an un-initialized queue. + */ +TEST_F(BoundedQueueDeathTest, die_if_not_initialized) +{ + ::testing::FLAGS_gtest_death_test_style = "threadsafe"; + Test_element foo= 1; + EXPECT_DEATH_IF_SUPPORTED(m_queue.push(&foo), + ".*Assertion .*is_initialized.*"); +} +#endif // !defined(DBUG_OFF) + + +/* + Verifies that construct, initialize, destroy works. + */ +TEST_F(BoundedQueueTest, construct_and_destruct) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); +} + + +/* + Verifies that we reject too large queues. + */ +TEST_F(BoundedQueueTest, too_many_elements) +{ + EXPECT_EQ(1, m_queue.init(UINT_MAX, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + EXPECT_EQ(1, m_queue.init(UINT_MAX - 1, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); +} + + +/* + Verifies that push and bounded size works, and that pop() gives sorted order. + */ +TEST_F(BoundedQueueTest, push_and_pop) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + for (int ix= 0; ix < array_size(m_test_data); ++ix) + { + m_queue.push(&m_test_data[ix]); + } + /* + The queue should now contain [0 .. (num_elements/2 - 1)] + plus one extra element that we are not interested in. + */ + (void) m_queue.pop(); + int expected_key_val= m_queue.num_elements() - 1; + while (m_queue.num_elements() > 0) + { + Test_key **top= m_queue.pop(); + int key_val= (*top)->key; + EXPECT_EQ(expected_key_val, key_val); + Test_element *element= (*top)->element; + EXPECT_EQ(expected_key_val, element->val); + --expected_key_val; + } +} + + +/* + Verifies that push, with bounded size, followed by sort() works. + */ +TEST_F(BoundedQueueTest, insert_and_sort) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + for (int ix= 0; ix < array_size(m_test_data); ++ix) + { + m_queue.push(&m_test_data[ix]); + } + + uchar *base= (uchar*) &m_keys.key_ptrs[0]; + uint items= m_queue.num_elements(); + size_t size= sizeof(Test_key); + // We sort our keys as strings, so erase all the element pointers first. + for (int ii= 0; ii < array_size(m_keys.key_data); ++ii) + m_keys.key_data[ii].element= NULL; + + my_string_ptr_sort(base, items, size); + for (int ii= 0; ii < num_elements/2; ++ii) + { + Test_key *sorted_key= m_keys.key_ptrs[ii]; + EXPECT_EQ(ii, sorted_key->key); + } +} + + +/* + A test of the function get_merge_many_buffs_cost_fast() + */ +TEST(CostEstimationTest, merge_many_buff) +{ + ha_rows num_rows= 512; + ulong num_keys= 100; + ulong row_lenght= 100; + double prev_cost= 0.0; + while (num_rows <= MAX_FILE_SIZE/4) + { + double merge_cost= + get_merge_many_buffs_cost_fast(num_rows / num_keys, + num_keys, + num_rows % num_keys, + row_lenght); + EXPECT_LT(0.0, merge_cost); + EXPECT_LT(prev_cost, merge_cost); + num_rows*= 2; + prev_cost= merge_cost; + } +} + + +/* + Comparison function for integers. + */ +extern "C" +int int_ptr_compare(size_t *cmp_arg, int **a, int **b) +{ + EXPECT_EQ(*cmp_arg, sizeof(int)); + + int a_num= **a; + int b_num= **b; + + if (a_num > b_num) + return +1; + if (a_num < b_num) + return -1; + return 0; +} + + +/* + Generates an integer key for a given integer element. + */ +void int_keymaker(Sort_param *sp, int *to, int *from) +{ + memcpy(to, from, sizeof(int)); +} + + +/* + Some basic performance testing, to compute the overhead of Bounded_queue. + Run the with 'bounded_queue-t --disable-tap-output' to see the + millisecond output from Google Test. + */ +const int num_rows= 10000; +const int row_limit= 100; +const int num_iterations= 1000; + +class PerfTestSmall : public ::testing::Test +{ +public: + /* + The extra overhead of malloc/free should be part of the measurement, + so we do not define the key container as a member here. + */ + typedef Key_container Container; + enum { limit= row_limit }; +}; + +class PerfTestLarge : public ::testing::Test +{ +public: + /* + The extra overhead of malloc/free should be part of the measurement, + so we do not define the key container as a member here. + */ + typedef Key_container Container; + enum { limit= num_rows }; +}; + + +/* + Test with Bounded_queue size == . + */ +TEST_F(PerfTestSmall, insert_and_sort) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + Bounded_queue queue; + EXPECT_EQ(0, queue.init(limit, 0, TRUE, int_ptr_compare, + sizeof(int), &int_keymaker, NULL, keys->key_ptrs)); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + queue.push(&data); + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], + queue.num_elements(), sizeof(int)); + delete keys; + } +} + + +/* + Test with Bounded_queue size == + */ +TEST_F(PerfTestLarge, insert_and_sort) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + Bounded_queue queue; + EXPECT_EQ(0, queue.init(limit, 0, TRUE, int_ptr_compare, + sizeof(int), &int_keymaker, NULL, keys->key_ptrs)); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + queue.push(&data); + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], + queue.num_elements(), sizeof(int)); + delete keys; + } +} + + +/* + Test without bounded queue, i.e. insert keys into array, and sort it. + */ +TEST_F(PerfTestLarge, without_queue) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + keys->key_data[ix]= data; + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], limit, sizeof(int)); + delete keys; + } +} + + +/* + Computes the overhead of setting up sort arrays, and rand() calls. + */ +TEST_F(PerfTestLarge, no_sorting) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + keys->key_data[ix]= data; + } + delete keys; + } +} + +} // namespace --===============6282726538553789830== 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\ # 8v4h4b7snd8042z8 # target_branch: file:///export/home/didrik/repo/next-mr-opt-team-\ # wl1393-merge/ # testament_sha1: 2c7dc29d815df8945f836145165fba0efd6a74b3 # timestamp: 2010-11-11 13:43:41 +0100 # base_revision_id: tor.didriksen@stripped\ # za0wipbc4qqu9j9q # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWVnsPfgASIZ/gH//e+97//// /////r////9gY74fU4m+Xvp9tbmy3LfVPSfNNl98eks9yzut4eobr7X3dB8Iexj7BmjLb3Nc22+7 r4HAfd7w3QHwPunPlr18D76PW9XwcX0n3d9z2e9eZbffeg9d31d6p3qdffe+fe4HT55Zy7sHdffe 6u2jt99ffegLvffe+AvZoD4mgbZQGeVNvrpd2Xyvr73DmttW1q9aSlPffer17tT6jr3ZZvfczzex ua03EwjU+u96si98o+PvHxPe3Wwfb7vex15lt6xkS6UG2c7nDpy6qVSdDT1o69xoqRUa5HRu7Tjk akLWNtXtC+9e92HnRW99vPUVq6d8w8VtewA1Q97PXpwkiCCYmhpoAJomQyNE0xNTKMybSamaUbKb 1IZH5U2o9Ifqag00MEoIGggRARM1NMkmyChjQTIGJoxBoNAGRiANGgMMTQhICATU8iZU9k01T9U8 g9U8oeQg9TINNBkAGjQAAGmgSaSQgmkyRkyCmxGTJk1PJpG1T9JpM1NojygfqmnkhoxMm1GGiaZP IIlCCDRMgAmAQAAhhT0Ep6NTyn5NFNqbaI0mRtNI0NGnpNAqSQGiCaGhAEJqYwSYxJhMmg0APUAA AAAAHad5Q8qeWiuqIDCAghP466FrlYrEGESMRJEIwUjBSMFQigDaH/g/tJRPSrcrEjFhAjBIxIxJ IIN0FqDaJSwLAX1AtAX1ihQU+ykLJD5ULIfMhZD55afalpeWl9UXMCEYMYJGESDGKpRsBKBAwLF5 JYSioS8ktJFFIlyxcsXLFyxcsZpJoQqUlSkqUigVAEhJALCu0mhoaGhoaGmIhQRCJCLCw0mm0NDQ 0NDSEQmIhEliHh5SZ2m1GhoaGhnRJIkShoaGhqNVoaGhmRHRIlDQMQMQMQWaLNVl1l1kWF2C6y6y 6y6y6y6zVZdZdZQoXWXWXWXWXktJeS0mZaLmWi5louZaLlr16yaDTgkgpGKZEIccDCn+X6e/y/f3 JolSKOWUtv9HF+VNPRn0n96FkQ7ozrm6KKjt59jXNK7RjjDyJwWDNVf/0fl9k/L9djdEIWpp12vm 7w+6q7Yf6wH68djZ92/TwGlxm5Dg0zTXe+prYOMnMJOr4u7f8p/3yfo/SZ0gn9tw4I28sedVmBLv w7P7+KePDEO2MdEAUlC+mtr4XZYUMhcf7JV0Gbyf+dOfXs37p8f5Tp/7/4/47Ov/50P5VdGv7GfH qohEl5Jx1c4G9njtNv+vn16v6qqOlLwdmGnrd3Z/BnBiQsw1lk7K0yJMif7PpCjlf4nKSkOl7/+e MNWoqdMKAIQtBjDfCo4zmRKHxZLyqHt7mXgRBHrhDTo7LH/f/TI7Y1UuVaGQOXMJm0pYFn9I+TjC me3stXlp7d6EwdDh3viqXdlQGBwgK3wlo0tlVjmmBb7cvdTe33w2ruZ6axKil5703mn+JYW3zxi0 +zXV91sujHfKkzXUwl0dO/WpIjqiJlAdG9uVF9cXBi4dcDbwD8zjVCre+J/yjp6c2UeTNqOGl0U4 HfpjkPTHo9XzPgcd0d76zyHAQBwMDkhSZCU92cM06Uvpq0ijc2nSYUcpaFnJUJpT6vuimr+3dsZZ D/H6DaWYKa8lf5amuldxy7fcvdZWVIVy4wySu7jqMpf5PivlP/axn0ad8fPJ37W0uh9e7/2uwY6f NPIiYSg+COWbarVkwQdcbVWR0xoQG+2pPbAfJz8fstr+jW53Mmv6wNcgPhQTviLV8lmZxMzR6w2g kGBNa5aoR6et8NN5pqSMWAm3V6ekHZZZaO0ZgZAzUL2DQgVoAaAKoZkM70tjAvaJel63re5Oa5wY hZs4ADkEJCQBToFYBWCt5UzM7aFpI0LTawYDaG0Ly8zmczjOM5M5M5eZ5I0aNgNiSIkMiIAVgKwF oBTMzrAOSMYF7BgMYXheXmczmcZxnJnJnLzNjMTbtSpVq1pTMzqwME4eoAA0AJIFEDR0bs2RZFk2 TZ0bEmTbtbEVFLCwtlMzO2Og6USErZGFpmpcZUyuVqtVsuVyskkEmLyIVIWlpWsrK0oAhjUjSOsx nUYmNVGqjVRqoQEyEGJ1GkNONTGqjNRqo1UaqEJhFhQNONIRJok0E2gm0E2gm0oGt4XFZWGUVWVE NPnSPhTK0eMXKaL6aMViUysz9U9G51dpIwvwu9yzVX//xCpO5AqE9LIKQQdjyGqSkPIqh4607Tr4 5gtTw4omuTr+vNjLS2mwgn7JQATyQkaUjOO+XhSrSSsQ+job+Ljz66yL8AgZ9RDNHY3IT1mE7JDE OlSgL4MlQFAFkPU81CTE9Foq8+rQk8Pz3WuuYYTEhNULCgn3e8YmmednN5D7sMzuTUc2Dww0mRV8 aWc5eNYznJpTqMaeZtTeKisCnl5u88pyMZzssajVZradarNrG2FV6COVtGqWLnKetm7G13Ni3ig9 Krye0ic3q8kXS/gQ179flvVrN31jaSTrZh3d7qSve5caovJolGsR49V8BDqrIHYDAwzMUPTNopIn N1gRRUateSs9noPSVvuv7Ag6qgqjnIKqvZRQDyRTywUKxUC8iHo/kbfqtuRS+GEMZwTCIuMZAhhS jJF0xLv9McN2G6YnDJ52BLaTplJYhjiZPLTTPxRRTcVwjQYJf761gyBaA5oOECyB6dFWrGSMiESQ T2kTj/e2qISAm7EK9EpEIgnsvojDSE7m7FSe9KBZpCgxAAQTys+dnkSGyGyE70hYkhaCAcmbemG5 0TF+HepjpKZMSJCSOXKNK/P0Ucj2lPEgLlmhDkYDEY6pe+jMK+admKm+DHEOrRZZR8tsmpfVYwoJ flgRihtjFWRzR5RwxzvSi2+pRiDS0AeSR2kGvXDOOW3RmK2qJTWn77hDx1ANpImeONlV1nnt36vd X7hW/o/WD1kYiACQSBNp70TsnKtU4w69/a3M0SrGTX2I+PJ0fgfIdH0tuk0BChmH8BIET5h/gVHE cEkN2gMObH+Y4PIS5f4UGvtSD0jwoMRgffMyMQ/5sg1nT2mXLWNLRoUWF07uXRoRZGr0CVNpADh1 T9bzp9iPye6NF+Q62u+zab2IZs9Aj7LbFDbJA9yDmBM4JFSRkEQBRYsWLAUigoqqCxYkiMiEinn0 Dj0HQrr152l8SIEqRG7/JCF83s+f4fPu2zoITJTiC115+H1kM3/oO0PNnz0H2Ng7NZXTUhONZFN5 OKgqnEiS9KcKdPZxWYp/WsCXDvSvhWxerJdRbsYnA7qWqMXpWuaXyFiq2tiLYiAnibQEC2dGzNks tFhSlqOOpPPO29UQze2+pa3pmmrQmMpufpeAcH9edbbeyNrOnTfs2wlOH/HOJmGh1IYSqWWlmDuQ aV9VxOLCttDnxBrZDfX5ztXYBTVpO8hETWZBqwjb/Wm46qm9t1tqZSSCQjaJVmeF4aF20kJwoGOD 3Nbas7IbI0gNJoZyDWMDs8bxxXBHCwFG+YhPciJccO88xjM7QuOIWyOyELlnMziIjOG5zunSSGpg ZVRB5KFad3csLZWtk1ahNY2janqdI/a8vae2OvzN9fNddn0L0jBXVlN06wdmn/l6rluGOLVBkpYg O3g9TRhkTLTR4YVuM2u/YobX66dELudwE7b/mdmPv+OhURLrVt87nur9B80pygmoeJRafm4biQfW HgQDDDLNMyeTnQtw5+KsIZyuSu1WM5y/ih38k2KRyCArkCQV4ee/RaOpWB/mhC/l08J8vSbOprr0 SR3JbacqphMMXRHX5GnDNxU1VOwsx6nvE6IAxJ5mCwohET+pAFKfYPrc/RfQjigivpLVjlXB6N7u UTJwWhn2dDCkMlKWmCKXzg+UIubly6+SqcAGUAcAYQYwnNDd2eWgbi/OrDsasa/LmpjI+c+Jm7kx JcPLXwdBYfVL3FuisXESOAI+wLc1vaIMf0h/Is8bVqu5ObLRS6zvfXa5U3vK4Q8klnjGBwDgHeHG ARJ3FxZFL2LxJMjImGexyTBwhBefNKBWOhsKoJP5uUFDkF4aBiKNC8ggLlX0GLJjNfxdPs852R6t m9PiQH7NlcTcZ8xII5inpN39P1JUT6f3M2vQWDhLPwUdnYNo0byJv9SsvoMmUuxR1h2nZx/rD87v vO0f8wy3vD8pYqqpibKH174x2/PTRU9Yp4CjiipLE1+99Lf3nI9+8x+FPjKb3MLaynAyUT1BT1Wy g+u3NGwvyt+8kkdSV+zx/2Mp9dxa9hzb102ldGe1RKM9nCjEq5Khydfb7cmQKAavw49nt0eD/s9O Q855zbo3ssGhmgxCNhANcZkDdr+2Wllpd9aojBZH2R7GLDEo7+nVky08Ez5h6bG23kG0auzGXNuc /XeeS6Gak0r9npM1E87bY0G0aUpurD9uaUdbVI0iQFXiHIR7TDFgMCMUksMClGNIsQ8jhh5+GynG SnpqaoCPshyR5snn7a7RtNx10erbt13CK1kBUYi5+qxKm70VwclK3p37VW/H99vO/VWSnfO1pvqU pVdVXWkGPF7mypmpROxbJKLWz1T6xnFVRzwyK6lN8PjGEWvMkVSVl55qIdVpgwlSyCmj4rb7+vHn 8sykrDOPqzkNtufayp2s5RQnZmqx0TITk7UevGdDH5oJ6zE6RBz5wZHEsCL4AWQC2TkDLB8+Qa51 o4+zai7gxmow19RhhecdwEGl08b6Ci0S3yLwAL8FRK7uk5SG38ZEobge4r0Z52mcck/njfc91tlx yo+v21D6UoszRG34t9FyI4XX1TelEGn+YP7oxT8gKuLGPpDFUM+vDoK6d5Tmo/U08PIXuZ79rq0S HH34W8x9rx9J7cCsWb4L2My8iGG+RTsmre9VfsJ3m/ZdzJmByVmJ3jv5keK727plUt2+5eO5sLts CpNf20BdlwWaWsV2TwhXLAcdsFGjBZPyw1/blrKaWYGppphNTendHhfgmoyUuYX5mMxadAoM+yB5 iBwbIQl4wrgFSMwIghyMjIqTbNwKOD9BkNDOut81j5OHX7BkCZ9WUe0qhRYci7PYdfBX97V0to06 rLL5HKLDFEMTydjb9mBZF1lhOEBqLF0QKw7p9/d25abGztsG90N10ct/S8iafo4a2rQdfYnV9Mcz 6chGGFm9iWabqOd7nK2gJ6x+T3THUyu3fUdwn9WGNlaOXRl8Ve3ykZ+z7+yU0XjEsH0dyhJNyuEn 5nk90+8U7+EviIJROfwwbZ2vo7EGz7s9h0nqjfhk3ZbaRrroH0JquNVcVTkYjfWYydx26wQTg7Dv IUMKkcYrUjmvDlBm9l4ScMLh0QJ3dtifFX3Pcs1lxRfRW85qZvw+V61LqllfPdLsbWqqVTGXUSp3 7+Xg1mPFw5XTL/NET1B9wjA3BIVBLasWlRcpHhmdoM9fKUtrWZsiavcxmx1niRqNFWp89M5MaaTZ 0ECk9zBpeCrcjN6dY9tAWRVSuQW7skK97V3lcRWGl1iZOa5ZXf0k6m+lrhRtY52TMfmb4SKYqt3G OiuTQ1hvBHzAegDUchhgRTjqqIjYEslF9enqlLpi9rhAe2/g8LG+871C7l73HOb1HjiOjlBay29u WdDjut0PmWe6nHl8uWBoD3DwPJyURCAhJAFCqFmGyoqs9JJZ+foYx4ToRo/I0l381mmZnz8/UT9I om8zESJwLDDIU+sC/2rsMtGnk+0Zjvyak1HVS6fHeJlpy589Shhdw543m52Flo9il36PCiUajpLz +w9hS23ujn3lkwwuE6g4QRNrqUG9s7PQhQVYCiwnbin9n7J+XJL/FSiZfcCfwHzfh9t/H+w/kbsR JP9x+qib/tnKfQx5ftplRyt8kSJ2Pl3/Z6+7Rnr3HNx0MnXcEkU/Z94GlPBR04ikIu2H5PIQDjb4 OU8P2vh8FtqozqpxjU7ztbkeFuPyfH4R5v5MA3gwMDAwMDAwoUUUUUUUUUcziczuPWdx0O8zNCjQ 0NDQ0NDI0NCxoaGhoaGJoaGhgaGhoaGBoaGhoYmhoaGhoaGhoaGhoWNDQ0NDQyNDQo0NDQ0NDQzN BoaGhoaGhoaHHU+7+t19yT2WtPZ5f2/IfcUVRVCIREBQiIRQUBEAUIiEUCKEFCEUBQEQEQUAUFAU CKChBQIoKAKAoAoRQE692xhPg/5MxwLEKkUYxSykEWDZKKMCCgjFkI5FPxAJVaRYlFn5m4AwEBA+ YnU+IyBNoYH+mz92QYCDJOjEzt+HWv/lApBT81LEK7E2e2aKHmp8fzli6hipdE6j5qAameHwUCCS s9ay+vJwyON9rzGu8L6xcG9TVJmaj02Pg8qv1pOwyyFzD6jhiohhgXHy6gfXvA+jZUZuQBGUBcJg ihwffV6699tZy/0+bgax9I9FnoPfUYlBRQeBRRYsFFEUUFFEUUFFEUUFFEooooKKIooKKIooKKIo oKKJr/1Rpqz3FdlZRqaOZkfl/NEOFIsT8+wdV6RnTGnKZqfws64VNeQZAokOrS0cZ1m37K8h3FAg jqDQPZbGW0XBwllnVaZl2UyQr0DF7ImNEY/jCUP9+oiEBWMbj9juyqQy7ZaoK7a6oYPubGqn/CXv nnZM2ruN0el3CjQYN+iiMloy+Vs36qSirJPt7I7uy/JsrevmxkUW5N+M5ehyM+thfxYNS8r2U/Vm hzeEKC/ue2PR8RoZJe/485UXBODNRqDA/a5Gn7fC2opy56Y9dGaPxbJWFH6I+6GOEcN31saBlKh6 Brtt0BH0fnchZvtvh1/AgfCOqBi/khx++e+5exvEKFKuD4MZJyhbDHGY7J86j1t9nhQQob5zUEGE KB8snLMhewOB+56NIbpOXVWVZJ9Xb9PP0F0UzCvXTG/zakmWlnO6V19KN17XM2csqSTA3+mzU9ph vOdpfVkS7mG/ZqCIDJXf78FqAAIfL4L+5M49Guoc47PnOF18q7KUs9i/DykJqpfy6vScLRKps61G NE5OEhSveieubdGbUWRiB1HPzKzt7/n+GX0myd1LrzDLzP1lsMy7NdZ+HMASEdjvPx2ZcVS9tp9g /Zu0E8H5D9TzBRUZs24yChKRJ+YoEJSJEghN8+j65N9mg3oTNZT+6IngntjI4wQKxkHu9Po3TPpy 3/HCKcwESxgKBpKh8FNfeTRypZIIxSCLIkDTIlsk7d9N2B8fV25HzbEVGA6//lEyIw1x0jFklDdi eai1lRx89PbvfjzyU102VRiSbrP9VkrJooudGx3OCYmN7TMZY+hrmZ7ILug5Swrqg2+mfXd/Efo3 8ekAkCpk3M5Xaz2TtXBdpKyoTReo+bb8uQhNfy9XpKOhWIvqXkP5Pawz09Fk7HMWbDEUs22rVfbJ rh2dik6Q9oRjDGnZUL2jDDYuOMNSVKWkKRUoJQbWdShwRA9q8235FDazxK4X30W+qmlcCdOuufE1 aOVcUZjUtmE6o0ELC62kj/Gz1Ke2cWXE6dy25SVKTkal/Ta02JzOistwrz1cK6DsbJqGWUM1ygyT sHHTZcY1x03QuWAUAwUek9R8R9B9B9B90+g0LlyxcuXLly5czLly5gXLly5cuZFy5cuYly5cuXMS 5cuXLmRcuXLmBcuXLly5mXLlyxcuXLly5c0Llyi5cuXLly5c1Li5cuXLly5cuXPh909ACaNAcPFf 01p4JeIG2jZJgbCg+sixhJD5ctQyfk16/X+TbyOJc+Ye7Bk1d4n7IIHI7zcpeIMmj5TUWDBqOsbN mNQENDfhxHHR6UeVubQUewxhHrDm6uTXBlihShWzKr3+3BTgi4NKD8Y5pLbwQaOhsFQLHVftd3tG j8EM/Qai1BURe6LNKlTtiCqZf6IEnrRJqJgWUCNhJzA9O5zd2Lpe9Rpqo8NW8zI2VonG6OQb3Jve MyODNunoPMrJ8AN9pLlAGx8PibqV19d2LFwIx6IgLKCbZLTqcolMizkpN98CJPGcTMxL4s522PXF d0XI41ZXGwVU+PyKrvOxn8w7qrj73DR1jDXN7eYX5/V6jYhFH7v4w5cFUcnc1vBxtN97DGstLxHi SQ6NM+DRinZ3pKRmRlC2sbTkbjKSAeuEA5fLk7HeCfWAoICSdD1U6nXgqZ2alYFnpzDE9dGyfB4p xAzJ5CwsjIhtKsim4GTJLHYIZ9MJ1RiEh+CjBjB+SwqIPYs+l+UIbStj7H5PzldtzKbKMm4/+rU2 v0x/wIFuANYd6d/UXoO7avbdatbbstb0SScEpJ0nDclcRvv4pJd4M1G610V7ZiN3XnwQbdmHAAi7 QYnUMTdWJ6SJ3cE9B6TcD0mcCGle4UO7XQnPewDCMAxgFNSgYwDDuoGMGDhaRhUjepG9SN6FVL0N 9d1I3YnU2nTCXqa09ofp9gkJuw7MA2a96Tp30NJ3vbikKw43s3d2SVkhiRd0OGSaQaFUckgpqqip klWIwPVw23yS5qcjkZm5wOJ8Jy4VwWbOBjPnycS0YTKZRkR0oowoOEwmGg0Gg0Gg0G5nGTWtayys xhLBdWjGXXXZZZZY4tkSIZnM0vOUvFPmOZhsQSdRhWAME5KkLExs5GCbhtttttthtxEbTMzTbndj dukHSznME6V3lERETtayokOzyiIiJ2tYCHd5RERE4iIlERESiIiJxEQ8RERFIiGiIiIisQsRERER aUWl6x55TYRMhKMoSLQysZbYzLEywlSC4hwK90mjZwQ24IZZDIiNYE0OJRIJmdDeEMDASsZCEMMY HcKBkGgKBQZZZYMKjSzZiJVwGnY6jNWxBuHAcBq1atWuZd50oJIRn1h2AeAZZvOJpeDg23IKmJdQ 3CZjYYHzWcXQ6GVyLZ0MFYN5dWT0lishxRk7G2wlA2LNPBVZGBcaMSUlEIBazPckmEEGFyWSIZZF kNxSRKyCDKXMmSjEDffrnMeEDptHxOmHmpzTpsKK6w0mJo2NymCaCmmOtGtAIhk1NSKiQ/GgeiHY 5Nzz/1YPE6KFDJwdFGC54GMeZQXPHLn6dX5+IPoqnQ4gyBIEgSBIHREkaLFUSsILCChICQIYEUJH xih0jte7baGzmk2BoC8QjWrC1mnwRQSA+lhBNicUWiUkqOZaJaOdhaOfLlvs5NkMstfmbigxNAur g1sZmsTJyTdQBXXDSrSdZzWmluGGWLcqkVRsPwPtMTBZRYpEwMVkFjDAeh0w49N9u2TnyPOYnQ0N TuLnadp0STi9dcq50n2K7ST3ltDvYHadDodDodDodDoebkgvtNTvnVxdjmwdiyylkXPEnkM7E2+2 jh2ZJgRz8o+yc5zN5pvDPKy4YQVilALGiUW6m/N/bv69/X/gadOSLHt0S3KcKiwGFoWE4aYQphOl 8DGXJCgis5yUFaVvS44XjT8prgC+E1YisuGHKjscAiWHVgRFCUpduOQ7hRKwswdBx6pdOhRJEwbZ D68JbgZJskgoEZHTBxjdgGpioEuOfUmhpBUyhlCEOAES9OKNrIcBF7m6cVhNwYCFnYkg4MFnsqcr j6Rt2119TQ9LGFy7udvq2q2+jV2R0iptF45R3kh2sc6d53mvsncy4eIQ33Pab9Bo7xeH4DxLbYb5 uGpYkcy2XauLtSGlJCseHXuO45N+14r9ZE5SRNduOS+mpQSrLocJ79m3tDDjNxc7HJdK7y2DeEJx 64IVl5dMDPPodTdlHSr0vKqVpXKUdz1tZvKnOXnOc4FVNXi5nM8Xn2zZnV0njii3Jd9hTco9edz8 WRJpykkwnKYmyNN8hyHCVoRnwFDJdXAxHFnIKOilaUZ1oCxZ1WyuztZGGGgPNgEorSocJNc/k9xZ NCVraHyGAxaUnX4NKzMLwgg8IbB7uJkmwV6iGvrr8gxYNDsBDELUC1CAmf1bCBcWlpccDx6JIzGo 5FAxUVnYqhoFKEijA3D5ex5zynmo4fj5qEIJBIdMUoRTaAtVELSBoOsniZTQu4PIGKKfo4FcOYpC VqC5DgqpEsCwp3hgUYGQ2oBYb9u3bsdjcRewNIAsbGYIS5LZDSFK0PbWa4YUnfvvddVetKFGi4Ae wyKMBKetzj7Z6DAfQNg2DcZm5zOB+LkD6J0wrtlYkOR9Q5nI5HI5HI5HI3N1oamE+tXeeM8ZhU+s 3d52BfA4WkBwIhtidxuXAZy6bsquqm7u5Y7u3JyQhE6TmwvQ9PY1AwllgaMI2Ix4Hn8IwlSaWAcf UchyG9C1RSt3EREdDbf0dBxUSrMiNhhGSjoxjUFA0BTNqhoKadk/EqYPkbkF1FTcwVDKAJhUQIot pLgMhymE7XhxMFge9JiN5lBStEoMYaBhXDIIBZ7tkMhg+0tKd8IiCMD8QSSXidpFx0iiQMLlNkcN gLz4q1NBuHdIsydyz8KmexscHGiR4HYwaO0b3vXYdhjnkyd733XnO8zeM925xMlG9sHWwbA6drY6 Oi6eS0E8snHHxW2A4AhPNeA4BoKXTeRosuipH3wGALQu60DINTgbyc9RU8flas2Grrzly0Alx53Q hCkRlKzIqTaVn6V4qZqLExvMhsIEjiTKztVC9Jp99xM1mpVwPOs5yObFJ61i3vjckNT5HPO08zpd 06kdb4HBw/a/W9jvij4nmOUQDuO8JAgsYhCPGiPhUR5DEu3i8zByDrDmdspaKoossQXJOmAdAyTi HQMiMmnQR0R0m6GYgyZJUja5BGFXCyW7NdC1y7WajWejLRieHnVndcSpK1bQz58vj7TCAuH5w3OR scjmcj4u03Nz6pwNzc3Nzc3T1SipmkTO87kwywO5fl1OqYsdb4J0KbJuFiiKBY4XC0WSJq+OON9q pZUNqCjICioEgzNpb/JqAalwrnwcxXViGsLnWuA41SpUtGERIr4DqjrLygjdK93VOhsoZQuCmZlF eJkdKqigOL6Gjg8imi2vCG2DYHSq9hJmgcqV6K3Jk6qrUCApGTH5/LW5QFOdtDHB0d9clus55DkK 8pS520WEeZ29C2h7ayGQ4SsYSnc6nglW674DAMJOvj3fseQx29a6JRgMBOQnYUsckrEnDrh+1wuF qoJ4I01dUv0eIpM8e1pC9E3+LzHXi8nwTRwievxcXes6Mm7q96YODZo7Xa7m45nfRw0PS8yPi6m9 7NLtBvdL43QeB7nWCh0IPW6hRQqUSnre4kcWHg8HM8xxIFrn6DfDYongUDbMEsgNlks75kyTJzMh 1YcdTqbGdKbczmmucBzpmKVW6Ew08V0y3o7zWs7zWkpNWxOWJZqFAuFg9gqFwgbGx8LY2Nj3Tc2N jY2NjJNVdnY3aDASKCgTmrIK65Wss5znM7kMBFiQ6BvKJap7z1+lih7KhdszabOHQ6GPClTpaO/n vJILIfQIJgon0zBYR44b30mIC3AbgKkyGEx9g/XYxMRBKXwsje7LGQyFURBLfhv8zwK8uj3Zrz4V xhZTbhztscjZOuydkOva+CduXN5G27LoNA6BTr9AODz5PuSmcTbudVttzKbPuG4Y+R4cFK85H6Uq ltjKZDIbTUTiyU8g8T6tDFsFis1wGA3R6ryKbi7KDaPU6rorxGQyFMG5Po1ofAZ395nqPU8TkGZq +M9rn8L5U+kVxcK2tKsibGhwXXbM1izB2tHpSJTxeTVmVjH9cis0BwIGjzFSmSJK0ylJSdqvXWhe ZeIkPT43N53qCFHUdrvb4C6VShyOxCBGPeOsSNJtNIbQ5iXNQlY03IqhOgm6dWBCCgrIQLOzeUBl DQ2FFCVIs7RDITWdmlM7arftKZ7VkUvWs3RZlKriURILypeQjAwUCofILi5qbFy5cue6bFy5cuZw 1m/LlEbQYCRpcK1dRqdNa1sawMfa3c7X5Mb01yHIcpvFNc7py4dhuZcdg6L9Gtw3CWxsHKbibCam +TVD3ne+xbtQh9g2DWooxsM3TH4+T3oJoLbEZDIS+BI6NJujJ5HwMB4kZ8hY0GgnvLogueZg8Lqb flpjXryzWDcIpuVRRN+x0R5+qJv6sh9yY37rtwHAbU7nNBiRTuMeopTYlULXOe1wyF6SGKrpebEi kFKa07pgMBMughaXrgzRGukKFU7/FyXv2Pini8NzvbrtnbzZLuZ3uBq+CeM6FxYSJmUqO9elZala uK6l1HFbRdSyQVXRV9FWsC3seMEN0DjMDnckIsdJ0rzG4HMG0XG+TQOM6hbOts2u3PmhzE5m04+s 8kVrbx1r1zBxFRK3ZvNtTtGIh3TWrTud3g6AsDIGALA2PYaFzcuXLly57TYuXLmku58yMSyGApYl O2bZrnMMbJn24dBB8nxKkcG9A4CW5nmefsXQnxUtgk+Gv1AZCRaWRyoN7AqO4oqdGS5Q+SRqqqlt V0Gg8J2rwO3Y4Rzcc3KFdUXiC65DIV+sNCeJRTRj3GwdixG3dbmFNBoGou5Ly1U5NVPkRg79tvBt BuFejglwxoNz6USuuVxxrx0GwW1LxLuOc3Nt0totqa5DIUgwTnXzCQeJ3LYtDQFwnwU4GPJ1T04k ognNBnv0SdrRg5tjFZTxaNmTR2mjTTTo3mLFR8z7HOHaZOcew5miO44dzyvG7iJoA3jQYnApueiJ YOg7iJRoPwY90MFZguVysUxgUMCk0ivlSrYxhr0aKJEqrENSc8XtSzM81ezvLMveelwqaFzY0Lnp ORxLly5cuXPSbEBAQlk2EZkunPJzPU6X1PYNBfKCErWi217bRsepSpYSQY4I4ys77huHFYE4dP0E x0b8mam4OF9g6401tw3D+lbg3KGiPmglDI6nbW+g0FZh2JX0vJ96B7JYyEdLxcMhTdHUzRNjxKFy FNmIC4TguJTKSLBtLWLhcK8EvYzoU0TMHhuaE5TBuE7cqQ1dw3DiFDQnm5gupjCwEBFYLV2MnvOR 0qZCduWbIZCnJ8pfA6N0u2tAr3yyOznPhHt545Y6evfbryPq4+SqSQqk6OIdRQXLSXGBzGUqCsqI EzjI6LBSKSk7BZzopmjcpVKSrUFQISzK4VIG4ylxoOKWwOoDQGAlXpl2k6FCiLkFyuc5vYWGBaJ8 oWwrXuxmt3oUdazZlstrxRimJFLPTKAk5TDAQFgsEwgID2m5vtGxsbGxsbHum5sX4azeE5uY1eed gyFaF12rXaNrbbpCL2KjceYiCdGB0RJCYsxOpc5K7sbPffkOQtiF1YxcnQwDlYCAnaYtUVLZPIoX DNwuEvrhBC8QTIDbOsBgKQ8vEkWCcl+SHO6cc3DAX10UJ/b3JFDYOMLnxgMhWDsTBjuQSsULnip2 wGAnoNy2ybzILqcaNshkKzyUPAkWO6m+1rhcK5Ojtxtk55w+G0mWYXVgaCRecSQ5qLhiiwkaSZAo CidPBq29G5+P5vhlkidV6TiOxd2ObgeI8TzgXESZ6ykJLCLhFwuMRgiBaFbNNwrPnDzqYeuJ1nNV lOllqr0rNWnSdU79vEKhcKBUKhsFzc4mpqampqampqecuZDjUk7HAZzoLBMlLWra1rUzHiYNBzuT DcN6SDQqccuOYKULg8BAfBAn4HJBU7EyA7IYk2AwHzEevkMBU+zuTLomlE7KtK4DAV6NS9fE5KRS HOciJmlVkXDIV63vZBD8Ak4zO8jIiPgMB5k6nmWOj3k8UvSRgRPjTIZBkEJq/bklK97yLiJPiAuE 8b0OeJj5zmWREwGAf4mPDYU8C/GKtkXTv0KcFy4WIMEzbqxk9xUg7khew5u5lxYUkTMVkjJbbQaj rDIg8A7zzrP28NBlaIzeBiSzMBHxcgZ9bgHgHs7msoCdapfXVux1SNtJJTecPBxC80CChfgIlwwg EEI0QDWrWA4WNCwQZBBeNN3pUjFkgwQDGRNZmgQbKOKdymt3rhRU82pHod3qBKisKHiJPV7f4B4e p1ge7V3tIe3ppkUvb6YPqX3F+rkwUto6349vIPvv8Ln8MiJiUyNzvbU57LHRi372KGBmqlRAxlOB iwdCjToiYsI7teMapOxBl5MwUSJy72rYeb7GHsfBkepgdkpLy0H6/hObQ54dts7zPVc92j8dc7Xm K9ElCMqnXTWnVZU/nZFPlH3uEdvDC7sm7ghIbI72exPXs/F8Inf744B1AwH22ybMDWDIjNpWsAoy Hth9R4B/TiAAlaBIteOZLQ5rlzuhJHoXUpeY4wR72asNTOy2V4xC4PhFXQpWUS2r7lequksPQIUi p3Yf5SAYZiOQUxBktAfSJ1PUoX1vnUJ9nOMaG3RnN4DzYHvrOvhCF4GY7p+uPXUdYsCSZ/hQaS+1 sPpe8FsC5n/hfOuTFc8LnovPVpMKZqiDxoK8b2nPkyiwVUScHly7rYWWRl7fcDSva28zqBpGvUaq IygqorGIjBFBIp4KVZKWIioMkBmZHBAnfWrsuKDJZ9pWZzqAcy+H1oRTA4QC5FxYGYudRzjqUjdL Q8LRJXEidAvpBWMkAr6rP9a9S+cpIBQP9g/altgqtaNbaUpket87528D9Cp94vL4X2mH9tyJjj/q HzlT7dH8WWb3O/xEsWztXQVS8TEffqAPhnp/LQOlzpEPwh4qj1qs+r3P6fbk3kVSellRAFSKYKXv +OkyX/1/5l1U2CBRUSkD9ECJB/2guD+xY875FSHlA5v6zzzok7MPxTU+Q1G1TMAZ9aiJmZyqEudX focc/ssFBN2H9WDmDmCjpb895SQyEIG5CF+/5pbgNiSmI0ejxPYe4ASJAo97aQLwnuHRfBAlCjiW vE/zWT8AwSu12oqPeDCZIKxFmNixpZ72GQ9Evroyg4/0E5bEkPNJP5885r9UpaZv4GhwJIcmcdXa 8ImVxIyZztIUTTMZkTV2z07WPCbk4ndNTisqRaSOxJ3LajUcNk4CESnA7njyoBi6dI2trM/wIvm/ LpSEDyoTwGlSCkSl7Izu4TfbNgAqhRQomAUVADCRxKcII5dJlaZJeJq/6WrSJWDk0GTrHvECKaIc h0tEOCHG1F9AIUbgm5dhXkY3p32c/QPDbQ8D2V7k0ajKJI9jYnbW0wVNyW0SR5o1ArxJGAQ5V2F4 MImd/4uelh4EIBn7feZ0VOB33e2vHqD/t/ppPLOsgQkiM6g3ukImPVkgB3MqdX8IHWwr/4u6wEyB YG9dMUg6JBoBUOk3R3S/QABaCyC1JLOOJBGVf4U3ph3Sjg5JHwGyHyCnjJJJmoUtPXaVhDO/SCPc x2MsRmoA+LuhJGJYgZEtjEmO0fMu8cXo/KW23VSiy0j34nlKseedahHWYWNrjrqmF5TdICtWsoKk YHiQywMCKPesP0qTSZ7o1mnxJ8enrckSqIt2HTsYFJ5f9ha3KgHEhpHvQTEsJcJdqKuhg+6HybwP SJBEEQiIKKKsRBVAgEa+MDyGAFRPF4GqC+x26KBFV1X60bw35DucRjPV8sk4mbJhRz4TlJprPcod XJRuBiTVoE37NGXMkAOjQD0o7FTMb+GAVb2h9ImGYYqJ0MoSBQ3HNUJZoArGxDsLX4hUksmJKmyT HJJY7pIHnFm0NQMppNYkl7Syw6jCSzCUCHHs5zn2eWeAzwxCdUEKcDkFUWpEonC1eSlKUUpU5Tke KkblIpQlJFDsdnmwSGRkRYy9KSONUYngkZOKjFL0u5NIVr6Ioe2eC53Bg6bDRGuBuLu3D7IPL3rf EqGNV+4dGHeqgrlZYYJ1lk9iJHkI7CUUURVIqqpUqHhMEPUkjyCAQJQJLhdcFEj09+aLcVpdmC9y H+iAO9eXW1mE80Aww9AzisuPJ0CKpsjVuhKqqintNRCM1MSQ5IDJG8SoE6ms0qHBOgdbHoiSCW5Y w/jw5aXkfQUH+eAUaT7IVr+MaJ1x7YFJI4xe6BjA/mYg3RkWMLi74INmretIagZg9qgDAVfGIO4Z pyOdR5QVtn8YdIuTBs6S9xndruj2UKe51eDGNI6DLCIYsUsNMcESYeEbpSYkhggTaBvDtaAga2KV uIVfKGxmXk+cBfrD7qHTEJIpFBfbn8Eyw6Hop/dH4C18/3233Rk/3uGGv1+hHOAlzSDED5dimwLo LY1LwQb6foshpeyQQg+6rgyH82bWV52pRcbZFdeS1BhyKFOUkKGGQToEspdnUfZCx3sKKp5N/wBv Fl/YE+6fpCUkHkDtA+CNfa9tUl9g/XKJBIt42YFw2xtRKRXrql6RYOaxfIkLYNT9QsM6pk/mauNw 94m3MijEW6h5L54akOszwi4UKLrRMi1w1XElLjImfSWMHRfYjDMPdwkmwgyQQDk/UHdo8Qs1gg7f l5Bj3bDDqSXXJgM7FA2koUoyImk7KVZVJMjYgUgkWFOlmSTAk/ohz1PxD6FSIQYjg2XBipNNCFIi E4mpik4iKpbr5lpDpR8Z385Dv13zgnd2hQNd9RixiUpWi16lFcPkOnQtVVjIS/DV0kmkcbnKwTEa hE/BNItxWJjShDOhRWMAgsBEJYIa0c/Rsd/HAlO8ElBWLSLIFLguCYqoxmWLUairYVrxs6XWN2os g3mjKAUSDqGyD7miYOdzDFNDolNKbYxdH8qfV1wjSmULamMc2Du7e834I7sF+Wsb1PQ4wtKlRScY 373RrkKah8wcmOwyxZYyiHo8PyakYzkIfynI3P4wp/Eqi5nSF/cOOgWs/tPaF5+JwPcROSgf3ET1 Fx8SzCjnpQybmioqaPNGNiRQocjMTOTYkeDyqSfhOrrA7XN4Zxxbt/JjTG0ehT42+MwVKDrQyH01 pDLg1XeZ7ZrVHpmuHhXlIQdVtioBXGQcUBfh/ezYuH5/p++U5MmoDPxGrDJFbxuZsKCZqOo5mfmX BsMYiEwJdagb16RHDgA8vU7t7X4XQCikIMIgFCZPdmPDDJCf31mFGlV64hYfiH5DoN780q61NW2W ic9CUnWFBg96mI5fUwOlOf7SowIOSpJKSiHgyAeoEDBLPjCezOXq90vpP+FqCpgKUQ3DGosQg7Ew zH13B7SN5hzQHC0tQjiE5nQI9MVDyIgmJugbuvJuI5mkCK0YgdEVHQJ9NSNw8BcPAYNjAYP8IZXh uaiYj9OkyYcfcKrka0lKj1JiWkWs7JtrC7CewNySCkmyyNTNpIfORB5qRM0sPJ+KeVqBMESigQSh D1UyrURk3GaKO9Plo7lIq5khXgbAPAFcipkgV9FOeCjrfa0dYh/D83EePZxdTlrj4b5fKfOw/tpc kaQ9Z7CFV3gSLTzHEmHa8V77CRQpbRwZPtMN2S7i+VT3X0nNxdimKYxNnX0shIUfzKgpM5jd14ia oylY593snb15KskvfiNrLTE84ZTaMTMSiZqMcgKg0FRCwvddaFrMTaYHRaDKaTjMi81ulz9Okwe0 4/3vjcGwRhIESQCKwWE4YW2BPiiTJAwPZnRX2BCh/hfyuB+X3Nf4P1fw77afsWgtpb27F7H8P1zt IcxEOdqjJ9LFWpPfElYChaj5L+7honv09gZoHfepqjfGSDIgTvns4/6FX6YADICZnoiF5AJAjFvp 858KLV7uprbxMaAN78xcoHgegYpXynpOZgUHzKgv9R4SPQQD1m4KiJbMoLCkiGFB6VecDxMw5ad2 Q2BBCewby+WkmlI8ea6hhmYvHR8XdMMQBm3CszmcVxxQIzms0HmIgZjYeqR7FHq6hxxxmYHRabHx OCkwzGRsy4gbHc7Q1DnuzkKUvs2sI8GQFF7EgnCNPDTvd+phho1D3OR72xlckaTqr4DNE+uUb1EL OKJsQ82vt1h3G0c5JxKoZ7671wSLR3qfX/Xn2X8G9/jarJy6GGbJ+3F9QN5hsT8RYVEEOECFNtEo KT5iIez4UNHAHkPi8fMfzOXSwkZAWEWSHBIXbGfNP0dZ9D3CeYa8BvOP2vDM0dsK+7fiC96ZKuhs humyY6SXMmGkmUPU7YSqpVh0EQhISmoDVwwwGjMhSomtAcud2+18/T7e05okGLg9G90rrLMafZkh CLItaJAXiRPAY9BaZDMH/EY6t187c2Qc8x6D1GVxfX7nzPk+PvbrvJups7HLsmM7FTrXNydHQx3U LwKOYywJDUKcMOTk4VHIMwo6DI3CFjHwdO5kwaN/r1x1p0kJhIwihhLUWCWEiSEWEg75DeN83SvG B7zwJRGKbyWFsNhnLDIX1SNhYH7kLDdkfWrCgzm4pfGTgLsQGpj3MWWVmeV5ptPPDTPJSQEkobmC H5KZ+A1fpBknSZrdy0YkNtAHTKWcIFynxeXoOo1d4OZ8z9j84IGjQ9YjxhxW4WN2g3K8zl8nI9L2 NOZz6Gr8TI0Bg+wo4GoU1FTlOag1PO0p4nw9CIG0xN/KaZWO4TdJ2ZmDlCheQ2rbNe8u0GJUKutc FqFD2fH5l7PngPifqlmOqZ89MzERvvqcx4gHaSIQYCRWaaoypSRbx1l9kVLgjBdkt9uzrvIKewmB zb3Ygj+DWeoCpIpdQ1rO1ao0pUtR99LRly00jSkSBvGIGtiAVAoDaXy2gsVowy5gq2OMiYSUUskp AMDEzMis1Lu0rOLxSzPzNOOSBeGkgnHOoddJPZYXhScTlycpSVRqzTAUFyToVjm2nohMv0lAbY6j qvG5XBRJtheDZHu+2L2oM707857rNztSznTsc/IYWGDjhtUpYyzVwwoeCVyGpKC5E0dZQ2HXl7rc OE4mtZJH1S74amG9Om05ZNKJxvdX7CQyC+UCyiy0IWNKkTuRhoqE7HF8HvuTH73tYffVGsmOdSpH DSQKg9PpzE13m0f1jONkan0FmkJS4zw3tGHbDTu7IaYtu+SNkJ1VsXDqQ63GxWyJFiwcaZWqCdY2 0lk2nomTIVEjsrNNTGhmbNzTqTDJg2ylBrdRB6kHhKQlaHIuURzQcCugCgGGqkc8Sw4WqNjMEEHv 9haS4pa9i2Bb1IpQhW4lUY4JihZM54HE191JiRpwkLyo5oVTzz5z7IhX+5NyYvXIlaayQ5iXkkL9 TLaLOiyaj9N7oC0bvdJ2Qln3BHoeYnfZRvUXgoj4MYqxOre5SZb8LOjqQop6M8DSF2Tj4Jj7cXCC 2HvkvfhymcuQjsnsblYmUtxsw5b9iFMJQBViNhVboResUyFpVbry+XiZW9G8yLJ+/BXdzbue8313 JUyLI6S4HyHkaBYTADrcTeedDheRxFyFOtcVmW+aNabKvLqEX9+zi2n5HNCSMOTAg7hfKpEiv7kp UBThw/XzNEYICqsMYQU0g8oPHxd378fb8aOvvOLxY1HsBItSJCCQggWjSCNDnbB5oD+u8lwh+ZwE KRlxv9WcJDihRuoXtwIHMuY9OiR39wvkScBgfB1frQ9hCH6MgCJBFxDtBvQNMUJBYgxCuxoAlVGp 8X1IFtWvewPSUsV8hd7F50AwPjRkBHv70GHXVHb6A9ZZAkRlDQ63oy2D05HQRgKgZVeYzw9M424D a8YNsbRg3CoizApMnfnC3fZLRpvDVoY/ujcG8hoYq5021D70riYqafl6O9QrctxnjQLXTjBpcvrV ormC9ZXOml3+fDXInbXU84uNTPfXU1stJkSLtzjf3bzk3cFAGxIEZPMXwo9hwABtOI0tBHqbR3si kSASJEkaUWgyIxYpFIQGIFsaeHgomREbAGBsIQZ0+MrWB+Sbra16QCwYubISml2N2CPbCRPGbyEL S5RJ0j5SlKnV6JXy8+SNZ8b8IShsIfRTpOW2HEZREfoLJ0qH/GKpEiikBCEDeejvnh5gT/s1AJ8B a2ZQPVZWslXHWBGNSSLTENGIgHdfW/0QkM3KPz6B8rskgt3MH13z/gdv3F0RmuhSr3LJhJUqosKC kj6bZ6lmRkkm7Zzkk0RIIpoJ+MAZOidCZVGAsiAljxGoznxLCQo4l4ewqXq6Wpe1KnwOR2vHvue3 5cmr8KvM4ui7J95oyZzBZs1eYzaPFtKl3CzgcGBghM3lhiewTVFdhYfnVxhhlMxcXdzHpvN+bF0R PFq2ZvsTIkZnktJOE8u1LGxp4CaxGKLnYIfswD5keIeH2cYSPVUKP7aFZoHxlPtQc2HgoyUIyEJb MYw5t8S3Yg42QaoPOxWeV+6klqW+2cbC6OYCDXKhV0vA6SgHUt66x0LDBJEj1Mg+kTABYZ6bGUTN SeaHrrYcai4RDQMEEwojMZn8SaRy4IPUr1VgcmulWBCQkgdz8DB6TmKvc50OIPM8nbxAMIpaCUrD cA2WXjWJeSPeNUcD5Ga8MHGiaHn8TnfOPzl5i4wGImzyFWqQQgLEWIZFuHSPu+rjCWC1jGHoTIdX CZZllT2UpFSq1FO9inkheuj0q/4KvWtKsQUfr8A7fJeMUF/xLloVdPjVgqByjc+YvMe5HldLzj7H zHmiPZHsKUhWUF8RlQNJjMuOaAPSaAyQmVCbZ91gF0KvjaDvud8Ao3odjqfk4AhoY6dFKAjvfq/u KJ6+EniKv+n99S1m6FToNroXSIBa6qsQ+EPeMJJ/qYKIirIqxSIkUgrIBCdCey/EdjJtCt/3T1SJ Sg1IykOdvz3tH1luJCwFrjGDEPW4Otqex6DUOnPdR9bXQNlnoq+psvfnchoY4BGrpavlAV9ZZGGl mYpXWzifWO457N5iFKHGZn1NhK+QJkUGgwGqlYtFPyg+Fu8/AHrF9ImyCAaTR9uQICc+n9d5+Hvo zKhBikjbmfU7oY03qlfssD5mGZhI/hp2z4zG/05DFTLRt/3+NkPWhz6SE7Qtafi1mt6mpZcT7Dho cJg/YcQYIgb78RNPQkQb4gLWP4RVyw8CePRg2KCaFQg9OoP+BT2zBpUiqiasJEt9xd45JkdeT67f ezyJvRd99ScCStTK0PPhOFOVllItBb4c3zo/CbujMy7ZG/zZzZrWv3IdRN2EIfRxoibmE4wMiTYW nrn3rZGp6XxpL+syqyfGwX0JbSUPfBlTzhdUPssjmoaKJZRFgjP3MzANiFCkGxB/GRyj2M9SUQ3K jjhrz22u1ipIEjEGEijy4r35yhOZ5SD6nDb63r8JNGQBpYxCAQZxcpTd6/IbTmDMi7QlA50uH1hU GBUe+OcTekGa488bfplLhfMFKjUaEtVFigs6zimDD7uTBw7o88RoqTRHTslDS3rzOtlc9xQ1aKJt YdLtaOk977TQBp5HeAqhxepbnSR+Ds3Q9c2REkFCkEoPRCiBG6lJH1L6W+pfYYKZ51APt9SrXct1 EV4es8yyk1SuSpX+3adi+X7HRwY97e+BzhH+iUClece9eovvPeu9eC1HKHg2yGKfRbqzA/U2b/N1 anFMyR5nr8+Bg4R7ooYcB0pMkhiSHnh76bCneyq5L6G/c1MEWGELP9Esh7T3VL4VSMPfjet0YyQJ Fk+Up05ttTQnSwqMAWALDgp0jMhEGQdgooc7xvx5Hpau6Xgu3A/Hn9L0xueN40QPo5m6c/X43nKe 7MOH5x9qyyFJ9ejRCrYUK1YwpYj7jrFj3S4vzSAnFM2nGSLJxPejPM6ntYIZmGejvt5iQ0aGARqN BibuAUvFkh4EPP9Ufuh6vAyDPjf5T+K4ffs8/JUQZJgaWhumvRHhdrw5j/KJKhtD6qNy8jRHj34S Cc07T4y+EdoEZpnghz1YD5LCiKgiRYiMUUiDHiykGHAECkJ68JUIIMVKucUNpbyjobCp/zApRSkR TwvWJxQMaygEIJIBIqZ3mjjHOAYao8WVR0nXObcXVwbhdF5gnB/DXJWCqCEPx0E9HFbcL9mhwCwN 2vQpIRIB+1jy3UoT/dBuinIQCxO88mlTOPknuvwAvIUZrkhcd4Jlm7zI8bX4eJz952UxSjG9amgA 7w2KZ23QiRb905oZeEs7jqOQ0wxlxHdzqX56F0VOwZZmqOX4mjICgvdtdxPtCVQ2KSSLSI0FQiKx 8b16nU6MntcRrAzBlnrUQ8/5eOqtzhRK/pSd4hV5vFVM0LClC0Gv2CJaKoR7rBJ27AdVpZDiAGB7 mOtAasQPQroeYHdRLfZzjId8Km6SgPkOssTulGGxA3vHlDyv3rRej9pxm6G+oH0ph9vkUWeZh0PR IT2NX2vIc4kWbjEGxD8jQ3Nkon7pK81qWGRjGO6d2QhqCIAQgmi9DmgYJjQGgGWRxCOFGcb3GZ+P a50OXEHFUNcG4xR1MpU4Ob8iJseqkygzo+qZ0SVQYUidQYoJsEb1KQTSUjqRo7lgKsV0w4tJMoXS EFjjy9RJDN+qD9Nw0IBQmHMFmF/mfKGgWicU2Pa85PL6w/wX1HLzgNpjkvn9m9d9CYtSmwOYU/56 qRQ08bY5NGhMzWtaxDMrijoIhZfJhW6MmmbZDDDHnuefBLSbH3KiNcSlAok6+lxwsi3lBVhBoGtE ghkh1arhqB2IT09jY74mxyEole7IESQwnN0fQZgGaoGxlJZCe6SESUyaFWRsRpKwknuWzDUhk3yX AwESHSUVpECquykchN+4sIkEhAiEYIIBwbkuDZIB57ZzkrBJEBnZgUZm8b1tsU+Tc8OTvCVoh4I1 5vrNQW93jODcfmR8LvPuOVHY0NoHTC0QMcgYPla+5+hog2JNii+0WxjPQ0SHspJRkgZtTIJBk1aa IywBjsZhhZbIstkMVlTAYESIGxUgWkg7ksLEZADeecKRN6BA/PPDHlkIclfjxFoeuXhU+aD+SFm5 I2lafdQ6bXiDpObOerPtsuiyaT2p4B7XiAc737vL3pX2DRrAC0GEX3xfiZqPf5SgGBM0RxIDGSgl pWQIvo5W9r0PSdaObNmQmWJJ8zgfHegPYZw7ZdgaHBUDUgd+ie4bOcC0rQVJL7BAafpGQd9dAI1u e7uH5x1mA9loaIlhUPOyjWxt2khOK8P7IIEISM8x6XrC8pNWlk5o+laylJSYSiGUivVYWbNs3mrN G+TFHJUjKNIb0iqTKJMqmpGDA+/RtJ+094JoHH3DchQnKkQ5DhfxXdGzm9XNCSpsdrmdgua6jtrV PtsGaL8mEY78bQkW6/WHBTYiBCfQAhAW/U0fZJi0JT6+uvp7/NLX6aWtGt1zJPh6jOoia+SeWT5J vIcG/iDywHuYpAgiBCQFgQgwgkGI3woxVrnG6JIyO7VHrgccAzfcR5YoSD/W3i5lm85sTZx+jd6/ C/2s8IJoDPDYm5O/wo9qWnaiqFSlIVEqd3WiXJ08C6Zw8fgR5KOqtOhql/bf+NLaZAMiNDqCSEtY tj+mZ7tvwHdCiEGwQ9wwC5dXD1x/nSHmX6pvnEGJBxn274omSiyymSOb46+EWpUkWwCsUfvvrCj8 rQWnyNJUH8XCtKrFf0/q+TDXya1tvvF+dvQ5GC2v6nb6Nfn3u1EFDXR7d5QK+yyDFGo1qXEhZB5g r+roeFMRHjecXkYPZB+IRObyiUXt2dFHYrm1hPUjkp9ZMfW/0oe1+x2NxeOefiIG8yTUsbU3CiZU dj/EhIYN+PhCDDTdUO4msNPmVrAMR8tNJA7IHVCsGJF6FYicejHgyP1jIOt8kL7lUcD8UMg7dYD9 ji5wifhOJMqfXHn3CSl8rwu87h3Ot+jseVq/U/n6CQPyMTgcHcR1N5chS4s9z/OzvvYfU+B8igai Kppdb4tSMfuDyO48YbSobew+VzKwp7qxijEYKQfgbEioERJ/UM+4RasU/N4/JalKBGPzz6X31tg/ nLzVwnlHkqJxDE+yAJEQQELILFiCooiiR99qkSLBmWkULSVBSaTAMohJGgsBKQoE8Gdo2RAhkzo4 +VqHRPO+x09zZLQHPCSTIIQYiGZINhb7FRskIn2vpcAELQFglyiaBgIsYnPvJvBPPtMnubzNjEwI twhU3w0UQjIoT25ZsmIKrHMrHBGo0k3aIQvgn3ud9fx9Cy+v1syap3d2EZj2OJ4NmLr8t8KF8RfM IvNYz4X69odcv6kP0fz07vKHonLXYPDeEJmm+WXxapRwlkIx9KUsMJB+lJrlng99RHEewgaAZIkY iEGJCa+wdVRPxODxd9EDoyKG9ozgW+8iU02DrHMyLcd58/uLODrMal0QhmQmXvTFqAme1Ce2xBzB XDYZiO8WV9HlBOeb5f+ND53oIgKQiohBYE/XGEUJZqNqaDeabBd1/piBwFbDukErFxWIxbqHpDUI VMEIVJKyELGBICxSEgjSV+huA8rlgP1uk4DBzDnhC+n6Y1gGfiod4jOt8iwrr5fPOHbN1AoGIYxU fWelkHU4FaSk5LtQS88ObBcpbrY4imydScqGYczgqGBjFVL1IcCYRzqBvgDN4CzNnKVtqaStxFiI FCRIQSpwTnVSEpBzgbj9zqzggI5zg7oEUBMU3KB+/4zc897EaczUQOMVOsIPC8ojJOREhIxnlgc0 KFzBGInmApzFlIbkZFnk26aK9Fo7XmYKL0zachhsZQ1xmNbtQh0/sONExnS2Wic0mXJZFoyrgSWF qgaSUWk9BAfIFhOiMqBiKoogQBRSHQJq8Xr921XqZvRsaxEkmaXerBJNg2eqi0nC0nTwkOWYriSO q589KuiWCsITM8Y6MxvkT47c4ZlcaZ9OHdq1iD7NjkdxXmD+PUnrA6Cuw9MxJf7DZVOAe10KKwGr eYFbLCK+Q+iUBP8/esv7puMMSk3i/viuaEBU7DBv1jwbzDXspeekeflOixUJxmIuhN2ImSDwNizj gt1nU6cMq3nrvSmLeC/Uci5y5kiMiRkIqz7p3mfli/1QrB5SHnfA+FO4p3wTui3ulvaAbr7RR3qO HcXNiVOdou8kPNCq1lVA/M4zIdQQrKoew4V1rTD3KViDA1lGnvh6tJdS4n279Bs2tbXebFfRB9mY sQoeBdBYNhcm0NjQMZEDAZhfzwNfLIA3ZpjJEN3bpLDY+KSHxPvW222222222222222222228idd xfGE+QDY4ZDgrbdS7GZMssuZky2XYOqTg8gJ70gyA+6D8HdJ9ShOIgLwFFGGh8KZmLYDYdAwZQIw EZpgg4osYsDTN3aCpDUuCLQFgwRopqoyFiUPIIbNHtvLzNjA/gcV2QzhMHYES7FhMYVBy08o75RR MKhYI0s/KZrB92Lb6TROiaqfAzdGUp8VnC0r5axg3T3txQsQZxaLGKS6EhjqzZ4XFxcbzUkz16Ke AgYWLRkVuONsAYKAyFkoKEymXMPOVcyQgkEHEAK4dK8GWrAlAD5pMsQMWcdOmAYkNtydmmCiG/XO vFLN6s9/nc3N8BA6loJPJhb1D1jES5pMFQ9g8iQFYGG0ciFInHFNfGdZlMpuF2byQ0pw3SSmYZSU wthRM1mGczMDbNShphWTbizu2KXfM7JY8k0IWM30UmluslLyzHMuygbIFBHYGAMDgsV9VtWIjdAy 8xA31unW7rfWnw3xjNo3Lpy0WMYo0oDNpkOaBsFEPnPO6H3NHW/kdG7rz13KlK0hkFKJdGjgY4ZZ o9XQZ1NpPHphfDlNwYTIUm4R67VxQbFXfooVYlVRwkhFg4DCqmELREwYzHNraZJeQlozNjQVJDqN umHbDfniLBT8I9sPBHXmX7S4uuoSZ6Hhbynq1utEq767Dp2UULpRv9bUv3eBi7G8KNKtKhAEvz6M A9u6zcgZG2KnuCWyKNtgSIga94o13xGC5ZvWVVZDbjobaGxodwmpNTZbfe7jEIuOKGmazkBKCuRh j4qCoFoaDDocTnyqw1ikIhrJe2EJupVumNvEEUsb5S6CDNepy0bIBAkSSJFpHkqC1Qf96FFGgYin RxGisfNRF45WKpy8JiSq4XUo6Tuixq+qUfyo45uJ3cRLCGzavMGffhwHkG/CBOWhhJCBm6qxbpBF xCw6WxcHiSrFMDIel3CGrO+9QIf9AEhNyIiQUJpgeskMSKFT0Mk83nZ494IeTqzcxKrLsIW3v8ZP jPWIMQaL6tmYF2j+yjvbXI2kfI12H2OvzPwzCd9NEk5JhIgdMqsPNLWJbfR3SzU1QnkQ6wATiIMk K+QcvUqCbVxEE2A+B5kF/er6O4E0mTF1coj3XhxsHsbjs31n7e5+nQ8yO899w4lWYhEI7lgWgh1+ lAyVHO7VlPo7cdKc6fwIEmUKLUrEeUYHcOkRtO8sqSVQqpCJBN6CQ7z5WiVsQSiQYr/iRFSCRR+L wEUA3u2gJ+BvFLkycA1D/1iH37ShN2iUEl3E7m17+Ukmlap58RkMx+am0Aw7lUf4SQfYOk4zsd79 2czpqT9EJGSQDcFQs+P1+N9eouY/iKFH2FMUSETzp6nzU1HqdBelXdvEOUX7+Cv/R0gZ2JoCB51f R6Gp0Q59PfdwxYxIyRzlG1mxGVfsfK6b8AuOBH3vU7fdqB8JAYe8obwo9LyHochOJPlDo2shmrQ9 cwtQgnznqfc5zfgyBZpt8T2NjO77hgmcJdkfB+X0unJzGDiZmzYpbQCzzO+XIGho8Bzn7s3wkkhh GnbXPlPvzK5WD6V5i/rXRacEMwMwzAwybCs+ntWpTXE+Qf+RmA4TlQjMHxNVDll3NHaclk6Ykkgf oTIlxBwSyLscXnJIlipkgxW4cXNrK3Kg34oL7jeeJ73Q8zmceNwydR2M6HIcOvoA45SNQ+oK0SoF jyZ29ydbnKMOkabU7jBDOZyLIBpDTEUoUFoHK71S0NT0P3PAdjbdzjgnmPBV2POFxAZgxEaBF275 wBwPhCYb7qamIWJYMgaCoMKIMLsRgqSN47DxlLFEK508NEHQ68NdXlOIjzTOQaJiBRnK10WBGSmH G8TmDpHAvhIYQ/i99HJSo0IpSgFkqLS7SNZBsJZaCPCZnkemOPa7HmI88795vEemcJudWYjWZknt oTsollSlQIRRMyjuHiyesfC4OhxbnNrFG7oCtuZ6XKt5oXipgBgwkjFgS3KswFwUQM2xZkZw2j1O Dm63vPC9LzMdr/PziviU+Iff+zyKl0CWg/y/vPw6Cf/G4NGKBSRf9YhTNSmlaunTctguoAqAz/MX ckU4UJBZ7D34 --===============6282726538553789830==--