From: Tor Didriksen Date: November 22 2010 11:45am Subject: bzr commit into mysql-trunk branch (tor.didriksen:3247) WL#1393 List-Archive: http://lists.mysql.com/commits/124616 Message-Id: <20101122114549.8875337A5@atum07.norway.sun.com> MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="===============5232765826283828807==" --===============5232765826283828807== 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 3247 Tor Didriksen 2010-11-22 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 function 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-11-04 15:40:18 +0000 +++ b/libmysqld/CMakeLists.txt 2010-11-22 11:45:40 +0000 @@ -45,6 +45,7 @@ SET(SQL_EMBEDDED_SOURCES emb_qcache.cc l ../sql-common/client_plugin.c ../sql/password.c ../sql/discover.cc ../sql/derror.cc ../sql/field.cc ../sql/field_conv.cc + ../sql/bounded_queue.cc ../sql/filesort.cc ../sql/gstream.cc ../sql/handler.cc ../sql/hash_filo.cc ../sql/hostname.cc ../sql/init.cc ../sql/item_buff.cc ../sql/item_cmpfunc.cc === modified file 'libmysqld/Makefile.am' --- a/libmysqld/Makefile.am 2010-11-04 15:40:18 +0000 +++ b/libmysqld/Makefile.am 2010-11-22 11:45:40 +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-11-22 11:45:40 +0000 @@ -1364,6 +1364,163 @@ 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 in 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 in 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 +set sort_buffer_size= 32768; +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 30; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 +ORDER BY f1, f0 LIMIT 0; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 20; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 10 OFFSET 10; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 0 OFFSET 10; +SELECT FOUND_ROWS(); + +################ +## Test sorting with join +## These are re-written to use PQ during execution. +set sort_buffer_size= 327680; + +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30; + +SELECT * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +SELECT FOUND_ROWS(); + +SELECT SQL_CALC_FOUND_ROWS * FROM t1 JOIN tmp on t1.f2=tmp.f2 +WHERE t1.f2>20 +ORDER BY tmp.f1, f0 LIMIT 30 OFFSET 30; +SELECT FOUND_ROWS(); + +################ +## Test views +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 30; +SELECT * FROM v1; +drop view v1; + +CREATE VIEW v1 as SELECT * FROM t1 ORDER BY f1, f0 LIMIT 100; +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; + +CREATE VIEW v2 as SELECT * FROM t1 ORDER BY f2, f0 LIMIT 100; +SELECT * FROM v1 JOIN v2 on v1.f1=v2.f1 ORDER BY v1.f2,v1.f0,v2.f0 +LIMIT 30; + +################ +## Test group & having +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 5; + +SELECT floor(f1/10) f3, count(f2) FROM t1 +group by 1 ORDER BY 2,1 LIMIT 0; + +################ +## Test SP +delimiter |; +CREATE PROCEDURE wl1393_sp_test() +BEGIN +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 30; +SELECT * FROM t1 WHERE f1>10 ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT SQL_CALC_FOUND_ROWS * FROM t1 WHERE f1>10 +ORDER BY f2, f0 LIMIT 15 OFFSET 15; +SELECT FOUND_ROWS(); +SELECT * FROM v1 ORDER BY f2, f0 LIMIT 30; +END| +CALL wl1393_sp_test()| +DROP PROCEDURE wl1393_sp_test| +delimiter ;| + +################ +## Test with subqueries +SELECT d1.* FROM t1 +LEFT JOIN (SELECT * FROM t1 LIMIT 30) d1 on t1.f1=d1.f1 +ORDER BY d1.f2 DESC LIMIT 30; + +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 1); + +--error ER_SUBQUERY_NO_1_ROW +SELECT * FROM t1 WHERE f1 = (SELECT f1 FROM t1 ORDER BY 1 LIMIT 2); + +DROP TABLE t1, tmp; +DROP VIEW v1, v2; + +--echo # end of WL#1393 - Optimizing filesort with small limit # # Bug#35844: Covering index for ref access not compatible with ORDER BY list === modified file 'mysql-test/include/select.inc' --- a/mysql-test/include/select.inc 2010-10-26 09:10:59 +0000 +++ b/mysql-test/include/select.inc 2010-11-22 11:45:40 +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-11-22 11:45:40 +0000 @@ -1504,6 +1504,853 @@ 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 +set sort_buffer_size= 32768; +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-11-22 11:45:40 +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; +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; +set sort_buffer_size= 32768; +FLUSH STATUS; +SHOW SESSION STATUS LIKE 'Sort%'; +Variable_name Value +Sort_merge_passes 0 +Sort_range 0 +Sort_rows 0 +Sort_scan 0 +SELECT * FROM t1 ORDER BY f2 LIMIT 100; +f0 f1 f2 +1 0 0 +101 0 0 +201 0 0 +301 0 0 +401 0 0 +501 0 0 +601 0 0 +701 0 0 +801 0 0 +901 0 0 +1001 0 0 +1101 0 0 +1201 0 0 +1301 0 0 +1401 0 0 +1501 0 0 +1601 0 0 +1701 0 0 +1801 0 0 +1901 0 0 +2001 0 0 +2101 0 0 +2201 0 0 +2301 0 0 +2401 0 0 +2501 0 0 +2601 0 0 +2701 0 0 +2801 0 0 +2901 0 0 +3001 0 0 +3101 0 0 +3201 0 0 +3301 0 0 +3401 0 0 +3501 0 0 +3601 0 0 +3701 0 0 +3801 0 0 +3901 0 0 +4001 0 0 +4101 0 0 +4201 0 0 +4301 0 0 +4401 0 0 +4501 0 0 +4601 0 0 +4701 0 0 +4801 0 0 +4901 0 0 +5001 0 0 +5101 0 0 +5201 0 0 +5301 0 0 +5401 0 0 +5501 0 0 +5601 0 0 +5701 0 0 +5801 0 0 +5901 0 0 +6001 0 0 +6101 0 0 +6201 0 0 +6301 0 0 +6401 0 0 +6501 0 0 +6601 0 0 +6701 0 0 +6801 0 0 +6901 0 0 +7001 0 0 +7101 0 0 +7201 0 0 +7301 0 0 +7401 0 0 +7501 0 0 +7601 0 0 +7701 0 0 +7801 0 0 +7901 0 0 +8001 0 0 +8101 0 0 +8201 0 0 +8301 0 0 +8401 0 0 +8501 0 0 +8601 0 0 +8701 0 0 +8801 0 0 +8901 0 0 +9001 0 0 +9101 0 0 +9201 0 0 +9301 0 0 +9401 0 0 +9501 0 0 +9601 0 0 +9701 0 0 +9801 0 0 +9901 0 0 +SHOW SESSION STATUS LIKE 'Sort%'; +Variable_name Value +Sort_merge_passes 0 +Sort_range 0 +Sort_rows 100 +Sort_scan 1 +DROP TABLE t1, tmp; === modified file 'mysql-test/r/select_none.result' --- a/mysql-test/r/select_none.result 2010-10-26 09:10:59 +0000 +++ b/mysql-test/r/select_none.result 2010-11-22 11:45:40 +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-11-22 11:45:40 +0000 @@ -0,0 +1,66 @@ +# +# 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. +# +# All the sort keys fit in memory, but the addon fields do not. +# +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; +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; + +# Test when only sortkeys fits to memory +set sort_buffer_size= 32768; + +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-11-22 11:45:40 +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-11-22 11:45:40 +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-11-14 18:09:32 +0000 +++ b/sql/CMakeLists.txt 2010-11-22 11:45:40 +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 @@ -109,7 +110,8 @@ SET (SLAVE_SOURCE rpl_slave.cc rpl_repor rpl_info_factory.cc server_ids.h) ADD_LIBRARY(slave ${SLAVE_SOURCE}) ADD_DEPENDENCIES(slave GenError) -ADD_LIBRARY(sqlgunitlib mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) +ADD_LIBRARY(sqlgunitlib + bounded_queue.cc mdl.cc sql_list.cc sql_string.cc thr_malloc.cc) ADD_DEPENDENCIES(sqlgunitlib GenError) === modified file 'sql/Makefile.am' --- a/sql/Makefile.am 2010-11-09 20:10:44 +0000 +++ b/sql/Makefile.am 2010-11-22 11:45:40 +0000 @@ -162,6 +162,7 @@ mysqld_SOURCES = sql_lex.cc sql_handler. log.cc init.cc derror.cc sql_acl.cc \ unireg.cc des_key_file.cc \ discover.cc sql_time.cc opt_range.cc opt_sum.cc \ + bounded_queue.cc \ records.cc filesort.cc handler.cc \ ha_partition.cc \ debug_sync.cc \ === added file 'sql/bounded_queue.cc' --- a/sql/bounded_queue.cc 1970-01-01 00:00:00 +0000 +++ b/sql/bounded_queue.cc 2010-11-22 11:45:40 +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-11-22 11:45:40 +0000 @@ -0,0 +1,189 @@ +/* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; version 2 of the License. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + +#ifndef BOUNDED_QUEUE_INCLUDED +#define BOUNDED_QUEUE_INCLUDED + +#include +#include "my_global.h" +#include "my_base.h" +#include "my_sys.h" +#include "queues.h" + +class Sort_param; + +/** + A priority queue with a fixed, limited size. + + This is a wrapper on top of QUEUE and the queue_xxx() functions. + It keeps the top N elements which are inserted. + */ +template +class Bounded_queue +{ +public: + Bounded_queue() + { + memset(&m_queue, 0, sizeof(m_queue)); + } + + ~Bounded_queue() + { + delete_queue(&m_queue); + } + + /** + Function for making sort-key from input data. + @param param Sort parameters. + @param to Where to put the key. + @param from The input data. + */ + typedef void (*keymaker_function)(Sort_param *param, + Key_type *to, + Element_type *from); + + /** + Function for comparing two keys. + @param n Pointer to number of bytes to compare. + @param a First key. + @parm b Second key. + @retval a <=> b. + */ + typedef int (*compare_function)(size_t *v, Key_type **a, Key_type **b); + + /** + Initialize the queue. + + @param max_elements The size of the queue. + @param offset_to_key Offset to key in elements stored in the queue. + @param max_at_top Set to 1 if you want biggest element on top. + @param compare Compare function for elements, takes 3 arguments. + If NULL, we use get_ptr_compare(compare_length). + @parem compare_length Lenght of the data used for sorting. + @param keymaker Function which generates keys for elements. + @param sort_param Sort parameters. + @param sort_keys Array of pointers to keys to sort. + + @retval 0 OK, 1 Could not allocate memory. + + We do *not* take ownership of any of the input pointer arguments. + */ + int init(ha_rows max_elements, uint offset_to_key, pbool max_at_top, + compare_function compare, size_t compare_length, + keymaker_function keymaker, Sort_param *sort_param, + Key_type **sort_keys); + + /** + Pushes an element on the queue. + If the queue is already full, we discard the smallest (or biggest) element. + + @param element The element to be pushed. + */ + void push(Element_type *element); + + /** + Removes an element from the queue. + + @retval Pointer to the removed element. + */ + Key_type **pop() + { + return (Key_type**) queue_remove(&m_queue, 0); + } + + /** + The number of elements in the queue. + */ + uint num_elements() const { return m_queue.elements; } + + /** + Is the queue initialized? + */ + bool is_initialized() const { return m_queue.max_elements > 0; } + +private: + Key_type **m_sort_keys; + size_t m_compare_length; + keymaker_function m_keymaker; + Sort_param *m_sort_param; + st_queue m_queue; +}; + + +template +int Bounded_queue::init(ha_rows max_elements, + uint offset_to_key, + pbool max_at_top, + compare_function compare, + size_t compare_length, + keymaker_function keymaker, + Sort_param *sort_param, + Key_type **sort_keys) +{ + DBUG_ASSERT(sort_keys != NULL); + + m_sort_keys= sort_keys; + m_compare_length= compare_length; + m_keymaker= keymaker; + m_sort_param= sort_param; + // init_queue() takes an uint, and also does (max_elements + 1) + if (max_elements >= (UINT_MAX - 1)) + return 1; + if (compare == NULL) + compare= reinterpret_cast(get_ptr_compare(compare_length)); + // We allocate space for one extra element, for replace when queue is full. + return init_queue(&m_queue, (uint) max_elements + 1, offset_to_key, max_at_top, + reinterpret_cast(compare), &m_compare_length); +} + + +template +void Bounded_queue::push(Element_type *element) +{ + DBUG_ASSERT(is_initialized()); + if (queue_is_full((&m_queue))) + { + Key_type **pq_top= reinterpret_cast(queue_top(&m_queue)); + (*m_keymaker)(m_sort_param, *pq_top, element); + queue_replaced(&m_queue); + } else { + (*m_keymaker)(m_sort_param, m_sort_keys[m_queue.elements], element); + queue_insert(&m_queue, + reinterpret_cast(&m_sort_keys[m_queue.elements])); + } +} + + +/* + Calculate cost of merge sort + + @param num_buffers # of merge buffers + @param max_n_elems max # of keys in memory buffer + @param last_n_elems # of keys in last buffer + @param elem_size Size of each element. + + Calculates cost of merge sort by simulating call to merge_many_buff(). + + @retval + computed cost of merge sort + + @note + Declared here in order to be able to unit test it, + since library dependencies have not been sorted out yet. +*/ +double get_merge_many_buffs_cost_fast(ha_rows num_buffers, ha_rows max_n_elems, + ha_rows last_n_elems, uint elem_size); + +#endif // BOUNDED_QUEUE_INCLUDED === modified file 'sql/filesort.cc' --- a/sql/filesort.cc 2010-08-04 10:34:01 +0000 +++ b/sql/filesort.cc 2010-11-22 11:45:40 +0000 @@ -32,11 +32,27 @@ #include "probes_mysql.h" #include "sql_test.h" // TEST_filesort #include "opt_range.h" // SQL_SELECT +#include "bounded_queue.h" +#include "sql_select.h" #ifndef THREAD #define SKIP_DBUG_IN_FILESORT #endif +/* + How much Priority Queue sort is slower than qsort. + For qsort we have an average case complexity of O(n*log(n)) comparisons. + When using a priority queue, we have log(n) comparisons each time we + push a new element. For PQ we also call qsort at the end. + Measurements show that there is some extra overhead in QUEUE, + so we set it to 3.0 rather than 2.0. + */ +static double PQ_slowness= 3.0; + +#ifdef HAVE_EXPLICIT_TEMPLATE_INSTANTIATION +template class Bounded_queue; +#endif + /// How to write record_ref. #define WRITE_REF(file,from) \ if (my_b_write((file),(uchar*) (from),param->ref_length)) \ @@ -44,22 +60,23 @@ if (my_b_write((file),(uchar*) (from),pa /* functions defined in this file */ -static char **make_char_array(char **old_pos, register uint fields, - uint length, myf my_flag); +static uchar **make_char_array(uchar **old_pos, uint fields, uint length); static uchar *read_buffpek_from_file(IO_CACHE *buffer_file, uint count, uchar *buf); -static ha_rows find_all_keys(SORTPARAM *param,SQL_SELECT *select, - uchar * *sort_keys, IO_CACHE *buffer_file, - IO_CACHE *tempfile,IO_CACHE *indexfile); -static int write_keys(SORTPARAM *param,uchar * *sort_keys, - uint count, IO_CACHE *buffer_file, IO_CACHE *tempfile); -static void make_sortkey(SORTPARAM *param,uchar *to, uchar *ref_pos); -static void register_used_fields(SORTPARAM *param); -static int merge_index(SORTPARAM *param,uchar *sort_buffer, - BUFFPEK *buffpek, - uint maxbuffer,IO_CACHE *tempfile, - IO_CACHE *outfile); -static bool save_index(SORTPARAM *param,uchar **sort_keys, uint count, +static ha_rows find_all_keys(Sort_param *param,SQL_SELECT *select, + uchar **sort_keys, IO_CACHE *buffer_file, + IO_CACHE *tempfile, + Bounded_queue *pq, + ha_rows *found_rows); +static int write_keys(Sort_param *param,uchar * *sort_keys, + uint count, IO_CACHE *buffer_file, IO_CACHE *tempfile); +static void make_sortkey(Sort_param *param,uchar *to, uchar *ref_pos); +static void register_used_fields(Sort_param *param); +static int merge_index(Sort_param *param,uchar *sort_buffer, + BUFFPEK *buffpek, + uint maxbuffer,IO_CACHE *tempfile, + IO_CACHE *outfile); +static bool save_index(Sort_param *param,uchar **sort_keys, uint count, FILESORT_INFO *table_sort); static uint suffix_length(ulong string_length); static uint sortlength(THD *thd, SORT_FIELD *sortorder, uint s_length, @@ -68,6 +85,41 @@ static SORT_ADDON_FIELD *get_addon_field uint sortlength, uint *plength); static void unpack_addon_fields(struct st_sort_addon_field *addon_field, uchar *buff); +static uchar **check_if_pq_applicable(Sort_param *param, FILESORT_INFO *info, + TABLE *table, + ha_rows records, ulong memavl); + + +void Sort_param::init(uint sortlen, TABLE *table, THD *thd, + ha_rows maxrows, bool sort_positions) +{ + sort_length= sortlen; + ref_length= table->file->ref_length; + if (!(table->file->ha_table_flags() & HA_FAST_KEY_READ) && + !table->fulltext_searched && !sort_positions) + { + /* + Get the descriptors of all fields whose values are appended + to sorted fields and get its total length in addon_length. + */ + addon_field= get_addon_fields(thd, table->field, sort_length, &addon_length); + } + if (addon_field) + res_length= addon_length; + else + { + res_length= ref_length; + /* + The reference to the record is considered + as an additional sorted field + */ + sort_length+= ref_length; + } + rec_length= sort_length + addon_length; + max_rows= maxrows; +} + + /** Sort a table. Creates a set of pointers that can be used to read the rows @@ -80,18 +132,17 @@ static void unpack_addon_fields(struct s The result set is stored in table->io_cache or table->record_pointers. - @param thd Current thread - @param table Table to sort - @param sortorder How to sort the table - @param s_length Number of elements in sortorder - @param select condition to apply to the rows - @param max_rows Return only this many rows - @param sort_positions Set to 1 if we want to force sorting by position - (Needed by UPDATE/INSERT or ALTER TABLE) - @param examined_rows Store number of examined rows here + @param thd Current thread + @param table Table to sort + @param sortorder How to sort the table + @param s_length Number of elements in sortorder + @param select Condition to apply to the rows + @param max_rows Return only this many rows + @param sort_positions Set to TRUE if we want to force sorting by position + (Needed by UPDATE/INSERT or ALTER TABLE) + @param[out] examined_rows Store number of examined rows here + @param options 0 or OPTION_FOUND_ROWS - @todo - check why we do this (param.keys--) @note If we sort by position (like if sort_positions is 1) filesort() will call table->prepare_for_position(). @@ -100,29 +151,30 @@ static void unpack_addon_fields(struct s HA_POS_ERROR Error @retval \# Number of rows - @retval - examined_rows will be set to number of examined rows */ ha_rows filesort(THD *thd, TABLE *table, SORT_FIELD *sortorder, uint s_length, SQL_SELECT *select, ha_rows max_rows, - bool sort_positions, ha_rows *examined_rows) + bool sort_positions, ha_rows *examined_rows, + ulonglong options) { int error; - ulong memavl, min_sort_memory; + ulong memavl; uint maxbuffer; BUFFPEK *buffpek; - ha_rows records= HA_POS_ERROR; - uchar **sort_keys= 0; - IO_CACHE tempfile, buffpek_pointers, *selected_records_file, *outfile; - SORTPARAM param; + ha_rows num_rows= HA_POS_ERROR; + uchar **sort_keys= NULL; + IO_CACHE tempfile, buffpek_pointers, *outfile; + Sort_param param; bool multi_byte_charset; + ha_rows found_rows; + Bounded_queue pq; + DBUG_ENTER("filesort"); DBUG_EXECUTE("info",TEST_filesort(sortorder,s_length);); #ifdef SKIP_DBUG_IN_FILESORT DBUG_PUSH(""); /* No DBUG here */ #endif - FILESORT_INFO table_sort; TABLE_LIST *tab= table->pos_in_table_list; Item_subselect *subselect= tab ? tab->containing_subselect() : 0; @@ -139,7 +191,7 @@ ha_rows filesort(THD *thd, TABLE *table, QUICK_INDEX_MERGE_SELECT. Work with a copy and put it back at the end when index_merge select has finished with it. */ - memcpy(&table_sort, &table->sort, sizeof(FILESORT_INFO)); + FILESORT_INFO table_sort= table->sort; table->sort.io_cache= NULL; outfile= table_sort.io_cache; @@ -147,117 +199,98 @@ ha_rows filesort(THD *thd, TABLE *table, my_b_clear(&buffpek_pointers); buffpek=0; error= 1; - bzero((char*) ¶m,sizeof(param)); - param.sort_length= sortlength(thd, sortorder, s_length, &multi_byte_charset); + + param.init(sortlength(thd, sortorder, s_length, &multi_byte_charset), + table, thd, max_rows, sort_positions); /* filesort cannot handle zero-length records. */ DBUG_ASSERT(param.sort_length); - param.ref_length= table->file->ref_length; - param.addon_field= 0; - param.addon_length= 0; - if (!(table->file->ha_table_flags() & HA_FAST_KEY_READ) && - !table->fulltext_searched && !sort_positions) - { - /* - Get the descriptors of all fields whose values are appended - to sorted fields and get its total length in param.spack_length. - */ - param.addon_field= get_addon_fields(thd, table->field, - param.sort_length, - ¶m.addon_length); - } table_sort.addon_buf= 0; table_sort.addon_length= param.addon_length; table_sort.addon_field= param.addon_field; table_sort.unpack= unpack_addon_fields; - if (param.addon_field) - { - param.res_length= param.addon_length; - if (!(table_sort.addon_buf= (uchar *) my_malloc(param.addon_length, - MYF(MY_WME)))) + if (param.addon_field && + !(table_sort.addon_buf= + (uchar *) my_malloc(param.addon_length, MYF(MY_WME)))) goto err; - } - else - { - param.res_length= param.ref_length; - /* - The reference to the record is considered - as an additional sorted field - */ - param.sort_length+= param.ref_length; - } - param.rec_length= param.sort_length+param.addon_length; - param.max_rows= max_rows; if (select && select->quick) - { status_var_increment(thd->status_var.filesort_range_count); - } else - { status_var_increment(thd->status_var.filesort_scan_count); - } -#ifdef CAN_TRUST_RANGE - if (select && select->quick && select->quick->records > 0L) - { - records=min((ha_rows) (select->quick->records*2+EXTRA_RECORDS*2), - table->file->stats.records)+EXTRA_RECORDS; - selected_records_file=0; - } - else -#endif - { - records= table->file->estimate_rows_upper_bound(); - /* - If number of records is not known, use as much of sort buffer - as possible. - */ - if (records == HA_POS_ERROR) - records--; // we use 'records+1' below. - selected_records_file= 0; - } + + /* + If number of rows is not known, use as much of sort buffer as possible. + */ + num_rows= table->file->estimate_rows_upper_bound(); if (multi_byte_charset && !(param.tmp_buffer= (char*) my_malloc(param.sort_length,MYF(MY_WME)))) goto err; memavl= thd->variables.sortbuff_size; - min_sort_memory= max(MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2); - while (memavl >= min_sort_memory) - { - ulong old_memavl; - ulong keys= memavl/(param.rec_length+sizeof(char*)); - param.keys=(uint) min(records+1, keys); - if ((table_sort.sort_keys= - (uchar **) make_char_array((char **) table_sort.sort_keys, - param.keys, param.rec_length, MYF(0)))) - break; - old_memavl=memavl; - if ((memavl=memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory) - memavl= min_sort_memory; + + table_sort.sort_keys= + check_if_pq_applicable(¶m, &table_sort, table, num_rows, memavl); + if (table_sort.sort_keys) + { + DBUG_PRINT("info", ("filesort PQ is applicable")); + const size_t compare_length= param.sort_length; + if (pq.init(param.max_rows, 0, 1, + NULL, + compare_length, + &make_sortkey, ¶m, table_sort.sort_keys)) + { + // If failed to init pq, fall back to merge-sort. + my_free(table_sort.sort_keys); + table_sort.sort_keys= NULL; + } } - sort_keys= table_sort.sort_keys; - if (memavl < min_sort_memory) + else + DBUG_PRINT("info", ("filesort PQ is not applicable")); + + if (!table_sort.sort_keys) { - my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG)); - goto err; + const ulong min_sort_memory= + max(MIN_SORT_MEMORY, param.sort_length*MERGEBUFF2); + while (memavl >= min_sort_memory) + { + ulong old_memavl; + ulong keys= memavl/(param.rec_length+sizeof(char*)); + param.num_keys_per_buffer= (uint) min(num_rows, keys); + if ((table_sort.sort_keys= + make_char_array(table_sort.sort_keys, + param.num_keys_per_buffer, param.rec_length))) + break; + old_memavl=memavl; + if ((memavl=memavl/4*3) < min_sort_memory && old_memavl > min_sort_memory) + memavl= min_sort_memory; + } + if (memavl < min_sort_memory) + { + my_error(ER_OUT_OF_SORTMEMORY,MYF(ME_ERROR+ME_WAITTANG)); + goto err; + } } + + sort_keys= table_sort.sort_keys; if (open_cached_file(&buffpek_pointers,mysql_tmpdir,TEMP_PREFIX, DISK_BUFFER_SIZE, MYF(MY_WME))) goto err; - param.keys--; /* TODO: check why we do this */ param.sort_form= table; param.end=(param.local_sortorder=sortorder)+s_length; - if ((records=find_all_keys(¶m,select,sort_keys, &buffpek_pointers, - &tempfile, selected_records_file)) == + if ((num_rows= find_all_keys(¶m, select, sort_keys, &buffpek_pointers, + &tempfile, + pq.is_initialized() ? &pq : NULL, + &found_rows)) == HA_POS_ERROR) goto err; maxbuffer= (uint) (my_b_tell(&buffpek_pointers)/sizeof(*buffpek)); if (maxbuffer == 0) // The whole set is in memory { - if (save_index(¶m,sort_keys,(uint) records, &table_sort)) + if (save_index(¶m, sort_keys, (uint) num_rows, &table_sort)) goto err; } else @@ -286,8 +319,9 @@ ha_rows filesort(THD *thd, TABLE *table, Use also the space previously used by string pointers in sort_buffer for temporary key storage. */ - param.keys=((param.keys*(param.rec_length+sizeof(char*))) / - param.rec_length-1); + param.num_keys_per_buffer=((param.num_keys_per_buffer * + (param.rec_length + sizeof(char*))) / + param.rec_length - 1); maxbuffer--; // Offset from 0 if (merge_many_buff(¶m,(uchar*) sort_keys,buffpek,&maxbuffer, &tempfile)) @@ -299,9 +333,17 @@ ha_rows filesort(THD *thd, TABLE *table, outfile)) goto err; } - if (records > param.max_rows) - records=param.max_rows; - error =0; + + if (pq.is_initialized() && (options & OPTION_FOUND_ROWS)) + { + DBUG_PRINT("info", ("PQ and OPTION_FOUND_ROWS !!")); + } + + if (options & OPTION_FOUND_ROWS) + num_rows= found_rows; + else if (num_rows > param.max_rows) + num_rows= param.max_rows; + error= 0; err: my_free(param.tmp_buffer); @@ -332,15 +374,16 @@ ha_rows filesort(THD *thd, TABLE *table, MYF(ME_ERROR+ME_WAITTANG)); else statistic_add(thd->status_var.filesort_rows, - (ulong) records, &LOCK_status); + (ulong) num_rows, &LOCK_status); *examined_rows= param.examined_rows; #ifdef SKIP_DBUG_IN_FILESORT DBUG_POP(); /* Ok to DBUG */ #endif - memcpy(&table->sort, &table_sort, sizeof(FILESORT_INFO)); - DBUG_PRINT("exit",("records: %ld", (long) records)); - MYSQL_FILESORT_DONE(error, records); - DBUG_RETURN(error ? HA_POS_ERROR : records); + table->sort= table_sort; + DBUG_PRINT("exit",("num_rows: %ld examined_rows: %ld", + (long) num_rows, (long) *examined_rows)); + MYSQL_FILESORT_DONE(error, num_rows); + DBUG_RETURN(error ? HA_POS_ERROR : num_rows); } /* filesort */ @@ -366,23 +409,22 @@ void filesort_free_buffers(TABLE *table, /** Make a array of string pointers. */ -static char **make_char_array(char **old_pos, register uint fields, - uint length, myf my_flag) +static uchar **make_char_array(uchar **old_pos, uint fields, uint length) { - register char **pos; - char *char_pos; DBUG_ENTER("make_char_array"); if (old_pos || - (old_pos= (char**) my_malloc((uint) fields*(length+sizeof(char*)), - my_flag))) + (old_pos= + (uchar**) my_malloc(fields * (length + sizeof(char*)), MYF(0)))) { - pos=old_pos; char_pos=((char*) (pos+fields)) -length; - while (fields--) *(pos++) = (char_pos+= length); + uchar **pos= old_pos; + uchar *char_pos= ((uchar*) (pos+fields)) - length; + while (fields--) + *(pos++) = (char_pos+= length); } DBUG_RETURN(old_pos); -} /* make_char_array */ +} /** Read 'count' number of buffer pointers into memory. */ @@ -470,20 +512,26 @@ static void dbug_print_record(TABLE *tab @param buffpek_pointers File to write BUFFPEKs describing sorted segments in tempfile. @param tempfile File to write sorted sequences of sortkeys to. - @param indexfile If !NULL, use it for source data (contains rowids) + @param pq If !NULL, use it for keeping top N elements + @param [out] found_rows The number of FOUND_ROWS(). @note Basic idea: @verbatim while (get_next_sortkey()) { - if (no free space in sort_keys buffers) + if (using priority queue) + push sort key into queue + else { - sort sort_keys buffer; - dump sorted sequence to 'tempfile'; - dump BUFFPEK describing sequence location into 'buffpek_pointers'; + if (no free space in sort_keys buffers) + { + sort sort_keys buffer; + dump sorted sequence to 'tempfile'; + dump BUFFPEK describing sequence location into 'buffpek_pointers'; + } + put sort key into 'sort_keys'; } - put sort key into 'sort_keys'; } if (sort_keys has some elements && dumped at least once) sort-dump-dump as above; @@ -497,10 +545,12 @@ static void dbug_print_record(TABLE *tab HA_POS_ERROR on error. */ -static ha_rows find_all_keys(SORTPARAM *param, SQL_SELECT *select, - uchar **sort_keys, - IO_CACHE *buffpek_pointers, - IO_CACHE *tempfile, IO_CACHE *indexfile) +static ha_rows find_all_keys(Sort_param *param, SQL_SELECT *select, + uchar **sort_keys, + IO_CACHE *buffpek_pointers, + IO_CACHE *tempfile, + Bounded_queue *pq, + ha_rows *found_rows) { int error,flag,quick_select; uint idx,indexpos,ref_length; @@ -512,11 +562,12 @@ static ha_rows find_all_keys(SORTPARAM * handler *file; MY_BITMAP *save_read_set, *save_write_set; bool skip_record; + DBUG_ENTER("find_all_keys"); DBUG_PRINT("info",("using: %s", (select ? select->quick ? "ranges" : "where": "every row"))); - + idx=indexpos=0; error=quick_select=0; sort_form=param->sort_form; @@ -525,12 +576,12 @@ static ha_rows find_all_keys(SORTPARAM * ref_pos= ref_buff; quick_select=select && select->quick; record=0; - flag= ((!indexfile && file->ha_table_flags() & HA_REC_NOT_IN_SEQ) - || quick_select); - if (indexfile || flag) + *found_rows= 0; + flag= ((file->ha_table_flags() & HA_REC_NOT_IN_SEQ) || quick_select); + if (flag) ref_pos= &file->ref[0]; next_pos=ref_pos; - if (! indexfile && ! quick_select) + if (!quick_select) { next_pos=(uchar*) 0; /* Find records in sequence */ file->ha_rnd_init(1); @@ -577,16 +628,6 @@ static ha_rows find_all_keys(SORTPARAM * } else /* Not quick-select */ { - if (indexfile) - { - if (my_b_read(indexfile,(uchar*) ref_pos,ref_length)) /* purecov: deadcode */ - { - error= my_errno ? my_errno : -1; /* Abort */ - break; - } - error= file->ha_rnd_pos(sort_form->record[0], next_pos); - } - else { error= file->ha_rnd_next(sort_form->record[0]); if (!flag) @@ -604,7 +645,7 @@ static ha_rows find_all_keys(SORTPARAM * if (*killed) { DBUG_PRINT("info",("Sort killed by user")); - if (!indexfile && !quick_select) + if (!quick_select) { (void) file->extra(HA_EXTRA_NO_CACHE); file->ha_rnd_end(); @@ -616,14 +657,23 @@ static ha_rows find_all_keys(SORTPARAM * if (!error && (!select || (!select->skip_record(thd, &skip_record) && !skip_record))) { - if (idx == param->keys) + ++(*found_rows); + if (pq) { - if (write_keys(param,sort_keys,idx,buffpek_pointers,tempfile)) - DBUG_RETURN(HA_POS_ERROR); - idx=0; - indexpos++; + pq->push(ref_pos); + idx= pq->num_elements(); + } + else + { + if (idx == param->num_keys_per_buffer) + { + if (write_keys(param,sort_keys, idx, buffpek_pointers, tempfile)) + DBUG_RETURN(HA_POS_ERROR); + idx= 0; + indexpos++; + } + make_sortkey(param, sort_keys[idx++], ref_pos); } - make_sortkey(param,sort_keys[idx++],ref_pos); } else file->unlock_row(); @@ -653,9 +703,11 @@ static ha_rows find_all_keys(SORTPARAM * if (indexpos && idx && write_keys(param,sort_keys,idx,buffpek_pointers,tempfile)) DBUG_RETURN(HA_POS_ERROR); /* purecov: inspected */ - DBUG_RETURN(my_b_inited(tempfile) ? - (ha_rows) (my_b_tell(tempfile)/param->rec_length) : - idx); + const ha_rows retval= + my_b_inited(tempfile) ? + (ha_rows) (my_b_tell(tempfile)/param->rec_length) : idx; + DBUG_PRINT("info", ("find_all_keys return %u", (uint) retval)); + DBUG_RETURN(retval); } /* find_all_keys */ @@ -682,7 +734,7 @@ static ha_rows find_all_keys(SORTPARAM * */ static int -write_keys(SORTPARAM *param, register uchar **sort_keys, uint count, +write_keys(Sort_param *param, register uchar **sort_keys, uint count, IO_CACHE *buffpek_pointers, IO_CACHE *tempfile) { size_t sort_length, rec_length; @@ -745,8 +797,8 @@ static inline void store_length(uchar *t /** Make a sort-key from record. */ -static void make_sortkey(register SORTPARAM *param, - register uchar *to, uchar *ref_pos) +static void make_sortkey(register Sort_param *param, + register uchar *to, uchar *ref_pos) { reg3 Field *field; reg1 SORT_FIELD *sort_field; @@ -998,7 +1050,7 @@ static void make_sortkey(register SORTPA Register fields used by sorting in the sorted table's read set */ -static void register_used_fields(SORTPARAM *param) +static void register_used_fields(Sort_param *param) { reg1 SORT_FIELD *sort_field; TABLE *table=param->sort_form; @@ -1036,17 +1088,17 @@ static void register_used_fields(SORTPAR } -static bool save_index(SORTPARAM *param, uchar **sort_keys, uint count, +static bool save_index(Sort_param *param, uchar **sort_keys, uint count, FILESORT_INFO *table_sort) { uint offset,res_length; uchar *to; DBUG_ENTER("save_index"); - my_string_ptr_sort((uchar*) sort_keys, (uint) count, param->sort_length); + my_string_ptr_sort((uchar*) sort_keys, count, param->sort_length); res_length= param->res_length; offset= param->rec_length-res_length; - if ((ha_rows) count > param->max_rows) + if ((ha_rows) count > param->max_rows && param->max_rows > 0) count=(uint) param->max_rows; if (!(to= table_sort->record_pointers= (uchar*) my_malloc(res_length*count, MYF(MY_WME)))) @@ -1060,10 +1112,127 @@ static bool save_index(SORTPARAM *param, } +/** + Test whether priority queue is worth using to get top elements of an + ordered result set. If it is then allocates buffer for required amount of + records + + @param param Sort parameters. + @param info Filesort information. + @param table Table to sort. + @param num_rows Estimate of number of rows in source record set. + @param memavl Memory available for sorting. + + DESCRIPTION + Function tests applicability of PQ to get L top records for queries like + SELECT ... FROM t ORDER BY a1,...,an LIMIT max_rows; + It tests whether there is enough memory to contain max_rows elements, + whether max_rows is small enough to make PQ perform faster that qsort + on table containing 'num_rows' records. If available memory is enough to + store only 'max_rows' sort keys without addon data, it modifies 'table' + to sort with references to tuples instead of additional data. In evaluations + it uses 'param' to get sort key, addon data and reference sizes, 'table' - + to get table scan time. + + @retval + allocated buffer - if it's ok to use PQ + NULL - PQ will be slower than merge-sort, or there is not enough memory. +*/ + +uchar **check_if_pq_applicable(Sort_param *param, FILESORT_INFO *info, + TABLE *table, ha_rows num_rows, ulong memavl) +{ + DBUG_ENTER("check_if_pq_applicable"); + + if (param->max_rows == HA_POS_ERROR) + { + DBUG_PRINT("info", ("max_rows = HA_POS_ERROR")); + DBUG_RETURN(NULL); + } + + if (param->max_rows + 2 >= UINT_MAX) + { + DBUG_PRINT("info", ("Too large LIMIT")); + DBUG_RETURN(NULL); + } + + uchar **sort_keys; + ulong num_available_keys= memavl/(param->rec_length + sizeof(char*)); + param->num_keys_per_buffer= (uint) param->max_rows + 1; + if (num_rows < num_available_keys) + { + /* The whole source set fits into memory. */ + if (param->max_rows < num_rows/PQ_slowness ) + { + if ((sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length))) + DBUG_RETURN(sort_keys); + } + else + { + /* PQ will be slower */ + DBUG_RETURN(NULL); + } + } + + if (param->max_rows + 1 < num_available_keys && + (sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length))) + DBUG_RETURN(sort_keys); + + /* Try to strip off addon fields */ + if (param->addon_field) + { + const ulong row_lenght= + param->sort_length + param->ref_length + sizeof(char*); + num_available_keys= memavl / row_lenght; + + if (param->max_rows + 1 < num_available_keys) + { + const double merge_cost= + get_merge_many_buffs_cost_fast(num_rows / num_available_keys, + num_available_keys, + num_rows % num_available_keys, + row_lenght); + const double pq_cost= + (PQ_slowness * num_rows + param->max_rows + 1)* + log(param->max_rows + 1.0) / TIME_FOR_COMPARE_ROWID + + param->max_rows * table->file->scan_time(); + + if (merge_cost < pq_cost) + DBUG_RETURN(NULL); + + sort_keys= make_char_array(info->sort_keys, + param->num_keys_per_buffer, + param->rec_length); + if (sort_keys) + { + // Make attached data to be references instead of fields. + my_free(info->addon_buf); + my_free(info->addon_field); + info->addon_buf= NULL; + info->addon_field= 0; + param->addon_field= NULL; + param->addon_length= 0; + + param->res_length= param->ref_length; + param->sort_length+= param->ref_length; + param->rec_length= param->sort_length + param->addon_length; + + DBUG_RETURN(sort_keys); + } + } + } + DBUG_RETURN(NULL); +} + + /** Merge buffers to make < MERGEBUFF2 buffers. */ -int merge_many_buff(SORTPARAM *param, uchar *sort_buffer, - BUFFPEK *buffpek, uint *maxbuffer, IO_CACHE *t_file) +int merge_many_buff(Sort_param *param, uchar *sort_buffer, + BUFFPEK *buffpek, uint *maxbuffer, IO_CACHE *t_file) { register uint i; IO_CACHE t_file2,*from_file,*to_file,*temp; @@ -1192,7 +1361,7 @@ void reuse_freed_buff(QUEUE *queue, BUFF other error */ -int merge_buffers(SORTPARAM *param, IO_CACHE *from_file, +int merge_buffers(Sort_param *param, IO_CACHE *from_file, IO_CACHE *to_file, uchar *sort_buffer, BUFFPEK *lastbuff, BUFFPEK *Fb, BUFFPEK *Tb, int flag) @@ -1224,7 +1393,7 @@ int merge_buffers(SORTPARAM *param, IO_C res_length= param->res_length; sort_length= param->sort_length; offset= rec_length-res_length; - maxcount= (ulong) (param->keys/((uint) (Tb-Fb) +1)); + maxcount= (ulong) (param->num_keys_per_buffer / ((uint) (Tb-Fb) +1)); to_start_filepos= my_b_tell(to_file); strpos= (uchar*) sort_buffer; org_max_rows=max_rows= param->max_rows; @@ -1249,8 +1418,7 @@ int merge_buffers(SORTPARAM *param, IO_C { buffpek->base= strpos; buffpek->max_keys= maxcount; - strpos+= (uint) (error= (int) read_to_buffer(from_file, buffpek, - rec_length)); + strpos+= (uint) (error= (int)read_to_buffer(from_file, buffpek, rec_length)); if (error == -1) goto err; /* purecov: inspected */ buffpek->max_keys= buffpek->mem_count; // If less data in buffers than expected @@ -1340,7 +1508,7 @@ int merge_buffers(SORTPARAM *param, IO_C } buffpek= (BUFFPEK*) queue_top(&queue); buffpek->base= sort_buffer; - buffpek->max_keys= param->keys; + buffpek->max_keys= param->num_keys_per_buffer; /* As we know all entries in the buffer are unique, we only have to @@ -1400,9 +1568,9 @@ err: /* Do a merge to output-file (save only positions) */ -static int merge_index(SORTPARAM *param, uchar *sort_buffer, - BUFFPEK *buffpek, uint maxbuffer, - IO_CACHE *tempfile, IO_CACHE *outfile) +static int merge_index(Sort_param *param, uchar *sort_buffer, + BUFFPEK *buffpek, uint maxbuffer, + IO_CACHE *tempfile, IO_CACHE *outfile) { DBUG_ENTER("merge_index"); if (merge_buffers(param,tempfile,outfile,sort_buffer,buffpek,buffpek, === modified file 'sql/filesort.h' --- a/sql/filesort.h 2010-07-02 02:58:51 +0000 +++ b/sql/filesort.h 2010-11-22 11:45:40 +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-11-22 11:45:40 +0000 @@ -161,13 +161,13 @@ instead of reading with keys. The number says how many evaluation of the WHERE clause is comparable to reading one extra row from a table. */ -#define TIME_FOR_COMPARE 5 // 5 compares == one read +#define TIME_FOR_COMPARE 5.0 // 5 compares == one read /** Number of comparisons of table rowids equivalent to reading one row from a table. */ -#define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2) +#define TIME_FOR_COMPARE_ROWID (TIME_FOR_COMPARE*2.0) /* For sequential disk seeks the cost formula is: === modified file 'sql/sql_delete.cc' --- a/sql/sql_delete.cc 2010-10-21 11:34:17 +0000 +++ b/sql/sql_delete.cc 2010-11-22 11:45:40 +0000 @@ -243,7 +243,7 @@ bool mysql_delete(THD *thd, TABLE_LIST * if (!(sortorder= make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records = filesort(thd, table, sortorder, length, select, HA_POS_ERROR, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { delete select; === modified file 'sql/sql_select.cc' --- a/sql/sql_select.cc 2010-11-17 15:23:17 +0000 +++ b/sql/sql_select.cc 2010-11-22 11:45:40 +0000 @@ -2557,6 +2557,7 @@ JOIN::optimize() if (!group_list && ! exec_tmp_table1->distinct && order && simple_order) { + DBUG_PRINT("info",("Sorting for order")); thd_proc_info(thd, "Sorting for order"); if (create_sort_index(thd, this, order, HA_POS_ERROR, HA_POS_ERROR, TRUE)) @@ -2734,6 +2735,8 @@ JOIN::exec() int tmp_error; DBUG_ENTER("JOIN::exec"); + const bool has_group_by= this->group; + thd_proc_info(thd, "executing"); error= 0; if (procedure) @@ -3019,11 +3022,12 @@ JOIN::exec() } if (curr_join->group_list) { - thd_proc_info(thd, "Creating sort index"); if (curr_join->join_tab == join_tab && save_join_tab()) { DBUG_VOID_RETURN; } + DBUG_PRINT("info",("Sorting for index")); + thd_proc_info(thd, "Creating sort index"); if (create_sort_index(thd, curr_join, curr_join->group_list, HA_POS_ERROR, HA_POS_ERROR, FALSE) || make_group_fields(this, curr_join)) @@ -3249,12 +3253,21 @@ JOIN::exec() the query. XXX: it's never shown in EXPLAIN! OPTION_FOUND_ROWS supersedes LIMIT and is taken into account. */ - if (create_sort_index(thd, curr_join, - curr_join->group_list ? - curr_join->group_list : curr_join->order, - curr_join->select_limit, - (select_options & OPTION_FOUND_ROWS ? - HA_POS_ERROR : unit->select_limit_cnt), + DBUG_PRINT("info",("Sorting for order by/group by")); + ORDER *order_arg= + curr_join->group_list ? curr_join->group_list : curr_join->order; + const ha_rows filesort_limit_arg= + (has_group_by || curr_join->tables > 1) + ? curr_join->select_limit : unit->select_limit_cnt; + const ha_rows select_limit_arg= + select_options & OPTION_FOUND_ROWS + ? HA_POS_ERROR : unit->select_limit_cnt; + + if (create_sort_index(thd, + curr_join, + order_arg, + filesort_limit_arg, + select_limit_arg, curr_join->group_list ? FALSE : TRUE)) DBUG_VOID_RETURN; sortorder= curr_join->sortorder; @@ -3287,6 +3300,15 @@ JOIN::exec() Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF); error= do_select(curr_join, curr_fields_list, NULL, procedure); thd->limit_found_rows= curr_join->send_records; + if (curr_join->order && + curr_join->sortorder && + curr_join->select_options & OPTION_FOUND_ROWS) + { + /* Use info provided by filesort. */ + DBUG_ASSERT(curr_join->tables > curr_join->const_tables); + JOIN_TAB *tab= curr_join->join_tab + curr_join->const_tables; + thd->limit_found_rows= tab->records; + } /* Accumulate the counts from all join iterations of all join parts. */ thd->examined_row_count+= curr_join->examined_rows; @@ -18385,8 +18407,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) { @@ -20033,7 +20073,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 @@ -20135,9 +20175,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) { @@ -20484,7 +20526,7 @@ SORT_FIELD *make_unireg_sortorder(ORDER pos= sort= sortorder; if (!pos) - return 0; + DBUG_RETURN(0); for (;order;order=order->next,pos++) { @@ -20501,6 +20543,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-11-22 11:45:40 +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-11-11 09:40:06 +0000 +++ b/sql/sql_table.cc 2010-11-22 11:45:40 +0000 @@ -7105,7 +7105,7 @@ copy_data_between_tables(TABLE *from,TAB !(sortorder= make_unireg_sortorder(order, &length, NULL)) || (from->sort.found_records= filesort(thd, from, sortorder, length, (SQL_SELECT *) 0, HA_POS_ERROR, - 1, &examined_rows)) == + 1, &examined_rows, 0)) == HA_POS_ERROR) goto err; } === modified file 'sql/sql_update.cc' --- a/sql/sql_update.cc 2010-10-21 12:18:25 +0000 +++ b/sql/sql_update.cc 2010-11-22 11:45:40 +0000 @@ -479,7 +479,7 @@ int mysql_update(THD *thd, if (!(sortorder=make_unireg_sortorder(order, &length, NULL)) || (table->sort.found_records= filesort(thd, table, sortorder, length, select, limit, 1, - &examined_rows)) + &examined_rows, 0)) == HA_POS_ERROR) { goto err; === modified file 'sql/uniques.cc' --- a/sql/uniques.cc 2010-11-05 22:14:29 +0000 +++ b/sql/uniques.cc 2010-11-22 11:45:40 +0000 @@ -577,7 +577,6 @@ bool Unique::walk(tree_walk_action actio bool Unique::get(TABLE *table) { - SORTPARAM sort_param; table->sort.found_records=elements+tree.elements_in_tree; if (my_b_tell(&file) == 0) @@ -612,19 +611,20 @@ bool Unique::get(TABLE *table) return 1; reinit_io_cache(outfile,WRITE_CACHE,0L,0,0); - bzero((char*) &sort_param,sizeof(sort_param)); + Sort_param sort_param; sort_param.max_rows= elements; sort_param.sort_form=table; sort_param.rec_length= sort_param.sort_length= sort_param.ref_length= size; - sort_param.keys= (uint) (max_in_memory_size / sort_param.sort_length); + sort_param.num_keys_per_buffer= + (uint) (max_in_memory_size / sort_param.sort_length); sort_param.not_killable=1; - if (!(sort_buffer=(uchar*) my_malloc((sort_param.keys+1) * + if (!(sort_buffer=(uchar*) my_malloc((sort_param.num_keys_per_buffer + 1) * sort_param.sort_length, MYF(0)))) return 1; - sort_param.unique_buff= sort_buffer+(sort_param.keys* + sort_param.unique_buff= sort_buffer+(sort_param.num_keys_per_buffer * sort_param.sort_length); sort_param.compare= (qsort2_cmp) buffpek_compare; === modified file 'unittest/gunit/CMakeLists.txt' --- a/unittest/gunit/CMakeLists.txt 2010-10-18 11:31:18 +0000 +++ b/unittest/gunit/CMakeLists.txt 2010-11-22 11:45:40 +0000 @@ -206,8 +206,17 @@ IF (CMAKE_CXX_COMPILER_ID STREQUAL "SunP ADD_DEFINITIONS("-library=stlport4") ENDIF() -# Add tests (link them with sql library) -SET(TESTS dbug sql_list mdl mdl_mytap my_regex thread_utils) +# Add tests (link them with gunit library) +SET(TESTS + bounded_queue + dbug + mdl + mdl_mytap + my_regex + sql_list + thread_utils + ) + FOREACH(test ${TESTS}) ADD_EXECUTABLE(${test}-t ${test}-t.cc) TARGET_LINK_LIBRARIES(${test}-t gunit sqlgunitlib strings dbug regex) === added file 'unittest/gunit/bounded_queue-t.cc' --- a/unittest/gunit/bounded_queue-t.cc 1970-01-01 00:00:00 +0000 +++ b/unittest/gunit/bounded_queue-t.cc 2010-11-22 11:45:40 +0000 @@ -0,0 +1,423 @@ +/* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; version 2 of the License. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ + +// First include (the generated) my_config.h, to get correct platform defines, +// then gtest.h (before any other MySQL headers), to avoid min() macros etc ... +#include "my_config.h" +#include +#include +#include + +#include "bounded_queue.h" +#include "my_sys.h" + +namespace { + +const int num_elements= 14; + +// A simple helper function to determine array size. +template +int array_size(const T (&)[size]) +{ + return size; +} + + +/* + Elements to be sorted by tests below. + We put some data in front of 'val' to verify (when debugging) + that all the reinterpret_casts involved when using QUEUE are correct. +*/ +struct Test_element +{ + Test_element() { *this= -1; } + Test_element(int i) { *this= i; } + + Test_element &operator=(int i) + { + val= i; + snprintf(text, array_size(text), "%4d", i); + return *this; + } + + char text[8]; // Some data. + int val; // The value we use for generating the key. +}; + + +/* + The key, which is actually sorted by queue_xxx() functions. + We sort on the key only. + */ +struct Test_key +{ + Test_key() : element(NULL), key(-1) {} + + Test_element *element; // The actual data element. + int key; // The generated key for the data element. +}; + + +/* + Comparison function for Test_key objects. + */ +extern "C" +int test_key_compare(size_t *cmp_arg, Test_key **a, Test_key **b) +{ + EXPECT_EQ(*cmp_arg, sizeof(int)); + + int a_num= (*a)->key; + int b_num= (*b)->key; + + if (a_num > b_num) + return +1; + if (a_num < b_num) + return -1; + return 0; +} + + +/* + Generates a Test_key for a given Test_element. + */ +void test_keymaker(Sort_param *sp, Test_key *key, Test_element *element) +{ + int key_val= element->val; + + key->element= element; + key->key= key_val; +} + + +/* + A struct to wrap the actual keys, and an array of pointers to the keys. + */ +template +struct Key_container +{ + Key_container() + { + for (int ix= 0; ix <= sz; ++ix) + key_ptrs[ix]= &key_data[ix]; + } + + Key_type *key_ptrs[sz+1]; + Key_type key_data[sz+1]; +}; + + +class BoundedQueueTest : public ::testing::Test +{ +protected: + BoundedQueueTest() : m_key_size(sizeof(int)) + { + } + + virtual void SetUp() + { + int ix; + for (ix=0; ix < array_size(m_test_data); ++ix) + m_test_data[ix]= ix; + std::random_shuffle(&m_test_data[0], &m_test_data[array_size(m_test_data)]); + } + + // Key pointers and data, used by the queue_xxx() functions. + Key_container m_keys; + + // Some random intput data, to be sorted. + Test_element m_test_data[num_elements]; + + size_t m_key_size; + Bounded_queue m_queue; +private: + GTEST_DISALLOW_COPY_AND_ASSIGN_(BoundedQueueTest); +}; + + +// Google Test recommends DeathTest suffix for classes used in death tests. +typedef BoundedQueueTest BoundedQueueDeathTest; + +#if !defined(DBUG_OFF) +/* + Verifies that we DBUG_ASSERT if trying to push to an un-initialized queue. + */ +TEST_F(BoundedQueueDeathTest, die_if_not_initialized) +{ + ::testing::FLAGS_gtest_death_test_style = "threadsafe"; + Test_element foo= 1; + EXPECT_DEATH_IF_SUPPORTED(m_queue.push(&foo), + ".*Assertion .*is_initialized.*"); +} +#endif // !defined(DBUG_OFF) + + +/* + Verifies that construct, initialize, destroy works. + */ +TEST_F(BoundedQueueTest, construct_and_destruct) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); +} + + +/* + Verifies that we reject too large queues. + */ +TEST_F(BoundedQueueTest, too_many_elements) +{ + EXPECT_EQ(1, m_queue.init(UINT_MAX, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + EXPECT_EQ(1, m_queue.init(UINT_MAX - 1, 0, TRUE, + test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); +} + + +/* + Verifies that push and bounded size works, and that pop() gives sorted order. + */ +TEST_F(BoundedQueueTest, push_and_pop) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + for (int ix= 0; ix < array_size(m_test_data); ++ix) + { + m_queue.push(&m_test_data[ix]); + } + /* + The queue should now contain [0 .. (num_elements/2 - 1)] + plus one extra element that we are not interested in. + */ + (void) m_queue.pop(); + int expected_key_val= m_queue.num_elements() - 1; + while (m_queue.num_elements() > 0) + { + Test_key **top= m_queue.pop(); + int key_val= (*top)->key; + EXPECT_EQ(expected_key_val, key_val); + Test_element *element= (*top)->element; + EXPECT_EQ(expected_key_val, element->val); + --expected_key_val; + } +} + + +/* + Verifies that push, with bounded size, followed by sort() works. + */ +TEST_F(BoundedQueueTest, insert_and_sort) +{ + EXPECT_EQ(0, m_queue.init(num_elements/2, 0, TRUE, test_key_compare, + m_key_size, + &test_keymaker, NULL, m_keys.key_ptrs)); + for (int ix= 0; ix < array_size(m_test_data); ++ix) + { + m_queue.push(&m_test_data[ix]); + } + + uchar *base= (uchar*) &m_keys.key_ptrs[0]; + uint items= m_queue.num_elements(); + size_t size= sizeof(Test_key); + // We sort our keys as strings, so erase all the element pointers first. + for (int ii= 0; ii < array_size(m_keys.key_data); ++ii) + m_keys.key_data[ii].element= NULL; + + my_string_ptr_sort(base, items, size); + for (int ii= 0; ii < num_elements/2; ++ii) + { + Test_key *sorted_key= m_keys.key_ptrs[ii]; + EXPECT_EQ(ii, sorted_key->key); + } +} + + +/* + A test of the function get_merge_many_buffs_cost_fast() + */ +TEST(CostEstimationTest, merge_many_buff) +{ + ha_rows num_rows= 512; + ulong num_keys= 100; + ulong row_lenght= 100; + double prev_cost= 0.0; + while (num_rows <= MAX_FILE_SIZE/4) + { + double merge_cost= + get_merge_many_buffs_cost_fast(num_rows / num_keys, + num_keys, + num_rows % num_keys, + row_lenght); + EXPECT_LT(0.0, merge_cost); + EXPECT_LT(prev_cost, merge_cost); + num_rows*= 2; + prev_cost= merge_cost; + } +} + + +/* + Comparison function for integers. + */ +extern "C" +int int_ptr_compare(size_t *cmp_arg, int **a, int **b) +{ + EXPECT_EQ(*cmp_arg, sizeof(int)); + + int a_num= **a; + int b_num= **b; + + if (a_num > b_num) + return +1; + if (a_num < b_num) + return -1; + return 0; +} + + +/* + Generates an integer key for a given integer element. + */ +void int_keymaker(Sort_param *sp, int *to, int *from) +{ + memcpy(to, from, sizeof(int)); +} + + +/* + Some basic performance testing, to compute the overhead of Bounded_queue. + Run the with 'bounded_queue-t --disable-tap-output' to see the + millisecond output from Google Test. + */ +const int num_rows= 10000; +const int row_limit= 100; +const int num_iterations= 1000; + +class PerfTestSmall : public ::testing::Test +{ +public: + /* + The extra overhead of malloc/free should be part of the measurement, + so we do not define the key container as a member here. + */ + typedef Key_container Container; + enum { limit= row_limit }; +}; + +class PerfTestLarge : public ::testing::Test +{ +public: + /* + The extra overhead of malloc/free should be part of the measurement, + so we do not define the key container as a member here. + */ + typedef Key_container Container; + enum { limit= num_rows }; +}; + + +/* + Test with Bounded_queue size == . + */ +TEST_F(PerfTestSmall, insert_and_sort) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + Bounded_queue queue; + EXPECT_EQ(0, queue.init(limit, 0, TRUE, int_ptr_compare, + sizeof(int), &int_keymaker, NULL, keys->key_ptrs)); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + queue.push(&data); + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], + queue.num_elements(), sizeof(int)); + delete keys; + } +} + + +/* + Test with Bounded_queue size == + */ +TEST_F(PerfTestLarge, insert_and_sort) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + Bounded_queue queue; + EXPECT_EQ(0, queue.init(limit, 0, TRUE, int_ptr_compare, + sizeof(int), &int_keymaker, NULL, keys->key_ptrs)); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + queue.push(&data); + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], + queue.num_elements(), sizeof(int)); + delete keys; + } +} + + +/* + Test without bounded queue, i.e. insert keys into array, and sort it. + */ +TEST_F(PerfTestLarge, without_queue) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + keys->key_data[ix]= data; + } + my_string_ptr_sort((uchar*) &keys->key_ptrs[0], limit, sizeof(int)); + delete keys; + } +} + + +/* + Computes the overhead of setting up sort arrays, and rand() calls. + */ +TEST_F(PerfTestLarge, no_sorting) +{ + for (int it= 0; it < num_iterations; ++it) + { + Container *keys= new Container; + srand(0); + for (int ix= 0; ix < limit; ++ix) + { + int data= rand(); + keys->key_data[ix]= data; + } + delete keys; + } +} + +} // namespace --===============5232765826283828807== 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\ # w3i2chwryj7c1sn2 # target_branch: file:///export/home/didrik/repo/next-mr-opt-team-\ # wl1393-merge/ # testament_sha1: c44477b5a639d22a2f3b53813ccb263faf4948f0 # timestamp: 2010-11-22 12:45:49 +0100 # base_revision_id: tor.didriksen@stripped\ # rpgit95xb2sotnfk # # Begin bundle IyBCYXphYXIgcmV2aXNpb24gYnVuZGxlIHY0CiMKQlpoOTFBWSZTWQfJE+oASCR/gH//e+97//// /////r////9gY/4fU8TfHvSXx7d13Ps7Wh77X1jnjpLzue43teOvU914+wD18jmMuhqEm3u0vsaW +CBXvfeG6AfE+6s+nXr4Hwavl8dJ53Y+3zLp92ve9vu8h7u77273a3dq3b7zznrlEYzmYHbrhuzT 273zvgHju7oN7ADus0A0NaK81N833b3mXk+7WHMtayHbIpW7rWPTTr2eujme+5nN7DhTDNSZXy71 reavfKL5958R9270G93u73vM2Zz2AKelBtj3c4d2U5SJOjuz7u6ht3Pdq9gx3bWugQjQMiIaLwHy 6g8NG+veeqL7wvTHCpvtQAyPvYdYSRBAEyZABAINE2iaekaqf6Ro00xTMo1NHoj1G9SbU3qg8k0M j0CUIGQQmhGk0U80U9FT9PUpvVPUH6o2oAADQAABkAAAwYIgkCFNlSfqn+qntMonptTU0HqZBiZA aMmEPSaANAPUAGgAk0ohBNBBoTBTJmian5Cn6IwInlNPU0ZGj1PUyGjQyPKaD1DQzUEShAgBACYC YhPQBCbSaMgKbNCaNJ4hNojJ6mmh6jTQBUkQT1NAIETQymE1PEaTNGp+qMg0GQB6TTagDQAAADyn OoeI+NFdUQGEB9RAT+6AgBX+O2hfgrFYgwiRiJIhGCkYKRgqEUAbQ/7GBKJ7VblYkYsIEYJGJGJJ BBugtQbRKWBYC5AtAk+wkLJD5UhZIfZQsh9pCyHzS0+do5NHLEVyBCMGMEjCJBjFUpMhVii5YxJL CUVCYklpIopEwWMFjBYwWMFjRJNSFSkqIFFAhABEAHZoALajp7e3t7e3t2CRgEjdAra26dvb29vb 26BIsEjdLe5uVTjt4e3t7e3CaJ3W3t7e3h5e3t7bJhO629izCzCzCzVZuWYWYWRYYXYWYWYWYWYW YWblmFmFlChhZhZhZhZktFyWi5LRclouS0XJaLp169ZM5owSQkGMhyIQ22GFP/v28/Y+HUmSVIo4 spbf8tr7SZeDPgP+kLIhzRnHGqKKjp16Gd6V0jHDDoTryFA/az7vyP4PjydkgJm8efOvZvc96w0t pY//sC/NjpLOHHVyGjzm5Dk0zXXi+hroOMnM5Ou6m1fyf1XPlv5eDtBT68cZHHuv1q9MVMefj8nR TPnlycCjFwkzO36K2whfohQyFz/dKugx7v8dWnb/8/y5/wny51dX+Nf+W//Ckj09zkO1tXT2yidx KGzpgcWeO83/0dPZt/31UddLwdmGn5NtP56YCFhWB05s+CdjdMn+f39oQZ/pgxVCHjj/ju5POQj4 MJgNDCEGZOlvrWqFIe3RmlY/I9MFCgd0eV2KnR1Wv/T+yR2RqpcqyZA5ewmbUlmW/2xsfmk9fd9N J9X8sqTZINektlovm6sSDTC1lqclSi3WlThZBWXlmV1N3+0Nq8jPLOTqpem9d6J/dWFf64w9OrXW W6uuh+5IWKNZaKme8pCqgmyoIaUEz7+yovui4MXDsgbuEflcaoVb3wf9I6OrLTHly1Gx5Mka1qem 47X6u73QuVGx90M1oLhwuTmhiTQQyr5Wsw3LVTwy6GH36vFgYgxraukRZx7vw7x049fobGWQ/veg 2loCmvNZfPVF0spEi7foXss3VIWRcYZriQRBocfk+3Hav+VnXs3MdfXR58YiXfPRy/8vxGfD1V2S 1JKPNHGrbVasmCDrjaqyOiNCA321J8GBejm/s876Pl0MxW5Zt+oDbID30E8Ii2fHbi4mZo9obwSD MmtstkI9nsfPVgaqkjrYCbdc+uDsr5afINRUKrWfKq917BsLwxDfPVMmrSWjSF63re+RyucGQvb3 ACthJCwF1bhmAzBmhlrWtmyL5IwCjmoAVAzIZkMnJvb28jBGCcE4Ozi0bNnAEgoh0IQ2AsALAFYK yyyyxqm6NbmLBcZQxDExNJpNI0IwTgnB2cCjRxMKlSwsLaqqreAMk5m2ADICyFyGTk33t6Xpet63 uTeWbN9b5mS52srK4VVVcZ7z0QOznRYWOeRwGjzXNZWVpc1zVGgKY4obR2trawtLS2mA4N0No709 beae7e7e7e7aAqghBW3tDce6e7ere7e7e7aFNGBMbj2hununsW9i3sW9i3Ww9ePATTDKKrKiGpZ0 koW2mlplfWK31WHxeHsWofrPRunLhcyj4uGOBuuz+zaFScyBUJ3mQUgg6DqKYLBHZJIDvqlZ5d8g SaHdlhCtKv8pYUo2mggn3CgGehMm9ybtqXVw6KuS46emEPNdoylST4DCj3CIRLiYha2QrmEQYK3Y cBehkqAoAsh2O1QkwnctFXfxaEnd8jquUggMQItEaCAPw+YYs8+/rB2L7SSOxdvzvsBOTbKVUta1 M6zrWjaryedzVYWKzecIZxqZxidqyMZvhcbe71fFb3esLPGVeNhGlxxvC4ssK97SlUvWs6i3ipKt l6HymUpK0poul+9DXrr8b29mlE++2d5pS0MSkzbuY97G54m1FmW9BD8fbiQgyZZw8oQISQwpTLPS ROfsAiio1a81Z7/WewrfdfxhB1VBVHMQVVe2igHyRTxgoVioF5EPX/sbvv22RS+GEMZwzCIuMZAT a2KyczDT/zdg1YaphNmTrYEtpOGKSjArKwq7qFo/VFFNiuEaDBL/orWDIFoDlBwgWQPZnq1YyRkQ iSCfAicn55nBAUIdlgV4JSIRBPA92MMoTmboVJ6koFmUKDEABBOwz22dCQ0QugOqCUYKWggHLlvz DZ0zF+PPTHQU0sSIwzMruAnh7uh1ceJTzIC6MYQ6DMYjHZL5aMRYTTsxU3vY5h1ZW20fJdJqX2Ws KCX8MyMUNuYqscy8w4eXLOhriEnMFp1DxM8kEp97SS29+jtS9GmsliXxlU8G+k1Vkzz7cFVzjrt1 4vNXzlb9XiDuIxEAEgkCaT1InJN1aptg48/K3GMkqxJr8crv0qH1V2HC9MktRANOFz5hIDr1D+8p 9R0ZmLKgohGZ/AuhSEuj+NBt8iQeoeFBrGB+MyxiH/VkG06/E0aKxpZZKLC6/L0dbQiyNnxCVNxA Dl1T9jzp9qP4PfGjCw7Gv+veZ0hVW4MvbHFINLMwfMgVQQ4BBkgsUVZIosWLFgKRQkJJJAkZFJEZ EJFPVnHHpOlXXrzLzZDIBoDIUv80IXze34e/4cN86B5kpxBba9PL6iG3+Qd4efduwPyTfpJjKumw 7NOghrtUiSH3rFpvQJV4WRz3Yajglw7Q72c72ZGUWGMYhpKo9hi9Z1zW2Qcsrwr2thwW88QQqPWG pPNmSq2W6kopIso+em29kQpe2+p5nTauZul8Jufxe4bn8uln5+UpzJ2edbzEucebS56bhOym90rZ V2s7CYXTs2adqi1lJTfQlIUb28UeuwDjPOUpiImcTDLgD8fYevFNGtdVrnY7JIJB8nSwa3jMTxik kJZWLalEqXiyXUuqWUKrJR3Epax399bbLpUstrp87tqWiKXT0m+4Z1YXHXTXCPCDXbWqpLI08xa4 raSG6Y0np7WlawuzzuolbiiiymosVvGUJxpZfl5a1rfPnCGfSuy3516hgrq0HCdYOzT/z9d64CeJ 3hx3Jgr5bvcpyHlzWdxMaG/o16pA7E+O+NJc1QI7Z+KbGn3/CxJCJ9iuwne99fxHzSnKCah4lFx8 efmLg/EHiVDf39d7IPGa4BTRr4iVQvZqJuJZ1uXEIb+ocwQTUEBXSCQV4ui/PaOpWB/JCF/No4j6 vYbetrjtFTeGmZ1SFWtjaJweprw0cVNyp0LMvA99N9BUpPCoqosojDH/lgBmHO06Ktr7Uc0EV+cu WvQuT0cXcomTgsmfd1mdIWUpaoIpfSC9IMlVwu698EawLmAVAJhhMmG4sZY+dwwX0K07WrGw0Y0x kfA/SY+VMSXLzV8nQWn0y9xdlWLmJHIEfWF2N3kEGv9Af4Fvhctl/Q5uuFLsPQ+25ypvlK4Q7pLT GMDkHIPQHOARJ3l5bFLxXgSZFiYZ7XJMHKEF34ygVjobOqCT+fogodAYBkMRRku4QF6r6xi2YzYc 3T7u87Y9W7in1kB+3dXE4GnEkEcSe6UJR3e+VC7vttqqmNUYKmGBiOMDrvoO1C57qa9IZ5nhjEW4 71BPYB7fR2vW/8QtfiHgUlDMrJOwdWiyzL2q4oN9U9QxAYZRsk3olpb+86Er9qEuFPjOkrmFd1OB kaqe4FPcrqEtdelWwvzf9pJpJSeOso/6mU9tzTZPkv6n0XtzpJluc/C3kVdCocnX5PGywKAav08+ 3xy9L/r9Vh3neb8uLLNoYwYhG0gG2MyBw2/bLUy1O+1URgoWQ3S7WLTWU+jr6rNFPJM+I9Nrb8CD ZbO3XLpbpn7MDuvhjSal+v1GNE9Lb40G8aUpurX7XXPLzViPBIMfWPSj1F8lxcjJJLC5SjKkWIeY 4X9jhypXTg08/HSoS/KOrHmsnj5a6xtSRJdL7mbeXPYItaYFhiLn62J13lVZBInN/Tt1st+P7LeL 82ZK9s7PSWpzm1lU1pBjylc2VM2Kp1HyTh3zzX2GkKqkjvhNnRf2f6M5TXgxNHLnB56IdVxmwlSy Cmj9K3/L2a+n5JlJWGkfZpIb7tO9lQzU72gU0p2Zpa8pkJydqPZrnQx/sgnrNZ1xBz4AyOZkJt2A zINUYkbybnAuzJ12/C9ElVkZ6NaS/jIkF6x8oBm14dcd5RiJk7GZAC9SJz2huqD7eVCobglcWVWl R6HHQp+fFN9z1lsuOiktf01D61qtDRG36d9FyI4XXwpKtUGp+Qf1Riv7AKuHMfWGLIZ93EkFknad KKS5onfzF7Ge3W6tEyRLfhb0JbXj6024FYdvzL1Mz8yGG+ZXJ1V/ezNLqJ2pLqu5kzBIm7FLxntK tbaKc1aypy72wzLxr7wZSb7EC7bwt1Nar7PTCunYYZeySnbsmP+fbx/U3wO6qCu7yqlWf1n8OOyL bDsZ44MYlx1hQad0DzkDk1hCXhCuASiUuO6IRKSklFTgpuSVC+CiQYpqzhg1Hquz85SBM+nQPcVQ otOgv02nZyWHoaulstWy23CR0RYYohrO7tbjuzLYutEJwgNRautArTyz9Hl8mim1tLbhvdDhfHRh 14ETV8/La1aDs7U6cPPo3fBOXbPvUp0qyT5bZi6yEa5LoetCSmV27ajsFPhhjZWjpJGXyWT/OZn6 fbqldF4xPB9ZSKk03LYUtpshWvQMZ6o9AhTWPnqL7b67jIg2nhptOueyOGdnDRdSNffA+dNVzqri qbGI4VmuTuO3YDpUKs3IZ4DWjnN7ody8+zNY4U80cwLp3sVy8sAD3lOw81aruwvoreKKZvxLK86n zV1lnsl2NnsqWTGvYWR91fXy3H8cWm6af5Iie0P0CMDYJCoJbVwy7DU3HjtpKx6+iUt7W42Jq+DG OvaeBGoyq2PppnJjVSbusQKT3sHdpJdidWfwNqwZmkJsga9YxNvet7zuIrDT5xQlJrXaEN0YMaLm osYd7rMb1bV7n5xJ2ULhzjlXJobQ4gj5gPiA6NozDAinXsqIjaiVlGEu3KLNpedc3UPtX6etTNXy vmvps72hvfZum7JJXlKV93g2xWVD8lfuaYvh8O7Abw9s786MZjCoVUIihupeZFeE4qmGPcWWapTK rj1PFtG1pK2R27d4v0CicTEiRORaZ2FPsAw8V2mijV0PvGY9FmxNR1UuoX2kYwaEYR6ZRYobYYUW qcayagy1NGE+rhJJlJ9KhLsOkYpv4VY8R0wwuE5g4QRNrqVG+WdpVIUFVAVRVQTVmP4+4/bBJ/63 HGIP1AvsPb9PS36ofJ+mED7JE5y++j7ov970t2Gzp++iVnTb5IkTufRy+z4/Np018epnGQyGfaQZ hu/74sMpNQnpWlTlpFF9OiAlFbb016S5+7EN7n6PKTMWaPEeXydzz/L7+fsX1OyHMCCCCCCCCAgg lFFFFFHA8TwO49s7jqdxoalGpqampqamZqaljU1NTU1MjU1NS5qampqXNTU1NTI1NTU1NTU1NTU1 NSxqampqamZqalGpqampqamhqNTU1NTU1NQ2DluD4fx9v0ZPHbPH3fp9gPgQUEQUFBQRAUIiEUBQ RAFCIhEQIoQUCKEUAUBQUEQiIAoKAoEUFCRQBQUAUBQBQg8erQwT1v6GYcBYkqCDFLKQRYNkoowI KCMWQjgFPlAZVbJVSllVPoq1xUKFD66bPjXhM4ufvWfJIMBBknBiY5fv5z+qgUgp+WliGOpNvwme h40+n8xYuoYqXROs+WgGpnm8KBBJWex0eyzlY432vMa/04Vi5N62qTM1HqtfN5VfqSdhlYXseEcF twQDD/O2x9DGR9ThWaxQAekBhqAix0H1le3Xvt9nL/T7XA3R7x6LPQe+oyKCig8SiixYKKIooKKI ooKKIooKKJRRRQUURRQUURRQUURRQUUTd/1RruaehXbWUbGjiyP4fkiHKkWs+jcOq9QzpjVoMafw t7IVNgMMgUSHXoaOM7Dd9leU7igQR1BnHttjLZ7g5S0TquMV20yQsEDGDImNEY/GEof8dhEICtY4 H63dlUhl5JbIK/e6oYPubXVT/GXyz0smbZ5ThHrv5UZGbfmojJZaPM2P2UlFVk/J2x4duFm6t6+l ixRbob+2cvicjPsYX4sGxeZ7afpxh0vCFBh5Xuj1vrGhZL5f09MqLwnBmo2Bmfe5Gn7fTdUU6NNM eyjGPztZWFH0R90Necc+H1MZDKVD0DX774CPn+lyFvG7CHZ7yB747IGt+6HP9s+N69reAUKVcHzY snKF0NeuY7J9Kj2N9fpoIUN8DYEGEKB8knLbDBggB+rc8R9KxgzOzRXLL5re4a4nbU0KLnNHa84u 06YGatr61bn5XMvIdUmmBv8rtX5UDelHn8MiXkYb+hYEQGS2/2wPUABD5/mX+tQ49GuodMdZZzhd fO2ylXk5fiU5iasX8+b1pC1SybSWwxopOQTFLdqp7svyZpm0SyogxA9zPB+Pb5490nWbFbY1O2Mt 8bx3a962lqxqAiKDmctd7tZQq6b5ZB9Vb1ErD1Hv2gwyd7XfDIKEpEn5SgQlIkSCE1x732Sa6NG9 CZWU/wiJ4T4RkcYIFYyD3ez17xm0aeDbUim8BEsYCgZSoetTPupk3UskEjIJCRYIWiwpRXTqoXxD xzy7E9twuGY6/kUTIjDXnXGLJKHDWeei5lRz76fJxfn02U1021RiSbsP57ZWzRRe6NzuckxMbxMT RH4mvZntgvLByliXuM4nhXwYx7T9Tn18ACQLqjiq0vKHxri+i8iVpNRKFT+6vviMRl+7LtTKolQ8 8m2r+XogQWnGaVapeamMRSx31bMLpNeOzsUnXGPiEpQ107qheIww2txxhqkqUtIUipQSg2s4FDYi B4bveNihvZ4lcMMKLvXTSuROnbXPmbMuiuKMTYt2c6o0ELStXmkvi8rFflnDrilew+5Wda0man+p noxShyWnuF9NXKug7Ws2DLQGN6gyTsHPVbea646r4XrMKAYGPZPaPqHznznzn2z5zUwYLGDBgwYM GDQwYMFzBgwYMGDMwYMGDIwYMGDBkYMGDBgzMGDBguYMGDBgwaGDBgsYMGDBgwYNTBgowYMGDBgw YNxgYMGDBgwYMGDB8fuHoAhnzhxcd/VWnhLxA3UbJMDaUH3EWMJIfVzVKr6svDw/+5uOtLVt0Hvw bN19+FvqENbob7SeQbNzztRYMGqaxs2Y1AQzt+HGclHqR5m56Lu0yhHsDn6+bZBlihShWzKr3+XB Tii4NKD9McpLcAQaOdsFQLHZfvO/sGj8UM3SaiDYZvskqCgzsqKFbDuQRhRNVzcVhKsUJKUgO7bv dd1K0vPylWuzU1eSzsNCNlaJg6eYb3W3vKdoo8dWrNYqqpWTZmvcK1x80ISi2rOcyZNx6Ot3GpYZ t9+j0sZvApMXa+/BQx44odyF/XTHjzfFAfBTFeW+0fAV3Ov5SvGNcGvnnld9fT02d5zF3TjzGPX7 /vnAaKP2/xh0diqOl3Nrwc1YYMNBtpcYCPCaHRqnyaMXZNOkpGYjKFtY2m/UZYWCEk9Akk3e1icj nBPGBQQEk4HaTicNipjk1KwLO9jBhPQRsnrdSbQMYnRLCyMiGgUBTUCrVaMuBK/FHPCMBT6qESMS eqiUgg8iz4H2ghpK2Pf/F9JXTUxTRRk1H/O1NL95n0iGesOgPE+TnNYE7OcenpnGM9lznvqvW1fG cVyVxG+/jkl3flRutdFe2Yjd15sEG3ZhwgIu4GJkMTcsT1kTy8E9h6z2B7DMBDQvcKcMt6Y0tBdK gvUFmUsL1BdwsL1BdwtIvUjapG1SNqFVMUNdtlkbIlhJVwE9hGLXI/lwEhTZFzICTO17CrlfArQ5 3lvpCsNzN7oySskNki6ob2QMoVRySCm5VFTNKsRc9rju38NHajY3nE5mpxMHI+M58a4rN7gZT5s3 EtF5nM5aS80pZRczMzicTicTicTo0SJnGSWta1PU0VFFJhSTIqLSlNa1p3SaCCoEJvmp3zUmlMbj Jw0gUlM0MDIDBNlSDFsWociBSOSSSSSSCSNvdVVYklcZ43QO1rWmTtSVve97vWtInccre973etaA G5JOIiIpERE4iIicRERSIiJREREViIaIiIiLRCxERERDzh0hZxOiVSSIIVARQAKoIjIyg4gAAG4X 3I1dFmHk9CXoUPoUaOzgiSMry8Xi2mi/GaMsGszyWW1ZvsNmiaJoaIhDDDAOvCDoFWbKIIh2C/mF 4E2IGDYOQcgwwwwwSPsdsHsiLBymWEWcHJpK1pcRaTEpoMaWdx0m0+Wzc6HQ11FtImZWDcUlsM3B /AKkUJCsrsnA97biKlxaVlKhjRYvdDuyQBtO4eRBHGBgU+EaViyO8RipggjFsMNc1bKID0vK6K6o imaIvJiR3YhS9BVFVzgymEyaGpTAmQpljnJnICIYmZmSqpSP16Hni7R2dXRweDe5LuKrO5jfhfcY lsjE4/7N4+5e/ezfPUel1AyBIEgSBIHTEWWRkiJWEFhBQkBIEMBFBJrkzBrTti7X0NtLjILQ0iEa 1aXM0+SKIyD7tIWpOKLRKSVHMtEtHOwtHPly23mxcQKUf85uKDFEC6yBnxmixQvNN1AFGla1Z0yO 1bUV82tIyCqIKoYA5PyJhIYULFIlzJZBYvceTrfbdxrtJxPIudTuOx1Op2NjqknF6K41zpPr12JP cW1O9c7HU6nU6nU6nU6np5IMb5uO9PBxdHNd0WWUsjB5E8w0sTf60cOmaXI6eaHuDW6wzuGeGaVl wwijhz0KqWAvNEouFNba8teGjX/2LbbkJIvoE96tZDgyBgFbRBBa5NHN7zJqFUUpIRsHyokk2Ms7 FSSbLC9o+88TJo9eDcnB0Us73e7iTC+VrklGXd27jwDJxtWBAYMbPB8BhxkWRkSAkGEddJcgYt9b xRqJiRtYN68ZWmi6ps28pZNKRyTOsR0EmNM286Gu7k5TPnfXFJEq8ppNpUtGO55UlC7N872l252X t96xFaYdrzXzfqTNFzhCaCpii9EkZgkGkjNsgzCnoWBK3YDGlRK5NI1QGrVzcO+Vb/3DxrhuMNhr WJHOtl3LY3ChZREBZ0v243DqG5LPQ8GO6II+MbUL6kMhJKCjS+P3OLe+kMOU1rmY5lzrvrYN8QnJ jUQktA4SloDMKy8mje28K3Ki3WKBY2CYMzibTjMSp2m02naBVTDXqdTnjN1dJ43RxbrcVVXY6lp9 Jn6eciQnKcppOU1Rkamtg6B0R4sX3cSwItLCBATJ92mhZoyWQWLFVssb4PViHn0hKJTaViaqu51J sZ/Y9SE0I9vNtg0F7TnJfe07MwvRBDu2y7mWUMq9hDb2V9wxaNDtBDEM0C2iAmfvew5PP53J2fSk joyeps0brvU7M3usRI5slLj3PQeg+Sj1Cjq+o56EIJBIdcUoRTcAlBIQuIGRqJ8jA1rAOwNSKfh8 ZyLI9IpiV6DohQVUiWBYU6AwFGBiGlALCu222xsYQrcSiohIuk2QVSFHUmtBT9FDNWu8nlJYmzwA HyGRRgJ02OOEBKYDIfnDQaOhsbHI6G33uAPnnW9dpWRDmfAdDmczmczmczmbGy0N158ld51hPGeM yqfItNQYgTYNidgVDIGydHaRAqItm0Er3zztzzye5XAIUHK1UyKzdcQQQE6dBKAmdMoUaPmINx5S zgBYtqw1bg3BS8xb8E2ijVNmx0OMlOLpPW4nXcURgWXzC4CUQuCMBIWmEsfQkTUVPidxTBYLoAnf oyIF4V5rkMh1SqRP7amiLDCKZOpaicjGWuMLINAgDyWwLQrMyiOFpRJlG+5Q2GWIOq5LAca9YKAY ARTpZq5DoHeHZLNsqYyc9zB1PI6nc0HIGI69A6BOtDuZsd90kdip5p9IDQUFDDXH0GgknV/NOTku kujVA88nTj5LGA4AhPC8BwDQVulSJbiYF5sLO+krC4CvVlZApDQEIUU7LiLxRs9rduJaqgS6OquE IbhFpgVr6V6lA5bisGDiVHeJCnFmOBMgbxzmeZUr4jX7tZSdJwPJcd63jh61sUV9ToQ0vpe84XS9 aMdXVwOzwcnL979bg875DiOYQDynOJAgsYhCPGiPgojcbC7lNpvB5w7Q6Tvz3371ktoQ1LRgFEIt BKIUWjpqgkkSSakhmIMmStNoHMRRrrRYZoQxaxd2lcnV6tViWJUdpSW06zcm8NE8+fx+1AuGA/AM hsbzkczmfV7GxsfEcDY2NjY2Nk9qUVM8TsmVp3OXgeCXba7rp1KcpzNzSUNxsmeXyy7M2fZs16sH GJqYhM8ohIOamhv8dThESxcK4OJS7ANYXOtdA41TJ0G9v6i5Q1xNKmo+hQcpvR2ZHNw3DNqGwmRG SSWVFRDwbHBPB1quQyEkovQSxc2Jki3QX9L4HsdstYMhO2dD5V+EBTfaCZyTPM6Hx10MGOupdA6B bolblRF77lcHD0zgMBRPD4uKW59qZKUcwuAwGwlH4PEvAp26Hr2H3Ny2NBoKzQmqUOVJ2JyS/EpQ EBbJNBMSGVJcHB4Tvs9BegkjHp4Lilp3qxCfniZlBYZGG80GJwJG5UlxUVlBVkdq0HM2Rw6RR3mP Mj5+hvc7vg3Od9DmO97XUCjoQe08AooVKJTyepI4r+Dwcz2zShfls6nTnYulg4VaLVCtWq1dNrNl s42sGVQzkyULzvIrcupW4WadpyVRlVWoKTnbNirXtOVVpeatWtnnSk1zMKBAWD4hoLg4XC4fYuFw uHsGAuFwuFwuFERxeODCaDAYEQTNSIGAd1ZBZLRYnbOc3pcixICJrQ5yiWqe89m8h6qG5hpudDoX 30qdLRleOh8B0nTJdltBBRGVrxpjZBojjWBYEokRhH9hfYn6m1up1jJsUVX0Ggr++7m3c3PkPLk7 Hsl99LsDCmLLAbA0CeUCcIHJ+CcJemj0CWmricS8NPsm/RInF5Phmm2ddXPXr4c9s60q/M5jGh6X F4mlM+Fwj3C4V0JnbKP3p5B3Ph5G5jcwl+V3DcN0lZU5FNlRtj3FMFenOAwFbm3mSkLuRebp5HT2 3kdRwDGM3qnh4e49afAK4XBW1RsibzU24q3nBwarrO3w3Yed3LtlLPoydTWWsdB5y9dkAoWwY9Kx UkLvXT3rX4IZVnFZZgLmVKHK6kIEY7jpFN84jgDiDsF6W7RL6CHJZAtlnmBIYechh4k0gNIcDgWV SoYPDcI2HS3xErq93z4rh3V71ebmQFQxjlT2g33zxk01sZGRqZnoMGxgwYMGDA+QXCAgICAqgPjb ZEbQYCZpdstJ9r7UrtttfS4CjCt7HPQYdOTHJniOQ5DlIf7qrzzyR+Zjp0SNyoaCXOevYG6IshJi YkErmPUjJW++OVvTYNg22wqag9UEgpogIDQiCTwMQXHWYSTRWORa98BgKyn2OKqfj8rR6KtQuFqO bJyJjwR5InSR+CRrm7Z2DYM22LKSPcVY7ClNED3NcQGQiVWyLT0jyN6SDqfhGitd24ki4DYGPVBB 6U1wcnQeWEsoKpuO/J9k6EEHg7Fy5IkSKCRMLioVJ3qsJmxPxORcUFJIJbF8S2di0LoXUuo6VwFe WLONfrVnQrFqK1f2raCDMDkUnNXoGSZXHSlvMQ4hcJUzlYKLKwHdWO6m86qGCoQ2LKz7y0gkmm4u XLcEb3rVDk1ippVh6TV9M71jS99tczM1NDMwek1NxvMGDBAQHyC4QEBAYdNtiMZ0GQrA9Ktp9W1q LlwNDoRYc1TgX14BgEtB0EpFnY0IjWi6MRyq0tLLYwGQkW5GPU4GcUVMnzS2Zqu1dNrQaCjrhH0i yOxo9i2jNk8lyGQr3DInJVTXqaCpbPdXI0xkMg1ll84M7mam51I1ZZ7UbAZC3Q4Nym7Gg4PrVH1s ud421oNgi5Pkw5rZKmH0MYDAT7EFKKX9CYlXpZq2BwrsGjqMd7qnpzypE7amnHqOzV597qpq7LM1 mSmTDzqwaijpPS/Bzh5Tv7NrnHynQ0R0ve8HO7zuRNIFi5Y8InJ70Rw8B5CJVoPvx8MVvMHsC5Wq 1rjAoYFKJaH9LK64XFpXq0VSK0tJoeJPXDxR2VpUWZZVedMz8YCgOEBcKg4fALhkICAgICAgPgFw gICEdNCMyXRuODiU6ZlsGQe6CE7W2fbZ9odHNj1ILiXJ4oX3daZXYNg3tAjJj9SdNa6GOCAcIoX2 CltBoKWpBpvqglCCSnTprAYC0qE74Xc/FA+SOYBze9wwFextNdOWKkBq7hcKOPAlvQXKVLhfanXI ZC3eehhV6DjbkAaDokGg7cdFMM+4bg+dkTy6EzJhTOVuFwrFvYs2j3HsLYwE3VbhcKcn046lxsMj QtL70Ck+Mju5z4x8vRdojw7ed26x9vR5KpJCrK5eOz1HtGTDnPBfwj3UiUasM3ZubM57k71Sdosj sUTPgqF55KpUqkNK0CqAyLi80nNLEPmB9A+IiX70nQoURcAuFxjEOLDAtU+kK8KqtKSmKNMxdbUd pSV7xVprXFFV/KoYCAsFgqbjB7psYjBgwYMGD3TeYMcKbpubhmWDQXCtCW7y2d9ttr7XSEXqWLbz VERUTPSgpBwVU1rbcOAu+GFX1LnOp+p1HNg2ot8hkK4oVZL7lCA2gICdkELGDkvfgsYBs6yGQrci livcmVICsvohndNutw0F9HXZRixX7+4ULG4bZOm2LhoH5NyhkmYPJTnHbAYC24URiw6mxYLBRzky eR6ksngkXMkyDJ1U3r1vC7huEfalKm4dedtj28xP2audRzqXOPFhOSo53FDYUp+PBc6Fg+bmipsV PB6Bf3V9o+WPMDADSaSk1mQbgMw4gZiUtLcZSFK1Namta22MkQLUs7UklqYxE6uYq+GmTixStJ2a VbUuSrZ6qFuz8L4CAwFQgHDIYBwyDg4ODg4ODg4e8ICgiOqBwcBieQsFCc85fOc5d9hzPgtTJsGe nQiA4C0zgUsKnTGlmdCjnucTY2PVDLTVTo5OjNg5xtlbY2PeS9vcY9xMTkueXcc0gndVpbQaDFu5 vT1m83kdMCKyZA31BaFELUI8wuxRpttriWiTwsCwN5PWYHmeRPOb4mZET2roNAyCFPcdxpXveZcR KczW4XCuOMHqblC+tZnoRKRkMhT5Hc4ODk3NU1Zm2NTbk6Fy5Yg3FShv55PQcjqTFkWNzcqmAsOf Wg4exW7+PAwaIzfEWErWAj4OQNmt0B3h7fzrmwVujt748dvSh4colZPaVksy+GRkUr4GScmkpQey Ab3ingZFxZ2NAg0CDM7kxpWi8EgsgF6gV6qwQbKObbGuG+Jnh4Wg8tvYBVFYUPEB6vH94er1usz3 bN0GY8+mUESbz9brsb62+q2pQpcn6J+N5YE9OPwT8EF06SI82+m2Pi5sjyXxoZQCaqVEDXKcDWwd ZRqyia2EeTbrjVJ2IMu7EKJE5eZq2Hm+5h7XzZHlYHZKTYvUfk1Sk9UDVlfbokb2tzeP0Wztegsq pOEZVOeWelldZ/k5SW7ftaby1ZfN0rVkFODObE7bjf9r9HkM83jORjKBkH7DZowjRFgs0lawCjIf YNRPmO+Z+/uoC7JIavg3xUGMG0YTkRR1Nk0YXvULfTVnsZ2W6vXELw+eKvhS6xeV+11uXZdv+kRu MqUhT3INKtKayWpRs1gfzycT6qy/q/jKyy78NaC/R3rYk9Q+KvH3ClbDt5z/gnlk+ZMIpR/qYgzN +Ws/RC0Bsy9n/fhOuTFc873owPzPEejWDmOsjjy7ljHvI0gN5uASu+RaCrmGvc+EC54bt3RodjeX Jy9Cu0UFBYiiMRGCKJFOlSxZSxEVBkgKw8MCW92X6NaCy37Ss0nUA5o9P1IRTA5QC9F5aGJe6jpH UpHCWTwuEleSJ0C+gFayQCfNl9rNYVk9JLrNIAFA/jH15bYKrWjW2lLt557E9iagfpVP1C83mfgY f33ImOP/wPmKn25/4ss3uZ/iJYtmaucql4mI/RqAPjmp/tnHQ5kiH4A2yQmeiofN6X0ejJrIKp3k rEAVIpgkNZ+rmOUn/P1OmIdRALJCFQ/EgwSfWkOY+goegfWVIeaBzf1nsTqk6X+9Nx9Y3DfVYDfz kEIqTcEgaSv8zm5vwiDiMmP+VCqDiM+mEOmdLKbhKcUr83izjFMYMxwXfOrwTtzuASGgTPmbUBgE +A6MIIEoUcy54n+is/AM0r9rsDI7ALzNBWQsysWNbPdvmPRMbtWcHH+gnLeSQ88k/n00m74Slpo+ hqcCSHJpHg7PGJngSM2k7EKJroNCJudp7O+x4zYnE7puOKypFpI6JO5bcNw4b08VKi3jNno00Axd GgbW1mb4kX0/l0JCB4oTwNCkFIlL2RndxHA2bABVCihRMAoqAQU5lOcEdHXMrTJLwNn99y1CVo5N BZ2D4CAZIsY3nSnQa2NygJeAIHUgbCVEN6ZTFm5o4AcObAOEOmdbgYgXIqdJmB3TM1I5y7lFTz2w TokjvL+nfwdCkaPj/HZ8lLXXub/e/Mb4kTheB39zyag/z/10HjOwgQkiM6w3+oLHD156geDKnZ++ B2MLD8XdZiZAsziuvWkHWkGQJIOkyHeL84AFoLILUks44kEZV/yhnhXeYODkkfEb0PkFPKSSTRQp ae3xby/a3uXj5qe9U8VVqP1LWiSPFwhUZ+emdHYfaYcVjm+wpmzkhAoUU7keNlA5XgiC6zCxucdd UwvKbxAVq1lBUjA86GnAwIQO2gH5oODfnExcPEfTh0GoRkBKbA27CopPH/8LW5UA40NA88ExLCXC XairnYPYHqvQ5BIIgiERBRRViIKoCAzHxD42ouj4fgl4SfLO21ipJJy05wbQ25A3jSBZ5/grpC8u KwNeh1Lhi9cA6+WjcDEmrOJwWaMuZIAdOcHqR2qmRwYYBVvaH1o1wlSRHplWVRZ0mLlZSwkZWIdC 2OIVJLJkSpvSZZpLHdJA9gWb4bgM5rN0STFpZYeAvJZeUKefr7b2+vjPAzQxCdcEKcLpCqLUiUTi auohCEFKVOU5HkpGxSKUJSRQ6OnnukMzMixn7KSONUZHikZuKjKNIz9jgVr64ofCeFzsGDosNEa4 Gxd64ffA4+2niRDKq/EdV+9VBXKywunhLJ6USPMI6EQQQgpBVGMDrmCB4SSHdKQMokoO2bpkjt3U yUIPKptVChYx/FgVrcqr6XFtQGehW8NGfC2ziqhlg6mmGZLYSMOq6CWvbxUoSAsjgJUCdTWMqHBO gdbnoiSCWESj/vsutW+eyUn4ECyvyJjH75LD0memhVZuZ9zB14PupButkWsLm75oN2zitQbAZg8V AGAgu8QLAynK5lHmBW2b0B1C6WDZ0F7jO7XcnTAIdfAcJZME2gXVRCxYaAYWqIteGN0pMSQwQJuA 3x3NAQNbFK3EKviG2rauL1BPsD7SHg2kikUF+zX3qqCWPZc+0PvGL6fxxfcq399gejj9vpTqqL1K HCB8ORvgPYPJMaVQ8mPz2Q0PbIIQfuVcGQ/HlrK9DUouNtJXXpWoNekwb7rkUM7BOgS0F+lR9sLX e0oqnZx94N4Mv3A387fsBnZh5Q8oHxRr8Hy1SX2D9kokEiF42YFw2xtRKRXsql6RYOVi+RIWwan8 4xK54VfoauG4PUJpvIoxFuYdF64ZkOM4IybUoutE0lrhquJKXGkmbQWMHPfYjCtTsqK5qKkig3V+ A4ZOpaZXUVn+LcXrhmqNklzuYDORQNJKFKMiJlOSlWVSTEbECkEiwpwsxJMBJ+mG/M/QfC6MEQPp IYy7o3EGqDajq6dqNu7WEvFJgnCj1Tn3yHPnnmxOblCgZ56jFjERHYu+MCaPUG3aFJJZQctGJtVw TTkGqgTEagw/rhzEmhhhutE4QLJGICSIIhLBDOTf3dDn22EpzgkoKxaRZApcC4EwqoxmLFqNRVsK 120nNOgmnOZQmjbjQtFJyGUJ65aNZvmEqJqdUprTflGEfzJ8O68a0zhbcZRzXd3bvNuCO6plqxTP HmNKFGMSDpTPvm0xuAhiHtDGMuI0ZGjGhA1/3fbZYxxIH8DE2Y4GMaqP9x8ewggTjn7i8/tGOBI4 r+4c9RacRjX7iZeaB9iByhsQdBkUPmbnmkFSBjBExbHAxMqVeDyqSfoHi8YHi2OT8escHBS3maWj 0KfVbZS6pQeahmPgWkM+Dc7PVNao8ZrfwrxRAdVtioBXGwxIG4Ykl+H97NtcPo/P+2U5MmoKhjpL Ac6iBA2FxvJYVhrMoCEwJdigb16hG/eA8fS7b2vxugFFIQYRAKE7XuyPNDShP+VZhRpVeqIWH6Q/ E+Q3/5pV1qat0tE7KEpOoKC76VMhy+C51pz/CqLkHJUklJRDxZAOyEDAlh5Qnhm7tc0veP5rUFTA KUgbDGosQg7UwyfruD4EbzDyQHC0tQjiE8jnEeuKh50QTE3gN7XpbiOTSBFaMQOmKjnE+9UjcPCX Dw4NjAYP+MNN4bNRLAfng3FdPWyagxgwic42CilKGxzYoZQT2hwSQUk2VjUzaSH0kQeakTNTDyfm nlcgTBEooEEoQ8KZVqIybnNFHsT6KPMpFXTIWAF5iB5QjfAvQEPU/NhIWC+ROsBB+P82079O3qV2 6Pxa5fIfBh/GmkgGo8T2ldfpKDznYdBGYeSsoXoXy2FbkXliGksWNJ3kPeax70bycHOU+LrN43HK b5Y2Yd2wTajxMxz7vbaUYd1VkbSwvY95pNZqMDOoFImUGJoJRL3XahazMvOxVlxC8vVSo6qj0m1e Q2f2LzTdMgxFBgoDIwWE3MLbAm0SYkDAd6cFfKIUP138jgPyePP635vn10y+laC2lvLkXkfP1nKQ 3iIb7VGT12KtSemIFYChaj0X5MGSevTyCHEnbngmITVipFgE8x8OT+lV+9AAZATJ6YheQCQIxb6f OfGi1e3ra28GNAG9+YufEwflO8Udx0nDmPa4dXTYeuZ4HsKhyJEYirzO49CY9Z7Cw9haeBpHMNnW cwRHAta4sXLsOl6iEkNhRPx0owhUI28VG4yFyQI1lp5iAGJuPXI9qj09I444zMDo4nEVJ6Y6jmqG GYt3j88ly3gqDuWsvMhXzvGKUws2sI8m4Ci9qQTlGnmp099TDDPsHlFHudX0NxqvSNJTwMon1yjc KBZwROHch6dndsDxHZJxF8BJA4647egLJZ278f93Dsa7Gt/tarJu4GDGifei9oNZg0J8pYVEENoA l7FhSJPlIh7/j6KmjjDxPpebnPxursYSMgSIyKm0kLphnnn1cZ7zzCdY12DWbfF1Yxk5YK/ZvtBe dCFpUEyRhC0IqQLkMFIGWPgmIErulgSwiEKCVWxFhwQCI1QVJmqAGt37fb87l7O6cESDFwPFvKVz izDT7ckMZYc7kwTzkSvwHPYWHeZB/YMdvLHKzK0wKyHsLz3F4xkes8PVZq4PNZXyqYcucvNuKxZh yeLZTPepJ5SFEMRI2scOGxIVJgxYYDF5gW5lB3TCBb7WvoTpkCYkMQQMSoUAlBYKMiKTYMcSBuMi PAD3nnQ6EyRqREXDEpKjgUywNzvc3I/BE73lODRo9DS3jUJ9ODyp+VTVbm8MHjXg38sSoq16YFf+ ref3EzewIk6zK3gtGJHZQB0Slj0zGBep9LwHJgcpQOR7H7H7gq5sz1iLcG2OxMpbDCG9XfkVxkuh PwVdigvjLixFC+QdUGpU1FTlOag1PW0p5nzdCq7nE9HTex0UpI30V2ZmDlCheY3rfNfMX5GsqF22 WLmt24oPL6uhvL8HIYL4jC/Gq9lw02+mPGU/UAeKIaEAO82emGjihrxrMtkVLgjBdkf79pLvMK8C YJG3vxCR/h1nmAsTK3UNaztayNOdXrLfS1ZctRI0pEwyWYi6AiYsDipvszBey4ZbKxB1oU0kENGq ADAYoZmWopeTTeQvFXaXSicdCBeGmgnHTUSXSU2WF4UpFJ9DolZ2GtRMBUm2Rqlo6PqVUKF+UqDb HMc243LYKpRsLwbJK8tsXeo0pVdPoqUMsMjsOY11EDIgUUFtBhlFmnBAwOyDUIomguImThKGg56u NuDZNpnOJI9ktMSmlOG03YmVE21ub6iQxBeoCyhShAKGzInZF9VQnF4uRxeFWfVdrx4PprPTPYWN 6sJnm9nq0lCiNYNMc8pD0Dd2oKL40eyOexurk+Pkfj24kLarN7z9JJb1W5vPyLAmcDkZlipkWD6z TSOQKixqxOHPDekm7qaN0IwOW66AVuog9aDxFIStDkXoiOUHArnAoBhqpHNEsOFqjYyCCD39paS4 pa9i2Bb1IpQhW4lUY4JSgiisyOo2nlVhp7nawZOqRxzVY8s8z64hV/tTebeOZK46iJEwKULE+x16 xaUW71H8+LoC8budJ2QllyCPcd5PC2jmovBRH1MWUOSofkxIp0vBQYhRT0aUDTF2Tj4pi8A5a8m2 bUiySsk1PdQZUpey1r1aXa58EWXSwTCPaOHaOc8Je0TNVOrDv7+fqpVf9L6VT8u1uhzSlc0CCFzP TIF5ygpiWC8TEDscjc+RDgeNxHnG/M+R9DzXpqZsfPwkOnwdfad3t3sATs+FCB6pPOpEivxylQFN pU9ta2GJAJJJErIQU0A8oPHxdv/DH3fTR1+RxePEqPUCRakSEEhBAtGkEaHO2D0xH9l5LhD+ZwEK RlxwdWYJDjhRuoXtwq+Rcj2Z5Hg2F8iThMD4ur9iHvIQ/TpAIkEXEOkG9A0RQkFiDEK7WgCVUUD3 LwQEb9GdB6h4kO8l5m6WCAexlEGW7cxAhTq3l7EoeSBMZ1IO0oSasgt3LiioCqoEmV3iHT3ptpsG l2wNsahg4gDCFMAgzd+kLd9ktGu0NzUy+hMzvhtKkk3x2uP6EQpKUi38nq5OQklIrZOFzpxg1OYV q4V7Bwm7Hz7s36+3ihXV4as2FevvvSdLrCyQmVrKds+eUdvvowG8sFMXYX6bmvA4ABuOM0NBHrbR 39JWCAsGCy2SkWEZGQZBEIwZYt+R42jZUTINXVShXq+Je9H6dd0yy0ihkbpjii3CdZnrE96lVDym 0hC0wULtT3BCEeA93kaa9QmL6T7AlDaw+anUc1sOM0xEflLJ1KH9EVSJFGCEREL3j1OvgBPzNQCe sWtmKB2WVrJVw5wEY1JJVWXoyXpQcLeXriRo5R9+gfZdJILdy75nvvW1RGTVCla6lkvJUqosKAQU 9fge86D5ypgGArU4jMq2GIQhCwP5gCLnh9GgbVkIhIsAS4tsPvn2Ge4ShlLjgxuaugnKdS5QhKFD 1TJ/NLikzzBzA+Bzcciw6TPIkXKli55jp9wmQPVQUJVNxWaT4xNUQJWD/Qt5YZkzSaiJgVZmGhQl MY920R0GRce5sKl4cRRXS9O4dRU4WveTYIxFdbBD9uIfKj1jx+/lCR66pR/fQrM4+cp9qDlh30ZK EZCEtkYw+PCJbyoONkGqD6WKz0v6KSWpb7ZysLo5ARa6aFXW6a2PLfUOx53vKI7+Spce2fOQD7Bg AaTey0xsbsjxr788KEw1iV3yBVg2JDdT2l6nV0Ie52OWBza6tUhISQPkb3qPIfS97mQ5A9Lzd3GA wiloJSsNgG2y8ixLyR6DVHA9JleGDjRM70+LmfWPj85gZOUBiJYo0SCEBYjwhmeYop93084SyW0Y y9SZDq4TLBbk9tKR3qtV7SrkxV0offh63b8XNyNuF0IYfm9QeHfsIYGz8Zmd9zY+zLBUDzc43vrM DLwR53S9Q/M+o9UR7o9xSkKyhJuI0QMphmLhxkA9AyBiQmKhNMEDKWfuSg8Dk3IdrofY3ghkxzZq c1QR3v1/4FE93CTzlX/X/GpazdCp0m50LpEAtdVWIecPKVFfwwiiIqyKsUiJFILFgI+KHj1xHayb wVv6P0U9siUoNiMpDocM97R9xblQsBa4xgxD2uDsanveo1jozbCj7WugcVnpq+tsvfO5DQxwDOKN GzpbPyAK+0sjDSzNSuyZxR5H2Dm0NzgZBShymZ9bYSvKE1FBoMBqpWLRT8oPnbvTwh5hfUJtggGg z/bpFVOfX/Vgfh7qMVQg1gLhi+t3QxqwVK/XaHuYZmGE/fpyx5TDfoxDCpi0bfx9VkO5DfwkJyhb L8Ws1vY1LLifWcVDiMH7pxhgqvA+c+gTT1JEHCIC1j+6AvVHXl5ky0YtigmhUIPXrD85TramEUkA MSqjT4mTx3DcHDqPcZ89DkBzww+4pOBJW4ztD0XnCnKyykWgt9TR8yH5jj2MzLyyOXn0m7atvuQ6 icM4Q+fooicGE4wMiTdrkegee2Rqd56qS+JlVk8bBe6ltJQ8gMqdYXND1WRxmGSiWURYIz72MYA0 EoUg2IP2EdMe1ntSiGyo44a81tzuYAyBIxBhIo82K98PI8pB9rft972eYmbQAZ2MQgEGcXKU3dny G05gyRdwSgc6XD7gqDAqPeOZDUTfkGBzxt/PKWF9IUqNRoVatZYuUF3hOKXX+3mu4d0fBEaqk1R1 wTCeNK0JnqiOX1ujFbxzoWCdWnvXyFoF29ZgVQ4/Ytw/F3bwe2boiSAJSCUHphRAk3Nyfjfwz8Du bjzNfSKP5I5Pc+rlxufk9Z5nWXuXS0r+vcdi+P9Lo4seLeMDohH+aUClecfBeBhgal869C5v6G21 wT5rdWIP3mzf5/L8lu3W5kzpHnfL44mDhHznhRQxrxnYjZUtBTjTVC4kNUaSSrTklPbZqQWGCGZ8 7mB7Z7uDVMQYnvbtZNGMVBZF+Jvo79MzIjwYVGALAFhsU4RmIRCKS4KKHS8z8fI9bV3i8F3YH2Zv aP2XPK8qsnu+GazfrpPTnszBq+6PjsshSeSjRCrYUK1YwpQR+y5wseMuF9uQE2smNJtiRi4PmWex 0j3sFyY5qPA3mJPuaNDAI7C4ajE38goUyoqXCcX62eAeGBFI+ufwP20qaqPDjJCBJJgaGhvGvPHi dzxZH+kSVDcH36Ny8rSTvdtGCb05TzF6Y6QIzLOlDfmwHosKIqCJFiIxRSIMdrKQYbSAFBHlSVCC DFSrmFDcW9I52wqfwApRSkRTzvaJxwMaygEIJIBIqZnyVN1TeC+5HlM6jj1nhqbcng4uAb0b5dNJ /XNZKkgQh+Cgns47bS/dncAsDdrzqSESAfvYSc11KE/DBuinKQCxOd5dCmYfGfG/AC8hRmuSFxzh NOXMyPI1+753Nzu2mKUY3rUsAOQoj1qPQhDJTyOLXeYisFeby1ilqSY6y4SG2lNGSHIMWYzRxfK0 ZAUF5tLqJ65CkgXFBZFpEaIoRFY+h0ulzaHX5cRtAyDTm0WsIev8vHVW9xolf1JPIQq83nqmUKBI YpAz9YImIqw/o4BJ46A7va0I2BAPow72CqY51NOQsgWSER+nmJmPIEDIZwXoOsiPqNidUA7XVuh2 H3rReD67hmqGuYHxJg824oSPBEzHGpPj8Gz8zzHSJFm1iDYh+JobdzYfmXHhzckWMQZ2jyc5A6AY ACJDjqhzwMExoDQDTpOQRwozle8yfq7m8zIeSgOKoa4NxijqLmOg1nxRzB0QbhC+B6AvgLIAVgj2 Bigm0RvUpBNBSOpGjssBViuiGcuL3trV4ODq9pckn5a07eUlahgwcywF/ol4hpFpVDkjjqFp1jdT 5NB6kDO5BoJ+337x1yJhalNAcYKf05KkUMu2mHEyZEiSqqogJGokFQBQDL7QNOhDSNwiCpWZXnDU hSg3HuqI1xKUCgTpFHZ0syxuRcCjGKLQNiJBCqmiUklSyGoR5NWbnKZtyllLVaE4yRdMVk9a9xfK wzYpLABLMCrI2I0lYSTx2zEzIYl1WlQqEIJ0FFaRAqrtpHQJwXHA3CJSCIMBiIIBuNiXA2SAdVs4 SWJBYBHTEKM9D1NcE+86Xi1O+JWiHhArw/OXhH5u9ccF4oXkWa+Y4oWKc0gdLEWQFNwJieWY96e7 LAmRmhRfEWxjO60SHgSSjJAxpTEEgyZtMkZYAx0MYMFlsiy2QwrKmAYESIGhUgWkg6ksLEZADWdY UYdpBD8L6rO+onoY+HumU87qGD7aT5UzNILaVp7iHDS7QcpvZvzZ5WWxRbQ53YHPtAOh8Lu/nlfa NGsALQYRfoi/SZUe/mKDgzKI4kBjJQS0rIEXmOZva9D0nWjllkhNOJJ8zgfTvwHsMwdsuwM7gqBy gqPWl5gcGIfFiSffQeH3VQ+PbcR5rHj5R+mO0zLYF4ZMiKEg0JnUJGnSMw2yYfgwgQhIz5D1vWBk EHEi6xO2lCEGDkwhnIr2bCze36PPWiNs2SOSpGcaw2oSQbkW6OIRgwP059xP3n3ATONjH5xvQcbg hkG82L4S+PHj7OLDNAxWlVK8Sqk60wgj7ohlF+6wjHgjaEi3X6w4abVVhPmUAgM155Z7a7pRvx+l j2ufty19+lrRrc7yT7XEZxEhb1O5fU3qYF+0HmiPcxSBAUCEgLAhBhBIMRvhRirXMN0GRkd6qPZA 5IBl+gjzRQkH+1vF5CZlnA5sjdf69Tvdnr87/ezzgmkNEN5N08OMTrGjviSARhBCIx4OKA5A720M hvr7PoLdTbjzNEmT/Zs/hjOG4D+uiXY0bKi8o81PZe/Pd9RpShASUSB2lQLi5uDvj+lIda/PNcbQ DIQDlN2CEyIUomSHOew+UCoyQtgFYo/E9wUf3WgtPZaSoPy7K0qsV/b9fs4M+znOmusX3G8DcYFt frdPfz9Ot0ogodFnp9qQDHuZgRkJga1LiQsg+Ur/T0vEmIj9j0C8rB7oP1BE8npEovdt6aO1XLWE 96OlTvftKZa/g+dD5X5XebzAdE+6QOBkmxY2puKJtTup+QrcQOfj3q1hL3VDuJrTX51cwDEfNTSQ O2B1QrBiRghWonHrY9MT8xEO2meuzU5HQfwSIevWA/Y4uYIn75xppp9cejYSUvleJ33Ydbrfn7Xm av3383SSB+JicLg/1bUdbhehS8s/le97T63wdPiAkIqmd1vo0ox+R1PGFdfYfVZlUodcjGQjCJIJ PCUYMkAYQf8yPvItWKfm8/otSlAjH558H6K2wfzl5q+7wniPJYTiFh4AEGECAQKKSMYgqKIokfI1 SJFgzFpFC0lQUmUwBiiCspIhCpQfV4yzMkWOpnRycjXsj0zv9T73V3PvL0ugOmEkmwIQYiGhINhc LFQLJCJ+d9rgoBaAsEuUTUMBFjE9Z28icYSvAaXwbzLGJgSTQgYO6HGwGLIE9OWaJhBVY4xWOBGo 0k1aIQvSn5aebh8vcnn86x3W2pDpPcpLh6Tl0c/RjafKT3yF3rGeV8loccX60Pq/TTm2hxONtIbL 0RraU3NPHVKOEshGPtSlhhIP30muWfJ8aiOI+UgZwZIkYiEGJCa+0dVRPK4PH3qr06Sjv58wFv1E Smiwdg5Mi3HO+z5yzg6zGpdEK7UY/Ow0oF/3EaadCHSCvGzxI8RaHy8wJzV8f7HDxasYYBmEJmYY EkQfYRGQGk1cLN5NBwNNwu+/tiBxFbDvkErFxWIxbqByBYUpCpASkFpFEoxRQkZBJBGkr9DcB4ur AfsdBsKFUKthib/sZQZBXvEhb5jj01WxJjTl7umNEMQ4tiwW4M2/im1oHdZF7QYOkrYCD3BtEJRh urGSkLQ5A6YEg7jkpwDObupuhGKaNa3BzYGsjQWawdJYkVWsNRvAbFihQQSuMnW7oJUDrI5H9r3N ZICOtZPJh2BTuSkD8fu1iu7nHuVVtjq7reUJleoPROg6CReu2R3IWMUyMuu4BVp4KQ5I0MDtfFBr hJhW9iBIJcSzoIixGBWZE07YG4f1IHuw4dc3FKJQuTyLVlXAk8LZA0k4ebWJDYDJW06WFJpa0iQJ NEGQEW/k1/y9ycVN6tjWImlDS72YJnqB1mUFi9rF48aEGmM8qMRPHDh5KgIggtvIOfI4CJ9W7MGS uNM2jDu1axHz5nE4mdJX05Wd8HeV4nwp0Z9mQq4wfKXZWQuHgAcI+ij+aPrXAafd8rr/XfQhC66e unz2epVcqMMG/WPDvsNe2l57AOjmOmxUJyGIud3oqaUHhbFnHBbrOp0Yaa3nuvSmLeC/sOVcxcyR GRIyEQCfpnOz+aL/bCsHmIep8PMncU71DugHkwdLg0A338go8FHHuLmxKmLRd9IemFWUjSSIftlY 1TiCFZVDvuCuc5YejSsQYGcUaeQO1QLmXCea++aNrW11mhXu2fa3XUrcbGug7TUejGE4TQl3FNjE r+em/7eQDVmWMkQ1dOEvuxDU8skPK+S222222222222222tttttvYPPAS8CD+WQbGUSMhpt0XYkM ssuMYmLZdA5kmx0gnkkGQnuWen3czyNcW0fAaRlwnquJm64DGDGhLMoIwEZlgg4UWMWBlmrpBUhm aAyUJEiI0U1UZCxKHiIbc/y3l5ljA/bUlaJozuc3iTfZuTbaou3Z8Je/CUm1RuI1s+60WD7gUz4O A7RxIfIXm0uYemhooz5ZjBunxbihYgi+MTHQWiiqPtF1KFCh2SQqv2hFlYURltVGhfI54yBkoDQW igmoVDKc1pYqiEEgqCqMBYcpYyaiwBSAH6FGoGcs544gAiBNNScmmBRDXjjjtSzWrPV33GpzUQN+ cIqaLXNPFbeXUq1AVOA9CwFgDKbChQDETbamfMcZimKahdG7kMqbNykpjBikogbIYQlSCbEgFyiw KRDRN5Z52GHiTogytIUEAyjigwaSdQsPUkqpgoHBAsI8AsDI6LN/FIsBvkxqabHPjHK7yqzVLuxG M0jcXLi0WMYo0oDNJiHgQ6iQgfKeC6rl71BYr61Wrc8LYaYDwdiQO6JMnGgEGqVo2OCwV3jReu9n qU3ZOARWqUG8F7bVyQbFXKihViVVHCSEWDgMKqVQoiNSza8xo3DkoNEvDMGAEVDhDe0Q7ocM9BYK fvj3Q80deS/oLi66hJmoedvKe7W60SrqSxOrF0gkzqftUCeWtMlipg6eCeAMDcn980YTzzZLTCDF qT8CrhUVKykExmI9UVKe6YobrT8ZVVYcNmbcA3tDzCak2tou+Z3GIRccUNU1pICUFejPX61BUCya DDocTnirTaKQiG0l7mGGySrdMbegIpY4Cl0EGa9Tpz7YBAkSSJFpHlqC1QfzoUUaBiKdXGZ6x9VB XklYAPNxGJKrhdSjoQ72r7pR/3I45cbvYiWEOrsSeAOHbTrPKTXZB79NlRDf6OGTRERcIWHC2Lgd pKsUwGId5/DsENMTovMBD+wBITYmZSiQUJWB3UDCRQqd5knX3GdjoBDpDQqVWXIhbejsSewd0hGA 09+3IF3D+6jwbXSbSPpa7Dzuv1P4chPBM6uMKkiBwxVYd6WstG3u80syZoToQ44AlErFHZcHV7XA vmawhfAPOhr+R13+AJnNDF08oj3XhxsHtd687aLP6+5zPKjue5v4XI+n9dwS4LMuBDr60DJU9Oz6 T8vl2a052fvIEmUGB2GiDzxc7h0iN87yypJVCqkIqkd9Ih0PqaJWxBKJBiv/QiKkEij9TwEUHd79 iP4XetnHGan1+af1VD8PcsrvtFkVpxu3efNqkk0rVPZiMhkfbTeAMPBVH/KSDtHQch27/9mYzBqD 9cJAkkA2CoWfk9/yPv1FzH7xQo/ApiiQietPc+NNR7nOXpV3rxDmF/o4a/1aAMzEzhA9Kvq9zU6Y dGjvdhixgUlGSOajazYjKv4XxdF+AXHCj9PW/A+j6NYPoIDD4lDseH2ukTjT78OvcyGNaHwmFqEE 1GJ7n4tDfgyBZp0eh8rYzPA4YJmCXb79bmzuFzeYNmxS2QLPFsgZO+755D6svokkhhGnZXZrPz7X U6Cm8+B8OxwOt4eBJAkJAhGb+c/BbufkFHkav4HxHIDiOpCMva+dsCUD6txyWTsiSSB9bEvgLkrn F6CKMlIiGS6N5AXNra3OwSFWGbJAlvPoW1c1xVW1SuWgsTclYK3p5AbWdlANwQdEAImTc6HU5FGH kHYl6GJiRZAMwZoilCitzUON9PVcXw8Xkf0PCdbbezu2OKeo8tWz0BcQGYMRGgRdnAbuEOF84THh dbUyJjao2DMFYgTZa2iyqI5jyPWks2QsVuZTCAVBV054u6bRHemNwZJi0BGbrXJYDFu3endcg6hw L4SGEP4vlR0qVGhFKUAslRaXaBrINhLLQR4jJ5Xq1lHJUe12j0O9nzonM6HOGcvATzmTgi9cAdkB oRhEIRRMwAbDpewe9vc7g3ONpTrPI9bqfI7nscAAyYAWtgS4LRaaRclIDHctqMg3i6lQqs1xWh6X lY8G8/k5xXwU+kP1ft9CpdAloP+3+J+7OT/03Bx3QCrJ+xgXfbzSYnNzaSZDSgKgM//F3JFOFCQB 8kT6gA== --===============5232765826283828807==--