From: Tor Didriksen Date: October 21 2010 2:12pm Subject: bzr commit into mysql-next-mr-bugfixing branch (tor.didriksen:3226) WL#1393 List-Archive: http://lists.mysql.com/commits/121547 Message-Id: <20101021141249.A1E5B37BF@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============8225072932791891213==" --===============8225072932791891213== 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 3226 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-08-20 09:15:16 +0000 +++ b/libmysqld/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -44,6 +44,7 @@ SET(SQL_EMBEDDED_SOURCES emb_qcache.cc l ../sql-common/my_user.c ../sql-common/pack.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-09-01 12:52:09 +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-09-10 09:23:27 +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-09-28 15:17:29 +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-09-28 15:30:47 +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 @@ -105,7 +106,8 @@ ADD_DEPENDENCIES(master GenError) SET (SLAVE_SOURCE rpl_slave.cc rpl_reporting.cc rpl_mi.cc rpl_rli.cc) 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-08-20 09:15:16 +0000 +++ b/sql/Makefile.am 2010-10-21 14:12:43 +0000 @@ -159,6 +159,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-08-12 00:26:10 +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-09-30 14:53:11 +0000 +++ b/sql/sql_select.cc 2010-10-21 14:12:43 +0000 @@ -2569,6 +2569,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)) @@ -2746,6 +2747,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) @@ -3031,11 +3034,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)) @@ -3261,12 +3265,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; @@ -3299,6 +3312,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; @@ -18277,8 +18299,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) { @@ -19890,7 +19930,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 @@ -19992,9 +20032,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) { @@ -20341,7 +20383,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER pos= sort= sortorder; if (!pos) - return 0; + DBUG_RETURN(0); for (;order;order=order->next,pos++) { @@ -20358,6 +20400,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-09-28 15:17:29 +0000 +++ b/sql/sql_table.cc 2010-10-21 14:12:43 +0000 @@ -7092,7 +7092,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-08-16 06:58:42 +0000 +++ b/sql/sql_update.cc 2010-10-21 14:12:43 +0000 @@ -424,7 +424,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-07-30 08:34:23 +0000 +++ b/unittest/gunit/CMakeLists.txt 2010-10-21 14:12:43 +0000 @@ -207,7 +207,7 @@ IF (CMAKE_CXX_COMPILER_ID STREQUAL "SunP ENDIF() # Add tests (link them with sql library) -SET(TESTS sql_list mdl mdl_mytap my_regex thread_utils) +SET(TESTS bounded_queue sql_list mdl mdl_mytap my_regex 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 --===============8225072932791891213== 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\ # do0osug4q8kvr4xb # target_branch: file:///export/home/didrik/repo/next-mr-opt-team-\ # wl1393-merge/ # testament_sha1: 2536f87d8a5a7dbc0a30e23399fa7ab1f84fc62a # timestamp: 2010-10-21 16:12:49 +0200 # base_revision_id: tor.didriksen@stripped\ # cao5fiah7dfi3vev # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWSrXuhEAR+9/gH//e+97//// /////r////9gY798VO9Z3y+Hvta7sbLfVPKfNEffOUsd17nvWua8pZz61B6Bzxl1pKFNslvsfR8D gddXCA933S3ys9cvfAfB183x07NV597plvs719vb5774d993Pnsqa663vZ1YBPGd22YTu+e1720f XPn3AX1y4Dk0NQ7uApTobcVdvvvae3dmr5uwubUyTdtJ3bpevSvbU0n3t0vpfSYdD7h93id01e9r Lu+qGfPo+PePsz32d9V9Nt3vcJ5p7UoS6SG2O7nF3dLipUjRprXVdxomsqGigG6Y6pqQtY21e19W m6vTx0GMaku59t7YPJe3bAAGvez0bhJEEACNAIyNCaBommmRqelG02gUbJTTTTyn6kPFPUeUeU9T I9QMJQmg0CITQQJkyKaeiNqNJ6aAANAAhowRiMjTJowAYmhBRohG1Cank9SMp6m1DyIe1RkZAAAG mgAPUAADQCTSSQCJkmGiZCZTynkximNUxkpgaaGkbU/UyaTIZGGpobQ0J5QRKECABABNMUw0AJMN J6J6qMj0wRomnoBqaPSZGgGmQFSSDTSCZTCnppNNEyT09Tapso9CZpNDQNAHqGmg0aaAAADT4Hpk PZHstJOdQSlA/DRAW/v6WaaySKxBhEjESRCMFIwUjBUIoA2h/2MCUT2q3KxIxYQIwSMSMSSCDdBa g2iUsCwF9wLQF94wskPlSFkh9VCyH1kLIfXlp+ZLTDRyxFcgQjBjBIwiQYxVKNgKsUZFjEksJRUJ iSWkiikTBYwWMFjBYwWNUkuQqUlSkqKIKAqAJCOAsLJnaGhoaGhoaYiFBEIkFaWomKjUajUajUSC RQJGpWtPTmYcVFxpoaGhpIjokPDQ0NDUarQ0NDMiSRIeGgYgZhZhZdZsswswsiwwyYWYWYWYWYWY WbLMLMLKFDCzCzCzCzElo5LRclouS0XJaLktF069esmc0YJIKSMh1EIb94wp/v+nr7/1biaJUijl lF/t331Jp5M+k/zQsiHSM55uRRUdvFsa4pXaMaxNcOOwZVX/SPy+c/2/ksbxCFqaNdr5v5Psqu6H +cBfRTk2jT0N0jR4yhA6HmZ1YPrYtgDGmTrCLu37Z/wk/N+c07FT/XB4Oivofk0qXIwnv1fwi18a N7POZRk4SZnb4VtjC98GKGSOn/GUK6DLt/y1Yadp/Tl/H+nT1crOv/Llf/S7+aavtZ9XVphEl4Tj r5QOhnjuN3+rlzy/wqo66Xg7MNPe7uz+dWBSYsw1lk7K0yHZE/m+UKSK/zyKO5JL3//84auAj4QF AEIWgxhvio6TmRKHx5LyqHyehl4EQjvdip0dVr/3/3SOcaqXKtLIHL2Ezaksy3+4ezjCm/e9/g/D ntzQmDocep9FS9GVAYHEBW+JaNLaqx3LIKS8cyupxb7MNq8jPVrD0UvPinE0/gWFt9GMWn2a6fVZ XAz4hhaqMKkefi2EiD0RBHCAPLz9zBPvi4MXDtgbuMfxONUKt76H/GOjHRHmx0nHS6Kalm/Vcdr9 fd7YXKjY+6GawLhwuTmDEmghmjspogpOlL8MRIuO/NXQFsXnSqURRv6ua568lrcEfc9IjkqAQ5dk /p86XNNhjcfIvBTlHSY2IEGdthoQhufTAmvZbrl9KTrVtLo+/lPeL6PghwlB8UbZnRasl6Dpjaqy OaNCA320J7oD5eXh67dP4tZmoWeX6QNkgPloJ4xFr9NuTiZmjyDcCQZk1tlshHy+h89WJqqSNbAT bj5uUHZYS09gzAyBmoXyjQgQoAZwKoZIZnsbGBe0S9L1vW90uVzgyCzZwAHIISEgCnQKwCsFcypm Z3oWkihab2DIbw3hiYms1msaxrJrJrMTXSjRo2A2JIiQyIgBWArAWgFMzOsA5IwzFgyGcMQxMTWa zWNY1k1k1mJqzmct2pUq1a0pmZ1YGCcPUAAaAEkCiBo6N2bIsiybJs6NiTJt2tkVFLCwtqZmd47z wokJWyMLTNS4yplcrVarZcrlXRwdi7kKkLCwtFstlhWBpEOQqRZrQ1XaJtE2ibRNlB3CDE6jSGnG pjVRmo1UaqNVCEwiwoGnGkNO0O0E2gm0E2gmzwNbvcVlYZRVZUQ1LOklQw1sjY0zTWkl1Dzo5OZ9 49G6buzowvuvK5Zqr/nvhUnRAqE8jIKQQdjoapKQ7VUO3Wnac+3MFqdu+ia4Ov8M2MtLabCCfOUA J6oSNKRnHql4Uq0krEPv72/d0HnnAr1hAz8QhmjobpCeNkOiQxDjUoC95kqAoAsh3/DQkxndaKvH m0JO9/dda55hhMSGzDgIT4fMU2nTt68EOt7zV22ww64cnaxvmcrGLnKjNnCnxjWnmbSDxl3i808Z xHXUaGM52t7jdZrU5nFK92qvIRyNZ1a3hbW7y3Y3dzYW9WHeF3jykVTw5K4Xxkcevj8LeIzHn45d JNYzAbiOlJXwcvNkXk0SjaI8OvGAh1VYHaDAwzMUO9VlJE7O0CKKjVrz1nu9R6yt91/cEGgKo5EF VXuooB6Ip6YKFYqBcRD/L/I2/fbvMhuTenB8TvYScGKCb7YrJ4WG36OGG5huTE3sniYEtpOWUliG OJk79NM+lkFNiuEaDBL/srWDIFoDlBwgWQPbnqZGKxYDBSHzjDyf9prCAoQ9hgV5JSIRBPM90YaQ nRuxUnvygWaQsWKrAhuj8I64t0C6A6ohRiJaCAb6s2ox5NSvd0vTaPcmQyGGZldwE8P/vJ1cewp4 kBcsoQ5GYxGOyXy0ZCxmnZipvcxxDr0220fJdJqX2WsKCX8syMUNuYqsc0+McNeh6UXY1KMQaWkN sTWga+OGcde/HKt1EprT99wh9LUA2kiZ6Y2kkpfa7ub0r8xW/n9oPGjEQASCQJtPfidScKoSGGN9 OIhuQYSKJn4Su/KkfaXcNr1Nuk0AytJGl8UQGf3H/pFbZpVUxAVk9D/4alYJ/N/bU8/pSD0DwoNY wP0TLGIf82QbTn7DDCsaWnSosLn38ubQiyNngJU3EAOnrn6nnT60fye+NGNh2Nf9m8zpCqtwj8Lb VDdJA+xByBMwJBSRkJCQVRYsWLAUigoqoyLIKSKJIJ6844+I8SuvXmaXxIgSpEbv8hR+z4fd9vRw 3zoGme+iILdZpr+ohl/mHiDyaNFB9jZuzUtBXRFnhq0ktQiSG+u+6jJvjtpQ++PCmIOdyywzzDG+ PEosMYxE3dSKjF61bM7ZCqTu9aXbFgpikGFq0SJM080kDRO7lq1lZaKGFz03xZELYrjT6zTNIUUq uxYHy6gwPyyoyOpVmNzxawV+UDwk8cnhlOBm0mpIGVYZFUZZl7NKnarVd1H52JSqjfDznGuAMbK0 wSeOnPGDoHjU/AatUis9LjFDSKQjlAsvnVtPrcpKlhDG4tVqo3ugNhA6WULwDnGB39lK7XSpVa5V md2WWFQeTa9E5K2fhscWZcKmFGWMZ6zm8N6iFrnAymtKXGkEmpxBa2qUqVShNW4wFeY3p3JaH2/Z 2PaPP7W/P5H6nP8k/KEBvXA9dLgyrT/L69p6xT3LAYspIZftNCupoXWWTxUlMjCeSQaF9D8mJcVQ I7fYsqPd77EkIl2K7Gdz3V+B80pygmoeJRifk6eBIPqDzkAzzwmmYW0wYB7cNg0EF7NRNxLOty5B DhqHMEE1BAV0gkFeTrvz2jqVgf+UIX9GjkPl7Tb42uO0VN40zOqQymWbqjv+ovx1clNlToWZ959F N6CpSd9QkShAYQ/6QAkKHeeLLlpyp1oWfmaXj1vVSjodyiZOC0s+7mZ0hZSlqgil9ALzAyVXC7nv gjWBpgDgDCDGE6Yb9vroGx/B0HfMxNmvbja4959Zl3piS6fHX0ugtPpl7S7TWLiJHSCPsC7K7xCD X8A/mW+m5bL+Tm64Uuw8z7bnKm+UrhDuktEYwOkOkPMHGARJ3l5bFL2L0kmRYmGe1yTB0wgvLlKB WOhs6oJP5OUFDkGIaRiKNK7hAXqvmMWzGbHi6fd5Ttj17uhPrID9u6uJwNGRII5E90oQ3e6M13fd bTXMLQ7jl9wtw4A6a4HWRT9iheoQeZ3AtrTissPrDx54Spq/iFr9AekpKGZWSdg68LLNPrVxQb6p 6hiAwyjZJvNC5q+gyIV5+qccmOqU4WFrVUsZDqa4Axwalghfnom9jdlP4KKgxGvOFX8y1c7y57Tr b46biujRcolGi3jRrKupUOTr7/ZZYFANX4cu72afB/z+mw8x5jfp6GWbQygxCNpAISHOGz7pZss3 fYqIwVb7Y9zHA1lHn59dmFPSmfIem1t+JBtOzt1y6m6p/Hid18MqTUvz+kyonobfGg3laaa2nF+3 10z8axHekGPkPUj3TLNkMiM0ksMilGdIsQ8Tjl5cedOnFr5+WlQmXOHQjzZPP367RuciS6PU3Ddf AIrVwKjEXPyWHpxKiyCQ729PDtVb8/uN5361ZKeGd2nLTu9ZKq60gx4yubVM1KJ2LZHrXPWfwGkK qkjvdN2Rfyf1Hk68GHSxWYHkoh13GbCVLIKaPrW/5uzV1eyZSVhoH3aCG+7RvZU72cooTszVa9My E5O1Hq1zoY98E9ZrOcQc+cGRxMg7eAGZBqbEjiTdcC7ZO2/wbzSVGRrTasl+3IYXkPQBBpeHS+8o tEt9S8ABe1E46s1MiOvaQ8NySuLKjSnaZz0J/LHHB67bXHRSWvvqH0UoszRG/PhcVlVWLXdMpzRK Xyh/YOT9AM1lJZ3VOUIt34wQ0k8HnNSXWad/IXwM+Ha6tDkiXHK3mS3ePonvkVi0vdnsan5F2G+c v2TdvYqy7CeE5ZXZkzBIezE7x4eZVrbCnNWsqdPlbHMvGvvDucm32oF3YBdra5YW+eFctQ47alGj UrP5at33YVlNLMDU00wmpvT0R446k1FlLmeOSnQ0fEKnX1SPIke1cEp/bleQTcswzIScsWJupwU3 JKhfOokGKas4YtR6Ls/IUgTPfgPcVQotORfotOzpWPmaultOrZbbjI5RYYohrO7tbo3ZlsXWEJwg NRauaBWnfPzd/iwptbQ24b2w4Xxwx54kTV8/TtatB2dqdY0xyfVYRhnb0MSym6joe9ytoCeshkcJ EGLWvzuqzCftwxtWjpJGXxWVvncz8fs9kpovGHwfRKRQdOCuEn5myFa8wxnqjyEKay8lRfbfXcaS DaOGi05z2Rxzs4YXUjX3wPnTVcaq4qmxiONZrk7jt2A6VCrNyGeA0mWMVqR3L19YM3teuThhcd8C eXawffT6j1qlPda9Sj0zUzfmWV66frSyyz4JdjdqqlUwvwNsfTT1+PBbz8tTXX+aEI9QfgITBiIY gCI362lRepHnydoM9fKUt7W5WJq+DGWvaekjUaatmimcWNVJu5iBSe9g1PBWMPRreY2qhl0hNoGv XiV/Yt7vcRWGfriZOa5ZZS9Hkpxpa4UbWOm0zC+2RO9E9Xtf64msvMPYCH3gPADWchhgRTq11ERt JKyjGXbpizaHnXN2DzT7N8zneeahfjL3umc3qPZiO/rBay299c6HTlboe5Z9tOPb7c4HEPKezO9m owqFVCIocKXoi3N2pwzLuLLNUplVx6Hi2G1pK2R27d4vgKJ0GREidJaZ2FPqAx9i7TCjVyfeMx5r NiajrpdQvtIxg0Iwj1SixQ2wxotU41k1BlqaMJ74pMovkoR7DkMUXb6seBSrHGsduRrRe3NC8p2a NVbzKBIhISI6cKH+P1H8tVf9TjjEH6wX2nr/P8Pzv+DPHs9sx4tP8Jk/uhKmPM18vwplRyt7okTt fDo+z1d+OVfA6nHQwzGwZoOO34eVh4umi9zvoaE3mybZcgUyb91rvtagjDdfMh9+o1108Tz+LZ8f 1/Zz9230e89JRRRRRRRQooooooooo7Dkdh4HQ7TqdxqXKLly5cuXNC5csXLly5czLly5kXLly5kX Lly5mXLly5cuXLly5csXLly5c0Llyi5cuXLlzUuLly5cuXLlzlsH1fyeH7Ent2z2+783oD6UFBQR CIgKEUIoKAiEFARCKAoAiEFAiISKAoCICIKEFBQkRBQgoEUFAFAUAUIoHPzbGifD/KzHIWMqRRjF LKQRYNkoowIKCMWQjkU/fAarSLEos/K0qBEIBAPcOc9BVBuSofhR+akQgSScmJnV+7rX+FApBT8t LEM7Ydv0POnov1fhNEnKUiTI5nscC9N5PG4MIaDepYeqzpscb7nmNf4dnInnfU8Yrv9PS+C7cfwy VGczrT1ZcNrcMDdfXU52ToPfW0lGcQHpYJu0BEi4/rG4t3Fbl//j2WhtHwHos9B9FRmUFFB4FFFi wUURRQUURRQUURRQUUSiiigooiigooiigooiigoom3/dF9mvob8d1/arPrUf5fbzDppFrPy7h1Xq GdMasDKn9dvZCpsRhMwOhjrtTqluZo/NDedw4MIV4WC7I0tGyQdMsJ1XGS7aZIWKBjFkTGiN++Eo fjsIhAVrHA/O7sqkMvFLZBX73VDB97a6qf+8vbPQyZtnecI87+mjSZt9FEZLTh42y+2koqsn4u2P Dtxs3VvX1MWKLcm/ZOXg5GfYwv3sGxeO2n6cuqLwcmY973R5vrGhbL5fr6pUXhODNRsDM/ByNP3e e6opw0Ux7KMo/W1lYUflj7Ya8458PqY0jKVD0DX774CPn+lyFvRdjDs9wY+xPoY7R8T9v3b4P4i+ YCzOnHmQ3dPm/HxsQjHeZ+ovwfJvM3v1HiDEhMPo2p05nYhgH4e66L3524tV09nb72fkLopmFlXT HHxajstLSPBK6+VG6/NczaRZUdWD/40vPlIMJSpj0WirgWP9VAJA6ow81hTMABHw9y/sTOfRrqHT HaWc4XXwrtSlpWL8ydxNVL+XW9JwtEqm5LUY0TeQOKV8KJ6s26mbUVzEElJH3VaT9HZ44+WTrNit sqnbKW+N47te9bS1ZVARFBzOWu92575y4de3sB9/leJtzPQfd7gRlvS3GQUJSJPylAEaDBgkBvr9 ncN90oN6Eysp/bETyz6YyOMECsZB+j2+zeZtGni21GQyAhCjEFA0lQ+Gmvtpo4UskEYpBFkSBaLC lFdOqhfEPTnl2J7rhcOBR/0MLyxCajtjFklDhrPJRcyo4+WnxdD8eqymum2qMSTdh+i2Vs0UXujc 7nSmJjewyMI+DXsz2wXfByliWl1OGiPfOfjXvtv0AJAqZNzOV2Z8Z3XC7ErKhNF6j3b+SQhNfx+b 4SyqJUPPS21f/vNAgtGU0q1S81MYillvq2Y3Sa8dnY4Hu56w1rPFw8nEnrER8VKI1JUpaQpFSglB tZzKG8iB57xfNzmeVujlnZ2b+r1cOC6SdO2ufE2aeVcUZGxbs51RoIWlbUxUOVMKCfVbZS1kqeBb go9KTc0/4jWmxOZ1KvwF+se29T5LjyFTgOm5lUlqPc7+PN4b59/PLnO4uUUe2ek9h8585859o+cu YMFjBgwYMGDBqYMGDIwYMGDBg0MGDBgzMGDBgwZmDBgwYNDBgwYMjBgwYMGDUwYMFjBgwYMGDBcw YKMGDBgwYMGDYwMGDBgwYMGDBg+L6B6AI4cD2vHX3crfDWqBuo2SYG0oPvIsYSQ+XRUqvry8v+nm zctKWrbrPhg2br78LfIQ1uhvtJ0jZuepqLBg1XWNmzGooGdvwDsR6Grz9F1u4xhHtDp8fPrgyxQp QrZlV8nfgpxxcGlB+6OUluAQaOdsFQLHjv2O13941fihn8RrMBRoNwzey9piasjDRmJq6HcgjCnu KFNhXErBQuUpAb6Fz7qVcuLrCx1y3Oszo2VonQ6ekdZgxvec5cc7qZe7810k00Bk+v79upXn8LsW LgRj6cQFlBL3q83ogYqxKgVS+6xIvz3I70K/QUD0843J+OYE+OurjYVU+nyqrvOzP4KslK/bdUqq KINjCvWT6u7uUx2TL7/3w596qOTubXg42rs7ETuOo7CHpNoWHh3ed1qUdySkZkZQtrG04G6tlK2D ISeUJJw9WTqOsE9sCggJJyPAnM57ypnU1KwLPJmdQ6Z5Vsnm2wxQrVvolFi4UC9rIshgBVqtGXhD PphOaMQkP+FGDGD6LCog9RZ9L6ghtK2Ps/x/mK7bjKbKMm4f7rU2v7LPzCGvEHUD2L77oLIB80v4 alufMpn5EkuyhLyHooh5Bu/JSXeXKjda6K98xG7pzYINu7DjARdwMTxjE3rE9hE+jjntPYe0PaZg IaF8goaLZhyvogYRgGMApqUDGAYdKBjAMOlkMimeKZ4pngEjlAMc+WamcqJUuLi5zVG8zWnqh+nz AE3JFDqYBs1k5Jy6qdaa66F8WsS0C0VtFS6DJhAwiyKWgGFLVUc0gpkqipolWIyPc47cOWqbmDmZ nI4mxyPYc+NcVm7iZz6+jkWjKaTSWiSSijChIJhMNBoNBoNBoOCM4yafWtcSAioUSBTgoqqrjjjj OTJBCIGijo2IoNxTpOYyKoXDnINIiYwosXKSCUOMmwMWmbDCbhtttttthtxEc5mZw2541z4kHSzn ME6Tc61rWqznKJ04c61rWqznIA0251ERE4iIeIiIeIiInEREoiIiKRENERERFYhYiIiIizxYIV7T SEQQSYCTQBBUBUpiSSUo3gMos8xAkfiyclnRDbghlkMiBux1NijXI0mFjFtiYlShcYGcwG4bBcMK tWrAIPTEUFBMhDq8lUBgUk59ixHspeVLMMJwWDsFlllltwYsw+cGEND3xgO6wC/mGgMsyaOCMDQo nY7xHIcCh88nZ2dl9wnggYJKEmTXLZ2TIckKjJ2KUEoDmyUp4Gm2y+y5rBrUbLTVuTOofg0Od1aW pOqoZzaIdTJgmqAcTpJNKAsOi9iJHixZSJiqKqvI0mJo2NxTBNBTTHWjWgEQyampFpSP2aHlHe6v Mw5PDvODJ3L/bU7WXN4PL2vBaaxi9UZ2GBIkYnu9wkKlXQ+bOKOpUgmYGYFBQUPcYLLIyRErCCwg oSBBBKgyAs42QNTScdJswnA3HOHGG4ROZ0Gkkv60wtcB84A6RKowWJrCiNE1sAyHG94ubLiA9voO BQYcQusgnItjK4rKKDPVEnhQOd64GtXuFh1t6rTY4ASBCQHMH577DMyWUWKRMjNZBYyyHi65bcvN Jq4ntmh0PMXPMdDqdToknJ6q512Uny10JPgWudrI8x1Op1Op1Op1Op6eaDG82PCW73J0djJ0WWUs jB7RPEa2Jt8wk0bJcNgTXyp9Ia3WG/Q4miGaVl6CZQaJEAJFrOlN9TatNeGq3+CttuBCOdAr1ayI iRNxYDQJ0pkBhk7eOGpol8+SzqOwu5ht63jkTR83KdkbuSlmjtdhJsyzyJMnKnb0OAXuNxlKpQvy czvNzcmGDXkLJkNaLiKMXPHE30crYDatobd3OWTSkdKZ0yTaAuV92A5Bk8bRBtHg4RSaXEQSiMkr KeNI+V7b+IvdvF+xXb1WNFLd+fPy2XOqGUFS6GENodwRA7FO4agzUauStNO0BianrvE6wHnQyP9w tyU8j3a707UjmW5d62N4oYwUJbUcOAcA1mfYcxgZblHUKOVsXTeU0VKNTfS+vx5OHyC3OYmY2LnY rkoJZpRDMQNuqgIGxmzhKWAZhWSDM3nAlc0KamkZlDVsaBgchwzupjg53a7UAkcjZhkGQQKspgaj QtcAvKryCxHo0YGo9NwprQpKxaFZJ08rQyDgolV2wUFVpLcoCinmtiMloNJhOUhU56S4l0D7XULP weYtoMktfiWTQkW122GgvTRGChQ7jYoQ7jMWcSqbIpzIau2nxDFg0O4EUy7oTtQavvbvQ5Ocyel2 PSyYatXe9ySPM4FBYTKbyRvc7ZHTWhIag1jkzq9i4mk8x564q/0ddCEEgkPHFKEU4ALVRHlA4jgX 8hoNi2hiGpFPz9BXDkKQlcgvQ4MzMwmHQPFnMyLKhlGlgtGvLly5OThG6Z0Szc4IqjYLXinBMdk+ zt03G65z48ezfTpwLtVXe+AA+YZFGA1WrcHMX0Gw+cLA4cBQNzmcD9XkD550yrzSsyHM+idhzOZz OZzOZzOBwWhfKfUrtPCeEyqV9Rwbdx0F6GtOwLQFLoHZF51GMwLSbaWglpfLThTXhcrgibzFRu8e TKGSWmsyhTJLJZw+FZNWaoAgTutyDIK5qnUTHKK0CTowhjBEBkqHyJIkuGEZKrni5MOAK6oGwn9k 28k+pUwfEsQoqWPcpsqGUATCogR2Xq66DYTR8p0jXUcTvpHzWYDTPA4HGIqlRi7YGFkHCIAXVcOu JbDYOfSWe+BEEqmhR+zpLyPHR0JJeiXGFmnKSDkCJ5q1MhwFq06p4jS4VOkFDg6nUguHAFY8NhsJ Uzeh9AvXw8E7FTzSA2Dihht3VV2Gwy6W2ckJ3WglzevmWsBsCyeK4NhsJXK4TvVNUFIcYmeFQwBz ZMhkKEqYGJSPQ7DqzP5GibjfI1rQCXRxuhCFAi81FZYqikgVnwXgoG8rNxoNxI6Rys6TuVK6PObP mqMTo9XX8iqDE86rORufO1QrpfS+p43tR73a3PP/O+9732PjOkQDyHiEgQWMQhHjRHzKI9BzF3cb DaHjDvDsPLdd58rJo0IalowCiEWglEKLR01RkiSSckMxBkyPuCpiztS7UWzM6GCCmHhmkrsVxW86 yZ5K70esRny+V8hAXD5wwGguFQ2cj2dTgcD6ZxOBwOBwOBwT25RU3lyQqK1oFN0aCu/MMwrYkSqc WQMYLEKS1YuBBdcrVXRN4zbniysVSyob9gyBwioCpdhMcp4L/F0EzbJJw2nBljpg6ms49iYTKLOE 7+sRIsxHV/I0F5QdpPKjJ3SrKWzDQGgKZmQrRNlBRVOQ6ebJMbR9RiaSeBnjXTDAMAgqGkKQxPsc kxO1blTrDNzcMBWNGPxet5ugMdE4yMeh445K8d88hyHhbrylqfT5FeC4mXsX0czW4aBkpRbXdmXw Orhk4LZMxrjYbBhJ1826nkNyLr14gnkvok/XmvAcBS2UKr6CmixPBVCpSAgKbiaFrgOxQ1ewzLdt OA2kTGYxftvHfSYFpa/lToXGRrKzEkWEg0EjsUjRZoKCB3LgsEKxdS4IfDxtz3ZO5DZvo4uDoe98 ZznkfoeAKG8EDrPEKKFSiU5veSOjLxep1POcoa15vemvGyieCgbZglkBsslnnMmSZOZkDkiMchyF DG4vQlCdBOtqZSDQignQVcavcNYDdrO7q1LWnVZWWtKUzSwVBwkHzBoLhAXC4+Jubm59A4G5ubm5 uaJsrp0cHI4D8LUUClFZBZLpbPrWtanchgIxBMdAkCoDjJ3ddhb1cSSA3sIuLCmwryDIIwYZMjPE Ud1UrFjF77UakZoN9c10jdDG6u/OGcGtUZZmXEt8hwd79FlVVncLhQRBK/Ya+inOiJoMDmq8LmvH GMLtZcGIVihUzImg1nkS6I2niGFzkMhJAp9wJ9AqfUk4n2bocLa3DuNLQaC/xOCeeo0vEmlNGDWA wDTUSE8aL4Ht0lbjPOlwuHCSsxskgvJ6E8G94wGApcfuSkKdVM9TOp5HYcJO86prbMnn4/E+VPpF cXCtqjSCXCoZIOhc6fV0mTJmyRSliP4YCo59Rgykj0dLyHA8zk96Pg9fg6PW0FH4UPKKNnzH0PLt AXQqUOh2oQIx6zxinSc5zB3h3C9rW7RL6CTgwQLgweYDZZ5tlnbeUBlDQ2KKEqRZ3EMhPO4VxVb1 fPO6TmcTpW2FiRd8nWpA31xklixmXPUbm5g3MGDBg983EBAQEBRAxvaI19BgJmlwrapGp01rWzWB j7HXpQv0N8RnfQOgUTiK64RgXe0JHsKbIwGAfdTqDJ0E5E9xAxuujdi+ifRzEthsMYie5CinBsp7 EEyFtGAwEuTgwaS5yjp7QrfqLbAYCe38TZydrZPt6vn06M1Q2E9lEwMJvqW6Ia+pIzyug0F5+Rg6 JxImV4GPIUn5EYOnosBoLUcYnnciRI2e+tzNVVMBgPUghTA/xyW4RmmKKp4uZe/X2Ti8W7tehZwb uDDDke00fFPOtprKiReUlC4r0LVuVy5LmuZ1LYLWrdVfxLaq1d29yuQ7R7y71ThCpKnB70npczyO iTbWq4JkjyAiDyiDUVrSA0ENCjM48llBJQttjk7YcQqQzOZaylygKpa1pxm65ZoDAFAYAoDAe6XN jcwYMGDB7xuYMGDDac+ZsZC4TqVnTOc1zmGNJk+GeHQQoe2OSiWDkOZ8E80bDnylLInwUtgeUxuk BkJFXZJm2GRfik4dVfMBAdnqpvhRRdaTsikuCurLq6r20Ggq8e8wJk2e/XzHAfHHPdelVwvIcg1Z 9aHzmKGCtzp10t18dhsLdOSCfn42OA+mqRvsvTywGw1VX6k/EesUOh32kF8lqrgMhPkyTzyehxya Kg4xGrr28NhsKSN5GKSVPl0dRBO1ApjsJ2KnoOVBykxLCgUiogUkCC0kCyYy9C71Su4uVgu0vToW C8S3rasUIrAyKygzSwNiVIZBpEpvUdbY9cMFaAuVysUxgULik0h++MYa02rRK4nZVZ53m02V2iUl aFrm3r8sBYKhUNhUMB6gwGjBgwYMGDyNzBgxMYmOaWmU69XW9qZ0+w2EVQQ7k8RqL8Rxfg9xSpxA izEVMuRzlZFMchyEWgT8pOvbd+pwlTJGw2867DYfXamDRUyeE0+CCVNElNdd9+A4DMPU7nFfBF98 j60D3pBsNTuZgNBXuSydlr6egxUyXUrEBcKP2F0D9dhmZKgsDEonYFgT1EcknGvagWlTKwlx0Us2 AwFeDgodXLkKd8UW4XCuwnyaFHKghJmoCgJQUGRmMc9RoL077kCufRI7eqfGPi69l8c+3hd0WPr4 91UkhVJ0czTenrGzJF5mqCZMpLTivHNUHUdq1KBgVncK0lWmLtPap1qasUFSESpYipAuKzAxOKW0 OoDrDmJV65SIkU1gNY1lnLOQtwArPlpaUZQwmN6WM75SJcbjWnhjNbq6tnczMzQ0NDUue8YMRgwY MGBAfOFwgMVTZsMSvjQXCtDSzrXWtW1uRCdipBxyYGREZy5yOpamuQ5CtS1TlZdSZcH4gICpRdC8 CpyY4O45UyHGAwD7PhUEvAwheRQuHTfGQyFOKLedJlgiS/Oh05TrYMhGXH+TDmAqbjdguFe7gvc5 CCxQudxTprIZCmPUTGjaTIDBAQD2OpwdMlhzZUuSU3UwGApXesXPfsPyOsxaGO0B6Odj2nJ5SFLh l2dzvXeLRswrNxV2OCnyLU8kiev3/BMDm6FzRkPIDkPUB1ESfqdxHwi4RcLjEYIgWiWV7IPX14lV 6NiuLSpKeK1lRlralK2Tt5hYLhcNTU2NjBxNjY2NjY2NjY9Bg46oiQKJwcBl9BYJjvrVta1rVDNT Zk2HFrLUOA4eqkCpCMPIM7PwSpkK6wGA96BFb+ZLIaAwypNBMsC+9Gh5QuC4O4UKa95bp3kxOTNI nCols9922GwjPeyz9jztS0jrkRMUMuLcMhX1joIcH2BHtnN3MiJLAYDROp1lg5HJ4aMOYET32rkM hiSCFX6RJ8YdzAiTfiwXCniayxb4TGzfL5QR1wGAfsW+B3Op1fodzk4biG4Kyt0Uw1eGbIzbsN3F wVZm73a8nNk2fQh65z06SbXDN3FhK1gI+lyBjm6S8oevwa2gJ1ql9FWfh7aHbIo284eDiF8EQSkr 7CYYZRQRjRANatVgSWsaGAQZBBedN3lUjFkgwQDGRWXIINFHFRAzuI28bi1kRiIjQBONgYiQY18/ 0B4/E6zPbs3QZjv0SgiTd/J11t9jfVSnTNW+cOjXgQ3T/W5/nkRMSkR64jjUD6/OCOy/dQwgEtVh jtVsdkBzKNWmJrYR3bdcapOxBl3ZBRInLxNWw833MPa+bI+4oMqJNejQfmd5zaJHftvPEz1LnwaP tVzu8xZUR4SEh4eEZrCyp+fIp9Y/Y4jtxhejJu4ISG0ebPinr6v/n4DXT2zqMqBgPuNk2YGsGRGb StYBSKdgfrOgr/rwoBJfBS+dONmsNk17L7iyeOb5GFL3ujfTVnsZ2W6vXELw9sVfClYCW9fesVVz ln4CJscbUvzQJclveHVs1MQ/eNcdew1+187XPD2PRUV5U0zoIUzDk1NXiGJ0FL7I/Gd8nzJhFKP6 WIMze6s+ELRNmXs/7sZ1yYrnne9GJ8WozpmqIPGgr14tOfzKjqEVnIJP0lJbCvkZe31Az3tbiZ1g ZzXqaqQrGKIiqixFEiJ2LLJSxEkgRUJInUg0pyurXxoZ9H5TMbjxgUNfp/eRFMDpgF6Ly0Mi91HQ OpSOEtLwuEleSJ0C/rCdGQCXwM/hXmcs8Rmx2WQk0B/EP2ZbYKrWjW2lLvP3fnk9M9M3gfySQ/ES eb4p6zf/42hDHH/MPrKn6M/97LN7mf7xLFszVzlUvExH46gD6uV/35k6TlBgfvB2qjzoz6/e/v90 DdCKC+VoBJBkKil7/hoNK/+P+8uqm0QKKiUgfnoqKT8dI4v7VjyfGqQ8YHY/sPKdUnTL7s2PkNhv VYDfskRGJXokK0nP12eevw5liHsJ/13ziHmG9/M9zdwVOAlOaV+v2tZlMw1GA9Sy6FqWwBIkCj4N qAxCfAdGMECUKOJc+b8c4fhO6Tn42oqPfDKaIKzFmdixez38tB6Jja7SDl/STnuSQ88k/FrrNvWU tNX31ziSQ5tY73meETTAkaNZ5iFEvqNSJs809vex4TgTkds2OSypFpI6JO09IFIFtYtYwyH1rHy3 OBSrbRRjgV+8ZL0fdaiED0oTymhSCkSl7Iz6OQ4mzYAKoUUKJgFFQCCnWY8Kp4u28zMV9pyfu0vE LxWaw4e+t0QVI4U8nuy0PCnnmST4yFpIGxlRDemUxZuYcANddAaw5N1qgpAkhJHI3J5q3mSpwaeS SPXngnRJHcZerfi6FI1eb9jnoYeBCAV9vvK0JI1rUs9C3Xh/H+lp525jAwzMhN1hn1BE19dkAO9l Ts/dA7GFj+93WYmQLM6Ht41DtUN4Kh2G8d5fnAAtBZBaklnHEgjKv90M8K72BoNQp4BmEPWBDkVU pjAMOuNxWEND84I9rHay1jNQB9juhJGstQMiW5iTBoA9hUbInD6R67BmGBx0juQtrKBzvFEF1mFj c466pheU3kBWrWUFSMDzoacDAhA7qAfng4N+cTFw9I+rDrNQjIRbodejJIr2fjSZaSQPGHFPTSNm aNCG3WZOcSe6Ho3QPIJBEEQiIKKMkYQJJAIBGvgB6DAConn8rVBfg7s9ipJJz17IOEOHMdrkM56f qyTkatGVHZodS4YvjgHj56NwMSas4nFZoy5kgB4s4PYjtVMjiwwCre0PwEwyGKieJlCQKGxxkVnL CRnYh0LY5BUksmZKm6TPRJY7ZIHkLN4bAaS82iSYtLLDUBBJyCYBjdlxOOXnbvCgG62ED61cF0UJ aGGQ8cydYiIgiM651h4xIcwSCIlJFDo6efJIaGhFjT20kc6ozPAUuNJAsl6Xc+gK19kUPpnludgw dFhojW7pJ3aJ8tHj79vYqGdV986su5VBXOywyTvlk9SJHiI6EoooiqRVVSpUPBqIdQqcpQQtBWtJ woxTv5sbmtaXZTiwa4U/tUEyvtjdmE80AwxKgZxV+fKSBFU2jVug+EjDsuglr28VKFwGe2wXAaN7 tuwoDRB1ueiJIJYxKP+uy61b16RxfSwDp2+liEPgJ0c2e+BSSOMfqqcdT5QrO2Jog9dKcEObk6Xi DkCQPxNQgFXwEHYZTncyj0ArbN4B2C6WCirSapbuwkjkwDHXqNZFFCMgJQQgiRE4GFqiLXjjdKTE kMECbgOA7mgIGtimbCZPkDtyazhPcB/hP+Kd+1WLEfwa/JrWGbHXKH3n+Cg35P9kG/CMn/S4Z7fV 4I6oCXUkGsD5NymwLmPNMaVQ6cfrshoe6QQg/ZVwZD9/LWV62pRcY3EMLkoAocihTlJChnYJ0CWB foUfXC13tKKp5+n7Qnsj/SE/VP1hKSDzh3gfFGv0vfVJfYP5ZRIJFvGzAuG2NqJSK9tUvSLBysXy QTW+YfykYZzTJ/a1cbh75NuJFGIt1DXTjSymdzQi4UKLrRNJa4ariSlxpJm0FjBz32IwrU7aitxA ipADGfrDRY2hRtgg7fl4Bj02GHMkuuDAZ1FA2koUoyImk6lKsqkmRsQKQSLCnKzJCwCfoI1J+gfk KkQgxHDZcGKk00IUiITiZu01kzNOa0Ve6qwgpc6JuEQ2+0qJnSDAPuoxYxER3l4sQenoDt7QqupA nHpwO1XBNOQaqBMRqET+dNAt1YONKEMyFFWICSIIhLBDWjj3bHXv3iU6wSUFYtIsgUuC4JiqjGZY tRqLJRKSkwudDrG7UWQbzPpgFEg6hsg/Y0i83mEqJc6pS9N84wj+hPXtlF6aQtsLJrKm/dwDPoE3 1MtWKZ49BpQoxiQdKZ+BtMbgIYh7gxjLiNGRoxoQOHL6/z3LGOSjtfibtWT2m/4mfDhk+m75Eu/q fKyhMmqn4ERjQftN/0f13FB1py4/cYHUaSwmcJmBgaikdQMt8yd7Nu5NXe0aPF5VJPuHneeBu7H4 tY4PQtTmyyj3FPjb5zJUoO6hoPWtIaebi6vB2KlmDYqYbW2AgON1qoBXlg5YbBzIYmL9n8Gba4fm +H+2U5MmoDrLDj3dJKRuMO45nBjV+3MwDoN0hGAupqdQ+4Td1gPT2u/pwbfK+AUUhBhEAoTU+TMe iGpCbazCjSq9sQsPyDqOH8E8F1qat8tE76EpO0KAVO6FgNXTUNsNf8hEqCBqIqwYCHJFA3ghUhR9 QPc9mXFpl9k/FagqYClEO044SMBJ34b/3NH0J6yN5h1wHhmcr5fQjmCdboEfbFQ9KIJmOMDjz6m4 jk0gRWjEDtio5xPwqRuHmLh5jBsYDB/dDTeGzUWA/PBuLae5k1BjBhE8Q2CilKGxzYoZQaaA4lQx L455jfLk8BIE2aFjxQio8jFcEAoCRjAIFN/h5rZkIt1TRR0p8KMDyqZX1kxZATA8gQuIFyAh8T8W EhacV7VBYiD9/9u082jvK+av3SkgXnp6fHGn2nzsP7bJIFAmUGw6D1QttmvkKDylJMO+ZkvdSSLC BWWlR8xd7CwpOwXchWmuoc6SPoXu9dh8ukN+XfvE2gvLR9fRSz44F8lNFzA5gmc2BJHY7wVCdzTH rX4oPEbg7XI2GpwbuzA5nvOP+t5vBxbgjCQIkgDIwWE4MLbAnxxJkgYHlnNX5BCh+i/zOB/N7mv0 P1/j3bae9aC2lvV6uszr/H9k65DkIhytUZPMxVqT3xJWAoWo9l/cw0RPKRzDxPnao3RkgyIE6Tzn w5/5BX74ADIiZnsiF5AJAjFvp9R8aLV7tfa2u8rGgCoXtJKB4G49AcoHeWWrWecmeckVkz0HzKor M/iNFiopA5ocJWF0MfWXND8Hf1J9w2KfbKMLQqLC43A6FYYGEjMmlE6VxGGZjEdH1u6b4kzkQZtw rdIuhAjSYmkkRAvLPWn6ekcccZoFE+viMj0W3nS4QkM80PEDY7nZnNY5785ClMIpoxELPAB0utDC NQn8T+HdAooswFmrTwUS6SRpKeQxifklG4ECzgibEPTq9eoPObRzEnpBJA3b81AJEwfNH5f8u++8 C4/kUJInOww6Q+2V9gN0w2J++WFRBDfAEvfsKSD6xgfD40M/GHlPueboP33T4mEjIEiMipgKUurH 5p+fnPuPQTwjXefrCdOE4/e7czY2wr7t+IL3kyVUhQSLQpBqUDDZYlAuh8TthKqlWHQRCEhKagNX DDAaMyFMGZAGdRfza+tJyghBi4PFvOV1lmNPnkhmmHR0YTD1nyFOZWYh/xGOrfKzBl4zyePznyHq PYZjE54nrNjjVDGgqN+ts6yOBNRFeJR0mshsFOOHNzcSj0GYjHR3uDDScFvyq47U5SEypSMooZS1 FgGgSJIRYSDqIZjIpxcoH2nlSiMU2xomjwe03WeDd1fvE7vLFvPLsO9e3fQnwQccPqhpMSu83+FN /JlgVFWvTAru3f9XE/sJn9YRJ1me30LRiboA6pSzhAuU+56DsOkPoel9T836gVzZnxiPOHPbmY3c xsr0ur5Ok9r1tOtzZ2r5jSZwgo4PvKuBqFNRU6DpoNT1NKed+ObxIridPKaZWu4SdJ2ZmDlDUuB5 TguFC+UxvNhWKyxWLbtJnk8OLeP8jkMF8Sgnzh1Rkou73TzhF+kFXFDsQBIrNNUZUo5by1mW0VLg jBdkt9O5Lw4U5EwSN+vEEfw6z1gKjlLqGtZ3WqM70tSXGloy5aaRpSJA5jEDWyAVAoDcvruCxWjD LmCrY6SJhJRSyO4DAxMy5Wal5M9pC80s0uk056EC8s6Cc9NRJdJPawvKk4m/Q6JR6jVmmAoLknQr HS1tPVChfqlQbZ1v1rzkrgok2wvJtJXlvF7UGlKnCe6zY6Us4U6HDrMLDBxw2qUsZZq4YUO8lchq SguRNHKUNh1287cN6b5rWSR9gtMlNqct84ZNKJv3XV/WSGE7SpGUKFBAKBhFHcJXAiD0nq5Qhu+8 82w4SpEzjsO8iVpgkWmB1kSobyFpWQ9I0BjDQGEOEtEZ07o0djPt63r66/VHjONIQNhuGLjSpDn9 S3Go2mstMzoVZXEahbyaoIjlBtqY1MzaOKdSYZMHCUmTLS0J6oTyWpWVnoHKiYpLsvoCwvytHNEs OFqjYyCCDz8xaS4pa9i2Bb1IpQhW4lUY4JihZMxyHe5GztpMiNLiF5AcpaWWR9kQq/1puWC6DYRO JuMBuORYhfb2Dr0CzRhwUfzZugMhvI6TshLXxCPad5PO2jkovBRH2sYqxOre5SZbyaSSUhRT2NKB nF2nPvTHqxcILYcdY6MZLzkfArQ9uBCKDgRDUF+sLeeoIgMFwBWiL80ZLYoOha1S67Pk+TQX+FSs /vfStFGpue80pYN5jkSLyaFImC8ZGZAJCJAdqoM10oNi5nEesb8zrfB6L03M8HdyCbM3HwnR76bl Tf1QEPiJ6lIkV/blKgKb3D05miMEBVWFZCCmgHnB5dXd/Xj9P3UelweSg+MEi0IkEgiQDGVISnnm g9KE/JuHYgfxTeQLGXHDs1BIcsKN1C9uBXoXI9+eR4ay+RJxF3zTn96H1lKfucgqKRJse+TWDjUh VCxBiFdrQBKqNT7n2IFtWvhgespYr4F3mnigVD3xsEebmhUrdvpx9hXLGqFimMMjhXJs2Dy4HIRg KgZVeI9nkm/beG134NsamTgFRFmRSaO7WFu6yWi/CGy5n983BwQzsVcybqh/ClcTFTR8vX1UK3Lc Zo0C504wanMa1cK9gxWDnk1O/vz2yJ3V1POLjUz6K5TW1pMiRducc/RzOTdwUAbEgRk9wvij4nAA DvncdJSE+xNM8HUVggLBgstkpFgxYpFIQGIFsaebjomkgNgDA2kIM7PArWB+9N7a16QCwYuWkSmh 2t2CPfCRDkc6ghRy5GNAXcnwCEI8Z0M+GzWJi+o+YSgfVv7DpthzGmIj9RZOxQ/jiqRIowgIQgbp 5OudniBP6WoBPhLWzKB4GVrJVx1gRjUki0xDRiIB0vd9yEhuOcfdoH1XSSC3ayeJf5j7LZEaNkKV tsWfHvY0kqVUZigpIzz2+l9J8rkYMItjRgaFW4YJCQuB/MARdMNI1pIRFVJQjNxcVPmZI+y4zC5Z q86onzTqxPKfVu0aO52qWeE+40fcdji5PzvO2n0k0HpoohWUnALTgd2jUfIJrjImflV5TTpLjQOY 0rjTeMPtEeBiVPpbApcHKUV4Pj3DuZ5iahGKKrTCD9Uw9qFtFesVs9m4GZdkAdfi5BrheYf70Dnw 81GShGQhLZGMOnkEt3oONkGqD1sVnqf00ktS36J0MLo5AQa6aFXs01sdt9Q8b4m7sIIWrUkiZ6m+ ZgPpEwAYGdV7KJnUeaHrsYcmGwSvGQKsGxIb6e4vU7vGh73Y5YHTrpVgQkJIHqb3uPRzH4nwc6HO HsenlAfORS0EpWG0DdZedYl5CPiNccAF+8yvDBxomrQ9nnfEaH3D6j7DIzueAxE4ezklmyQQgLEW 4L1xHSPv+HXCW1ZjGzFMh1gJloVuKhdUkVqvcVVnFyrrQuNPqWXvVm9alcgo/t9Ad/ixGKDH7C9Z qvH3ZYKgcg3HsLzHyo9Doesfg9x6oj3x7ylIVavaMqBpMZlxzQB5DQGSEyoTbCBaFHvbqjwcm9Dt c7ofY4Ahnc9HNSlAR3fr/tKJ7uInlKv/z91S1m6FTqNznXQIBa6qukoh8PgZ7x4NxJPvsFERVkVY pESKQWKAj54fNw5k8EXmGf8t/qWFpMGNTzzdyvaPuLc6FgLXGMGIe1wdjU974jUOjNro+xroHFZx nqs+x4rwO5DSxxCNXU1fABX2lkYaWZFKnM+0drHKzcYBShzmLe+xuEt53TKaSiUGA2UrFop+UHzt 3p4w9ovrE3QQDEvLPvvBJUUdv6dB+v2dlNqpQakkZNtd0MasVQvvtD9hFRI/fp1Z8pjf78hiplo2 /i7bIeOHHlIOlKUafdrNb1NSy4nzOShyGDxgXorwfrEz9aRB+cQFrH+aKunyp6s97mKCZ1Qg9moP 0FOxqYRSRHEqo085yWGwcWo95mzUOUHNDD81ScCStjS0PLKcacrLKRaC309X10PoOHNmZd0jo8mg 3bFu9KHUThnCHz8aInBhOMDIk3g6jyn2rZGp5HtpKCrJ8jBfGltJQ+AGVPCF1Q/XZHNQ0USyiLBG fs5mAbCUKQbEH5kdEe1nuSiGuo44as1t+53MVJAkYgwkUefJfJDoeYg+5v3fifH5iZtIBnYxCAQZ y85Tf4/QbTzhki7glA60uH3hUIhhPgJykPAR7zPaZr8DdiT5QuEwlGqWKCzvnJMmX2tGTj2x8JF1 SXR16SktH46lgmhXIcvsdGhVOda0J1aetewtAu3rMCCDl9y3D9ru1B75tiJIKFIJQfFCiBJ425Pg vhzf+paVM8q+30qtfEVLfRJeEjxq8muKnQnP1bTsXr+t0cGPa3tgcYR/slApXkH+Mu6uOlaNh6l5 V5lt6oG96Ee2PjoYg/7Gjf2fBcExSPU9vpvC+Cl3IeNGqpVJDxw8CbCnRlVyXub82pgiwwhqfjdQ PoPt4bkyDE+5w3SbMYqCyL95vucdtTQnKwqMAWALDeU5RmQiDIOwWQOh5H48r1NX5/PiMQXh0mYu v0e0b38TzIr0NnAUnDdtPtz5Zk+2PzWWQpPeo0Qq2FDllxYpQownbLqyM+xpWT4KEMKNbnCqyLg+ VZbzulfIwAyc0eNwMifbozMAjYaDE4YhQvCyQ7SHd9cfjD4d4yDPU/1n89w67PFwVEFZgaGhvNee PI7nkyP8YkqG4PbRuXnaI83FCInFOqegvZHaBGaZ2IcdWA96woioIkWIjFFIgx32Ugw3wAKQnlg1 CCDFSrmFDcW9Y52wqftApRSkRTwe8TlgY1lAIQSQCRUzPTHGOYAK4iW5E2vFe5tJxGjOAZLtI5ls Ok/omslSQGGPpcR6tscjRaphAFHGxCZDAfimXCTuN8GG6Kc5ALE6ndoUzD6p8b8ALyFGbpIXHUE0 5dTI8zX6vBzdTME2hG9amcA6hsU7DO3diJF4HVNXmM70fjN7tKmqGUywKPFnUwuoXRU1hlmao5fQ 0ZAUF6ncJ8glUNFJFWkRoihEVj6HS6XLQ3jSBgGbGtRD3f7eaqtzhRK/wpOohV6fCqZQsKULQa/M i1iaQ/tmJKvMVUqmpIO4QD2w0N5mCugc5tRIXQD1olvn4hkPKFTgSgPpO4sQjDagcNuCbn6bReL8 bjNyG7UD7yYejgUWeBhyO6QfomP1POdYkWbGINiH7zQ2bZRP6JK9FqWGRjJU7XwckOZUBSkcNYei i8bWJYcuRyCOFGcr1mT9/c5kOjEHFUNcG4xR1FzHi7H2om58mtk1gtR6zWiSqDKkT3jZBNojepSC aCkdSNHZYCrFdEOXQXmC59EYrZs5eokhm+2D8+gaEAoTDmQv/69gaRaVNyR7XiJ3/GP8F77l4wG0 xyXxee892hMWpTYHMKfk1Uihp37Y5NGhMzWtaxDMrijoIhZfZwrdGTTNshhhjx3HiwS0mx8+EJXE pQKCQwnY44VRbygK0DUiQQqpmarhqB0ITu4mx1RNjgJRLzrkCJIYTi6PumYBmqBsZSWACWYKsjYj SVhJPctmpCzbaXAwESHtlklYBkjrpHQJvuLCJBIQIhGECLhEIXjSpKKgcKUchpEgsAjoiFHwfG0w H8jatVy0iIOg8bKG/6C8I+7vwXsQu9aV7jehYpzIDrhaIGOgGD6Wv2v1tEGxG4oSdJSjGPI0SHsp JRkgZtTIJBk1aaIywBjsZhhZbIstkMVlTAYESIGxUQpQUl40SjCKAXvEFCJvgQPzTyR51E8mfe+M 0nzO4MPWk/AmptBbStPoQ5bXfCWhlHK1H0xpYotodTsDq2gHW+S70dUr7xo1gBaDCL9sX7jKj5Og oBgTKI4kBjJQS0rIEXPcKPOxr1tnu7UctmbMhNWYk+l7T7uEB7jOHfMDQ3qgbUCJ9g1cQNBihmV+ cQGv8wyDy10Ajc57PEPyjvNJbC4NDIihIPBlGtxu3EhOS8P7IIEISM9J7HoAyYOJhQdYndShCDBq xOQirepOmgFDOZ8Dml4mi4sJrIp0Xpihpgkg3ot8cgjBgfouzG/E+YEWijT8opoHG6UMg6DcvfLn lx+Liw0qbXc5OoXK6jurVP0WDKL+NhGPFG0JFuv1hx02orCfUgBAW/U0ffJi0JT8nfX2auJpSfbQ pSUJSUtkL1ZyOchC3rdy+tvU7sTDcD0wHyMUgQRAhICwIQYQSDEcIUYq1zjdEkZHhVHugc8Ay/SR 6YoSD/U/qFHBHomdZyOfMcL/dxd/g/8GeAJnDNDcm2ebmE7Ro71ZGMIIRGPDjgOQO3kDIb6+37S3 jbcmZokyf6dn7cZxXARLYUaqi8o81PbX5HOFEINgn7Ce8aAurq4eUf7Eh4V9ybs3wfBoQafW5zzO F0TZRZZS6Oj6lewWpUkLYBWKP0vcKP2mgtPS0lQfv71aVWK/p/V6cNenWtt26L9DeRwMFtf1O33d fm3XaiEga6P0cFAr9NkGKNRrUuJCyDT+PseNMBH8HsF5mDzwfkETo9YlF+jZ10diuWsJ8EdIOHb8 H9qH4n8jtbzAc0+RA4Mk1LG1NhRMEdj/UQkMHDX54QYabqh3E1pq8quYBiPfTSQOyp2VzBC42I6E vt44eqJ/ARDtpnrs1OR1H7UiHpwAX0qlVgyPxbai5/zMuOIzPNobFmsTuWC+b9C4NX5v5vESB9LE rxuDsR1OB+kUcEK3lz5nyPcfkf5fM+oENRFU0ux9GpGN/pdbzB9/Xu7ytmVSz3YxRBGCkH4WxIqB ESf+xnzitWKfm8PRalKBGP1z8H41tg/nLzVyHr9Q8VhOUVPiAEiIICFkFixBUURRI/C1SJFgzLSK FpKgpNJgGUQkjQWAlIUCefO0bIrqadnN0PRYOzsp9Qo7H6XX9DcloDphJJsCEGIhoSDYW+xUbJCJ +l9zggBaAsEuUTUMBFjE8fInIE9vEaXyN+WMTAi3CFTlDPRCMjAnvSzZMQVWOZWOCNRpJuaIQfFj 9LnhX9npXj+NmTUu7uwjE+RxPBsS7C/CFC+wX5CF4rGfI/BaHPL+pD8/9lOnaHjnDXUHZuhCZpvf aenVKOEshGPtSlhhIP4JNcs9PxqI4j3EDODJEjEQ8tBokJs7x11E+Ti82KK6DfmyAr/ERKZ7B2ji yLcdLRudBfU90QrrRMvamLUBGZ7kKFtiDiCuG0Ykd4sH7e8E5n8f10PW8hEBSEVEILAn2hhFCV6z emc+PG13C8H9kQOMrYeBBKxcliMW6geQNQhUwQhUkrIQsYEgLFIMEaSvwbgPS6sB97oOQwchzQhf T9cUzc1jnKZ0xQVT7vKbds3UCgYhjovrxpZB1NisoQDpO1BLxw4sFylutjfFNk6E4UMw7JvjcAxi ql6kOBMI51A5wBm8BZmzlK21NJW4igzExxxRVnJkS0TcVXEtUwn3+1qoCpa1UwwigJim5QP3PZNz 3c2I05mogdIqdYQeF7RGScjOKqNbitl5UoVmyFmfkFeGoiqYVHKHE8OV5LR2vEwUXlm04DDYyhrf mNbtQ45P25DRMaSW00Tmky4+RaMq4EfC1QNI8WdqkhsBkpV51FHStZEgR0QZARb+LX+760+VDijY 1iJNDhdcQBJ6AdHhBXWldX2kMZgY5SWid7hnPLBWEJk8458jjIn492YMlcaZtGH4atYj4ZnE9JXk H8upPnA7yvePhMSX+q2VTgHs6orAW4sAbjws/A++6o0+XO6/476EIXXT20+yz2IrlRhg36x15pjD J5nqFx4HKJAG3FKF1taAs2L0C2KJFZYrdZ1unDVW8+F6UxbwXwOhfz5y9kiMiRkIqz9U8TP4Iv9U Kweoh7Hzp5Dj8op5Il7ob5QPBPAzd75qaHD2pZPBBPlTI1lVA/ncZkOQIVlUPZcK61ph9ilYgwNZ Rp8AexSXUuJ8t+6bNrW13TYr47Pi4XcVubzdsFg2F1bQ2aBjIgYDML+aBr55AAtGUUSUDc7cpYbH xyQ+N9+222222222222222222223gTnuF7YT0QNjeyG8rbdS7GZMssuZky2XYOaTed4E9+QZCfPZ 72T33ucto+ybRlxPgcmruwMwzduJk2QRgIzZgg4osYsDZmztBUhqbAyUJEiI0U1UZCxKHoENuf6b y8yxgfsqStE0Z3ObwXNQxHPniVMbtDWuhiZ4mIJhQ+ZeZxRqAfjEroxcR2vYRzEPOYG4vYQ0+ln0 zGDdPsGhAkIFernIyQqQSGeutoUKFDxLCWe/RTwEDCxaMiuRxvAGCgMhZKChMplzDzlXMkIJBBxA CuHSvBlqwJQA90mWIGIO9wNknFIbsJ1NMFEN3POe+lm6rPg43Nx0oh1LQSeTC5qHrGIlzSYKh7Dy JAVgYUQFkQpE376a+M5zKZTcF2bwQ0pvbpJTMMpKYWwomazDOJmBtmpQ0wrJtvs6UIEW3whBWUJC Ago3IgGUolmBGW3MuygbIFBHYMAYHCxX1m1YiOUDLzEDnXKZtTetPZdwM2jcunLRYxijSgM2mQ86 GQkIPaeCsXzJ1gvsTnotzxshlAeDsXg7okyclQrKlaNjisFeLSXrv01KbsnAIjVKDeC99q5INirl RQqxKqjhJCLBwGFVKwtETJnM9W1pomJCWjU3LipIeBptY8TGtvMRB/xZeJjyMsKkvwJEpOM1bnlU x9mCwRKvEu07NtFC6Ub/c1L9/GxdreFGlWlQgFJgHx3RqQMDWKnsEtIo22BIiBr1FGvTIQXLHmVV WG7VobcG1oeITUmtsLva7jEIuOKGqa0FRaupOHH62rgO+VhRKDQ97oOUbhK8pd8IQm9Kt0xt5ggl jiKXQQZr1OnQaNsAgSBJEi1jz1BaoP5kKKNAyFOvlNFY+miLzSsFTo5DElVwupR0IdzV9so/lRxy 2O/ESwht3L0hm4ocZ4DfhAnRQwkhAy8dYt0hBcQsOVsXB3yVYpgZDyPk3hDbJ3r0Ah/QAkJvIiJB QmmB3JDEihU8kV4+SO7WEDZnjeVhSSNLiBSlNe5PQcojEGnt25Au4f5qPFudJuI+DXafN1+l/1ZC eRM6uKYSIHLKk8MtYlt7uks1NUJ3kOeASoyqRPsddT3vkmy9cM0NaHqeuHX4p1v8JHFqYuvpEfJe HOwe9uNPEs/o8j9+d6Ud75XDkbsxzd8wn0LUXgh19SBkqevbge/v2a052fuIEmUGB2KzHnjI7h0i N53yygqhVSEVSO6CQ63iaJWxBKJBgv+BBVIJFH4vERQDf30UP5yoo8CtydxqcQ1j/yiH695QnCiU El3K73yaZJNC1T14DIYn5qbADDyKo/3SQfgPKc5v/pyMhMtKfwwkZJANYqFz6Pf6H36rmP3FCj8C mKJCJ7E9z6aazxOcvSrvvEOcX+LjrnAyYmYIHoV9PtanVDlz97rMWMSMkcxRtZsRlX8HwdF+AXHE j1v2fXpB8hAYfYUPE+pzCcSfjh162QwrQ9swtQgn0nsfrcxugzAy/LLBg3dXncO5uKPE4YJoCXcr 8X5fmdGtyMHEybNils4LPi2U2Qc7xvUY/bJJC6NO2u3Uf7tiC6XMU4PlOD2PDekgSEgQjN+R3PE3 PDjOSeYcgOM5kIzF+hqodxLg2HLVOuJJIHyYl0UcnwoPlLJwbiwbHlaD1TPlQxDfFBfxH7H5vgeJ 6WOHI6XUd7Ot0D29YHLKZUYH3hWiVAsaDnzuDvdTnKMOoabW9DMZiLIBoDRESHHBfeJCgG9c4kou XroO5UrI5rTSKlGw7qu16wuIDNDERoEXdxHGHG+UJhxupqYkxLBkDQVBhRBhdkYKkjmOx6SliiFc 6eFAg6HXZrm8JviPFM4TRMQKM4WuiwGSUw5nZyuYOwcTCEhjD+97kdSlRoRSlALJUWl2kayDYSy0 EeQ8WZ6Xs20c3S73nj1vh6nKI9M5zicWojaakl6E60SypSoIRRNgLtPL2O8focHO4tzl2XUr1u51 O19bcAG6CpxQF53I3D1NneRNnK8ibg5h3uLm7XoeN7HnY739/pFfKp8Q/V+zwVLoEtB/+/uP2eIn /ubBz4QCrJ/+YF429JMnTptJoNqAqAz/8XckU4UJAq17oRA= --===============8225072932791891213==--