From: Tor Didriksen Date: October 18 2010 4:41pm Subject: bzr commit into mysql-next-mr-bugfixing branch (tor.didriksen:3226) WL#1393 List-Archive: http://lists.mysql.com/commits/121008 Message-Id: <20101018164129.E9EC837B0@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============2035782464538620751==" --===============2035782464538620751== MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Content-Disposition: inline #At file:///export/home/didrik/repo/next-mr-opt-team-wl1393-merge/ based on revid:tor.didriksen@stripped 3226 Tor Didriksen 2010-10-18 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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +0000 @@ -381,11 +381,11 @@ static uint tot_no_parts= 0; static uint tot_no_loops= 0; static uint expected_part= 0; static uint expected_num= 0; -static bool max_ind= 0; -static bool fix_used= 0; +static my_bool max_ind= 0; +static my_bool fix_used= 0; static ulonglong start_time= 0; -static bool is_divisible_by(uint num, uint divisor) +static my_bool is_divisible_by(uint num, uint divisor) { uint quotient= num / divisor; if (quotient * divisor == num) @@ -492,7 +492,7 @@ static int test_compare(void *null_arg, return 0; } -bool check_num(uint num_part) +my_bool check_num(uint num_part) { uint part= num_part >> 22; uint num= num_part & 0x3FFFFF; @@ -543,7 +543,7 @@ void perform_insert(QUEUE *queue) } } -bool perform_ins_del(QUEUE *queue, bool max_ind) +my_bool perform_ins_del(QUEUE *queue, my_bool max_ind) { uint i= 0, no_loops= tot_no_loops, j= tot_no_parts; do @@ -571,10 +571,10 @@ bool perform_ins_del(QUEUE *queue, bool return FALSE; } -bool do_test(uint no_parts, uint l_max_ind, bool l_fix_used) +my_bool do_test(uint no_parts, uint l_max_ind, my_bool l_fix_used) { QUEUE queue; - bool result; + my_bool result; max_ind= l_max_ind; fix_used= l_fix_used; init_queue(&queue, no_parts, 0, max_ind, test_compare, NULL); === modified file 'sql/CMakeLists.txt' --- a/sql/CMakeLists.txt 2010-09-28 15:30:47 +0000 +++ b/sql/CMakeLists.txt 2010-10-18 16:41:23 +0000 @@ -40,6 +40,7 @@ ENDIF() SET (SQL_SOURCE ../sql-common/client.c derror.cc des_key_file.cc discover.cc ../libmysql/errmsg.c field.cc field_conv.cc + bounded_queue.cc filesort.cc gstream.cc sha2.cc handler.cc hash_filo.h sql_plugin_services.h hostname.cc init.cc item.cc item_buff.cc item_cmpfunc.cc @@ -105,7 +106,8 @@ ADD_DEPENDENCIES(master GenError) SET (SLAVE_SOURCE rpl_slave.cc rpl_reporting.cc rpl_mi.cc rpl_rli.cc) ADD_LIBRARY(slave ${SLAVE_SOURCE}) ADD_DEPENDENCIES(slave GenError) -ADD_LIBRARY(sqlgunitlib mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) +ADD_LIBRARY(sqlgunitlib + bounded_queue.cc mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) ADD_DEPENDENCIES(sqlgunitlib GenError) === modified file 'sql/Makefile.am' --- a/sql/Makefile.am 2010-08-20 09:15:16 +0000 +++ b/sql/Makefile.am 2010-10-18 16:41:23 +0000 @@ -159,6 +159,7 @@ mysqld_SOURCES = sql_lex.cc sql_handler. log.cc init.cc derror.cc sql_acl.cc \ unireg.cc des_key_file.cc \ discover.cc sql_time.cc opt_range.cc opt_sum.cc \ + bounded_queue.cc \ records.cc filesort.cc handler.cc \ ha_partition.cc \ debug_sync.cc \ === added file 'sql/bounded_queue.cc' --- a/sql/bounded_queue.cc 1970-01-01 00:00:00 +0000 +++ b/sql/bounded_queue.cc 2010-10-18 16:41:23 +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-18 16:41:23 +0000 @@ -0,0 +1,175 @@ +/* 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 "queues.h" + +class Sort_param; + +/** + Function for making sort-key from input data. + @param param Sort parameters. + @param to Where to put the key. + @param pos The input data. + */ +typedef void (*keymaker_function)(Sort_param *param, uchar *to, uchar *pos); + +/** + 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); + } + + /** + 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. + @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, + queue_compare 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, + queue_compare 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; + // 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, + compare, &m_compare_length); +} + + +template +void Bounded_queue::push(Element_type *element) +{ + DBUG_ASSERT(is_initialized()); + if (queue_is_full((&m_queue))) + { + uchar **pq_top= (uchar **) queue_top(&m_queue); + (*m_keymaker)(m_sort_param, *pq_top, (uchar*) element); + queue_replaced(&m_queue); + } else { + (*m_keymaker)(m_sort_param, + (uchar*) m_sort_keys[m_queue.elements], + (uchar*) element); + queue_insert(&m_queue, (uchar*)&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-18 16:41:23 +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, + (queue_compare) (get_ptr_compare(compare_length)), + 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-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +0000 @@ -243,7 +243,7 @@ bool mysql_delete(THD *thd, TABLE_LIST * if (!(sortorder= make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records = filesort(thd, table, sortorder, length, select, HA_POS_ERROR, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { delete select; === modified file 'sql/sql_select.cc' --- a/sql/sql_select.cc 2010-09-30 14:53:11 +0000 +++ b/sql/sql_select.cc 2010-10-18 16:41:23 +0000 @@ -2569,6 +2569,7 @@ JOIN::optimize() if (!group_list && ! exec_tmp_table1->distinct && order && simple_order) { + DBUG_PRINT("info",("Sorting for order")); thd_proc_info(thd, "Sorting for order"); if (create_sort_index(thd, this, order, HA_POS_ERROR, HA_POS_ERROR, TRUE)) @@ -2746,6 +2747,8 @@ JOIN::exec() int tmp_error; DBUG_ENTER("JOIN::exec"); + const bool has_group_by= this->group; + thd_proc_info(thd, "executing"); error= 0; if (procedure) @@ -3031,11 +3034,12 @@ JOIN::exec() } if (curr_join->group_list) { - thd_proc_info(thd, "Creating sort index"); if (curr_join->join_tab == join_tab && save_join_tab()) { DBUG_VOID_RETURN; } + DBUG_PRINT("info",("Sorting for index")); + thd_proc_info(thd, "Creating sort index"); if (create_sort_index(thd, curr_join, curr_join->group_list, HA_POS_ERROR, HA_POS_ERROR, FALSE) || make_group_fields(this, curr_join)) @@ -3261,12 +3265,21 @@ JOIN::exec() the query. XXX: it's never shown in EXPLAIN! OPTION_FOUND_ROWS supersedes LIMIT and is taken into account. */ - if (create_sort_index(thd, curr_join, - curr_join->group_list ? - curr_join->group_list : curr_join->order, - curr_join->select_limit, - (select_options & OPTION_FOUND_ROWS ? - HA_POS_ERROR : unit->select_limit_cnt), + DBUG_PRINT("info",("Sorting for order by/group by")); + ORDER *order_arg= + curr_join->group_list ? curr_join->group_list : curr_join->order; + const ha_rows filesort_limit_arg= + (has_group_by || curr_join->tables > 1) + ? curr_join->select_limit : unit->select_limit_cnt; + const ha_rows select_limit_arg= + select_options & OPTION_FOUND_ROWS + ? HA_POS_ERROR : unit->select_limit_cnt; + + if (create_sort_index(thd, + curr_join, + order_arg, + filesort_limit_arg, + select_limit_arg, curr_join->group_list ? FALSE : TRUE)) DBUG_VOID_RETURN; sortorder= curr_join->sortorder; @@ -3299,6 +3312,15 @@ JOIN::exec() Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF); error= do_select(curr_join, curr_fields_list, NULL, procedure); thd->limit_found_rows= curr_join->send_records; + if (curr_join->order && + curr_join->sortorder && + curr_join->select_options & OPTION_FOUND_ROWS) + { + /* Use info provided by filesort. */ + DBUG_ASSERT(curr_join->tables > curr_join->const_tables); + JOIN_TAB *tab= curr_join->join_tab + curr_join->const_tables; + thd->limit_found_rows= tab->records; + } /* Accumulate the counts from all join iterations of all join parts. */ thd->examined_row_count+= curr_join->examined_rows; @@ -18277,8 +18299,26 @@ end_send(JOIN *join, JOIN_TAB *join_tab error=join->result->send_data(*join->fields); if (error) DBUG_RETURN(NESTED_LOOP_ERROR); /* purecov: inspected */ - if (++join->send_records >= join->unit->select_limit_cnt && - join->do_send_rows) + + ++join->send_records; + if (join->send_records >= join->unit->select_limit_cnt && + !join->do_send_rows) + { + /* + If filesort is used for sorting, stop after select_limit_cnt+1 + records are read. Because of optimization in some cases it can + provide only select_limit_cnt+1 records. + */ + if (join->order && + join->sortorder && + join->select_options & OPTION_FOUND_ROWS) + { + DBUG_PRINT("info", ("filesort NESTED_LOOP_QUERY_LIMIT")); + DBUG_RETURN(NESTED_LOOP_QUERY_LIMIT); + } + } + if (join->send_records >= join->unit->select_limit_cnt && + join->do_send_rows) { if (join->select_options & OPTION_FOUND_ROWS) { @@ -19890,7 +19930,7 @@ use_filesort: SYNOPSIS create_sort_index() thd Thread handler - tab Table to sort (in join structure) + join The join order How table should be sorted filesort_limit Max number of rows that needs to be sorted select_limit Max number of rows in final output @@ -19992,9 +20032,11 @@ create_sort_index(THD *thd, JOIN *join, if (table->s->tmp_table) table->file->info(HA_STATUS_VARIABLE); // Get record count - table->sort.found_records=filesort(thd, table,join->sortorder, length, - select, filesort_limit, 0, - &examined_rows); + table->sort.found_records= filesort(thd, table,join->sortorder, length, + select, filesort_limit, 0, + &examined_rows, + join->tables != 1 ? 0 : + join->select_options & OPTION_FOUND_ROWS); tab->records= table->sort.found_records; // For SQL_CALC_ROWS if (select) { @@ -20341,7 +20383,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER pos= sort= sortorder; if (!pos) - return 0; + DBUG_RETURN(0); for (;order;order=order->next,pos++) { @@ -20358,6 +20400,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER else pos->item= *order->item; pos->reverse=! order->asc; + DBUG_ASSERT(pos->field != NULL || pos->item != NULL); } *length=count; DBUG_RETURN(sort); === modified file 'sql/sql_sort.h' --- a/sql/sql_sort.h 2010-07-02 18:15:21 +0000 +++ b/sql/sql_sort.h 2010-10-18 16:41:23 +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-18 16:41:23 +0000 @@ -7092,7 +7092,7 @@ copy_data_between_tables(TABLE *from,TAB !(sortorder= make_unireg_sortorder(order, &length, NULL)) || (from->sort.found_records= filesort(thd, from, sortorder, length, (SQL_SELECT *) 0, HA_POS_ERROR, - 1, &examined_rows)) == + 1, &examined_rows, 0)) == HA_POS_ERROR) goto err; } === modified file 'sql/sql_update.cc' --- a/sql/sql_update.cc 2010-08-16 06:58:42 +0000 +++ b/sql/sql_update.cc 2010-10-18 16:41:23 +0000 @@ -424,7 +424,7 @@ int mysql_update(THD *thd, if (!(sortorder=make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records= filesort(thd, table, sortorder, length, select, limit, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { goto err; === modified file 'sql/uniques.cc' --- a/sql/uniques.cc 2010-07-08 21:42:23 +0000 +++ b/sql/uniques.cc 2010-10-18 16:41:23 +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-18 16:41:23 +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-18 16:41:23 +0000 @@ -0,0 +1,429 @@ +/* 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 that all the (uchar*) + casting involved when using QUEUE is 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. + */ +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(void *cmp_arg, uchar *a, uchar *b) +{ + size_t first_arg= *(size_t*) cmp_arg; + EXPECT_EQ(first_arg, sizeof(int)); + + Test_key **a_ptr= (Test_key**) a; + Test_key **b_ptr= (Test_key**) b; + + int a_num= (*a_ptr)->key; + int b_num= (*b_ptr)->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, uchar *to, uchar *from) +{ + Test_element *element= (Test_element*) from; + int key_val= element->val; + + Test_key *key= (Test_key*) to; + 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, + (queue_compare) (get_ptr_compare(m_key_size)), + 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, + (queue_compare) (get_ptr_compare(m_key_size)), + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + EXPECT_EQ(1, m_queue.init(UINT_MAX - 1, 0, TRUE, + (queue_compare) (get_ptr_compare(m_key_size)), + 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(void *cmp_arg, uchar *a, uchar *b) +{ + size_t first_arg= *(size_t*) cmp_arg; + EXPECT_EQ(first_arg, sizeof(int)); + + int a_num= (**(int**)a); + int b_num= (**(int**)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, uchar *to, uchar *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 --===============2035782464538620751== 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\ # 0oojzq6jd2mpqbbn # target_branch: file:///export/home/didrik/repo/next-mr-opt-team-\ # wl1393-merge/ # testament_sha1: e145eba767bccf180f798d6f30029d9419827ef3 # timestamp: 2010-10-18 18:41:29 +0200 # base_revision_id: tor.didriksen@stripped\ # cao5fiah7dfi3vev # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWV6v480AR7v/gH//eu97//// /////r////9gY14Hz777nvPn0lfe7hstQHPNIXJDxj2Z249Stp9V6D3toe53NpotGrXdu19m+zd8 CD1PuHzoPi9r4MJ3XwPg6+e+6l2b7bPvdNL2PXt2+75B5dzduorq66KqA5xnRdhG+LvvsGs89wF9 73gHutQV43rgK2wDuL6b5rzvcPts77B1bbZZr1pKVPoa8nqu2+tS5eMs12y4pnJ326dsvrutfcL3 yV9XHiu9x71fXc3vsPXvlO4pSQ6HdjZzg1LLbKo0NNsc53r3tqJUb2K6rR3MdDUqSddHvQH16vHn bba+blVTqPa3pe12KdANCuW6zhJEIEyaYQBMEJpiaGpmiFPRp6DSk9ip6jeijQH6mk9Iemp6h6jT QShAaAiJkITTRpomJNPUekaMRoaGgAA0AAGgAAYmhCCRomINKegRo0mEPTUHpAAaGjTQDQAAAABJ pRCaECU9PU2o0ampsNUe1NoZEzVMRtTaQAehPUNDQyaaAAYESRCaAgCYEaaADQIGphGhT009JimR 5MJMJjU09QNNNMCpJAaICAQTIxUn5k1NT1T2lPU3kU2p6gyBvVNB6QG9UaYaIDTQbtOlQ9Kemlds AGEVf+kBVa/hvUYYqxWIMIkYiSIRgpGCkYKhFAG8P/BkSk9iuCsSMWECMEjEjEkgg4QWwN4lXBYC +0FoF9woUKHvFChQ+AhQh8ghQh8rT8zTm056BXMEIwYwSMIkGMVSm4EoowLF5JYSioS8ktJFFIly xcsXLFyxcsZpJoQqUlSkqUggMAm8yA7uLm73e73e73e6EhqSG+QrS1ExUajUajUaiQSKBI1K1p6c zDiouNRpnZ2giRRHi7Ozs7TajOzs7MiQRHi7OMOMOsus0WarLrLrIsLsF1l1l1l1l1l1mqy6y6yh QususususvJaS60ua0ua0ua0ua0uzdu3E1GvJJBSMkOghDbYYU/+/R0970akySpFHFlF/JtfKmXi z5T/lCyIc4zljVREdO3Qzumhi2McIWsaIhTBL/8y+j9TfH6YmAgZReu2MzYaffBK9j/JgX00XNfh uboN8mlGBueYxptfQxXAGMJOrYu7fnN/hJ+cfBZhDUfouHBG3nHuVZgS79fh/bK6Tj1qLsY6wBST t9VTZoZXtYnZI6P90oVTl3V/PPbhqP6cP+/9Ojjwycv58Mv9LP5RH6sg+fjhDITeE0dHCBuZ469b f6eHPD8qZuVDwdmGm2O7s/oaAEKCoDniD3qKGpgn+T4tIMfzwKeQztt/v2q7CPdAUAQhSDFt81HS ekiUPjyXlUPk8mXgRBHxuxS6ONb/6/2SN1MmocpwZA5lYTNV+wxq4Qn07OFi6qPHhCYOhz6n0VLy yoDA5gK3zLRpbKrHamBb8cQspuvzu2bQMdGqRmpaW57kn7autfbe9ZdWssNrVcmjjsTOYTKYR18d rMgga4Dp4t6wPvi4sXf8LK/QLyVEEEFMu9f4sq6K2NdFhoeTIM6xfjYdT8uv3Pk4Q8kPU/QewciA OTA7EKTKSE+WYwjLpS+7ESLjrmroC2M4Wm06hEUL+pne+Ne8tt4I+/6RHCoBDjxT+Dmlwmwxt8j6 Kco6TGwgQZQCQhDW3pgTXtt1v5ydatwIjo+u89RccGISg+CNMzvLU3AOyBeyyOmNEBxvrT3RHy97 i7r9Py7jTRq9H1AaZAe+cmzRFo9VdzoZmjwDWCQYky1S0wj3el8c+Yz0pGhgJm29/CA7K2WHSMwM gZpl7xoQIOAagLIdiGp1NzIxaTFMVxXF2OeDkyGJs4ADkEJCQBToFYBWCuCpmZ20LSRQBTpoAsBp Q0oZubi4uKYpiuK4ubjhHA0bAbEkRIZEQArAVgLQCmZnWAckYYGoAAYAkgaIGjo2bNkWRZNk2dGx Jk27UqVataUzM6sDBOHqAANACSBRA0dG7NkWRZNk2dGxJk27WxFRSwsLZTMztjqeUDo4yYCvjA2E I8LhYWFlcLhSZAmBtI0jpaWlaysrSgCGNSNI6zGdRiY1UaqNVGqhATIQYnUaQ041MaqM1GqjVRqo QmEWFA040hqYeLOSZyTOSZyTRcavawrKwyiqyohmGMpCZdq4Gvlmks4Ll4ynElI/IPNudWaKML67 QsVai/90QqTmgVCdzIKQQdDmZpKQ7FUOzOXScuzGBanZtRM8HP58aGLS2mggnmKAT2ISNKRnHql4 Uq0krEPr1b+boPROBXsCBn6IIxk5mshPTZDmkMIb1KAvUyVAUAWQ73pUJMM8Foq78mhJ1fluc8sY MEwkNGDIQB+n5iBR469GEB0XYoSqmGOhGyqCo806xi5yozZwp8I1p5m0g8Zd4vNPGcR2ajQxnOy2 2jas1qczile1qryEcjWdWtsLZbXluxtdzYW2rDvC6j3pFU8OSuV8ZHPs5+ttiMx6Od+kmsZgNxHT I4+rTpPTzjGjTbwAfXfY67IWb8g9kEEVNrd+VSJ4PCBEBRs257T3es7i2OGPaEGhBRzICKvbQgHp inqiIWgCGB/p/ob/2YbopqmycHtdmEnBigm1sVk9Jhp/3wwasNUwmzJ2sCW0nHFJYzDhmJ3qZQ9C BIbyOUaSCY/RYS8kEMYGCB7dVizGMiESQD4ETm/e3siSAnDBM4WZGAxh0zvMS8ALyqKg+NpaGMYq sCG/H4R2xS8F2QCmKFoIBz6OGcW935ofj1Vo1lbEyGBhmZWbRPD/Lg6sPIo3kBcLoQ4GIxGOmXvn uFmmTsxS3zMbw5YV1z+2yTUPprYUEv44kYobWwZGMPOOGi90TorzWqMU0sA1RgDaEKXY8FPbdRkl TK5cO+PFip4d6TVWTOr08TCqucOnF5V+Erf9/XDtRiIAJBIE0ntROacK1TkcD1BJoiMl9mPZs5Pt PUbvdjGNHCVuJcfWCFzD1n96K1DB2S9grMofgM1iFff/yoeXxogT+sQjA7ig+6YyMQ/vZBqOfkUI hhgoMLn2cObQiyNPgJUZCAHRym8Xmo9iP4vljPtyHS2X46zfQFNTgy9kbkBezMHyQJuEOIQSQWKK KSKLFixYCkUFFVGRZBSRSCkPe5E4eI8UXdu0tYxIgSxEcP9BR+j4fT8eno58ciYn05XB5smFX2EL v/IeYO2++c+LYuzUNBWRFjblsGi4yGYwhhJkVeqpyzH5ap4NUEujvS60rNU7KK7F7vKMVHoMWpRs SrgKJK0aTs16hO83LrRngQZpYnAGeErSK0aqyULrznW7ohW9L5jnE8ThSqWwmz7HYNn3Kx1HvHYd vMStwenVj61RPWH1tj0KotgQlqCkIUi1WhPrRqRipHjQk6KN8HlJ87ApZFeAiJnWKUTQPOp981ap FZ6XGKGkUhG8Cy+Ktp9lykqWENlSnOlG21AbBA6WULwDnGB4ed46LlHCxwoiMWWF1QjBs+acFKx2 191Zbql1GWlK7jWdIQdmV+IGU1pS40gk1OILWypSpVKE1bjAV5jbUJoqDH6ejQtD474Qx4rpr+he kYKqbDbNUDs03qsWwY6FqFqKQG+darFTAuLsnZSEh9T4EQ5T7jetSXvJQR0+Sun+X58iSES5qzNN Y9lXoPKU0oJp3iT5j5t20kH1h3kAxxtmTMLUWsA9dukaAEybKNeNFWqnSQ7uSbFI5FEk4kUknjlt hU4wqko/mgYlsyaD6PUZuKhRmEkXiepZWYgoRMwjHwJ65nFR0Lse49ybUFSk7qiqiyiUp+ugDMOd Jvp/+PqRvQRXwLFotXQ8+53J5iaCwZ9fMx0OrQtJlx8APpCLn0bPDz2TkA2QByBhBiw25jC70uGZ fSqzqaobNbdRGR/UfaXdiYkvPTudBkPq4e4swqFvEjoBHxCy6zzCDR9YfyK61os3uaqxS5nc+mty lveVQh1SV0YwNwbg7g6IBEmymUril5L0kmRkTDPW6W53Xbc9BUOhsaYJP598FDeGYMBiKMF1CAyq rkMVzM2bodPr7Thq2p85AfnqoibC7G4WBXUY9NN+n8ibPw/q85rZLQ7zl9RbhwB2a5HbIp+asvmM mEsxOCvBqsN7A+TtuVK/4hhvUH1ipRVS8mYOOXJk1fIWE520zZxiAwyjkk3dCxtPQXkKs/rmjexy q3uOFrKHcINnzAQ81lAPp1rw3Xhn7pktDal6Hr+RMVrnIao5N4zEst9aiTX1b59BTxU9UJ37Pbky BODVejh1+2/wf7/fkO87zjhuZYtC6DQaNY4Qk5s0/1yxZYu+lTxgqn1R62NpoJ/Rz5ZLaOhM9w9F bbNJC7GHVolzbjN8mY68sLqDOvv9RdPNe2yM5sGlKZ1WfjdKOpqUZxICn1hwR8phiwGBGKSWGBSj GkWIeRwh6MaU4wT88yVASGkOR/Jk8vZnq+pQILkPQ226eAPSkQKDD2PstGe4TWAQIxr5+HWi24/Y byt0oyTvmkXxvVVhpLiiIHi9DlHfAsdwzwJxjjrXviGEkGY1LLQm+f7Ywi1pkiqCotO2eHKw2MhU Mgon+1bPl6c/HymKCoLx9d5DZZfsZUbGcnnTszU6MJiE0nafx0TTsfagjWO4fbBUPeLhNuoF4BiT EDUG5sLn2QOuvl38cGcwY2uMtfYYYXvD0gQaX0e2+8otEt9S8ABffVEpxBJRiNx5RHXgnYUWNZHH Ul8V97PVXK35Uz95Q7ykszI+vq7yWHfhc+uU5oSl9gP0xif1gVb1L9dLk6K9maCGgsYydhr4rPqG xK8cK2emJAhbmaqRDVn90tcCsVh7+OpmXiWYb2luqar6lWHUTwlDC6MGHIEasSs/h5D913XwTCpX r8y8eBoXWg9zE/vICfHsM91ym8fVg8uwwy9kjTsl/wdvP9LditVUFrWsJpNq+qO/NnTT5KHMcyzF Z0hMXbIGkgdDVEPU9U4SiUOO6DkZGRUm2bgUcH7ZkNDOu99ix9fnv+QZAF/P2COSmE9ZwL8h09Ct 9DUzthn0ZM+aRwiwxPDQdfU23XiVxdWwmhAaetc0CrOybv7PNbRW17axq/dHbCNublmImf6OjU1S Dz9SdZqI3PnyEYY17mJXTOo3vlcqaAnqIXG0kQYwuvDL+AS967GlZ+YIy91hX4YmPb8/VJ5LPeNz 3QgQLSbIo6jTCld4xjnjwEKZXdtJmry1WGBBr9t9Zzm0x48L+neai61A+2iv63tFK3UjxY7yZgZf aDIlEseaBQwqRxitSO1ezsgzey9kjDC56wJ38bB9yfYPYqWPE181bykpi3EML0zHpOqwx4JZjVaK lEuvwGmPjn6e/Nr5ePHKuP/mIj6z95Eo6IpgRjy8Ky05TJ8ertBnq4Slsau7Imq2sXaNR6iNJhTp vomixnoNfMQKT6UKNBLMRm1fIbFA9WJJ4ptAx6sQvVbWjYRWI9N5E0uITfqlodnKwVzt16HfK9rF as+v2z9nVJ+kDzAj5QPADOcBhgRRjnpIjYEsk+aXVhEveaqZ2D6t/D6rHF54UL8ZezGKzHtuOvSC 12tvbszr312cYdj5lr3aYvi8VNw9U8M68ZEFkKhVQiKG1LyRmeE0VPC/rKsuiUxTZ6Xi1utpKuRf q2C+sUTcXESJ0FZjkKPEDN5LqLZ8/B9gzHfk0pp+VDqGWsjGDQjHjFoYXkO3PBudhZaPgpd+uSUZ jqXPwj3BDHPr12+waHVRNTv5m5F8OmGJXg17bYucZEJCRHZlR/H3H7oJP/tccYg/JI+49n3n3t+L PDn5R+2Emm/Gcn/raVD8zRw/GeU/CvriROp7d3x8ezNfVtOLjoYZjSwxB3b8e5h5gKYHMR3IO7ZX l2kA1a6fR5iPSsiX6u+rH7HgPHbXrnk9vu+H5/lz9W+12h2AggggggggIIJRRRRRRzOJzO86HpOp 3GZoUaGhoaGhoZGhoWNDQ0NDQxNDQ0MDQ0NDQwNDQ0NDE0NDQ0NDQ0NDQ0NCxoaGhoaGRoaFGhoa GhoaGZoNDQ0NDQ0NDQ46n5vv8fmk+W1p8vl/L9R91FUVRSiUoUhFCKCgIhBQEQigKAIhBQIiEiIC gKAiBFBQUCIgoQRAihBQFAFCKA8vFoYJ4/vsw4hYysFGMUspBFBslFGBBQRiyEcRT5wGq0ixKSP6 5VgIhAIB7h1HpLAOCWD79P2qRBBknFiY6Pmzn89AoHxNT6aWIZ70O98Tzp7a+n7i5hRoUwidp81A bmejz0EElp8Hd8NXXqokwJs9e7Meqe+aGSZezVXDWGf3LUI6jZD22qxhVWIBNvhdj8WdD7NlkkZx AaqhNlgISMh7y/EOxn/T8m5+3HuPPZ5z9hRiUFFB4FFFiwUURRQUURRQUURRQUUSiiigooiigooi igooiigoomv9VGmrP0NuGzTxrHrUP4/oiHRQLQahlTiN5oJzPaXUf86+cCpgzDCZgdDVjKduRd+q Gs6hwYQrAqFzjRMPJgkG6WWM1ZvPbowR3IT2k3omRMCf42DG37eUuFh2Q6D7qplShl5paYK3Y6nY PvbRTR/jK+a9k3p8FDzm6XTbvmpMfpnjJYW9rXfGgnpyTdnXHd15smup6uUHGyJm/wduUIf3Tzep yUuthUNlGOa7bKfhNyi8HJjN53sj0voGhXL7OMZrAlBmm0Bgfg5Gj7vRXSUZbqI9PTRH7GyVBP+m Pu0Ywx2/WxgMqZmecazZlgI+f4OQr3WZodLnyw3aYnQ/VH93zk9i9jbQqKQaW0x3oVdPL8PCxCMd TPwL9L6uA8L5x4gNAg9BIQ+W2OeBQ7YAlon7npboNnq0oCUpDz7/x54+IcjHGk88wOz4YuYV6Y9B xv8VzJnu17lxbIZ3EfgxHukDsmNUcgqHKns+tlOCQQT/VUTyAARywZomhq2DT8wtYvI97DSpCg+n jKQnSpLtzacnWaUTN1qSMlywJCGe6z5c5+4Oc2pHGg0GPmUOPX8P0/kmj1Q2XXNoLLn4o7GZdteE +3LgTEgx4S922W9EvXctB92zdzia8z3j0aAjbztwyKChKRJ9JQISkSJBCa4yfJk9cmDQopcJe+kp sBuZM8ddhD/BhD3HzsWckAMMWT2vf8vfOvt1OrspbQEZCoGUqHjpn7CZNqWSCrFIIsiQMoCWknPo pqwPJ3nTgfBoSbd4s/QYsSEF0HwTKJL8/EfUxyjj3Y+T6Xtfui/hxrPGrkcLA+7mtWR5nPSZCHqb AsL7Q7R8U/WXRJH43AwhPfB6N/D33f0z8/Hd1AJAqZNzOl4sT4VvfK8SVzgQ1KL2j5t/kkITX4O/ 4ijoViL716Sgj17ZJybizYQknfPW8StTQ+rjzhnOO3YnnER7KURqSpS0hSKlBKDazcoaEQPUuz3b zHpNycceWMVsPCWeebcY7d9UUWmdXSohMQyFLTxUOiiE5Nwya6GySn75XZOM5yiZj9DVkxKR0KR2 Fuj+q1D2reRM8UILkNmC+1QZJ2DfootNNejM+ZZwmBgYNwdAd4+8+8+8+4+80LlyxcuXLly5czLl y5gXLly5cuZFy5cuYly5cuXMS5cuXLmRcuXLmBcuXLly5mXLlyxcuXLly5c0Llyi5cuXLly5c1Li 5cuXLly5cuXPh7D0gRvuePln82FeTEQOCwXSZG+UPuIsYSQ+rosWX158Yo+X/Xwar1V7X6j35N3D HHK/1CG51tsSdI3cHqbCwYNl3DduxsKBqccg76PQ2efowv2miEfCHT2c+6DLlFUWuyy+TxZKckXJ qh+9HOS/EEGnU3CwFzsx3nfeHxDZ+KGrvm4g3GcLMGqGqj4sTTMPcgRhX3FEmomSVxIZSUgPRRPh 91Uy9dO7VT3sHcakbq0nQ7Okdxkxxec72jU7WYvDtSS5gDJ9nxt1K9HddiylSSjr4QHI+DaplC7X 7jkY77kdqFfxKB5IazJ+PiBXo26uNwqp9PrqrvO5n8JZJSt02UqmeeDZYVZybj19amHZMvx/hDl2 Kk3u5qeDjZ+vrRPAdB1kPKaQsPS18LnJVdUlIzEZQtVGVRoMalNFSkii84K6PbZ2G0IdYFAgJJxO +nI5bBjoStYFndjHQOWeotk8e/DNC1nGkpYuVBi2kWQyAs2WmYglvijqhGKJ9VESMSd1JUIE2FPx ntBNJWx9X+L8xXTUxTRRhrH8tqaX7TPzCGe0OoD2r6XQWQD3y/iqW571M+SSXioS9w8qIeQbv3JT DyZ04XwivbNA4Vnig38OPGAi74MTwDE4FidxE8XHPYdx7A9hpAhrXxihrvpHPGkDBGAYYBTMoGGA YOdAwwDBzshhkb1I3qRvQqpehrvfa27BGDJkym2CW1F7zYn+vQAOMGQNkQMJUXTDTso2wvtoNWTD DKGWSZZIaJF2Q2ZFkMoG1tVHJIKYKoqZJViMD5OGu/HNNi5yMTicDU4n0nLhXBZs4GM/Lk4lowmU ylpIJNRhQgEgkGQyGQyGQyGx8XwZjnOcyAioUSBTgoqqrnnnnOTJBCIGijo2IoHQvqnnNzEDQIsI O1LIycFSFO0eswdCZsMJuG222222G3ERxMzOG3POuOZB0s5zBOk3Ota1qs5yidOHOta1qs5yANNu da1rUnd3i7u7xd3d5O7vB3d3ebu7O7u7vR3V3d31rWZ1kDSnNHRIINAA0QAQiAjcGEUasMos8BAk HIYofLJyWdENuCGWQyIF2No1yxgo46RccgMSNExIiQCIikEgkEgFqyuNmzESnaYaANxoMce11FZS +UhBobB0Cyyyy24MUYe8GMj3DAm6wC/sDQEFmTZFjrsLJ6MRsORQ+1J2Ox2L0J3IGCSgZre328jS DMHvF0TkUhQ6CXN5DuOg2sUQBSIwLTJhclVDE4ZqxtSdFQxmkRjsuyqDmbYG6JWpK7hpjwgZQ1QS CSliUGhIoWKYEyFMsc5M5ARDEzMyKiQ/fQO6O50dy7i1dpsp2H52rsZu55v9/e8ngpymnds4mBgb x8ecUdDst8/FdO+6AZAkCQJAkDvsFlkZIiVhBYQUJASBDARQSbOmYMqdtDtmnbQXmwNAXiEa1WWK a9E8ZD+7QnFGESklRzLRLRzsLRz5ct9nJYQI1+I2KDERCywCUCt8LekGkQTaoiZVjE3yO87MtISt B5PCBkFUQVQwB/6fYIhAYUWKRMDFZBYwwHi64a8eXZJw1cT0GhmdhqdhqdTqdEk4vVXKudJ+OuhJ 7VtDtYHYdTqdTqdTqdTqenkgvtNTwlu9xdHNg6LLKWRc8SeQzsTX7UVw6VkmJHPyj7DnOZ28Jq4U 2rCs4RektIwGThVo41xzj4dO7j1/wdevYCJ2ZDQo7XXExIhLAOuiyESzCmhrqs07icGopMPMd6wP IZHx2O6N3FSzJ3OZJdjYks7ad3Q7zOaZL1hFialVLEwUkTzqFlpJFQmEqa3VJg6qjMKMIsXdIIZQ VMoWQqhyAiVnKwcAydqu5lI4LHCXEQRiiURUZ1O07e28/T7RRfC+SmYzV6nZ5b8o4IuDpG8VLxtG MdpIdWfadp2TG/rnXwFMnDWMdhuMdzE/YPKuO+fRsXeSOpbrwLc4BQ3VhEBZeg11DqGzHB4lB+iI JWiZiXhAVIGDyh82jH6AjhQVFqWRMsUoJSSiGAgbTRAQNmmrBKWg6hYtMOp5HUWF1G52kFRbqVyc JAHNhhYsyZUKxXq9ADMqTRdgGAQKcJgMDBZ4KIkJspTlILcPRhabT02CmV6ksivWSTp5VhcGxRKb NIoKnArvtJSEyhOtSLleYlauVLK6+GaF4fP1CsXEQTZ5iv5lzJr6OZF04Ew/HbkOA1WkeYqNDuNe hDuMxlvKpmRTnIaOqg8w2QaHWCGIaYTwQZv4NnncHF4MXyMXyLs2bxeqSM3aukccpEY6oldCEjIb iY5e1cCc7z0UxVfhvcYYQyKeypFlSPUJMJETtHa9rPwet4zyOhxpo+nqPANxdiG1KCSSDCkKSjaF goqGEaWC0cuPHjxcW8bJjRLNmtKqqVaCqyupVSCyU+aWJk2hd34oxio0mVYxtcAPYWlLDjppbm6X 24nI9xqYnMzNjkbn7nEH786YV2SsSHI+c5nI5HI5HI5HI3N1oaYT6q7TwnhMKlfU3a9x0GlHhLUT sNWQGwyGj2HFAMlF6rBE6s/XdbbymQEEsjqhs8uLCGCWmcwhTBLJZv9CyZsZoMGfHh1DkLTSvYmM WTbIK/EEIColG5IIkNsIyUXG8GzNmcxbjocjL3OTHCfCpwe1qvSpq9XFoMAgFeq9MrkNBcRBJpLC c2l0Iidsk1liEgPjhM7HJI90C7o4xhsjCwDlEALquYriHAcBEpB5HkLoUj2ykJHjg5IJaaWGFkm0 gGwHlijc5DYVpGfVPEaPGGTliZ49TsOXDgCj99hsITw5ahs6dvBOpU8ksGwiKGG3dVXYbDEUro2O nZZiWNZ99aOGgKp3W5oNBCxS6dqJnxKDFpDEygXDlQ5qmQyHYhTIxCB3PAZMdvpaJrNkjUsAS3b7 IQhOIymkqMipKCBUfWvBdB0GQ3GBtKTcOZCg61Quj0Gn30mYak3ePwVJaehVGhSXa2QtsfU74o+t 43sR7XfcXm/a+97X2PgOUQDxnWJAgsYhCPKiPlUR6DzGHabxvh2B4g7Dy4YefO6akNq7GAUhFoSk KWnZZGCJBJQQw7mDBHTlC9YtOzTWrNFC45O8XZoLFil6WlSDRgsYzjR3x4vcKg4fCFgwDhQMjgfH obm58Dgbm5ubm5uapEp6JQVLJSKciSZDkprqHUHUkYswnIKbTgKmU2wDllytFiicXxXW6qxRKqhr 0jIG0VAVLMJfKdinz8AJUREvVLkH4y4chRM7EsJBBi6cVYk6UjhZadPWycXuZdM6qTVnXadDoaZu aVCa2CiqLR08zJMaR8S44E1phmqohaFoQU7SEkMS6HBI0oP0e450uzVuGApa/NYQQGOE1Y8jwfRT PhoNB1pxtKT93cpwdBMRqWycSWwZBknOtlVex0mGDZTBh870GgYSVPFuh3G4Fz6IFTAr5Iw6cb2G wnXAwqUXyFMlQncohQm4OE2omSvYWiI7FDZNJMV6qLRsBXuNiOW6rR3xMxYN2qfKhdExkImYkZCQ XkjmpEYXDl51LarUKpcFtQu3ipLnSrkFl7qhTqtdK5Gw611LWCQYEHqeQUUKlEpyfMkdGHk9bqeY 4wC13Xx75zGxRPJQOGYJZAbLJZ4mTJMnUyBlEY3G4oY2i9CUJ0E62UykGhFBOgq51e0NYDdqtpUX nNYTysXd8XkDAEgMD3AcgbFzY2Pg2NjY9hubGxsbGxkmqunBcyFwjtUCUlZBaLlaxznOcysOwD3c kRQMAwKMts5eL1jMA7khzNdzh1h1hnCMU4d4Ud+yWixi+LTTYjNZWku3ho0W4NQagbD1guKcyEj7 SKEMcrOarK4XCnyV2SznJs6cHwJfjS7GFONdjQchYSDr2mQQogQPqInpjg4Ci4wGAggT+kJchQ+V JPLq3Jta13GI0MhkLOaJX5Gh2T4UpowY1kMg01Esnei+B6tHAtcDSnS4XDCQqxsggvJ5krm93uFw nYj2IQFOqmG5u51G0nS5pnTGJ4eHmfUT0CuFwVtUaQnEKIVOBzj5eIkTJMnP79DuTHPlOhlIDHmm TxPQeVze1HzvX53T3PwhT6zxPLvALqVKOh3kIEY9Z2CnQdJzBzB4RexthrmNF2+TZDGmnWDZZ4bL OzekBpDI2FFCVIs7RDITztCuKrbV8Z2pOZxOlbYWJF3u61IGyFoBAaAkDB6jY2LmxcuXLnsNi5cu XM4L60iNbIXCRlbq2ZvmU85zozdGT5OnMy3Jrb41yHITTb0y+/QKRBd7QgekrsvkMhG9DqDJ0E5E 94cY1TJqpbJLpEvDQaC93lqAopsho9SCYCmWW4XCPB34MFbpo5SSdAfHUV8hkJbjkyk+B+vXJL8P WNU8ukGoHAT4JpkYTjqV6Ia+ZHx0XIZC0rGk1EmoN3Ho5rzWoXB5xGJWYYYXsayUsZqqpcLh5oIT yR+GkFO6ZZHUFU8jk5zk+M4tXY0WZtHg0bnYybvhPCeli8zRlPpXpWF6rW9clyOC0Czqu6r1rSql Z09SnBBgBxJzetSEWOo8C9JtDvBvC4aJJqG0dQVTqqnCsNaQGghoUZnHtWUElC2bG7thxCpDM5lr KW7CyjBXeDVneASCASCISD3wcKhYHBwcHBw9gWBwcHByqa0NfAWCVCkp4ximMPMgZTB7MbighQH2 SSgbDcolbjNEcT1zclGY27BYIFIskhRUX4EjWKrG9QqEJqawoot7pwKQyUxVccqvOQyFJCII/rLi YNHrz7xsLb9q4mtl0GgakuZivI+Am5x0wtV7ZDIV0VI9+1DQfHRK55XjvcMhmkeSXYlR5nB10jls FaLcMBLgwSx7TWzBkv0cKEi+sL38HDYTgb0Tap7eWVInbmZ79qdryYMyzR0bs08Ga7FruzMDBxLm rQR7nyOl8R1Cjrdg9ptaR3nxvS8z1iNx2Nmjvk6PKTU7DuSZ2u+W2/yXsaZlYXCvO9xQsKSR4973 u1ZNSaUvKqq0ZWk0mWLPDCrWvbRw1+Ty3LmhocjQ3PQbnEuXLhwcHD0hYHBwdHdH0IyQTnk5pWeM x0GgeiCHYld8vbb7t6jg2riMwipixXjCwJ21wHAWewn2kn069L9ReEqZLbDcZT2Gw+is7mShginw IJMwQUx0z20Ggu8exqfgi+zJE+hA+BHNhmWzNg0FPBIZOi08/mKGC22K2sFwpGYnvDOMdTpM2xza bGxl3OklKZJ2TFqcuXWmttjY09JomdHJFiynaM1sFgpoJbCBUMyVaBQJUkVFkYjGvp0GBanfWgVr 4SOPGbfHzctVsdHVts3ZH1cOumSQqU6K1npGgVmnjIzmdMOTlI72FxwXnhOUHI6loWUiXGQn6xWE 9aYoz9amyKZVqCoCJUsCajds5Or5ZOw9g9p7Em3y5ZMWMrcret999chbQArPwaWlGUMJjbSxnbeR LjaNaeGM1tVqMdDExMjIyMzQ8xcvFy5cuXLh7QsDheiaNBeFr5CwUmZWVKZzmudQHTqUHN8FxkRG iWOCKlZ54DgKUK0OFgwiCdCRYJbcHCpPhtC8CpAvs7EShgN3C4Slo+GAJZxhC0CZYOdbwGAnuaxl o4OChYLzX2oTonRwwD4iMWCZmtQqE/DQL4HIOVJljgU4zgMBO/mSHhrkUmWDBYLBFyhsuUIHo0UL BrkwGAlPAa1nB7JB+T1kLwUMeux09EjHgdzsYMHi4nNxbNI8mLRhODmup9a1Pf7eKagwbLFy4dwN B5geIiS87REjdFgi3W963LOFZypyROPXu8Tcb43y7db4w7hYzd4yfR5AZA2DYzMzU1LnA1NTU1NT U1NTzlwxNERxRNmwxHIVCRGOc1znOczMUNGDQbrVaBsNxoo4qOkcEAXRD5ShgK5uFw9iBal/EhyL AUVKnQmXDOkOjShkMh7hIVtv2HoNeFPQKIxU2icqiW134rwHAPjvVZeqMqzrA8MCJeZiItgwFPSR QQ2fUEjXGLRMCJC4XDJLuVIXIECNmraJYRPZWlwuF4IIUjw9CMr3lEuIko6cLhO/keJqEB5C4tiO EEitwuEehX2HY7HNek+xpdO2iUG8hTxYsQJnYc6DkTUCR5HgdxipzQdq5Z85M1YzdZUSyMBH1OQz Z3AO4PZ4NXOE2xzHXXf3eqh45FG3nDwcQvdAglJX5CYbKAQQjRANatVgSWsaGAQZBBedN3lUjFkg wQDGRWXIINFHFRAztEbPG0WsiMREaAJxsBh4ieny/vDu8zrE92nXBmOy+UFJuLdjLi3xb7KE6Zqn xgeHt6jHdr+PGfx5Lm5WHq29W9Pg52Ha/fTZBd9NsGiU0DQwcyfPhE0MI69WiNMnYgy67gnkTS8z VMPM+th63xZHsYHZKTXPSfozyk9OyOjG2zNImbsLM8Ku6+np28WE8GdxCR712fZ1eVpX9rQp5j7v SPTzherJu4IUNMddnlls/T/d5i+vsNhaoBYJ4ZS4RC9iLCODUqIFEU8IfznUW/FlQEmMFMZ16Lto bzW5ppEUdLYNGFD5XRsopx0s7LXVoiGUPdFZYUK0S53+Z3nPxYcXsQcCSHwQZTVbiSNl/EW0a+GV PF9dWWHbhqOW5rWdAhWYNZz342h8nkrFLl28o/SfUk3YmEUSP8CkFVfjsfdhkRextW/r5nZLS76a fB9Hid6zSjicDjx7Vd+KMoDWKYDnq2shTwIXf8gETfYx3YLk6PUvKQrGKMVFVFViRE61lGimEJIE VCSJ1INV3nZt5ANX5TM3zsAo2+r8aJlY67BsTYag3iNt8pvd0iuoxL4D9gOcUBrfj+WThNNuMtgb aUW6HnZEkkgQjIQxPt969z3OIH6FT9IvN5n5DL+3BE0aP9R+Vg/y7/rlYzObT9aMWO0wm7CM0ap9 vIPu2t/83JznGDA+YOxUeVGfR8H5vYA1hFBe5oAyDIWFMX/LWbF/9/+phZN8QKVEqB90CKk//0jg /Wsed+JUh5QOb+Y886pOmH7k1PqNRtVXDbnIiLyvRIVlOX0WeavwxLI7aH8eDoDzCjub968pIZCE DdCF976EtwGxJTEaN25Z1pASJAo+hs4GYJto6M0ECUJ95Y8T/NZPwO6Tl5WoqPaGDJBTEWY2LGln twyHol9dGUHH+InLYkh5pJ/zzzmvvKWmb9TQ4EkOTOO92PCJlcSMmc7CFE0zGZE1dk9O1jwm5OJ2 zU4rKkWkjok7VtRqOGx4KUpUt4Tp8ONhrOHBMceb8zeT6v3eEUQPUhPKa1IKRKxZGePlONu3ACyF KWjQtJApI9TXuwj1+zPaUHh/Jwnck3WYIafCVuECKaYcx32kOOHebC9wIU4BLZTw1plMLBy3YBnq nDOG9uKnKAJISRvKgXZW0wVN2XmSR9GNydEkdxh6tuDoUjN8Pws9cKsWsGnt+8aUVOR43i4Hm2h/ DUeidhAhJEW4hhwCJn41QQZ/3vyYWX+DurxMJF5sXHFIOKR1JIep1Tqz3AxpJVJMFVjNdVSRWE/k pvTDrKODkkfObIfEU75JJM1CjrdYVBC9+MEe1jmy0DNOB9buhJGgrQMiWtjCBwAfAzOW50/hK06i QgUUp2o95lBzvHEF3GVzgdG6yZYlcJAVs2lCpGB5UNmWSlFD/HUZzLZGkz+CfTp8jiiVRFuZ05sB Sej/YW2CoByoax6YJoLiYCYbSzqYT2A8msDwCQRBEIiCiirEQVgEAjbzAecyAsJ5fI2QX3PBqoIq u3HdBvDfkO1xGM9P45JxM2TCjnwnKTTWfLQeDnpwBiTbqE47tMwZIr16ge+jvqmZx5ZBZxaPrEyz GKid9lEgUbznYJdoBWNiHQtfiFSSyYkqbJMckljtkgecWbQ1Aymk1iSXtLLDvGElmEoEObf6zr3/ fPIGQTsghXI7A2XRbkSycrZ2qUpRSlTlOR4qRuUilCUkUOjp5sEhkZEWMvSkjlVGJ4JGTioxhimH PrC1u6KHvnkwd4YOu40jbI3l4sE/wgeXtt9KoYq/UdVu5VBXKywwTvlk9aJHkAm8DAgQEkEkkIxD kbCHUKneKELwVtU4qYp4ubRg2tWGc48m2qH8YDrnVntqwnkgF2ITDF6R48YID0TSNSyEaKqKeySi EcXEVKMANV94XIacXfwyoGkKeasrmAYb1zL+HLs1vO9xQ/bAKan2wtb8I0HhgZeKgtJGwR+WxyWP qhaeGJrg9dVxIc3L0vG8sjIHyNggFn0CDvGc53SA9AK30+gPALsYN3WYuifsc8o9dCnzd7wYxpHU ZYRDFilhpjgiNuSGEqaCQyQJwAcQ8DQIG5ilsCFn1BdBRhQuIN9x+ti93ZmTMmG+2P5RjAhI5P95 MfkHzf2Qb8Iyf9zhjq8fBHGAlxSDQB7damYFzFrah4IOnR890Nb2yCEH6LOTIfjz3FutsUui+wtu 2LYG3fMnHDBG3FqGkF3G3gb/C2uq1mWeOrp+IT2R/ED/Gz6AaxJ6geyB6ITHnns4g65D8LYJBXEb sDAb6L0lRXw2BxHOi4YygooyaPoIwzyTE/I1cNwe0TTcijEW5h1XthkHU6YRcqKXcibC+A2XQSsD YTTrLmTqxC1nsySTJRUkUGtfvnDF1LTHBRWX6tTB56DDkSXPBCM6Cw0IUKUZETKdClSNSC2ZTAKE gyJRppsrYF/uTO7/SPnVIBJhctlwYqTTQhSIhOJqYpOIiqWMnHJQkNJvu3NTbfa5Dr2JQF9tQjIx giOxd2IPP3g7OwKrmQJvz4HZJNodG4dNCaBsGekll/YmsXK0HTVENaFKxgEJEEQlghnJy8Gh07bC U4gkoKxaRZApcC4EwqoxmLFqNRVsK2ZYOx3DhuLoOJq2wCgjIO4boP0NJk6ZdKiaHVKaU2xi6PwT 364RpWSLamMc2Dt7O434I7cF+Wsb1PQ4xZSopOMb9zq1yCGgPcaIzAjTI0xogcXe7uPA90X7iaiB xn5lZQQLCkrjXCv813mhIUT957SCBQJhj/eUSHMh+Zt/V+mcnOacsP3lpNeVBMbcplMTkZCCiYm1 QHIFJIwIkTUaWSXwBzaakAYH5zIpNZtIZSNo9an1t8ZgqUHdQyHwWkMuzq8HumlUeM0w8q8SD1cN 5oTips4PFg6KZp+H8tV5rH6f7/7ZTSZNOHMrOvcRicDccw2Y/neazKG01zCEwJbWx0j7xN/qAens eHdk3+zGAUpCDCIBRNz5NJ6obUOC0ypq68EQuP2BznF/LPOu5Tbwy9R7bKtXrLDB8tMRy9GB1pz/ 1KjBA5KisGAhyxQOEELEKe4H1vjz49jXQfpqoCpgFKIdhvgkYCTvQ2+bJ8SfGM1NvXRO7aXzrOyp sV6pwSH11Ij4yCNngPDflMI5lMCIFME8MVHUL+CxHAeYwDmMm5kMH++GzEN7aXA/NBwL7O1k2hog wid8YxWLpNtYXpLcDvkhqzqb1rnWUdjExzmTMzsPJ+KeViBMESecQShD5KJVKIybjMifoT2z2nrU xVyJhXATAdoQsIFiAh633sJCwzL3qCzCD+H69R3308lqh6Jt3ZN7j9HzQ97EjfOajoPkhXXP5FJQ Sn9pT583WfdqyWYXfFs4vyruT3J0icHB36tGKvcT+lfP7bCgnDpt8zi2j6jKVkrjL1T0SrzDLUaR IWQrMSwzGFQKBnPnqJwlWWuukFpMTmqCtTKPHE2viOT+p5/Q6HAIwkCJIBFiSI6IlVSD6WDZQsHG KPO65J6iBQf51+qWD9XZf/OfR+DXTL12gtpb0+/1GOr8HuHTIcREONqjJ9lirUntiSsBQtR6782D JE/XZxJ2z9iYg4RkgyIHUeg+To/5Cv34ADIiaXsiGJAJAjFxr5z6aWz693a3w8zGgHJ+cwbHccx7 Sz6G2875+J+Ji+lk/Ze77Zdns7/i4ua6mbFyYqmhT6Cxs2cHf0p9JsdiyizLGDzDaCYNkTqYLY63 rISQ3FJ+SqZ7WUHMOrgHWdKCcRwGhgDpOPml9b1ilKKhYdvYfJzOR7uvhnBFObseMG52uZuHPDMh VY3Ze4ocO4CgexIhyjXkr1+Oxllq2jwOs9bc2YJGpXkNET7ZTgCBjNCOkPjy+rk1e91Syq8UkNs8 MQr+Ondhb+FqpPS2wY0T7cXsDWYNCfeLCoghtAErepKFJ8hEPf8aNXEHkPvPLzn5HZ1sJGQJEZFT JArC0fc/x1PzzWQ4yVMjzkNehz+nftbAwwV9ip7gPUmJVyNkNU0TDlJcYmDKTFD4nAtVUqw6CIQk JTUBq4YYDRmQpgzkDhvdeHnxNkSDFwPBvGVzizDTzSQxljesWCYPpfBs2cz+FT1+bdnWbgu9z+x7 vg+xV32D5D6xRhwHvOWiZEMSxxaG78pG5NGwpWjkYlOCnYkeNPP5/GRPS2Uv4vFuuybrf2a4a06J AmESGIIGJUKASgsFGRFJyU7W7q3Y+HnH2voi0SpHbGSZPFs3WbKi4/sBY7aXWtUFBSTtiwC6wDOx 7mLB7y/vv0Uaywq26Y24OD/u6T+smro9gUk6zXh5FpicMAd0q7lAwU+l6DwHMeJ6XufG/AFdOl7B HoDovzscOc3rdTt+p2Hte+133TqbPmNhqDJ95TkbRTaWOg6aGx62q878dPfRXQdPfxY66oMKWpJA 79uN6DuNq2zr8zNlNJULJkWRatRMdvhvbt+dyFq9agnxhxjJTERzfocx7SRtJEagSDGKPNwjcjy5 436FHYAwFmSvx6gu4hPgS5A16buP9/OOjhQiTsoZzjVKI0YxJ1hvKzZcNRHyo8QwUYeyAisSC0Yb sxY0VBuYKtjpImEkEMmZJgCBQ4kYpDZxOWF23mH1o9vUaC7Ykg9vXnTXJrotdsCtVPUdTc0GpJLh MXEplH5rXMaITLdEoDaOlulOMFLk0lG67ehez6b7ZsQ3eT8CNDiBBzA4z0DDLBagM0w4BwYjLY21 Sh1MxDIUFchTJxMAUFPXeIYwhgzLJK7xEBmBUDbBywJCGNbm+ykME7CpGUKUgBQ2ZCd4hjYYC3Gk POfpPPaYNfEdEdJ2EiJSmDOVlpyIlQ2kqH9Q0Bi8G2QvzX0a5+fi8+vk5k5ZIZ5QJwgaDUMWFpep iB+haj0GvQWEM5uVRVIaROTKciUECg088OOScPW04QjA6MMINog99B6CoSHCBtgOiDiW8IFAY7aj nEuOVxsNwR5uYtJcq+DFuC7BIpRC2BLIxyTQJdNJynUqTNzdqRk8hiYgOUNK64+6IU/km32rXs3G wm3m4w3zUj+XtKe4eJN3S34YgbxPNS1EXj6wv2nkF92+PcZhmRHkhviBWI+ghQz4Qy0NIIeyHoRI XSb9iX8r2Byt4NttQKpD0DvNT1UGVFIMM0FZIbBqqLRDkBOAKsRlxC5aFB0L4Kh17fbLMWeEFV+1 5r1dRi3HWXiyt3m8kWkyFImBaiYcIiIgcVOYLag0LUqBbhTVK1dq2XqftV+oRmm04tD5Hukh3vCh A9wnvqRIr+2UogKbOJ5cYyRSASSSJaQgpmDzA8vJ4f69HyfTT0OTy0PgCDJRgiQRIBhlSEp4ZkPI hPp1HAQ/lchCozA4u/tZDvQpwoxcAV6FzPbqkndzZ1UV3tH3Tl/BD7FKf5+IVFQk1PaTNA1xQkVi DALb7QCWUbH0vcgX27sZzvHiQ7SXW3BggHrZRBlr1sQISwfRxIU0QAiXgm538bzLQePA4iMBUDFV 3Hr7ptpsGl2wNsahg5ADCFMAk0O/rAvfpLDbUhoMgv+wcA4kNTFXSnBYP+KW0Ggdf1+vqotJEkWV GDLIwodmOLJkTShwm2Pl7M32vDykTzZ4uYCzfntU1stJkTducceXBybuCgDYkCMntGOzB43IAOA7 xraEexvHi2FRIBIkSRqloZEYsUgMIrBb6K83JSbCA3AMjfIQZ4PQWtA/HOFvdSwaHPYJWt33DUj4 oSAcrqAUKc+VjQLwJ7whCPIdDPfvbhKF4HwBnDyw4m6M+ssZCF5EUcRB+1kJDIYViMUEMXm2u9yB D98qKp5iqlMA4o3tkqmaEY1JItMoZMIgHO+DzQkNXKP3aB+R0kgt2sHkfoP7bREYtEKVpoWfs3sZ SVKqMRQUkfYyys2MzNJPGcjjJJkiQRTIT8IAyck5ExVGAslCMWz4KftMEfoby7QszeZUT801nnna 6Ox3z9LR+lybN37fk1nzpkPTRRhs8rvMcXne736D2ibKXkx9KptKac5lGM1CtylA+YEsTEge1RBT AOUpXiezhHhZ5iZm0RpRaYIftxD5keMdrvPL8vMEj22Cn99FpsH0lfoQdWXmpkojIQl8zRDp5RL+ JB0XQbIPWxWet/RUl6j+DbUxJlSAxkGFGxyK4yhE5zQDkuCs6SCFnzqmJ7p9EA/CMVdxxZ7Y3OLM 9NvhqhRMt4S3IQLMS5CHDXuMVO3sQ97vOeR07qtAhJE7mZdJ36zyXcsiDYHqW7UgXaMkRZA8GLgL 4i2JCEcSEe+bo5H2GeIZJohSbdb4PO981vuH1n0GZpdUBiJxezll26QQgLEeYNr1lKfh9fIJaliM WrSh1aJleq8yhQkVqnWUUm9yjkhb6PFZv6lk2LOrEE/6/SHZ5swxOZviZVsVVHjTOJAaRwPYYmjy o9Dresfg9p64j4o+IqoWlSb5GoBeFo2q0tdXmLgWEbVAcLCF4U+JwsPE5uKHhdTrfY5AhqdVOmqo EeD+j+4pPdxk8pZ/+/4WL3cIWOo4HUusQS+FldhSHm4o9pxYqz7rBREVZFUUiJFIKKAj60Pfo1Dx MmoLfnyPalUNiMqHU46cWn3F+dC4F8DRBiHtcnebHve+bR16d1Psbax0LOQ9d32PHiB2obGOgI2d rZ9ACvtLow2MzKscz7R32Od3AyCqOc0OL7HAS/ndkrYUlDAbqYVJaR/iJ75l8fA+sPqR2UgauTf/ NyJJpp1f23n5+XTRWqEGdJFzandDGfMp1+FYe5hmYZDfY5st6y0r/GyWkhaqJVfp36U5Uz0qOxKp r6dxuepsXXQfactHKZPIBiivE/OJq60iD9sQFtH90VdnlT16sXSUJqVCD4NofzFeBsZRSqiasJEt 73jimJ38n4221nlI2ou/OpNyJqAk6DZBVsWOOMIdAP3THuEfqNvNmZdcjd23mvStfqQ4RNuMIfRv gBOMDIi2FZrPF3SZ2NT10lBVk8i9tLaSh7YMqd8Lmh7jI4zDJRLKIsEZ9vGMAaBKVJkSfcGc4+Ek Q20OWOzO+/vu+xQkCRiDJFHvZr44czykH2uO/8r3/LE07EDUxiEAgzl5iuHv+g3zzBmi8ASg8yYD 7gsDAsPjHSpxDN0eqN/ySsBfUFWGw0SpAoIAUcbsGxb6cCxr4U8gJkRchN/eYNX92buZbTgUbdVJ wObntV6dVnsXkVgWbFiBBBq8UpC+ZX5Q+RrmAUgoVFKHvwpAk7HBPxP4vDX1vC4nof5PY8Yosi9Z UtlEy8JHnVpMt6mnTn9us6V7PtdG5j3N7oHCEf9EoFC7R/kLOXDBX6TxXcu9atYkLlEd50e6PNyg F8VTj2fBck0JHqe31YhjBTDlOxGypaCnKnEmgpzZRxL4ELiURZSGJ+DzXQnnPsYNkxBifJrqQ0Yx UFkX7Lfq76ZmRONhUYBIgSJkUaWFkYEUmAUodDyv3u89TBfD4ZygEsdxUSmr8RTLyWtCS2qKolFe 9eCgveN7LKQpPrUaIVbChvi4WMKWI/rOmFZ9DVpPkUIZU2wcrLIuT5Vl/O7F8jADN0x5HIzJ8del gEbjQxOHQFFaKVN8Tvfzs90PHsMgz338R/RcHTZ28FRBV2Ocp9Q6uTPTnA8uZ/GJLBwB7acF52ke bjhEhnDY9xW8zBCMyzrQ3zYD1WFEVBEixEYowYEZlTQkTJAChHnSWCCDFSzpFDgL9w6m6qf2rVKV EU9D4hO9A0WlLCCSASKml6Y6I6QAtoEvypvvHi6dhnK8gBSlcMqkoisP+DWjQGYGGPqcR46o3F9b iFgb72pGJAP2sejCqJ+KDhFOcgFydTwa1NI+ufexyAxIUzgkhgdQTZn1MjzNvm87p6mZJvhHFbGo A6huV4DU4eAEi8R1Tb5jU9H1HC75Y2wzzyLPHqUtFTcGFNtFEt3WogJIC9DqJ7olUMlhFArCWEgM JIz0ux2OetxTGWgZBpvawh7v5OayuDlSW539KV1ELt/RZM4XFKvFt+Ei2jMCvmxFdPEOeGcoIO4Q D3QvbvYKpxzm08hbgW9CI/VwEzHYEDvjQnkPrGRGJ2QDv9m0O8+i0Xd91wzVDW6H1Qsd2gokeKJp O8JPkbPyvOdYkWbzEG5D8bRvb8pP3SW6L1cZGMY8J4tghtCIAQgmrFDogZJooGgNmw5RHKmd56zN +ztdoejUmskOdJk1icmUqcHN+aJsfXnZM4LUe8zokqgwpE+Y1IdUTORakVjstIkK1CgrpAQTJKxj VYTFC57oxWrVw8SSGb7oPz6BoQCdMPeL/NeQYCwUzkjhpFfqG+2khe5vGA2mHEvb690wJVqUyNE/ DisFDKummZEhBuZmWgG4TSCkAoCD5wGokOZZpiGDBh33ITY7cpaTU82CExuWhSCaMkGuxz0WBcig VoNqJBCymqVJLGMOqJ5bMnKUyaqWUtwtWAlQYSYPtbYAxmgaGKSwASzAqyNiNJWEk7KpupThg1YL BCCeApWt1IF1d6o7BO/qZkIJBEEBigycGAmpLgaSAcdU6RqJBYBHZEKfQ+FrJPwOt5NjxCWpDzRt z/gNoX+Pm3Pyo+V4X4nQjvNG+B34XiBo1gwfU2+L87SDcjgUSdRQVyyiCdEFoyQMaUxBIMmbTJEs AYqaGMGCy2RZbIYVCpgGBEjJoVIFoBMRpKYRQDF4woicMCB908keeQhzW+r0mU+F1DB8ST7yZmkF tK086HHS7Qcpuze9PqjVyhvDqd4OrfAOt8uHq6pb4DTaAF4kIvxi/SZ085AMTRSORAYyUJeFhi6e ZxbdTd8PYjnuz0xCbNJJ8j2H08MB8JqDtmRrcUg6wVH7SYTUcGsNoPzoO/9NQ9+aIVTAjU55dY++ OwwK4WK9kRQkHgndlCRfeNCcuKf2QFhCRnpPY9A5sTQZUO4Tw1UIMSzE5SCuKk6aAo1asjmmImvA uJuIp0YhoQ2RCRcUXGOYRgwP0bOIn7T8wo+QIsFKn5RToHG3oZB0GxfRLpv4evgwzQL1gqVtFzwp 4bWT+a4ZwfrYRjyRvCRcMdwctb6MiPxwAEJNemWfCvCUb9z2seXp9KWvopa0alXzF69RHUQhfueB fi4qeLQZcAPTFPKxRBIQBFCRBEiJBIwmyWMkltQ4RJGRrigvigc8Az/OR6YoSD/U4o7GqSbQqqTC bxx6e5fvTdwIyBUxcjM3ZqEchOr0mRjCCERjw8cBzB3+QMxxt7fiX8Dfl0tJM39+9/bonHgBEvlT ZUXvDzV7bfWakogJKSHzQ8JcCr1erHOT++KcZ7XG2SB4sAQMPl2vY30RNVFllNEdH1V8RYS1gtRV K9D4BF+BsKeVslQfu7K0qsV/R+ny4M+XOdNdYvnbxOBgW1/S6fLn8+t0ogodVntd+STHnzAYo2Sj AkLINf0eB5ExEfvvgA5mDzwfrCB0dwlL497rp3lc9wT4I7AcvD8H+xD5X8DvuJkOmfWQOJkm1Y3r eKTcnbX4y2Barx6OT1WtBpOpO4mrM/crGAYj2UUEDpgcYVAxIzJAErdkPXE/lIh4a023bHeOo/sS IezcK/hdDpCJ+2d5NlfbHr3iSsZbleJ3jxu5+j870Nn7X7u+SB8jEtyOTvI7XjFHQZIWxKFHB8r4 3wn339XlfUCG0iqa3efRrRjj6Xc8wfX18HaWuyyU9jGQgIwUg+42JFQIiT/QZ8IyYjIfB9Huh6Zh USmPzT7H42vofzGJu7x3dg8lxOYWHnEIKAghELILFiCqiKJHxtUjBYMxaRQtJUFhlMAYogrPAYEK BLQoJ59bTdFdzXZl0vTcOzsrc/B2+NumUJuc6KvUCJGEDEiTJJrkwTMEU/O+1yQAvAWCYAJsGIix idnInIE9nEbHyOOeiJkRcBCxyhqpCMig9rThMIKoxxiscCNRsA1pYS9afTTycfn96eP4FjwttSHW eakuHrOjq6erG0+cnykLusZ5Hx1QarV/tHTuDjcb6g24oja8rea8+uU5S6EYywwkH6gmuex5/nsI 6B7CBqAJIkYie6yWildPYnPBH3TWeOsSTg7dRb95UW23PAOhkXA52nB1lHdEK3Ix+RhrQL6T5kbV 5EG4FYNfmI7BWvz6wTmPq/Y4fsaoYYBmEKSEBJEHuIjIDU2mk/o5Hj4BeJ/VEDkLXHiIJaLmsRi4 UHMt0SoWIoVBaiiUxBQkZBJBGpb2uAHoduQ/a6x5DB0DsghcfeRI29Uj1iM6YoKp+X3pt5xJxcCy W4Ol8t4u5OOdTTglJuulBLvg3YLils0MFIUhwDmAGx2nBUMDGKqXqQ4EiEc6gcQBm8BZmzlK21NJ W4ixEUJEhBKnBOdVISkHOBuf0+/OCAjnODvAigJim5QP3/bN9vECNPE1EDpFTrCDwvoCMk5ESEjG ezGV2oWMVBGYntAU6iykN0ZGcDsvehCpKAqjQYSCWzo5CIoOAJw2oUVAGmfzWI1QhnPMaqjQ2E8B XCW4M7rBA5M6yMBQNzwKuarAgUcSwwDEQZARbd2t9f0p8Uzc2vm7xSRld0YIpoNQoos60rq/GQxm BjeS0TttDO6kBoILR9YO+h4hE+i+oKUlQ9Vc/05bRC7qlQak3Eh6aYrELk2xXxeKf3GzTYPi6orA W0WANkfRJ/DH26YMfP6z2ft3AQRKTet/dFcUJKl0xOprRaMUxbc8x4i37ThEgDazQj2TWIcUA2oP K3LuehcLu52ZbbYnwxStDiC+g6F+7UYskAJEjIRVn54fbE8BA/dCoPUQ9j508hyeUU8kTF1uLQHE 8UcfGXbkwevLJ34J9dMRrKrJ8zhmIcQQrKoeq4K5zlh7FKxBgZxRp7YfUpLmXCfXvymiiFCiFZoQ vKD9TMWIUPAugsGwuxtDY0DGakyLNT99Gfy3AMY3jFYGMw0tJgelU9M8dttttttttttttttttttt tvAnLUXqQfrkChhEjAhRESYoNlwYMNsuIMUBuhyNwQ8akUfhT22fHO9LVVE6DBjVoeSWb1rgMYNd SWZQRgIzLBBwosYsDSOEwSSCXEg3CKlDBHBTbTIYEp9KHXf8mbNtrR+rBWC0cN5u7STazVN96jBr lwmGHCUjQjOz9DJYPzottxmidZ8qpenvNjvGsROfkj53gk0+WaGA7ueDhByinDq4cU0FCh4FhLPh op4CBhYtGRXBxtgDBQGQslBQmUzYmnOcrEyQgkEHEAK4dK8mWrAlA+PMom1nHjTZJukNcE6GmAQ1 5Y5bUsuEj9LUOxxAQOpaCTyYXCh6xiJc0mCoewxwMg6hs2jiIUibbUz7pymKYpqF0bwQJSGFEoGA 2HAMBiIIgIOWw9BsCnJsywrJptZz0KXXGOjoLDEd00ELGbZKSUolmBGm3MvBQNkCgjuDAGBlYr7L asRG8DLzEDit5m1NzK7YsBGiocSnEBIoopCUUBHBsnVA3xRD5j1up+hp3P42ju18W9qtv2EOEOgE RSMFMBphwZHhID8ORZPfyxHdo4GJCFI0NIvitbNBuWc6ULMSyo4yQiwchhZSyFIjYLt8TRTgOag0 mIaQyWKhyBw64eSHJPSXCv6Y+SHnjuzX8xgSk4zVOdymH02q1CILOlccbnSCTOpvFQJsNCYnqbAg wzDAQCkwD4bUakDA1ip8QlpFG3AIjuU60ylqiMFizcymnIa897aw1NDzCag0NbZ7qqFr0UNuPF4C yFnanF3NOI8EtCkoaPe6nimSMPFkdYtMa0x+cpGLtWypCVx4Thu33QCBIEkSLaPeso2QfyoUo0GY p1chrtH00K8stAU5uM0EsuWFU60PC2fZKfyRNb9J26oxQ69knnNu+ng96Z6UZ28+DCqpQ38WENFE XDLDjaGB2kqxTAYh3PdsCYWd1awE/pAgjkMIQSRS8Q70EswUKncyT0/The91Ah18mZMJVZdBCttv R3GoQmQJ/VdSCV4v9jrPerC8ZdqhcfBW96oPwwXxJqV0QsLANNqg8bVRhU72tps3oHdA1WAaEtFH 59/EOz2Ogymq4hjF755UN/zu/5QTWbWLu6gTybCc7Q+JwNnGs/Z5H7NT0o4LsU+lSqNfZME25ZzK CHX2IGSo5arT5+w06E50n9xYwi2i1El0eYLBxAbwJpeNogBIBIoJIJxRWHW8bSWuQSkgwX/IgyRS KB9s71SB2+60h/sdzKPa5TU5p/FEP08JROKkoSYd54Xya5JNa2TuyGQ0H/WuAAy8gqP+EkH4D3jn OH92ZmJnsT9EZJB3CoYPp9/pfftwY/eKKfgVoRIRPYnufVW477qMUs8OIhzi/p5LalzYmkIHpV9X tbHVDvavG7jQxiRkjpKb3bkZZ+x9DrxyDA40et+jWD4yAw+go631OYnEH3odW1kMrUeyZXognwO5 +Z0m/BmWf5aq4ZOHT5nHwuBTxOWSawmHK/F+r7nXuczJ0GbduVfUCz4t1N6DqeR6TR4D6KkkMY1a 2/tPyzKxVD4rzGK4LHBDMDMMwMMmwpOazqSx0GlvKOYHIcyEZofE2EPCTAN4pOuJJIH1MS8UdD56 HyF04XC4bnlaHqnVnRoDhigvyH638D5zvvSxy5XY7TxM63WPh6wO9KzpgfWFqSwFzWc+pyeF2uop h1DW+4oaTSRZANYa4iQ44Jw1rlAjFyxbTqX4K45rCgVCNJ1wVy3hgQGa2IjQReDjOQOR8oTLkdrY 0EyobBuOTA2yvayxzDmds6TO2kHXPDGzRN0ug6deeTvOER4pjhMgYQKKuCwGLde6dfgcw8A6DKEj oh/B7UdilmiKVQF0sLWFYoMyCIiInQjScKluXG91VuWC2Mt608CxCPknKcDgzgazMk0oTrRLKVUK VIjMCV3ZxWAutTrIqFJU8ZPDoV6yq5eCkkBeySRxwF53M4B6m7wkTe7zypwB5RR5x4nN1dr0vK9j 0MeJ/H1CvmU+Ifo/X6VTCBLwf/395+vwE/zcA5cIBVk//YF3t5yYnPnpJkNKAqAz9Qu5IpwoSC9X 8eaA --===============2035782464538620751==--