From: Tor Didriksen Date: October 22 2010 2:15pm Subject: bzr commit into mysql-next-mr-bugfixing branch (tor.didriksen:3230) WL#1393 List-Archive: http://lists.mysql.com/commits/121706 Message-Id: <20101022141556.C9A303723@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============4968967694643388010==" --===============4968967694643388010== 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 3230 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-10-08 16:11:32 +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 @@ -107,7 +108,8 @@ SET (SLAVE_SOURCE rpl_slave.cc rpl_repor rpl_info_factory.cc server_ids.h) ADD_LIBRARY(slave ${SLAVE_SOURCE}) ADD_DEPENDENCIES(slave GenError) -ADD_LIBRARY(sqlgunitlib mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) +ADD_LIBRARY(sqlgunitlib + bounded_queue.cc mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) ADD_DEPENDENCIES(sqlgunitlib GenError) === modified file 'sql/Makefile.am' --- a/sql/Makefile.am 2010-10-08 16:11:32 +0000 +++ b/sql/Makefile.am 2010-10-21 14:12:43 +0000 @@ -162,6 +162,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-10-21 15:44:35 +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; @@ -18288,8 +18310,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) { @@ -19901,7 +19941,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 @@ -20003,9 +20043,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) { @@ -20352,7 +20394,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER pos= sort= sortorder; if (!pos) - return 0; + DBUG_RETURN(0); for (;order;order=order->next,pos++) { @@ -20369,6 +20411,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-09-04 00:46:58 +0000 +++ b/sql/sql_update.cc 2010-10-21 14:12:43 +0000 @@ -423,7 +423,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 --===============4968967694643388010== 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\ # m2o1h0wnkp6uc98w # target_branch: file:///export/home/didrik/repo/next-mr-opt-team-\ # wl1393-merge/ # testament_sha1: 0b3c9f676de038a0a0f332c6e4e5cb3183cbcd21 # timestamp: 2010-10-22 16:15:56 +0200 # base_revision_id: tor.didriksen@stripped\ # tjgvbrev1suhde6e # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWQvqzvIASCh/gH//e+97//// /////r////9gY94fU8TfPeSV95hzPXrwa5SNuSl491jut49E2nPs0HKjmMvWkopre2l9iq+Bgeu+ vCegfVX3S59defAd96H33ePSPrM93fO9vdp6vfb7vfYPva91DTJndHO4BmM7LuC7r3urt5H3u987 4em3ve9Au9zoGVaApQDeKtvfe6WbtHy5hmUTSujJXbvve6x9Dp9t20X198J625pwXEyi+7WXea3p Xx9H2+8d8x9NdqO27ruF40WmnUldHXdnO5xd3S4pVICn1o9eebxCCOgaG2iW1aiJsNHAPj2uPOlH uc6obobzF7UG2BlSlZPowkiJoAmRoBMJkTTTTEFPBTZUeTBMJE9Q8kB5J6j0TyTIeozQSggaBICE BMTQnqm1NoJiMgBoAANAAAAAAMEQSE0TJlNGmgFHqeo9RtT0n6oD1NDRoDQyeoAeo0GgAABJpRJo ICDTQmjFNiTwFT8phPUyRhqepkGmJ5IGgZPU0GhoPQIlBBATIEwmEZAJhMgnoQ0TKeo9kk2oY9TS YJtT0hoDIYKkkR6aQTJqZPQkaNKeSb1NI9NqNRmkep6gaMgeoNBoNNNAAAadx4VD1J6qK7IgMICC E/htoWurFYgwiRiJIhGCkYKRgqEUAbQ/xP7CUT2q3ViRiwgRgkYkYkkEG8FqDaJSwLAX3AtAX5RQ oKexIWSH10LIfYQsh8ktPzpaYlpjRFzBCMGMEjCJBjFUo2AlAgZFjEksJRUJiSWkiikTBYwWMFjB YwWNqSXIVKSpSVKRQEQAdmgAtqOnt7e3t7e3YJGASN0Ctrbp29vb29vboEiwSN0t7m5VOO3h7e3t 7cJondbe3t7eHl7e3tsmE7rb2GNhjYY2LLrNFmFmFkWGGTCzCzCzCzCzCzRZhZhZQoYWYWYWYWYk tJiS0ma0XNaLmtFzWi69u3aTSasUkFIxTWQhrqMKf/fVydT7WwmSVIo4sov6Nb6Uy72ew/6QsiHF GcMbEUVHTo0M7krpGOGHKmiIUwS/0ZfL6G+354mYQMRezJGTZtPvgllY/zYF89GGV9/pXthT1XIP S8Dw31fjzYgDHfbPWm1f3/vXPffv4LQ2/1I4yOPS/cV6YqY9nz/fpdKz7KeMDPcwLSa+zwr4XZIE 7At3/KaFU5h1f5Z82o/l/5/h/Ldx4Vaun/Lhdb//Or/9CzrZ9HTZCJN4Sjp4wNzPHYbP9nHnl/VT PyoeDsw0tru7P3s4MTBWB05s96djdMn6vi2hBn70GKoQ8cf8dvJ5yEfMwmA0MIQZk6W+ytUKQ+PR mlY/D8oZkNkfG0Nujpsf/d+mY5xpocpzMgcuYTNnSxLP0j174US2cLV10ePNCmdjp6J2K15aTEA6 MLE6VEbXCvA7VAMTxy91OLfPDau5no1iVFLz4pxNP21hbfLjFp9Wur8LZdGXGVJnemMvHVx1qSI7 Iia4Dp4uCovvi4sXHxQN/IPzuVUKuD5X/GOrLVHmy1nJS8U43ip2az4X73xfkzoc+T9E8D1HQMDo WOqFqEJV5azDctVPNl0MPu1eLAxBjW1dIizj8XV89+6t8Mj6fYD5KwEOXip7/O1zUgg4fyLzKtI7 UHAYZriQRBocV7DFX7eJfL00d7xEuyd3Ku4Y7J0IjSZ86OIa51EsEFayjBJmVTJxgUo2I9TAuzVj 4x6PbkKnK/N9IGmYD3zkr4i0eNmDiZmjwDWCQYklqm0wj5vB8c95x5qckAwnV6eutI7b8PjJAiEm L9JK1K0ANIFUM0ND2NjEwaJgmC4Lg63O7iyGDg4gYyQUyBpjQjqR1jxRznOd+42KxAs30AqBoQ0I Zubg4OCYJguC4ObheN27gDuSQaQ6DMC0BaAsAspSlFRLIVcIYAqBZDNDNzcHBwTBMFwXBzcCzZwr hLSywsLaqqreAMk5m2ABsAUQLIGzs4wcEYIwTgnB2cCjRxMLgi3aysrhVVVxnuPRA7OdFhY55HAa PNc1lZWlzXNUaApjihtHa2trC0tLaYDg3Q2jvT1t5p7t7t7t7toCqCEFbe0Nx7p7t6t7t7t7toU0 YExuPaG6e6exNoJtBNoJtKBrd7isrDKKrKiGnzpHlhrZbHSSWny6IcVebF2Pyx6H3c+HRYXq4nA0 8r58kNA8SBUJ2WQUgg6HEZpKQ51UOfOXScOfGBanPrRM7XP6saGLS2mggnrKAZ5UyNqhrPoqZVLC SWA53d0nr7B4VkX7QQNfECJQ5jYQnYQnEkMIbqlAXlZKgKALIdTr0JMM6bRV3cGhJy/puc8MYMEw kNGG0QH4/SGLPPu7IEPSur7ZEpch6gZ5Nsp4UvOcaFvWDlV53vc1WEtVpyZzq5Wsa67vY1vfC1w+ L1e61WbWOMK8aCOhubtVONrfFyYHGMVgLjeBMZXmeyROb1eSLpfmQ16Nfg3q1m7axuSTrZh3Zt2L +hjkOxm6OTXpIebvc2CFm7gHuggiprbu4VYd3xARRUatees93yHrK4Xw8YQaAqjmQVVfHRQD0xT1 QUKxUC5EP8v8jd+O22KYJqm16HVhJtYoJrbFZOuw0/ZtwbGGxMJqydDAltJvxSWIYcJidSmWexkJ Dmi4xoMEw+mtYMgWgOcHGBZA9umpVjFiwGCkPWMOz/bM4IChDqsCu9KRCIJ7T0xhlCcTdCpPBKBZ lCxjJIwIb4++O2LeBeA7IhRiJaCAc+fFMb+DUL4bnosHtTIZDDMyt2ieH+fB1aewo3kBcMIQ4GIx GOmb3T4CvknZilvgxvDpzWWT/ktmah9NjCgl/HEjFDa2Ka3M3lHDRlehFt9KjEGmzBqiaEKbseBz 17s8r4t0otz3I0PTtg4SRNdmeEklU8XjkubfUVv6/bDsIxEAEgkCaTwRONNtaprBx2dG5KBaRRNf CV3aVD6F2jheiSWogGnC4c0geO8/vTPcWszFdITwjI/iWwoCbh/hOavIkHgPCc0DA/RIrYh/3ZBq OXsMmSoabNmUWFy7OHJoRZGnvEqLSAG7pl6XlR60fxe6M99Zza77NhjQFNTgy9ccFDfJA+lBzBNA JBSRkYRWQkZIsWApFBRVRkWQWEWAoTz6Ry6zrV27dDTCJECVIjf/IUfp9/1fi6ejnwxMH5p4Atde ar6iGH/sPIHblyzn2Ni7NQ0FbEWOF1o0XGQqnT8eXRRVTn2ZrMh2pYEwlYri1lKKndRYYxiGdVLV GL0o2Z1yFUnF7VrnMBknUvVQs6tEUdIVaVca03HUVbY574qiE4rxmWZnE81sl8Jwfb7gdR9i892+ 33SmOvYLnMHrUHy26w526g8FbwIWlpkVRlmdbM9OtWrKSluWxKVUb2+U4OAKQi4cRE1jdEsJqcva k9rNQntaYkQuVGUfLFUec6us+FdVWS1UrdrLOJ0vegVFEkt1LVEtWp39NK7XSnKykudU1OSIrL6e g9o1ugsdmWto7Qax111rWG87km+dBraqOIYCSa0sJrSiGG9hKnwnaDSqeM0JRVLH9G7QtD474Qx4 rnZ8V4DBVTkNsqgdmp/19XaegU9awGLKOMvztCyU0LrLJ4qPMjinNEDKvnfgxNvU4jq9iwn+HzVp IRNzVt8rXtq7z3zSmgmneJPefl3bSYPqDzkAxxySTMLUZGAezJpGggkmuJvJZ2ufKIcWwdAQTYEB XWCQV5erDTaOxWB/5Qhh0auU+z2m7ta5bhU4RpodkhVrY3Ed35i+/a4KaKnIsz7j301oKlJ3VFVF jAmGP4MAMw51HCnU+pG9BFfQWrRkW55+h3J5EoLMz6+RjQFdCWeCKHygvODJU7beWyCNAFrAOIMI MYTphw7vXQOB/I6jumgnBt3ZWufUfoN3lWJlu8tW50Fh+ab2luaoW8SNwI+wLcLfIINH0h/6LPG1 abuDmu0U3M7n1WuUt7iqEOuZZYxgbg3B3BvgESVxcWRS9q8SZkVphnscmYN0ILzYTQKh0NjTBJ+3 hBQ4BeGYYijMusQFyq5DFkhmv3un1+Y6o9OvoT6CA/VrqibTLgTBHAlrmhDX8IyXX+eyiqQ1JeqH 5FHZ2DcaOJE39SsvmGTKXYo6w7Ts4/tD6Xbido/wDLekPoLFVVMTZQ9vGMdfsJoqeeKdxRxRUliZ u6FrVdBgQqx9Mo4McZpQrLGpoYwHUltBja1DBDfbpRsL8dv1UkjqSv2eP8zKe7ZpsntX69tF69NJ Ir0z666Cnip3JVdnsrrCcGq7+HX7M3e/4eNZ3HcbM3QyxaGEGIRsIBCYc26fzzYssXfSp4wVT6o9 bG00E/n5dNeSjcmfAeixtl5Bs2nq0TcW4y9V513QwoM6/DxMJ5ZW2RnNg000nVj9vnsz61iO5IMf EelHuGWbIZEZpJYZFKM6RYh1N+Xjv405b23w4bKhMuMc2Otp5ezXWNzcddHnbhunYIrWQFRiLn3G JU4eiuDkpW83brVb8v1m8r9KslO2d2m+pSlV1VdaQY8HubVM1KJ1LZJVrnpP2jOKqjne6bsi/c+9 J5LwYkli5wfCr9NpiwlQyCif61s9/PPx9kigqDKPrykNluXYyo2M5POnZmp0ZpEJTO0/p0SnY+aC eo0HKIOfEGRvLAi+IGXDU2HOHbpgXbJ138LzR6MjWm1XX6HHF9h4gZtebsx3FGImTqZkAL1InPWG 6oPr40K2+0TgV6M87TOXMn78ccHottcc1H1+eofJSizNEb+fjRcim9rd00pImm9wfcOS8AZq6Cvr pcnRZsvghoLGM0zD9Jp38Rexnt1urRIcfjkt5j7vHyT3yFYs/rz1NT8S7De4v1TdvSqv1E7TfK7M mYHJWYneO3kR4LxbsljKjN5mvxLhrrg63JN9qBdeQLdDWrJZ54VTZxx2zqM+dV/xz6/z5KiihmBq KKISUno6I7786aeuhzG/BjAtOYVOnnc8Rz1Lgef0PdwnIswzIPIsWJySjpRiZTr4qJBiinGF7T+F uPaUASPmyD2lMJ7DgXZbDnuV/c1VDZs+myy+Y4RYYnhoOvqbo14lkXWSEoQGnsXJArDsl3dnkyUW NlbWN7Ybbo5L+V5Ez/HdqapBz6k6vojg+esi/bPpUnzoyS6Nti6uI1x+Z6JjqZXfbUdgn6sMbV6c IJ20NCjlEs592ZStKqa41nXCBIishPWptRphUu4Yxzx4CFJYdtJdZdVaZiDZduWw5S0xvxr25LaB rroHxS36t8UdckK7eB422GvgAZOTwPQQnArRzm90O1tuR1GVTbYqeA1uDka9EhcGhkNrTNG+Ta2f VMxZVfDK9NS6Usr57JdjdqqlUwvtNsfLT0eHBby8dTXX+yCCHuD7xGBwCQqCW2ckvjsbnq3UlZTR 13vzzVu0sq2sYaNR4kaTNTpy0SixnoNfIQKZ7mDO8FW5GT0ahtVDMkhNoGvRh7+lb3lcRWGl0xMn Ncsrv5pOpktaeth7a8LlZS26BNVJbN0fRTM0NQdAI94HeBoOAwwIoz6KSI2Ymrnvm6s0WbK8qpOw d0ueyRZKixnb7a+fdrUhvVVufDI62d3vxaDeKPM+0tvXN29frs4QHnO3OXGYwqFVCIobaXiRbjZm bcc/gOHDr6SKbTweLZNTTKyY6tWwX0iidBgRIm4sMayj0gX+xdRknz8H2DMd1elNP00OoXWEYwaE YR4zRYnbSXz2KUaiSgyztGEtkUmUXwUI8zgMT27Kb9pQq3GrWFJkRJ396bC93i5MbDcgsBRYTj1p /v8B8+JL+alEg/SC+09f4/T+L/oZ4/o6pDR++eZ5e/7oz0x5mnj+iiafjb5IkTwXm7nzer3ubn3+ 0d6lgx6SqYa/y+RrlHN47TqOGTSYbT4oFLsbI9rvracjDbkkQpzk9tHA7+zR6vr+EeL+S09BRRRR RRRQooooooooo9RwOw7j0nmOZ3G0uUXLly5cubC5csXLly5czLly5kXLly5kXLly5mXLly5cuXLl y5csXLly5c2Fy5RcuXLly5tLi5cuXLly5c4aHy/ud/qk7ts7vT9PoD2IKCgiERAUIoRQUBEIKAiE UCIgCgoEUJFAUBEBEFCCgoSIgoQUCKCgCgKAIhFA4e5oZJ9f8jMOIWIVgoxillIIsGyUUYEFBGLI RxFPlAarSLEos+huAFCAQD5R0nqKoN0qH5KP2qRCBFdEUxx/dzn9VApBT6KWIY54c/vvCnovx/hM mlNshMyOR7XAuTdvlcGENBvUsnqr3VuN+d5DXd99QtzfWWyks/jc34O9/sEtBHkOxD60cFtwQDD9 e2Pnxk+NTTKMogPQwSdoCJi0/pG3t1lTl3+PtsChHUHlZ5HvqMygooO8oosWCiiKKCiiKKCiiKKC iiUUUUFFEUUFFEUUFFEUUFFE0/7ovo2+TXfqv56z51H+X6OZ7WiaD59Y6qzjOmM+Qwo/ZZzhS14w mYHQx02J1Q3Iy/mhsOscGEK4Kxc40NGuYN02SVNpguqiZCvQMcETAlifvrev4cpYKjqh0H66Ujmk fJflq7OejjA/FtFNH+E3ullZM2nsNseV26fMYt9E8ZlmyeVsPz0E9NcvJ1R29V9eup6uLFai3Bv2 ym73Iy5sL97BpXlso+nCHF4QJF/Y9seT6BoWTe77OM09wSgzT6QxP0ORo+7z20lGTLRHnPhH7Grq Cf54+2GjGOO362Mwymneca7ZdAR8fpchZ0W3w5/AgfCOmBofrhv/VK1etvEJKNMHzMVSmhZDPnkO yfBR5t9vnnITt8xoCDCFA/JM5ZWXsEAPw1PEfKsIMzs0V0ZvfZ7xdFMwr10xx8bUky0s52SuvfRu nxXM2csqSTA38NnlwmDJNNRHosFVArf65wSB1Pk7qyiQACOne34THLzNdQ546vnOF17a7UpZ7F+T ykJqpfx6XpOFolU3Bpxy0mjAIjE+MlssoyllEmiV0kGIHtZ4P0c/LHzTZOyl15wy85+eWxmXbXWf fnAEhHY7T8NsuKpe29OqH3993GnA859npBGW8VuGQUJSJPoKBBoMGCQHCv0+McLyg4ITOyn9sRPL PhGM2pAMMUng9Po6pv4uPr8+CKbgESxgKBlKh71M/CmTbSyQRikEWRIGWRKUV17KGEQ9WmXyPdcX HiKP/4xwLEJsPFa0Vht0HbPayn3+ajydD7+NdFVFlMYkzcz+uyaySJ7nRrdzcmJDewwMke9rmZ7I Lsg5QxNmdShlj2Sl5V81l2UEgmqjiq0vGHz1xfReJK0mojNv18fJQQq/5O/4SjsXl5Zm1L/TugQW XCSVSoeSkMRSw2U6b7ZmuHZ2KDlD2BnOOjb2dxPfER6KURqSpS0hSKlBhwZ3ZVjhOJgNz0t0VqGx niVQvvnt9FFC3EqNV6es8evxXkhzPFPN2pEqj5LraSP8VnqU9mcWXE6di3BSVKTkal9ZrTYnM6FZ cBfpHqvU9648RU4DntHVEaj2+7fxd+ufdxy4zzFyij0HtHwn0H0H0Hyn0FzBgsYMGDBgwYNpgwYM jBgwYMGDYYMGDBmYMGDBgzMGDBgwbDBgwYMjBgwYMGDaYMGCxgwYMGDBguYMFGDBgwYMGDBoYGDB gwYMGDBgwfU9R5ARu3Hn67fcyt9KtqDttM4OpzlJ6hkYip8nbwYk8+7xfV72/ptzjPtnr1mZpswx t9ghtdThaTpGzd8LUWDBqu0bNmNVQFalOHFC2qC3beiPMpYZcg3dO29hNEcdyEVKr5O7FTli4tKD 9Uc5LcYQaOlsFQLHiw2vF3DR+KGjsNhBsM3su4mvI49Wg5TN2W5EL1z78nCDsIqN9Q02N7gc+L4t Hfm63qo8GqjzXcTSjZWidDr6R2mLZo4PQV5stLsZi6LSTVQMnp80l0u/uxgYGGHn32wtIJe1fm8W M3gUmLtfcgoY7UkclJ/eVjxy15J80mJdo4drizm+/qLOlLXSXzpic96raVTPPBr4VdBLp6+tSHZM vx/fDlzVJwdzU8HGz33sMdJxnMQ9BpCw6+zuOcyjsSUjMRlC2sbTabK0ttQYElQ8B2wkm705nIco J3QKCAknA66cRw1KmORqVgWdrGORyztrZPNvhkhWrhRKLFxoGDWRZC+IFmy0ZUIY9kJwRiEh8lGD GD57Cog8ZZ7H0hDSVsfa/j+krpsMU0UZNg/ptTS/bZ9IhnoDaHVPLsMEHhtXvvatbcMtb0SSckpJ 2nLdK5Dhh2SS/mzo3teK98yG/ToxQbd2PIAi7wYnaMThWJ7SJ5OSe49x7g9xoAhqXyChqtoHPCiG SVBlUFmcsMqgyb7DKoMm+0isU0xTTFNMAkc4BnpzmkoJUsaS7oqN4GcvHD6vaCE0dibmcbANWoG/ jsNOOyFYciGEnEwM62SGxNqFahtSQ00sFhxSCmSqKmxKsRke3x037FqMGhwNxwN5c4H1Tjvres1b zOfJscC0ZTZNktJlKKMKDhMJhoNBoNBoNBwRnGTUta1qQRhLBetAjL3vr169eWTZEiGbm4FZcbnS b/UbzUhsJk1pN2bCG5lIwwqQp0DzGBlQ4ECkckkkkkkEkbfOqqsySunHTlQO1rWmTtSVve97vWtI nccre973etaAG5JW97iJxERKIiIlERETiIh4iIiKRENERERFYhYiMYxjGmeNDFZ6bJiSGaog2CWk IqGxhmTLLMKLKH12cHR0RJGRDCIQ3nA6nAC1jkaTLFrkZNShYxNZkNxsFxhVq1XB7WmI6TRUELOm itAOCCqe9K8GWtNvrEDhgNA8wYYYYZ21UmjOlG4x7wyHrOAYRnYmZUkk0hLBKxYoIq4Og2DZM+zJ MJhMI/MlfKBZERRKFFXY5ZxxUZODc7CKEjY08DSaOM3bdi8UQDVhgs3hMMDAZ0HJUnMJMpRBCSlz JcoogapV0yqIt5IvQu53YspExUVzgymEyaGwpgTIUyxzkzkBEMTOZyVVKR92h4Rw6Obs1cWqnNtf bpo3uk8Pwac5WZzUXKnGwvJiYwD4cqFkhzu+AkKZHSqQTMCgoKCh3mCyyMkRKwgsIKChBBKgyAs4 GQNrSctJuxnKcJ0Byhwojxm9wVW30xdsHz0JwReJSSo7C0IyHDAMhxveLmy4gROO5wKDExDCuDEV 5q3ysQ9USei6QdHrO3bmpbxWZtjmAkCEg3D5n2WZksosUiZGayCxlkOrnljtk2anoNxyOZc6Hacz mckk4PTXGuyk9lciT8pa50ZHaczmczmczmczme1xQY1mh3zucHJ2MnJZZSyMHnJ1G2xNflRW/krY mZHZ1j652TsOm+aN9NayraiMUOkQAmLGdKT52z5qsmez+5WWWoQjlOK5WMiKQsQwoA6qNUIVd2dR s2GnVVo6zgKYQL+d1yJsfa4TsjVwUs2OjsJNGViSzhTj0rkcQZtzRKJQzdLwlUuZctU0msaLkqMW RqdcukUEkzyY8506sTQ0gqbQwhdDmAiRSZ0rDANFNVRkVKmqMqYkopIUk6hWxolT1PPk6hsX5P1K jutq4pWN+XjcpwhyQVIQwhhDsCIHMp2DEKOCzksukVg5lUc8ROpiTC/4C1JRvPhYlkQypSilglEw EgnYSB3i9mOUMoXFeQ1E5VnSFWrkkKqaksnHlAzQIuzyYyQ/LpzdYR2GksMqVqZZEoJVpRDOIG1U wEDUSwgEpXhnCsmDPsOMldENmppGaIcDAxOk4tLsY5uh3O5AJHM0asoZQemYwGWgyrTBK4puIK8c nytkNB4WiksqmVayquZ081gYBlUSmzSKBmLMIWCZPJaEYLKXThLKnHJ25B9PmFeJ7Stxmx9WqZEr O2AuEVpJx6MwukEGZVHL+sh1QsvMfp77fKKYFf5AQUfoQLKICR/vrIlpzuNxkJExcbDekjA3m+gY nLBqjqcoQkXlZaG4oOn5CQvYt5zPOd9kVcde1cXr+HbUhBIJDuilCKcwC1UR4QOY8hh0nKdL0BxB zpl9faaK+Mbi60NiUCSSDCiWiziZFlQyjZYLRt4cOHBwbo1TOiMXLKKqsgq8LdSFJrRT556otHzf GJVbNRqNOezXcDotKWGNK7HLTdqcD4DgZnE2mpxNx+vwB+9OWVc5WZDifTOw4nE4nE4nE4m43LQ0 ZT4q6HfO+ZVK+JueY5DbR3yUHBZYOgdkXdRfICsk2ZoJZHzZrqKstqtQIVSpZEKjVaRQQE6ioIGI CcTwTV9w4pEiTiBY17g3BnZw4zaUMdCi0TbXgqlSLjuawdEfhhGSq54uYMFQ2BGrBsJ4T6hack+o qaPmILqKljPixgsGkATKogX6r1kuw4CaS0nSNuJ3yj4pMBpnBs5MRZLDF2wMK4cIgBdVddhsNnwK yi6IglUH6Oj6PE7sZHSKJAwsk2jhsBon062eeg5BFqeCeAz8lTpBQ7Hc7EFw5ARxAuw2EqZmfA6d +ydSh5JYNBIULtcprQaDM0jkci6d1oJg3v1rWA4Asnguw2DQUumjMxS3keBQqGAOVu6mg0Dj0tkc lI8jsOrs/saJkJ+qRoWUEtu+2EIUCLjGssVI5UfSupQNh58SRiOTG8vPKsi8T0lOmXZQRMu27p71 ELzwVehXfQ1QrtfWgvqe97EfG7m7+DxvifY+U8AgHedIkCCxiEI8aI+VRHnPAX8RtOAOsPGHWeS9 /NnZNWpDYtGAUQi0EohRaOuqI6I6TdDMQZMktwVMWkrXWa2ZrIYlBTFlo8mVi2LSozO63lSTrW8Z 8PhfIXDAe0MBoLhUcTgfDzNxuPWbzcbjcbjcbk8pRU2Yd45KjeqbzPZxBxDYtq0VHcENjtDI1uNA MzgmqYyy7NOrLg25YuUTZ0FENrEIwdOt5DD08hM10k36TVnnjlfBzNJwTVLRZsndyzJyYRXeOrd5 I5kb5r3dFFjZi8LwmKGLxYC1FMUmkdBkaioii9jg6nkpTg8Is3AcA6UWYkzhynUcmJSxQqurBAUr cj6/EOgKcHC76DHIkd88y2uXRtcw5h2iaVcbGiwkpFMGN4DAMk5UsnQ5UMFblLZzrQaBhJ28dv3O Z4jm/PBovwcVnjg4DgKWr3FQ4FNEsFBLzgICk0E7MMtFLZzSW20YjZRMZhi3r1jvmMhYWj+ZXIW+ RoKycmNJd3hc8Tcvc3nc9DsRu9j0I+ftbvjzeAHB0T1z3fB8E9+dSQ5kHtu8KKFSiU73ulNhXkOo 4A6w1oYTd2uGvQxdbBwq0WqFasJh51RomjqqA5IjPIchY408bEQrenWOMPFqpJRpCk5T1UUvR6yo rXkrUrXEUnOM2CgOGh6TBqYNTU+o1NTU9RuNTU1NS4TEsLy5GB9BgJnFRgK1VkFddLaWta1qd2LD GjNlDdKhZUqp7zf6fabEPcqHBuabjRuDcFqwjE4shFolIuy1Wq916NSMmVVUdSbc4CArQlL43oYo I1veMkpX5q9VWawGAkkhT+V6tGUnwMmbQc1XfkbI4xpuqrC8KhTRpzsjKgc7UbnI2mULGtLQtCCC XrDEPMoU0YvlMi1zqUhh9BoL/GcE4z1Hl4FEroqZO18hkKuJhKXKnr0lcDb7lshkJI9WM8C5JsoK /I8xXJPjLcq6DQWwV7nMlIU5CwuDfhyJ6WZUuhzWVzpjE9vf9d7SewVwuCtqjSE3hqHGbjqm86e1 06tra7F1MmHP7+jNTe2O13HrdjlNjhZxljWWnYuZeupC8y4+ZW+C9bJ1Qb1owASrSQ50K9BAjHjO 0U5zwHMHjDnF7Wt9UwoWcWiGFFnmBIYechh4k0gNIbHAsoUqGDw3COHW40qrjdva29c7D0OV429X QUEznNXmgOMZgLLGZc9swbjBqYMGDB6jUwYICArVAxvaI29hkJm1yrbvfc6b3vJrAx83TnQvzOLY nrmHMOacXtwiptt7EkegpwRgMBLip0Bk5icxPUbpo3UjRPnK6q+g0GcQpoXZ6EEwE8nW4XCXIjPB zHNkkU5k09IWz1F5RoNBSMdBeXGNFh421WasHecLgmuJJhXZSfCze68ypswa0NBiePMKc04cmV6H nHPOKU85fJ5q9rhsHjdloOb4YoOUuZmqpcLhhBCkEvdc5dDkj4TChVOriYx8M4OfVqYaeeq1dzDg Ztj1zsnVozbiugw7l4LG9XLguS5DcFnF0qzRV6FwVSth1qQIMwHYYnU6EIsdB2LxmsOMNouWEmka x0hSjpbNu97QGwhsWarPuLSCSabHLliCNy4HWZWWy2k9JGK1dazclUpTFrBYJhYJhAfEFRoYMGDB gwe4amDBgxpOPFu3mpKpWdc5zXOYY0mT2cOghMrwbqHAcT2TTFLyPjbAns9YxGSb3bncNA5WTExV FFRfckrSVes9QEBKVVODGE6mymarlIXAYCnrLiXMntx0PWbEjfVdphdhsGp7jHSp2MVKHttg3132 bgOAryKkvHl4nAfLVLa6qvPzYDQU1LoT8StpnI77SxfJYuGQlyNE88jfBgoHc7jl9YXx2Gwn3ODQ xR6nvc86ROm027uieZd0ZrtHI3LmKbFmTRwFXN4XIuasyPrfI6HuNjkPceFojucRR73odiwQisDM VlBoSyGtKgMAxEpPSdj19FLhPIFyuVimMChcUmlCsU74xNond4qlopE2edXlNpLDvRWHhZZt4eWA sFQqGwqGA9AYDQQGDBgwYPI1MGDExicUqWnPm57dm+3EyFboIeBO9uI44ji8+D0lXK2EUmJwmZl+ WVdl5ByCsVsJ91H6dd66EFOE6GOQcajgOA+rXRwUNlg83tQSpkkpnrwbDYUxadTubgjovskfVQPa lzYXM2DYT7D47qvVrefzDFjBhSsBgJv1EW5BpJlg4KTgICnMlku5xYTklTAS1ZSrYDAVuBx9DlyF L3WAgKS2YFHKg+FWoVCbwoGWJyOcLy1Zn1oFkeeY6+Ut8fLy2XRz9e23hW+nh5KZkhUp0ci1MYlp mWJaTFBYaTpG59rlBScjrWlOY5inzCbJ+9FOXh5uErhKplHSAldO4kAbMHQzHFK4OQGYM4lVommI kU1YNW1dddFA1Tg0lwhYVmVGL4hqmBrTd7NdqNhZNKitaoXCQUDYbC5oe6amIwYMGDBg9RqYN10V K7NhicsLoLhWhs21bW3vcbulJDQnUsPAvC8hbDoiPMuciW2LV3yDkFrEaLudDyKGQpu4XC1F0KHM 4M7PAqZB7XC4T9uASIGEKl6Fw5y1gMBTqPJyoYdfchyjhOsBgL5kS+Tr8KGwi+OIDIVcPA6BYqTI O4p04wGAp6SRbSZGF4KFwnkuFwnBs55KnUoXGU3ThcBgK18tYc9uw/EXmLQv3gHOp1NniaCCRI8h 21m0bmj4FV73RInNNB3uLg3tx0HnPOFxEn4ykJLCLhFwuMRgiBaJZZWElXyw9VlR8VxZ5Uk2KtWl bTvYhFO4VCAgJBMLhYICBoaGhoaGhoaHUwbtskwpOLib8+AsEyUtatrWtaVaGakupk2HFqhwHD0U gVFHZPgSLBy1q4XD2IFY8DmMFSCZcOiGpNgMB8gj16+I4nYkXRNKiax11bQaCL1zPzMM3BSKQ5LI iYoZkLAZCvkZSaCGj6Qk41rEjQiPU40GgyVgoeJIc8Z5e+ZGRE9cqZDIMghR+lh5RWUiBEnysEBP uY1GxEEmRnM5ZQSS8ZDITtHqG5nYka5GihyPScu/Ypl26DWk/sMjHQpUYmKEjJcUyPXgUVyhM0aI NDjFyPcgdZ2rqzYFLTjN5DEmuYCPi5DNi6A8wevvaycJVKh+G/Lv9Vjy0LOJrMyctfA8CENJ+wHU YhQQQeyAb3ineRYiyNjQINAgzO5MaVovBILIBehV6qwQcFHNtjXDfEzt4Wg8tvYBOeATvET0+z9w d3Y6xPbp1wZjy5ZoImby8HXS32N9VCdM1T+E9Pj1E9GPqlfVQdOkiPab6bY+DmyPFfdQygEt3mGi aUDQwcifPmiaGEderRGmZ2IMuvAJ5iU3kaph5N5lGy3ZUPsKDKiTXm0H43ec2hzv13niZ51z2aPp 1zviwpg1stIebzPV5WlX5Ghc6v7fR+PTK8tHGGQkOI6qvHK5+f+3yFtXWaytIBUJ2Si3iFqkWEby tYBRkO6H4ztmPva0BdiSGx9rbmYTmeXmlMRR0tmaMKHudGyinHSzstdWiIXB74q6FCyCWxfie079 +/D5QQbG20H8xALhb6hU2aMQH2RW6707en3M7Qz3vPSVYUUSnIUSDg1FPkGJTlD6Y+o7JnxJBFKP 62IMzfCo+mFgmxLmf918qpmKpY3PPeejOY0SU8HWRx49qxj3EaQG83AJXdItBVzDXf8gDrjWutjz bi5OPtXWQrGKiKqLEWJETmUqkpYiKgyQFYdyBLemcnL0QOHF/EbzqHSA5k8/1IRRA3QC5FxYGBc6 jlHU0xtmzPC0SdhcwxH8YOqKA04o/qk0mjC3IWw4OYqotwPwD45bYKrWjW2lLuPu+voQ9E9E2gfz SQ/jF8PnfmMf7LomWX/0PoKn3af4Ms4Oh/gJYtoaukqmAmQ/HYAfVop/npHU6EiH5w3SQmmhH+Tv /f3AYJ0RaRkJCKyQZCopg/4ajWv/j/vL1TmgtJEWo+9RUUn5KRvf2rHi+JUh1gdj8Z4zmk5Zfcmh 8ZoNarAa9kiIxK8lCXdnqoc0/qsFBOGH7sXMOklN9a9mGUkMiFCth2/TvjCDkIEU0B6Vh0LOtICR MCj6GzgXhLaOi+CBKE+8teJ/NV/sDFK7U7AyOYBBTCBWYszsWL2e9lsHlMaXbIOH9ZOOpJDwkn4d u2afTKWm199c3kkOLbHc7XfE2YEjY2ztIUS+0bSJo7Z6NbHfNxOB0mhwWVItJHJJ0W0Gg36p3qVF u+cvXwsNJq1Da200fWRfZ+rUkIHqQnlNSkFIlMGRnfynG2bABVCihRMQoqAQU6jLiqnX4pFSZJek 0/+LVnErBySCvmPeIBkitjYcU6DQxrUBLxBA6mBr5p4bEykLFzJtA0VThoDhO1xMgLoqdZoB3zQ1 I6S/OKnntmDwCpiEOFVheDCJHd+1zwYeBCAVdXyKkJI0LOscq13B/D+Vh525DAwzMhN0hjxCJo6a 4AdjKjT+6BzYV/73dYiZAsToXLQkHJIMwJIOJmFmJVgAWgsgtSSzlkQRlX98NMK8LA1GwU9AaBD1 gQ5VVcCAQo9Ws0BXfTxVT54d0eRVXH3LWiSO9vhUbPCmyjtH2GHnzeX6q2u4kIFCinej4GUDneOI LtMbG9y21THApwkBWrWUFSMDzoa8TEhA8dAP1wcXDSLSX+FPq39txRKoi3I58mSRXw/kSZbJIHVD UPhgmRYS4l9hV0sHxB68EOYgkICIREFFFWIgqgIDMeMDyGoFRPP5WqC+936aBFV2YbUDShp2AcJr As+H4K6wwLlYG3U7Fxye2AdvPRuDEmzSJx2aMuyQA69IPYjuVMzjxxCrg0PtExzGMiPTKsqizlMZ FZywkZ2Ici2OAVJLJmSpqkz2JLHSSB4izWGgGxxckVzo0KAcYFVoVYBDm3dR1bvVPKGITtghTkdY a7ItiJVOVq7CEIQIQjsdh51I3FIpQlJFDk5eGSQ2GwiwX6RU2SBYOQUuayBZMEvz6grX2RQ+E7Jl eJhWRE6FCcvSxmF62DVzfzjIIs36wwIYqoK42WGSd0snpRI6iORKKKIKQVRjA6Jggdwkh0lIGUkm K9axRD3+a00d2nC96o+FP8lBMr6o3ZhPJAMMPQM4rbg5aoZ4uxpjoS2MjDsvBLYOAqULgabcAqcT qSwmncE6B1reeJME18Sf+/TbYti8RxfUwFlfvJjHyksO+z3UKrNrPgwdGD5Ew99hxJN7vig16ehZ w0gzB7FAGAgvMIFeUtsVSQtoK20egOwXWwbOowcp37bp1wCHbxnIWTFNwF6ohYsNAMbVEWvJG8pM iQxQJvA4h3tAQNrFK3IVfUG6rauT2BPzn6Ib6UkRSKC+1X01UEse9c/aH0mL8z96L7dW/4GB4ex8 3yke7AT2KHIB8OZwgPiHmmVKodOX0WQ1PjkEIP01cWQ/RntK9TUouVtZXbrWoNesxcL3RrxaRogu 02b23vrqpTUY54aen8QT2R/cE/ZP5AlJB5w7gPijX4PdVJhYP+EokEi4DZgXG2VqJSK+LENkGRJu ybFgmdZg/IRhjgmJ+hq4bg8A3zGQjCSlk205EsppdEIuNCi7UTWWuNVyJS5rJo1FjF04WIwrU8VR W5AipA0r6Dfm5lpnkorZ9/QyrfsVG5JbPSoVOMoGklClGREynGpVlUkxGxAokGRKGijVWoL/cmdn +4+qXiQqU11q1ou6NxBqg2o6unajbu1hLzpMEIcDuPZsk5M8k1JxccKBnkqMWMREdS7mIPF5w59w UkllBz1ZG5XFNeYbKBMhqET8E1C3wk22ib4FkjEBJEEQlghnJu6dDk11EpyAkoKxaRZApcC4Ewqo xmLFqNRVsK110nFOUmnIZgTYcONAokHYNkH6WiYuhzGI4huGGMNFkzE/mE+FnQqpNAawSQ4HOvTs GMiHVyN2Qwqeg0hRjEg6008RuMrgQyD3BlGXI0ZGjE4weGfW/4TJMmVIwYmJ/aVh6dRZ8fy/2luR skDUkTR+JaE3Mj8Dwu4uLk7n4XFmy9yZPxOxYu3eZhm8buLbFNfCZOjNo+s8zNm6vGj4FSPnPJ4Q MO1udj8OkdXValrR6VPzW7OZKlB3UNg4rSGzV49rzvVNKo9qaZeNeEQe9w3y5LiscrNQObBiQv2/ 3M2xw+j6f1TSmZNOGJWeTaRibjkEjLkKg1GeIhMCVagbF6BFGwBauKySUPjogWQRIjACjxzwbjwp xwH/DDrZcSe4oIi+QajtMfuZ0ZEi7K0WR0uM7bgcCBvYiHH15HOnZ/AqMiDiqSSkoh31IOhAwJZ5 gnlnu7uvxy9o/FagqYBSiHObsEkQg70x+2x8IHzEcDHqgPFleXoRzCdTqEfZFQ9KIJmcgHJwbG5H NpAitGIHbFiezej5s1Tani2p4tJmulJ+OnHac+xmPvUbltncEmwMoMInYNgopShudGSGcGmoORUM jCOmZYS6cJYLYNzA5IUvTtaX1oMCxPOIJoQ9dE1SiMm6ZIn3p8k+T0qRVyJCwAkB2hC0gWoCHofg wkLItydZBB+/79R3YaulW6o+ufo7J/afFh/bU5I0G093qjZZYvYT+YYmDswXwqLCYccgVFpQWnst KCo5AdSFTnvOgj3r4eukLSs1X9eoTaishZzqlRNmyDLEpHL5gUC00hORYrddKFmLy7ivoNhzmxzc evM53xnH/xebzuTcIwkCJIBFiLCbWFtgTxxJiQMB2ZwV8ghQ/ZfncB8/dz+x/H+XZpl5bQW0t4+M vH+X1zxnJIbxEN9qjJ9pirUngElYChajzX7mDJE9wZwHjfO1RvGSDIgTw+E9B8Oj/cK/jgAMiJpe 2IYEAkCMXCn0HxotXu4J421/MxoA4vtJlA7zwMBzyldYZzvOR3lRMeB0qkqMfEuKCcYtGLSBQTFo 56CotObQNG1ZSkkZWIFx4DjnYKPBwGBzhdHWXMyy7zqeshJDaUT9FKMIQBm1iqzmUXQgRlMTMSO3 twka6AMp4+pPx4jjjjMwOjSWmyGksUmGYqbItQKJ1KotFVNUMO8opoxELTaA6XJDCNQn7Hz9cCee u4XtVh8FY13SNJTymUT8so3RAs4onAh8mzo2B5zcPAS8iSQOMTvsBIlnvf6H83HdjIw/5U0kTrgQ S0+3F6obJg0J8pYVEENYAnIY6mIUkH5iIe/5PjU18oeg+p5+k/Q7exhIyBIjIqYjC6YZ6p+vhPie ITsDXU8icW2bvj6mMaGmCv1r4wvKhC0qCZIwhaEVIFyGCkDLH4ExAld0sCWEQhQSq2IsOCARGqCp mqAGtvHz7+WptRIMXA7m8JXOLMNPsSQxlhxOTBMHvneOVlREvD/qMctkq8mpztPN5u8n9p6jEvPy FFGU/JqdW5S7Du3zOclS6tritJkod8icHYpySPPTx8e+RPQ3KY7mrxZtzX4636U4SEyqkZQgYlQo BKCwUZEUnIJym7rY6O0B9l+XFolSOkbE2Opg8KbmTq6Oj6Cd/lra/lKCk0lD6WAXQgNTHuYp4qk2 6paTT3Pp22UkBJKHXAr/1cD+omftCJO0zt3rRicMAdUpZxgXU+ZeBgZTENi8F9C9IJKqpdQhag1R 0plNpL4bFb8laeldSfoVVagvIWlYTr1jqcuEi4gbTocUDwT09L9XWiuJ0dd2OmlAvRaSSB1143oP QdD0Yv0m3E0lQq61ErWkkeXx3t2fM5C5eVQT5ocYzKLu9ss0Iv6QS8kGUcEis01RlSki3hrL7RUu CMF2S3y7deJBT2CYHN+jEEff1npAVJFLqGtZ3WqNKVLUfjS0ZctNI0pEgyVYi6AisTC8n4uyOThG dHplYg7KFNJBDRqgAwGLHOhm0OI61Au3GmfnNOXMgXk0kE5c9Q66Se1heSk4nLmc0pKo1ZpgKC5J 0KxztbUqoUL9EqDbOl+leWSuCiTbC8jaPd94vagzvSye5UmZYZLMZLbHGQcV1cmylLGWZuDBQ5Ur iGZKC4iZN8oaDnn4NwZQyaqEld4eIKMGGOLOoaSCGcOn8KBZJzWpKliy0gWL1InajK6oT0Op6NbX GDeUbxYNR2DlKYJFx0kCgbtNZSQqGoIjmANDbfs1ZdcZ+TPrzjw40U+maUJBoNwx4GxzYY6VOaD5 LaULWMTlpHOblUVTDUGokoD07Yj0Gx2NLL1vclmiMQ7mmiTGlgTpgTtlRxTuAcSDnBxK+ICgGOyk dESw42qNjMIIPT0FpLlLYMWwLgpFKEK3JVGOKZIWTQcRnOpVGHJ2qGT7RiggOVNNmzH2RCn9Kblg qzcZCfZOcSReEyF9vEdeAsyLtqj9GZ0BeN2uk7ISz7wj1nYSy2T8FF4KI+liudyad97ExRneCgxS wxtd4GkLtOXsTHmxcILYduG25ZHtZJqemgyoo7DPBnUCiVohyAnAFUIsyoyLOmQsVQ65ez2biGBk h32Kz/bmVHZ0jlU7NDYZksjSN5MWkkKcnBUmBQKlhMgO1yN70IcbyuY9I4aXofO8+C8rO9ZtIi/h mxbt9TmZJGO9gQdgvQzCYTM3zpx2AU1cHoxjJGCAqrDCiSHEE7YTs9Pu/ny+H1UfC4vgxqPiBItS JCCQggWjSCNPbmQ8yE/o2DoQPwTUgVjodbvbwU6Us0pg3BXpXM9umR4tphIk4zE+Ls/3oe8hD9ms AiQRcg7gcEDVFCQWIMQruaAJVRqfU+1Ats28WJ7ClivpL+edcCoeWNgjzc0HHn1bw9g8WdAkNZSD s8JJWQW9i4oqAqqBiq7h5uzNdNQ0uuBtjUMHAAYQpgEbnFghTioNEx0oZGIW/lG4cSGliroTfUP6 0QoKEiz5eG5yEyUxUycLXTjBncvqVormDknDHw7s33e3lMpq8NSTC2p6bzlO6wroSKUeVc+OUspS dMCkRQ9CvJWzLOpwAymosTiF0qLLG0rBAWDBZbJSLCMjIMgiEYBbKnm5KJrIDYAxNxCDOz0FawP4 pwtrYJALBk56xKanc3xR7oSIcrpUEKDmEBdye8IQjxnQz37dgmT8h9oSgfPv7Dotj4DXER+csnYo ftiqRIowQgIhg+DY8HGEP62oBPeLWzFA6zK1kq4c4CMakkasyozZUoN9vP+fEja4x9ygfXcpILdG TqfM+yuiM10KVe5ZpRnJUqoyFBSRl772NTabUk1YkkySkUqmRPugRdENA1pIRCRYAljQYmjzFTkP iYCXmrQ4ZLrqifansYmTwnfc2u5d5nRSzKfO2M2XzvtuDqznwJxHlRRlqu5uDVZweL3vk7Hc9iVy dq7T5pza66uinbpPLDR0ROTRtbXxzYKYB4CivE+DcNzc6a+UmwRii6WCH82QfNCdgnR6+kFnfwFn 9VMPAnjL/JAm7XxWLRikJbMyh0cIlvGg5WQaoPhYrPU/fSS1LfdOdheOYEGuuhV7NdbHbhUOt6nu KI8fGqXPbPnofOlA4vNjhUzdMPXl8e6llX7Ee6z71Gcobkhw09pip4uxD3O5zxPDwUqwISEkD1OD 4j1dZ8XzulDoD1vh5gHzEUtBKVhuA32XoWIkMMuJkZTnyKZBOqHRdYunvXEsXoF3+/3lRYrGBiJx +3we6l26QQgLEegOB7Cin3fm8db87oGNeVMh1eJlisE9lCRSqdpRSuLlPNC40eRX6lXtWdWoJ/v8 Q8vZeMTl/1lyxVVHqpnSQHb0CkegnM/OjPM+F2PYPa958kR8kfIUpCspJwkaQC0KxrSsrYA6CwFV GtIDevtFGIF4VfKygLSqlJB1q1ehSBBWqnVLu4IWP6f+w6PVpG8xV/+f31LWbwqdhudK6hALXqrr oh6Q8hvuh5Iwh95goiKsirFIiRSCxQITsTty0jxMmkK9f35fLIlKDYjKQ63HTg/rq+Iv0oXAtgZw Yh8ri8LU+D2nAOvRuo8LXUOSzlPZZ9zcDvQ1McQjV1vMWfUAr8pdGGtrC2TqvPjTnNdk2tC1mTyY n1psRlqVvWixgNVKxaKfqB8zf18YfKL7RN0EAy1Gn7tYJKefq/Xgfs93KixUINKSMG0u6GM96nX4 2B72GZhI/fpx48xhv+eIYVMWjb+Lnsh2Ibt8hOOFo0+zabXsallyPzHLQ5TF5BwRXifxCaepIg/m iAtY/zwF647PInq1YukoJqVCD27Q+4p7syXqRVRNGUiW9jrmmZ38Xsa62eBNaMP0VJuJK0NloeWU 304WWUi0FvXtfIj9N6ObMy8kxu7cpr0rX4odRNuMIfHhPE2sJxgZEzY2mw/etkanZeekoKsnuMF7 CW0lDwgyp1wuaHiZHGYZKJZRFgjP4MYwBoQpSDYg/nI6o+JntSiG2o5Y7NFuY3u9ipIEjEGEijz5 r5IXeYg+5w3fM9vmJo1AGljEIBHCNOXmKb+30m484aEXeEoHhS4/KFQiGCeEm+Q6xHmZ3GZ+JuhJ 5guCYJRqixQWdJwTJl9rYyb+kfSIuqS6OfKUls/VSsiaFUw5dW6Mqpc4rKnVh617CwC3YsQIINXu W4/id+wPlm6IkgoUglB64UQJO1unzr6eT/QsykeHmX2uql6ClbJ5l55jyq9ZCdb1PQn/s1HNev63 RtY9re2BvhH7poFC7R/TbxzLDSe1eZdy1cYGx50e2PTTIH9LRw7PemKZJHpfF6sHCCl+Q7EaqlYM OiHeTQU4mVXEvS31ZmBFhghmflcwPsHw4NiYgxPi27JNGMVBZF+Nvd3aZmRN9hUYAsAWGpTfGYhE GQdAsgdudh+PgfC1ft4jEF4egzPtw1e1+gUY4vzvOivS2c75myeaYnwj6rLIUn1qNEKthQ3YuFjC liPfdMLH4pcL65ATWhjSa4kWTWeKRz9d1j5GIGbojyOJmQ05sAjUaDE34hQpjZIcxDsfjj4w8Woy DPQ/3n5rg+Ozo2qiCrqamhwm3THld7y5n/aJKhvD20brztEebjhEhuTjnnLzR0gRmWcyG7NgPLYU RUESLERiikQY62Ugw1IAUhO1BwEEGKlXQKG8t6x0thU/rApRSkRT0PcJ4IGVZQCEEkAkVND0xyjo ACuQluVdzx+LHcR1bTkNmsA0rjHSlh2H9E4CVJAhD81BPdzW3nDqcAqDbg0oxIB+DHpvShPzwbxT oIBYnU79SmgfknxwxAwIUZvkhc6gmvPqZHma/P6HR1MxTcEcFqaQDqGxTtNLftRIvVxnVNvnNT0/ XxO8qbYZzPEo8mpTG9C8VOYMWYzRxfO0ZAUF43YJ5RKoZKSMWkRoKhEVj6nuFHY7HRrbYjWBkGnP Vawh7v9XRVXByolf40nWQq9XpqmcLClC0DP0QiYirD9eASeOgO72tCNgQD1wdqA3gMeOYXHwg9aJ b7ewZDzBU4SUB7TxliEYcCB1ebWHO+y0Xc+RwzYhszA+NMHn2lFnWYbzlUnzNX2vMeESLOB4yiDc h/E0N2+UT+iSvRalhkYxjxHdsENoRACEE1YIdEDFMqA0A2azwCONGcz3Gb+PxuhDpyByVDbBuaRO LZKm92PlianxbbJtgtR9M20SVQVgj2hkgm4RwUpBNRSOxGjwWAqxVYxrsJE65boxWnTx9JMhm+2D 8+gaEAnTDndlF/MPYGIsVO5McNIs2ob7XzNB6UDO5BoJ9O965RGIJNBiwFIGPppoFIClm4oaFBCS qqogJGokFQBQDL9MDToQ0jcIggi3geUCFKDc99RGuRSgUQmM7XLGqLgUBWgbERIGJDf81wrk0gcZ CdreaHJE0NwlEvFXECJIYJucnsMYAxmgaGKSwASzAqyNiNJWEk79szIWaaS4DAIkO8VWkQKq8FI6 hOK5YRIJCBEIwgRcYhDAaVJRUDjpYq5jWJBYBHVEKOYo+V8bXMftbvJreEStEPRGvR9psC3x8+1+ dHzvE/E50eBobgOuFogZagYPra/F7miDkZoUX2i2MZ2GiQ7aSUZIGNKYgkGTNpkjLAGOhjBgstkW WyGFZUwDAiRA0KkC0kHYSwsRkANk64UYdVBD8L4mdpROzj5PKZT1uwMHwJPmTM0gtpWnvob9LrBy m5m7NnmZclkyncnMHc3AHU+S/q8Mr7xo1gBaDCL8Yv1mdHydBQDEmcRyIDGSglpWQIunUfQKPQ5N +t7vGjp0mlCbciS3zvjPr44D3GgO+ZGTgqBtQNbo+AoqkC0pQVpL5CA0/mGQd1U4I2Oe7sH428Bx GqusOGJYVD1so1ub95ITwYB/VBAhCRnyHteoDNg5GNB2id1KEIMGrE5Yq4KTw0AoaTTic0wE1XLC bSKdOCZIa4JIOCLhHMIwYH7NfFvlPwPiCaxtn+IcEKE8KRDpOZ+y/Zv6vd1Qkqb3hc3YLnejw1qn 3WDOL+NhGPJG0JFvhtDlpuRWE+gQCAuGyWetdso37nu49PJ15a+ylrRrc7iT2+AzgIlvY719jgp3 ZBjvB6YD5WKQIIgQkBYEIMIJBiOMKMVa6RvEkZHiqj3QOeAZ/eR6YoSD/S4I880LOR0ZnDh7OLx+ h/sZ6ATSGiG5OCeXwCdo0d6sjGEEIjHNnYFSCw0BSKUPH4EeKjpqToalf87/20NnmAZEZ7MSQk6S dm+bHyHCFEINgnwJ3zIFzc3Bzk/ugnHJ+dwrigd1wQL/NsfxCjwmrIRzIFKJtIc56HzAVGSFsArF H7T2RR9TQWnpaSoPy6q0qsV+r9vpwZ9Oc6bNkX327zaYFtf2unsz9Oy6UQUOWzw9aQDHv5gRkGo1 qXJCyDT9va8iYiPM9gvMweeD9gROj1iUXv4OqjwK57QnvR1g4+9/rQ+Z/K8DcwHOfIIdWK8cjM3l LDkh378pjQQ7XX8uMI7LNbRNYY+ZWsAxHyUUEDlA4QqBiYvQrESjxY72R95EO2mmvBsczpP60iHs 2gP5nJ0BH54fhOZNlPti4YDM8mhqWdYHWr1Z9a2qC+hffwGYPWmRBzQp1eh2OJihS5Z+Z73xH5Hy PpRDWRVNLsfPrRj45yTsB2+bvHx5jiFndjFEEYKQfC2JFgDCD/0I+4i1Yp+rzee1KUCMfmn2P01t i/6zA5Og8vkJ2skOkkTxACREEBCyCxYgqKIokfC1SJFgzFpFC0lQUmUwBiiCspIhCpQfFwlmYSTk adfN0NQ65rfc6vG7S6XgOmEkmwIQYiGhINhcbFRskIn631uIgFoCwS6iahgIsYnVxJxBPk4T4Gx7 3HRnEyItxCp2A4rAYsgTvSzRMIKrHGKxwI1GkmxohC86fPTyb/v+ac3h9Kx3W2pDqHqpLhwLr8l8 J19QsRD0syZdrc3cK4P/NiwY/x/c5blDUs7bAywRGtpTeynn2SjjLoRj60pYYSD9iTbPA3eX6LCO Y9xA1AyRIxEIMSE4PGO2onxcXm8qK6ji0ZgV/YRKabB4hyZFueFo3dRhU9cQrtRj8GGpAtgfOjXV pQ6wdY9TmM9snLfd8QSnW9H4qHqd4iApCKiEFQfYRGQGk2HCmk/byNd4vE/yxA5ArYeIglYuaxGL egcwWRKQqQEpBaRRKMQUJGQSQRpK/Q3A9TsxH8rqOUxcw8IIYf7qJHHooeyHrcFhXXr92sTEOLYs FuDsXzPa0DusC9IMHaVsBB7g2iEow3VjJSFocwdMCQdpyU4BnN3U3QjFNHW2ObA1jIWqwdJYkVWl iN4DYsUKCCVxk63dBKgdZHI/a79ZICOtZPJh2BTuSkD9326xXbzge5VW2Ox3W8oTK9QeidB0Ei9d c6XahgZtkaddoCrbwUhyRoYHW+VBrhJhW9iBIJcSzoIixGBWZE07YG4fsQPdhw66Pd2bHArmFhpc gksLVA0kotJqjjYDJSsp1FJJWrjgkkQh0BGv4N1z9r0J76nKra41EkmcLurBJOA4eqi0nC0nTchy zFcSR1RL3Z0wqyB1FFhPOJiDwFQ+70gKUlQ9Vk/9F2QQu6pUGpNxIeNMViGCbYssXiofdCBVxg+M sWVkLh4AHCPhR+uPouAv6PZPX7mGEELmb0P8IrihJUumJ1LILRimMmDyPSLftOESANrKEe2ajigD sQeVsWc8lvZ2uvHZXA+GCUycAX0HQv+zSYMkRkSMhFWffOtn6ov9MKwfCQ9j508hyeUE8kXB1ODQ DieKOHeWbEqfi62q9eCedMRrKqB9DhmIcAQrKoe04K5zlh36ViDAzijTxB1qS5lwnnvA0bWrawbD Xkz+Fp4DTmRiwsnAXWRDg2C9BjIkr+em738gGxmWMkQ2Om+WGh5JIeR8Fttttttttttttttttttt tu0nDYLzwnnCLGUSMhpt0XYkMZZckMbLsDkgcjqBPBIeGyE9eJ7vzZnie05to9w2RlwnvOJm7MBj BjZsJiaIIwEZowQcKLGLA0Zo6QVIZmgMlCRIkJZDmsUyNPKQOuvs0KEWUPvuK7IZwmDuCJdiwmMK g5aeUd9TE0xMgTGh9ZgbWoB9iFdWTkPC+IjoIekxOEwYQ18bPmmUG8+LcoWIM59VjJJeEhl13whY sWPEwJa8dlTIQLWcI0L5HPGQMlAaC0UE1CoZTmtLFUQgkEI2AsOWsZNRbAygfDmZwU1s376aJNyQ 2YJxtMCiGzhOWWGcNI/g7cwObCB3UQSmi1zTm85dSrUI3G8xtMg7A1bRxEKRNdaZ8pwmKYpsA7T0 gKSGU6QLEgjBYgbIYQlSCbEgFyiwKRDRN5Z52GHiTogytIUEAyjigwaSdQsPUkqpgoHBAsI8AsDI 6LN/NIsBvkxqabHO+VVhViqXbiIo2U46UbCRRjIShQCN2qdUD928UQ+k9jqfi0eB/S01cXBh+bjO ymwZkJqjCuDq47JI7yB++SiJ1y5Tfm4hEapQcAXvtXNBsVc6KFWJVUcZIRYOIwqpVCiI1LNsDKjc c1BomAaAxAiocgb9UPLDknqLBT8I+WHojtzX7y5e9CTRQ9LgU+Xa7USrxruO3dRQvKOHvamHf4lE 9xwAy4ZEUAqLB8/Fm6AyN5uvEJbRZShAIjuU60ym1RGC1X8ymms158raw1NDyiag0Nkt97uMQi44 oZ5LKQEoK5GOj0KCnFmaDDocaHwdR4BuJXwF/mhCcKVbzK3nCCWOMpeCDNux16jVugECQJIkWsee oLVB/WhRRoGYp1eA1Vj66IvNKwVOjlMiVXG9KOpDmoL1M6+9CopvWagREQYZUugKs7Gg7hSnYG20 1VEN3ewyaKIuELDfbFwOslWKVCqc01uIJerspqAT8AII4jCEEkCZYHYSGEihU6WSdfoZ1OUEObgz YYSrGlyBSlNu/1HKIxBony7swXeP89Hj3us3kfQ13H53b6n+LMTyJpVyhUWAaK0g8bSkYUpTwamj ZtQHbA01AaCVijwXDr9jiYTRYQwgHUeZDg9DwY+QE1Gti7OgR7sA5mD2tzXxLP6O5/LpehHhe9x5 W+g+u4X6HiNYJR/ShFx7NgotOQ+Xk0Z05y/cQJmUGB2GiBqRAMQLcEIrXXlEAUBZAgpDrJBO5PLL DGRIWEGC/4EFUgkUfreQigHH3UUPwOMpdOk8eLwOYezeP/KIft5ChOWiUEmG/peN8u6STgWqezIZ DM+6nAAY+VVH98kHcOs6Dh/dmZoZ60/khIySAbRULvp+X0vy7LsfqKFH3lMkSET2J7n102nW6TBK vDgIc4v7eSukDNiaAgeZX1+tqeGHg097tMmMSMkdBRtZsRlX8j6XVKcJjOhf2HBfD33AuwYDwTA5 8D4wOSqkrBGlHyY44JmKIOetp4uMI9xSvUvgqzFhNV+DQCdR4dy72xreVxxTWEv9bxfe6djkYOJk 2bFLaAWfM2UyMKtaFvKPyszMxMyfnC+47ftwVyrHxXac1rX1GjOiQJCQIRoI0iDx6DyPK4PgOaek cwOU6EIzF8zVQ75fXHgOaydkSSQPyMS8UdDqcXaRRxEhZ1ImDiticXBrKnKQzskCXuO1fmfT2vUw x5nW7DvZ2Ooe7sA5pTOjA/IFaJUCxq6dLi8LsdJRh1jTc4IaDQRZANQaoilBwThsXOBH9Dly3dii sDqWasVCNJ2QWC3hMMDNTERoEXfxnIHI+YJjyOxqZExtUbBmS5gbZXoZY5hxHROTK66Qdmd2NWiD kc82eDtmsR3JjbMkwgUZttclgMW68nZnTN4dg5GMJDKH8HvR2KVGhFKUAslRaX1jWQbCWWgjynXo el7N1HRl0vC88ep5Os2InkOqcpxOK4jEuSaUJ20SypSoUqRGtF3vn7XiHY4ulybueN6V8LudbwPs bgBugqcUBeZzNw9DZ3kTg5XkTeHgHE6WOjxPQ8r1vOxOF/T0ivmU+oP4/5vQqXgS0H/P+8/n6yf+ 24acoBVk//YF3W8UmJxcWkmQ0oCoDP3C7kinChIBfVneQA== --===============4968967694643388010==--